Cod sursa(job #243495)
| Utilizator |  Boghiu Marius Cristian boghiu.marius |
Data | 13 ianuarie 2009 12:50:04 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream.h>
ifstream f("euclid2.in");
ofstream g("euclid2.out");
using namespace std;
long euclid(int a,int b)
{ if (b==0)return a;
else euclid(b,a%b);
}
void main()
{long t,a,b;
f>>t;
for (int i=1;i<=t;i++)
{f>>a>>b;
g<<euclid(a,b)<<endl;
} f.close();g.close();}