question stringlengths 0 30.2k | answer stringlengths 55 2.44k |
|---|---|
<line-1>import heapq</line-1>
<line-3>d = list(map(int,input().split()))</line-3>
<line-4>pq = [-d[0]]</line-4>
<line-5>heapq.heapify(pq)</line-5>
<line-6>ans = 0</line-6>
<line-7>for i in range(1,n):</line-7>
<line-8> temp = i - d[i]</line-8>
<line-9> heapq.heappush(pq,temp)</line-9>
<line-10> if heapq.nsmall... | {"code": "<line-2>n = int(input())</line-2>\n<line-12> heapq.heappushpop(pq,temp)</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>seq = inp.split(' ')</line-3>
<line-4>seq = [ abs(int(x)) for x in seq ]</line-4>
<line-5>Max = max(seq)</line-5>
<line-6>nxt = [0] * n</line-6>
<line-7>cnt = [0] * n</line-7>
<line-8>pos = [n] * (Max+1)</line-8>
<line-9>for i in range(n-1, -1, -1):</line-9>
<line-10> nxt[i]... | {"code": "<line-2>inp = input()</line-2>\n<line-31> inv += 1</line-31>", "lines": [2, 31]}
#### 0 |
<line-1>def f(m):</line-1>
<line-3> l = 0</line-3>
<line-4> for i in range(n):</line-4>
<line-5> while l < n and v[l] < v[i] - m:</line-5>
<line-6> l += 1</line-6>
<line-7> if l - 1 > i - k:</line-7>
<line-8> dp[i] = False</line-8>
<line-9> else:</line-9>
<line-10> ... | {"code": "<line-2> nonlocal dp, sdp</line-2>\n<line-28> le = m </line-28>", "lines": [2, 28]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>def solve(ax,ay,bx,by,cx,cy):</line-4>
<line-5> x = ax+bx+cx</line-5>
<line-6> y = ay+by+cy</line-6>
<line-7> x -= x//3+1</line-7>
<line-8> y -= y//3+1</line-8>
<line-9> if x==y:</line-9>
<line-10> return x if 0 <= x <= 1 else abs(x)+1</line-10... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-16> ax,ay,bx,by,cx,cy = map(int,input().split())</line-16>", "lines": [2, 16]}
#### 0 |
<line-1>def main():</line-1>
<line-3> inv_n = [0]*1001</line-3>
<line-4> nCr = [[1]*(i+1) for i in range(1001)]</line-4>
<line-5> for i in range(1001):</line-5>
<line-6> inv_n[i] = pow(i, mod-2, mod)</line-6>
<line-7> for i in range(2, 1001):</line-7>
<line-8> for j in range(1, i):</line-8>
<l... | {"code": "<line-2> mod = 10**9+7</line-2>\n<line-26> print((dp[-1]))</line-26>", "lines": [2, 26]}
#### 0 |
<line-1>rd = lambda: list(map(int, input().split()))</line-1>
<line-2></line-2>
<line-4> if f[x]!=x: f[x] = root(f[x])</line-4>
<line-5> return f[x]</line-5>
<line-6></line-6>
<line-7>n, m = rd()</line-7>
<line-8>N = list(range(n))</line-8>
<line-9>f = list(N)</line-9>
<line-10>lang = [0]*n</line-10>
<line-11>for i i... | {"code": "<line-3>def root(x):</line-3>\n<line-17> lang[i] = lang[i].union(lang[rj])</line-17>", "lines": [3, 17]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>N, Q = list(map(int, readline().split()))</line-4>
<line-5>state = [[False]*(N+2) for _ in range(2)]</line-5>
<line-6></line-6>
<line-7>cnt = 0</line-7>
<line-8></line-8>
<line-9>Ans = [None]*Q</line-9>
<line-10>for qu in range(Q):</line-10>
<line-11> r, c = list... | {"code": "<line-2>readline = sys.stdin.readline</line-2>\n<line-20> Ans[qu] = 'No' if cnt else 'Yes'</line-20>", "lines": [2, 20]}
#### 0 |
<line-1>n, k = [int(c) for c in input().split()]</line-1>
<line-3>for i in range(k):</line-3>
<line-4> ak = [int(c) for c in input().split()]</line-4>
<line-5> a.append(ak[1:])</line-5>
<line-6></line-6>
<line-7>total = k - 1</line-7>
<line-8></line-8>
<line-9>for ak in a:</line-9>
<line-10> if ak[0] == 1:</li... | {"code": "<line-2>a = []</line-2>\n<line-18> total += 2*(len(ak) - 1)</line-18>", "lines": [2, 18]}
#### 0 |
<line-1>import os</line-1>
<line-3>import sys</line-3>
<line-4>from typing import List, Dict</line-4>
<line-5></line-5>
<line-6></line-6>
<line-7>class Int:</line-7>
<line-8> def __init__(self, val):</line-8>
<line-9> self.val = val</line-9>
<line-10></line-10>
<line-11> def get(self):</line-11>
<line-12> ... | {"code": "<line-2>import random</line-2>\n<line-107># print(solve(a), slowsolve(a))</line-107>", "lines": [2, 107]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>t[0][0] = 0</line-3>
<line-4>n += 1</line-4>
<line-5>u = [-1e7] * n</line-5>
<line-6>v = [0] * n</line-6>
<line-7>for i, (j, a) in list(enumerate(t, 1))[::-1]:</line-7>
<line-8> u[i] = max(u[i], v[i] + a)</line-8>
<line-10>print(u[1])</line-10> | {"code": "<line-2>t = [list(map(int, input().split())) for q in range(n)]</line-2>\n<line-9> v[j], u[j] = max(v[j] + v[i], u[j] + u[i]), max(v[j] + u[i], u[j] + v[i])</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>from collections import Counter </line-4>
<line-5></line-5>
<line-6>def getpar(Edge, p):</line-6>
<line-7> N = len(Edge)</line-7>
<line-8> par = [0]*N</line-8>
<line-9> par[0] = -1</line-9>
<line-10> par[p] -1</line-10>
<line-11> stack = [p]</line-11... | {"code": "<line-2>readline = sys.stdin.readline</line-2>\n<line-80>ans = max(ans, We[0] + res + max(candi[0]))</line-80>", "lines": [2, 80]}
#### 0 |
<line-1>n=int(input())</line-1>
<line-3>if n==1:</line-3>
<line-4> print(1,1)</line-4>
<line-5> print(0)</line-5>
<line-6> print(1,1)</line-6>
<line-7> print(0)</line-7>
<line-8> print(1,1)</line-8>
<line-9> print(-L[0])</line-9>
<line-10>else:</line-10>
<line-11> print(1,n-1)</line-11>
<line-12> ... | {"code": "<line-2>L=list(map(int,input().split()))</line-2>\n<line-17> for i in range(n-1):print(-L[i]*n,end=' ')</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>#!/usr/bin/env pypy3</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>def make_nCr_mod(max_n=2*10**5 + 100, mod=10**9 + 7):</line-5>
<line-6> fact, inv_fact = [0] * (max_n + 1), [0] * (max_n + 1)</line-6>
<line-7> fact[0] = 1</line-7>
<line-8> for i in range(max_n):</line-8>
<line-9> fact[i ... | {"code": "<line-3>import math</line-3>\n<line-70> ret = ret % MODULUS</line-70>", "lines": [3, 70]}
#### 0 |
<line-1>from collections import Counter</line-1>
<line-3>points = Counter([tuple(map(int, input().split(' '))) for i in range(n)])</line-3>
<line-4></line-4>
<line-5>x, y = Counter([k for k, v in points.elements()]), Counter([v for k, v in points.elements()])</line-5>
<line-6></line-6>
<line-8>print(ans)</line-8> | {"code": "<line-2>n = int(input())</line-2>\n<line-7>ans = sum([v*(v-1)//2 for k, v in list(x.items())])+sum([v*(v-1)//2 for k, v in list(y.items())])-sum([v*(v-1)//2 for k, v in list(points.items())])</line-7>", "lines": [2, 7]}
#### 0 |
<line-1>from sys import*</line-1>
<line-3>def check(u, d, l, r):</line-3>
<line-4> used = [pointsx[i][1] for i in range(l)]</line-4>
<line-5> used += [pointsx[-1 - i][1] for i in range(r)]</line-5>
<line-6> used += [pointsy[i][1] for i in range(u)]</line-6>
<line-7> used += [pointsy[-1 - i][1] for i in rang... | {"code": "<line-2>#</line-2>\n<line-34>print(ans // 4)</line-34>", "lines": [2, 34]}
#### 0 |
<line-1>def maximum_xor_secondary(sequence):</line-1>
<line-3> for x in sequence:</line-3>
<line-4> while stack:</line-4>
<line-5> answer = max(answer, stack[-1] ^ x)</line-5>
<line-6> if stack[-1] > x:</line-6>
<line-7> break</line-7>
<line-8> else:</line-8>
<l... | {"code": "<line-2> stack, answer = [], 0</line-2>\n<line-18>print(maximum_xor_secondary(num))</line-18>", "lines": [2, 18]}
#### 0 |
<line-1>INF = 10 ** 18 + 179</line-1>
<line-3>a.sort()</line-3>
<line-4>dp, l = [[0] * (k - n % k + 1) for x in range(n % k + 1)], n // k</line-4>
<line-5>for i in range(n % k + 1):</line-5>
<line-6> for j in range(k - n % k + 1):</line-6>
<line-7> pos = i * (l + 1) + j * l</line-7>
<line-8> dp[i][j] =... | {"code": "<line-2>[n, k], a = [list(map(int, input().split())) for x in range(2)]</line-2>\n<line-9> (dp[i][j - 1] + a[pos - 1] - a[pos - l] if j else INF)) if (i or j) else 0</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>rd = lambda: list(map(int, input().split()))</line-1>
<line-2></line-2>
<line-4>a = sorted(rd(), reverse=True)</line-4>
<line-5>b = sorted(rd(), reverse=True)</line-5>
<line-6>if len(a) > len(b): print("YES"); return</line-6>
<line-7>for i in range(len(a)):</line-7>
<line-9>print("NO")</line-9> | {"code": "<line-3>rd()</line-3>\n<line-8> if a[i] > b[i]: print(\"YES\"); return</line-8>", "lines": [3, 8]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3></line-3>
<line-4>def d(a, b):</line-4>
<line-5> return (a[0]-b[0], a[1]-b[1], a[2]-b[2], a[3]-b[3], a[4]-b[4])</line-5>
<line-6></line-6>
<line-7>def m(a, b):</line-7>
<line-8> t = 0</line-8>
<line-9> for i in range(5):</line-9>
<line-10> t += a[i] * b[i]</line... | {"code": "<line-2>p = [tuple(map(int, input().split())) for i in range(n)]</line-2>\n<line-40>for i in good_points:</line-40>", "lines": [2, 40]}
#### 0 |
<line-1>from collections import defaultdict</line-1>
<line-2></line-2>
<line-4> group = [None] * n</line-4>
<line-5> id_ = {x: i for i, x in enumerate(xs)}</line-5>
<line-6> if a == b:</line-6>
<line-7> for x in xs:</line-7>
<line-8> if a - x not in id_:</line-8>
<line-9> retur... | {"code": "<line-3>def solve(n, a, b, xs):</line-3>\n<line-54>else:</line-54>", "lines": [3, 54]}
#### 0 |
<line-1>def main():</line-1>
<line-3> a = list(map(int, (x for x in input())))</line-3>
<line-4> b = list(map(int, (x for x in input())))</line-4>
<line-5> x = [0] * (n - 1)</line-5>
<line-6> x[0] = b[0] - a[0]</line-6>
<line-7> for i in range(1, n - 1):</line-7>
<line-8> x[i] = b[i] - a[i] - x[i ... | {"code": "<line-2> n = int(input())</line-2>\n<line-67> main()</line-67>", "lines": [2, 67]}
#### 0 |
<line-1>q = int(input())</line-1>
<line-2></line-2>
<line-3></line-3>
<line-4></line-4>
<line-6> res = set()</line-6>
<line-7></line-7>
<line-8> while u >= 1:</line-8>
<line-9> res.add(u)</line-9>
<line-10> u //= 2</line-10>
<line-11></line-11>
<line-12> return res</line-12>
<line-13></line-13>
<... | {"code": "<line-5>def full_way(u):</line-5>\n<line-45> res += d[x]</line-45>", "lines": [5, 45]}
#### 0 |
<line-1>import sys</line-1>
<line-2></line-2>
<line-4>discount_values = [int(x) for x in sys.stdin.readline().split()]</line-4>
<line-5>n_items = int(sys.stdin.readline())</line-5>
<line-6>item_values = [int(x) for x in sys.stdin.readline().split()]</line-6>
<line-7></line-7>
<line-8>min_discount_req = 10000000</line-8... | {"code": "<line-3>n_discounts = int(sys.stdin.readline())</line-3>\n<line-19> index += n_left + 2</line-19>", "lines": [3, 19]}
#### 0 |
<line-1>from math import pi</line-1>
<line-3>def fft(a, lgN, rot=1): # rot=-1 for ifft</line-3>
<line-4> N = 1<<lgN</line-4>
<line-5> assert len(a)==N</line-5>
<line-6> rev = [0]*N</line-6>
<line-7> for i in range(N):</line-7>
<line-8> rev[i] = (rev[i>>1]>>1)+(i&1)*(N>>1)</line-8>
<line-9> A = [a[rev[i]] for i ... | {"code": "<line-2>from cmath import exp</line-2>\n<line-44>c[0] = sum((x*(x-1))//2 for x in a)</line-44>", "lines": [2, 44]}
#### 0 |
<line-1>MOD = 998244353</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>a = list(map(int, input().split()))</line-5>
<line-6>tot = sum(a)</line-6>
<line-7></line-7>
<line-8>def inv(x):</line-8>
<line-9> return pow(x, MOD - 2, MOD)</line-9>
<line-10></line-10>
<line-11>l = [0, pow(n, tot, MOD) - 1]</line-11>
<li... | {"code": "<line-3>n = int(input())</line-3>\n<line-30>out *= inv(n)</line-30>", "lines": [3, 30]}
#### 0 |
<line-1>n, m = map(int, input().split())</line-1>
<line-3>extra = [0 for _ in range(n)]</line-3>
<line-4>query = list()</line-4>
<line-5>for _ in range(m):</line-5>
<line-6> t, l, r, x = map(int, input().split())</line-6>
<line-7> l -= 1</line-7>
<line-8> r -= 1</line-8>
<line-9> query.append((t, l, r, ... | {"code": "<line-2>a = [10**9 for _ in range(n)]</line-2>\n<line-30>for x in extra:</line-30>", "lines": [2, 30]}
#### 0 |
<line-1>import heapq</line-1>
<line-2></line-2>
<line-4> x, y = coor</line-4>
<line-5> for dx in dxs:</line-5>
<line-6> for dy in dys:</line-6>
<line-7> yield x + dx, y + dy</line-7>
<line-8></line-8>
<line-9></line-9>
<line-10>def coor_bottoms(coor):</line-10>
<line-11> return coor_neighbor(... | {"code": "<line-3>def coor_neighbor(coor, dxs, dys):</line-3>\n<line-134> result = result_add(result, N, figure.drop_min())</line-134>", "lines": [3, 134]}
#### 0 |
<line-1>from sys import stdin, stdout</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>def findAllStrings(s):</line-5>
<line-6> n = len(s)</line-6>
<line-7> sDict = {}</line-7>
<line-8> for i in range(1,K+1):</line-8>
<line-9> sDict[i]=set()</line-9>
<line-10> for x in range(n-i+1):</line-10>... | {"code": "<line-3>K = 20</line-3>\n<line-61> else:</line-61>", "lines": [3, 61]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4></line-4>
<line-5>from collections import deque</line-5>
<line-6>N, Q = list(map(int, input().split()))</line-6>
<line-7>que = deque([int(a) for a in input().split()])</line-7>
<line-8>ma = max(que)</line-8>
<line-9></line-9>
<line-10>X = []</line-10>
<line-11>k = -... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-31> i = (i-k)%(N-1)+k</line-31>", "lines": [2, 31]}
#### 0 |
<line-1>3</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>n, l, r, ql, qr = list(map(int, sys.stdin.readline().strip().split()))</line-5>
<line-6>w = [int(x) for x in sys.stdin.readline().strip().split()]</line-6>
<line-7></line-7>
<line-8>s = [0]</line-8>
<line-9>for i in range(0, n):</line-9>
<line-10> s.appe... | {"code": "<line-3>import sys</line-3>\n<line-26> best = c</line-26>", "lines": [3, 26]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3></line-3>
<line-4>dp = [[0]*n for _ in range(n)]</line-4>
<line-5>for i in range(n) :</line-5>
<line-6> dp[i][i] = 1</line-6>
<line-7></line-7>
<line-8>for i in range(n-2, -1, -1) :</line-8>
<line-9> for j in range(i+1, n) :</line-9>
<line-10> dp[i][j] = 1 + dp[i+1... | {"code": "<line-2>C = list(map(int, input().split()))</line-2>\n<line-15> dp[i][j] = min( dp[i][j], dp[i+1][j-1] )</line-15>", "lines": [2, 15]}
#### 0 |
<line-1>from operator import __or__, __and__, __xor__</line-1>
<line-3>n, b, c = int(stdin.readline()), 0, 1023</line-3>
<line-4>m = {'|': __or__, '&': __and__, '^': __xor__}</line-4>
<line-5>for i in range(n):</line-5>
<line-6> t, v = [i for i in stdin.readline().split()]</line-6>
<line-7> b = m[t](b, int(v))</l... | {"code": "<line-2>from sys import stdin, stdout</line-2>\n<line-16> x |= 1 << i</line-16>", "lines": [2, 16]}
#### 0 |
<line-1>from itertools import combinations_with_replacement </line-1>
<line-3></line-3>
<line-4>#sys.stdin = open("input_py.txt","r")</line-4>
<line-5></line-5>
<line-6>n, m = map(int, input().split())</line-6>
<line-7>G = [ [] for i in range(n)]</line-7>
<line-8></line-8>
<line-9>for i in range(m):</line-9>
<line-10> ... | {"code": "<line-2>from collections import deque</line-2>\n<line-45> rest = min(rest, Dist[i][j] + Dist[j][t1] + Dist[j][s2] + Dist[i][s1] + Dist[i][t2])</line-45>", "lines": [2, 45]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>s = input()</line-4>
<line-5></line-5>
<line-6>M = int(input())</line-6>
<line-7></line-7>
<line-8></line-8>
<line-9>def next_pow_2(n):</line-9>
<line-10> p = 1</line-10>
<line-11> while p < n:</line-11>
<line-12> p <<= 1</line-12>
<line-13> return p... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-78> l, r = [int(_) for _ in input().split()]</line-78>", "lines": [2, 78]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3> print("contest")</line-3>
<line-5> print("home")</line-5> | {"code": "<line-2>if n % 2:</line-2>\n<line-4>else:</line-4>", "lines": [2, 4]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3></line-3>
<line-4></line-4>
<line-5>a = list(map(int, input().split()))</line-5>
<line-6>ss = []</line-6>
<line-7>ms = []</line-7>
<line-8>for i in range(n):</line-8>
<line-9> k = a[i]</line-9>
<line-10> ind = bisect_left(ms, -k)</line-10>
<line-11> if ind == len(ms):<... | {"code": "<line-2>from bisect import bisect_left</line-2>\n<line-17>for s in ss:</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>def main():</line-1>
<line-3> input = sys.stdin.readline</line-3>
<line-4> </line-4>
<line-5> n = int(input())</line-5>
<line-6> arr = input()</line-6>
<line-7> </line-7>
<line-8> one = arr.count('n')</line-8>
<line-9> zero = arr.count('z')</line-9>
<line-10> </line-10>
<line-11> ans ... | {"code": "<line-2> import sys</line-2>\n<line-15> return 0</line-15>", "lines": [2, 15]}
#### 0 |
<line-1>input()</line-1>
<line-3>root=-1</line-3>
<line-4>for i,a in enumerate(A) :</line-4>
<line-5> if i == a-1 :</line-5>
<line-6> root = i</line-6>
<line-7> break</line-7>
<line-8>v = [False]*len(A)</line-8>
<line-9>if root>-1 :</line-9>
<line-10> v[root]=True</line-10>
<line-11>ans= 0</line-11>... | {"code": "<line-2>A = list(map(int, input().split(' ')))</line-2>\n<line-30>print(ans)</line-30>", "lines": [2, 30]}
#### 0 |
<line-1></line-1>
<line-2>import sys</line-2>
<line-4>input=sys.stdin.readline</line-4>
<line-5></line-5>
<line-6>n=int(input())</line-6>
<line-7>b=list(map(int,input().split()))</line-7>
<line-8>bb=sorted(b)</line-8>
<line-9>c={bb[i]:i for i in range(n)}</line-9>
<line-10>a=[c[b[i]] for i in range(n)]</line-10>
<line-... | {"code": "<line-3>#sys.stdin=open(\"data.txt\")</line-3>\n<line-24>for i in out:</line-24>", "lines": [3, 24]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>edges = sorted(edges)</line-3>
<line-4>use_count = [0]+[int(input()) for i in range(n)]</line-4>
<line-5>lo,hi = 0,10000</line-5>
<line-6>def getpar(par,u):</line-6>
<line-7> if par[par[u]] == par[u]:</line-7>
<line-8> return par[u]</line-8>
<line-9> par[u] = getpa... | {"code": "<line-2>edges = [[int(x) for x in input().split()] for i in range(n-1)]</line-2>\n<line-36> hi = mid-1</line-36>", "lines": [2, 36]}
#### 0 |
<line-1></line-1>
<line-2>import sys</line-2>
<line-4>input=sys.stdin.readline</line-4>
<line-5></line-5>
<line-6>n,m=list(map(int,input().split()))</line-6>
<line-7></line-7>
<line-8>party=[[] for _ in range(m+5)]</line-8>
<line-9>pc=sorted([list(map(int,input().split())) for _ in range(n)],key=lambda x:x[1])</line-9>... | {"code": "<line-3>#sys.stdin=open(\"data.txt\")</line-3>\n<line-38> choose=[0]*n</line-38>", "lines": [3, 38]}
#### 0 |
<line-1>3</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>def __starting_point():</line-5>
<line-6> </line-6>
<line-7> n, k = list(map(int, sys.stdin.readline().split()))</line-7>
<line-8> l = []</line-8>
<line-9> i = 1</line-9>
<line-10> j = k + 1</line-10>
<line-11> while i <= j:</line-11>
<lin... | {"code": "<line-3>import sys</line-3>\n<line-20> print(' '.join(l))</line-20>", "lines": [3, 20]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3></line-3>
<line-4>stack = []</line-4>
<line-5>for v in l:</line-5>
<line-6> currVal = v</line-6>
<line-7> currSize = 1</line-7>
<line-8> div = v</line-8>
<line-9> </line-9>
<line-10> while stack:</line-10>
<line-11> nex, nexS, nDiv = stack[-1]</line-11>
<l... | {"code": "<line-2>l = list(map(int, input().split()))</line-2>\n<line-27> out.append(thingy)</line-27>", "lines": [2, 27]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>N, M = list(map(int, input().split()))</line-4>
<line-5>D = [{} for _ in range(N)]</line-5>
<line-6>for _ in range(M):</line-6>
<line-7> a, b = list(map(int, input().split()))</line-7>
<line-8> a -= 1</line-8>
<line-9> b -= 1</line-9>
<line-10> D[a][b] =... | {"code": "<line-2>input = lambda: sys.stdin.readline().rstrip()</line-2>\n<line-41> j = R[j]</line-41>", "lines": [2, 41]}
#### 0 |
<line-1>k = int(input())</line-1>
<line-3>g = lambda n: n * (n * n - 1) // 6</line-3>
<line-4>i = n = 0</line-4>
<line-5>while g(n + 1) <= k: n += 1</line-5>
<line-6>while i < n + 1:</line-6>
<line-7> for j in range(i): p[i][j] = p[j][i] = '1'</line-7>
<line-8> i += 1</line-8>
<line-9>k -= g(n)</line-9>
<line-10>... | {"code": "<line-2>p = [['0'] * 100 for j in range(100)]</line-2>\n<line-17>print(i)</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>#!/usr/bin/env python</line-1>
<line-3>#</line-3>
<line-4># Copyright (C) 2015 Sergey</line-4>
<line-5># Licensed under the Apache License, Version 2.0 (the "License");</line-5>
<line-6># you may not use this file except in compliance with the License.</line-6>
<line-7># You may obtain a copy of the License at<... | {"code": "<line-2># 556D_fug.py - Codeforces.com 556D Fug quiz</line-2>\n<line-221> print(calculate())</line-221>", "lines": [2, 221]}
#### 0 |
<line-1># </line-1>
<line-3>from functools import cmp_to_key</line-3>
<line-4>#key=cmp_to_key(lambda x,y: 1 if x not in y else -1 )</line-4>
<line-5></line-5>
<line-6>sys.setrecursionlimit(1000000)</line-6>
<line-7>def getIntList():</line-7>
<line-8> return list(map(int, input().split())) </line-8>
<line-9><... | {"code": "<line-2>import collections, atexit, math, sys</line-2>\n<line-56> result = min(result, nd*dif)</line-56>", "lines": [2, 56]}
#### 0 |
<line-1>3</line-1>
<line-3>a = [True] * (n + 2)</line-3>
<line-4>for i in range(2, n + 2):</line-4>
<line-5> if not a[i]:</line-5>
<line-6> continue</line-6>
<line-7> j = i * i</line-7>
<line-8> while j < n + 2:</line-8>
<line-9> a[j] = False</line-9>
<line-10> j += i</line-10>
<line-11>i... | {"code": "<line-2>n = int(input())</line-2>\n<line-14> print(2)</line-14>", "lines": [2, 14]}
#### 0 |
<line-1>p, n = [], int(input())</line-1>
<line-3>for i in range(n):</line-3>
<line-4> t = list(map(int, input().split()))</line-4>
<line-5> k = t[0] // 2 + 1</line-5>
<line-6> a += sum(t[1: k])</line-6>
<line-7> if t[0] & 1:</line-7>
<line-8> p.append(t[k])</line-8>
<line-9> b += sum(t[k + 1: ... | {"code": "<line-2>a = b = 0</line-2>\n<line-11>p.sort(reverse = True)</line-11>", "lines": [2, 11]}
#### 0 |
<line-1></line-1>
<line-2>def main():</line-2>
<line-4> l = len(s)</line-4>
<line-5> </line-5>
<line-6> pretty_count = 0</line-6>
<line-7> for i in range(l):</line-7>
<line-8> left_paren_count = 0</line-8>
<line-9> right_paren_count = 0</line-9>
<line-10> wild_count = 0</line-10>
<line-... | {"code": "<line-3> s = input()</line-3>\n<line-33> main()</line-33>", "lines": [3, 33]}
#### 0 |
<line-1>import sys</line-1>
<line-2></line-2>
<line-4>n = int(input())</line-4>
<line-5></line-5>
<line-6>for _ in range(n):</line-6>
<line-7> print(s1, s2)</line-7>
<line-8> killed, new = input().split()</line-8>
<line-9> if s1 == killed:</line-9>
<line-10> s1 = new</line-10>
<line-11> else:</line-1... | {"code": "<line-3>s1, s2 = input().split()</line-3>\n<line-12> s2 = new</line-12>", "lines": [3, 12]}
#### 0 |
<line-1>def i1():</line-1>
<line-3>def i2():</line-3>
<line-4> return [int(i) for i in input().split()]</line-4>
<line-5>q=i1()</line-5>
<line-6>import math</line-6>
<line-7>y=[]</line-7>
<line-8>for i in range(q):</line-8>
<line-9> y.append(i2())</line-9>
<line-10></line-10>
<line-11>for a,b in y:</line-11>
<line-12> ... | {"code": "<line-2> return int(input())</line-2>\n<line-24> z-=1</line-24>", "lines": [2, 24]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>l = [0] * (10**6 + 100)</line-3>
<line-4>for x in a:</line-4>
<line-5> l[x] += 1</line-5>
<line-6>cur = 0</line-6>
<line-7>ans = 0</line-7>
<line-8>for x in l:</line-8>
<line-9> cur += x</line-9>
<line-10> if cur % 2:</line-10>
<line-11> ans += 1</line-11>
<line-13>print(ans)<... | {"code": "<line-2>a = [int(x) for x in input().split()]</line-2>\n<line-12>\tcur //= 2</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>import itertools</line-1>
<line-3></line-3>
<line-4>n, A, cf, cm, m = [int(x) for x in input().split()]</line-4>
<line-5>skills = [int(x) for x in input().split()]</line-5>
<line-6>sorted_skills = list(sorted((k, i) for i, k in enumerate(skills)))</line-6>
<line-7>bottom_lift = [0 for i in range(n)]</line-7>
<l... | {"code": "<line-2>import bisect</line-2>\n<line-38>for a in ans:</line-38>", "lines": [2, 38]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3></line-3>
<line-4>inv = 0</line-4>
<line-5>out = 0</line-5>
<line-6>mult = 1</line-6>
<line-7>for i in range(32):</line-7>
<line-8> curr = dict()</line-8>
<line-9> opp = 0</line-9>
<line-10> same = 0</line-10>
<line-11></line-11>
<line-12> for v in l:</line-12>
<lin... | {"code": "<line-2>l = list(map(int, input().split()))</line-2>\n<line-31> mult *= 2</line-31>", "lines": [2, 31]}
#### 0 |
<line-1>3</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>class CumTree:</line-5>
<line-6> </line-6>
<line-7> def __init__(self, a, b):</line-7>
<line-8> self.a = a</line-8>
<line-9> self.b = b</line-9>
<line-10> self.count = 0</line-10>
<line-11> if a == b:</line-11>
<line-12> ... | {"code": "<line-3>import sys</line-3>\n<line-43>k, d = vsota // 2, vsota % 2</line-43>", "lines": [3, 43]}
#### 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 254 Div 1 Problem A</line-2>\n<line-32> best = max(best, temp)</line-32>", "lines": [2, 32]}
#### 0 |
<line-1>def Search(L,aa,x):</line-1>
<line-3> b=len(L)</line-3>
<line-4> while(b-a>1):</line-4>
<line-5> i=(b+a)//2</line-5>
<line-6> if(L[i]>x):</line-6>
<line-7> b=i</line-7>
<line-8> elif(L[i]<x):</line-8>
<line-9> a=i</line-9>
<line-10> else:</line-10>
<line-1... | {"code": "<line-2> a=aa</line-2>\n<line-23> ans+=((x)*(x-1))//2</line-23>", "lines": [2, 23]}
#### 0 |
<line-1>m = int(input())</line-1>
<line-3></line-3>
<line-4>sa = [0] * len(s)</line-4>
<line-5>for i in range(len(s)):</line-5>
<line-6> sa[i] = ord(s[i]) - ord('a')</line-6>
<line-7></line-7>
<line-8>sa = [-1] + sa + [-1]</line-8>
<line-9></line-9>
<line-10>def check_value(sa, m, threshold):</line-10>
<line-11> prev_i... | {"code": "<line-2>s = input().strip()</line-2>\n<line-45>s = ''.join(sorted([chr(ord('a') + sa[x]) for x in seq]))</line-45>", "lines": [2, 45]}
#### 0 |
<line-1>def read_data():</line-1>
<line-3> hs = list(map(int, input().split()))</line-3>
<line-4> return n, hs</line-4>
<line-5></line-5>
<line-6></line-6>
<line-7>def solve(n, hs):</line-7>
<line-8> left = get_left_index(n, hs)</line-8>
<line-9> right = get_right_index(n, hs)</line-9>
<line-10> vals = [... | {"code": "<line-2> n = int(input())</line-2>\n<line-44>n, hs = read_data()</line-44>", "lines": [2, 44]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>b = [0 for i in range(n)]</line-3>
<line-4>s = 0</line-4>
<line-5>for i in range(n):</line-5>
<line-6> j = int((arr[i] << 1) ** 0.5)</line-6>
<line-7> if j * (j + 1) > (arr[i] << 1):</line-7>
<line-8> j -= 1</line-8>
<line-9> s ^= j</line-9>
<line-10>if s != 0:<... | {"code": "<line-2>arr = [int(input()) for i in range(n)]</line-2>\n<line-12>else:</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>__author__ = 'Think'</line-1>
<line-3>aints=[int(i) for i in input().split()]</line-3>
<line-4>permutes=[int(i)-1 for i in input().split()]</line-4>
<line-5>results=[0]</line-5>
<line-6></line-6>
<line-7>rebuilt={}</line-7>
<line-8>m=0</line-8>
<line-9>for numby in range(n-1, 0, -1):</line-9>
<line-10> p=permut... | {"code": "<line-2>n=int(input())</line-2>\n<line-37>for numby in range(n-1, -1, -1):</line-37>", "lines": [2, 37]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>s, l = 0, 1</line-3>
<line-4>p = [0] * n</line-4>
<line-5>for i in range(n):</line-5>
<line-6> t = list(map(int, input().split()))</line-6>
<line-7> if t[0] == 1:</line-7>
<line-8> b[t[1] - 1] += t[2]</line-8>
<line-9> s += t[1] * t[2]</line-9>
<line-10> ... | {"code": "<line-2>a, b = [0] * (n + 2), [0] * (n + 2)</line-2>\n<line-19> p[i] = str(s / l)</line-19>", "lines": [2, 19]}
#### 0 |
<line-1># -*- coding: utf-8 -*-</line-1>
<line-3>from sys import stdin</line-3>
<line-4></line-4>
<line-5>def run(n, s):</line-5>
<line-6> m = 0</line-6>
<line-7> small = n // 2</line-7>
<line-8> for big in range(n-1, (n+1)//2-1, -1):</line-8>
<line-9> while small >= 0 and s[small] > s[big] / 2:</line-9... | {"code": "<line-2>from time import perf_counter</line-2>\n<line-30>s = sorted([int(x) for x in stdin.read().strip().split('\\n')])</line-30>", "lines": [2, 30]}
#### 0 |
<line-1>from bisect import bisect_left, insort_left</line-1>
<line-3>n = int(input())</line-3>
<line-4>for _ in range(n):</line-4>
<line-5> #print(a)</line-5>
<line-6> s, d = list(map(int, input().split()))</line-6>
<line-7> if len(a) == 0:</line-7>
<line-8> print(s, s+d - 1)</line-8>
<line-9> a.... | {"code": "<line-2>a = []</line-2>\n<line-37> print(a[-1][1] + 1, a[-1][1] + d)</line-37>", "lines": [2, 37]}
#### 0 |
<line-1>def evens(A):</line-1>
<line-3> l = n//2-1; r = n//2</line-3>
<line-4> if len(A)%2 == 1: l+= 1</line-4>
<line-5> ans = [max(A[l], A[r])]</line-5>
<line-6> while r < n-1:</line-6>
<line-7> l-= 1; r+= 1</line-7>
<line-8> ans.append(max(ans[-1], A[l], A[r]))</line-8>
<line-9> return an... | {"code": "<line-2> n = len(A)</line-2>\n<line-22>if n%2 == 0: print(*interleave(ansA, ansM[1:]), max(A))</line-22>", "lines": [2, 22]}
#### 0 |
<line-1>from collections import defaultdict, deque</line-1>
<line-2> </line-2>
<line-4>def bfs(graph, inicio, destino, parent):</line-4>
<line-5> parent.clear()</line-5>
<line-6> queue = deque()</line-6>
<line-7> queue.append([inicio, float("Inf")])</line-7>
<line-8> parent[inicio] = -2</line-8>
<line-9> ... | {"code": "<line-3>adj = defaultdict(lambda: defaultdict(lambda: 0))</line-3>\n<line-66> hi = mid</line-66>", "lines": [3, 66]}
#### 0 |
<line-1># http://codeforces.com/problemset/problem/848/B</line-1>
<line-3></line-3>
<line-4></line-4>
<line-5>def get_dest(start, w, h):</line-5>
<line-6> if start[0] == 1:</line-6>
<line-7> return (str(start[1]), str(h))</line-7>
<line-8> else:</line-8>
<line-9> return (str(w), str(start[1]))</line... | {"code": "<line-2>from collections import defaultdict</line-2>\n<line-37>for dd in destinations:</line-37>", "lines": [2, 37]}
#### 0 |
<line-1></line-1>
<line-2>def Sieve(n): </line-2>
<line-4> divlis = [-1] * (n+1) </line-4>
<line-5> </line-5>
<line-6> flag = [True] * (n+1)</line-6>
<line-7> flag[0] = False</line-7>
<line-8> flag[1] = False</line-8>
<line-9></line-9>
<line-10> ind = 2</line-10>
<line-11> while ind <= n:</line-11>... | {"code": "<line-3> ret = []</line-3>\n<line-74> #print (i,\"c\")</line-74>", "lines": [3, 74]}
#### 0 |
<line-1>class DisjointSet(object):</line-1>
<line-3> self.parent = list(range(n))</line-3>
<line-4> self.rank = [0] * n</line-4>
<line-5> self.num = n # number of disjoint sets</line-5>
<line-6></line-6>
<line-7> def union(self, x, y):</line-7>
<line-8> self._link(self.find_set(x), self.... | {"code": "<line-2> def __init__(self, n):</line-2>\n<line-49> return pow(2, (ds.num // 2) - 1, 10**9 + 7)</line-49>", "lines": [2, 49]}
#### 0 |
<line-1>__author__ = 'Pavel Mavrin'</line-1>
<line-2></line-2>
<line-4>a = [int(x) for x in input().split()]</line-4>
<line-5></line-5>
<line-6>s = 0</line-6>
<line-7>res = 0</line-7>
<line-8>for i in a:</line-8>
<line-9> if i == 0:</line-9>
<line-10> res += s</line-10>
<line-11> else:</line-11>
<line-13><... | {"code": "<line-3>n = int(input())</line-3>\n<line-12> s += 1</line-12>", "lines": [3, 12]}
#### 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>n,m=mii()</line-7>
<line-8>a=[0 for _ in range(n)]</line-8>
<line-9>c=[123456 for _ in range(n)]</line-9>
<line-10>for _ in range(m):</line-10>
<li... | {"code": "<line-3>#sys.stdin=open(\"data.txt\")</line-3>\n<line-31> ans.append(out)</line-31>", "lines": [3, 31]}
#### 0 |
<line-1>3</line-1>
<line-2></line-2>
<line-4>from functools import lru_cache</line-4>
<line-5></line-5>
<line-6>MOD = 1000000007</line-6>
<line-7></line-7>
<line-8>cnk = [[1 for i in range(1001)] for j in range(1001)]</line-8>
<line-9>for i in range(1, 1001):</line-9>
<line-10> for j in range(1, i):</line-10>
<line-... | {"code": "<line-3>import sys</line-3>\n<line-21> ans = (ans * cnk[sm - 1][c - 1]) % MOD</line-21>", "lines": [3, 21]}
#### 0 |
<line-2>n = int(input())</line-2>
<line-3>a = list(map(int, input().split()))</line-3>
<line-4>print(pow(2,n-1,m)-1 - sum(pow(2,a.count(x),m)-1 for x in set(a) if x != -1) % m)</line-4> | {"code": "<line-1>m = 1000000007</line-1>", "lines": [1]}
#### 0 |
<line-1>import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools</line-1>
<line-2></line-2>
<line-4>inf = 10**20</line-4>
<line-5>eps = 1.0 / 10**10</line-5>
<line-6>mod = 998244353</line-6>
<line-7>dd = [(-1,0),(0,1),(1,0),(0,-1)]</line-7>
<line-8>ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,... | {"code": "<line-3>sys.setrecursionlimit(10**7)</line-3>\n<line-79> return r</line-79>", "lines": [3, 79]}
#### 0 |
<line-1>strings = int(input())</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>for k in range(strings):</line-5>
<line-6> s = input()</line-6>
<line-7> for index in range(7):</line-7>
<line-8> if s[index] == '1':</line-8>
<line-10></line-10>
<line-11>print(max(count))</line-11> | {"code": "<line-3>count = [0 for x in range(7)]</line-3>\n<line-9> count[index] += 1</line-9>", "lines": [3, 9]}
#### 0 |
<line-1>from collections import defaultdict, deque</line-1>
<line-2></line-2>
<line-4>adj = [[] for _ in range(n)]</line-4>
<line-5>v = [0] * n</line-5>
<line-6>l = list(map(int, input().split()))</line-6>
<line-7>for i, f in enumerate(l):</line-7>
<line-8> adj[f - 1].append(i + 1)</line-8>
<line-9></line-9>
<line-1... | {"code": "<line-3>n = int(input())</line-3>\n<line-35> Q.append((i, s[i] - curs, s[i]))</line-35>", "lines": [3, 35]}
#### 0 |
<line-1>from time import time</line-1>
<line-2></line-2>
<line-3></line-3>
<line-5> 'N': 'S',</line-5>
<line-6> 'S': 'N',</line-6>
<line-7> 'E': 'W',</line-7>
<line-8> 'W': 'E'</line-8>
<line-9>}</line-9>
<line-10>otr = str.maketrans(opposite)</line-10>
<line-11></line-11>
<line-12>bits = {</line-12>
<line-... | {"code": "<line-4>opposite = {</line-4>\n<line-53> print('YES' if solvable(p1, p2) else 'NO')</line-53>", "lines": [4, 53]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>N = int(readline())</line-4>
<line-5>A = list(map(int, readline().split()))</line-5>
<line-6>BW = [0, 0]</line-6>
<line-7>for i in range(N):</line-7>
<line-8> a = A[i]</line-8>
<line-9> BW[i%2] += a//2</line-9>
<line-11>print(min(BW))</line-11> | {"code": "<line-2>readline = sys.stdin.readline</line-2>\n<line-10> BW[(i+1)%2] += -(-a//2)</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>n, k = map(int, input().split())</line-1>
<line-3>y = x = min(t)</line-3>
<line-4>t = list(t)</line-4>
<line-5>while True:</line-5>
<line-6> for i in t:</line-6>
<line-7> if i % x > k: x = i // (i // x + 1)</line-7>
<line-8> if y == x: break</line-8>
<line-10>print(y)</line-10> | {"code": "<line-2>t = set(map(int, input().split()))</line-2>\n<line-9> y = x</line-9>", "lines": [2, 9]}
#### 0 |
{"code": "<line-1>print('YES' if input().count('1')+1>>1<<1 >= input().count('1') else 'NO')</line-1>", "lines": [1]}
#### 0 | |
<line-1></line-1>
<line-2>import sys</line-2>
<line-4></line-4>
<line-5>def modfac(n, MOD):</line-5>
<line-6> </line-6>
<line-7> f = 1</line-7>
<line-8> factorials = [1]</line-8>
<line-9> for m in range(1, n + 1):</line-9>
<line-10> f *= m</line-10>
<line-11> f %= MOD</line-11>
<line-12> f... | {"code": "<line-3>from sys import stdin</line-3>\n<line-31>fac,inv = modfac(2*n+10,mod)</line-31>", "lines": [3, 31]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>m, M = min(b), max(b)</line-5>
<line-6>if m == M:</line-6>
<line-7> if M == 0:</line-7>
<line-8> print('YES')</line-8>
<line-9> print(' '.join(['1' for i in range(n)]))</line-9>
<line-10> else:</line-10>
<line-11> p... | {"code": "<line-3>b = list(map(int, input().split()))</line-3>\n<line-23> a[pos - i] = a[pos - i + 1] + b[pos - i]</line-23>", "lines": [3, 23]}
#### 0 |
<line-1>import sys</line-1>
<line-3>def parorder(Edge, p):</line-3>
<line-4> N = len(Edge)</line-4>
<line-5> par = [0]*N</line-5>
<line-6> par[p] = -1</line-6>
<line-7> stack = [p]</line-7>
<line-8> order = []</line-8>
<line-9> visited = set([p])</line-9>
<line-10> ast = stack.append</line-10>
<lin... | {"code": "<line-2>readline = sys.stdin.readline </line-2>\n<line-66> Ans[dp2[root][i]] = i+1</line-66>", "lines": [2, 66]}
#### 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>ans = [0]*n</line-5>
<line-6>for i in range(n):</line-6>
<line-7> for j in range(n):</line-7>
<line-8> if j!=i:</line-8>
<line-10> print(ans[i],end = ' ')</line-10> | {"code": "<line-2>a=[]</line-2>\n<line-9> ans[i] |= a[i][j]</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>from bisect import *</line-1>
<line-2></line-2>
<line-4>fc = []</line-4>
<line-5>fd = []</line-5>
<line-6>mbc = 0</line-6>
<line-7>mbd = 0</line-7>
<line-8>for _ in range(n):</line-8>
<line-9> b, p, ft = input().split()</line-9>
<line-10> b, p = int(b), int(p)</line-10>
<line-11> f = (p, b)</line-11>
<... | {"code": "<line-3>n, tc, td = [int(i) for i in input().split()]</line-3>\n<line-42>ans = max(ans, pick2(fd, td))</line-42>", "lines": [3, 42]}
#### 0 |
<line-1></line-1>
<line-2>def main():</line-2>
<line-4> n = []</line-4>
<line-5> a = []</line-5>
<line-6> for i in range(k):</line-6>
<line-7> line = [int(x) for x in input().split()]</line-7>
<line-8> ni = line[0]</line-8>
<line-9> ai = []</line-9>
<line-10> n.append(ni)</line-10>
... | {"code": "<line-3> k = int(input())</line-3>\n<line-113> main()</line-113>", "lines": [3, 113]}
#### 0 |
<line-1>s = input()</line-1>
<line-3></line-3>
<line-4>n = len(s)</line-4>
<line-5>m = len(t)</line-5>
<line-6></line-6>
<line-7>t = t + '$' + s</line-7>
<line-8></line-8>
<line-9>p = [0] * (n + m + 1)</line-9>
<line-10>k = 0</line-10>
<line-11>for i in range(1, n + m + 1):</line-11>
<line-12> while k > 0 and t[k] !... | {"code": "<line-2>t = input()</line-2>\n<line-33> sums[i] = (sums[i - 1] + ans[i]) % MOD</line-33>", "lines": [2, 33]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>N, D, M = map(int, readline().split())</line-4>
<line-5>A = list(map(int, readline().split()))</line-5>
<line-6>Am = [a for a in A if a > M]</line-6>
<line-7>Ao = [a for a in A if a <= M]</line-7>
<line-8>Am.sort(reverse = True)</line-8>
<line-9>Ao.sort(reverse = Tr... | {"code": "<line-2>readline = sys.stdin.readline</line-2>\n<line-24> ans = max(ans, Cao[i] + Cam[k])</line-24>", "lines": [2, 24]}
#### 0 |
<line-1>n,r1,r2,r3,D = map(int,input().split())</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>a = list(map(int,input().split()))</line-5>
<line-6></line-6>
<line-7># First element</line-7>
<line-8></line-8>
<line-9># Choosing P~P + A</line-9>
<line-10></line-10>
<line-11>state[0] = r1 * a[0] + r3</line-11>
<line... | {"code": "<line-3>state = [0,0] # after odd number of 2 (1st), or not (2nd)</line-3>\n<line-29> state[1] + r1 * a[-1] + r3, state[1] + r2 + r1 + D, state[1] + r1 * (a[-1] + 2) + D)</line-29>", "lines": [3, 29]}
#### 0 |
<line-1>import sys</line-1>
<line-2></line-2>
<line-4> res = 1</line-4>
<line-5> while n > 0:</line-5>
<line-6> if n % 2 == 1:</line-6>
<line-7> res = (res * a) % p</line-7>
<line-8> a = (a * a) % p</line-8>
<line-9> n >>= 1</line-9>
<line-10> return res</line-10>
<line-11></lin... | {"code": "<line-3>def binpow(a, n, p):</line-3>\n<line-21> sys.stdout.write(\"\".join(result))</line-21>", "lines": [3, 21]}
#### 0 |
<line-1>n, m = map(int, input().split())</line-1>
<line-3> </line-3>
<line-4>y = 2 ** n</line-4>
<line-5>mk = [0] * (2 * y)</line-5>
<line-6>cur = 0</line-6>
<line-7>for x in a:</line-7>
<line-8> if mk[x]: continue</line-8>
<line-9> mk[x] = 1</line-9>
<line-10> st = [x]</line-10>
<line-11> while st:</line-1... | {"code": "<line-2>a = set(map(int, input().split()))</line-2>\n<line-27> cur += 1</line-27>", "lines": [2, 27]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>MOD = 987654103</line-4>
<line-5></line-5>
<line-6>n = int(input())</line-6>
<line-7>t = input()</line-7>
<line-8></line-8>
<line-9>place = []</line-9>
<line-10>f1 = []</line-10>
<line-11>e1 = []</line-11>
<line-12></line-12>
<line-13>s = []</line-13>
<line-14>curr ... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-123> out.append('No')</line-123>", "lines": [2, 123]}
#### 0 |
<line-1></line-1>
<line-2>import sys</line-2>
<line-4>input=sys.stdin.readline</line-4>
<line-5></line-5>
<line-6>n,s=list(map(int,input().split()))</line-6>
<line-7></line-7>
<line-8>a=list(map(int,input().split()))</line-8>
<line-9>a.sort()</line-9>
<line-10>med=a[n//2]</line-10>
<line-11></line-11>
<line-12>ans=0</l... | {"code": "<line-3>#sys.stdin=open(\"data.txt\")</line-3>\n<line-20> ans+=s-a[i]</line-20>", "lines": [3, 20]}
#### 0 |
<line-1># 素因数分解</line-1>
<line-3> i = 2</line-3>
<line-4> table = []</line-4>
<line-5> while i * i <= n:</line-5>
<line-6> while n % i == 0:</line-6>
<line-7> n //= i</line-7>
<line-8> table.append(i)</line-8>
<line-9> i += 1</line-9>
<line-10> if n > 1:</line-10>
<line-1... | {"code": "<line-2>def prime_decomposition(n):</line-2>\n<line-32> ans = min(ans, an)</line-32>", "lines": [2, 32]}
#### 0 |
<line-1>#!/usr/bin/env python3</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>DEBUG = False</line-5>
<line-6></line-6>
<line-7></line-7>
<line-8>def main():</line-8>
<line-9> if DEBUG:</line-9>
<line-10> test()</line-10>
<line-11></line-11>
<line-12> n = int(input())</line-12>
<line-13></line-13>
<li... | {"code": "<line-3>from collections import defaultdict</line-3>\n<line-109> main()</line-109>", "lines": [3, 109]}
#### 0 |
<line-1>k, q = list(map(int, input().split()))</line-1>
<line-3>t[1] = 1</line-3>
<line-4>d = [0]</line-4>
<line-5>n = i = 1</line-5>
<line-6>while i < 1001:</line-6>
<line-7> if 2000 * t[k] > i - 1e-7:</line-7>
<line-8> d.append(n)</line-8>
<line-9> i += 1</line-9>
<line-10> else:</line-10>
<line-1... | {"code": "<line-2>t = [0] * (k + 1)</line-2>\n<line-12> n += 1</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>def main():</line-1>
<line-3> aa = []</line-3>
<line-4> for _ in range(n):</line-4>
<line-5> row = list(map(int, input().split()))</line-5>
<line-6> row.append(0)</line-6>
<line-7> aa.append(row)</line-7>
<line-8> aa.append([0] * (m + 1))</line-8>
<line-9> d1, d2, d3, d4 = ([[0]... | {"code": "<line-2> n, m = list(map(int, input().split()))</line-2>\n<line-28> main()</line-28>", "lines": [2, 28]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>for i in range(n):</line-3>
<line-4> x1, y1, x2, y2 = map(int, input().split())</line-4>
<line-5> res = (x1 & 1) * 2 + (y1 & 1) + 1</line-5>
<line-7>print(ans)</line-7> | {"code": "<line-2>ans = 'YES\\n'</line-2>\n<line-6> ans += str(res) + '\\n'</line-6>", "lines": [2, 6]}
#### 0 |
<line-1>def main():</line-1>
<line-3> input()</line-3>
<line-4> s = set(map(int, input().split()))</line-4>
<line-5> xx = [-x for x in s]</line-5>
<line-6> heapify(xx)</line-6>
<line-7> while True:</line-7>
<line-8> x = -xx[0]</line-8>
<line-9> while x != 1:</line-9>
<line-10> x ... | {"code": "<line-2> from heapq import heapify, heapreplace</line-2>\n<line-20> main()</line-20>", "lines": [2, 20]}
#### 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.