Cod sursa(job #1332881)
Utilizator | Data | 2 februarie 2015 15:44:49 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#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)
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
in>>T;
for (; T; --T)
{
in>>A>>B;
out<<(gcd(A,B))<<endl;
}
return 0;
}