19年春季第二题 PAT甲级 1157 Anniversary（25 分）

最新推荐文章于 2025-03-22 14:29:32 发布

原创

最新推荐文章于 2025-03-22 14:29:32 发布 · 1.5k 阅读

3 ·

CC 4.0 BY-SA版权

文章标签：

#2019年春季 #PAT甲级 #Anniversary #PAT乙级

该博客主要讲述了2019年浙江大学庆祝122周年校庆时，如何通过编程统计参加庆祝活动的校友数量，并找出最年长校友的ID。博主分享了输入输出规格，包括校友和参加者的身份证号码格式，以及输出应包含的校友人数和最年长校友ID。博主特别提到，不使用特定数据结构可能会导致超时问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

英文题目

Zhejiang University is about to celebrate her 122th anniversary in 2019. To prepare for the celebration, the alumni association （校友会） has gathered the ID’s of all her alumni. Now your job is to write a program to count the number of alumni
among all the people who come to the celebration.

Input Specification:
Each input file contains one test case. For each case, the first part is about the information of all the alumni. Given in the first line is a positive integer NNN (≤105).
Then NNN lines follow, each contains an ID number of an alumnus. An ID number is a string of 18 digits or the letter X. It is guaranteed that all the ID’s are distinct.
The next part gives the information of all the people who come to the celebration.
Again given in the first line is a positive integer MMM(≤105). Then MMM lines follow, each contains an ID number of a guest. It is guaranteed that all the ID’s are distinct.

Output Specification:
First print