There is simple undirected graph with n vertices and m edges. ( N<=10 , m<=n*(n-1)/2 )↵
HAt 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?
↵
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?