Search:

My function is working, but thanks I think I understand what you're trying to say



int Fibonacci (int n)
{
int a = 1,
b = 0,
sum;

I think I got it I fixed it to be this, but now my issue is I'm asking for it to return the sum for Case B but it's duplicating the last entry i.e. when I put in 5 I get 1, 1, 2, 3, 5, 5. I tried...

Can someone throw me a hint on how to only print the end result of an iteration? This is in regards to Case C in the program. I just copied and pasted the loop I have in Case B, but like I said I...

Thank you so much! When you keep looking at something over and over again you seem to miss something so logical. It works perfect now!

Figured it out!




#include <iostream>
using namespace std;

void PrintHistory();
int FirstN();

For some reason my program doesn't work. When I enter 'E' or 'e' it won't quit the program. Have I done something wrong? I keep looking at it so maybe I'm overlooking something any help would be...

The input works wells but I don't really know how to apply the conversion and get the output.

#include <iostream>
#include <string>

using namespace std;

int main()
{
int number, door;