Pagini recente » Cod sursa (job #2413307) | Cod sursa (job #764410) | Diferente pentru problema/maxflow intre reviziile 19 si 20 | Cod sursa (job #3280388) | Cod sursa (job #332774)
Cod sursa(job #332774)
#include <fstream.h>
#include <iostream.h>
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int a[100000],b[100000],r,i,t;
f>>t;
for (i=0;i<t;i++)
f>>a[i]>>b[i];
f.close();
for (i=0;i<t;i++)
g<<gcd(a[i],b[i])<<endl;
g.close();
return 0;
}