1955B - Progressive Square - CodeForces Solution


constructive algorithms data structures implementation sortings

Please click on ads to support us..

Python Code:

from collections import Counter

for t in range(int(input())):
    n, c, d = map(int, input().split())
    b = Counter(map(int, input().split()))
    r = True
    a1 = min(b)
    for i in range(n):
        for j in range(n):
            x = a1 + i * c + j * d
            if b[x] == 0:
                r = False
                break
            b[x] -= 1
    if r:
        print("YES")
    else:
        print("NO")


Comments

Submit
0 Comments
More Questions

XOREQN Xor Equation
MAKEPAL Weird Palindrome Making
HILLSEQ Hill Sequence
MAXBRIDGE Maximise the bridges
WLDRPL Wildcard Replacement
1221. Split a String in Balanced Strings
1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians
1032A - Kitchen Utensils
1501B - Napoleon Cake
1584B - Coloring Rectangles
1562B - Scenes From a Memory
1521A - Nastia and Nearly Good Numbers
208. Implement Trie
1605B - Reverse Sort
1607C - Minimum Extraction
1604B - XOR Specia-LIS-t
1606B - Update Files
1598B - Groups
1602B - Divine Array
1594B - Special Numbers
1614A - Divan and a Store
2085. Count Common Words With One Occurrence
2089. Find Target Indices After Sorting Array
2090. K Radius Subarray Averages
2091. Removing Minimum and Maximum From Array