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. Algorithms
  3. Implementation
  4. Manasa and Stones
  5. Discussions

Manasa and Stones

  • vbthani
     + 0 comments

    for Python3 Platform

    from itertools import combinations_with_replacement

def stones(n, a, b):
    ans = set()
    diff_perm = combinations_with_replacement((a, b), n-1)
    
    for i in diff_perm:
        ans.add(sum(i))
    
        
    return sorted(ans)

T = int(input())
while (T > 0):
    n = int(input())
    a = int(input())
    b = int(input())
    
    result = stones(n, a, b)
    
    print(*result)
    
    T -= 1