Cod sursa(job #265380)
| Utilizator |  Roti Andrei andreir |
Data | 23 februarie 2009 20:27:13 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream.h>
long int gcd(long int x,long int y)
{
if(y==0)
return x;
else
return gcd(y,x%y);
}
int main()
{
long int a,b,t;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin>>t;
while(t!=0)
{
fin>>a>>b;
fout<<gcd(a,b)<<endl;
t--;
}
return 0;
}