Sort by

recency

|

1754 Discussions

|

  • + 1 comment
    lstx= []
    lsty=[]
    lstz=[]
    
    
    
    for i in range(x+1):
        lstx.append(i)
    for j in range(y+1):
        lsty.append(j)
    for k in range(z+1):
        lstz.append(k)
    lst=[[i,j,k] for i in lstx for j in lsty for k in lstz if i+j+k!=n]
    print (lst)    
    
  • + 0 comments

    I'm getting correct answer in other compiler but not here

    from itertools import permutations,product

    if name == 'main': x = int(input()) y = int(input()) z = int(input()) n = int(input())

    num= list(range(0,max(x,y,z)+1)) numbers=list(product(num,repeat=3)) final_no=[list(x) for x in numbers if sum(x)!=n ] print(final_no)

    print(final_no)

  • + 0 comments

    if name == 'main': x = int(input()) y = int(input()) z = int(input()) n = int(input())

    arr=[[i,j,k] for i in range(x+1) for j in range(y+1) for k in range(z+1) if i+j+k!=n]
    print(arr)
    
  • + 1 comment

    Not sure how i did it :p

    if __name__ == '__main__':
        x = int(input())
        y = int(input())
        z = int(input())
        n = int(input())
        
        coordinates = [
            [i, j, k]
            for i in range(x+1)
            for j in range(y+1)
            for k in range(z+1)
            if i + j + k != n
        ]
        
        print(coordinates)
    
  • + 2 comments

    why isnt my code running successfully whereas other compilers give the answers correct

    from itertools import product
    
    
    def solve(x,y,z,n):
        coor = [0, x]
        
        possible_combi = list(product(coor, repeat=3))
        
        newlist = [combo for combo in possible_combi if sum(combo) != n]
        
        for combo in newlist:
            print(combo)
    
    
    if __name__ == '__main__':
        x = int(input())
        y = int(input())
        z = int(input())
        n = int(input())
        solve(x,y,z,n)