Cod sursa(job #2254294)
Utilizator | Data | 4 octombrie 2018 22:52:36 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#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 main()
{
int a, b, n;
fin >> n;
for(int i=1; i<=n; i++) {
fin >> a >> b;
fout << gcd(a, b) << endl;
}
return 0;
}