The origin of this problem is a math problem and you should find the rule in this problem.
My solution is the TLE solution. I learnt the awesome solution from internet.
The general idea of the awesome solution is finding the number of complete square number in n.
Try to calculate [1..36] bulbs switchers and you will find it.
However, I can't find this rule.
Problem319
Directory actions
More options
Directory actions
More options
Problem319
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||