Cod sursa(job #1019577)
Utilizator | Data | 31 octombrie 2013 15:49:34 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd( int a , int b ){
while ( b ){
int aux = b ;
b = a % b ;
a = aux ;
}
return a ;
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int a , b , n ;
f >> n ;
for( int i = 0 ; i < n ; i++ )
f >> a >> b ,
g << gcd( a , b ) << '\n' ;
return 0;
}