Codeforces Round #309 (Div. 2) A. Kyoya and Photobooks

简介:

题目链接:http://codeforces.com/contest/554/problem/A

#include <iostream>
#include <cstring>
using namespace std;

int main()
{
    char s[25];
    while(cin>>s)
    {
        int len=strlen(s);
        int sum=26*(len+1)-len;
        cout<<sum<<endl;
    }
    return 0;
}
目录
相关文章
|
人工智能 算法 BI
Codeforces Round 891 (Div. 3)
Codeforces Round 891 (Div. 3)
120 0
Codeforces Round 891 (Div. 3)
|
机器学习/深度学习
Codeforces Round #742 (Div. 2)
Codeforces Round #742 (Div. 2)
53 0
|
人工智能
Codeforces Round #786 (Div. 3)(A-D)
Codeforces Round #786 (Div. 3)(A-D)
72 0
Codeforces Round 799 (Div. 4)
Codeforces Round 799 (Div. 4)
121 0
|
人工智能 BI
Codeforces Round 827 (Div. 4)
Codeforces Round 827 (Div. 4)A~G题解
104 0
Codeforces Round #675 (Div. 2) A~D
Codeforces Round #675 (Div. 2) A~D
154 0
Codeforces Round #644 (Div. 3)(A~G)
Codeforces Round #644 (Div. 3)(A~G)
122 0
|
机器学习/深度学习
Codeforces Round #723 (Div. 2)B. I Hate 1111
Description You are given an integer x. Can you make x by summing up some number of 11,111,1111,11111,…? (You can use any number among them any number of times). For instance, 33=11+11+11 144=111+11+11+11
180 0
Codeforces Round #723 (Div. 2)B. I Hate 1111