Cod sursa(job #495941)
Utilizator | Data | 27 octombrie 2010 12:03:42 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream.h>
#include<math.h>
using namespace std;
long a, b, n;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int x, int y)
{
if(!y) 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();
return 0;
}