Cod sursa(job #610499)
Utilizator | Data | 27 august 2011 15:59:01 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream>
#include<fstream>
using namespace std;
int cmmdc(int a, int b)
{
if(a%b==0) return b;
else return cmmdc(b,a%b);
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long x,y,n,i;
f>>n;
for(i=1; i<=n; i++)
{
f>>x>>y;
g<<cmmdc(x,y)<<endl;
}
f.close();
g.close();
}