319. 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.

s思路:
1. 老题了，画一下，就发现是个数学题。例如：6号这个灯泡，在第1次,第6次一开一关，在第2次,第3次一开一关，最后就回到了初始状态，用数学语言来说：6=1*6, 6还可以等于2*3,因此成对的操作就相互抵消了；那最后怎么还有灯泡是打开的呢？比如：4=1*4,4还可以等于2*2,看见没，4因为是完全平方，所以在2的时候只能操作一次而不能抵消，因此最后打开的灯泡都是完全平方数的位置。
2. 起始看到隔多少个灯泡操作一次，这个隔，也就表示了乘法的意思！

//方法１：老实版本
class Solution {
public:
    int bulbSwitch(int n) {

        int count=0;
        for(int i=1;i*i<=n;i++){
            count++;    
        }   
        return count;
    }
};

//方法２：有点没想到，还可以这么猥琐
class Solution {
public:
    int bulbSwitch(int n) {

        return sqrt(n);
    }
};