Cod sursa(job #758027)
Utilizator | Data | 14 iunie 2012 10:02:11 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<iostream>
#include<fstream>
int gcd(int a, int b)
{
if(!b)
return a;
return gcd(b, a % b);
}
int main()
{
std::ifstream in ("euclid2.in");
std::ofstream out ("euclid2.out");
int n, a, b;
in >> n;
for(int i=0; i<n; i++)
{
in >> a;
in >> b;
out << gcd(a, b) << std::endl;
}
in.close();
out.close();
}