摘要:
阶乘因式分解(一)时间限制:3000 ms | 内存限制:65535 KB难度:2描述给定两个数m,n,其中m是一个素数。将n(0using namespace std;int f(int n, int m){ return n > t; while (t--) { int n, m; ci... 阅读全文
摘要:
Greedy Gift GiversA group of NP (2 ≤ NP ≤ 10) uniquely named friends hasdecided to exchange gifts of money. Each of these friends might ormight not gi... 阅读全文
摘要:
Your Ride Is HereIt is a well-known fact that behind every good comet is a UFO. TheseUFOs often come to collect loyal supporters from here on Earth.Un... 阅读全文
摘要:
01-复杂度2 Maximum Subsequence Sum (25分)Given a sequence of K integers { N1,N2, ..., NK }. A continuous subsequence is defined to be { Ni,N... 阅读全文