package com.fishercoder.solutions;

/**
 * 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.
 */
public class _319 {

    public static class Solution1 {
        public int bulbSwitch(int n) {
            if (n < 2) {
                return n;
            }
            return (int) Math.sqrt(n);
        }
    }

}

@@ -33,711 +33,8 @@
 s;%0A%0A
-/**%0A * 319. Bulb Switcher%0A *%0A * There are n bulbs that are initially off. You first turn on all the bulbs.%0A * Then, you turn off every second bulb. On the third round,%0A * you toggle every third bulb (turning on if it's off or turning off if it's on).%0A * For the ith round, you toggle every i bulb. For the nth round, you only%0A * toggle the last bulb. Find how many bulbs are on after n rounds.%0A%0A Example:%0A%0A Given n = 3.%0A%0A At first, the three bulbs are %5Boff, off, off%5D.%0A After first round, the three bulbs are %5Bon, on, on%5D.%0A After second round, the three bulbs are %5Bon, off, on%5D.%0A After third round, the three bulbs are %5Bon, off, off%5D.%0A%0A So you should return 1, because there is only one bulb is on.%0A */%0A
 publ

refactor 319