Cod sursa(job #2040775)
Utilizator | Data | 16 octombrie 2017 15:29:35 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n, x, y;
int cmmdc(int a, int b)
{
if (b==0)
{
return a;
}
return cmmdc(b, a%b);
}
int main()
{
f >> n;
for (int i=0; i<n; ++i)
{
f >> x >> y;
g <<cmmdc(x,y)<<'\n';
}
return 0;
}