Cod sursa(job #1364083)
| Utilizator | Data | 27 februarie 2015 14:05:05 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
using namespace std;
int _gcd(int a,int b){
if(!b)
return a;
return _gcd(b,a%b);
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
int N,a,b;
scanf("%d",&N);
for(int i = 1; i <= N; ++i)
{
scanf("%d%d",&a,&b);
printf("%d\n",_gcd(a,b));
}
return 0;
}
