1809400_ac_15ms_32k.c

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>
# include <stdlib.h>
# include <string.h>

typedef struct node 
{
	int no;
    char dna[50];
    struct node *link;
} DNA;



void main()
{
 int i, j, l, m, n, sum;
 char str[50];

 DNA *head, *p, *q;
 
 head = (DNA *)malloc(sizeof(DNA));
 
 head->link = NULL;
 scanf("%d %d",&m,&n);getchar();
 for(i = 0; i < n; i++)
 { 
	 sum = 0;
	 gets(str);
	 for(j = 0; j < m - 1; j++)
		 for(l = j + 1; l < m; l++)
			 if(str[l] < str[j])
				 sum++;
			 
	 p = head;
	 while(p->link)
		 if(sum < p->link->no) 
		    break;
		 else 
		    p = p->link;
      q = (DNA *)malloc(sizeof(DNA));
	  q->no = sum;
	  strcpy(q->dna,str);
	  q->link = p->link;
	  p->link = q;
 }
  p = head;
  while(p->link)
  {
	  puts(p->link->dna);
	  p=p->link;
  }
  
}