Wanna get some hint for this problem

Revision en2, by p__ce1052, 2021-12-29 06:27:12

There is simple undirected graph with n vertices and m edges. ( N<=10 , m<=n*(n-1)/2 ) At most how many edges can we pick so that in graph with n vertices and edges we picked, degree of every vertices is equal or less than P. ( P <= n-1 )

I know this problem is about bitmask dp but i cant figure out dp-state.

Is there any hint or similar problem in codeforces or atcoder?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English p__ce1052 2021-12-29 06:27:12 11 Tiny change: 'n-1)/2 )\nHow many ed' -> 'n-1)/2 )\nAt most how many ed'
en1 English p__ce1052 2021-12-29 04:57:50 410 Initial revision (published)