Cod sursa(job #1692378)
| Utilizator | Data | 20 aprilie 2016 19:20:12 | |
|---|---|---|---|
| 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");
int n;
long int x,y;
int cmmdc( int a , int b )
{
if( b != 0 )
return cmmdc( b , a % b );
else
return a ;
}
int main()
{
fin >> n ;
for( int i = 0 ; i < n ; ++i )
{
fin >> x >> y ;
fout << cmmdc( x , y ) << '\n';
}
return 0;
}
