Cod sursa(job #2547985)
| Utilizator | Data | 15 februarie 2020 22:29:45 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | c-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <stdio.h>
#include <stdlib.h>
int cmmdc(int a, int b)
{
while(a != b)
{
if(a > b)
{
a = a-b;
}
else
{
b = b-a;
}
}
return a;
}
int main()
{
FILE *fin = fopen("euclid2.in","r"), *fout = fopen("euclid2.out","w");
int n;
fscanf(fin,"%d",&n);
int a, b;
for(int i = 1; i <= n; i++)
{
fscanf(fin,"%d %d", &a, &b);
fprintf(fout,"%d\n",cmmdc(a,b));
}
fclose(fin);
fclose(fout);
return 0;
}
