OJ Board

Although i haven't try it yet but thank you very much!!

I've read some posts on the board and test some IO. but still the judge reply me a lot of WA...
someone says that the problem has some tricky point but i can't find it, could anyone help me examine my code??
thanks in advance
#include <stdio.h>
#include <string.h>
char name[3000][100];
char num ...

I've got mant WAs in this problem, and I've viewed all the topics in this forum but still can't find the error.
Could anyone help me find the bug or give me some test cases?
Thanks in advance;

#include <stdio.h>
#include <string.h>
#define UNCHECK 0
#define A 1
#define MOD 2
#define BA 3
#define ...

in this input, what is the answer should be?

1

5 2
1 1 2
=
1 1 3
<

in this problem,how can we detemine whether the track can be solved?
thanks in advance

notice that the set S could be empty

I couldnt find what wrong with it;
and even cant understand the input form;
i guess the three tries are right justifed but i'm not sure :(
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
inline bool num(char p) {
return (p>='0'&&p<='9');
}
char t[3][50]={0};
int score[36];
int toscore ...

wow~
i've thought about it for a long~ time but cannot construct a correct recursive function before i couldn't avoid counting identical expressions

anyway, thank you~

Thanks, but could you explain how did you obtain this formula?I couldn't understand......


could you tell me the detail?

I think it could be solved with DP but I can't construct the recursive function, could some one help me?
Or.... it's not a DP problem?

I've viewed some topics says that it could be solved with binary sequence... but i can't imagine it.
someone helps me?

Finally I got AC in 3.7sec...
how slow it is.......><

Thanks for your input and i now have to fight with TLE......

#include <stdio.h>
bool map[5][30];
int e[5];
int n,would[30],w;
bool insertable(int a1,int a2,int a3,int a4,int a5);
void test(int s1,int s2,int s3,int s4,int s5,int i,int start,int x);
int min;
inline int _min(int a,int b) {
if(a<b)
return a;
return b;
}
int main() {
int i,j;
char p[30 ...

could someone give me an algorithm of the minimal cost matching in chinese postman problem?
i saw some webpage says that there is a O(n+3) algorithm but it didn't provide it...