Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- bool isPrime(unsigned number) {
- for (int i = 2; i < number / 2; i++)
- {
- if (number % i == 0)
- {
- return false;
- }
- else
- {
- return true;
- }
- }
- }
- bool isFibonacciNumber(int number) {
- int num1 = 0;
- int num2 = 1;
- int nextNum = 1;
- int * storage = new int[number];
- int counter = 0;
- for (int i = 0; i < number; i++)
- {
- nextNum = num1 + num2;
- storage[counter] = nextNum;
- counter++;
- if (nextNum > number)
- {
- break;
- }
- num1 = num2;
- num2 = nextNum;
- }
- bool flag = false;
- for (int i = 0; i < counter; i++)
- {
- if (number == storage[i])
- {
- flag = true;
- break;
- }
- else
- {
- flag = false;
- }
- }
- if (flag == true )
- {
- return true;
- }
- else
- {
- return false;
- }
- }
- int main()
- {
- int number;
- cin >> number;
- cout << isPrime(number);
- cout << "\n";
- if (isFibonacciNumber(number) == true)
- {
- cout << "It is a fibonacci number." << endl;
- }
- else
- {
- cout << "It is not a fibonacci number." << endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement