zoukankan      html  css  js  c++  java
  • Codeforces Round #385 (Div. 2) A. Hongcow Learns the Cyclic Shift

    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]='';
                if(m[temp]==false)
                {
                    flag++;
                    m[temp]=true;
                }
            }
            printf("%d
    ",flag);
        }
    }
    
  • 相关阅读:
    [No0000C9]神秘的掐指一算是什么?教教你也会
    [No0000C8]英特尔快速存储IRST要不要装
    [No0000C7]windows 10桌面切换快捷键,win10
    [No0000C6]Visual Studio 2017 函数头显示引用个数
    [No0000C4]TortoiseSVN配置外部对比工具
    [No0000C5]VS2010删除空行
    [No0000C3]StarUML2 全平台破解方法
    [No0000C2]WPF 数据绑定的调试
    [No0000C1]Excel 删除空白行和空白列VBA代码
    [No0000C0]百度网盘真实地址解析(不用下载百度网盘)20170301
  • 原文地址:https://www.cnblogs.com/kuronekonano/p/11794338.html
Copyright © 2011-2022 走看看