question stringlengths 0 30.2k | answer stringlengths 55 2.44k |
|---|---|
<line-1>def comp(x):</line-1>
<line-3> if x % i == 0:</line-3>
<line-4> return True</line-4>
<line-5> return False</line-5>
<line-6></line-6>
<line-7>N = int(input())</line-7>
<line-8></line-8>
<line-9>if N == 4:</line-9>
<line-10> print('YES', '1', '3', '2', '4', sep = '\n')</line-10>
<line-11>... | {"code": "<line-2> for i in range(2, x):</line-2>\n<line-17> print((i - 1) * pow(i, N - 2, N) % N)</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>from collections import defaultdict</line-1>
<line-2></line-2>
<line-3></line-3>
<line-5> n, T = [int(_) for _ in input().split()]</line-5>
<line-6> data = defaultdict(list)</line-6>
<line-7> for i in range(n):</line-7>
<line-8> t, q = [int(_) for _ in input().split()]</line-8>
<line-9> d... | {"code": "<line-4>def __starting_point():</line-4>\n<line-23> print(prev_level[0])</line-23>", "lines": [4, 23]}
#### 0 |
<line-1>import sys</line-1>
<line-3>arr = list(map(int, sys.stdin.readline().split()))</line-3>
<line-4>tot = sum(arr)</line-4>
<line-5>if tot % k != 0:</line-5>
<line-6> print('No')</line-6>
<line-7> return</line-7>
<line-8>tot //= k</line-8>
<line-9>idx,cur = 0,0</line-9>
<line-10>ans = []</line-10>
<line-11>for i in... | {"code": "<line-2>n,k = map(int, sys.stdin.readline().split())</line-2>\n<line-25>for an in ans:</line-25>", "lines": [2, 25]}
#### 0 |
<line-1>f = lambda: map(int, input().split())</line-1>
<line-3>wb = [(0, 0)] + list(zip(f(), f()))</line-3>
<line-4>t = list(range(n + 1))</line-4>
<line-5></line-5>
<line-6></line-6>
<line-7>def g(x):</line-7>
<line-8> if x == t[x]: return x</line-8>
<line-9> t[x] = g(t[x])</line-9>
<line-10> return t[x]</lin... | {"code": "<line-2>n, m, w = f()</line-2>\n<line-37> if d[D]: d[D + W] = max(d[D + W], d[D] + B)</line-37>", "lines": [2, 37]}
#### 0 |
<line-1>maxn=50+10</line-1>
<line-3>dp=[None]*maxn</line-3>
<line-4>c=[None]*maxn</line-4>
<line-5>size=[0]*maxn</line-5>
<line-6></line-6>
<line-7>for i in range(0,maxn):</line-7>
<line-8> c[i]=[0]*maxn</line-8>
<line-9> c[i][0]=1</line-9>
<line-10> for j in range(1,i+1):</line-10>
<line-11> c[i][j]=c[... | {"code": "<line-2>g=[None]*maxn</line-2>\n<line-54> tmp/=j</line-54>", "lines": [2, 54]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>MOD = 10**9+7</line-4>
<line-5>S = readline().strip().split('1')</line-5>
<line-6>if len(S) == 1:</line-6>
<line-7> print(len(S[0]))</line-7>
<line-8>else:</line-8>
<line-9> S = [len(s)+1 for s in S]</line-9>
<line-10> ans = S[0]*S[-1]</line-10>
<line-11> ... | {"code": "<line-2>readline = sys.stdin.readline</line-2>\n<line-26> aaa = (aaa+d)%MOD</line-26>", "lines": [2, 26]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>def main():</line-4>
<line-5> n, m = map(int, input().split())</line-5>
<line-6> a = list(map(int, input().split())) + [0]*500000</line-6>
<line-7> ans_S = 0</line-7>
<line-8> a[n] = a[0] + m</line-8>
<line-9> s = [0]*600600</line-9>
<line-10> for ... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-39> main()</line-39>", "lines": [2, 39]}
#### 0 |
<line-1>def init_factorials(N, mod):</line-1>
<line-3> fac = [1] * N</line-3>
<line-4> for i in range(1, N):</line-4>
<line-5> f *= i</line-5>
<line-6> f %= mod</line-6>
<line-7> fac[i] = f</line-7>
<line-8> return fac</line-8>
<line-9></line-9>
<line-10>def init_inv(N, mod, fac):</line-10... | {"code": "<line-2> f = 1</line-2>\n<line-64>h, w, n, blacks = read_data()</line-64>", "lines": [2, 64]}
#### 0 |
<line-1>f = lambda: list(map(int, input().split()))[1:]</line-1>
<line-3>s, p, q = [], [], []</line-3>
<line-4>for x in [0, 1]:</line-4>
<line-5> r = f()</line-5>
<line-6> s.append(r)</line-6>
<line-7> t = [len(r)] * n</line-7>
<line-8> t[0] = 0</line-8>
<line-9> p.append(t)</line-9>
<line-10> q.appen... | {"code": "<line-2>n = int(input())</line-2>\n<line-23>for x in [0, 1]:</line-23>", "lines": [2, 23]}
#### 0 |
<line-1>def read_data():</line-1>
<line-3> As = list(map(int, input().split()))</line-3>
<line-4> LRs = []</line-4>
<line-5> for i in range(q):</line-5>
<line-6> L, R = list(map(int, input().split()))</line-6>
<line-7> LRs.append((L, R))</line-7>
<line-8> return n, q, As, LRs</line-8>
<line-9>... | {"code": "<line-2> n, q = map(int, input().split())</line-2>\n<line-70>n, q, As, LRs = read_data()</line-70>", "lines": [2, 70]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>n = int(input())</line-4>
<line-5>matrix = [array('i', list(map(int, input().split()))) for _ in range(n)]</line-5>
<line-6>aa = tuple([int(x) - 1 for x in input().split()])</line-6>
<line-7>ans = [''] * n</line-7>
<line-8></line-8>
<line-9>for i in range(n-1, -1, -... | {"code": "<line-2>from array import array # noqa: F401</line-2>\n<line-25> ans[i] = str(10**9 * overflow + val)</line-25>", "lines": [2, 25]}
#### 0 |
<line-1>def check(num1, num2, p, k):</line-1>
<line-3> v *= num1 * num1 + num2 * num2</line-3>
<line-4> v %= p</line-4>
<line-5> v += p</line-5>
<line-6> v %= p</line-6>
<line-7> return v == k % p</line-7>
<line-8></line-8>
<line-9>def __starting_point():</line-9>
<line-10></line-10>
<line-11> n, p, k... | {"code": "<line-2> v = num1 + num2</line-2>\n<line-26> print(ans)</line-26>", "lines": [2, 26]}
#### 0 |
<line-1>import heapq</line-1>
<line-2></line-2>
<line-4> q, r = divmod(a, k)</line-4>
<line-5> return q**2 * (k-r) + (q+1)**2 * r</line-5>
<line-6></line-6>
<line-7>def diff(a, k):</line-7>
<line-8> return sum_sqaure(a, k+1) - sum_sqaure(a, k)</line-8>
<line-9></line-9>
<line-10>n, k = map(int, input().split()... | {"code": "<line-3>def sum_sqaure(a, k):</line-3>\n<line-19> heapq.heappush(Q, (diff(a, i+1), a, i+1))</line-19>", "lines": [3, 19]}
#### 0 |
<line-1>import sys</line-1>
<line-2></line-2>
<line-4> if not tree:</line-4>
<line-5> return</line-5>
<line-6> stack = [(root, priv_root, cur_lvl, priv_lvl)]</line-6>
<line-7> while stack:</line-7>
<line-8> (root, priv_root, cur_lvl, priv_lvl) = stack.pop()</line-8>
<line-9> if cur_lvl ^ d... | {"code": "<line-3>def dfs(tree, root, priv_root, cur_lvl, priv_lvl, diff, pick_list):</line-3>\n<line-35> return(main())</line-35>", "lines": [3, 35]}
#### 0 |
<line-1>def prime(n):</line-1>
<line-3> t = [1] * (n + 1)</line-3>
<line-4> for i in range(3, m):</line-4>
<line-5> if t[i]: t[i * i :: 2 * i] = [0] * ((n - i * i) // (2 * i) + 1)</line-5>
<line-6> return [2] + [i for i in range(3, n + 1, 2) if t[i]]</line-6>
<line-7></line-7>
<line-8>def gcd(a, b):</li... | {"code": "<line-2> m = int(n ** 0.5) + 1</line-2>\n<line-25> print(str(p // d) + '/' + str(q // d))</line-25>", "lines": [2, 25]}
#### 0 |
<line-1>from itertools import starmap</line-1>
<line-2></line-2>
<line-3></line-3>
<line-5> n, q = list(map(int, input().split()))</line-5>
<line-6></line-6>
<line-7> a = list(range(n + 1))</line-7>
<line-8> flipped = False</line-8>
<line-9> start = 0</line-9>
<line-10> end = n</line-10>
<line-11></line-... | {"code": "<line-4>def main():</line-4>\n<line-40> main()</line-40>", "lines": [4, 40]}
#### 0 |
<line-1>n, p, q = input(), set(), set()</line-1>
<line-3> q = set(i | j for j in q)</line-3>
<line-4> q.add(i)</line-4>
<line-6>print(len(p))</line-6> | {"code": "<line-2>for i in map(int, input().split()):</line-2>\n<line-5> p.update(q)</line-5>", "lines": [2, 5]}
#### 0 |
<line-1>buck = [[0, 0] for i in range(2201)]</line-1>
<line-3>for i in range(m):</line-3>
<line-4> a = int(input())</line-4>
<line-5> ok = True</line-5>
<line-6> br = 0</line-6>
<line-7> for j in range(2200, -1, -1):</line-7>
<line-8> if a & (1 << j):</line-8>
<line-9> if(buck[j][0]):</lin... | {"code": "<line-2>m = int(input())</line-2>\n<line-26> print(j, end = ' ')</line-26>", "lines": [2, 26]}
#### 0 |
<line-1>import heapq</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>buy = [] # negative</line-5>
<line-6>sell = []</line-6>
<line-7>unknown = []</line-7>
<line-8></line-8>
<line-9>res = 1</line-9>
<line-10>for i in range(n):</line-10>
<line-11> cmd, amount = input().strip().split()</line-11>
<line-12> amou... | {"code": "<line-3>n = int(input())</line-3>\n<line-36>res = res * (len(unknown) + 1) % 1000000007</line-36>", "lines": [3, 36]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>a = []</line-3>
<line-4>for i in range(max(s)):</line-4>
<line-5> a.append([]) </line-5>
<line-6>for i in range(len(s)):</line-6>
<line-7> a[s[i]-1].append(i)</line-7>
<line-8>a = list([x for x in a if x != []])</line-8>
<line-9>if len(a) > 1:</line-9>
<line-10> for... | {"code": "<line-2>s = list(map(int,input().split(' ')))</line-2>\n<line-31> i -= 1</line-31>", "lines": [2, 31]}
#### 0 |
<line-1>inp = input().split(' ')</line-1>
<line-3></line-3>
<line-4>totNums = int(inp[0]); totOpt = int(inp[1]);</line-4>
<line-5>inp = input().split(' '); #assert(len(inp) == totNums);</line-5>
<line-6>for it in inp: val.append(int(it))</line-6>
<line-7></line-7>
<line-8>dp = [[0.0 for _ in range(0,totNums)] for __ in... | {"code": "<line-2>val=[];</line-2>\n<line-29> ans += dp[i][j]</line-29>", "lines": [2, 29]}
#### 0 |
<line-1>q, b, c = list(map(int, input().split()))</line-1>
<line-3>a = list(map(int, input().split()))</line-3>
<line-4>ans = 0</line-4>
<line-5>for i in a:</line-5>
<line-6> if b < i < c:</line-6>
<line-8>print(ans)</line-8> | {"code": "<line-2>n = int(input())</line-2>\n<line-7>\t\tans += 1</line-7>", "lines": [2, 7]}
#### 0 |
<line-1>def solve():</line-1>
<line-3> t = list(map(int, input().split()))</line-3>
<line-4> from bisect import insort</line-4>
<line-5> from math import floor</line-5>
<line-6> insort(t, a * n1)</line-6>
<line-7> pred = 0</line-7>
<line-8> k = 0</line-8>
<line-9> kpred = 0</line-9>
<line-10> n ... | {"code": "<line-2> n1, m, a, d = list(map(int, input().split()))</line-2>\n<line-39> print(sol)</line-39>", "lines": [2, 39]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>lp,rp = [0 for i in range(n)],[0 for i in range(n)]</line-5>
<line-6>lnr, rnr = [a[i] for i in range(n)],[a[i] for i in range(n)]</line-6>
<line-7>mx = a[0]</line-7>
<line-8>for i in range(1,n):</line-8>
<line-9> if a[i] > mx:</line-9>
<li... | {"code": "<line-3>a = list(map(int, input().split()))</line-3>\n<line-32> ans = min(ans, ca)</line-32>", "lines": [3, 32]}
#### 0 |
<line-1>oleg = input()</line-1>
<line-3>oleg = sorted(list(oleg))</line-3>
<line-4>igor = sorted(list(igor))</line-4>
<line-5>n = len(oleg)</line-5>
<line-6>oleg_turns = (n + 1) // 2</line-6>
<line-7>igor_turns = n // 2</line-7>
<line-8>min_oleg_id = 0</line-8>
<line-9>min_igor_id = n - igor_turns</line-9>
<line-10>ans... | {"code": "<line-2>igor = input()</line-2>\n<line-38>strans = ''.join(ans)</line-38>", "lines": [2, 38]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>for _ in range(int(input())):</line-4>
<line-5> x = int(input())</line-5>
<line-6> s = list(map(int, input()))</line-6>
<line-7> ans = len(s)</line-7>
<line-8> for i in range(1, x+1):</line-8>
<line-9> ans = (i + (ans-i) * s[i-1]) % mod</line-9>
<... | {"code": "<line-2>mod = 10**9 + 7</line-2>\n<line-15> break</line-15>", "lines": [2, 15]}
#### 0 |
<line-1>n, _q = map(int, input().split())</line-1>
<line-3>mxi = [-1] * 200001</line-3>
<line-4>cnt = [0] * 200001</line-4>
<line-5>nd = 0</line-5>
<line-6>a = list(map(int, input().split()))</line-6>
<line-7>for i, v in enumerate(a):</line-7>
<line-8> if mni[v] == -1: mni[v] = i; nd += 1</line-8>
<line-9> mxi[v]... | {"code": "<line-2>mni = [-1] * 200001</line-2>\n<line-18> if z == 0: r += currmax; currmax = 0</line-18>", "lines": [2, 18]}
#### 0 |
<line-1>n, m = list(map(int, input().split()))</line-1>
<line-3>for i in range(m):</line-3>
<line-4> p, q = list(map(int, input().split()))</line-4>
<line-5> g[p - 1].append(q - 1)</line-5>
<line-6> g[q - 1].append(p - 1)</line-6>
<line-7></line-7>
<line-8>comp = [-1] * n</line-8>
<line-9>def shortest(root):</... | {"code": "<line-2>g = [[] for _ in range(n)]</line-2>\n<line-43>if good is False: print('-1')</line-43>", "lines": [2, 43]}
#### 0 |
<line-1>MOD = 1000000007</line-1>
<line-2></line-2>
<line-4>p = [int(x) for x in input().split()]</line-4>
<line-5>x = [int(x) for x in input().split()]</line-5>
<line-6></line-6>
<line-7>children = [[] for x in range(n)]</line-7>
<line-8></line-8>
<line-9>for i in range(1,n):</line-9>
<line-10> children[p[i-1]].app... | {"code": "<line-3>n = int(input())</line-3>\n<line-26> count[i] = (prod % MOD, tot % MOD)</line-26>", "lines": [3, 26]}
#### 0 |
<line-1>"""</line-1>
<line-3></line-3>
<line-4>Author : chaotic_iak</line-4>
<line-5>Language: Python 3.3.4</line-5>
<line-6>"""</line-6>
<line-7></line-7>
<line-8>def read(mode=2):</line-8>
<line-9> # 0: String</line-9>
<line-10> # 1: List of strings</line-10>
<line-11> # 2: List of integers</line-11>
<line-... | {"code": "<line-2>Codeforces Round 257 Div 1 Problem C</line-2>\n<line-95>for i in res:</line-95>", "lines": [2, 95]}
#### 0 |
<line-1>from sys import stdin</line-1>
<line-2></line-2>
<line-3></line-3>
<line-5> cnt = [0] * 2 ** 18</line-5>
<line-6> t = str.maketrans("0123456789", "0101010101")</line-6>
<line-7> _, *l = stdin.read().splitlines()</line-7>
<line-8> for sign, s in map(str.split, l):</line-8>
<line-9> if sign == ... | {"code": "<line-4>def main():</line-4>\n<line-16> main()</line-16>", "lines": [4, 16]}
#### 0 |
<line-1>t = int(input())</line-1>
<line-2></line-2>
<line-4> n = int(input())</line-4>
<line-5> a = list(map(int,input().split()))</line-5>
<line-6> sumA = sum(a)</line-6>
<line-7> TWins = False</line-7>
<line-8> for elem in a:</line-8>
<line-9> if elem > sumA // 2:</line-9>
<line-10> T... | {"code": "<line-3>for _ in range(t):</line-3>\n<line-14> else:</line-14>", "lines": [3, 14]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>stk = []</line-3>
<line-4>for v in map(int, input().split()):</line-4>
<line-5> last = 0</line-5>
<line-6> while len(stk) and stk[-1][0] < v and stk[-1][1]:</line-6>
<line-7> last = max(last, stk[-1][1])</line-7>
<line-8> del stk[-1]</line-8>
<line-9></line-... | {"code": "<line-2>ans = 0</line-2>\n<line-13> stk.append((v, last + 1)); ans = max(ans, last + 1)</line-13>", "lines": [2, 13]}
#### 0 |
<line-1>def main():</line-1>
<line-3> aa = sorted(map(int, input().split()))</line-3>
<line-4> maxa = max(aa)</line-4>
<line-5> m = [False] * (maxa + 1)</line-5>
<line-6> x = []</line-6>
<line-7> b = 0</line-7>
<line-8> for a in aa:</line-8>
<line-9> if b != a:</line-9>
<line-10> m[a... | {"code": "<line-2> input()</line-2>\n<line-26> main()</line-26>", "lines": [2, 26]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>MAX_N = max(pos_blast, key=lambda x: x[0])[0] + 2</line-3>
<line-4>power = [0 for _ in range(MAX_N)]</line-4>
<line-5>tower = [False for _ in range(MAX_N)]</line-5>
<line-6>can_destroy = [0 for _ in range(MAX_N)]</line-6>
<line-7>for pos, blast in pos_blast:</line-7>
<line-8> ... | {"code": "<line-2>pos_blast = [list(map(int, input().split())) for _ in range(n)]</line-2>\n<line-15> can_destroy[i] = can_destroy[max(0, i - power[i] - 1)] + 1</line-15>", "lines": [2, 15]}
#### 0 |
<line-1>def main():</line-1>
<line-3> scores = []</line-3>
<line-4> for i in range(n):</line-4>
<line-5> a = list(map(int, input().split()))</line-5>
<line-6> tot = sum(a)</line-6>
<line-7> scores.append((-tot, i))</line-7>
<line-8></line-8>
<line-9> scores.sort()</line-9>
<line-10> for... | {"code": "<line-2> n = int(input())</line-2>\n<line-12> print(i + 1)</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>for i in range(n):</line-3>
<line-4> tree.append([])</line-4>
<line-5> ans.append(0.0)</line-5>
<line-6> sz.append(0)</line-6>
<line-7></line-7>
<line-8>for i in range(n-1):</line-8>
<line-9> tree[pos[i]-1].append(i+1)</line-9>
<line-10></line-10>
<line-11>for i in range(n)... | {"code": "<line-2>pos,tree,ans,sz = list(map(int,input().split())) if n > 1 else [],[],[],[]</line-2>\n<line-20>st = lambda i: str(i+1)</line-20>", "lines": [2, 20]}
#### 0 |
<line-1>from collections import Counter</line-1>
<line-2></line-2>
<line-4>a = list(map(int, input().split()))</line-4>
<line-5>c = Counter(a)</line-5>
<line-6></line-6>
<line-7>res = 0</line-7>
<line-8>cur = 0</line-8>
<line-9>for i in sorted(c.keys()):</line-9>
<line-10> d = min(c[i], cur)</line-10>
<line-11> cur -... | {"code": "<line-3>n = int(input())</line-3>\n<line-13> cur += c[i]</line-13>", "lines": [3, 13]}
#### 0 |
<line-1>n, m = list(map(int, input().split()))</line-1>
<line-3>p = c = 0</line-3>
<line-4>for i in range(1, n):</line-4>
<line-5> if s[i] == s[i - 1]:</line-5>
<line-6> c += n * (m - 1)</line-6>
<line-7> p = i</line-7>
<line-8> elif s[i] != s[i - 2]:</line-8>
<line-9> p = i - 1</line-9>
<lin... | {"code": "<line-2>s = input()</line-2>\n<line-11>ans = n * n * (m - 1) - c</line-11>", "lines": [2, 11]}
#### 0 |
<line-2>b = a[::-1]</line-2>
<line-3>print(a + b)</line-3> | {"code": "<line-1>a = input()</line-1>", "lines": [1]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3></line-3>
<line-4></line-4>
<line-5>for a in range(n):</line-5>
<line-6> name = input()</line-6>
<line-7></line-7>
<line-8> name = name.replace('u', 'oo')</line-8>
<line-9></line-9>
<line-10> while (name.count('kh') > 0):</line-10>
<line-11> name = name.replace(... | {"code": "<line-2>s = set()</line-2>\n<line-12> s.add(name)</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>n, k = list(map(int, input().split()))</line-4>
<line-5></line-5>
<line-6>begin = [-1] * n</line-6>
<line-7>end = [-1] * n</line-7>
<line-8>hurt = [-1] * n</line-8>
<line-9></line-9>
<line-10>adj = [[] for i in range(n)]</line-10>
<line-11>for _ in range(n-1):</line... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-37> out += desc[i]</line-37>", "lines": [2, 37]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4></line-4>
<line-5>n = int(input())</line-5>
<line-6>a = list(map(int, input().split()))</line-6>
<line-7>b = a</line-7>
<line-8></line-8>
<line-9>ans = 0</line-9>
<line-10>for k in range(29):</line-10>
<line-11> a0 = []</line-11>
<line-12> a1 = []</line-12>
<l... | {"code": "<line-2>input = sys.stdin.readline </line-2>\n<line-49> ans |= (res & 1) << k</line-49>", "lines": [2, 49]}
#### 0 |
<line-1>import sys</line-1>
<line-3>a = [int(x) for x in sys.stdin.readline().split()]</line-3>
<line-4></line-4>
<line-5>eps = 1e-12</line-5>
<line-6></line-6>
<line-7>def f(x):</line-7>
<line-8> mx = a[0] - x</line-8>
<line-9> tsmx = 0.0</line-9>
<line-10> mn = a[0] - x</line-10>
<line-11> tsmn = 0.0</lin... | {"code": "<line-2>n = int(sys.stdin.readline())</line-2>\n<line-31>A, B = f(l)</line-31>", "lines": [2, 31]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>n=int(input())</line-4>
<line-5>A=list(map(int,input().split()))</line-5>
<line-6></line-6>
<line-7>BIT=[0]*(n+1)</line-7>
<line-8></line-8>
<line-9>def update(v,w):</line-9>
<line-10> while v<=n:</line-10>
<line-11> BIT[v]+=w</line-11>
<line-12> v+... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-44> update(x,-x)</line-44>", "lines": [2, 44]}
#### 0 |
<line-1>def main():</line-1>
<line-3> a = [[int(i) for i in input().split()] for j in range(n)]</line-3>
<line-4> </line-4>
<line-5> result = [-1] * n</line-5>
<line-6> for i in range(n - 1):</line-6>
<line-7> for j in range(n):</line-7>
<line-8> d = set(a[j][k] for k in range(n) if result... | {"code": "<line-2> n = int(input())</line-2>\n<line-13> print(' '.join(str(i) for i in result))</line-13>", "lines": [2, 13]}
#### 0 |
<line-1>import sys</line-1>
<line-3>import heapq</line-3>
<line-4></line-4>
<line-5>mod=998244353</line-5>
<line-6></line-6>
<line-7>n,m=list(map(int,input().split()))</line-7>
<line-8></line-8>
<line-9>E=[[] for i in range(n+1)]</line-9>
<line-10>E2=[[] for i in range(n+1)]</line-10>
<line-11></line-11>
<line-12>for i... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-84> A=(ANS[k]+pow(2,k,mod)-1)%mod</line-84>", "lines": [2, 84]}
#### 0 |
<line-1>def main():</line-1>
<line-3> from array import array</line-3>
<line-4> from collections import deque</line-4>
<line-5> input = sys.stdin.readline</line-5>
<line-6></line-6>
<line-7> H, W, Q = list(map(int, input().split()))</line-7>
<line-8> grid = array('b', [0] * (H*W))</line-8>
<line-9> #f... | {"code": "<line-2> import sys</line-2>\n<line-81> main()</line-81>", "lines": [2, 81]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>p = [0] * (n + 1)</line-3>
<line-4>ans = [1] * (n + 1)</line-4>
<line-5>ind = n</line-5>
<line-6>for i in range(n):</line-6>
<line-7> p[a[i] - 1] = 1</line-7>
<line-8> while ind > 0 and p[ind - 1] == 1:</line-8>
<line-9> ind -= 1</line-9>
<line-11>print(' '.join(ma... | {"code": "<line-2>a = list(map(int, input().split()))</line-2>\n<line-10> ans[i + 1] = 1 + (i + 1) - (n - ind)</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>n=int(input())</line-1>
<line-3>for i in range (n):</line-3>
<line-4> t,x,y=list(map(int,input().split()))</line-4>
<line-5> if t==1:</line-5>
<line-6> ta+=(x+y)</line-6>
<line-7> da+=y</line-7>
<line-8> if (t==2):</line-8>
<line-9> tb+=(x+y)</line-9>
<line-10> db+=y <... | {"code": "<line-2>ta,tb,da,db=[0]*4</line-2>\n<line-17>else :</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>#!usr/bin/env python3</line-1>
<line-3>from heapq import heappush, heappop</line-3>
<line-4>import sys</line-4>
<line-5>import math</line-5>
<line-6>import bisect</line-6>
<line-7>def LI(): return [int(x) for x in sys.stdin.readline().split()]</line-7>
<line-8>def I(): return int(sys.stdin.readline())</line-8>
... | {"code": "<line-2>from collections import defaultdict,deque</line-2>\n<line-150> D()</line-150>", "lines": [2, 150]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>for i in range(n-1):</line-3>
<line-4> u,v = [int(i)-1 for i in input().split()]</line-4>
<line-5> g[u].append(v)</line-5>
<line-6> g[v].append(u)</line-6>
<line-7></line-7>
<line-8>leaf = [len(i)==1 for i in g]</line-8>
<line-9>root = -1</line-9>
<line-10>mx = n-1</li... | {"code": "<line-2>g = [[] for i in range(n)]</line-2>\n<line-31>mn = 1 if even else 3</line-31>", "lines": [2, 31]}
#### 0 |
<line-1>import sys</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>n=int(input())</line-5>
<line-6>b=list(map(int,input().split()))</line-6>
<line-7>ope=[[] for i in range(n)]</line-7>
<line-8>Q=int(input())</line-8>
<line-9>for i in range(Q):</line-9>
<line-10> l,r=list(map(int,input().split()))</line-10>
<lin... | {"code": "<line-3>input=sys.stdin.readline</line-3>\n<line-70> update(l+1,i+2,(val,val))</line-70>", "lines": [3, 70]}
#### 0 |
<line-1></line-1>
<line-2>import sys</line-2>
<line-4>input=sys.stdin.readline</line-4>
<line-5>mii=lambda:list(map(int,input().split()))</line-5>
<line-6></line-6>
<line-7>for _ in range(int(input())):</line-7>
<line-8> n,x=mii()</line-8>
<line-9> has=0</line-9>
<line-10> a=0</line-10>
<line-11> for i in m... | {"code": "<line-3>#sys.stdin=open(\"data.txt\")</line-3>\n<line-16> else:</line-16>", "lines": [3, 16]}
#### 0 |
<line-1>import sys</line-1>
<line-3>qis = [int(sys.stdin.readline().strip()) for _ in range(q)]</line-3>
<line-4></line-4>
<line-5>def query(n, q):</line-5>
<line-6> d = 2 * n - q</line-6>
<line-7> while d % 2 == 0:</line-7>
<line-8> d //= 2</line-8>
<line-9> return (n - d // 2)</line-9>
<line-10></line-10>
<line-12> ... | {"code": "<line-2>[n, q] = map(int, sys.stdin.readline().strip().split())</line-2>\n<line-11>for qi in qis:</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>T = int(input())</line-1>
<line-3> a, b, n = [int(i) for i in input().split()]</line-3>
<line-4> if n%3 == 2:</line-4>
<line-5> print(a^b)</line-5>
<line-6> elif n%3 == 1:</line-6>
<line-7> print(b)</line-7>
<line-9> print(a)</line-9> | {"code": "<line-2>for t in range(T):</line-2>\n<line-8> else:</line-8>", "lines": [2, 8]}
#### 0 |
<line-1></line-1>
<line-2></line-2>
<line-3>class Graph:</line-3>
<line-5> self.n_vertices = n_vertices</line-5>
<line-6> self.edges = edges</line-6>
<line-7> self.directed = directed</line-7>
<line-8> self.weighted = weighted</line-8>
<line-9></line-9>
<line-10> @property</line-10>
<line... | {"code": "<line-4> def __init__(self, n_vertices, edges, directed=True, weighted=False):</line-4>\n<line-132> print(*solve(T))</line-132>", "lines": [4, 132]}
#### 0 |
<line-1></line-1>
<line-2></line-2>
<line-3>#===============================================================================================</line-3>
<line-5></line-5>
<line-6></line-6>
<line-7></line-7>
<line-8>from fractions import Fraction</line-8>
<line-9>import sys</line-9>
<line-10>import os</line-10>
<line-11>fr... | {"code": "<line-4>#importing some useful libraries.</line-4>\n<line-228>testcase(1)</line-228>", "lines": [4, 228]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>m=int(sys.stdin.readline())</line-4>
<line-5></line-5>
<line-6>Numx=[]</line-6>
<line-7>Numy=[]</line-7>
<line-8>Numz=[]</line-8>
<line-9>x=0</line-9>
<line-10>y=0</line-10>
<line-11>z=0</line-11>
<line-12>for i in range(len(s)):</line-12>
<line-13> if(s[i]=='x')... | {"code": "<line-2>s=sys.stdin.readline().split()[0]</line-2>\n<line-50> Ans+=\"NO\\n\"</line-50>", "lines": [2, 50]}
#### 0 |
<line-1>import sys</line-1>
<line-2></line-2>
<line-4>d = list(map(int, sys.stdin.readline().split()))</line-4>
<line-5>gph = [[] for _ in range(n)]</line-5>
<line-6></line-6>
<line-7>for _ in range(m):</line-7>
<line-8> u, v = list(map(int, sys.stdin.readline().split()))</line-8>
<line-9> u -= 1</line-9>
<line-1... | {"code": "<line-3>n, m = list(map(int, sys.stdin.readline().split()))</line-3>\n<line-46>print(\"\\n\".join([str(i+1) for i in range(m) if ans[i]]))</line-46>", "lines": [3, 46]}
#### 0 |
<line-1>n=int(input())</line-1>
<line-3>q=int(input())</line-3>
<line-4>changes=[0]*q</line-4>
<line-5>for i in range(q):</line-5>
<line-6> changes[-i-1]=tuple(map(int,input().split()))</line-6>
<line-7>final=[-1]*n</line-7>
<line-8>curr=0</line-8>
<line-9>for guy in changes:</line-9>
<line-10> if guy[0]==1:</lin... | {"code": "<line-2>a=list(map(int,input().split()))</line-2>\n<line-18>final=[str(guy) for guy in final]</line-18>", "lines": [2, 18]}
#### 0 |
<line-1>n, q = map(int, input().split())</line-1>
<line-3></line-3>
<line-4>nxt = [[n + 1] * (n + 2) for _ in range(26)]</line-4>
<line-5>for i in range(n - 1, -1, -1):</line-5>
<line-6> c = ord(s[i + 1]) - 97</line-6>
<line-7> for j in range(26):</line-7>
<line-8> nxt[j][i] = nxt[j][i + 1]</line-8>
<line-... | {"code": "<line-2>s = '!' + input()</line-2>\n<line-36> out.append('YES' if req <= n else 'NO')</line-36>", "lines": [2, 36]}
#### 0 |
<line-1>import sys</line-1>
<line-3>class Lazysegtree:</line-3>
<line-4> #RAQ</line-4>
<line-5> def __init__(self, A, intv, initialize = True, segf = min):</line-5>
<line-6> #区間は 1-indexed で管理</line-6>
<line-7> self.N = len(A)</line-7>
<line-8> self.N0 = 2**(self.N-1).bit_length()</line-8>
<l... | {"code": "<line-2>from itertools import accumulate </line-2>\n<line-175> Ans[q] = T.provfunc()</line-175>", "lines": [2, 175]}
#### 0 |
<line-1>n=int(input())</line-1>
<line-3>for i in range(n):</line-3>
<line-4> a.append(list(map(int,input().split())))</line-4>
<line-5>m=int(input())</line-5>
<line-6>b=list(map(lambda x:int(x)-1,input().split()))</line-6>
<line-7>c=[]</line-7>
<line-8>now=0</line-8>
<line-9>k=0</line-9>
<line-10>ans=[]</line-10>
<l... | {"code": "<line-2>a=[]</line-2>\n<line-29>for i in range(m):</line-29>", "lines": [2, 29]}
#### 0 |
<line-1>def dfs(x, y):</line-1>
<line-3> y += 1</line-3>
<line-4> nonlocal flag</line-4>
<line-5> if flag or str.isalpha(grid[x][y]):</line-5>
<line-6> return</line-6>
<line-7> if y >= n - 1:</line-7>
<line-8> flag = True</line-8>
<line-9> return</line-9>
<line-10> </line-10>
<line-1... | {"code": "<line-2> vis.append((x, y))</line-2>\n<line-40> else:</line-40>", "lines": [2, 40]}
#### 0 |
<line-1># import atexit</line-1>
<line-3># import sys</line-3>
<line-4>#</line-4>
<line-5># _INPUT_LINES = sys.stdin.read().splitlines()</line-5>
<line-6># input = iter(_INPUT_LINES).__next__</line-6>
<line-7># _OUTPUT_BUFFER = io.StringIO()</line-7>
<line-8># sys.stdout = _OUTPUT_BUFFER</line-8>
<line-9>#</line-9>
<li... | {"code": "<line-2># import io</line-2>\n<line-43> main()</line-43>", "lines": [2, 43]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>b = [int(x) for x in input().strip()]</line-3>
<line-4>p, q, r, s = 0, 0, 0, 0</line-4>
<line-5>for i in range(n):</line-5>
<line-6> if a[i] * 2 + b[i] == 0:</line-6>
<line-7> p += 1</line-7>
<line-8> if a[i] * 2 + b[i] == 1:</line-8>
<line-9> q += 1</line-9... | {"code": "<line-2>a = [int(x) for x in input().strip()]</line-2>\n<line-13> s += 1</line-13>", "lines": [2, 13]}
#### 0 |
<line-1>import sys</line-1>
<line-3>sys.setrecursionlimit(10**9)</line-3>
<line-4>from collections import deque</line-4>
<line-5></line-5>
<line-6>class Node:</line-6>
<line-7> def __init__(self,depth):</line-7>
<line-8> self.depth=depth</line-8>
<line-9> self.left=None</line-9>
<line-10> self.r... | {"code": "<line-2>input=sys.stdin.readline</line-2>\n<line-61> xor^=Grundy(i)</line-61>", "lines": [2, 61]}
#### 0 |
<line-1>class SegmentTree:</line-1>
<line-3> """initialize the segment tree with data"""</line-3>
<line-4> self._default = default</line-4>
<line-5> self._func = func</line-5>
<line-6> self._len = len(data)</line-6>
<line-7> self._size = _size = 1 << (self._len - 1).bit_length()</line... | {"code": "<line-2> def __init__(self, data, default=0, func=max):</line-2>\n<line-92> out += add</line-92>", "lines": [2, 92]}
#### 0 |
<line-1>n, k = map(int, input().split())</line-1>
<line-3>b = ['0'] * n</line-3>
<line-4>c = []</line-4>
<line-5>s = input()</line-5>
<line-6>for i in range(n):</line-6>
<line-7> if k != 0:</line-7>
<line-8> if s[i] == '(':</line-8>
<line-9> c.append(i)</line-9>
<line-10> else:</line-10>
<li... | {"code": "<line-2>a = [0] * n</line-2>\n<line-16> if a[i] == 1:</line-16>", "lines": [2, 16]}
#### 0 |
<line-1>from collections import deque</line-1>
<line-2></line-2>
<line-4> n = len(adj)</line-4>
<line-5> nn = [len(a) for a in adj]</line-5>
<line-6> q = deque()</line-6>
<line-7> for i in range(n):</line-7>
<line-8> if nn[i] < k:</line-8>
<line-9> q.append(i)</line-9>
<line-10> while q... | {"code": "<line-3>def solve(adj, m, k, uv):</line-3>\n<line-57>res = solve(a, m, k, uv)</line-57>", "lines": [3, 57]}
#### 0 |
<line-1>def sub(a, s):</line-1>
<line-3> ps = 0</line-3>
<line-4> while pa < len(a) and ps < len(s):</line-4>
<line-5> if a[pa] == s[ps]:</line-5>
<line-6> ps += 1</line-6>
<line-7> pa += 1</line-7>
<line-8> else:</line-8>
<line-9> pa += 1</line-9>
<line-10></line-10... | {"code": "<line-2> pa = 0</line-2>\n<line-45> print(ans)</line-45>", "lines": [2, 45]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-2></line-2>
<line-4>a = [int(i) for i in input().split()]</line-4>
<line-5>b = [int(i) for i in input().split()]</line-5>
<line-6></line-6>
<line-7>s = []</line-7>
<line-8>for i in range(n):</line-8>
<line-9> s.append([p[i], a[i], b[i]])</line-9>
<line-10></line-10>
<line-11>s... | {"code": "<line-3>p = [int(i) for i in input().split()]</line-3>\n<line-30> ans.append(-1)</line-30>", "lines": [3, 30]}
#### 0 |
<line-1>import sys </line-1>
<line-3></line-3>
<line-4>MOD = 10**9 + 7</line-4>
<line-5>t = int(input())</line-5>
<line-6></line-6>
<line-7>for _ in range(t):</line-7>
<line-8> r, c = list(map(int, input().split()))</line-8>
<line-9> s = [list(input()) for i in range(r)]</line-9>
<line-10> cnt_a = 0</line-10>
... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-51> else:</line-51>", "lines": [2, 51]}
#### 0 |
<line-1>"""</line-1>
<line-3></line-3>
<line-4>Author : chaotic_iak</line-4>
<line-5>Language: Python 3.5.2</line-5>
<line-6>"""</line-6>
<line-7></line-7>
<line-8>################################################### SOLUTION</line-8>
<line-9></line-9>
<line-10>def main():</line-10>
<line-11> n, = read()</line-11>
<... | {"code": "<line-2>Codeforces Round 372 Div 1 Problem A</line-2>\n<line-33> print(s, end=\"\")</line-33>", "lines": [2, 33]}
#### 0 |
<line-1></line-1>
<line-2>import os</line-2>
<line-4>from io import BytesIO, IOBase</line-4>
<line-5></line-5>
<line-6></line-6>
<line-7>def main():</line-7>
<line-8> pass</line-8>
<line-9></line-9>
<line-10></line-10>
<line-11># region fastio</line-11>
<line-12></line-12>
<line-13>BUFSIZE = 8192</line-13>
<line-14>... | {"code": "<line-3>import sys</line-3>\n<line-84> out.append((u*w+u+w+1)%MOD)</line-84>", "lines": [3, 84]}
#### 0 |
<line-1>import sys</line-1>
<line-3>def solve():</line-3>
<line-4> sys.setrecursionlimit(10**6)</line-4>
<line-5> readline = sys.stdin.readline</line-5>
<line-6> writelines = sys.stdout.writelines</line-6>
<line-7> N = int(readline())</line-7>
<line-8> G = [[] for i in range(N)]</line-8>
<line-9> for ... | {"code": "<line-2>from collections import deque</line-2>\n<line-132> writelines(ans)</line-132>", "lines": [2, 132]}
#### 0 |
<line-1>def main():</line-1>
<line-3> dumi=0</line-3>
<line-4> for child in graph[vert]:</line-4>
<line-5> if child!=pard:</line-5>
<line-6> if len(graph[child])==1:</line-6>
<line-7> memo[child]=0</line-7>
<line-8> else:</line-8>
<line-9> ... | {"code": "<line-2> def countchildren(graph,vert,memo,pard=None):</line-2>\n<line-50>main_thread.start()</line-50>", "lines": [2, 50]}
#### 0 |
<line-1>import sys</line-1>
<line-3>class UF():</line-3>
<line-4> def __init__(self, num):</line-4>
<line-5> self.par = [-1]*num</line-5>
<line-6> self.weight = [0]*num</line-6>
<line-7> def find(self, x):</line-7>
<line-8> if self.par[x] < 0:</line-8>
<line-9> return x</line-9>
<l... | {"code": "<line-2>readline = sys.stdin.readline</line-2>\n<line-109> cnt = Ans[i] </line-109>", "lines": [2, 109]}
#### 0 |
<line-1>import sys</line-1>
<line-3>input = reader.__next__</line-3>
<line-4></line-4>
<line-5>class Binary_Indexed_Tree():</line-5>
<line-6> def __init__(self, n):</line-6>
<line-7> self.n = n</line-7>
<line-8> self.data = [0]*(n+1)</line-8>
<line-9></line-9>
<line-10> def add(self, i, x):</line-10... | {"code": "<line-2>reader = (s.rstrip() for s in sys.stdin)</line-2>\n<line-75> ans.append(tmp)</line-75>", "lines": [2, 75]}
#### 0 |
<line-1>def popcount(n):</line-1>
<line-3> while n > 0:</line-3>
<line-4> res += n & 1</line-4>
<line-5> n >>= 2</line-5>
<line-6></line-6>
<line-7>def A(l, r):</line-7>
<line-8> r += 1</line-8>
<line-9> t = 1 << 64</line-9>
<line-10> while t & (l ^ r) == 0:</line-10>
<line-11> t >>= 1</line-11>
<line-12> res = l | ... | {"code": "<line-2>\tres = 0</line-2>\n<line-27>\t\tprint(res)</line-27>", "lines": [2, 27]}
#### 0 |
<line-1>def mat(shape, inital_val=None):</line-1>
<line-3> return [mat(shape[1:], inital_val) for _ in range(shape[0])] </line-3>
<line-4> else:</line-4>
<line-5> return [inital_val] * shape[0]</line-5>
<line-6> </line-6>
<line-7>def main():</line-7>
<line-8> n, m = [int(x) for x in inpu... | {"code": "<line-2> if len(shape) > 1:</line-2>\n<line-40> main()</line-40>", "lines": [2, 40]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>r[1] = [0]</line-3>
<line-4>for i in range(n - 1):</line-4>
<line-5> a, b = map(int, input().split())</line-5>
<line-6> r[a].append(b)</line-6>
<line-7> r[b].append(a)</line-7>
<line-8>t = list(map(int, input().split()))</line-8>
<line-9>u, v = [0] * (n + 1), [0] * (n ... | {"code": "<line-2>r = [[] for i in range(n + 1)]</line-2>\n<line-38> else: u[b], v[b] = x[b], x[b] + v[b]</line-38>", "lines": [2, 38]}
#### 0 |
<line-1>MOD=10**9+7</line-1>
<line-3>A=list(map(int, input().split()))</line-3>
<line-4>B=list(map(int, input().split()))</line-4>
<line-5>P=[[1] for _ in range(401)]</line-5>
<line-6>for _ in range(1,401):</line-6>
<line-7> for i in range(1,401):</line-7>
<line-8> P[i].append(P[i][-1]*i%MOD)</line-8>
<line-9... | {"code": "<line-2>N,C=map(int, input().split())</line-2>\n<line-24> dp[n][k]%=MOD</line-24>", "lines": [2, 24]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>MOD = 10**9 + 7</line-4>
<line-5></line-5>
<line-6>N = int(input())</line-6>
<line-7>ball = (tuple(int(x) for x in row.split()) for row in sys.stdin.readlines())</line-7>
<line-8></line-8>
<line-9># x座標を1,2,...,N</line-9>
<line-10># y座標をN+1,N+2,...,N+N</line-10>
<li... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-103> answer %= MOD</line-103>", "lines": [2, 103]}
#### 0 |
<line-1>from bisect import bisect</line-1>
<line-3></line-3>
<line-4></line-4>
<line-5>class Bit:</line-5>
<line-6> def __init__(self, n, MOD):</line-6>
<line-7> self.size = n</line-7>
<line-8> self.tree = [0] * (n + 1)</line-8>
<line-9> self.depth = n.bit_length()</line-9>
<line-10> self... | {"code": "<line-2>from collections import defaultdict</line-2>\n<line-65> bit.add(b, bit.sum(b - 1))</line-65>", "lines": [2, 65]}
#### 0 |
<line-1># seishin.py</line-1>
<line-3>P = [list(map(int, input().split())) for i in range(N)]</line-3>
<line-4></line-4>
<line-5>from heapq import heappush, heappop</line-5>
<line-6></line-6>
<line-7>l0, r0 = P[0]</line-7>
<line-8></line-8>
<line-9>L = [-l0+1]</line-9>
<line-10>R = [l0-1]</line-10>
<line-11>s = t = 0</... | {"code": "<line-2>N = int(input())</line-2>\n<line-32> res += ((l1-1) - p)</line-32>", "lines": [2, 32]}
#### 0 |
<line-1>from sys import stdin, stdout</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>n, m, k = rd()</line-5>
<line-6>a = rd()</line-6>
<line-7>b = [rd() for _ in range(m)]</line-7>
<line-8>x = [0]*(m+1)</line-8>
<line-9>y = [0]*(n+1)</line-9>
<line-10></line-10>
<line-11>for _ in range(k):</line-11>
<line-12> l,... | {"code": "<line-3>rd = lambda: list(map(int, stdin.readline().split()))</line-3>\n<line-26> a[i] += s</line-26>", "lines": [3, 26]}
#### 0 |
<line-1>from sys import stdin</line-1>
<line-3>def main():</line-3>
<line-4> n,k = map(int,stdin.readline().split())</line-4>
<line-5> X = list(map(int,stdin.readline().split()))</line-5>
<line-6> A = int(stdin.readline().strip())</line-6>
<line-7> C = list(map(int,stdin.readline().split()))</line-7>
<line-8> l = list... | {"code": "<line-2>from heapq import heappop,heappush</line-2>\n<line-22>\t\tprint(-1)</line-22>", "lines": [2, 22]}
#### 0 |
<line-1># https://codeforces.com/problemset/problem/280/C</line-1>
<line-3>import sys</line-3>
<line-4></line-4>
<line-5>nodes = int(sys.stdin.readline())</line-5>
<line-6>edges = defaultdict(list)</line-6>
<line-7>for line in sys.stdin:</line-7>
<line-8> a, b = line.split()</line-8>
<line-9> a = int(a)</line-9>
... | {"code": "<line-2>from collections import defaultdict, deque</line-2>\n<line-21> bfs.append((n2, depth + 1))</line-21>", "lines": [2, 21]}
#### 0 |
<line-1>mod = 1000000007</line-1>
<line-3></line-3>
<line-4></line-4>
<line-5>def main():</line-5>
<line-6> import sys</line-6>
<line-7> input = sys.stdin.readline</line-7>
<line-8></line-8>
<line-9> def PrimeDecomposition(N):</line-9>
<line-10> ret = {}</line-10>
<line-11> n = int(N ** 0.5)</lin... | {"code": "<line-2>eps = 10**-9</line-2>\n<line-44> main()</line-44>", "lines": [2, 44]}
#### 0 |
<line-1>for __ in range(int(input())):</line-1>
<line-3> if a == c or b == d:</line-3>
<line-4> print(abs(a - c) + abs(b - d))</line-4>
<line-6> print(abs(a - c) + abs(b - d) + 2)</line-6> | {"code": "<line-2> a, b, c, d = list(map(int, input().split()))</line-2>\n<line-5> else:</line-5>", "lines": [2, 5]}
#### 0 |
<line-1>n, m, k = list(map(int,input().split()))</line-1>
<line-3>vis = {}</line-3>
<line-4>sensors = []</line-4>
<line-5>border = set()</line-5>
<line-6>for el in [(0, m), (n, 0), (0, 0), (n, m)]:</line-6>
<line-7> border.add(el)</line-7>
<line-8></line-8>
<line-9>for _ in range(k):</line-9>
<line-10> x, y = lis... | {"code": "<line-2>dm, dp = {}, {}</line-2>\n<line-89> #print(sensors[i])</line-89>", "lines": [2, 89]}
#### 0 |
<line-1>import sys</line-1>
<line-2></line-2>
<line-4>L = [0 for i in range (0, n)]</line-4>
<line-5>H = [[] for i in range (0, n)]</line-5>
<line-6>for i in range (0, m):</line-6>
<line-7> x, y = list(map(int, sys.stdin.readline().strip().split()))</line-7>
<line-8> x = x - 1</line-8>
<line-9> y = y - 1</line... | {"code": "<line-3>n, m = list(map(int, sys.stdin.readline().strip().split()))</line-3>\n<line-27> ans = ans + L[w] - len(H[w]) + 1</line-27>", "lines": [3, 27]}
#### 0 |
<line-1>#!/usr/bin/env python3</line-1>
<line-3>Created on Wed Feb 28 11:47:12 2018</line-3>
<line-4></line-4>
<line-5>@author: mikolajbinkowski</line-5>
<line-6>"""</line-6>
<line-7>import sys</line-7>
<line-8></line-8>
<line-9>N = int(input())</line-9>
<line-10></line-10>
<line-11>string_count = {}</line-11>
<line-12... | {"code": "<line-2>\"\"\"</line-2>\n<line-28> pairs += v * string_count.get(s[:i] + s[i+1:], 0)</line-28>", "lines": [2, 28]}
#### 0 |
<line-1>corr = lambda x, y: 1 <= x <= n and 1 <= y <= m</line-1>
<line-2></line-2>
<line-4>a = []</line-4>
<line-5>while T:</line-5>
<line-6> a.append(T % 6)</line-6>
<line-7> T //= 6</line-7>
<line-8>L = len(a)</line-8>
<line-9>n = m = L * 2 + 2</line-9>
<line-10>ans = [(1, 2, 2, 2), (2, 1, 2, 2)]</line-10>
<lin... | {"code": "<line-3>T = int(input())</line-3>\n<line-38>print(len(ans))</line-38>", "lines": [3, 38]}
#### 0 |
<line-1>#!/usr/bin/env python</line-1>
<line-3>import sys,collections</line-3>
<line-4>n,q=list(map(int,input().split()))</line-4>
<line-5>M=collections.defaultdict(collections.deque)</line-5>
<line-6>Q=collections.deque()</line-6>
<line-7>L=[]</line-7>
<line-8>s=n=m=0</line-8>
<line-9>for _ in range(q):</line-9>
<line... | {"code": "<line-2>#-*-coding:utf-8 -*-</line-2>\n<line-30>\tL.append(s)</line-30>", "lines": [2, 30]}
#### 0 |
<line-1>ii = lambda: int(input())</line-1>
<line-3>li = lambda: list(mi())</line-3>
<line-4>from collections import Counter as C</line-4>
<line-5>n = ii()</line-5>
<line-6>a = li()</line-6>
<line-7>oe = [C(), C()]</line-7>
<line-8>oe[1][0] = 1</line-8>
<line-9>x = 0</line-9>
<line-10>ans = 0</line-10>
<line-11>for i in... | {"code": "<line-2>mi = lambda: map(int, input().split())</line-2>\n<line-14> oe[i % 2][x] += 1</line-14>", "lines": [2, 14]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>n,m=list(map(int,input().split()))</line-4>
<line-5>ANS=[]</line-5>
<line-6></line-6>
<line-7>for i in range(1,n//2+1):</line-7>
<line-8> for j in range(1,m+1):</line-8>
<line-9> sys.stdout.write("".join((str(i)," ",str(j),"\n")))</line-9>
<line-10> ... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-19> if m%2==1:</line-19>", "lines": [2, 19]}
#### 0 |
<line-1>import sys</line-1>
<line-3>T = int(input())</line-3>
<line-4>for _ in range(T):</line-4>
<line-5> N = int(input())</line-5>
<line-6> A = [ord(a) - 97 for a in input()]</line-6>
<line-7> B = [ord(a) - 97 for a in input()]</line-7>
<line-8> X = [[0] * 20 for _ in range(20)]</line-8>
<line-9> for a... | {"code": "<line-2>input = lambda: sys.stdin.readline().rstrip()</line-2>\n<line-23> break</line-23>", "lines": [2, 23]}
#### 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.