A9296 | Fox and Number Game
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Fox Ciel is playing a game with numbers now.
Ciel has $n$ positive integers: $x_{1}$ , $x_{2}$ , ..., $x_{n}$ . She can do the following operation as many times as needed: select two different indexes $i$ and $j$ such that $x_{i}$ > $x_{j}$ hold, and then apply assignment $x_{i}$ = $x_{i}$ - $x_{j}$ . The goal is to make the sum of all numbers as small as possible.
Please help Ciel to find this minimal sum.
Ciel has $n$ positive integers: $x_{1}$ , $x_{2}$ , ..., $x_{n}$ . She can do the following operation as many times as needed: select two different indexes $i$ and $j$ such that $x_{i}$ > $x_{j}$ hold, and then apply assignment $x_{i}$ = $x_{i}$ - $x_{j}$ . The goal is to make the sum of all numbers as small as possible.
Please help Ciel to find this minimal sum.
输入格式
The first line contains an integer $n$ ( $2<=n<=100$ ). Then the second line contains $n$ integers: $x_{1}$ , $x_{2}$ , ..., $x_{n}$ ( $1<=x_{i}<=100$ ).
输出格式
Output a single integer — the required minimal sum.
输入输出样例
输入 #1
2 1 2
输出 #1
2
输入 #2
3 2 4 6
输出 #2
6
输入 #3
2 12 18
输出 #3
12
输入 #4
5 45 12 27 30 18
输出 #4
15
In the first example the optimal way is to do the assignment: $x_{2}$ = $x_{2}$ - $x_{1}$ .
In the second example the optimal sequence of operations is: $x_{3}$ = $x_{3}$ - $x_{2}$ , $x_{2}$ = $x_{2}$ - $x_{1}$ .
In the second example the optimal sequence of operations is: $x_{3}$ = $x_{3}$ - $x_{2}$ , $x_{2}$ = $x_{2}$ - $x_{1}$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted