OJ Board

thank u!!!
i found where the problem lies and fixed it.

"1" is not a real constant...

It's just a simple DFA problem but the judge gave me WA. Please help me. #include <iostream> using namespace std; char str[1000]; int trans[8][4] = { {1,2,9,9}, {9,2,9,9}, {9,2,3,5}, {9,4,9,9}, {9,4,9,5}, {6,7,9,9}, {9,7,9,9}, {9,7,9,9} }; int getMap (char c) { switch (c) { case '+': case '-': retur...

""....a special judge program."" I don't understand......What?? some problem may produce many best solutions and any one would be accepted. so judging the answer requires a special program , not doing simple text comparison or stream comparison. and also, some problem are really...

and there's some way to convert recursion to iteration(dp)
such as matrix chain multipulation (problem 348, i used both recursion and iteration)...

good luck~

usually such program can be solved by 2 or 3 dimension DP.

but i use recursion and branch and bound.
to search for the result, the upper bound will descend step by step while program recurses... so the total search amount won't be large.

get it?

thanx, problem solved.
i used pure c...

or

then waht if the words duplicates?

see example below

:cry: i don't think my code will gimme TLE... any one help pls thx in advance [cpp] #include <iostream> #include <string.h> #include <list> using namespace std; typedef struct { char c[2]; } card_t; typedef struct { list<card_t> card; } stack_t; list<stack_t> li; char str[1000],tmp[1000],*p; bool in...

i got AC (not PE). there's a trick. if your output have linewraps, you should omit leading blanks in the following line. [cpp] eg. bla bla XXXX...XXXXXX bla bla bla <-- then linewrap bla bla ... <-- the following line may has leading blanks, just leave out the blanks like this bla bla XXXX...XXXXXX ...

i try to use graham scan to solve this prob. but get WA... any one help pls. thx in advance [cpp] #include <iostream> #include <memory.h> #include <stdlib.h> #include <math.h> using namespace std; const int MAX_PT = 2000; typedef struct { double x,y; } point_t; point_t pt[MAX_PT]; int st[MAX_PT]; in...

i got TLE too with this problem at first. my friend gave me some hints.
first, use floyd or warshall to determine whether the node is reachable to the destination while using dfs... then i got AC...

i cannot find the problem with my code~ [cpp] #include <iostream> #include <iomanip> #include <memory.h> #include <stdlib.h> #include <math.h> typedef struct { int x,y; } point_t; point_t pt[300]; int num,used[300][300]; const double VERT = 1e30; inline int cmp (const void *a,const void *b) { point_...

i know that, but thank you all the same.

this problem is collected out from ICPC 1999 NW Pacific Region, and i think it worth doing, but i kept wrong answer with it...

i wanna know if there is a standard and common simple solution for such "same game" problems.

it's just a knap-sack like problem.
think it over and u will find what to do with this problem:)

good luck~