Can anyone shed light on how to complete this problem in Cpp. The problem requires the function to return int while the ouput can exceed the bound of a 32-bit integer? Does this not make it fundamentally impossible to correctly implement a Cpp solution? Am I dumb (yes but thats beside the point)...?

this is my code in python, it exceeded the time with Python3 but passed with PyPy3

def fibonacciModified(t1, t2, n):
    prev, prev2 = t2, t1
    
    for step in range(2,n):
        prev, prev2 = prev**2 + prev2, prev

    return prev

the number is too big

My solution Js, using memoization and closures.

function fibonacciModified(t1, t2, n) {
    // Write your code here
    return memoized(t1, t2)(n);
}

const memoized = (t1, t2) => {
    const obj = { 1: BigInt(t1),
                  2: BigInt(t2) };
    return function fib(n) {
        if (obj[n]) {
            return obj[n]; 
        } else {
            if (n === 1) {
                return BigInt(t1);
            } else if (n === 2) {
                return BigInt(t2);
            } else {
                obj[n] = BigInt(fib(n - 2)) + BigInt(fib(n - 1) ** BigInt(2));
                return obj[n];
            }
        }
    } 
# };

this problem can't be solved in c# unless you modify the return type, int can't handle the upper bound, so changed to string, used BigInteger internally and then it worked, this should be fixed in order to actually solve the problem, as it state "The function is expected to return an INTEGER." that is not valid