## Search found 16 matches

Fri May 30, 2008 5:54 am
Forum: Off topic (General chit-chat)
Topic: How old are you? Statistics.
Replies: 121
Views: 178917

### Re: How old are you? Statistics.

im 22, joined 2 years ago. solved 250 problems
Thu Jul 12, 2007 1:59 pm
Forum: Volume 100 (10000-10099)
Topic: 10073 - Constrained Exchange Sort
Replies: 14
Views: 4730
thanks mf, the info is useful
Thu Jul 12, 2007 11:36 am
Forum: Volume 100 (10000-10099)
Topic: 10073 - Constrained Exchange Sort
Replies: 14
Views: 4730

### something to clarify

Referring to the problem statement, the 3rd constraint on the swapping procedure: "... can be swapped with the letter at location l2 provided l1 ~ l2 = di " I am not sure of what the symbol ~ suppose to mean. Checked the wikipedia, it just says that it is a shorthand to say that there is a binary re...
Wed Jul 11, 2007 2:38 pm
Forum: Volume 101 (10100-10199)
Topic: 10181 - 15-Puzzle Problem
Replies: 38
Views: 20713

### heuristic function

i guess you need to augment your manhatten heuristic with linear conflict. it will speed up a lot
Thu Jun 07, 2007 1:25 pm
Forum: Volume 1 (100-199)
Topic: 147 - Dollars
Replies: 233
Views: 24341

### tks jan

tks jan. didnt take the double to integer conversion seriously.
Thu Jun 07, 2007 6:57 am
Forum: Volume 1 (100-199)
Topic: 147 - Dollars
Replies: 233
Views: 24341

### WA: Any test cases

so far, never get to see any posted test cases. Here is a test output which I'm sure I've got it wrong somewhere: 300.00 181490736388615 299.95 181000196059736 299.90 180510857366624 299.85 180510857366624 299.80 180510857366624 299.75 180022694940816 299.70 179535708782312 299.65 179535708782312 29...
Wed Apr 18, 2007 4:57 am
Forum: Volume 100 (10000-10099)
Topic: 10001 - Garden of Eden
Replies: 39
Views: 15586

### thanks mf

for the test case. ive made the prog more robust by tightening some conditions and rotating the circular array to prune cut down the search tree depending on the automaton state. but still it passed the time limit with a slow 8.648 s.
Tue Apr 17, 2007 6:54 pm
Forum: Volume 100 (10000-10099)
Topic: 10001 - Garden of Eden
Replies: 39
Views: 15586

### 10001: TLE? but why?

hi. ive thoroughly checked my prog with my own input (on top of what is provided by the question online). ive used backtracking to find the existence of a predecessor. if its not found, then its a GARDEN OF EDEN. also tried with a few random 32 size inputs (which are most probably GARDEN OF EDENs), ...
Thu Dec 21, 2006 8:24 pm
Forum: Volume 3 (300-399)
Topic: 339 - SameGame Simulation
Replies: 26
Views: 11907

### thanks

thanks jan, it was useful.
Thu Dec 21, 2006 6:07 pm
Forum: Volume 3 (300-399)
Topic: 339 - SameGame Simulation
Replies: 26
Views: 11907

### samegame simulation: PE all the way

I've use minskcity previous input and the following is the output: Grid 1. 1 Grid 2. 0 Grid 3. 0 0 0 0 Grid 4. Game Won exactly the same spacing, blank lines only between separate test cases, yet i cant seem to figure out why pe :P below is my coding.. (im not sure whether posting PE coding is allow...
Tue Dec 19, 2006 12:54 pm
Forum: Volume 2 (200-299)
Topic: 220 - Othello
Replies: 9
Views: 5856

### something abt the input

ref to test case 4

Code: Select all

``````WWWWB---
WWWBW---
WWBW----
WBW-----
-BW-----
---B----
--------
--------
B
L
M25
L
Q
``````
(2,5) is already occupied. i suppose the program will not receive such an input?? (maybe (2,5) should be '-' instead)
Sun Dec 17, 2006 5:30 pm
Forum: Volume 1 (100-199)
Topic: 183 - Bit Maps
Replies: 15
Views: 3204

### 183 WA in 0.000 (minimum mem)

I have been running test cases thru my prog and they got back agreeable results, but what I do not understand is my prog becomes WA in 0.000 CPU (minimum memory). is there some trick to the test cases? does it include zero sized bitmaps? if so is the null string being output? or no blank line? #incl...
Sun Dec 10, 2006 6:13 am
Forum: Volume 1 (100-199)
Topic: 153 - Permalex
Replies: 32
Views: 13446

### 153 Permalex TLE

hello have tried permalex. my method is to sort the initial string and permutate till a match is found (using strcmp) any other shorter way? can't seem to figure out the trick (especially those who manage to have 0 CPU time) #include <cstdio> #include <cstring> #define MAXLENGTH 32 using namespace s...
Thu Jul 20, 2006 9:40 am
Forum: Volume 1 (100-199)
Topic: 104 - Arbitrage
Replies: 223
Views: 16149

### tip for arbitrage-> dont use logs

ive noticed quite a number of pple used logrithms. although logs can convert multiplication into sums, thus can be used as weights of graphs, they can affect precision as one converts the weights into logs and back again. try to find ways to use multiplication to find the optimal shortest path.
Wed Jul 19, 2006 11:12 am
Forum: Volume 1 (100-199)
Topic: 104 - Arbitrage
Replies: 223
Views: 16149

### hi and a few qns

f-w is already an application of DP... btw tks abt the crash course abt f-w. but then isnt f-w only suitable for graphs with no negative weights? It is possible for a profiting sequence to exist (in some cases) if a non-simple path is taken (ie if a currency is tranverse twice). for example a->b->a-...