很有成就感的说。。现在再看简直觉得难以想象,当时居然能用bfs做。。。虽然TLE了。。
Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9048 Accepted Submission(s): 6366
Problem 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[i]>0,1<=m<=N; My question is how many different equations you can find for a given N. For example, assume N is 4, we can find: 4 = 4; 4 = 3 + 1; 4 = 2 + 2; 4 = 2 + 1 + 1; 4 = 1 + 1 + 1 + 1; so the result is 5 when N is 4. Note that "4 = 3 + 1" and "4 = 1 + 3" is the same in this problem. Now, you do it!"
Input
The input contains several test cases. Each test case contains a positive integer N(1<=N<=120) which is mentioned above. The input is terminated by the end of file.
Output
For each test case, you have to output a line contains an integer P which indicate the different equations you have found.
Sample Input
4 10 20
Sample Output
5 42 627
Author
Ignatius.L
#include
<iostream>
#include
<queue>
#include
<set>
using
namespace
std;
#define
MAXN 120
int
n,CNT;
//输
入
的
规
模
n和
结
果
CNT
set<multiset<
char
> > S[MAXN+1];
//存
储
访
问
信
息
struct
node
{
int
x;
//当
前
位
置
multiset<
char
> s;
//节
点
自
身
路
径
}init,now,nextt;
queue<node> Q;
int
BFS()
{
for
(
int
j=0;j<MAXN+1;++j) S[j].clear();
CNT = 0;
for
(
int
k=1;k<=n;++k) //先放n个初始节点进去
{
node nod;
nod.x = k;
nod.s.insert(k);
Q.push(nod);
S[k].insert(nod.s);
}
init.x = 0;init.s.clear();
Q.push(init);
while
(!Q.empty())
{
now = Q.front();Q.pop();
if
(now.x==n) {CNT++;
continue
;}
for
(
int
i=1;i<=n;++i)
{
nextt.x = now.x+i;
nextt.s = now.s;
nextt.s.insert(i);
if
(nextt.x<=n&&S[nextt.x].count(nextt.s)==0)
{
Q.push(nextt);
S[nextt.x].insert(nextt.s);
}
}
}
return
CNT;
}
int
main()
{
while
(cin>>n)
cout<<BFS()<<endl;
return
0;
}
|