UVa OJ Board

How to check whether a graph have some bridges(without which the graph will divide into two parts )?
I am badly needed. Your timely assistance will be greatly appreciated.
Thanx in advance

Befuddled how to contrive this problem, I bogged down in the mire.
Any one can pull me out ?!!
thanx in advance

thanx to both DM and Chung, I have found the bug in my pro , making sure the value of Len must not transcend the Limit.
But I wonder whether there are some improvement to accelerate
the running speed?

any Superman can certify this problem is that format?
pls, give me some hint ! !


thanx in advance
WanBa

Red Scorpion:
if possible ,illustrate to me with sufficient detail.
thanx in advance !

how u plot "check_vampire_number()" ?

how to contrive it as graph problem?
thanx in advance ?

how to contrive the plot?
thx

I am bogged with anger.great regards to the man helping me. [cpp] #include<iostream> using namespace std; int line1[1000001]; int line2[1000001]; void add ( int size ) { int i; int carry (0); for ( i = 0; i < size; ++i ) { line1 += line2 + carry; carry = line1 / 10; line1 %= 10; } line1 = carry; } i...

can anyone tell me why there is a bug when using " int ",and how it is dissipated by superseding with " unsigned" ??


best regards angone lend me hand

can anyone can help me with this piece of cake ----- the P.E. the result of my several submits.

can anybody enlighten me about 10154 ?
thank u very very......if .

How to reduce the running time?
can some one lend me a hand!^_^

father: abca
mother: abda
according norm DP , the answer is 3.,however,the true is TWO.