科大讯飞笔试编程第二道内容是一个序列和为180,求一部分和为60另一部分和为120的所有可能方案个数
测试输入
6
10 20 30 30 40 50
输出
216
别人的方案参考 :全排列dfs
自己代码(还没测试)
#include<bits/stdc++.h>
using namespace std;
int n_jiecheng(int n) {
int ans =1;
for (int i = 1; i <= n; i++){
ans *= i;
}
return ans;
}
void backtrack(vector<int>&vec, int target, int sum, int *num, int start, vector<int>& path, int N) {
if (sum == target ){
int k = path.size();
for (int i = 0; i < k; i ++){
cout <<"path"<< path[i] << endl;
}
*num += n_jiecheng(N - k);
cout << *num <<endl;
}
int length = vec.size() ;
for (int i = start; i <=length; i++) {
path.emplace_back(vec[i]);
sum += vec[i];
backtrack(vec, 60, sum, num, i + 1, path, N);
sum -=vec[i];
path.pop_back();
}
}
int main(){
vector<int>path;
vector<int> vec;
int N, num;
cin >>N;
while(N--){
cin >> num;
vec.push_back(num);
}
int result = 0;
backtrack(vec, 60, 0, &result, 0, path, vec.size());
cout << result << endl;
return 0;
}