Cod sursa(job #2576941)
Utilizator | Data | 7 martie 2020 16:45:50 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <stdio.h>
int divizor(int a, int b)
{
while(a!=b)
{
if(a>b)
a=a-b;
else
b=b-a;
}
return a;
}
int main()
{
FILE *f = fopen("euclid2.in","r");
FILE *g = fopen("euclid2.out","w");
int t,x,y;
fscanf(f,"%d",&t);
for(int i=0;i<t;i++)
{
fscanf(f,"%d",&x);
fscanf(f,"%d",&y);
fprintf(g,"%d",divizor(x,y));
}
return 0;
}