Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Eukleidova algoritmu
//clang 6.0.0 #include <stdio.h> int main(void) { int u,w,r; printf("Zadej 2 vstupy\n"); scanf("%d,%d",&u,&w); while(w!=0) { r=(u%w); u=w; w=r; } printf("%d",u); return 0; }
run
|
edit
|
history
|
help
0
myblkqsort-ptr 20m numbers
Projdi si to
scanf() and printf()
char xor
Recorrido matriz bidimensional y busqueda valor
ternary test c89
Herout (67) - 7
Herout (67) - 6
Find the length of largest subarray with equal number of 0's and 1's using recursion
Bucles: Euclides