Cod sursa(job #735455)
| Utilizator | Data | 16 aprilie 2012 15:13:11 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <cstdlib>
using namespace std;
inline int gcd(int x, int y)
{
int r=y;
while( r )
{
r=x%y;
x=y;
y=r;
}
return x;
}
int main()
{
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;
}
