The output should show 3 separate results clearly labeled.

C++ please

Let k be your birth year and let N be your 7-digit phone number. Use Euclid's Algorithm to find GCD(N, K), GCD(N, K + 1), and GCD(N, K + 2)