Pagini recente » Diferente pentru preoni-2007/runda-3/solutii intre reviziile 30 si 31 | Cod sursa (job #2017787) | Profil M@2Te4i | Monitorul de evaluare | Cod sursa (job #1569232)
#include<fstream>
#include<utility>
#define ll long long
#define s second
#define f first
using namespace std;
ifstream in ("euclid2.in");
ofstream out ("euclid2.out");
pair <ll,ll> v[100002];
int n;
int main(){
in>>n;
for(int i=0 ; i<n;i++)
in>>v[i].f>>v[i].s;
for(int i=0; i<n;i++)
while(v[i].s!=0 && v[i].f!=0)
if(v[i].f>v[i].s)
v[i].f%=v[i].s;
else
v[i].s%=v[i].f;
for(int i=0;i<n;i++)
out<<max(v[i].f,v[i].s);
out.close();
return 0;
}