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;
|
|
|
|
|
|
|
|
memset(vysledky, 0, sizeof(vysledky));
|
|
|
|
|
|
|
|
|
|
|
|
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");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
for (int i = 0; i < pocet; i++) {
|
|
|
|
printf("Súťažiaci č._%d_vypil_%d_pohárov.\n", i + 1, vysledky[i]);
|
|
|
|
}
|
|
|
|
|
|
|
|
//max
|
|
|
|
int max = vysledky[0];
|
|
|
|
for (int i = 1; i < pocet; i++) {
|
|
|
|
if (vysledky[i] > max) {
|
|
|
|
max = vysledky[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// P
|
|
|
|
printf("Výherca je súťažiaci ");
|
|
|
|
int a = 1;
|
|
|
|
for (int i = 0; i < pocet; i++){
|
|
|
|
if( vysledky[i] = max) {
|
|
|
|
if(!a) printf(", ");
|
|
|
|
printf("%d", i + 1);
|
|
|
|
a = 0;
|
2025-02-25 12:22:53 +00:00
|
|
|
}
|
2025-02-25 12:45:08 +00:00
|
|
|
}
|
|
|
|
printf(" ktorý vypil %d pohárov.\n", max);
|
2025-02-25 11:55:39 +00:00
|
|
|
}
|