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

 

题目传送门

 1 /*  2  找规律,水  3 */  4 #include <cstdio>  5 #include <iostream>  6 #include <algorithm>  7 #include <cstring>  8 #include <cmath>  9 using namespace std; 10 11 const int MAXN = 1e4 + 10; 12 const int INF = 0x3f3f3f3f; 13 char s[22]; 14 15 int main(void) //Codeforces Round #309 (Div. 2) A. Kyoya and Photobooks 16 { 17 // freopen ("A.in", "r", stdin); 18 19 while (scanf ("%s", s) == 1) 20  { 21 int len = strlen (s); 22 printf ("%d\n", 26 * (len + 1) - len); 23  } 24 25 return 0; 26 }

 

你可能感兴趣的:(codeforces)