Cod sursa(job #1122042)
Utilizator | Data | 25 februarie 2014 15:33:01 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid.out");
long long int gcd(long long int a, long long int b)
{
if(!b) return a;
return gcd(b, a % b);
}
int main()
{
int n;
in >> n;
for(long long int i = 0, a, b; i < n; i++)
{
in >> a >> b;
oout << gcd(a,b) << '\n';
}
return 0;
}