pvjc20/du5/program.c

91 lines
1.8 KiB
C
Raw Normal View History

2020-04-08 18:19:24 +00:00
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
struct LIS{
char fname[100];
char sname[100];
int num;
};
int keep(struct LIS *);
int del(struct LIS *,int);
void Sort_Struct(struct LIS *,int);
void print(struct LIS *,int);
int main(){
struct LIS list[100];
int count=keep(list);
//printf("%d",count);
int pult=del(list,count);
//printf("%d",pult);
Sort_Struct(list,count);
print(list,count);
return 0;
}
int keep(struct LIS *list){
char *array;
int stop,count;
int num;
2020-04-08 21:13:23 +00:00
int ss;
2020-04-08 18:19:24 +00:00
for(int i=0; stop!=EOF; i++){
array=(char*)malloc(100);
stop =0;
for(int j=0;stop!='\n';j++){
stop=getchar();
if(stop==EOF) break;
array[j]=stop;
}
if(stop==EOF) break;
sscanf(array,"%d %s %s",&list[i].num,list[i].sname,list[i].fname);
count++;
free(array);
}
return count;
}
int del(struct LIS *list,int count){
for(int i=0;i<count-1;i++){
for(int j=i+1;j<count;j++){
if(strcmp(list[i].fname,list[j].fname)==0 && strcmp(list[i].sname,list[j].sname)==0 && list[j].num!=-1) {
count--;
list[i].num+=list[j].num;
list[j].num=-1;
}
}
}
return count;
}
void Sort_Struct(struct LIS *list,int count){
2020-04-08 21:13:23 +00:00
2020-04-08 18:19:24 +00:00
struct LIS ilusion;
for(int i=0;i<count;i++){
2020-04-08 21:13:23 +00:00
for(int j=count;j>i;j--){
if(list[i].num<list[j].num){
ilusion=list[i];
list[i]=list[j];
list[j]=ilusion;
2020-04-08 18:19:24 +00:00
}
}
}
}
void print(struct LIS *list,int count){
printf("Vysledky:\n");
for(int i=0;i<count;i++){
2020-04-08 18:24:37 +00:00
if(list[i].num!=-1 && list[i].num!=0){
2020-04-08 18:19:24 +00:00
printf("%d %s %s\n",list[i].num, list[i].sname, list[i].fname);
}
}
}