Solution to the Mansa Stones problem on Hackerrank. https://www.hackerrank.com/challenges/manasa-and-stones

mansa_stones.py

for _ in xrange(test_cases):
    n = int(raw_input()) - 1
    a = int(raw_input())
    b = int(raw_input())
    
    low = a if a < b else b
    high = a + b - low
    
    diff = high - low
    
    current, limit = low * n, high * n
    
    if a == b:
        print current
    else:
        result = ''
        while current <= limit:
            result += str(current ) + ' '
            current += diff
        print result