Cod sursa(job #3258212)
| Utilizator | Data | 21 noiembrie 2024 16:09:26 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | c-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <stdio.h>
#include <stdlib.h>
int cmmdc(int a, int b){
int aux;
if(b < a){
aux = a;
a = b;
b = aux;
}
if(b%a == 0){
return a;
}
int d = a/2;
while(d >= 1){
if(a%d == 0 && b%d == 0){
return d;
}
d--;
}
}
int main()
{
int a, b, i, n;
FILE *r, *w;
r = fopen("euclid2.in", "r");
w = fopen("euclid2.out", "w");
fscanf(r, "%d", &n);
for(i = 0; i < n; i++){
fscanf(r, "%d%d", &a, &b);
fprintf(w, "%d\n", cmmdc(a,b));
}
return 0;
}
