关闭

hdu2629 Identity Card (2016xynu暑期集训检测 -----F题)

标签: hdu2629hdu 2629
1200人阅读 评论(0) 收藏 举报
分类:

Identity Card

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3233    Accepted Submission(s): 1267


Problem Description
Do you own an ID card?You must have a identity card number in your family's Household Register. From the ID card you can get specific personal information of everyone. The number has 18 bits,the first 17 bits contain special specially meanings:the first 6 bits represent the region you come from,then comes the next 8 bits which stand for your birthday.What do other 4 bits represent?You can Baidu or Google it.
Here is the codes which represent the region you are in.
 
However,in your card,maybe only 33 appears,0000 is replaced by other numbers.
Here is Samuel's ID number 331004198910120036 can you tell where he is from?The first 2 numbers tell that he is from Zhengjiang Province,number 19891012 is his birthday date (yy/mm/dd).
 

Input
Input will contain 2 parts:
A number n in the first line,n here means there is n test cases. For each of the test cases,there is a string of the ID card number.
 

Output
Based on the table output where he is from and when is his birthday. The format you can refer to the Sample Output.
 

Sample Input
1 330000198910120036
 

Sample Output
He/She is from Zhejiang,and his/her birthday is on 10,12,1989 based on the table.
 

Author
Samuel
 

Source
 

Recommend
zty
 

Statistic | Submit | Discuss | Note

除了这句话  啥都不说了  就是让你解释字符串呢

#include <stdio.h>
#include <iostream>
#include <map>
using namespace std;
int main()
{
	int n;
	scanf("%d",&n);
	map<int,string>mp;
	mp[33]="Zhejiang";
	mp[11]="Beijing";
	mp[71]="Taiwan";	
	mp[81]="Hong Kong";	
	mp[54]="Tibet";	
	mp[82]="Macao";
	mp[21]="Liaoning";
	mp[31]="Shanghai";
	while(n--)
	{
		char id[20];
		scanf("%s",id);
		int x=(id[0]-'0')*10+(id[1]-'0');
		cout<<"He/She is from "+mp[x]+",and his/her birthday is on "+id[10]+id[11]+","+id[12]+id[13]+","+id[6]+id[7]+id[8]+id[9]+" based on the table."<<endl; 
	}
	return 0;
}



1
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:1279938次
    • 积分:19622
    • 等级:
    • 排名:第463名
    • 原创:594篇
    • 转载:17篇
    • 译文:0篇
    • 评论:345条
    你只管努力 其它交给时光

    点图片联系我


    唐唐女神

    点图片联系我

    访问统计
    Flag Counter
    博客专栏
    最新评论