
1. 
pretorik 
 
161 
2. 
markr 
 
116 
3. 
Gordon Weir 
 
104 
4. 
mbloomfi 
 
97 
5. 
Dennis Nazarov 
 
96 
6. 
zzz123 
 
72 
7. 
Srikanta 
 
56 
8. 
lidSpelunker 
 
53 
9. 
SAMIH FAHMY 
 
48 
10. 
jkr 
 
44 




1. 
denisR, mishik 
 
236 
2. 
alan, De_Bill 
 
231 
3. 
dddfff 
 
228 
4. 
kavfy 
 
221 
5. 
idler_ 
 
106 
6. 
akajobe 
 
94 
7. 
tolstyi 
 
56 
8. 
STARuK 
 
42 
9. 
vale 
 
31 
10. 
xandr 
 
11 





A positive integer is given. How can you determine whether it is a
power of 2 without using recursion and floating point operations? 


Puzzle statistics "A power of 2".
Last updated 6071594.3 minutes ago.

Solved by: 7
Daily average: 0
Answers submitted: 13
Viewed by: 291
Fraction solved by: 2.4%
Solved at first attempt: 28.5%
Average discussion length: 3.9
Liked the puzzle: 4
Did not like the puzzle:
0


A text of a C code is given below. Find three different ways to
replace one symbol so that the resulting code would print 20
asterisks. A symbol has to be replaced, not added or deleted.
main() { int i, N=20; for (i = 0 ; i < N ; i) { printf("*"); } } 


Puzzle statistics "Twenty asterisks".
Last updated 6071594.3 minutes ago.

Solved by: 3
Daily average: 0
Answers submitted: 4
Viewed by: 286
Fraction solved by: 1%
Solved at first attempt: 66.6%
Average discussion length: 2.0
Liked the puzzle: 2
Did not like the puzzle:
0


I. A large array of integer values is given. All values appear twice
except one which appears once. How to find this value using at most
O(1) additional variables and browsing through the entire array at
most O(1) times.
II. Same, except now exactly two values appear once. 


Puzzle statistics "An integer array".
Last updated 6071594.3 minutes ago.

Solved by: 3
Daily average: 0
Answers submitted: 5
Viewed by: 280
Fraction solved by: 1%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 1
Did not like the puzzle:
0


