[c++] array
 

hi all, the question is:

write a program that inputs 6 integers,and then checks to see if any combination of exactly three of the first 5 integers adds up to the last integer.

test cases:

1)input -----> 1 -2 4 -1 15 17 output -------> Yes. -2+4+15=17
2) 3 12 11 -4 16 7 No.


It doesnt work though, any help would be appreciated.
this is what i have so far:




#include <iostream>
using namespace std;



int main()


{

const int size=6; //defines the size N for 6 elements
int a[6]; //declares the array's elements as integers
int i = 0;

cout << "Enter six numbers: ";
for (i=0;i<size;i++)
cin >> a[i];

for (i=0; i < 5;i++)
if ((a[i] + a[i+1] + a[i+2]) == a[5])

{

cout << "Yes." << a[i] << "+" << a[i+1] << "+" << a[i+2] << "=" << a[5];
}

else
cout << "No.";

return 0;

}

how does it not work? does it break on compile? where does it break?

Looks to me like your numbers are going into the array correctly but your comarison is off.
You need to compare 012 then 023 then 034 then 123 then 134, etc.
Probably need a nested for loop for that.

for (int i = 0; i <= 2; i++){

for (int k = 1; k <= 3; k++){

...etc...

it looks like your only checking the first 3 numbers... you need to make if statements that check all the other numbers in the array also...

so right now your checking
if ((a[i] + a[i+1] + a[i+2]) == a[5])
which is checking if the first +second + third == sixth

next you would prolly want to check
if ((a[i] + a[i+2] + a[i+3]) == a[5])
checking if the first + third + fourth == sixth

doin it the way im mentioning ya prolly dont really need to put em in the loop...
just do if ((a[0] + a[1] + a[2]) == a[5])

seems like there should be a better way instead of just tons of if statements...

oops, strider posted while I was editing :) same thing though

using a pair of nested loops would be better then a ton of if statements...

I just had a go at this.. didn't take long. Not sure if there's a "better" way of doing this but (not gonna paste my code) i used 3 for loops and selected the initialisation and test statement of each looping variable (i, j, k) very carefully.

Tip: Try writing out all the combinations of array indexes that will need to be checked. You'll find there's a systematic way of doing it that avoids duplications.

Any combination? If you really mean that then it sounds like everybody has misinterpreted your question.

For instance, 3 5 7 8 -2 6 -> yes, 3+5-2=6.

If this is, indeed, the problem you're trying to solve then your printed algorithm is totally naive and no one has come close to solving it.

I'll wait to see if this is your actual problem but this isn't hard to solve. My intuition is that you'll need to solve it recursively. Are you familiar with recursion?

I did solve it in that way: _any_ combination. Although i didnt use recursion, just 3 nested for loops and a bit of logic. It took 16 lines of code (including }'s on single lines) inside the main method.

the question was on a midterm, after submitting my answer i came home and posted that original post.

the prof later posted the question on his site. here is the exact question:

Q1. Write a program that inputs 6 integers, and then checks to see if any combination of exactly three of the first 5 integers adds up to the last integer.

Test Case 1 (TC1): Input 1 –2 4 –1 15 17 Output Yes. – 2 + 4 + 15 = 17
TC2: Input 3 12 11 –4 16 7 Output No.
TC3: Input 0 12 23 –1 11 11 Output Yes. 0 + 12 + – 1 = 11

Considering you've already done the midterm i think its justified to post my version of it. I'd be interested to know if its close to the actual answer.
As you can see its pretty close to the functionality given in the spec but if there are no matches, it won't say "No." it'll just end. Also, it'll list all matching combinations that add up to nums[5].

running your code.....

Enter 6 numbers:
1:> -1
2:> -2
3:> 4
4:> 6
5:> 7
6:> 8
Yes: -2 + 4 + 6 = 8

thats correct. thanks

here is the solution posted by the prof.
A little more sophisticated than I thought.

i wouldn't call that too sophisticated, but that is mainly because of two reasons.

1. He checks combinations that he had already checked.
2. Even after a match is found he continues to check for other matches, but he only stores the last one found. I would either have it exit on that match or at least save all possible matches.