Cod sursa(job #581595)
Utilizator | Data | 14 aprilie 2011 13:05:43 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <cstdlib>
using namespace std;
inline int gcd( int a, int b )
{
if( 0 == b )
return a;
return gcd( b, a%b );
}
int main( void )
{
int T, a, b;
ifstream in( "euclid2.in" );
ofstream out( "euclid2.out" );
for( in>>T; T; --T )
{
in>>a>>b;
out<<gcd( a, b )<<'\n';
}
return EXIT_SUCCESS;
}