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