Advertisement
Guest User

Untitled

a guest
May 25th, 2015
234
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 1.23 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <string.h>
  4.  
  5. typedef struct{
  6.     char nev[40];
  7.     int  db1;
  8.     int  db2;
  9.  
  10. }ELEM;
  11.  
  12. int rendez( const void *a,const void *b)
  13. {
  14.     ELEM *x= (ELEM *) a;
  15.     ELEM *y= (ELEM *) b;
  16.  
  17.     if ( x->db1 < y->db1 ) return 1;
  18.     if ( x->db1 > y->db1 ) return -1;
  19.  
  20.     if ( x->db2 < y->db2 ) return 1;
  21.     if ( x->db2 > y->db2 ) return -1;
  22.  
  23.     return strcmp(x->nev,y->nev);
  24. }
  25.  
  26. int main()
  27. {
  28.  
  29.    /* FILE *f;
  30.     f=fopen("c.txt","w");*/
  31.     int i=0,db=0,ertek1,ertek2;
  32.     char sor[100],*token;
  33.  
  34.     ELEM t[20];
  35.  
  36.     while ( fgets(sor,100,stdin))
  37.     {
  38.         token = strtok(sor, "/");
  39.         strcpy(t[i].nev,token);
  40.  
  41.         token= strtok(NULL,"/");
  42.  
  43.         int hossz,j;
  44.         hossz = strlen (token);
  45.         ertek1=0;
  46.         ertek2=0;
  47.         for (j = 0; j < hossz ; j++)
  48.         {
  49.             if ( token[j] == '1') ertek1++;
  50.             if ( token[j] == '2') ertek2++;
  51.         }
  52.  
  53.         t[i].db1=ertek1;
  54.         t[i].db2=ertek2;
  55.  
  56.         db++;
  57.         i++;
  58.  
  59.     }
  60.  
  61.     qsort (t,db,sizeof(ELEM),rendez);
  62.  
  63.     for ( i = 0; i < db ; i++)
  64.        /* fprintf(f,"%s %d %d\n",t[i].nev,t[i].db1,t[i].db2); */
  65.        printf("%s\n",t[i].nev);
  66.  
  67.  
  68.     return 0;
  69. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement