Cod sursa(job #540375)
| Utilizator |  Marius S bhaskru |
Data | 23 februarie 2011 22:02:28 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
int T, A, B;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main(void)
{
fin>>T;
for (; T; --T)
{fin>>A>>B;
fout<<gcd(A, B)<<endl;
}
return 0;
}