Multiple Paths

Correction: "For each plan, the government wants to know how many pairs of junctions are there such that if they build the road, there will be more than one way to travel from one junction to the other without traveling on the same road twice." should be "... without visiting the same junction twice." In particular, note that case where u=v. The output should be 0.

Submitting to 'Multiple Paths'


You're not logged in! Click here to login


Submitting to 'Multiple Paths'


You're not logged in! Click here to login


Submitting .cpp to 'Multiple Paths'


You're not logged in! Click here to login


Compile Errors


							
Time Limit: 1 Seconds
Memory Limit: 128MB
No. of ACs: 22
Your best score: 0
Source: Dunjudge Archive

Subtask Score
1 21
2 27
3 18
4 34
5 0