Codeforces Round #228 (Div. 2) A. Fox and Number Game

　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　A. Fox and Number Game
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Fox Ciel is playing a game with numbers now.

Ciel has n positive integers: x1, x2, ..., xn. She can do the following operation as many times as needed: select two different indexes i and jsuch that xi > xj hold, and then apply assignment xi = xi - xj. The goal is to make the sum of all numbers as small as possible.

Please help Ciel to find this minimal sum.

Input

The first line contains an integer n (2 ≤ n ≤ 100). Then the second line contains n integers: x1, x2, ..., xn (1 ≤ xi ≤ 100).

Output

Output a single integer — the required minimal sum.

Examples
input
2
1 2
output
2
input
3
2 4 6
output
6
input
2
12 18
output
12
input
5
45 12 27 30 18
output
15
Note

In the first example the optimal way is to do the assignment: x2 = x2 - x1.

In the second example the optimal sequence of operations is: x3 = x3 - x2, x2 = x2 - x1.

题意：给出n个数字，问任意2个数，如果ai>aj,那么ai=ai-aj。问最后最少总和是多少

思路：就是求最大公约数*n

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 
 4 int a[102];
 5 int main(){
 6     int n;
 7     cin>>n;
 8     for(int i=1;i<=n;i++) cin>>a[i];
 9     for(int i=2;i<=n;i++){
10         a[i]=__gcd(a[i],a[i-1]);
11     }
12     cout<<a[n]*n<<endl;
13 }

 

posted on 2017-06-30 15:51  hhhhx  阅读(182)  评论(0)  编辑  收藏  举报

导航