112C - Petya and Inequiations - CodeForces Solution


greedy math *1400

Please click on ads to support us..

Python Code:

n , x, y= map(int,input().split())
if n > y :
    print(-1)
else :
    if x== y :
        for i in range(n):
            print(y//n)
    else :
        if n == 1 :
            if x <= y **2 :
                print(y)
            else :
                print(-1)
        else :
            if y%n==0 and n*(y//n)**2 >= x:
                for i in range(n):
                    print(y//n)
            else :
                if (y-n+1)**2 >= x-n+1 :
                    print(y-n+1)
                    for i in range(n-1):
                        print(1)
                else :
                    print(-1)
                
            
        
        


Comments

Submit
0 Comments
More Questions

577A - Multiplication Table
817C - Really Big Numbers
1355A - Sequence with Digits
977B - Two-gram
993A - Two Squares
1659D - Reverse Sort Sum
1659A - Red Versus Blue
1659B - Bit Flipping
1480B - The Great Hero
1519B - The Cake Is a Lie
1659C - Line Empire
515A - Drazil and Date
1084B - Kvass and the Fair Nut
1101A - Minimum Integer
985D - Sand Fortress
1279A - New Year Garland
1279B - Verse For Santa
202A - LLPS
978A - Remove Duplicates
1304A - Two Rabbits
225A - Dice Tower
1660D - Maximum Product Strikes Back
1513A - Array and Peaks
1251B - Binary Palindromes
768B - Code For 1
363B - Fence
991B - Getting an A
246A - Buggy Sorting
884A - Book Reading
1180A - Alex and a Rhombus