forked from nikhiljugale007/CodeForces
-
Notifications
You must be signed in to change notification settings - Fork 0
/
FoxAndNumberGame
61 lines (48 loc) · 1.2 KB
/
FoxAndNumberGame
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
//********nikhiljugale007**********//
#include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<set>
#include<iterator>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ll long long
#define v vector<ll int>
#define it iterator it
#define pb push_back
#define f(a,b) for(long long int i=a;i<b;i++)
#define fv(v) for(auto i=v.begin() ; i!=v.end();i++)
#define min min_element
#define max max_element
#define hell 1000000007
int main(){
fast;
#ifndef ONLINE_JUDGE
//Read input
freopen("input.txt","r",stdin);
//Write output
freopen("output.txt","w",stdout);
#endif
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
sort(arr,arr+n);
int smallest = arr[0];
int largest = arr[n-1];
while(smallest != largest){
int temp = arr[0];
for(int i = 0; i <n ;i++){
if(arr[i]>temp){
arr[i]-=temp;
}
}
sort(arr,arr+n);
smallest = arr[0];
largest = arr[n-1];
}
cout<<arr[0]*n<<endl;
}