Cod sursa(job #1743227)
Utilizator | Data | 17 august 2016 19:48:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n, a, b, i;
int gcd(int a, int b)
{
if (!b) return a;
return gcd( b, a % b );
}
int main()
{
fin >> n;
for (i = 1; i <= n; i++) {
fin >> a >> b;
fout << gcd(a, b) << endl;
}
return 0;
}