Cod sursa(job #1411762)
Utilizator | Data | 31 martie 2015 22:17:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std ;
ifstream f ("euclid2.in") ;
ofstream g ("euclid2.out") ;
int main ()
{
int n , a , b ;
f >> n ;
for ( int i = 1 ; i <= n ; ++i )
{
f >> a >> b ;
int r ;
while( b )
{
r = a % b ;
a = b ;
b = r ;
}
g << a << "\n" ;
}
f.close() ;
g.close() ;
return 0 ;
}