CodeForces 554A-Kyoya and Photobooks【规律】-蒲公英云

CodeForces 554A-Kyoya and Photobooks【规律】

女爷i 2022-08-21 06:48 82阅读 0赞

A. Kyoya and Photobooks

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Examples

input

output

input

hi

output

Note

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

解题思路：

因为只能插入一个字符，所以重复的只能是每一个字母，在其前后插入和他相同的一个，比如aabb，对于第一个字符来说，我们就是a（a）abb和（a）aabb，这两个是重复的，要减去一个。

所以公式就是 26*（len+1）-len

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char map[100000];
int main()
{
    while(scanf("%s",map)!=EOF)
    {
        int len=strlen(map);
        printf("%d\n",25*len+26);
    }
    return 0;
}