OJ Board

That is exactly what you have to figure out in this problem! ;-)

Perfect strategy means: If there IS a move that leads to a winning situation, you do that move, and no other. Imagine you are calculating all possible moves in the game, and determine if a move is winning, or loosing (or maybe ...

What operating system / compiler do you use ? Mine doesn't fail at those cases.
Btw I use Editplus and it creates a template like the one above. That's why I define my main like that. It never gives me problem before.

I get wrong answer on this problem too.. and I really don't understand why. I passed all the test cases above.. anything I forgot? Anyone please help me !!
Here is my code:

[cpp]
#include <stdio.h>

void binary( char *result, int n )
{
int i;
for( i=12; i>=0; i-- ) {
result = '0' + (n & 1);
n ...

obayashi wrote:there's a simple solution;)

Does 'simple' mean O(1) solution? My solution is O(number of digits in result)

Btw, the definition of "Center of mass" is quite easy: Suppose you make the polygon out of wood (make it massive), and try to balance it on the tip of your finger. The center of mass is the single point where it will not fall off your finger.
I think many people here are confused with the center of ...

bolster wrote:2) Sometimes, "-0.000" is probably displayed for small numbers that get rounded off, so must add some small value to all output.

This trick did it for me. I added some constant epsilon = 1e-15 to the final answer, and I got accepted right away.

hmm.. so it seems i'm completely wrong in my output... then i probably made a stupid mistake somewhere. Thanks for your help so far

-Edit-
Thanks, got accepted now. I made a really stupid mistake... they're usually the hardest to find

Hi everyone!

I tried to do 10578 and was surprised to get WA... First of all I'm a little unsure how to handle the input.. for example if there is an empty line at the end of the input I should treat it as being a test case, right ? And what if there is a \n at the end of the last line but nothing ...

don't just post your code but tell us the method you're using.

why 13123 makes Stan the winner?

My AC program makes Ollie the winner for 13123. In fact, I'd like to know very much your strategy to make Stan win. Wanna play a game of multiplication with n=13123? I will play Ollie, anyone volunteer to play Stan?

my program gives the same answers as yours. But how about these:

10 5 0
5 10 0

( 1 ) can you use formatting tags to post code?
( 2 ) can you explain your algorithm?

what i meant to say is: You calculate fa and fb in your loop but you never use them anywhere in the program. So then why do you calculate them?

what's the purpose of your variables fa and fb ?

I solved the problem.. but I'm still wondering how I can do faster. My current program runs in 2.578 seconds. The problem is indeed very interesting!