-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFindStu.cpp
56 lines (56 loc) · 1.48 KB
/
FindStu.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
// 查找学术信息
struct Student
{
string name;
string gender;
int age;
};
int main(int argc, char const *argv[])
{
int n;
scanf("%d", &n);
map<string, Student> infoMap;
for (int i = 0; i < n; i++)
{
char num[30];
// 这些字符数组都相当于string类型,只是方便限定长度
char name[30];
char gender[30];
int age;
scanf("%s%s%s%d", num, name, gender, &age);
// key string
string numstr = num; // C风格的字符数组变为C++风格的字符串
// value student
Student student;
student.name = name;
student.gender = gender;
student.age = age;
infoMap[numstr] = student;
// 把numstr作为键,把student作为插入的值
}
int m;
scanf("%d", &m);
for (int i = 0; i < m; i++)
{
char num[30];
scanf("%s", num);
string numstr = num; // C风格的字符数组变为C++风格的字符串
if (infoMap.find(numstr) != infoMap.end())
{
// 找到了键值对
printf("%s %s %s %d\n", numstr.c_str(),
infoMap[numstr].name.c_str(),
infoMap[numstr].gender.c_str(),
infoMap[numstr].age);
}
else
{
printf("No Answer!\n");
}
}
return 0;
}