OJ Board

My output is:

1 2 3 4 5 6 7 8 9 10 11 12 1 2
14

and got AC,

good luck;

Hi,
u can alsso use type cast like this:
a=(long long) 4000000000;
printf("%lld",a);

here is a usefull like to both graph algos and examples of each algo:


http://www.comp.nus.edu.sg/~stevenha/pr ... raph1.html

good luck in ur talk:)

Hi,
Here is an O(E) algo to find bridges,
first we define low as follows:

low =min(d ,min(low[x] | x is a child of w),min(d[x] | E(u,x) is a back edge);

you can calculate low with a recursive function just like DFS with O(E),
then check for every vertex if its low ==d .
and an edge is a bridge if ...

this problem is easier than it seems.
you don't have to any `lemma' to solve this problem.just think of a simple combinatorial formula.
after u find that try to solve it manualy and you get a polynomial of n lie this:
(n^6 + ?*n^4 + ... +8*n^?)/?
good luck.

Hi very body,
any idea to solve this problem fast.
I used some kind of DP but got TLE.


thanx.
shahiN_reloadeD

isn't it more accurate if u select a=0 and b=0.25 ?

Hi every body any idea about problem 10727,
I don't understand the problem ....

thank you.