Cod sursa(job #653956)
Utilizator | Data | 29 decembrie 2011 12:24:37 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include <cstdlib>
using namespace std;
int gcd( int x, int y )
{
int r=y;
while( r )
{
r=x%y;
x=y;
y=r;
}
return x;
}
int main( void )
{
int T, x, y;
ifstream in( "euclid2.in" );
ofstream out( "euclid2.out" );
for( in>>T; T; --T )
{
in>>x>>y;
out<<gcd( x, y )<<'\n';
}
return EXIT_SUCCESS;
}