ps351zd/pvjc22
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

funguje

Browse Source
This commit is contained in:
Peter Sabol 2022-03-10 20:23:56 +01:00
parent 46744b9d38
commit c98475792c
1 changed files with 21 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
du2/program.c
View File

@ -2,19 +2,28 @@
#include <stdlib.h> #include <stdlib.h>
#define VELKOST_POLA 52 #define VELKOST_POLA 52
struct Winner{
int drinks,position;
};
int main(){ int main(){
int vysledky[VELKOST_POLA]; int drinks_counter[VELKOST_POLA];
int pocet;
int max=0;
int i=0; int i=0;
char pole[50]; while(i<VELKOST_POLA){
memset(pole,0,VELKOST_POLA * sizeof(int)); scanf("%d",drinks_counter[i]);
for(i<vysledky; i++){ if(drink_counter[i]<1){
if (pole[i] > max){ break;
max = pole[i];
} }
printf("\nSúťažiaci č.%d vypil %d pohárov.\n", i , pole[i]); i++;
} }
printf("\nVýherca je súťažiaci%d ktorý vypil %d pohárov\n", - , max); struct Winner max={0,0};
for(int j=0;j<i;j++){
printf("Súťažiaci č.%d vypil %d pohárov.\n",j,drinks_counter[j]);
if(drinks_counter[j]>max.drinks){
max.drinks=drinks_counter[j];
max.position=j;
}
}
printf("Výherca je súťažiaci %d ktorý vypil %d pohárov.\n",max.position,max.drinks);
return 0; return 0;
} }