Cod sursa(job #1347314)
| Utilizator | Data | 18 februarie 2015 21:44:43 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long n,a,b;
long long gcd(long long a, long long b){
if(b == 0) return a;
else return gcd(b, a%b);
}
int main()
{
long long i;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
cin >> n;
for(i=1; i<=n; i++){
int d;
cin >> a >> b;
cout << gcd(a,b) << '\n';
}
return 0;
}
