Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Příklad 3 min max #define
//clang 6.0.0 #include <stdio.h> #define N 5 #define MIN 5 #define MAX 15 int main(void) { int i=0; double p[N], min=MAX,max=MIN; printf("Zadej %d cisel \n", N); while(i < N) { printf("Zadej %d cislo \n", i+1); scanf("%lf", &p[i]); if(p[i]>MIN) { if(p[i]>MAX) { printf("Zadane cislo je mimo povoleny rozsah!\n"); p[i]=MAX; } } else { printf("Zadane cislo je mimo povoleny rozsah!\n"); p[i]=MIN; } //Maximalni cilo, minimalni cislo if(min> p[i]) { min=p[i]; } if(max < p[i]) { max=p[i]; } printf("%d cislo je %.2f \n",i+1, p[i]); i = (i+1); } printf("maximum je %.2f\n",max); printf("minimum je %.2f\n",min); return 0; }
run
|
edit
|
history
|
help
0
Ducktype
strchr
ejemplos bucles basicos
lab7_OOP 0.3 alha
Bucles: Triángulo de asteriscos lateral izquierdo
definice funkce
DÚ 2
_Generic / struct
Find the length of largest subarray with equal number of 0's and 1's using recursion
Vzdalenost