摘要:
http://codeforces.com/contest/339/problem/C 1 #include 2 #include 3 #include 4 using namespace std; 5 6 int dp[1002][15][15]; 7 char str[100]; 8 i... 阅读全文
摘要:
http://codeforces.com/contest/337/problem/C得到的分数为:(2^1+2^2+...+2^X)*k + m-X*k = (2^(X+1)-2)*k + m-X*k;x的确定:max(0, m - (n - n mod k) / k * (k-1) - n mo... 阅读全文