Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include <string.h>
- int n;
- struct dt
- {
- char kom[50];
- } data[1001];
- int cmp(const void *a,const void *b)
- {
- struct dt *aa=(struct dt *)a;
- struct dt *bb=(struct dt *)b;
- int i,aaa,bbb;
- aaa=strlen(aa->kom);
- bbb=strlen(bb->kom);
- if(b>aaa) aaa=b;
- if((aa->kom[0]) > (bb->kom[0])) return 1;
- else if((aa->kom[0]) == (bb->kom[0]))
- {
- for(i=1; i<aaa; i++)
- {
- if((aa->kom[i]) > (bb->kom[i]))
- {
- return 1;
- break;
- }
- else if((aa->kom[i]) < (bb->kom[i]))
- {
- return -1;
- break;
- }
- }
- return -1;
- }
- else return -1;
- }
- int main()
- {
- int i,j;
- scanf("%d",&n);
- for(i=0; i<n; i++)
- {
- for(j=0;j<40;j++) data[i].kom[j]='\0';
- }
- for(i=0; i<n; i++) scanf("%s",data[i].kom);
- qsort(data,n,sizeof(*data),cmp);
- printf("%s\n",data[0].kom);
- for(i=1; i<n; i++)
- {
- if(strcmp(data[i].kom,data[i-1].kom)!=0)
- {
- printf("%s\n",data[i].kom);
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement