Cod sursa(job #724059)
| Utilizator | Data | 26 martie 2012 10:36:23 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream fi ( "euclid2.in" );
ofstream fo ( "euclid2.out" );
int t;
long long int a[100000][2];
int euclid( int a, int b )
{
if( !b )
return a;
return euclid ( b, a%b ) ;
}
int main() {
fi>>t;
int i;
for( i=1; i<= t; i++ )
{
fi>>a[i][1]>>a[i][2];
fo<<euclid ( a[i][1], a[i][2] )<<'\n';
}
fi.close();
fo.close();
}
