Cod sursa(job #1984870)
Utilizator | Data | 26 mai 2017 12:52:51 | |
---|---|---|---|
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");
long euclid(long x, long y)
{
if(!y)
return x;
else
return euclid(y, x % y);
}
int main()
{
long a, b, T;
f>>T;
while(T)
{
f>>a >>b;
g<<euclid(a,b)<<'\n';
T--;
}
return 0;
}