Compile Error 

Main.c
1020392\Main.c(32) : error C2143: syntax error : missing ';' before 'type'
1020392\Main.c(32) : error C2143: syntax error : missing ';' before 'type'
1020392\Main.c(36) : error C2065: 's' : undeclared identifier
1020392\Main.c(36) : error C2109: subscript requires array or pointer type
1020392\Main.c(40) : error C2065: 'num' : undeclared identifier
1020392\Main.c(40) : error C2109: subscript requires array or pointer type
1020392\Main.c(40) : error C2109: subscript requires array or pointer type
1020392\Main.c(40) : error C2106: '=' : left operand must be l-value
1020392\Main.c(47) : error C2109: subscript requires array or pointer type
1020392\Main.c(47) : error C2109: subscript requires array or pointer type
1020392\Main.c(51) : error C2065: 'temp' : undeclared identifier
1020392\Main.c(51) : error C2109: subscript requires array or pointer type
1020392\Main.c(52) : error C2109: subscript requires array or pointer type
1020392\Main.c(52) : error C2109: subscript requires array or pointer type
1020392\Main.c(53) : error C2109: subscript requires array or pointer type
1020392\Main.c(54) : error C2109: subscript requires array or pointer type
1020392\Main.c(54) : error C2109: subscript requires array or pointer type
1020392\Main.c(54) : error C2106: '=' : left operand must be l-value
1020392\Main.c(60) : error C2109: subscript requires array or pointer type


/**************ID:1007 DNA Sorting ********************/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int reverse(char *s)   //统计每个串的逆序数.
{
	char *p=s,*q;
	int n=0;
	while(*p)
	{
		q=p;
		while(*q)
		{	if(*p>*q)
				n++;
		   q++;
		}
		p++;
		   
	}
	return n;
}
		
int main()
{
	//FILE *fp;
	//fp=fopen("F:\\acm\\in16.txt","r");
	int n,m,i,j,min;
	//fscanf(fp,"%d %d\n",&n,&m);
    scanf("%d %d\n",&n,&m);
	char s[110][60],temp[60]={"\0"}; int num[110]={0};
	for(i=0;i<m;i++)     //输入
	{
		//fscanf(fp,"%s\n",s[i]);
		scanf("%s\n",s[i]);
	}
	for(i=0;i<m;i++)
	{
		num[i]=reverse(s[i]); //统计每个串的逆序数.
	}

	for(i=0;i<m-1;i++)     //选择排序,移动次数较少
	{
		min=i;
		for(j=i+1;j<m;j++)
			if(num[j]<num[min])
				min=j;
		if(min!=i)
		{
			strcpy(temp,s[i]);  
			strcpy(s[i],s[min]);
			strcpy(s[min],temp);
			num[min]=num[i];
		}
	}

	for(i=0;i<m;i++)   //输出
	{
		printf("%s\n",s[i]);
	}
	//fclose(fp);
	return 0;
}