OJ Board

Can anyone tell me the output for:

cd cde #

Please give me more test data. Thanks.

I just modify my sort function and got AC. Why? The following is my new sort function: [c] int sort_function( const void *a, const void *b) { struct s *p=(struct s *)a, *q=(struct s *)b; if(p->inversion != q->inversion) return p->inversion - q->inversion; else return p->serno - q->serno; } [/c]

Can anyone tell me what's wrong with my code? [c] #include <stdio.h> struct s { int serno; char dna[51]; int inversion; }a[100]; int n,m; int getdna(char x) { switch(x) { case 'A': return 0; case 'C': return 1; case 'G': return 2; case 'T': return 3; default : abort(); } } int count_sort(char *str) ...

I got TLE too. Can anyone help me? [c]#include <stdio.h> #include <string.h> int a[10000]; void main() { int t,i,j,k,m,n,temp; while(scanf("%d %d %d",&m,&n,&t)==3) { if(m>n) { temp=m; m=n; n=temp; } /* make sure m<=n */ if(m==1) { printf("%d\n",t); continue; } if(m>t)...

I caculate all the possible combination topping for the constraints.
It works fine. But it is not fast enough. I got TLE.
Can anyone tell me your idea about this problem?

Yes, I do.
I got AC in 7 sec.

Can anyone tell me what the problem is talking about?

Thanks.

It got RunTime Error, but I did nothing but input string. [c]#include <stdio.h> #define StrMax 200000000 int main() { char s[StrMax]; while (gets(s)) { /* do nothing */ } }[/c] I don't know why it get Runtime Error if I set the max length of string to 200000000. But when I set the max length of str...

My program solved it in 0.1 second using BFS.

I have found what wrong with my code. The error is the input. I am very surprised after I submit the following code. It got RunTime Error, but I did nothing but input string. :evil: [c]#include <stdio.h> #define StrMax 200000000 int main() { char s[StrMax]; while (gets(s)) { /* do nothing */ } }[/c]...

I always got Runtime Error (Invalid memory reference), but I do not know what is wrong. I think this problem is similar to ACM 536 Tree Recovery which I got AC. My algorithm is make the tree by the 2 given inorder and postorder traversal sequences. And then use inorder dfs to travel the tree and fin...

However, I still don't understand what "minimal paths" mean in this qq........................ Also, my algorithm isn't very good. If the width and height are large, my program can't handle it...... (P.S. I made use of Floyd-Warshall's Algorithm...) Any suggestions? Any help is warmly wel...

route wrote:what is the maximum of "positive integers" in the input ?
(width and height)

100 is enough.

It's not too hard to see the recurrence relations.. and once you got that, you can easily solve it using DP...

Please tell me more about the recurrence relations. I can't find it.

Can anyone tell me how to solve this?