• 2022-06-11
    void sort()//按个人平均成绩高低排序{ int i,j,k,t=0;double temp;char str[10]="";for(i=0;i< ;i++)for(j= ;j<N;j++)if(stu[i].av<stu[j].av){temp=stu[i].av;stu[i].av=stu[j].av;stu[j].av=temp;strcpy(str,stu[i].num);strcpy(stu[i].num,stu[j].num);strcpy(stu[j].num,str);strcpy(str,stu[i].name);strcpy(stu[i].name,stu[j].name);strcpy(stu[j].name,str);for(k=0;k<3;k++){t=stu[i].score[k];stu[i].score[k]=stu[j].score[k];stu[j].score[k]=t;}}[/i][/i][/i][/i][/i][/i][/i][/i][/i]
  • N-1# i+1

    举一反三

    内容

    • 0

      n阶对称矩阵a满足a[i]&#91;j&#93;=a&#91;j&#93;[i],i,j=1…n,用一维数组t存储时,t的长度为____,当i=j,a[i]&#91;j&#93;=t&#91;2&#93;,i>;j,a[i]&#91;j&#93;=t&#91;3&#93;,i<;j,a[i]&#91;j&#93;=t&#91;4&#93;。[/i][/i][/i][/i][/i]

    • 1

      以下函数的功能是连接两个字符串,请完善程序。void str_cat(char str1&#91; &#93;, char str2&#91; &#93;, char str&#91; &#93;){ int i,j; for(i=0;str1[i]!= '0';i++) str[i]=str1[i]; for(j=0;str2&#91;j&#93;!='0';j++) str&#91;i++&#93;=str2&#91;j&#93;; ; }[/i][/i][/i] A:

    • 2

      中国大学MOOC: 写出下面程序执行后的运行结果。#include <stdio.h>struct STU {char name[10];int num;int Score;};int main(){struct STU s[5]={{"YangSan",20041,703},{"LiSiGuo",20042,580},{"wangYin",20043,680},{"SunDan",20044,550},{"Penghua",20045,537}},*p[5],*t;int i,j;for(i=0;i<5;i++) p[i]=&s[i];for(i=0;i<4;i++)for(j=i+1;j<5;j++)if(p[i]->Score>p[j]->Score){ t=p[i]; p[i]=p[j]; p[j]=t;}printf("%d %d",s[1].Score,p[1]->Score); return 0;}

    • 3

      写出以下程序运行结果。 #include<iomanip.h> const int N=3; int main() { int a&#91;N&#93;&#91;N&#93;={{7,-5,3},{2,8,-6},{1,-4,-2}}; int b&#91;N&#93;&#91;N&#93;={{3,6,-9},{2,-8,3},{5,-2,-7}}; int i,j,c&#91;N&#93;&#91;N&#93;; for(j=0;j<N;i++) //计算矩阵C for(j=0;j<N;j++) c[i]&#91;j&#93;=a[i]&#91;j&#93;+b[i]&#91;j&#93;; for(j=0;j<N;i++) //输出矩阵C { for(j=0;j<N;j++) cout<<setw(5)<<c[i]&#91;j&#93;; cout<<endl; } }[/i][/i][/i][/i]

    • 4

      下面代码的输出结果是( )。 a=&#91;&#91;1,2,3&#93;,&#91;4,5,6&#93;,&#91;7,8,9&#93;&#93; s=0 for i in range(2): for j in range(3): s+=a[i]&#91;j&#93; print(s)[/i] A: 15 B: 6 C: 45 D: 21