A. Fox and Number Game

A. Fox and Number Game
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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 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.

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

My Answer Code:

/*
	Author:Albert Tesla Wizard
	Time:2020/12/8 16:00
*/
#include<bits/stdc++.h>
using namespace std;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    vector<int>a(n);
    for(int i=0;i<n;i++)cin>>a[i];
    int Min=*min_element(a.begin(),a.end());
    int dmax=1,flag,j;
    //找这n个元素的最大公约数dmax
    for(j=2;j<=Min;j++)
    {
        flag=1;
        for(int i=0;i<n;i++)
    {
        if(a[i]%j!=0){flag=0;break;}
    }
        if(flag)dmax=j;
    }
    cout<<dmax*n<<'\n';
    return 0;
}