72 lines
1.8 KiB
C
72 lines
1.8 KiB
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <ctype.h>
|
|
|
|
void bubbleSort(int arr[], int n){
|
|
int i, j;
|
|
int temp;
|
|
for (i = 0; i < n-1; i++) {
|
|
for (j = 0; j < n - i - 1; j++) {
|
|
if (arr[j] > arr[j + 1]) {
|
|
temp = arr[j];
|
|
arr[j] = arr[j + 1];
|
|
arr[j + 1] = temp;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
int main() {
|
|
char glass[500];
|
|
char divided[10];
|
|
memset(divided, '\0', 10);
|
|
int counter = 0, counter2 = 0;
|
|
int final_count = 0;
|
|
int numbers[50];
|
|
int max_number = 0;
|
|
int max_position = 1;
|
|
|
|
fgets(glass, 500, stdin);
|
|
|
|
for (int i = 0; glass[i] != '\n'; i++){
|
|
if(!isdigit(glass[i])) {
|
|
final_count = i;
|
|
break;
|
|
}
|
|
|
|
if(glass[i] != ' '){
|
|
divided[counter++] = glass[i];
|
|
}
|
|
else {
|
|
if(atoi(divided) < 1){
|
|
final_count = i;
|
|
break;
|
|
}
|
|
numbers[counter2++] = atoi(divided);
|
|
if (i == 0){
|
|
max_number = numbers[counter2-1];
|
|
printf("Súťažiaci č. %d vypil %d pohárov.\n",max_position,max_number);
|
|
}
|
|
else if (max_number < numbers[counter2-1]){
|
|
max_number = numbers[counter2-1];
|
|
max_position = i+1;
|
|
printf("Súťažiaci č. %d vypil %d pohárov.\n",max_position,max_number);
|
|
}
|
|
max_position = i+1;
|
|
counter = 0;
|
|
memset(divided, '\0', 10);
|
|
}
|
|
|
|
final_count = i;
|
|
}
|
|
|
|
if (final_count == 0)
|
|
printf("Chyba: Málo platných hodnôt.\n");
|
|
else {
|
|
printf("Výherca je súťažiaci %d ktorý vypil %d pohárov.\n",max_position,max_number);
|
|
}
|
|
|
|
|
|
return 0;
|
|
} |