389-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 iand j such 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.

Sample test(s)

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.

题意:  输入一组数据,大数减小数,使最终的和最小

其实就是使得各个数相等即可...

开始用了循环..排序..直至各个数相等..但是超时了....其实想一想 最后相等的数其实就是原来各个数的最大公约数..

MY CODE:

#include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define N 105

int main()
{
    int a[N],n;
   int maxgongyue(int nn,int m);
    scanf("%d",&n);
    getchar();
    for(int i=0;i<n;i++)
        scanf("%d",&a[i]);
    for(int i=0;i<n-1;i++)
    {
        a[i+1]=maxgongyue(a[i],a[i+1]);
    }
    printf("%d\n",a[n-1]*n);
    return 0;
}
int maxgongyue(int nn,int m)
{
    if(m==0)return nn;
    return maxgongyue(m,nn%m);
}