leetcode319 Bulb Switcher

319. Bulb Switcher

Total Accepted: 12416 Total Submissions: 31335 Difficulty: Medium

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 theith round, you toggle every i bulb. For the nth round, you only toggle the last bulb.Find how many bulbs are on aftern 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.

题意：

初始所有灯都是灭的，

第一回合打开a[1]，a[2]......a[n]

第二回合打开a[2]，a[4].......

第 i 回合打开a[i]，a[2 * i]，a[3 * i]

n盏灯n回合，问最后有多少灯是开的。

思路：

以下代码n*n的时间复杂度会超时，不过可以用来打表，把其他值输出来，能找到一个规律。。

打表：

#include <iostream>

using namespace std;

int main()
{
    int n = 0;
    while (++n <= 100)
    {
        int ans = 0, a[105] = {0};
        for (int i = 1; i <= n; ++i)
        {
            for (int j = i; j <= n; j += i)
                a[j] ^= 1;
        }
        for (int i = 1; i <= n; ++i)
            if (a[i])
                ++ans;
        cout << n << "\t" << ans << endl;
    }
    return 0;
}

AC代码：

class Solution {
public:
    int bulbSwitch(int n) {
        return sqrt(n);
    }
};