Cod sursa(job #1203685)
Utilizator | Data | 1 iulie 2014 06:34:00 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
int euclid(int a,int b)
{
int r = a % b;
if(!r)
{
return b;
}
else
{
return euclid(b,r);
}
}
int main()
{
int t,a,b;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>t;
for(int i=0;i<t;++i)
{
f>>a>>b;
if(a>b)
{
g<<euclid(a,b)<<"\n";
}
else
{
g<<euclid(b,a)<<"\n";
}
}
return 0;
}