解题报告_18.5.20_POJ_1002-487-3279

最新推荐文章于 2018-05-22 20:17:13 发布

zzz130981

最新推荐文章于 2018-05-22 20:17:13 发布

阅读量124

点赞数

分类专栏：查找

本文链接：https://blog.csdn.net/huangming1644/article/details/80385257

版权

查找专栏收录该内容

1 篇文章 0 订阅

订阅专栏

hash

#include "stdio.h"
#include "stdlib.h"

#define MAX 10000000

char map[26] = "2223334445556667Q77888999Z";
int index[MAX];

int main()
{
    int i,j;
    char ch;
    int n,num,flag=0;
    char s[7];
    scanf("%d\n",&n);
    for(i=0;i<n;i++)
    {
        j=0;
        num = 0;
        while(j<7)
        {
            ch = getchar();
            if(ch!='-' && ch!='Q' && ch!='Z')
            {
                num=num*10+((ch>='0'&&ch<='9')?ch-'0':map[ch-'A']-'0');
                j++;
            }
        }
        index[num]++;
        while(getchar() != '\n');
    }
    
    for(i=0;i<MAX;i++)
    {
        for(j=0;j<7;j++) s[j]='0';
        if(index[i]>1)
        {
            flag =1;
            printf("%03d-%04d %d\n",(i/10000),(i%10000),index[i]);
        }
    }
    
    if(flag ==0) printf("No duplicates. \n");
    //system("pause");
    return 0;
}