摘要： 思路： DP[ i ] 代表以 i 结尾的方案数. dp[i] += sum[i] - sum[j - 1] != 0 ? dp[j] : 0 ; 对于100%的数据，满足1using namespace std;typedef long long LL;const LL mod=1e9+7;... 阅读全文

摘要： codeforces 535A-水题； #include using namespace std;typedef long long LL;char s2[15][20]={"eleven","twelve","thirteen","fourteen","fifteen","sixteen","... 阅读全文