Cod sursa(job #489236)
Utilizator | Data | 1 octombrie 2010 20:59:06 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
int n,a,b;
int cmmdc(int a,int b)
{if(!b) return a;
else
return cmmdc(b,a%b);}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
for(int i=1;i<=n;i++)
{ f>>a>>b;
if(a>b)
g<<cmmdc(a,b)<<"\n";
else
g<<cmmdc(b,a)<<"\n";
}
f.close();
g.close();
return 0;
}