2025-02-25 11:55:39 +00:00
|
|
|
#include <stdio.h>
|
2025-02-25 12:45:08 +00:00
|
|
|
#include <string.h>
|
|
|
|
|
2025-02-25 12:22:53 +00:00
|
|
|
#define VELKOST_POLA 50
|
2025-02-25 12:45:08 +00:00
|
|
|
|
|
|
|
int main() {
|
|
|
|
int vysledky[VELKOST_POLA];
|
|
|
|
int pocet = 0;
|
|
|
|
int cislo;
|
|
|
|
|
2025-02-25 13:24:54 +00:00
|
|
|
memset(vysledky, 0, sizeof(vysledky));
|
2025-02-25 12:45:08 +00:00
|
|
|
|
|
|
|
|
|
|
|
while (pocet < VELKOST_POLA && scanf("%d", &cislo) == 1) {
|
|
|
|
if (cislo < 1) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
vysledky[pocet++] = cislo;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (pocet == 0) {
|
|
|
|
printf("Chyba: Málo platných hodnôt.\n");
|
2025-02-25 13:13:55 +00:00
|
|
|
return 0;
|
2025-02-25 12:45:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
for (int i = 0; i < pocet; i++) {
|
2025-02-25 13:28:02 +00:00
|
|
|
printf("Súťažiaci č. %d vypil %d pohárov.\n", i + 1, vysledky[i]);
|
2025-02-25 12:45:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//max
|
2025-02-25 12:49:13 +00:00
|
|
|
int max = vysledky[0];
|
|
|
|
int poz = 0;
|
2025-02-25 12:45:08 +00:00
|
|
|
for (int i = 1; i < pocet; i++) {
|
|
|
|
if (vysledky[i] > max) {
|
|
|
|
max = vysledky[i];
|
2025-02-25 12:49:13 +00:00
|
|
|
poz = i + 1;
|
2025-02-25 12:45:08 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// P
|
2025-02-25 13:31:24 +00:00
|
|
|
|
2025-02-25 13:24:54 +00:00
|
|
|
for( int i = 0; i < pocet; i++){
|
2025-02-25 13:13:55 +00:00
|
|
|
if(vysledky[i] == max){
|
2025-02-25 13:31:24 +00:00
|
|
|
printf("Výherca je súťažiaci ");
|
2025-02-25 13:25:59 +00:00
|
|
|
printf("%d ", i+1 );
|
2025-02-25 13:31:24 +00:00
|
|
|
printf("ktorý vypil %d pohárov.\n");
|
2025-02-25 13:13:55 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2025-02-25 13:31:24 +00:00
|
|
|
|
2025-02-25 11:55:39 +00:00
|
|
|
}
|