题目大意:
就是给出 n <= 500
然后构造有重复元素的集合, 问其中一共有n个元素且所有元素和和积相同的集合有几个
使用的元素必须是正整数
大致思路:
其实就是一个剪枝的搜索
可以考虑到这样的集合数量肯定是不多的, 于是剪枝搜索即可
平常搜索写的比较少....还是写了一下题解...
代码如下:
Result : Accepted Memory : 184 KB Time : 60 ms
/*
* Author: Gatevin
* Created Time: 2015/9/2 15:04:39
* File Name: fz.cpp
*/
#include<iostream>
#include<sstream>
#include<fstream>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<ctime>
#include<iomanip>
using namespace std;
const double eps(1e-8);
typedef long long lint;
int n;
int ans;
void dfs(int now, int sum , int pro, int num)
{
if(sum < pro && num > 1) return;
if(now == 0)
{
ans += (sum == pro);
return;
}
if(num == 1)
{
dfs(now - 1, sum + 1, pro, 1);
for(int k = num + 1; sum + k >= pro*k && k <= 500; k++)
dfs(now - 1, sum + k, pro*k, k);
}
else
{
for(int k = num; sum + k >= pro*k && k <= 500; k++)
dfs(now - 1, sum + k, pro*k, k);
}
}
int main()
{
freopen("sump.in", "r", stdin);
freopen("sump.out", "w", stdout);
ans = 0;
scanf("%d", &n);
dfs(n, 0, 1, 1);
printf("%d\n", ans);
return 0;
}