zoukankan      html  css  js  c++  java
  • hdu2629Identity Card

    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.
    #include<stdio.h>
    #include<string.h>
    #include<iostream>
    #include<map>
    using namespace std;
    char a[20],mp[88][15];
    int main()
    {
        int n,y,m,d,dd;
        strcpy(mp[33],"Zhejiang");
        strcpy(mp[82],"Macao");
        strcpy(mp[11],"Beijing");
        strcpy(mp[54],"Tibet");
        strcpy(mp[71],"Taiwan");
        strcpy(mp[21],"Liaoning");
        strcpy(mp[81],"Hong Kong");
        strcpy(mp[31],"Shanghai");
        scanf("%d",&n);
        while(n--)
        {
            scanf("%s",a);
            dd=0; y=0;
            for(int i=0;i<2;i++) dd=dd*10+a[i]-'0';
            for(int i=6;i<=9;i++) y=y*10+a[i]-'0';
            printf("He/She is from %s,and his/her birthday is on ",mp[dd]);
            printf("%c%c,%c%c,%d",a[10],a[11],a[12],a[13],y);
            printf(" based on the table.
    ");
        }
    }
    


     
  • 相关阅读:
    bzoj 1588: [HNOI2002]营业额统计 treap
    Codeforces Round #135 (Div. 2) E. Parking Lot 线段数区间合并
    cdoj 851 方老师与素数 bfs
    hdu 5150 Sum Sum Sum 水
    Codeforces Round #376 (Div. 2) F. Video Cards 数学,前缀和
    POJ 1984 Navigation Nightmare 带全并查集
    POJ 1655 Balancing Act 树的重心
    POJ 3140 Contestants Division 树形DP
    HDU 3586 Information Disturbing 树形DP+二分
    HDU 1561 The more, The Better 树形DP
  • 原文地址:https://www.cnblogs.com/riasky/p/3476575.html
Copyright © 2011-2022 走看看