Cod sursa(job #1472877)
Utilizator | Data | 17 august 2015 23:04:03 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std ;
ifstream fin("euclid2.in") ;
ofstream fout("euclid2.out") ;
int gcd(int a, int b)
{
if(b == 0)
return a ;
else return gcd(b, a % b) ;
}
int main()
{
int N, A, B ;
fin >> N ;
while(N --){
fin >> A >> B ;
fout << gcd(A, B) << '\n';
}
fin.close() ;
fout.close() ;
return 0 ;
}