int main(){ long long a, b; fin >> a >> b; fout << cmmdc(a, b); fin.close(); fout.close(); return 0; }
int main() { int a, b; scanf("%d %d", &a, &b); printf("%d\n", cmmdc(a,b)); return 0; }
int main () { FILE *f,*g; int n,x,y; f=fopen("euclid2.in", "r"); g=fopen("euclid2.out", "w"); fscanf(f, "%d", &n); for (; n>=1; n--) { fscanf(f, "%d %d", &x,&y); fprintf(g, "%d\n", cmmdc(x,y)); } fclose(f); fclose(g); return 0; }
int main () { unsigned int n[6]; //= { 62, 8, 41, 23, 64, 36, 12}; int i = 0, dc = 0, rez = 0; int size = sizeof(n) / sizeof(n[i]); while (i < size) { printf("Introdu al %d -lea vectorului:\n", i); scanf("%d", &n[i]); i++; } i = 0; while (i < size - 1) { dc = cmmdc(n[i], n[i + 1]); rez = cmmdc(dc, n[i + 1]); i++; } printf("CMMDC al tuturor elementelor din vector este: %d\n", rez); i = 0; while (i < size - 1) { if (suma_cifre(n[i]) == suma_cifre(n[i + 1])) printf("\nsuma cifrelor nr | %d | este egala cu suma cifrelor nr | %d |, aceasta fiind egala cu %d\n"\ , n[i], n[i + 1], suma_cifre(n[i])); i++; } i = 0; while (i < size - 1) { if (is_prime(n[i]) == 1 && is_prime(n[i + 1]) == 1) printf("\nPerechea aceasta de numere contine numere prime: |%d|, |%d|\n", n[i], n[i + 1]); i++; } return (0); }
int main(int ac, char **av) { int *x; int *y; int i; i = 1; if (ac != 3) printf("\n"); else { x = (int*)malloc(sizeof(int)); y = (int*)malloc(sizeof(int)); *x = atoi(av[1]); *y = atoi(av[2]); cmmdc(*x, *y); } return (0); }
int cmmdc(int a, int b) { if (!b) return a; else return cmmdc(b, a%b); }