Изменить 'du2/program.c'
BMW M5 F90 2018
This commit is contained in:
parent
cd34358fdf
commit
9bb7602e78
@ -18,33 +18,38 @@ void bubbleSort(int arr[], int n){
|
|||||||
}
|
}
|
||||||
|
|
||||||
int main() {
|
int main() {
|
||||||
char glass [50][20];
|
char glass[50][20];
|
||||||
|
int numbers[50];
|
||||||
|
int counter = 0;
|
||||||
|
int max_number = 0;
|
||||||
|
int max_position = 1;
|
||||||
|
|
||||||
int numbers[50];
|
for(int i = 0; fgets(glass[i], 20, stdin) != NULL; i++){
|
||||||
int counter = 0;
|
if(glass[i][0] == '-') break;
|
||||||
int max_number = 0;
|
|
||||||
int max_position = 1;
|
|
||||||
|
|
||||||
for (int i = 0; fgets(glass[i], 20, stdin); i++){
|
for(int j = 0; j < strlen(glass[i]); j++){
|
||||||
for (int j = 0; j < strlen(glass[i]); j++){
|
glass[i][strlen(glass[i])-1] = '\0';
|
||||||
glass[i][strlen(glass[i])-1] = '\0';
|
if(!isdigit(glass[i][j]) || atoi(glass[i]) < 1){
|
||||||
if (!isdigit(glass[i][j]) || atoi(glass[i]) < 1){
|
goto LABEL;
|
||||||
goto LABEL;
|
}
|
||||||
}
|
}
|
||||||
}
|
|
||||||
numbers[counter++] = atoi(glass[i]);
|
|
||||||
if (i == 0) {
|
|
||||||
max_number = numbers[counter-1];
|
|
||||||
}
|
|
||||||
else if(numbers[counter-1] > max_number){
|
|
||||||
max_number = numbers[counter-1];
|
|
||||||
printf("Súťažiaci č. %d vypil %d pohárov.\n",max_position,max_number);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
LABEL:
|
|
||||||
|
|
||||||
bubbleSort(numbers, sizeof(numbers)/sizeof(numbers[0]));
|
numbers[counter++] = atoi(glass[i]);
|
||||||
|
if(i == 0) {
|
||||||
|
max_number = numbers[counter - 1];
|
||||||
|
printf("%d %d\n", max_position, max_number); //max value
|
||||||
|
}
|
||||||
|
else if(numbers[counter-1] > max_number) {
|
||||||
|
max_number = numbers[counter-1];
|
||||||
|
max_position = i+1;
|
||||||
|
printf("%d %d\n", max_position, max_number); //max value
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
printf ("Výherca je súťažiaci %d ktorý vypil %d pohárov.\n",max_position,numbers[counter-1]);
|
LABEL:
|
||||||
return 0;
|
|
||||||
|
bubbleSort(numbers, sizeof(numbers)/sizeof(numbers[0]));
|
||||||
|
printf("%d %d\n", max_position, numbers[0]);
|
||||||
|
|
||||||
|
return 0;
|
||||||
}
|
}
|
||||||
Loading…
Reference in New Issue
Block a user