Cod sursa(job #1686113)
Utilizator | Data | 12 aprilie 2016 08:25:28 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <stdio.h>
using namespace std;
int n,a,b;
int gcd(int a,int b)
{
if (b==0) return a; else
return gcd(b,a%b);
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%d",&n);
for (int i=1;i<=n;i++) {
scanf("%d %d",&a,&b);
printf("%d\n",gcd(a,b));
}
return 0;
}