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.
  1. Prepare
  2. Python
  3. Itertools
  4. Iterables and Iterators
  5. Discussions

Iterables and Iterators

Sort by

recency

|

904 Discussions

|

  • kumarmayashanka1
     + 0 comments
    import itertools

N = int(input())
cases = list(input().split())
K = int(input())

all_combinations = list(itertools.combinations(cases, K))

valid_combinations = [combo for combo in all_combinations if 'a' in combo]

prob_consist_a = len(valid_combinations) / len(all_combinations)
print(prob_consist_a)

  • rajendramohan781
     + 0 comments

    n = int(input()) # Length of the list letters = input().split() # List of letters k = int(input()) # Number of indices to select

    comb = list(combinations(letters, k)) favorable = sum(1 for group in comb if 'a' in group) probability = favorable / len(comb) print(f"{probability:.3f}")

  • rememberharis
     + 0 comments

    from itertools import combinations

    N, S, K = int(input()), list(input().split()), int(input())

    S=''.join(S) combs = list(combinations(S, K)) tups = [p for p in combs if 'a' in p] print(round(len(tups)/len(combs),3))

  • kcmutya
     + 0 comments
    # Enter your code here. Read input from STDIN. Print output to STDOUT
import itertools

N = int(input())
cases = list(input().split())
K = int(input())

all_combinations = list(itertools.combinations(cases, K))

valid_combinations = [combo for combo in all_combinations if 'a' in combo]

prob_consist_a = len(valid_combinations) / len(all_combinations)
print(prob_consist_a)

  • harsh_k_arora
     + 0 comments
    from itertools import combinations

_, lst, _indices = (int(input()), input().split(" "), int(input()))
_lst = list(combinations(lst, _indices))
freq = sum([ 1 if 'a' in list(item) else 0 for item in _lst])
print(freq/len(_lst))