an154gf/pvjc25
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

vypisovanie viacerych vyhercov naraz

Browse Source
This commit is contained in:
Aleš Novysedlák 2025-02-27 13:57:46 +01:00
parent 3b6778a3c8
commit 43a33594b5
1 changed files with 15 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
du1/program.c
View File

@ -13,6 +13,8 @@ int main() {
int iterating_index = 0; int iterating_index = 0;
int user_counter = 1; int user_counter = 1;
int max_number_user_pair[2] = {0,0}; int max_number_user_pair[2] = {0,0};
int repeating_values[999] = {};
int repeating_values_index = 0;
int starting_index = 0; int starting_index = 0;
int last = 0; int last = 0;
while(starting_index<string_index) { while(starting_index<string_index) {
@ -32,6 +34,16 @@ int main() {
if (current_number > max_number_user_pair[0]) { if (current_number > max_number_user_pair[0]) {
max_number_user_pair[0] = current_number; max_number_user_pair[0] = current_number;
max_number_user_pair[1] = user_counter; max_number_user_pair[1] = user_counter;
for (int i = 0;i<repeating_values_index;i++) {
repeating_values[i] = 0;
}
repeating_values_index = 0;
repeating_values[repeating_values_index] = user_counter;
repeating_values_index++;
} else if (current_number == max_number_user_pair[0]) {
repeating_values[repeating_values_index] = user_counter;
repeating_values_index++;
} }
printf("Súťažiaci č. %d vypil %d pohárov.\n", user_counter, current_number); printf("Súťažiaci č. %d vypil %d pohárov.\n", user_counter, current_number);
user_counter++; user_counter++;
@ -39,7 +51,9 @@ int main() {
starting_index = iterating_index; starting_index = iterating_index;
if (last) starting_index = string_index+1; if (last) starting_index = string_index+1;
} }
printf("Výherca je súťažiaci %d ktorý vypil %d pohárov.\n",max_number_user_pair[1], max_number_user_pair[0]); for (int i=0;i<repeating_values_index;i++) {
printf("Výherca je súťažiaci %d ktorý vypil %d pohárov.\n",max_number_user_pair[i], max_number_user_pair[0]);
}
return 0; return 0;
} }