Please read the new rule regarding the restriction on the use of AI tools. ×

Can you help with a problem

Revision en2, by Art.twink, 2024-04-01 12:25:57

Given an undirected graph with $$$N$$$ vertices and $$$M$$$ edges, count the number of simple paths that consist of exactly $$$7$$$ vertices.

Constraints: $$$N \leq 100 $$$ $$$M \leq \frac{N \cdot (N - 1)}{2}$$$

UPD: I solved it by myself

Tags graphs

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English Art.twink 2024-04-01 13:55:06 722
en3 English Art.twink 2024-04-01 12:26:30 3 Tiny change: '\n\nUPD: I solved it' -> '\n\nUPD: I've solved it'
en2 English Art.twink 2024-04-01 12:25:57 30 Tiny change: ' - 1)}{2}$' -> ' - 1)}{2}$\n\nUPD: I solved it by myself'
en1 English Art.twink 2024-04-01 10:53:19 223 Initial revision (published)