LeetCode-319.Bulb Switcher

https://leetcode.com/problems/bulb-switcher/

There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it's off or turning off if it's on). For the ith round, you toggle every i bulb. For the nth round, you only toggle the last bulb. Find how many bulbs are on after n rounds.

Example:

Given n = 3. 

At first, the three bulbs are [off, off, off].
After first round, the three bulbs are [on, on, on].
After second round, the three bulbs are [on, off, on].
After third round, the three bulbs are [on, off, off]. 

So you should return 1, because there is only one bulb is on.

其实上一道找规律题

n=1-3 on:1

n=4-8 on:1,4

n=9-15 on:1,4,9

可以发现on的都是平方数。

并不是巧合，因为：

针对序号k,只有k的因数轮可以改变它的状态，如

10：改变其状态的有(1 10),(2 5)轮，成对出现，因此最后状态为off

25：改变其状态的有(1 25),(5 5)轮，初恋(5 5)其它成对出现，因此最后状态为on

因此

int bulbSwitch(int n)
    {
        return sqrt(n);
    }