OJ Board

I've tested all the games I could imagine and it works fine. Yet I keep getting WA.

Could someone please provide me with a sample input for this problem?

Thanks a lot!

Ok I've found out that the problem is probably the enormous size of the possible entry data (numbers up to 10^50).

Since BigInteger in C++ is pretty limited (the only version I've found doesn't support square roots), I've done it in Java since I've already implemented a function to do the Square ...

Someone please help, this one is driving me nuts...

I think it's correct to assume that n= (g*m)-n -> 2n=g*m , and that for
r=2 all the possible combinations have the form g=m+1.

for example (letters are persons,rows are groups):

a a b d
b c c e
d e f f


Why doesn't this work? Thanks in ...