11859 - Division Game

[Angeh]

How To solve This Problem ??
i think we should count the number of all devisors of all numbers of each row ...
but From here i dont know how to solve the Problem ...
(
Edit : ok solved it ) so easy problem ...

[4085293]

I hava a problem in 11859 Division Game.
Can you help me!
I have count the divisor but not corect!
Please help me! please please please please.........!
Please send me a massage a soon as posible!
thank you for your help!

[898989]

I am getting WA

I think this problem should be solving by finding grundy number for each row, then applying nim on them as if they are piles size.
I could not code efficient grundy, so through small brute force, i thought grundy of row will be equal to:
sum of powers for all prime numbers in a row. So if row has {4, 12} then {2^2, 2^2*3^1} then pile size = 2+2+1

any hints, and if this pile size is correct that way, why?

[4085293]

thanks you FOR RELY!
althought I don't know much english but I thinks I understand what you say!
let's me try!
if I have another mistake in this problem I will tell after!
THANKS YOU.

[4085293]

I aldredy do what you talk but still WA!
I STILL NEED MORE HELP!
PLEASE PLEASE PLEASE PLEASE PLEASE PLEASE PLEASE PLEASE PLEASE PLEASE !

[Angeh]

Count the piles ...
See Problem 10165 ...
its The same as this problem ...
Use Xor Principle for Solving nim ...

[4085293]

Thanks very much! AC!

[naseef_07cuet]

Dear Angeh,
can you explain more?

[Angeh]

count the number of all devisors of all numbers of each row ...
now if he Xor of these numbers is zero print no else yes ...
see the problem in my previous comment ..