OJ Board

Hi everybody...
I try to solve this problem using 2 different way... And both of all get WA..
I don't know why.. Can anybody give me some input...
Here's my 1st code (using tree):
[c]
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAX 300

char valid;
double isi[MAX][MAX];
long top ...

Hi... I try to changed my algorithm n it can passed TLE.. But Now i've got WA for this prob.. Can u give me any critical i/o ??
Thx a lot..
Andre

I can't use visual C++.... :p
Maybe u can look at my code and see what's wrong with this...
I still confuse why the process need more than 9 s to solve it...

[c]
*code removed*
[/c]

Thx...
Andre

Hi Andrew... I've changed my code n remove qsort, n just insert it into an array.. But still got TLE. :(

Here's my new pseudocode...
- take input
- remove '-' from the input
- decode to normal form
- find in the array using binary search
- if we find them just add total
- else insert new ...

Hi all, I've got TLE with this prob, i wonder how can my program got TLE..
This is my algorithh...

- take input
- remove '-' from the input
- decode to normal form
- find in the array using binary search
- if we find them just add total
- else insert new number into an array, and then sorting data ...

Here is the output....

1000 85: 1 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 ...

Argh.... Finally I got AC with this prob.... Thx a lot Shamim....
Cheers..
Andre

I've submitted your code and change your mlongime=2147483647 (using long) or mlongime=2147483648 (unsigned long). And I got AC. I prefered if u change int into long... And U'll get ac... Good Luck....

I think u should change ur limit
minTime=99999 -> minTime=2147483648
Good Luck...
Andre

I change my code, and it save me from TLE. But now i got WA with this problem.... Is my algorithm wrong???
Here's my code
*got AC now*
Cheers,
Andre

I try to solve this prob but i still get TLE , anyone can help me pls??
here's my code:
*code deleted*
Thanx,
Andre

To anybody whose got WA for this problem, I used to get WA for this problem because of 2 reason:
1. Output format
2. Use rounding from double to int conversion
n=(int)(input*100+0.5)
Hope this will help all of You.
Regard,
Andre

I tried to compile your program and When your program give:

input:
100 1
500 1

output:
100 1: 41

500 1: 223

I think the output should be:
output:
100 1: 37 41
500 1: 211 223

Maybe this make you'va got wa.
Regard,
Andre

And This is my code

Hi all :D .
I've read all the previous topic about this one, and i've tried all the given input, n the output is correct. But I still got WA for this problem. I've got WA for about 6 times. :cry: Hope I can get another sample input

input:

5

HoHoHo
dodoldudulzz
mangomangomangom
dodod ...