1956C - Nene's Magical Matrix - CodeForces Solution


constructive algorithms greedy math

Please click on ads to support us..

Python Code:

def solve():
    size = int(input())
    oggy_house = [[0] * size for _ in range(size)]

    rick = 0
    morty = 0

    for ben in range(1, 2 * size + 1):
        if ben & 1:
            gwen = size
            for j in range(size):
                oggy_house[rick][j] = gwen
                gwen -= 1
            rick += 1
        else:
            gwen = size
            for i in range(size):
                oggy_house[i][morty] = gwen
                gwen -= 1
            morty += 1

    total_sum = sum(sum(row) for row in oggy_house)
    print(total_sum, 2 * size)

    phineas = 1
    ferb = 1
    ans = list(range(size, 0, -1))

    for ben in range(1, 2 * size + 1):
        if ben & 1:
            print(1, phineas, *ans)
            phineas += 1
        else:
            print(2, ferb, *ans)
            ferb += 1

tc = int(input())
for _ in range(tc):
    solve()


Comments

Submit
0 Comments
More Questions

1475A - Odd Divisor
1454B - Unique Bid Auction
978C - Letters
501B - Misha and Changing Handles
1496A - Split it
1666L - Labyrinth
1294B - Collecting Packages
1642B - Power Walking
1424M - Ancient Language
600C - Make Palindrome
1669D - Colorful Stamp
1669B - Triple
1669A - Division
1669H - Maximal AND
1669E - 2-Letter Strings
483A - Counterexample
3C - Tic-tac-toe
1669F - Eating Candies
1323B - Count Subrectangles
991C - Candies
1463A - Dungeon
1671D - Insert a Progression
1671A - String Building
1671B - Consecutive Points Segment
1671C - Dolce Vita
1669G - Fall Down
4D - Mysterious Present
1316B - String Modification
1204A - BowWow and the Timetable
508B - Anton and currency you all know