poj 1002 (字符串基础)

原创 2012年03月27日 22:02:01
487-3279
Time Limit: 2000MS   Memory Limit: 65536K
Total Submissions: 182479   Accepted: 31389

Description

Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can call the University of Waterloo by dialing the memorable TUT-GLOP. Sometimes only part of the number is used to spell a word. When you get back to your hotel tonight you can order a pizza from Gino's by dialing 310-GINO. Another way to make a telephone number memorable is to group the digits in a memorable way. You could order your pizza from Pizza Hut by calling their ``three tens'' number 3-10-10-10.

The standard form of a telephone number is seven decimal digits with a hyphen between the third and fourth digits (e.g. 888-1200). The keypad of a phone supplies the mapping of letters to numbers, as follows:

A, B, and C map to 2
D, E, and F map to 3
G, H, and I map to 4
J, K, and L map to 5
M, N, and O map to 6
P, R, and S map to 7
T, U, and V map to 8
W, X, and Y map to 9

There is no mapping for Q or Z. Hyphens are not dialed, and can be added and removed as necessary. The standard form of TUT-GLOP is 888-4567, the standard form of 310-GINO is 310-4466, and the standard form of 3-10-10-10 is 310-1010.

Two telephone numbers are equivalent if they have the same standard form. (They dial the same number.)

Your company is compiling a directory of telephone numbers from local businesses. As part of the quality control process you want to check that no two (or more) businesses in the directory have the same telephone number.

Input

The input will consist of one case. The first line of the input specifies the number of telephone numbers in the directory (up to 100,000) as a positive integer alone on the line. The remaining lines list the telephone numbers in the directory, with each number alone on a line. Each telephone number consists of a string composed of decimal digits, uppercase letters (excluding Q and Z) and hyphens. Exactly seven of the characters in the string will be digits or letters.

Output

Generate a line of output for each telephone number that appears more than once in any form. The line should give the telephone number in standard form, followed by a space, followed by the number of times the telephone number appears in the directory. Arrange the output lines by telephone number in ascending lexicographical order. If there are no duplicates in the input print the line:

No duplicates. 

第一次做题做到这种想吐得地步,竟然还是被一道洪水题。。。。最后注意输出场宽。。。估计大家都是因为这原因wa吧。。。

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>

#define maxn 100100

using namespace std;

const int number[26] = {2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,7,8,8,8,9,9,9,9};
/*
A, B, and C map to 2
D, E, and F map to 3
G, H, and I map to 4
J, K, and L map to 5
M, N, and O map to 6
P, R, and S map to 7
T, U, and V map to 8
W, X, and Y map to 9
*/
int N,n = 1,ax[maxn];

struct xx{
  int a,b;
  //string ss;
  }ar[maxn];

int in_num()
{

    int num = 0,i,len;
    char st[1000];
    scanf("%s",st);
    len = strlen(st);
    for(i = 0;i < len;i++)
      if (st[i] <='9' && st[i] >= '0'){
          num *= 10;
          num += st[i] - '0';
          }
      else if (st[i] != 'Z' && st[i] != 'Q' && st[i] <= 'Z' && st[i] >= 'A') {
          num *= 10;
          num += number[st[i]-'A'];
          }
    return num;
}

int cmp(xx a1,xx a2)
{
    return a1.a<a2.a;
}

void work()
{
    int i,j,temp,temp1;
    scanf("%d",&N);
    for(i = 1;i <= N;i++) ax[i] = in_num();
    sort(ax+1,ax+N+1);
}

void out_num()
{
    int i,k,t = 1;
    for(i = 1;i <= N;i++) {
      k = 1;
      while(ax[i] == ax[i+1]) {k++;i++;}
      if (k > 1) {t = 0;printf("%03d-%04d %d\n",ax[i]/10000,ax[i]%10000,k);}
      }
      if (t) printf("No duplicates.\n");
}

int main()
{
    work();
    out_num();
    return 0;
}


相关文章推荐

POJ 1002 (字符串 && 模拟)

URL: http://poj.org/problem?id=1002 题目大意: 有n个不同的电话号码(由7个有效字符和一些横线构成),其中可能含有大写字母或数字。将大写字母通过一定的规...

POJ1002(字符串+map大法+模拟)

题目链接:http://poj.org/problem?id=1002 解题思路: 此题有坑,刚开始输入字符串是一定要用char *,用string的话会超时。 思路很简单,就是边输入边...

POJ 1002 电话号码字符串处理

这题比较简单,就是对电话号码的字符串处理并排序输出,但是实现时有几个注意的地方 1、用map存储比较方便,可以自动根据string的排序规则排序,而且题目数据恰好是的K-V存储特点。 2、...

poj 1002 电话号码\字符串处理

...读题一定要仔细啊最后说如果电话中没有重复的号码需要输出No duplicates. 还有就是看discuss板块是有好处的 看了一些博客都说要变成数组,但是直接转换成string串我感觉更好...

POJ 1002 487-3279 - 字符串转换为数组

/* * POJ 1002 487-3279 * 将字符转化为数字,并排序统计重复数; * * 字符数转化值得注意: * string map("2223334445556667#778...

poj 1002 方便记忆的电话号码 字符串处理+排序

刚开始 做的时候  只是

C++——字符串例题——487-3279(POJ1002)

487-3279 Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 285398   Acc...

POJ1002源代码

  • 2010年08月21日 15:18
  • 2KB
  • 下载

poj1002代码

  • 2014年11月02日 15:51
  • 398KB
  • 下载

poj1002(map水题 )

给你一些字符,统一转化成电话号码,放在map 输出他们个数。 string 时间TLE char 过了#include #include #include #include #include ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj 1002 (字符串基础)
举报原因:
原因补充:

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