I think you didn't understand where I'm getting the k value... lemme explain it :)

I'm counting the wasted triangles.. the wasted triangle forms with connected 3 edges. (1 Bob's edge and 2 Alice's edge.. or otherwise). and it store 2 of vertices which connecting bob's edge with alice's..

I take one vertex, then I'm counting how many wasted triangles with that vertex can form (triangle's vertex connecting both Alice's and Bob's edges). di contains degree of vertex. number of edges going from that vertex (also choosen that is choosen edge by Alice).. I'm multiplying it with Bob's edges starts with that vertex.. that is (n-1-di) and we get the wasted triangle's vertex number's sum...

as we said every wasted triangle stores 2 of vertex with that property (connects bob's edge and Alice's), we have to divide k with 2... we get wasted triangle's number... then remove it from all possible triangle's number. ;-)

"wish you successful hack" it is not bad wish. It means you help someone who coded wrong to know that his/her solution wrong! If he/she didn't locked that problem he/she will resubmit it. Otherwise if he/she already locked that problem wil not wait for that problem while judging.

If someone didn't hack your problem while you submitted wrong solution. You will think your solution is acceptable

Hacker gain 50 more point for their goodness ;)

Lucky codings and hackings to everybody ;) Just Have Fun!

thanks a lot bro :)

Yeah I know. But I wonder about my friends. Are they will pass me or not. I'm wondering that... :D

And in blog there was not written "Contest will be rated!" or something like this

Is this contest will rated? I'm waiting... for 3:30 hours...

What is it mean ACM-ICPC rules? I can't find about ACM-ICPC rules. Can you explain or give a link for me please?

in Div1 C we can solve it easier:

let t = number of all possible triangles (n(n-1)(n-2)) / (1*2*3);

we restore degree of vertex like when we scan ai and bi -> x[ai]+=1; x[bi]+=1; where 1<= i <=n

let k = sum of all (di * (n-1-di)); where di = degree of i'th vertex;

then k=k/2; because we count each wasted triangle twice ;)

then answer is t-k :D

in here you must use long long or __int64

in this solution I just removed wasted (made with bob's and alice's edges) triangles from all possible triangle

I want to change my HANDLE. How can I do this? Thanks for help.

When I'm entering to Esc>Settings>Handle there is message : "The page is temporary blocked by administrator. We are doing it because of increased load. Do not panic, we will unblock the page soon. Thank you for your understanding."

and When it will unblock? Thanks for help :D