Advertisement
Guest User

Untitled

a guest
Feb 25th, 2018
73
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.03 KB | None | 0 0
  1. #include <iostream>
  2. #include <conio.h>
  3.  
  4. using namespace std;
  5.  
  6. void findDividers(){
  7.  
  8.     int number;
  9.     cout << "Give number: ";
  10.     cin >> number;
  11.     cout <<"\n";
  12.  
  13.     int dividers[20] = {};
  14.     int counter = 0;
  15.     for (int i = 1; i <= number; ++i){
  16.     if (number % i == 0){
  17.         dividers[counter] = i;
  18.         counter++;
  19.         }
  20.     }
  21.  
  22.     cout << "number: " << number << "\n" << "dividers: ";
  23.     for(int i=0;i<= (sizeof(dividers)/sizeof(dividers[0])) - 1;i++){
  24.         if(dividers[i] != 0)
  25.             cout << dividers[i] << " ";
  26.     }
  27. }
  28.  
  29. void fibonacci(){
  30.     int howManyNumbers;
  31.     cout << "\n\nHow many numbers?: ";
  32.     cin >> howManyNumbers;
  33.  
  34.     int series[100];
  35.     series[0] = 1;
  36.     series[1] = 1;
  37.     cout << "\n" << "Fibonacci series: \n" << series[0] << " " << series[1] << " ";
  38.     for( int i=2 ; i<howManyNumbers+2 ; i++){
  39.         series[i] = series[i-1] + series[i-2];
  40.         cout<< series[i] << " ";
  41.     }
  42.  
  43. }
  44. int main()
  45. {
  46.     findDividers();
  47.     fibonacci();
  48.     return 0;
  49. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement