Poj 1002水题模拟
2017-11-23 12:47
302 查看
487-3279
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 298486 Accepted: 53360
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.
Sample Input
12
4873279
ITS-EASY
888-4567
3-10-10-10
888-GLOP
TUT-GLOP
967-11-11
310-GINO
F101010
888-1200
-4-8-7-3-2-7-9-
487-3279
Sample Output
310-1010 2
487-3279 4
888-4567 3
Source
East Central North America 1999
题意概括:输入n行字母或者数字,表示一个特定的电话号码,然后统计一下重复的电话号码出现的次数,按字典序输出即可。
//from:poj 1002 //time:2017.11.23 #include <stdio.h> #include <string.h> #include <algorithm> using namespace std; int a[100010],b[100010]; int main() { int n,i,j,t,l,m; char s[10010]; while(scanf("%d",&n)!=EOF) { t=0; getchar(); memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); for(j=0;j<n;j++) { gets(s); l=strlen(s); for(i=0;i<l;i++) { if(s[i]>='0'&&s[i]<='9') { a[j]+=s[i]-'0'; a[j]*=10; } else if(s[i]>='A'&&s[i]<'Q') { int f=s[i]-'A'+6; a[j]+=f/3; a[j]*=10; } else if(s[i]>'Q'&&s[i]<'Z') { int f=s[i]-'A'+5; a[j]+=f/3; a[j]*=10; } } a[j]/=10;//将电话号码存在数组中 } int flag=0; sort(a,a+n); for(i=0;i<n;i++) { int f=1; while(a[i]==a[i+1]) { i++; f++; } if(f!=1) { printf("%03d-%04d %d\n",a[i]/10000,a[i]%10000,f); flag=1; } } if(flag==0) printf("No duplicates.\n"); } return 0; }
相关文章推荐
- POJ 1002 487-3279 (模拟 水题)
- poj 3095 Linear Pachinko 模拟水题
- POJ 2562 Primary Arithmetic(我的水题之路——模拟加法进位)
- poj 3103 Cutting a Block 模拟水题
- POJ 1068:Parencodings:模拟水题
- poj 1002 模拟
- POJ 1002 UVA 755 487--3279 电话排序 简单但不容易的水题
- poj 2673 Kicc Wants to Move a Mountain! 模拟水题
- POJ 字符串的全排列 水题也搞我 多种方法 DFS,STL,直接模拟。。。。。。
- poj2014-模拟----水题1A
- POJ 1573 Robot Motion (模拟+不回溯的dfs 水题)
- poj 1929 Calories from Fat 模拟水题
- poj2632 Crashing Robots 模拟水题
- poj1002(map水题 )
- poj 1313 Booklet Printing 模拟水题
- 1002 大数相加 (简单模拟) 水题
- poj 3782 Equal Sum Partitions 模拟水题
- POJ 1002 487-3279 水题字符串
- poj 3444 Wavelet Compression 模拟水题
- poj 3087 模拟 水题