Cod sursa(job #1740827)
| Utilizator | Data | 12 august 2016 12:46:22 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <stdio.h>
#include <stdlib.h>
int Euclid (int a ,int b )
{
int r;
if(b==0)
return a;
Euclid(b,a%b);
}
int main()
{
FILE *open,*close;
int n , i , j , k;
open = freopen("euclid2.in","r+",stdin);
close = freopen("euclid2.out","w+",stdout);
scanf("%i",&n);
for(k=0;k<n;k++)
{
scanf("%i %i",&i,&j);
if(i<j)
printf("%i\n",Euclid(j,i));
else
printf("%i\n",Euclid(i,j));
}
fclose(open);
fclose(close);
return 0;
}
