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

时间:2023-03-09 16:58:50
Codeforces Round #228 (Div. 2)  A. Fox and Number Game
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric> using namespace std; int main(){
int n;
cin >> n;
vector<int> x(n,);
for(int i = ; i < n; ++ i ){
cin >> x[i];
}
bool flag = true;
while(flag){
flag = false;
sort(x.begin(),x.end());
for(int i = n - ; i >=; i -- ){
if(x[i]-x[i-] > ){
x[i]-=x[i-];
flag = true;
}
}
}
cout<<accumulate(x.begin(),x.end(),)<<endl;
return ;
}