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

 

 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 }

 

转载于:https://www.cnblogs.com/Juntaran/p/5479107.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值