Cod sursa(job #364456)
Utilizator | Data | 15 noiembrie 2009 20:00:34 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream.h>
int gcd(long int a,long int b){
if(!b) return a;
return gcd(b, a%b);
}
int main(){
long int a,b,t;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin>>t;
for(;t>0;t--){
fin>>a,b;
fout<<gcd(a,b)<<endl;
}
}