We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
from itertools import combinations
n,lst,k = int(input()),input().split(),int(input())
comb_lst = list(combinations(list(range(n)),k))
a_index = []
for i in range(len(lst)):
if lst[i] == "a":
a_index.append(i)
counter = 0
for sublist in comb_lst:
for i in sublist:
if i in a_index:
counter += 1
break
probab = counter/len(comb_lst)
print(probab)
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Iterables and Iterators
You are viewing a single comment's thread. Return to all comments →
from itertools import combinations n,lst,k = int(input()),input().split(),int(input()) comb_lst = list(combinations(list(range(n)),k)) a_index = [] for i in range(len(lst)): if lst[i] == "a": a_index.append(i) counter = 0 for sublist in comb_lst: for i in sublist: if i in a_index: counter += 1 break probab = counter/len(comb_lst)
print(probab)