Cod sursa(job #1415460)
Utilizator | Data | 4 aprilie 2015 17:39:21 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main()
{
int t,a,b;
ifstream f("euclid2.in");
f>>t;
ostream g("euclid.out");
for(;t;t--){
f>>a>>b;
g<<gcd(a,b);
}
return 0;
}