Cod sursa(job #1456420)
Utilizator | Data | 30 iunie 2015 17:48:10 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
int GCD(long long int a, long long int b)
{
if (!b)
return a;
return GCD(b, a%b);
}
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int n;
long long int a, b;
in >> n;
for (int i = 0; i < n; i++)
{
in >> a >> b;
out << GCD(a, b) << "\n";
}
return 0;
}