12 2016 档案
摘要:CA Loves GCD Accepts: 135 Submissions: 586 Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) CA Loves GCD Accepts: 13
阅读全文
摘要:Claris and XOR Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 744 Accepted Submission(s): 330 Pr
阅读全文
摘要:设f[x]为x的最小变为1步数 initialize: f[1]=0 equation: f[x]=min{f[x-i](i<=t),f[x/k](if x%k==0)} (x:1~x) 对于求min{f[x-i](i<=t)} 使用单调队列维护区间最小f[x-i] #include <iostre
阅读全文
摘要:#include <cstdio> #include <cstring> #include <cmath> #include <algorithm> using namespace std; char a[10010]; int main() { int T; scanf("%d",&T); whi
阅读全文