Cod sursa(job #1143259)
| Utilizator | Data | 15 martie 2014 10:49:27 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream is("euclid2.in");
ofstream os("euclid2.out");
int T, a, b;
int Euclid( int a, int b );
int main()
{
is >> T;
for ( int i = 0; i < T; i++ )
{
is >> a >> b;
os << Euclid( a, b );
os << '\n';
}
is.close();
os.close();
return 0;
}
int Euclid( int a, int b )
{
if ( !b ) return a;
return Euclid( b, a % b );
}
