DSA- Number Theory in C++

DSA - Number Theory in C++

Hi, I am Jisha and I am participating in Hactoberfest 2021. I would like to contribute the following question in C++ for number theory. Please assign me this issue.

Question: Find two positive integers A and B, such that A-B=N where N is a given positive integer and the number of distinct prime factors of A and B are equal.

Constraints:
1<= N <= 10^16
1<= A, B <= 10^18

Example:
Input: 40
Output: The fisrt number is 80 and second number is 40

Thank you!