Cod sursa(job #1770766)
Utilizator | Data | 4 octombrie 2016 20:20:57 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in") ;
ofstream g("euclid2.out") ;
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main()
{
int n ;
f >> n ;
for ( int i = 1 ; i <= n ; i ++ )
{
int a , b ;
f >> a >> b ;
g << gcd(a,b) << endl ;
}
return 0;
}