Изменить 'du2/program.c'
BMW
This commit is contained in:
parent
8683da971c
commit
7e5056575b
@ -18,19 +18,18 @@ void bubbleSort(int arr[], int n){
|
||||
}
|
||||
|
||||
int main() {
|
||||
char glass [300];
|
||||
char glass[300];
|
||||
char divided[6];
|
||||
|
||||
int numbers[50];
|
||||
int counter = 0;
|
||||
int numbers[50];
|
||||
int counter = 0;
|
||||
int counter2 = 0;
|
||||
int max_number = 0;
|
||||
int max_position = 1;
|
||||
int max_number = 0;
|
||||
int max_position = 1;
|
||||
|
||||
fgets(glass, 300, stdin);
|
||||
|
||||
for (int i = 0; glass[i] != '\n'; i++){
|
||||
//if(glass[i][0] == '-') break;
|
||||
for(int i = 0; glass[i] != '\n'; i++){
|
||||
if(glass[0] == '-') break;
|
||||
|
||||
for(int j = 0; glass[i+j] != ' '; j++){
|
||||
divided[j] = glass[i+j];
|
||||
@ -38,25 +37,31 @@ int main() {
|
||||
}
|
||||
i += counter2;
|
||||
|
||||
for (int j = 0; j < strlen(divided); j++){
|
||||
divided[strlen(divided[i])-1] = '\0';
|
||||
if (!isdigit(divided[j]) || atoi(divided) < 1){
|
||||
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]));
|
||||
|
||||
printf ("Výherca je súťažiaci %d ktorý vypil %d pohárov.\n",max_position,numbers[counter-1]);
|
||||
return 0;
|
||||
for(int j = 0; j < strlen(divided); j++){
|
||||
divided[strlen(divided)-1] = '\0';
|
||||
if(!isdigit(divided[j]) || atoi(divided) < 1){
|
||||
goto LABEL;
|
||||
}
|
||||
}
|
||||
|
||||
memset(divided, '\0', 6);
|
||||
|
||||
numbers[counter++] = atoi(divided);
|
||||
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
|
||||
}
|
||||
}
|
||||
|
||||
LABEL:
|
||||
|
||||
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