ZOJ 3171 The Hidden 7's
2013-05-19 08:14
316 查看
#include <iostream> #include <memory.h> #include <cstdio> using namespace std; const int maxn = 10001; char str[maxn]; long long dp[6]; int main(){ while (~scanf("%s", str)){ memset(dp, 0, sizeof(dp)); int len = strlen(str); for (int i = 0; i < len; ++i){ str[i] = tolower(str[i]); if(str[i] == 's'){ dp[0]++; }else if(str[i] == 'e'){ dp[1] += dp[0]; dp[3] += dp[2]; }else if(str[i] == 'v'){ dp[2] += dp[1]; }else if(str[i] == 'n'){ dp[4] += dp[3]; } } printf("%lld\n", dp[4]); } return 0; }
相关文章推荐
- zoj 3171 - The Hidden 7's
- zoj 3171 The Hidden 7's(= =。类似昨天FZU月赛D题)
- zoj 3171 The Hidden 7's DP
- zoj 3171 The Hidden 7's
- ZOJ 3171 The Hidden 7's DP
- ZOJ 3171题解
- [ZOJ 3633]Alice's present 离线分块/线段树
- ZOJ 3665 Yukari's Birthday (2012长春现场赛K题)
- ZOJ-3171
- ZOJ 3633 Alice's present (STL set)
- zoj 1100 - Mondriaan's Dream
- ZOJ 3633 Alice's present
- ZOJ 3665 Yukari's Birthday (2012长春现场赛K题)
- ZOJ3171 The Hidden 7's,DP版
- ZOJ 3171 The Hidden 7's DP
- zoj 2345 Gold Coins
- ZOJ 2947 Abbreviation
- ZOJ 3865 Superbot(广搜)
- ZOJ 2316 Matrix Multiplication(找规律)(矩阵和它的转置矩阵之积)
- zoj 1797 Least Common Multiple