-
Notifications
You must be signed in to change notification settings - Fork 0
/
357.c
53 lines (43 loc) · 1.33 KB
/
357.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
/*
Solution for the problem 357 of aceptaelreto.com
- La prueba de las cajas y las bolas -
Copyright (C) 2017 hnko
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdio.h>
#include <math.h>
/* is the floor of the log base 2 of n */
long long count (long long n){
if(n==1) return 1;
else{
if(n%2!=0) return count(n-1);
else return 1+count(n/2);
}
}
/* 1 2 3 4 5 --- count(n-1)
1 2 x 1 2 --- 1+count(n/2)
1 x x 1 x --- 1+count(n/2)
x x x x x --- 1
------------------
1+1+1=3
*/
int main(int argc, char const *argv[])
{
long long t;
while(scanf("%lld", &t)!=EOF){
printf("%lld\n",count(t));
}
return 0;
}
/* this is a better option
printf("%.lf\n", floor(log(t)/log(2))+1);
*/