杭电OJ 2629 Identity Card(C++)

Identity Card
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 11638 Accepted Submission(s): 4278

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.

虽然这题很水，不过为了节省时间，还是推荐大家用C++去做了(看了一些博客的C做法，觉得有些散乱.)通过C++的字符串函数，这题是很简洁明了的。
AC代码如下：

#include<iostream>
using namespace std;
int main()
{int n;while(cin>>n){while(n--){string s,a,b,c,d; //以字符串形式读取cin>>s;a=s.substr(0,2);  //取字符串第1到3位，即出生地b=s.substr(10,2); //取字符串第10到12位，出生日c=s.substr(12,2); //取字符串第12到2位，出生月d=s.substr(6,4);  //取字符串第6到10位，出生年cout<<"He/She is from ";if(a=="33") cout<<"Zhejiang,";   //字符串比较else if(a=="11") cout<<"Beijing,";else if(a=="71") cout<<"Taiwan,";else if(a=="81") cout<<"Hong Kong,";else if(a=="82") cout<<"Macao,";else if(a=="54") cout<<"Tibet,";else if(a=="21") cout<<"Liaoning,";else if(a=="31") cout<<"Shanghai,";cout<<"and his/her birthday is on "<<b<<","<<c<<","<<d<<" based on the table."<<"\n";}}return 0;
}

杭电OJ 2629 Identity Card(C++)相关推荐

杭电OJ分类题目（4）-Graph
原题出处:HDOJ Problem Index by Type,http://acm.hdu.edu.cn/typeclass.php 杭电OJ分类题目(4) HDU Graph Theory - U ...
杭电OJ（HDOJ）入门题目列表
杭电OJ链接: http://acm.hdu.edu.cn/ 注册与使用指南: https://blog.csdn.net/qq_38769551/article/details/101510000 ...
【ACM】杭电OJ 2037
题目链接:杭电OJ 2037 先把b[i]进行排序,然后,b[i]与a[i+1]进行比较. #include <iostream> #include <cstdio> #inc ...
【ACM】杭电OJ 2020（排序）
题目链接:杭电OJ 2020 排序可以有冒泡排序,选择排序,或者直接调用函数. 下面是选择排序: #include <stdio.h> #include <math.h> in ...
【ACM】杭电OJ 2018
题目链接:杭电OJ 2018 从n>4开始,每一年的牛的数量=前一年的牛的数量+三年前的牛的数量问:为什么是三年前? 答:假设三年前有一头小牛出生,出生的那一年即为第一年,到了第四年,即三年后 ...
【ACM】杭电OJ 1005
题目链接:杭电OJ 1005 超时代码如下(而且开辟的数组空间大小不够): #include <stdio.h> int m[100000]; int f(int n,int a,int ...
【ACM】杭电OJ 1004
题目链接:杭电OJ 1004 运行环境:Dev-C++ 5.11 思路: 先把先把num数组全部赋值为1:第一个颜色单独输入,从第二个开始,需要与前面的进行比较,如果前面有相同的颜色,则在目前的nu ...
【ACM】杭电OJ 2012。
题目链接:杭电OJ 2012 思路很简单,但是有一种高效算法显示编译错误,不知道为什么运行环境:VS2017 AC代码: #include <stdio.h> #include < ...
【ACM】杭电OJ 1003。
运行环境VS2017 题目链接:杭电OJ 1003 主要思想是: 用d[i]来存放前i项中最大的和,得到end,然后再倒推,得起始的位置begin 然而在程序42行的疑问,大家可以讨论一下吗???? ...

杭电OJ 2629 Identity Card(C++)

杭电OJ 2629 Identity Card(C++)相关推荐

最新文章

热门文章