摘要:
题目: Petya and Spiders传送门: http://codeforces.com/problemset/problem/111/C http://codeforces.com/problemset/problem/112/E分析:(1)由n·m<=40可以想到状态压缩动态规划,方程很好 阅读全文
摘要:
题目:Petya and Divisors传送门: http://codeforces.com/problemset/problem/111/B http://codeforces.com/problemset/problem/112/D 分析: 很容易想到读入x[i]、y[i],寻找x[i]的因数 阅读全文
摘要:
题目:Petya and Inequiations传送门: http://codeforces.com/problemset/problem/111/A http://codeforces.com/problemset/problem/112/C 分析: 先引一个简单的结论:“(a+b)^2>=a^ 阅读全文