|
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 |
|
|
|
|
|
Continue the sequence O,T,T,... |
|
|
Puzzle statistics "A sequence of letters".
Last updated 6852844.2 minutes ago.
|
Solved by: 29
Daily average: 0
Answers submitted: 29
Viewed by: 295
Fraction solved by: 9.8%
Solved at first attempt: 96.5%
Average discussion length: 1.1
Liked the puzzle: 5
Did not like the puzzle:
0
|
|
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 6852844.2 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
|
|
How can a man be in a house without his head? |
|
|
Puzzle statistics "No head".
Last updated 6852844.2 minutes ago.
|
Solved by: 12
Daily average: 0
Answers submitted: 14
Viewed by: 291
Fraction solved by: 4.1%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 1
Did not like the puzzle:
0
|
|
Two rivers are flowing side by side. One is red, one is white. If they
are to meet, bad things will happen.
What are these rivers? |
|
|
Puzzle statistics "Two rivers".
Last updated 6852844.2 minutes ago.
|
Solved by: 8
Daily average: 0
Answers submitted: 11
Viewed by: 290
Fraction solved by: 2.7%
Solved at first attempt: 75%
Average discussion length: 1.8
Liked the puzzle: 1
Did not like the puzzle:
2
|
|
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 6852844.2 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
|
What's for dinner? |
Riddles, jokes |
|
Weight: 0 |
|
Liked the puzzle: 100% |
|
17.01.2010 |
|
A family cooks a dinner. The father decides to make a joke and puts a
handful of salt into the pot. A few
minutes later the eldest son does the same thing, followed by his two
younger brothers. A little daughter
had also added her handful of salt into the pot. When the dinner was
ready, everybody had to put more
salt into it. What was being cooked? |
|
|
Puzzle statistics "What's for dinner?".
Last updated 6852844.2 minutes ago.
|
Solved by: 5
Daily average: 0
Answers submitted: 8
Viewed by: 284
Fraction solved by: 1.7%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 1
Did not like the puzzle:
0
|
|
A microscope is a device that allows to see very small things, a
telescope is a device that allows to see
things far far away. What is the name of a device that allows to see
through the walls? |
|
|
Puzzle statistics "Seeing through the walls".
Last updated 6852844.2 minutes ago.
|
Solved by: 18
Daily average: 0
Answers submitted: 20
Viewed by: 280
Fraction solved by: 6.4%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 4
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 6852844.2 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
|
|
Late for work |
Other puzzles |
|
Weight: 0 |
|
Liked the puzzle: 66% |
|
24.01.2010 |
|
One Megamind lived in a country ruled by a ruthless despot,
terrorizing the entire population. The laws were so
strict that thousands of people were sentenced for any slight
misbehavior and thrown into prison. For being more than
10 minutes late for work, any unfortunate soul would be incarcerated
for 5 years. Once, an elderly worker was late
for 12 minutes. His immediate boss filed the report, and the worker
was arrested and tried in court. The court did not
have a choice of many defenders because everybody was afraid to become
one. The Megamind was also scared but
he also knew that there was a way to save the man, so he stepped up
and became the man's defense attorney. In
court, the Megamind addressed the audience and asked them a single
question. A few minutes later, the man was
set free by the court. What question did the Megamind ask? |
|
|
Puzzle statistics "Late for work".
Last updated 6852844.2 minutes ago.
|
Solved by: 3
Daily average: 0
Answers submitted: 5
Viewed by: 277
Fraction solved by: 1%
Solved at first attempt: 100%
Average discussion length: 1.0
Liked the puzzle: 2
Did not like the puzzle:
1
|
A ring in a coffee mug |
Riddles, jokes |
|
Weight: 0 |
|
Liked the puzzle: 100% |
|
29.01.2010 |
|
A Megamind accidentally dropped his ring into a mug with coffee. Yet
he managed to retrieve the ring
without wetting his finger. How could that happen? |
|
|
Puzzle statistics "A ring in a coffee mug".
Last updated 6852844.2 minutes ago.
|
Solved by: 9
Daily average: 0
Answers submitted: 13
Viewed by: 274
Fraction solved by: 3.2%
Solved at first attempt: 66.6%
Average discussion length: 2.0
Liked the puzzle: 2
Did not like the puzzle:
0
|
Page:
1
2
3
4
5
6
7
8
9
|
|