网站大量收购独家精品文档,联系QQ:2885784924

2016广工Anyview试题答案 第九章(国外英语资料).doc

2016广工Anyview试题答案 第九章(国外英语资料).doc

  1. 1、本文档共24页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
2016广工Anyview试题答案 第九章(国外英语资料)

2016广工Anyview试题答案 第九章(国外英语资料) * * * * * * The structure of the structure is defined as follows: Struct date {int year; Int the month; Int day; }; / / define date structure types Struct student {char name [20]; Struct date birth; / / birth date }; The structure array s stores the name and date of birth for n people. So lets write a function. Were going to get the oldest of the n people The name of the person who is the youngest. * * * * * * * * * * * Student s (student s), int n { Int j, k = 0; For (j = 1; j n minus 1; j + +) {if [[k].birth. Else if (s).birth. {if [[k].birth.month. [k].birth. [[k].birth.day. } } Return s [k]. Name; } * * * * * * The structure of the structure is defined as follows: Struct date {int year; Int the month; Int day; }; / / define date structure types Struct student {char id, [10]; / / student id Char name [20]. / / name Struct date birth; / / birth date }; The structure array s stores the number, name, and date of birth of n individuals. Write a function, in the form of a structure Return the information of the oldest (the youngest) person of the n person. * * * * * * * * * * * Struct student: struct student: { Int j, k = 0; For (j = 1; j n minus 1; j + +) {if [[k].birth. Else if (s).birth. {if [[k].birth.month. [k].birth. [[k].birth.day. } } Return s [k]. } * * * * * * The structure of the structure is defined as follows: Struct student {char id, [10]; / / student id Char name [10]. / / name Int score [5]; / / grades in all subjects }; The structure array s stores the Numbers, names, and grades of n students. write The function returns the number of the highest number of students in this class. * * * * * * * * * * * A char * best (struct student, int n, int I) { Int t = s [0].score [I]. For (int j = 0; j n; j + +) {if (t s [j].score [I]) {t = s [j]. K = j; }} Return s [k]. Id; } * * * * * * The structure of the structure is defined as follows: Struct student {char id, [10]; / / student id Char name [10]. / / name Int score [5]; / / g

文档评论(0)

f8r9t5c + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档