Cod sursa(job #474238)
Utilizator | Data | 2 august 2010 23:37:47 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
int T, A, B;
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main(void)
{
fstream f("euclid2.in",ios::in);
fstream g("euclid2.out",ios::out);
f >> T;
for (; T; --T)
{
f >> A >> B;
g << gcd(A, B) << endl;
}
return 0;
}