Cod sursa(job #964936)
Utilizator | Data | 22 iunie 2013 19:14:38 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
#include<iostream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int a, int b)
{
if(a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main()
{
int i, t, a, b;
fin >> t;
for(i = 0; i < t; i++)
{
fin >> a >> b;
fout << gcd(a, b) << endl;
}
return 0;
}