Question

Write a C++ program that reads in a list of integers, separated by a space, into an array of size N. The last number is -1 but should not be added to the array. The number of integers will be < N. Then output only those numbers, one per line, that are prime, perfect, the sum of a prime or perfect number, or a member of the well-known Fibonacci sequence.

Answer 1

PLEASE GIVE IT A THUMBS UP

nikhilanikhil-Vostro-15-3568:-/Desktop/CODE$ ./a.out 12 20 27 60 35 - 1 12 20 60 nikhil@nikhil-Vostro-15-3568:~/Desktop/CODES

#include <iostream>
using namespace std;

bool isPrime(int n)
{   
if (n <= 1)
return false;
for (int i = 2; i < n; i++)
if (n % i == 0)
return false;
  
return true;
}

bool isSumPrime(int n){
for(int i = 2; i <= n/2; ++i)
{
if (isPrime(i) == 1)
{
if (isPrime(n-i) == 1)
{
return true;
}
}
}
return false;
}

bool isPerfect(long long int n)
{   
long long int sum = 1;
for (long long int i=2; i*i<=n; i++)
{
if (n%i==0)
{
if(i*i!=n)
sum = sum + i + n/i;
else
sum=sum+i;
}
}
if (sum == n && n != 1)
return true;

return false;
}

bool isSumPerfect(int n){
for(int i = 2; i <= n; ++i)
{
if (isPerfect(i) == 1)
{
if (isPerfect(n-i) == 1)
{
return true;
}
}
}
return false;
}

int fib(int n)
{
if (n <= 1)
return n;
return fib(n-1) + fib(n-2);
}

bool isFib(int n){
int i=0;
while(i<n){
if(fib(i)==n)
return true;
if(fib(i)>n)
break;
i++;
}
return false;
}

int main(int argc, char const *argv[])
{
int arr[100000], ind = 0;
while(true){
int n;
cin>>n;
if(n==-1)
break;
arr[ind] = n;
ind++;
}
for(int i=0;i<1000;i++){
if(isPrime(arr[i]) || isPerfect(arr[i]) || isSumPrime(arr[i]) || isSumPerfect(arr[i]) || isFib(arr[i]))
cout<<arr[i]<<endl;
}
return 0;
}

-/Desktop/CODE/demo.cpp (CODE) - Sublime Text (UNREGISTERED) File Edit Selection Find View Goto Tools Project Preferences Help A.java X demo.cpp #include <iostream> using namespace std; bool isPrime(int n) if (n = 1) return false; for (int i = 2; i<n; i++) if (n % i == 0) return false; return true; bool isSumPrime(int n) { for(int i = 2; i <= n/2; ++i) if (isPrime(i) =1) if (isPrime(n-i) = 1) FOLDERS CODE html node_modules A cold.gif A cool.gif <> index.html /* main.js sun.png thun.png warm.gif zero.jpg A 1.jpg /* A.java a.out /* B.java Is code.txt data_keyword.se date.dat /* demo.c /* demo.cpp demo.csv /* demo.py /* demo.sh /* file1.json /* file2.json return true; return false; bool isPerfect(Zong Zong int n) Zong Zong int sum = 1; for (long long int i=2; i*i<=n; i++) if (ni==0) if(i i!=n) sum = sum + i + n/i; else sum=sum-i; != 1) if (sum= n && n return true; AB return false; Line 91, Column 4 Spaces: 2 C++

47 49 -/Desktop/CODE/demo.cpp (CODE) - Sublime Text (UNREGISTERED) File Edit Selection Find View Goto Tools Project Preferences Help FOLDERS A.java demo.cpp CODE 45 return false; 46 html bool isSumPerfect(int n) { node_modules for(int i = 2; i <= n; ++i) cold.gif if (isPerfect(i) = 1) A cool.gif if (isPerfect(n-i) = 1) <> index.html return true; /* main.js sun.png thun.png return false; warm.gif int fib(int n) zero.jpg if (n = 1) A 1.jpg return n; /* A.java return fib(n-1) + fib(n-2); a.out bool isFib(int n) { /* B.java int i=0; while(i<n) { Is code.txt if(fib(i)==n) return true; data_keyword.se if(fib(i)>n) date.dat break; i++; /* demo.c return false; /* demo.cpp demo.csv int main(int argc, char const *argv[]) /* demo.py int arr[100000], ind = 0; /* demo.sh 84 while(true) { int n; /* file1.json cin>>n; if(n=-1) /* file2.json break; arr(ind) = n; Line 91, Column 4 7 Spaces: 2 C++

-/Desktop/CODE/demo.cpp (CODE) - Sublime Text (UNREGISTERED) File Edit Selection Find View Goto Tools Project Preferences Help A.java demo.cpp return true; if(fib(i)>n) break; i++; return false; int main(int argc, char const *argv[]) int arr[100000], ind = 0; while(true) { int n; cin>>n; if(n=-1) break; arr(ind) = n; ind+; FOLDERS CODE html node_modules cold.gif A cool.gif <> index.html /* main.js sun.png A thun.png warm.gif zero.jpg A 1.jpg /* A.java a.out /* B.java e code.txt data_keyword.se date.dat /* demo.c /* demo.cpp demo.csv /* demo.py /* demo.sh /* file1.json /* file2.json for(int i=0;i<ind; i++){ if(isPrime(arr[i]) || isPerfect(arr[i]) || isSumPrime (arr[i]) || isSumPerfect(arr[i]) || isFib(arr[i])) cout<<arr[i]<<endl; return : Line 91, Column 4 Spaces: 2 C++

Here we are taking input till the user input -1 and then we are having the no. in the array, now we made some function to check wether the number is prime, perfect, sum of prime or perfect , comes in fib series, and then by checking every number in the array, we are checking it any of the above condition becomes true, then print the number.