CodeForces - 554A Kyoya and Photobooks （水）

CodeForces - 554A Kyoya and Photobooks Time Limit: 2000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u Submit Status Description 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 Input Input a Output 51 Input hi Output 76 Hint In the first case, we can make 'ab','ac',...,'az','ba','ca',...,'za', and 'aa', producing a total of 51 distinct photo booklets. Source Codeforces Round #309 (Div. 2) //题意： 给你一个字符串，在这个字符串中只能添加一个字母，在每个字母的前面或者后面都可以添加，问中共有几种添加的方法？ #include<cstdio> #include<cstring> #include<algorithm> using namespace std; char s[30]; int main() { while(scanf("%s",s)!=EOF) { int l=strlen(s); printf("%d\n",(l+1)*26-l); memset(s,0,sizeof(s)); } return 0; }