Cod sursa(job #163499)
Utilizator | Data | 22 martie 2008 14:04:46 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream.h>
int t,a,b;
int div(int a,int b)
{ if(!b) return a;
return div(b,a%b);
}
int main(void)
{ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin>>t;
while(t)
{ fin>>a>>b;
out<<div(a,b)<<endl;
t--;
}
return 0;
}