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 i-th round, you toggle every i bulb. For the n-th round, you only toggle the last bulb. Find how many bulbs are on after nrounds.
Example:
Input: 3 Output: 1 Explanation: 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.
/*
只有灯被按奇数次 最后才能是开的 对于第i个等 eg i=16 16=1*16=2*8=4*4
即会在第1 2 4 8 16次按下 平方根因子会导致奇数次的出现
若共有n个灯 相当于求<=n的完全平方数有几个 即 int(sqrt(n))
*/
class Solution {
public:
int bulbSwitch(int n) {
return int(sqrt(n));
}
};