Cod sursa(job #973845)
Utilizator | Data | 15 iulie 2013 19:18:13 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 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)
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
in>>T;
for (; T; --T)
{
in>>A>>B;
out<<gcd(A,B)<<"\n";
}
return 0;
}