zoukankan      html  css  js  c++  java
  • Codeforces554A:Kyoya and Photobooks

    Kyoya Ootori is selling photobooks of the Ouran High School Host Club. He has 26 photos, labeled "a" to "z", and he has compiled them into a photo booklet with some photos in some order (possibly with some photos being duplicated). A photo booklet can be described as a string of lowercase letters, consisting of the photos in the booklet in order. He now wants to sell some "special edition" photobooks, each with one extra photo inserted anywhere in the book. He wants to make as many distinct photobooks as possible, so he can make more money. He asks Haruhi, how many distinct photobooks can he make by inserting one extra photo into the photobook he already has?

    Please help Haruhi solve this problem.

    Input

    The first line of input will be a single string s (1 ≤ |s| ≤ 20). String s consists only of lowercase English letters.

    Output

    Output a single integer equal to the number of distinct photobooks Kyoya Ootori can make.

    Sample test(s)
    input
    a
    
    output
    51
    
    input
    hi
    
    output
    76
    
    Note

    In the first case, we can make 'ab','ac',...,'az','ba','ca',...,'za', and 'aa', producing a total of 51 distinct photo booklets.


    题意:

    给出一个字符串,问再增加一个字母。能形成多少种字符串


    #include <stdio.h>
    #include <string.h>
    
    int main()
    {
        char str[100];
        int len;
        scanf("%s",str);
        len = strlen(str);
        printf("%d
    ",26*(len+1)-len);
    
        return 0;
    }


  • 相关阅读:
    visual studio 2013运行时卡顿 CPU占用超50%的解决方法
    altium designer中Net Label 使用说明
    机器学习中的目标函数、损失函数、代价函数
    我的Android天气app
    序列交换
    挑战多重部分和问题
    kmp算法模式串匹配
    poj3259
    poj3255
    Redis工具类 单机+集群
  • 原文地址:https://www.cnblogs.com/lcchuguo/p/5147788.html
Copyright © 2011-2022 走看看