题目:给你数n,问n可以有哪些组成方案(这些n的数字个数不超过n),母函数模板题 #include <cstdio> #include <cstring> #include <algorithm> using namespace std; int n; int a[125], t[125];//a[i]表示x^i的系数,即凑成数i的方案数 int main() { while (1 == scanf("%d", &n)) { for (int…
Description "Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says. "The second problem is, given an positive integer N, we define an equation like this: N=a[1]+a[2]+a[3]+...+a[m]; a…
Ignatius and the Princess III Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 12521 Accepted Submission(s): 8838 Problem Description "Well, it seems the first problem is too easy. I will let…
Square Coins Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9903 Accepted Submission(s): 6789 Problem Description People in Silverland use square coins. Not only they have square shapes but…
链接: https://vjudge.net/problem/HDU-1028 题意: "Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says. "The second problem is, given an positive integer N, we define an equation like this:…