Cod sursa(job #255202)
Utilizator | Data | 8 februarie 2009 20:16:45 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream.h>
long n,x,y,i;
long euclid(long a, long b)
{
while(b)
{
long s=a%b;
a=b;b=s;
}
return a;
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
for(i=0;i<n;i++)
{
f>>x>>y;
g<<euclid(x,y)<<'\n';
}
return 0;
}