First using including-excluding principle
then the problem will reduce to find the number of different cycles
which has N points and k disjoint paths
On Sep 20, 3:02 pm, rajatag12 <[email protected]> wrote:
> Any ideas on how to solve the large input case?
>
> I downloaded correct solutions from the scoreboard, but couldnt
> understand the approach completely. Could not find any discussion or
> Contest analysis on the problem too.
>
> thanks.
>
> - Rajat.
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"google-codejam" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/google-code?hl=en
-~----------~----~----~----~------~----~------~--~---
