Cod sursa(job #1467945)
Utilizator | Data | 5 august 2015 00:18:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
int cmmdc(int a,int b)
{
int r;
r=a%b;
if(r==0)
return b;
else
cmmdc(a,r);
}
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int t,i,a,b,r;
fin>>t;
for(i=1;i<=t;i++)
{fin>>a>>b;
fout<<cmmdc(a,b)<<endl;
}
return 0;
}