Need counter cases for 505D

Revision en1, by haleyk100198, 2016-07-03 05:45:04

Link to problem: http://codeforces.net/problemset/problem/505/D

My submission: http://codeforces.net/contest/505/submission/18861557

My idea is to count the amount of sub-trees of the graph that doesn't contain a cycle, and the answer would be n-(amount of sub-trees without a cycle). However my code fails on the test case 6 and I have no idea how did the test case got me... Can anyone point out the flaw of my code or even my approach on solving this problem?

Tags graph, 505d

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English haleyk100198 2016-07-03 05:45:04 602 Initial revision (published)