C++ Projects

  *.Fibonnaic sequence :- The Fibonnaic Sequence is a series of numbers in which each number is the sum of two preceding numbers. #.Code :-  # include < iostream > using namespace std ; void adtn_fun ( int x , int y , int z ){     for ( int i = 0 ; i < z ; i ++){         int sum = x + y ;         cout << ( i + 1 ) << " . : " << x << " + " << y << " = " << sum << endl ;         int temp = x ;         x = y ;         y = sum ;         sum = temp ;     } } int main (){     int n1 , n2 ;     cout << " enter 1st num : " ;     cin >> n1 ;     cout << " enter 2nd num : " ;     cin >> n2 ;     int loop ;     cout << " enter how many times you want to perform function : " ; ...

*. ArmStrong Number :- ArmStrong Number is equal to the sum of cube of its all digits #.Code :- # include < iostream > using namespace std ; int main (){     /*ArmStrong Number are the number whose addition of cube of every digit is equal to that number*/     int num ;     cout << " Enter  a num : " ;     cin >> num ;     const int num2 = num ;     int store ;     int str ;     int arm_num = 0 ;     while ( num > 0 ){         store = num % 10 ;         str =( store * store * store );         arm_num += str ;         num = num / 10 ;     }     if ( num2 == arm_num ){         cout << num2 << " is armstrong number " ;     }     else {         cout << num2 << " is not armstrong...