Prime Number
Intro Approach 1 gives the method to test whether n is a prime number.
Intro Approach 1 gives the method to test whether n is a prime number.
Intuition On first glimpse, I try DP and turn out TLE, shit again.
Intuition Binary Seaching to find the answer
Intuition I use dynamic programming on my first thought. It works but turns out to be TLE.
Intuition a^2 + b^2 = c; (a >= 0 & b >= 0 & a,b,c are integers)