Cod sursa(job #1524459)
Utilizator | Data | 14 noiembrie 2015 09:36:28 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <stdio.h>
using namespace std;
int n,x,y,i;
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 (i=1;i<=n;i++) {
scanf("%d %d",&x,&y); printf("%d\n",gcd(x,y));
}
return 0;
}