杭电2629 Identity Card

原创 2015年11月20日 18:46:43

Identity Card

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


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   |   We have carefully selected several similar problems for you:  2626 2628 2630 2634 2632 
 


水题吧,这样的字符串问题我实在是不想做了。

代码:

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char s[][100]={"Zhejiang","Beijing","Taiwan","Hong Kong","Macao","Tibet","Liaoning","Shanghai"};
char year[10],month[10],day[10];
char c[110000];
int a[]={33,11,71,81,82,54,21,31};
int i,j,k,l,m,n;
int main()
{
	scanf("%d",&n);
	while(n--)
	{
		scanf("%s",c);
		m=(c[0]-'0')*10+c[1]-'0';
		for(i=0;i<8;i++)
		if(m==a[i])
		break;
		l=i;
		month[0]=c[10];
		month[1]=c[11];
		month[2]='\0';
		day[0]=c[12];
		day[1]=c[13];
		day[2]='\0';
		j=6;
		for(i=0;i<4;i++)
		year[i]=c[j++];
		year[i]='\0';
		printf("He/She is from %s,and his/her birthday is on %s,%s,%s based on the table.\n",s[l],month,day,year);
	}
}



版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

杭电2629 Identity Card

Identity Card Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...
  • z8110
  • z8110
  • 2015-11-20 18:46
  • 182

杭电ACM 2629: Identity Card

原创作品 转载请注明出处http://blog.csdn.net/always2015/article/details/45391791整个题目难点就是获取字符串的各位的值,很容易想到利用下标就可以做...

精选:深入理解 Docker 内部原理及网络配置

网络绝对是任何系统的核心,对于容器而言也是如此。Docker 作为目前最火的轻量级容器技术,有很多令人称道的功能,如 Docker 的镜像管理。然而,Docker的网络一直以来都比较薄弱,所以我们有必要深入了解Docker的网络知识,以满足更高的网络需求。

杭电 Identity Card

Identity Card Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others...

hdu 2629 Identity Card (模拟)

Identity Card Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

杭电2629

Identity Card Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

杭电2629

Identity Card Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

Identity Card

Identity Card Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) ...

HDU2629 Identity Card【MAP+水题】

Identity Card Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) To...

HDU2629:Identity Card

Problem Description Do you own an ID card?You must have a identity card number in your family's Hou...

元旦假期归来~[水题][第一阶段-英文题试水][HDOJ-2629]Identity Card

Problem Description Do you own an ID card?You must have a identity card number in your family's H...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)