// chap 7 p 1 from SAMS TYC++ in 21
// demo of nth fib number using iteration 
// instead of recursion

#include <iostream.h>

int fib(int position);

int main()
{

   int answer, position;
   
   cout << "Which Position? : ";
   cin >> position;
   
   answer = fib(position);
   cout << "The answer is : " << answer << endl;

   return 1;
   
}

int fib(int n)
{

   int minusTwo=1, minusOne=1, answer=2;
   
   if (n<3)
       return 1;
	   
	for (n-=3; n; n--)
	  {
	     minusTwo = minusOne;
		 minusOne = answer;
		 answer = minusOne + minusTwo;
      }
	  
	return answer;
	
}	           

// chap 7 p 2 of SAMS TYC++ in 21
//

#include <iostream.h>

int main()
{

   unsigned short int number;

   cout << "Enter a number :";
   cin >> number;

   switch(number)
   {
   case 0 : cout << "Too small...sorry\n";
	        break;
   case 5 : cout << "Good Job!\n";
   case 4 : cout << "Nice Pick!!\n";
   case 3 : cout << "You got 3 !! \n";
   case 2 : cout << "Masterful?\n";
   case 1 : cout << "Solid work\n";
	        break;
  default : cout << "Too Large!!\n";
		 break;
   }

   cout << "\n\n";
   return 1;
}

// test app

#include <iostream.h>

int main()
{

    int num1, num2;

	 cout << "Gimme a number : ";
	 cin >> num1;

	 cout << "\n OK!!!";

	 for ( num2 = num1; num2>=0; num2--)
	   {
	     cout << "print " << num1 << " " << num2 << " times!\n";
       }

    cout << "This is out of the loop and " << num1 << " wasn't decremented!\n";
    return 1;
}