Cod sursa(job #758025)
Utilizator | Data | 14 iunie 2012 09:56:01 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<iostream>
#include<fstream>
using namespace std;
int gcd(int a, int b)
{
if(b == 0)
return a;
return gcd(b, a % b);
}
int main()
{
ifstream in ("euclid2.in");
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) << endl;
}
in.close();
out.close();
}