Python算法竞赛代码模板

import sys
import random
from heapq import heappush, heappop
from collections import Counter, defaultdict, deque
from bisect import bisect_right, bisect_left
from math import ceil, sqrt, gcd

sys.setrecursionlimit(10000)
MAXN = 2 * 10 ** 6
lst = lambda n: [0] * (n + 1)
lstv = lambda n, v: [v] * (n + 1)
mat = lambda m, n: [[0] * (n + 1) for _ in range(m + 1)]
matv = lambda m, n, v: [[v] * (n + 1) for _ in range(m + 1)]

input = lambda: sys.stdin.readline().strip()
iinp = lambda: int(input())
linp = lambda: list(map(int, input().split()))
finp = lambda: list(map(float, input().split()))
minp = lambda: map(int, input().split())
cinp = lambda: list(input())


def solve():
    pass


T = 1 or iinp()
for _ in range(T):
    solve()