Cod sursa(job #1592962)
Utilizator | Data | 8 februarie 2016 10:41:35 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <stdio.h>
#include <fstream>
int T, A, B;
using namespace std;
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int main(void)
{
for (; T; --T)
{
in>>A>>B;
out<<gcd(A,B);
out<<endl;
}
return 0;
}