Cod sursa(job #1341805)
Utilizator | Data | 13 februarie 2015 09:08:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b)
{
if(b==0)
return a;
return gcd(b, a%b);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
int a, b, t;
scanf("%d", &t);
for(int i=1;i<=t;i++)
{
scanf("%d %d", &a, &b);
printf("%d\n", gcd(a, b));
}
return 0;
}