Cod sursa(job #472149)
Utilizator | Ilie Teodor Danila ilie.danila | Data | 23 iulie 2010 09:54:12 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
int a,b,n,i;
int cmmdc( int a, int b)
{
if( a == b )
return a;
else if( a > b )
return cmmdc( a % b, b );
else
return cmmdc( b % a, a );
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f >> n;
for( i = 1; i <= n; i++)
{
f >> a >> b;
g << cmmdc( a, b ) << "\n";
}
f.close();
g.close();
return 0;
}