Cod sursa(job #1426013)
Utilizator | Data | 28 aprilie 2015 19:47:22 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int a,b,n;
int cmmdc(int a, int b)
{
if(a%b==0)
{
return b;
}
else
{
return cmmdc(b, a%b);
}
}
int main()
{
f>>n;
for(int i=1; i<=n;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<endl;
}
return 0;
}