I have this C++ task:

In the finished program code base, implement a program that divides the given input into two factors that are as close as possible to each other.

At first, the program asks for a positive number (input). If zero or a negative number is given as input, the program prints "Only positive numbers accepted". Otherwise, the program prints the product and its two factors. The smaller of the factors is printed first.

Below are a few examples of how the program works.

Here is a small template:

#include

using namespace std;

int main() { cout

// Write your code here

return 0; }

Thank you so much in ahead!

Enter a positive number: 20 20=45 Enter a positive number: 16 16=44 Enter a positive number: 5 5=15 Enter a positive number: 60 60=610 Enter a positive number: 0 Only positive numbers accepted