Cod sursa(job #1465027)
Utilizator | Data | 26 iulie 2015 13:05:36 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
typedef long long i64;
i64 gcd( i64 x, i64 y ) {
if ( y==0 ) {
return x;
}
return gcd( y, x%y );
}
int main( ) {
int t;
fin>>t;
for ( int cnt= 1; cnt<=t; ++cnt ) {
i64 x, y;
fin>>x>>y;
fout<<gcd(x, y)<<"\n";
}
return 0;
}