HDOJ 2736 Surprising Strings——c++STL(map)
来源:互联网 发布:windows如何设置锁屏 编辑:程序博客网 时间:2024/06/05 02:00
Surprising Strings
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 349 Accepted Submission(s): 245
Problem Description
The D-pairs of a string of letters are the ordered pairs of letters that are distance D from each other. A string is D-unique if all of its D-pairs are different. A string is surprising if it is D-unique for every possible distance D.
Consider the string ZGBG. Its 0-pairs are ZG, GB, and BG. Since these three pairs are all different, ZGBG is 0-unique. Similarly, the 1-pairs of ZGBG are ZB and GG, and since these two pairs are different, ZGBG is 1-unique. Finally, the only 2-pair of ZGBG is ZG, so ZGBG is 2-unique. Thus ZGBG is surprising. (Note that the fact that ZG is both a 0-pair and a 2-pair of ZGBG is irrelevant, because 0 and 2 are different distances.)
Acknowledgement: This problem is inspired by the "Puzzling Adventures" column in the December 2003 issue of Scientific American.
Consider the string ZGBG. Its 0-pairs are ZG, GB, and BG. Since these three pairs are all different, ZGBG is 0-unique. Similarly, the 1-pairs of ZGBG are ZB and GG, and since these two pairs are different, ZGBG is 1-unique. Finally, the only 2-pair of ZGBG is ZG, so ZGBG is 2-unique. Thus ZGBG is surprising. (Note that the fact that ZG is both a 0-pair and a 2-pair of ZGBG is irrelevant, because 0 and 2 are different distances.)
Acknowledgement: This problem is inspired by the "Puzzling Adventures" column in the December 2003 issue of Scientific American.
Input
The input consists of one or more nonempty strings of at most 79 uppercase letters, each string on a line by itself, followed by a line containing only an asterisk that signals the end of the input.
Output
For each string of letters, output whether or not it is surprising using the exact output format shown below.
Sample Input
ZGBGXEEAABAABAAABBBCBABCC*
Sample Output
ZGBG is surprising.X is surprising.EE is surprising.AAB is surprising.AABA is surprising.AABB is NOT surprising.BCBABCC is NOT surprising.
Source
Mid-Central USA 2006
#include <stdio.h>#include <string.h>#include <string>#include <map>using namespace std;int main(){ char str[81]; char s[3]; map <string,int> mp; map <string,int>::iterator it; int l,i,j,flag; while(gets(str),str[0]!='*') { l=strlen(str); flag=0; for(i=1;i<l;i++) { for(j=0;j+i<l;j++) { s[0]=str[j]; s[1]=str[j+i]; s[2]='\0'; //起初这个地方没注意,结果一直不对 mp[s]++; } for(it=mp.begin();it!=mp.end();it++) { if(it->second>=2) { flag=1; break; } } mp.clear(); if(flag) break; } if(flag) printf("%s is NOT surprising.\n",str); else printf("%s is surprising.\n",str); } return 0;}
0 0
- HDOJ 2736 Surprising Strings——c++STL(map)
- poj3096——Surprising Strings(STL)
- (POJ3096)Surprising Strings <STL-map 水题>
- Surprising Strings——MAP
- HDOJ 2736 Surprising Strings
- POJ3096-Surprising Strings【STL--map】
- Surprising Strings(STL)
- poj 3096 Surprising Strings(stl map的使用)
- POJ 3096 Surprising Strings(STL map)
- poj3096 Surprising Strings (STL中map)
- Surprising Strings POJ 3096 (暴力+map)
- POJ: Surprising Strings(map、字符串处理)
- C - Surprising Strings
- POJ 3096 Surprising Strings 【STL】
- [POJ 3096]Surprising Strings[map]
- Surprising Strings poj3096(map应用)
- Surprising Strings poj 3096 map
- Surprising Strings<map集合使用>
- APUE——信号
- fstat函数
- struts1标签之<logic:iterate>
- Qtopia4.2.4移植时出现:The tslib functionality test failed!
- poj 1860&poj2240 似负环
- HDOJ 2736 Surprising Strings——c++STL(map)
- MySql下视图的创建
- POJ2109
- 自旋锁 死锁
- hdu 4911 Inversion
- android中特殊应用跟系统特殊功能协助配合通讯问题
- UVa11538 - Chess Queen
- 超级手机病毒算是病毒吗?
- 不断....