| Title |
User |
Message |
Place |
Date Posted |
| Hint |
hansonw1 |
Make a recursive function f(n) that gives the minimum # of moves required to topple the first n dominoes. Now how do you relate f(n) to previous values of f? Domino #n has two choices: go left (in wh... |
domino |
Dec 06, 2008 - 3:31:22 am UTC |
| Hint 2 |
hansonw1 |
The approach to generate these combinations is quite similar to COCI08 #2 - Perket. |
clique |
Dec 06, 2008 - 3:29:02 am UTC |
| Re: Re: Re: output |
bleung91 |
hey, Comp Sci is a noble subject, don't you think? It's the subject of the kings. |
wc01Sp5 |
Dec 06, 2008 - 3:00:47 am UTC |
| Re: recursion |
bleung91 |
that's for you to figure out. |
wc95p3 |
Dec 06, 2008 - 12:33:56 am UTC |
| recursion |
qinhaotian |
how do u use it? |
wc95p3 |
Dec 05, 2008 - 11:57:40 pm UTC |
| Re: Re: output |
SourSpinach |
Lol... "nobly" |
wc01Sp5 |
Dec 05, 2008 - 11:57:14 pm UTC |
| Re: output |
bleung91 |
wow, how naive can you get. and guess what, after they see your code seyon, they will ban you. This judge is for learning, what do you learn by doing that? does it rest well on your conscience that... |
wc01Sp5 |
Dec 05, 2008 - 11:11:10 pm UTC |
| Re: output |
Saravannan |
Which is why Hanson and the other admins can see your code =P |
wc01Sp5 |
Dec 05, 2008 - 9:22:23 pm UTC |
| I don't understand |
StealthAdept |
What does it mean if it satisfiable? Is the question basically "Is there a set of numbers that you can substitute into each variable to make this equation evaluate to true?"? |
wc01Sp5 |
Dec 05, 2008 - 8:53:15 pm UTC |
| output |
seyonv |
can we not just output satisfiable or unsatisfiable for partial points? |
wc01Sp5 |
Dec 05, 2008 - 8:16:35 pm UTC |
