Cod sursa(job #281491)
Utilizator | Nicula Bogdan SelfEsteem | Data | 15 martie 2009 09:03:15 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream.h>
#include<iostream.h>
#include<math.h>
int main()
{
unsigned long j,a,b,T,div,i,max;
ifstream f("euclid2.in");
f>>T;
ofstream g("euclid2.out");
for(i=1;i<=T;i++)
{f>>a>>b;
if(a<b)max=a;else max=b;
div=1;
for(j=1;j<=sqrt(max);j++)
{
if(a%j==0 && b%j==0){div=div*j;
a=a/j;b=b/j;
}
}
g<<div<<endl;
}
g.close();
f.close();
return 0;
}