oh735kh/pvjc21
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Изменить 'du2/program.c'

Browse Source 
BMW
This commit is contained in:
Oleksandr Hryshchenko 2021-03-09 20:48:26 +00:00
parent 8683da971c
commit 7e5056575b
1 changed files with 34 additions and 29 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

59
du2/program.c
View File

@ -18,19 +18,18 @@ void bubbleSort(int arr[], int n){
} }
int main() { int main() {
char glass [300]; char glass[300];
char divided[6]; char divided[6];
int numbers[50];
int numbers[50]; int counter = 0;
int counter = 0;
int counter2 = 0; int counter2 = 0;
int max_number = 0; int max_number = 0;
int max_position = 1; int max_position = 1;
fgets(glass, 300, stdin); fgets(glass, 300, stdin);
for (int i = 0; glass[i] != '\n'; i++){ for(int i = 0; glass[i] != '\n'; i++){
//if(glass[i][0] == '-') break; if(glass[0] == '-') break;
for(int j = 0; glass[i+j] != ' '; j++){ for(int j = 0; glass[i+j] != ' '; j++){
divided[j] = glass[i+j]; divided[j] = glass[i+j];
@ -38,25 +37,31 @@ int main() {
} }
i += counter2; i += counter2;
for (int j = 0; j < strlen(divided); j++){ for(int j = 0; j < strlen(divided); j++){
divided[strlen(divided[i])-1] = '\0'; divided[strlen(divided)-1] = '\0';
if (!isdigit(divided[j]) || atoi(divided) < 1){ if(!isdigit(divided[j]) || atoi(divided) < 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])); memset(divided, '\0', 6);
printf ("Výherca je súťažiaci %d ktorý vypil %d pohárov.\n",max_position,numbers[counter-1]); numbers[counter++] = atoi(divided);
return 0; 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;
} }