Cod sursa(job #798183)
| Utilizator | Data | 15 octombrie 2012 21:10:06 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
long gcd(long a, long b)
{
if(!b)
return a;
return gcd(b, a%b);
}
int main()
{
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
long i, t, a, b, d;
f>>t;
for(i=1; i<=t; i++)
{
f>>a;
f>>b;
d=gcd(a, b);
g<<d<<endl;
}
f.close();
g.close();
return 0;
}
