Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def find(m,k,s):
- ans=0
- s=[int(i) for i in s]
- n=len(s)
- def dfs(i,j,c):
- nonlocal ans
- if i==n:
- if c==k:
- ans+=1
- return
- #prev element is odd
- if i==0 or s[j]%2==1:
- if i==0 or i-j>=m: #either include
- dfs(i+1,i,c)
- dfs(i+1,j,c) #or exclude
- #prev element is even
- else:
- if i-j>=m: #include
- dfs(i+1,i,c+1)
- dfs(i+1,j,c) #exclude
- dfs(0,0,0)
- print(ans)
- find(2,3,"232387421")
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement