Codeforces Round #385 (Div. 2) A. Hongcow Learns the Cyclic Shift
来源:互联网 发布:暗黑破坏神2修改器mac 编辑:程序博客网 时间:2024/06/16 15:14
A. Hongcow Learns the Cyclic Shift
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Hongcow is learning to spell! One day, his teacher gives him a word that he needs to learn to spell. Being a dutiful student, he immediately learns how to spell the word.
Hongcow has decided to try to make new words from this one. He starts by taking the word he just learned how to spell, and moves the last character of the word to the beginning of the word. He calls this a cyclic shift. He can apply cyclic shift many times. For example, consecutively applying cyclic shift operation to the word “abracadabra” Hongcow will get words “aabracadabr”, “raabracadab” and so on.
Hongcow is now wondering how many distinct words he can generate by doing the cyclic shift arbitrarily many times. The initial string is also counted.
Input
The first line of input will be a single string s (1 ≤ |s| ≤ 50), the word Hongcow initially learns how to spell. The string s consists only of lowercase English letters (‘a’–’z’).
Output
Output a single integer equal to the number of distinct strings that Hongcow can obtain by applying the cyclic shift arbitrarily many times to the given string.
Examples
input
abcd
output
4
input
bbb
output
1
input
yzyz
output
2
Note
For the first sample, the strings Hongcow can generate are “abcd”, “dabc”, “cdab”, and “bcda”.
For the second sample, no matter how many times Hongcow does the cyclic shift, Hongcow can only generate “bbb”.
For the third sample, the two strings Hongcow can generate are “yzyz” and “zyzy”.
题意:一个字符串,将最后一位字符放到第一位,其余的后移,这样不停循环,问这样可以得到多少个不同的字符串。
模拟即可,并用map对不同的字符串进行标记比对,检查是否出现过
#include<stdio.h>#include<string.h>#include<map>#include<string>using namespace std;int main(){ char a[58]; map<string,bool>m; while(scanf("%s",a)!=EOF) { int i,n=strlen(a); m[a]=true; int flag=1; for(i=1;i<n;i++) { char temp[58]; int k=0; for(int j=i;j<n;j++)temp[k++]=a[j]; for(int j=0;j<i;j++)temp[k++]=a[j]; temp[k]='\0'; if(m[temp]==false) { flag++; m[temp]=true; } } printf("%d\n",flag); }}
- Codeforces Round #385 (Div. 2)A.Hongcow Learns the Cyclic Shift【暴力】水题
- Codeforces Round #385 (Div. 2) 745A Hongcow Learns the Cyclic Shift
- Codeforces Round #385 (Div. 2) A. Hongcow Learns the Cyclic Shift
- A. Hongcow Learns the Cyclic Shift #385
- 【67.24%】【codeforces 745A】Hongcow Learns the Cyclic Shift
- CodeForces 745A Hongcow Learns the Cyclic Shift
- 745 A. Hongcow Learns the Cyclic Shift codeforces
- Hongcow Learns the Cyclic Shift CodeForces
- A. Hongcow Learns the Cyclic Shift
- 745A Hongcow Learns the Cyclic Shift
- cf Hongcow Learns the Cyclic Shift
- 【codeforce745A】Hongcow Learns the Cyclic Shift
- 周期串and Hongcow Learns the Cyclic Shift
- Codeforces Round #385 (Div. 2) B. Hongcow Solves A Puzzle
- Codeforces Round #385 (Div. 1)A. Hongcow Builds A Nation
- Codeforces Round #385 (Div. 2) -- C. Hongcow Builds A Nation(并查集)
- Codeforces Round #385 (Div. 2) -- B. Hongcow Solves A Puzzle (判断是否是矩形,水题)
- Codeforces Round #385 (Div. 2)B. Hongcow Solves A Puzzle【思维+暴力】
- js获取浏览器高度和宽度值
- SAP_BW建模第一步——创建信息对象(InfoObject)和信息立方体(InfoCube)
- MAC下MYSQL5.7.17连接不上的问题及解决办法
- ConcurrentHashMap分析
- Javascript定义类(class)的方法
- Codeforces Round #385 (Div. 2) A. Hongcow Learns the Cyclic Shift
- Java基础
- 创建并且new一个类的时候,发生了什么?
- C#如何对Mongodb进行增删改查
- 搞定!Firefox收藏夹默认在当前tab打开
- Android常用框架
- WPS 2016安装密钥
- Baidu Map 周边雷达
- Chrome 控制台高级用法