Cod sursa(job #1975854)
Utilizator | Data | 2 mai 2017 11:49:36 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a, int b)
{
if(!b)return a;
else return cmmdc(b, a%b);
}
int main()
{
int x, y, t;
f>>t;
while(t)
{
f>>x>>y;
g<<cmmdc(x, y)<<'\n';
t--;
}
f.close();
g.close();
return 0;
}