A9899 | Kyoya and Photobooks
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
Please help Haruhi solve this problem.
输入格式
The first line of input will be a single string $s$ ( $1<=|s|<=20$ ). String $s$ consists only of lowercase English letters.
输出格式
Output a single integer equal to the number of distinct photobooks Kyoya Ootori can make.
输入输出样例
输入 #1
a
输出 #1
51
输入 #2
hi
输出 #2
76
In the first case, we can make 'ab','ac', $...$ ,'az','ba','ca', $...$ ,'za', and 'aa', producing a total of 51 distinct photo booklets.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted