Project Euler #166: Criss Cross

  • + 0 comments

    For a given n, there are (n+1)^16 computations to be performed, to find out all matrices possible, clearly TLE, can anyone give a headstart?