C语言的编程题,大家谁帮帮我啊,老师出的题目,我实在做不出来啊。

发布网友 发布时间：2022-04-23 06:22

我来回答

共5个回答

热心网友 时间：2023-09-11 03:11

可以考虑用结构体数组——不如你自己先想想该怎么编吧、首先、输入、该怎么输入成绩和学号、、然后、排序用什么算法？——最后、输出就简单了——要多自己思考程序的流程、最好画画流程图——

热心网友 时间：2023-09-11 03:11

#include <stdio.h>

struct student
{
int place;
int no;
int grade;
};

void input(struct student stu[],int *p)
{
int i = 1;

scanf("%d%d", &stu[0].no, &stu[0].grade);
while (!(stu[i-1].no == -1 && stu[i-1].grade == -1))
{
scanf("%d%d", &stu[i].no, &stu[i].grade);
i++;
}
*p = i;
}

void output(struct student stu[],int y)
{
int i;

for (i = 0; i < y - 1; i++)
{
printf("%d %d %d\n", stu[i].place, stu[i].no, stu[i].grade);
}
}

void set(struct student stu[], int y)
{
int i, j;
struct student temp;

for (i = 0; i < y - 1; i++)
{
for (j = i + 1; j < y - 1; j++)
{
if (stu[i].grade < stu[j].grade)
{
temp = stu[i];
stu[i] = stu[j];
stu[j] = temp;
}
if (stu[i].grade == stu[j].grade)
{
if (stu[i].no > stu[j].no)
{
temp = stu[i];
stu[i] = stu[j];
stu[j] = temp;
}
}
}
}
stu[0].place = 1;
for (i = 1; i < y - 1; i++)
{
if (stu[i].grade == stu[i - 1].grade)
{
stu[i].place = stu[i - 1].place;
}
else
{
stu[i].place = i + 1;
}
}
}

int main(void)

{
struct student stu[100];
int y;

input(stu, &y);
set(stu, y);
output(stu, y);

return 1;
}

本来人家回答过的，不好插嘴的，但是，他们的感觉或多或少没有满足要求，有的是用的c++，有的在输入的时候没有使用函数，所以，我把我自己认为更符合要求的放在这里了

热心网友 时间：2023-09-11 03:12

#include <iostream>
#define MAX_STUDENT_NUM 10
#define INCREATMENT 5
using namespace std;
struct student
{
int id; //学号
int ach;//成绩
};
void Create(student *&stu,int &n);
void Sort(student *stu,int n);
void Change(student &a,student &b);
void Print(student *stu,int n);
int main()
{
student *stu;
int stu_num;
Create(stu,stu_num);
Sort(stu,stu_num);
Print(stu,stu_num);
return 0;
}
void Create(student *&stu,int &n)
{
printf("请输入学生学号、成绩：\n");
int id;
int grade;
scanf("%d",&id);
scanf("%d",&grade);
stu = (student *)malloc(sizeof(student)*MAX_STUDENT_NUM);
int i = 0;
while(id!=-1)
{
if(i>=MAX_STUDENT_NUM)
stu = (student *)realloc(stu,sizeof(student)*MAX_STUDENT_NUM);
stu[i].id = id;
stu[i].ach = grade;
i++;
scanf("%d",&id);
scanf("%d",&grade);
}
n = i;
}
void Sort(student *stu,int n)
{
int max;
for(int i = 0;i<n-1;i++)
{
max = i;
for(int j = i+1;j<n;j++)
{
if(stu[max].ach<stu[j].ach)
max = j;
}
if(max != i)
{
Change(stu[max],stu[i]);
}
}
}
void Print(student *stu,int n)
{
for(int i = 0,rank = 1;i<n;i++)
{
printf("%d %d %d\n",rank,stu[i].id,stu[i].ach);
if(i<n-1)
if(stu[i].ach!=stu[i+1].ach)
rank++;
}
}
void Change(student &a,student &b)
{
int tempid;
int tempach;
tempid = a.id;
a.id = b.id;
b.id = tempid;
tempach = a.ach;
a.ach = b.ach;
b.ach = tempach;
}

热心网友 时间：2023-09-11 03:12

#include <stdio.h>

struct stu
{
int num;
int score;
}a[5];

void input(stu a[],int i)
{
for(i=0;i<5;i++)
{
printf("输入第%d个学生的学号和成绩：",i);
scanf("%d,%d",a[i].num,a[i].score);
}
}

void output(stu a[],int i)
{
for(i=0;i<5;i++)
{
printf("%d,%d\n",a[i].num,a[i].score);
}
}

void order(stu a[],int i)
{
int p,p1,p2;
for(i=0;i<5;i++)
{
if(a[i].score<a[i+1].score)
{
p1=a[i].score;
a[i].score=a[i+1].score;
a[i+1].score=p1;
p2=a[i].num;
a[i].num=a[i+1].num;
a[i+1].num=p2;
}
if(a[i].score==a[i+1].score)
{
if(a[i].num>a[i].num)
{
p=a[i].num;
a[i].num=a[i+1].num;
a[i+1].num=p;
}
}
}
}

void main()
{

input(a,5);
printf("原始数据：");
output(a,5);
order(a,5);
printf("排序之后的数据：");
output(a,5);
}

大致就是这样吧
希望对你有帮助

热心网友 时间：2023-09-11 03:13

#include "stdio.h"
#define MAX_NUM 2000

typedef struct _STUDENT
{
int no;
int grade;
}STUDENT;

void sort(STUDENT *stu, int len);
void output(STUDENT *stu, int len);

int main(void)
{
STUDENT stu[MAX_NUM];

int no, grade;
int i = 0;

while (scanf("%d%d", &no, &grade) && !(no == -1 && grade == -1))
{
stu[i].no = no;
stu[i].grade = grade;
++i;
}

sort(stu, i);
output(stu, i);
return 0;
}

void sort(STUDENT *stu, int len)
{
int i, j;

for (i=0; i<len; i++)
{
for (j=0; j<len-i-1; j++)
{
if (stu[j].grade < stu[j + 1].grade)
{
int swap, no;

swap = stu[j].grade;
no = stu[j].no;
stu[j].grade = stu[j + 1].grade;
stu[j].no = stu[j + 1].no;
stu[j + 1].grade = swap;
stu[j + 1].no = no;
}
else if (stu[j].grade == stu[j + 1].grade)
{
if (stu[j].no > stu[j + 1].no)
{
int swap, no;

swap = stu[j].grade;
no = stu[j].no;
stu[j].grade = stu[j + 1].grade;
stu[j].no = stu[j + 1].no;
stu[j + 1].grade = swap;
stu[j + 1].no = no;
}
}
}
}
}

void output(STUDENT *stu, int len)
{
int i;

for (i=0; i<len; i++)
{
printf("%d %d %d\n", i + 1, stu[i].no, stu[i].grade);
}
}

按你的要求写的 看看行不行！