Cod sursa(job #2069956)
Utilizator | Data | 19 noiembrie 2017 00:17:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <stdio.h>
using namespace std;
int a,b,n;
int divide(int x, int y){
if(y==0) return x;
return divide(y, x%y);
}
int main()
{
freopen("euclid.in","r", stdin);
freopen("euclid.out","w",stdout);
scanf("%d", &n);
for(int i=1; i<=n;i++){
scanf("%d%d",&a,&b);
printf("%d\n",divide(a,b));
}
return 0;
}