1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61
|
#include <iostream> #include <set> #include <algorithm> #include <string.h> #include <queue> using namespace std; const int N = 1e5 + 5; int arr[10005]; int ans[10005]; bool vis[10005]; int n, m; bool flag; int (int a,int b) { return a > b; } void dfs(int num,int indexx,int end) { if(num>n) return; if(num==n) { flag=true; cout << ans[1]; for (int i = 2; i < end;i++) { cout << "+" << ans[i]; } cout << "n"; return; } for (int i = indexx; i <= m; i++) { if(i==indexx||arr[i-1]!=arr[i]) {
ans[end] = arr[i]; dfs(arr[i] + num, i + 1, end + 1); } } } int main() { while((cin>>n>>m),m,n) { for (int i = 1; i <= m;i++) { cin >> arr[i]; } sort(arr + 1, arr + 1 + m,cmp); cout<<"Sums of "<<n<<":"<<endl; flag = false; dfs(0, 1, 1); if(!flag) { cout<<"NONE"<<endl; } } }
|
近期评论