Cod sursa(job #1655173)
Utilizator | Data | 17 martie 2016 20:05:48 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
long long gcd(long long a,long long b)
{
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main()
{
ifstream q("euclid2.in");
ofstream w("euclid2.out");
long long t,x,y;
q >> t ;
for (long long i=1; i<=t; i++)
{
q >> x >> y;
w << gcd(x,y) << endl;
}
q.close();
w.close();
return 0;
}