OJ Board

Oh, that's it. Your phone array should have a size of 9, to include the null-terminator.

And your program prints 0.6, not 0.60 in my computer. Dunno if it is the problem.

1. Do you need to null terminate your 'phone' variable?

2. You need to print 0.60 if the money is 0.6

I am quite confused by ur code.

[cpp]StartH = (TimeSH[0] - 48) * 10 + TimeSH [1] - 48;
StartM = (TimeSM[0] - 48) * 10 + TimeSM [1] - 48;
EndH = (TimeEH[0] - 48) * 10 + TimeEH [1] - 48;
EndM = (TimeEM[0] - 48) * 10 + TimeEM [1] - 48; [/cpp]

What is this kind of things? I figure the input ...

The problem description is really opaque. I didn't even realized it was such a problem in the contest!

HINT: It has something to do with gravity.

Adrian: tried on my machine with multiple spaces, my program handles them correctly. So the problem must be hiding somewhere else.

I don't know why you get WA, but the following is my 'moving sequence', since I got accepted, it might help.

1. Move paskill.
2. If paskill trapped print
3. Move lisper.
4. If lisper destroyed print
5. If both annihilated print
6. If lisper trapped print

Is this code enough to handle the multiple input in 10258?

[cpp]void main()
{
#ifdef ONLINE_JUDGE
FILE *fp=stdin;
#else
FILE *fp=fopen("b.in","r");
#endif
int n,p,t;
int i;
char l;
int j;
char buf[100];
fgets(buf,100,fp);
sscanf(buf,"%d",&j);
fgets(buf,100,fp);
while(j>0 ...

Maybe I should post my code here and someone would like to help.
:oops:
#include <stdio.h>

int laby[26][26];
int candle[26];
int count[26];
int theseus;
int minotaur;
int k;

void chase()
{
int i,j;
int ct=0;
j=0;
while(1)
{
ct=count[minotaur];
for(i=0;i<ct;i++)
{
if(!candle[laby ...

This seems to be a very easy problem but I have been getting wrong answer. I have tried several cases and they all work very well. So reading the program specification again I'm now wondering what should Theseus do if the Minotaur is approaching(i.e. starts) Theseus in a one-direction passage, that ...

And if you still cannot get passed, look at the previous post on this problem and you will find it.

Well that's easy, just try to input
1 1 1
and find it out yourself.

Hi, just look back at the previous thread of this problem, I have explained this phenomena a little there.

I don't know, I can't understand your code to calculate the table (though I just did this problem today!), should j increment only 1?

But I must point out that using (int) (amount * 100) is a dangerous thing, I have had times when the value was stored as 54.999987 while it should be 55, and (int ...

You are right, and I've got a P.E. now! Thanks very much.

How fast would you want? My complete search algorithm only runs 0.47 sec, this is enough for me.