POJ 1002 487-3279 map +暴力
来源:互联网 发布:羡慕别人知乎 编辑:程序博客网 时间:2024/06/05 04:49
E - 487-3279
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluDescription
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.
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.
No duplicates.
Sample Input
124873279ITS-EASY888-45673-10-10-10888-GLOPTUT-GLOP967-11-11310-GINOF101010888-1200-4-8-7-3-2-7-9-487-3279
Sample Output
310-1010 2487-3279 4888-4567 3
map 注意要用<int,int>
#include <iostream> #include <cstdio>#include <cstdlib>#include <cmath>#include <algorithm>#include <climits>#include <cstring>#include <string>#include <set>#include <map>#include <queue>#include <stack>#include <vector>#include <list>#define rep(i,m,n) for(i=m;i<=n;i++)#define rsp(it,s) for(set<int>::iterator it=s.begin();it!=s.end();it++)const int inf_int = 2e9;const long long inf_ll = 2e18;#define inf_add 0x3f3f3f3f#define mod 1000000007#define vi vector<int>#define pb push_back#define mp make_pair#define fi first#define se second#define pi acos(-1.0)#define pii pair<int,int>#define Lson L, mid, rt<<1#define Rson mid+1, R, rt<<1|1const int maxn=5e2+10;using namespace std;typedef long long ll;typedef unsigned long long ull; inline int read(){int ra,fh;char rx;rx=getchar(),ra=0,fh=1;while((rx<'0'||rx>'9')&&rx!='-')rx=getchar();if(rx=='-')fh=-1,rx=getchar();while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,rx=getchar();return ra*fh;}//#pragma comment(linker, "/STACK:102400000,102400000")ll gcd(ll p,ll q){return q==0?p:gcd(q,p%q);}ll qpow(ll p,ll q){ll f=1;while(q){if(q&1)f=f*p;p=p*p;q>>=1;}return f;}int n;map<int,int> p;map<int,int>::iterator it;int flag1[]={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}; int main(){ios::sync_with_stdio(false);cin >> n;for(int i=0;i<n;i++){string t;int t1=0;cin >> t;int len=0;for(int i=0;i<t.size();i++){if(t[i]>='A'&&t[i]<='Z'){if(t[i]=='Q'||t[i]=='Z')continue;t1 =t1*10+flag1[t[i]-'A'];}else if(t[i]>='0'&&t[i]<='9'){t1 =t1*10+(t[i]-'0');}}p[t1]++; }char t11[9];int flg=0;for(it=p.begin();it!=p.end();it++){if(it->second>=2){flg = 1;memset(t11,0,sizeof(t11));t11[3] = '-';int x =it->first/10000;t11[0] = x/100+'0';x %=100;t11[1] = x/10+'0';x%=10;t11[2] = x+'0';x =it->first%10000;t11[4] = x/1000+'0';x %=1000;t11[5] = x/100+'0';x%=100;t11[6] = x/10+'0';x %=10;t11[7] = x/1+'0';cout << t11 << " "<< it->second<<endl;; }}if(flg==0){cout << "No duplicates." <<endl; }return 0;}
0 0
- POJ 1002 487-3279 map +暴力
- POJ 1002 487-3279(Map)
- POJ 1002 487-3279(map)
- Surprising Strings POJ 3096 (暴力+map)
- poj 1002 487-3279 map的使用
- poj 1002 487-3279(使用STL map)
- POJ 1002 487-3279 MAP||Sort
- POJ 1002 487-3279(map应用)
- POJ-1002 487-3279(map)
- poj 1002 487-3279之map解法
- POJ-----3279暴力枚举
- poj 3279 Fliptile(二进制暴力)
- POJ 3279 Fliptile(暴力)
- poj 1002 stl map
- POJ 3279 Fliptile(状态压缩+暴力)
- POJ 3279 (状态压缩暴力枚举)
- POJ 3279 Fliptile(二进制枚举暴力)
- uva 417 map暴力
- Android事件分发与消费
- php自动加载类的实现 spl_autoload_register
- 二、Linux--文件I/O、文件和目录
- hadoop常用操作(hadoop fs)
- 【TensorFlow】tf.nn.conv2d是怎样实现卷积的?
- POJ 1002 487-3279 map +暴力
- C++里的抽象
- 三、Linux--进程
- 30 Useful Linux Commands for System Administrators(这些命令均可以在centos服务器上运行)
- 数据结构——根据中序遍历与先序遍历构建二叉树
- 【数据结构与算法】Project 1: Linear List // 测试心得
- 背个小包遍地跑----01背包问题(C++)
- c++新手上路
- jQuery 居中弹出 iframe 插件编写