Cod sursa(job #1498652)
Utilizator | Data | 8 octombrie 2015 21:34:31 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int a, int b)
{
if(!b)
return a;
return gcd(b, a % b);
}
int n, i, a, b;
int main()
{
fin >> n;
for(i = 1 ; i <= n ; i++)
{
fin >> a >> b;
fout << gcd(a, b) << "\n";
}
}