摘要：
A string s of length ncan be encrypted by the following algorithm:iterate over all divisors of nin decreasing order (i.e. from n to 1)... 阅读全文
摘要：
模板请看上一篇博客Whuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were... 阅读全文
摘要：
背包详解请看 https://blog.csdn.net/Septembre_/article/details/81111812一：01背包特点：每种物品只有一件，可以选择放或不放dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+v... 阅读全文