Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- int findSum(int* arr, int start, int end) {
- int sum = 0;
- for (int i = start; i < end; i++) {
- // sum += arr[i];
- sum += *(arr+i);
- }
- return sum;
- }
- bool solve(int *original, int *arr,int remainIndex, int currentIndex, int sum) {
- if (findSum(arr, 0, 8) > sum) {
- return false;
- }
- if (findSum(arr, 0, 8) + findSum(original, remainIndex, 8) < sum) {
- return false;
- }
- arr[currentIndex] = original[remainIndex];
- if (solve(original, arr, remainIndex + 1, currentIndex + 1, sum))
- return true;
- else {
- arr[currentIndex] = 0;
- return solve(original, arr, remainIndex + 1, currentIndex, sum);
- }
- return false;
- }
- int main() {
- int original[] = { 5,10,12,13,15,18 };
- int answer[6] = { 0 };
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement