Cod sursa(job #308956)
Utilizator | Data | 29 aprilie 2009 09:16:15 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp | Status | done |
Runda | tot | Marime | 0.38 kb |
#include<fstream.h>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long a, b, n;
long cmmdc(int x, int y)
{
if(y==0) return x;
return cmmdc(y, x%y);
}
void citire()
{
f>>n;
for(int i=1;i<=n;i++)
{
f>>a>>b;
g<<cmmdc(a, b)<<endl;
}
}
int main()
{
citire();
f.close();
g.close();
return 0;
}