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
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?
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...