-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathf80789_3a.cpp
More file actions
86 lines (74 loc) · 1.28 KB
/
f80789_3a.cpp
File metadata and controls
86 lines (74 loc) · 1.28 KB
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
using namespace std;
int taken[22];
int n, k;
bool found = false;
vector<int> numbers;
void rec(int i)
{
if (found) return;
if (i == n)
{
int sum = 0;
for (int j = 0; j < n; j++)
{
// cout << taken[j] << " ";
if (taken[j] == 0)
{
sum += numbers[j];
}
else
{
sum -= numbers[j];
}
}
//cout << " - " << sum << endl;
if (sum == k)
{
for (int j = 0; j < n; j++)
{
if (taken[j] == 1)
{
cout << -numbers[j];
}
else
{
if (j > 0) cout << '+';
cout << numbers[j];
}
}
cout << "=" << k << endl;
found = true;
}
return;
}
rec(i + 1);
taken[i] = 1;
rec(i + 1);
taken[i] = 0;
}
int main()
{
string line;
int enterNumber;
while (getline(cin, line))
{
istringstream iss(line);
while (iss >> enterNumber)
{
numbers.push_back(enterNumber);
}
k = numbers[numbers.size() - 1];
numbers.pop_back();
n = numbers.size();
rec(1);
if (!found) cout << endl;
found = false;
numbers.clear();
for (int i = 0; i < 22; i++) taken[i] = 0;
}
return 0;
}