DataStructAndAlgorithmClass/2022-06-29.cpp at master · hun1001/DataStructAndAlgorithmClass · GitHub

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
#include <iostream>

using namespace std;

namespace MSCodingTest
{
	void DFS(int* arr, int level, int sum, int& cnt, int result);

	int main()
	{
		int n, m;
		int* arr;
		int cnt(0);

		cin >> n >> m;

		arr = new int[n];

		for (int i = 0; i < n; ++i)
		{
			cin >> arr[i];
		}

		DFS(arr, 0, 0, cnt, m);

		if (cnt == 0)
		{
			cout << -1 << endl;
		}
		else
		{
			cout << cnt << endl;
		}

		delete[](arr);

		return 0;
	}

	void DFS(int* arr, int level, int sum, int& cnt, int result)
	{
		if (level == (sizeof(arr) / 2) + 1)
		{
			if (sum == result)
			{
				cnt++;
			}
		}
		else
		{
			DFS(arr, level + 1, sum + arr[level], cnt, result);
			DFS(arr, level + 1, sum - arr[level], cnt, result);
			DFS(arr, level + 1, sum, cnt, result);
		}
	}
}

int main()
{
	int n;
	int* arr;

	cin >> n;
	arr = new int[n];

	for (int i = 0; i < n; ++i)
	{
		cin >> arr[i];
	}


	delete[](arr);
	return 0;
}