105 lines
2.9 KiB
C
105 lines
2.9 KiB
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#define SIZE 100
|
|
|
|
struct student {
|
|
char name[SIZE];
|
|
int score;
|
|
};
|
|
int compar(const void*,const void*);
|
|
int loading_the_entire_line_from_standard_input_into_the_helper_field_and_verify_that_i_have_loaded_it_correctly(struct student *databaza,int *size_ptr);
|
|
int parce_line_and_save_into_database(char line[],struct student *databaza, int *size_ptr);
|
|
int find_index(struct student databaza[],int size, const char *xxx);
|
|
void adding_an_item_to_the_database(struct student databaza[],int *size_ptr, const char* name,int score);
|
|
|
|
|
|
int main()
|
|
{
|
|
struct student databaza[SIZE];
|
|
memset(databaza,0,SIZE*sizeof(struct student));
|
|
int size = 0;
|
|
while(loading_the_entire_line_from_standard_input_into_the_helper_field_and_verify_that_i_have_loaded_it_correctly(databaza,&size)){
|
|
}
|
|
if(size==0){
|
|
printf("Nepodarilo nacitat nic\n");
|
|
return 0;
|
|
}
|
|
int element_size=SIZE+sizeof(int);
|
|
qsort((void *)databaza, size,element_size,compar);
|
|
printf("Vysledky:\n");
|
|
for(int i=0; i<size; i++){
|
|
printf("%d %s\n",databaza[i].score,databaza[i].name);
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
|
|
|
|
int loading_the_entire_line_from_standard_input_into_the_helper_field_and_verify_that_i_have_loaded_it_correctly(struct student *databaza,int *size_ptr){
|
|
char line[SIZE];
|
|
memset(line,0,SIZE);
|
|
char* r = fgets(line,SIZE,stdin);
|
|
if (r == NULL||strlen(r)==1){
|
|
return 0;
|
|
}
|
|
if(parce_line_and_save_into_database(line,databaza,size_ptr)==-1){
|
|
return 0;
|
|
}
|
|
return 1;
|
|
}
|
|
int parce_line_and_save_into_database(char line[],struct student *databaza, int *size_ptr){
|
|
char* end = NULL;
|
|
int score=strtol(line,&end,10);
|
|
if(score==0){
|
|
return -1;
|
|
}
|
|
char name[SIZE];
|
|
memset(name,0,SIZE);
|
|
end += 1;
|
|
int velkost_mena = strlen(end) - 1;
|
|
|
|
if (velkost_mena == 0){
|
|
return -1;
|
|
}
|
|
memcpy(name,end,velkost_mena);
|
|
|
|
adding_an_item_to_the_database( databaza, size_ptr, name, score);
|
|
}
|
|
|
|
int find_index(struct student databaza[],int size, const char *xxx){
|
|
for(int i=0; i<size; i++){
|
|
if(strcmp(databaza[i].name,xxx)==0){
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
void adding_an_item_to_the_database(struct student databaza[],int *size_ptr, const char* name,int score){
|
|
int size_of_Name= strlen(name);
|
|
int id = find_index(databaza,*size_ptr,name);
|
|
if (id< 0){
|
|
memcpy(databaza[*size_ptr].name,name,size_of_Name);
|
|
databaza[*size_ptr].score=score;
|
|
*size_ptr+=1;
|
|
}else {
|
|
databaza[id].score+=score;
|
|
}
|
|
}
|
|
int compar(const void* a,const void* b){
|
|
const struct student * a_ptr = a;
|
|
const struct student * b_ptr = b;
|
|
if(a_ptr->score < b_ptr->score) {
|
|
return 1;
|
|
}
|
|
if(a_ptr->score > b_ptr->score) {
|
|
return -1;
|
|
}
|
|
|
|
return strcmp(a_ptr->name, b_ptr->name);
|
|
}
|
|
|