i need your hint or send me your .exe file .
I guess you shouldn't execute any program someone you don't know sends you...
Search found 19 matches
- Fri Sep 02, 2005 1:24 am
- Forum: Other words
- Topic: a lot of WAs..
- Replies: 7
- Views: 3485
- Sun Jan 30, 2005 3:05 am
- Forum: Volume 4 (400-499)
- Topic: 445 - Marvelous Mazes
- Replies: 93
- Views: 12856
- Wed Jan 26, 2005 7:36 am
- Forum: Volume 101 (10100-10199)
- Topic: 10190 - Divide, But Not Quite Conquer!
- Replies: 105
- Views: 26202
- Mon Jan 24, 2005 6:37 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10035 - Primary Arithmetic
- Replies: 328
- Views: 66845
- Mon Jan 24, 2005 6:33 pm
- Forum: Volume 6 (600-699)
- Topic: 623 - 500!
- Replies: 187
- Views: 49212
- Mon Jan 24, 2005 6:27 pm
- Forum: Volume 4 (400-499)
- Topic: 495 - Fibonacci Freeze
- Replies: 222
- Views: 36806
- Mon Jan 24, 2005 6:24 pm
- Forum: Volume 4 (400-499)
- Topic: 445 - Marvelous Mazes
- Replies: 93
- Views: 12856
- Thu Jan 20, 2005 4:12 pm
- Forum: Volume 1 (100-199)
- Topic: 114 - Simulation Wizardry
- Replies: 80
- Views: 9418
Hi again! I've already solved this one, but my first atempt was Wrong Answer. Let me draw the table of the sample input: XXXX X_BX XB_X XXXX The X are walls B are bumpers. The problem says that 1 <= x <= m and 1 <= y <= n. But the limit positions are walls. That means (3,4) isn't a valid position, n...
- Wed Jan 19, 2005 5:09 pm
- Forum: Volume 1 (100-199)
- Topic: 104 - Arbitrage
- Replies: 223
- Views: 18579
try this input: 6 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.1 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 5.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 9.0 0.0 0.0 0.0 0.0 1.0 output should be 5 6 5 but your program gives 5 6 1 which is wrong, because you have to end in the same place as you started. Actually, you have a silly bug :D ch...
- Wed Jan 19, 2005 11:52 am
- Forum: Volume 1 (100-199)
- Topic: 104 - Arbitrage
- Replies: 223
- Views: 18579
- Mon Jan 17, 2005 4:59 pm
- Forum: Volume 1 (100-199)
- Topic: 104 - Arbitrage
- Replies: 223
- Views: 18579
Floyd-Warshall finds all the mininum paths between every vertex and all the other vertexes. However, in this problem you not only have to find the shortest path, it also has to make a profit of more than 1%. Simple F-W goes like this: // initialization for (i = 0; i < n; i++) { for (j = 0; j < n; j+...
- Sat Jan 15, 2005 5:47 pm
- Forum: Volume 1 (100-199)
- Topic: 104 - Arbitrage
- Replies: 223
- Views: 18579
Well, I'll assume you understand what the problem asks. You have to find the shortest sequence that yelds a profit (not the one with the greatest profit!). If there is more then one sequence with the same length, any of those is valid. Now, you can't just try with brute force (trying all combination...
- Fri Jan 14, 2005 9:13 pm
- Forum: Volume 1 (100-199)
- Topic: 104 - Arbitrage
- Replies: 223
- Views: 18579
hints for 104
I've been trying to solve this problem for sooo long and finally got AC so today is a memorable day for me :) So here are some clues for those who haven't solved it yet. 1) There are some posts talking about floating point errors, but I didn't check for any in my solution. I use a simple test if (pr...
- Wed Jan 12, 2005 2:53 am
- Forum: Other words
- Topic: very very annoying Presentation Errors
- Replies: 1
- Views: 1456
very very annoying Presentation Errors
I've already come across several problems which are not precise on the output format, and since I try very hard to keep my total submissions at a minimum, it's very annoying to spend around 10 or more submissions to figure out why I'm getting PE!! Some problems I just haven't figured how should the ...
- Sat Jan 08, 2005 6:19 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10018 - Reverse and Add
- Replies: 169
- Views: 25243