Cod sursa(job #701115)
| Utilizator | Data | 1 martie 2012 13:44:37 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <cstdlib>
using namespace std;
typedef unsigned int uint;
inline uint gcd( uint x, uint y )
{
uint r=y;
while( r )
{
r=x%y;
x=y;
y=r;
}
return x;
}
int main()
{
uint 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;
}