Cod sursa(job #515283)
Utilizator | Vlasceanu Razvan vlasceanu | Data | 20 decembrie 2010 22:19:47 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
int CMMDC(int , int );
int main(int argc, char *argv[])
{
ofstream fout; fout.open("euclid2.out");
ifstream fin; fin.open("euclid2.in");
int p,a,b;
fin>>p;
for(int i=0;i<p;i++)
{
fin>>a>>b;
fout<<CMMDC(a,b)<<endl;
}
fout.close();
fin.close();
return 0;
}
int CMMDC(int a, int b)
{
if (b==0) return a;
else return CMMDC(b,a%b);
}