5.6 假设有 5 个学生的姓名和分数采用以下方式存储(相同的数组下标对应一个学生 的姓名和分数): char *name[]={"Smith","John","Mary","Havard","Kai
2016-07-27 20:47
323 查看
/*
5.6 假设有 5 个学生的姓名和分数采用以下方式存储(相同的数组下标对应一个学生
的姓名和分数):
char *name[]={"Smith","John","Mary","Havard","Kai"};
int score[]={80,89,72,96,66};
编写一个程序根据用户输入的姓名查找相应的分数。
*/
#include <iostream>
using namespace std;
void main()
{
//char str[20] = { 0 };
char *str = new char(20);
cin >> str;
//cin.get();
char *name[] = { "Smith", "John", "Mary", "Havard", "Kai" };
int score[] = { 80, 89, 72, 96, 66 };
for (int i = 0; i < sizeof(name) / sizeof(char *); i++)
{
//char *str = new char(20);
//char str[20] = { 0 };
//memset(str, 0, 20);
//cin >> str;
//cin.get();
//while (strcmp(str,name[i]) != 0)
//{
//
//
// //cout << "名字有误!重新输入:":
// cout << " 名字有误!重新输入: ";
// cin>>str;
//}
if (strcmp(str, name[i]) == 0)
{
cout << "成绩:" << score[i] << endl;
}
}
system("pause");
}
5.6 假设有 5 个学生的姓名和分数采用以下方式存储(相同的数组下标对应一个学生
的姓名和分数):
char *name[]={"Smith","John","Mary","Havard","Kai"};
int score[]={80,89,72,96,66};
编写一个程序根据用户输入的姓名查找相应的分数。
*/
#include <iostream>
using namespace std;
void main()
{
//char str[20] = { 0 };
char *str = new char(20);
cin >> str;
//cin.get();
char *name[] = { "Smith", "John", "Mary", "Havard", "Kai" };
int score[] = { 80, 89, 72, 96, 66 };
for (int i = 0; i < sizeof(name) / sizeof(char *); i++)
{
//char *str = new char(20);
//char str[20] = { 0 };
//memset(str, 0, 20);
//cin >> str;
//cin.get();
//while (strcmp(str,name[i]) != 0)
//{
//
//
// //cout << "名字有误!重新输入:":
// cout << " 名字有误!重新输入: ";
// cin>>str;
//}
if (strcmp(str, name[i]) == 0)
{
cout << "成绩:" << score[i] << endl;
}
}
system("pause");
}
相关文章推荐
- 1090. Highest Price in Supply Chain (25)
- 安卓aidl夸进程通信的小例子,
- Form good habits----TimeManger(daily report)
- 不少科技公司在炒人工智能,可真正的情形却是…
- Hadoop权威指南读书笔记(2) — Yarn简介及Capacity & Fair Scheduler
- Y分钟学Brainfuck
- Error Domain=NSURLErrorDomain Code=-999 "cancelled" UserInfo={NSErrorFailingURLKey=http://XXXX, NSLo
- construction of tuples containing 0 or 1 items
- RAID详解[RAID0/RAID1/RAID10/RAID5]
- RaidoButton单选框
- HDOJ 5753 (2016多校联合训练 Training Contest 3) Permutation Bo
- 微软人工智能首席科学家邓力:深度监督学习的局限和破解思路
- HDU 1789 Doing Homework again 贪心
- HDU 1789 Doing Homework again
- Train Problem II hdu 1023
- HDOJ 5752 (2016多校联合训练 Training Contest 3) Sqrt Bo
- 关于四次挥手的TIME_WAIT状态
- hdu 3264 Open-air shopping malls(圆相交面积+二分)
- AsycTask------MainActivity
- Trailing Zeroes (III)