C语言用结构体方法输入50个学生记录，组成记录数组，然后按成绩由高到低输出（每行10个记录） C语言，求高手 学生的记录由学号和成绩组成，N名学生的数据已...
C\u8bed\u8a00\u8003\u8bd5\u8bd5\u9898:\u5b9a\u4e49\u4e00\u4e2a100\u4f4d\u5b66\u751f\u7684\u7ed3\u6784\u4f53\u6570\u7ec4\uff0c\u6309\u6210\u7ee9\u4ece\u9ad8\u5230\u4f4e\u8fdb\u884c\u6392\u5e8f\u6211\u73b0\u5199\u7684\u4e00\u4e2a\uff0c\u7b80\u6d01\u660e\u4e86\uff0c\u5e94\u8be5\u662f\u7b26\u5408\u4f60\u7684\u53e3\u5473\u7684\uff0c\u6d4b\u8bd5\u5b8c\u5168\u901a\u8fc7
#include
#define N 100
typedef struct student
{
int id; //\u5b66\u53f7
char name[20]; //\u59d3\u540d
int gender; //\u6027\u522b\uff080\u4ee3\u8868\u7537\u751f\uff0c1\u4ee3\u8868\u5973\u751f\uff09
float score; //\u6210\u7ee9
}stu;
stu s[N];
int main()
{
int i;
for(i=0;i<N;i++)
{
printf("\u8bf7\u8f93\u5165\u7b2c%d\u4e2a\u5b66\u751f\u7684\u5b66\u53f7:",i+1);
scanf("%d",&s[i].id);
printf("\u8bf7\u8f93\u5165\u7b2c%d\u4e2a\u5b66\u751f\u7684\u59d3\u540d:",i+1);
scanf("%s",&s[i].name);
printf("\u8bf7\u8f93\u5165\u7b2c%d\u4e2a\u5b66\u751f\u7684\u6027\u522b:",i+1);
scanf("%d",&s[i].gender);
printf("\u8bf7\u8f93\u5165\u7b2c%d\u4e2a\u5b66\u751f\u7684\u6210\u7ee9:",i+1);
scanf("%f",&s[i].score);
}
stu ss[N];
stu* p=ss;
for(i=0;i<N;i++)
ss[i]=s[i];
for(i=0;i<N-1;i++)
{
for(int j=i+1;j<N;j++)
{
if(ss[i].score<ss[j].score)
{
stu temp=*(p+i);
*(p+i)=*(p+j);
*(p+j)=temp;
}
}
}
printf("\u6240\u6709\u5b66\u751f\u7684\u4fe1\u606f\u6309\u6210\u7ee9\u7531\u9ad8\u5230\u4f4e\u6392\u540d\u5982\u4e0b:\n");
printf("\u5b66\u53f7\t\u59d3\u540d\t\u6027\u522b\t\u6210\u7ee9\n");
for(i=0;i<N;i++)
{
printf("%d\t%s\t%d\t%.1f\n",(p+i)->id,(p+i)->name,(p+i)->gender,(p+i)->score);
}
return 0;
}
\u53d1\u73b0\u4f60\u4e3b\u7a0b\u5e8f\u6709\u4e2a\u5c0f\u9519\u8bef\uff0c\u5df2\u7ecf\u6539\u6b63\uff0c\u4e0b\u5217\u7a0b\u5e8f\uff0c\u671b\u91c7\u7eb3
#include#include#define N 10typedef struct{char num[10];int s;}STREC;int fun(STREC *a,STREC *b){int i,j=0;int min;for(min = a->s;a->s > 0 && a->s s s;}for(a-=j,i=0;j>0;a++,j--){if(a->s==min){//printf("\n%s ",a->num,a->s);strcpy(b->num,a->num);b++->s = a->s;i++;}}return i;}int main(){STREC s[N]={{"GA05",85},{"GA03",76},{"GA02",69},{"GA04",85},{"GA01",91},{"GA07",72},{"GA08",64},{"GA09",64},{"GA10",85},{"GA06",64}};STREC h[N];int i,n;n=fun(s,h);printf("The %d lowest score:\n",n);for(i=0;i<n;i++)printf("%s %4d\n",h[i].num,h[i].s);printf("\n");}
#include "stdio.h"
struct student
{ int num;
int score;
};
struct student s[N],temp;
void input()
{ int i;
for(i=0;i<N;i++)
{
printf("Enter number:");
scanf("%d",&s[i].num);
printf("Enter score:");
scanf("%d",&s[i].score);
}
}
void output()
{ int i;
for(i=0;i<N;i++)
{// if(i%10==0)//是不是想利用变量i来控制换行？
printf("num=%d\n,score=%d\n",s[i].num,s[i].score);
}
}
void main()
{ void input();
void output();
int i,j,b;
input();
for(i=0;i<N;i++)
{
for(j=i+1;j<N;j++)
if(s[i].score>s[j].score)
{temp=s[i];
s[i]=s[j];
s[j]=temp;
}
}
output();
}
调试正确
绛旓細include<stdio.h> include<string.h> define NUM 50 void bubblesort(float *grade,char (*num)[20]){ int i,j;float temp;char numtemp[NUM][20];for(i=1;i<NUM;i++)for(j=0;j<NUM-i;j++){ if(grade[j]<grade[j+1]){ temp=grade[j];grade[j]=grade[j+1];grade[j+1]...
绛旓細for(i=0;i<N;i++){// if(i%10==0)//鏄笉鏄兂鍒╃敤鍙橀噺i鏉ユ帶鍒舵崲琛岋紵printf("num=%d\n,score=%d\n",s[i].num,s[i].score);} } void main(){ void input();void output();int i,j,b;input();for(i=0;i<N;i++){ for(j=i+1;j<N;j++)if(s[i].score>s[j].sc...
绛旓細include <stdio.h>typedef struct{char name[50];char sex;int id;int score;}studentInfo_t;/*瀛︾敓淇℃伅鐨缁撴瀯浣*/studentInfo_t studentInfo[50]={{"wang","m",1,81},{"zhang","f",2,79},{0}/*鍒濆鍖50涓瀛︾敓鐨勪俊鎭紝姝ゅ浠呬妇2渚嬶紝鍏朵綑鍙ˉ鍏呭畬鏁*/};void main(){int i;for(i...
绛旓細include <iostream> include<string> using namespace std;struct student { char name[10];char num[10];int age;double score;};struct list { student data[50];int last;};void init(list &m){ m.last=-1;} void append(list &m){ if(m.last>49)cout<<"浜烘暟宸叉弧";else { m.la...
绛旓細涓涓畬鏁寸殑c绋嬪簭濡備笅,鍔熻兘榻愬叏銆傜▼搴忓湪win-tc鍜宼c2.0涓嬭瘯楠岄氳繃.绋嬪簭瀹炵幇浠庨敭鐩杈撳叆50涓瀛︾敓鐨勬暟鎹(鍖呮嫭瀛﹀彿銆佸鍚嶃3闂ㄨ鐨勬垚缁)锛岀▼搴忔墽琛岃緭鍑烘墍鏈夊鐢3闂ㄨ鐨勬诲钩鍧囨垚缁╋紝鏈楂樺垎瀛︾敓鐨勫鍙枫佸鍚嶃3闂ㄨ鐨勬垚缁┿3闂ㄨ骞冲潎鎴愮哗./ include <stdio.h> include <stdlib.h> include <conio.h> de...
绛旓細//瀹氫箟涓涓寚鍚憇truct student鐨缁撴瀯浣鎸囬拡鍑芥暟*creat()鐢ㄦ潵澧炲姞鑰冪敓淇℃伅.char ch[Q];n = 0; //鐢ㄦ潵瀛樻斁濮撳悕鐨 p1 = p2 = (student *) malloc(LEN);//璋冪敤malloc()鍑芥暟鐢ㄦ潵寮杈熶竴涓柊鐨勫瓨鍌ㄥ崟鍏 cout << " ---<<璇峰缓绔嬪鐢熻冭瘯淇℃伅琛,鍦ㄥ鍚嶅閿互 ! 缁撴潫杈撳叆銆>>---"<< endl;...
绛旓細include<iostream>#include<string> using namespace std;//===<寮濮嬪畾涔缁撴瀯浣>===struct combox{ int num;int mark;string name;combox *next;};//===<缁撴潫瀹氫箟缁撴瀯浣>=== //===<寮濮嬪畾涔塁ommonbox绫>=== /
绛旓細銆愮▼搴100銆戦鐩:鏈変簲涓鐢,姣忎釜瀛︾敓鏈3闂ㄨ鐨勬垚缁,浠庨敭鐩杈撳叆浠ヤ笂鏁版嵁(鍖呮嫭瀛︾敓鍙,濮撳悕,涓夐棬璇炬垚缁),璁＄畻鍑 骞冲潎鎴愮哗,鍐靛師鏈夌殑鏁版嵁鍜岃绠楀嚭鐨勫钩鍧囧垎鏁板瓨鏀惧湪纾佺洏鏂囦欢"stud"涓.1.绋嬪簭鍒嗘瀽:2.绋嬪簭婧愪唬鐮:include "stdio.h"struct student { char num[6];char name[8];int score[3];float ...
绛旓細printf("Please input the information:\n") ;//杈撳叆瀛︾敓淇℃伅 for(i=0;i<n;i++)//杈撳叆濮撳悕锛堝 bill gates锛墈 scanf("%c",&ch);while(ch!='\n'){ Ptr[i].name[p]=ch;p++;scanf("%c",&ch);} Ptr[i].name[p+1]=0;scanf("%c",ch);//杈撳叆瀛﹀彿锛堝惈瀛楁瘝銆佹暟瀛楋級while(...
绛旓細C++ 涓殑struct涓巆lass鐨勫尯鍒槸锛歴truct鐨勯粯璁よ闂骇鍒槸public锛宑lass 鐨勮闂骇鍒槸private銆侰++涓殑struct鍜宑lass涓鏍峰彲浠ユ湁鎴愬憳鍑芥暟锛堜笂闈唬鐮佷腑鐨 void show鏄垚鍛樺嚱鏁;Student(char *name, char *id, int grade)鏄竴涓壒娈婄殑鎴愬憳鍑芥暟锛屽彨鏋勯犲嚱鏁帮紝璇ュ嚱鏁扮敤浜庡疄渚嬪寲涓涓被鐨勫璞★級銆備笅闈㈢粰鍑轰笂闈...
