LeetCode 319

 1 /*************************************************************************
 2     > File Name: LeetCode319.c
 3     > Author: Juntaran
 4     > Mail: Jacinthmail@gmail.com
 5     > Created Time: Tue 10 May 2016 05:52:58 PM CST
 6  ************************************************************************/
 7  
 8 /*************************************************************************
 9     
10     Bulb Switcher
11     
12     There are n bulbs that are initially off. You first turn on all the bulbs. 
13     Then, you turn off every second bulb. On the third round, you toggle every third bulb 
14     (turning on if it‘s off or turning off if it‘s on). 
15     For the ith round, you toggle every i bulb. For the nth round, you only toggle the last bulb. 
16     Find how many bulbs are on after n rounds.
17 
18     Example:
19 
20     Given n = 3. 
21 
22     At first, the three bulbs are [off, off, off].
23     After first round, the three bulbs are [on, on, on].
24     After second round, the three bulbs are [on, off, on].
25     After third round, the three bulbs are [on, off, off]. 
26 
27     So you should return 1, because there is only one bulb is on.
28 
29  ************************************************************************/
30 
31 #include <stdio.h>
32 
33 int bulbSwitch( int n )
34 {
35     int i;
36     while( i*i <= n )
37     {
38         i++;
39     }
40     return i-1;
41 }
42 
43 int main()
44 {
45     int n = 5;
46     int ret = bulbSwitch(n);
47     printf("%d\n", ret);
48     return 0;
49 }