/*
找规律,水
*/
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std; const int MAXN = 1e4 + ;
const int INF = 0x3f3f3f3f;
char s[]; int main(void) //Codeforces Round #309 (Div. 2) A. Kyoya and Photobooks
{
// freopen ("A.in", "r", stdin); while (scanf ("%s", s) == )
{
int len = strlen (s);
printf ("%d\n", * (len + ) - len);
} return ;
}
相关文章
- 【找规律】Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) B. Code For 1
- Codeforces Round #262 (Div. 2)D题(数位+找规律)
- 找规律 Codeforces Round #290 (Div. 2) A. Fox And Snake
- 【博弈论】【SG函数】【找规律】Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) E. Game of Stones
- 找规律/贪心 Codeforces Round #310 (Div. 2) A. Case of the Zeros and Ones
- Codeforces Round #260 (Div. 2) A B C 水 找规律(大数对小数取模) dp
- Codeforces Round #309 (Div. 2) C. Kyoya and Colored Balls 排列组合
- C. Kyoya and Colored Balls(Codeforces Round #309 (Div. 2))
- 找规律 Codeforces Round #309 (Div. 2) A. Kyoya and Photobooks
- Codeforces Round #309 (Div. 2) A. Kyoya and Photobooks 字符串水题