Cod sursa(job #875056)
Utilizator | Data | 9 februarie 2013 17:28:50 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<iostream>
#include<fstream>
using namespace std;
int cmmdc( int a, int b)
{
if( !b) return a;
return cmmdc(b,a%b);
}
int main()
{
int a,b,n;
ifstream f( "euclid.in" );
ofstream g( "euclid.out" );
f>>n;
for( int i=1;i<=n;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<endl;
}
f.close();
g.close();
return 0;
}