c语言程序——学生成绩成绩表

{
printf("position:\t No\t mt\t wl\t sum\n");
printf("%8d\t%4ld\t%4d\t%4d\t%5d\t",pos+1,num[pos],score[pos][0],score[pos][1],sum[pos]);
}
else
printf("not found!\n");
这个应该可以了，这个我试过了，很成功，不过还有缺点，那就是没用“结构”你再看看，不行这里有个用结构的，不过我不会改，要是这个不行就把那个原版的给你弄过去，你自己看看能改不……明白？？
#include<stdio.h>
#define stu 50
#define course 2
void input(long num[],int score[][course],int n);
input(num,score,n);
getsum(score,n,sum);
print(num,score,n,sum);
sort(num,score,n,sum);
printf("按总分排名:\n");
print(num,score,n,sum);
gcj(num,score,n,sum,0);
printf("按数学成绩排名:\n");
}
void input(long num[],int score[][course],int n)
{
int i,j;
for(i=0;i<n;i++)
{
scanf("%ld",&num[i]);
for(j=0;j<course;j++)
scanf("%d",&score[i][j]);
}
}
void getsum(int score[][course],int n,int sum[])
printf("学号\t|数学\t物理\t总成绩\n");
printf("-----------------------------------------\n");
for(i=0;i<n;i++)
{
printf("%ld\t|",num[i]);
for(j=0;j<course;j++)
printf("%4d\t",score[i][j]);
for(m=0;m<course;m++)
{
temp1=score[k][m];
score[k][m]=score[i][m];
score[i][m]=temp1;
}
}
}
}
void gcj(long num[],int score[][course],int n,int sum[],int x)
{
int i,j,k,m;
void print(long num[],int score[][course],int n,int sum[]);
int search(long num[],int n,long x);
main()
{
int n,score[stu][course],sum[stu],pos;
long num[stu],x;
printf("学号\t|数学\t物理\t总成绩\n");
printf("-----------------------------------------\n");
for(i=0;i<n;i++)
{
printf("%ld\t|",num[i]);
for(j=0;j<course;j++)
printf("%4d\t",score[i][j]);
{
int i,j;
for(i=0;i<n;i++)
{
sum[i]=0;
for(j=0;j<course;j++)
sum[i]=sum[i]+score[i][j];
}
}
void sort(long num[],int score[][course],int n,int sum[])
{
int i,j,k,m;
print(num,score,n,sum);
sort(num,score,n,sum);
printf("按总分排名:\n");
print(num,score,n,sum);
gcj(num,score,n,sum,0);
printf("按数学成绩排名:\n");
print(num,score,n,sum);
main()
{
int n,score[stu][course],sum[stu],pos;
long num[stu],x;
printf("please enter the total number of the students(n<=50):");
scanf("%d",&n);
printf("enter No. and score as: mt wl\n");
for(m=0;m<course;m++)
{
temp1=score[k][m];
score[k][m]=score[i][m];
score[i][m]=temp1;
}
}
}
}
void print(long num[],int score[][course],int n,int sum[])
{
int i,j;
gcj(num,score,n,sum,1);
printf("按物理成绩排名:\n");
print(num,score,n,sum);
printf("please enter searching number:");
scanf("%ld",&x);
pos=search(num,n,x);
if(pos!=-1)
printf("%5d\n",sum[i]);
}
}
int search(long num[],int n,long x)
{
int i;
for(i=0;i<n;i++)
if(num[i]==x)
return(i);
return(-1);
}
#include<stdio.h>
#define stu 50
#define course 2
if(pos!=-1)
{
printf("position:\t No\t mt\t wl\t sum\n");
printf("%8d\t%4ld\t%4d\t%4d\t%5d\t",pos+1,num[pos],score[pos][0],score[pos][1],sum[pos]);
}
else
printf("not found!\n");
void getsum(int score[][course],int n,int sum[]);
void sort(long num[],int score[][course],int n,int sum[]);
void gcj(long num[],int score[][course],int n,int sum[],int x);
for(m=0;m<course;m++)
{
temp1=score[k][m];
score[k][m]=score[i][m];
score[i][m]=temp1;
}
}
}
}
void gcj(long num[],int score[][course],int n,int sum[],int x)
{
int i,j,k,m;
int temp1;
long temp2;
for(i=0;i<n-1;i++)
{
k=i;
for(j=i+1;j<n;j++)
if(sum[j]>sum[k])
k=j;
if(k!=i)
{
temp1=sum[k]; sum[k]=sum[i]; sum[i]=temp1;
temp2=num[k]; num[k]=num[i]; num[i]=temp2;
int temp1;
long temp2;
for(i=0;i<n-1;i++)
{
k=i;
for(j=i+1;j<n;j++)
if(score[j][x]>score[k][x])
k=j;
if(k!=i)
{
temp1=sum[k]; sum[k]=sum[i]; sum[i]=temp1;
temp2=num[k]; num[k]=num[i]; num[i]=temp2;
for(m=0;m<course;m++)
{
temp1=score[k][m];