摘要:
"SCOI2009 Windy数" cpp //Copyright(C)Corona. //2018 10 07 include include include include include using namespace std; const int MAXN=18; long long f[M 阅读全文
摘要:
"A+B Problem" 终于调试通过了 zhx 讲的数位 DP 的引例:求0~n之间有多少个数(虽然感觉有点傻) 不过仔细一想还是有用处的!可以用来计算$a+b$! 即使测试数据中有负数也没关系 cpp //Corona's A+B Problem //数位DP //2018 10 07 inc 阅读全文