UVa OJ Board

My term "Successive Shortest Path" is the name of an algorithm that is for solving mincost flow, it will adjusted the edge cost after removing a shortest path, it is not simply the greedy method...... And my code can solve that case. Hi Did you use Bellman-Ford algorithm in this problem ? However,I...

B-tree is often used in database index storage.

I see my textbook, it said each key in the tree must be unique.

But how can I store two identical data in the B-tree?

Is it possible?

Thanks in advance!

Hello Ryan Pai,
Finally,I got Accepted !!
Because my program initially consider the two same walls as only one.

now my new program pass the following input: The correct output is Thanks a lot!!
I am happy now!

Hello Ryan Pai,

I still cannot find any wrong in my code...
My program passed all the testdata I tested.
But wrong answer again and again~


Is it possible that the two walls can be overlay ot intersected ?

My program's output is 2 .
Is it correct ?

My program passed all the sample input in the board.
But still cannot got AC.
I always got WA!
I will be grateful for any help!

Hi,

I got accepted now.

1.705 seconds and memory cost 452

IDA* and F(x)=G(x)+4/3*H(x)

^_^

Hi,


My code can't pass the time limit.
I use IDA* algorithm.


Can somebody help me?
or you can give me some tips and hints.

Thanks in advance!

I want to use C/C++ to write a BASIC interpreter
but it seems not easy
is there any document about that?
(don't give me the source)
(what I need is just a document that can teach me and give me some tips)
Help me,Thanks !

Hi, Cryptarithmetic Puzzle A cryptarithm is an arithmetic formula in which the digits are replaced by other symbols. Cryptarithms can be additions, multiplications, or divisions. For example, SEND + MORE = MONEY 9567 + 1085 = 10652 WHO * IS = MOSIS 421 * 75 = 31575 LINK / NET = KT ... KEY 6041 / 453...

You can use the following code to replace that function. [c] #include "string.h" #include "ctype.h" int strcmpi(char *a,char *b) { int i; if( strlen(a)>strlen(b) ) return 1; else if( strlen(a)<strlen(b) ) return -1; for(i=0;i<strlen(a);i++){ if( toupper(a )>toupper(b ) ) return 1; else if( toupper(a...

Hi,

You can't use the key word "strcmpi".
It is not allowed under ANSI C/C++.

Good luck~

There is a function named qsort in <stdlib.h> .
You should remove qsort() in your code.

Do not use '//' comments.
It will cause a compile error.

Thanks for your help. After I realized the problem could be solved by MaxFlow, I fixed my code. But now I have difficulty dealing with finding the augmenting path. I think BFS is not a good idea because it is too slow and takes too much space. Finally, I use DFS to find the augmenting path. But this...