OJ Board

I solved this problem in 2 ways, but I got 7 WA's in contest. Can anybody give some test cases plz? I really have no idea why I'm getting WA

It is easy when N=1. You can find a formula.
Then you can find all possibilities horizontal and verticals.
After that you need to calculate diagonals (2 kind). The hardest thing might be the case N!=M.
Here is one formula you may use 1+4+9+...+n*n=n(n+1)(2n+1)/6
Good luck.

visit: http://www.youngprogrammer.com to get test data

Thank you for your help Chimed. I used a formula to calculate result, and tested the program with LIMON's test data and it gives correct answer, but I'm still getting WA . This is my code:

You are having integer overflow. Check for n = 1000000 and m = 1000000.

Hello!

Use unsigned long long int.

Thank you Samiul and SeregiB for your help! I finally got AC after 8 tries

Why i got wa so many times?

Does your program print the sample output correctly..??

I solved the problem... n m sorry 4 d previous post.
That wasn't the real 1.