question stringlengths 0 30.2k | answer stringlengths 55 2.44k |
|---|---|
<line-1>def main():</line-1>
<line-3> input = sys.stdin.readline</line-3>
<line-4></line-4>
<line-5> import heapq</line-5>
<line-6> def dijkstra_heap(s,g,edge):</line-6>
<line-7> #始点sから各頂点への最短距離</line-7>
<line-8> d = [10**20] * (n+2)</line-8>
<line-9> used = [True] * (n+2) #True:未確定</line-... | {"code": "<line-2> import sys</line-2>\n<line-45> main()</line-45>", "lines": [2, 45]}
#### 0 |
<line-1>N,K,M=map(int,input().split());R=range;T=[[1]]</line-1>
<line-3> q=K*i</line-3>
<line-4> if i>~i+N:T+=[y:=T[-1][:len(T[~i+N])]]</line-4>
<line-5> else:T+=[y:=T[-1][:]+[0]*q]</line-5>
<line-6> p=len(y)-i</line-6>
<line-7> for j in R(p):y[j+i]+=y[j]%M</line-7>
<line-9>for i in R(N):print(sum(T[i][j]*T[~i+N][j]for... | {"code": "<line-2>for i in R(1,N):</line-2>\n<line-8>\tfor j in R(p-q):y[~j]-=y[~j-i-q]%M</line-8>", "lines": [2, 8]}
#### 0 |
<line-1>from collections import defaultdict as dd</line-1>
<line-3>import bisect</line-3>
<line-4>import heapq</line-4>
<line-5></line-5>
<line-6>def ri():</line-6>
<line-7> return int(input())</line-7>
<line-8></line-8>
<line-9>def rl():</line-9>
<line-10> return list(map(int, input().split()))</line-10>
<line-1... | {"code": "<line-2>from collections import deque</line-2>\n<line-39>else:</line-39>", "lines": [2, 39]}
#### 0 |
<line-1>def main():</line-1>
<line-3> input = sys.stdin.readline</line-3>
<line-4> </line-4>
<line-5> def solve():</line-5>
<line-6> n = int(input())</line-6>
<line-7> maxx = 10**5</line-7>
<line-8> minx = -10**5</line-8>
<line-9> maxy = 10**5</line-9>
<line-10> miny = -10**5... | {"code": "<line-2> import sys</line-2>\n<line-32> return 0</line-32>", "lines": [2, 32]}
#### 0 |
<line-1></line-1>
<line-2>T = int(input())</line-2>
<line-3></line-3>
<line-5> a = int(input())</line-5>
<line-6> hh = sorted(map(int, input().split()))</line-6>
<line-7> ans = 10**10</line-7>
<line-8> for h1, h2 in zip(hh[:-1], hh[1:]):</line-8>
<line-10></line-10>
<line-11> print(ans)</line-11> | {"code": "<line-4>for _ in range(T):</line-4>\n<line-9> ans = min(ans, h2 - h1)</line-9>", "lines": [4, 9]}
#### 0 |
<line-1>import sys</line-1>
<line-3>input = sys.stdin.readline</line-3>
<line-4></line-4>
<line-5>t = int(input())</line-5>
<line-6>for _ in range(t):</line-6>
<line-7> n, m, a, b, c = list(map(int,input().split()))</line-7>
<line-8> p = list(map(int, input().split()))</line-8>
<line-9> p.sort()</line-9>
<line... | {"code": "<line-2>from collections import deque</line-2>\n<line-42> poss.append(pref[aD[i] + bD[i] + cD[i]] + pref[bD[i]])</line-42>", "lines": [2, 42]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>def dfs(x,S):</line-4>
<line-5> #print(x,S)</line-5>
<line-6> for i in range(len(S)):</line-6>
<line-7> if x in S[i]:</line-7>
<line-8> S[i].remove(x)</line-8>
<line-9></line-9>
<line-10> #print(x,S)</line-10>
<line-11> </line-11>
<... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-54> print(*ANS[:n])</line-54>", "lines": [2, 54]}
#### 0 |
<line-1>for _ in range(int(input())):</line-1>
<line-3> A = list(map(int, input().split()))</line-3>
<line-4> m = 10 ** 9</line-4>
<line-5> c = 0</line-5>
<line-6> for i in range(n - 1, -1, -1):</line-6>
<line-7> if A[i] <= m:</line-7>
<line-8> m = A[i]</line-8>
<line-9> else:</line... | {"code": "<line-2> n = int(input())</line-2>\n<line-10> c += 1</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>q = int(input())</line-1>
<line-3> n = int(input())</line-3>
<line-4> s = input()</line-4>
<line-5> t = input()</line-5>
<line-6></line-6>
<line-7> x = set(s)</line-7>
<line-8> y = set(t)</line-8>
<line-9></line-9>
<line-10> if x != y :</line-10>
<line-11> print("NO")</line-11>
<line-12> continue</l... | {"code": "<line-2>for _ in range(q) :</line-2>\n<line-38> continue</line-38>", "lines": [2, 38]}
#### 0 |
<line-1>t = int(input())</line-1>
<line-2></line-2>
<line-4> n = int(input())</line-4>
<line-5> </line-5>
<line-6> a = list(map(int, input().split()))</line-6>
<line-7> b = list(map(int, input().split()))</line-7>
<line-8> ma = min(a)</line-8>
<line-9> mb = min(b)</line-9>
<line-10> </line-10>
<lin... | {"code": "<line-3>for _ in range(t):</line-3>\n<line-15> ops += max(da, db)</line-15>", "lines": [3, 15]}
#### 0 |
<line-1># @author </line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>class GCandyBoxHardVersion:</line-5>
<line-6> def solve(self):</line-6>
<line-7> q = int(input())</line-7>
<line-8> for _ in range(q):</line-8>
<line-9> n = int(input())</line-9>
<line-10> a = [0] * n</line-10... | {"code": "<line-3>import sys</line-3>\n<line-57>input = sys.stdin.readline</line-57>", "lines": [3, 57]}
#### 0 |
<line-1>#!usr/bin/env python3</line-1>
<line-3>from heapq import heappush, heappop</line-3>
<line-4>from itertools import permutations, accumulate</line-4>
<line-5>import sys</line-5>
<line-6>import math</line-6>
<line-7>import bisect</line-7>
<line-8>def LI(): return [int(x) for x in sys.stdin.readline().split()]</lin... | {"code": "<line-2>from collections import defaultdict, deque</line-2>\n<line-70> solve()</line-70>", "lines": [2, 70]}
#### 0 |
<line-1>for __ in range(int(input())):</line-1>
<line-3> ar = list(map(int, input().split()))</line-3>
<line-4> ar.reverse()</line-4>
<line-5> ans = n - 1</line-5>
<line-6> flag = False</line-6>
<line-7> for i in range(1, n):</line-7>
<line-8> if ar[i] < ar[i - 1]:</line-8>
<line-9> fla... | {"code": "<line-2> n = int(input())</line-2>\n<line-13> ans -= 1</line-13>", "lines": [2, 13]}
#### 0 |
<line-1>import math</line-1>
<line-3> n=int(input())</line-3>
<line-4> if n==1:</line-4>
<line-5> print(0)</line-5>
<line-6> else:</line-6>
<line-7> k=int(n**(0.5))</line-7>
<line-8> if k*k<n:</line-8>
<line-9> k+=1</line-9>
<line-10> # print(n,k) </line-10>
<line-11> ... | {"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-15> ans+=(k-1)</line-15>", "lines": [2, 15]}
#### 0 |
<line-1>import sys</line-1>
<line-3> return sys.stdin.readline()[:-1]</line-3>
<line-4></line-4>
<line-5>t = int(input())</line-5>
<line-6>for _ in range(t):</line-6>
<line-7> n, k = map(int, input().split())</line-7>
<line-8> a = list(map(int, input().split()))</line-8>
<line-9> cum = [0 for _ in range(2*k+2)]</line-9... | {"code": "<line-2>def input():</line-2>\n<line-21>\t\tans = min(ans, cum[i])</line-21>", "lines": [2, 21]}
#### 0 |
<line-1>ans = []</line-1>
<line-3> n = int(input())</line-3>
<line-4> s = list(input())</line-4>
<line-5> t = list(input())</line-5>
<line-6> lvl = 0</line-6>
<line-7> X = [s, t]</line-7>
<line-8> f = 1</line-8>
<line-9> for i in range(n):</line-9>
<line-10> if s[i] in '3456' and t[i] in '34... | {"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-19> ans.append('NO')</line-19>", "lines": [2, 19]}
#### 0 |
<line-1>from operator import itemgetter</line-1>
<line-3>input = sys.stdin.readline</line-3>
<line-4></line-4>
<line-5>MAX_A = 200</line-5>
<line-6>t = int(input())</line-6>
<line-7></line-7>
<line-8>for _ in range(t):</line-8>
<line-9> n = int(input())</line-9>
<line-10> a = list(map(int, input().split()))</line... | {"code": "<line-2>import sys</line-2>\n<line-46> r -= 1</line-46>", "lines": [2, 46]}
#### 0 |
<line-1>from bisect import bisect_left as bl</line-1>
<line-3>from heapq import heappush,heappop,heapify</line-3>
<line-4>import math</line-4>
<line-5>from collections import *</line-5>
<line-6>from functools import reduce,cmp_to_key</line-6>
<line-7>import sys</line-7>
<line-8>input = sys.stdin.readline</line-8>
<line... | {"code": "<line-2>from bisect import bisect_right as br</line-2>\n<line-50> # print(j, he)</line-50>", "lines": [2, 50]}
#### 0 |
<line-1>import sys</line-1>
<line-3>import bisect</line-3>
<line-4></line-4>
<line-5>t=int(input())</line-5>
<line-6>for tests in range(t):</line-6>
<line-7> n=int(input())</line-7>
<line-8> A=list(map(int,input().split()))</line-8>
<line-9></line-9>
<line-10> compression_dict={a: ind for ind, a in enumerate(s... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-28> Ans=max(count,Ans)</line-28>", "lines": [2, 28]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3> s = input()</line-3>
<line-4> l,r,u,d = [s.count(i) for i in 'LRUD']</line-4>
<line-5> lr = min(l, r)</line-5>
<line-6> ud = min(u, d)</line-6>
<line-7> res = ""</line-7>
<line-8> if lr == 0 and ud == 0:</line-8>
<line-9> res = ""</line-9>
<line-10> ... | {"code": "<line-2>for _ in range(n):</line-2>\n<line-16> print(len(res))</line-16>", "lines": [2, 16]}
#### 0 |
<line-1>import sys</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>#t=1</line-5>
<line-6>t=int(input())</line-6>
<line-7>for _ in range(t):</line-7>
<line-8> n=int(input())</line-8>
<line-9> s=input().rstrip()</line-9>
<line-10> s=[s[-i-1] for i in range(n)]</line-10>
<line-11> ans=[]</line-11>
<line-1... | {"code": "<line-3>input=sys.stdin.readline</line-3>\n<line-41> print(len(ans))</line-41>", "lines": [3, 41]}
#### 0 |
<line-1>import sys</line-1>
<line-3>rInt = lambda: int(input())</line-3>
<line-4>mInt = lambda: map(int, input().split())</line-4>
<line-5>rLis = lambda: list(map(int, input().split()))</line-5>
<line-6></line-6>
<line-7>outs = []</line-7>
<line-8></line-8>
<line-9>t = rInt()</line-9>
<line-10>for _ in range(t):</line-... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-38> outs.append(best)</line-38>", "lines": [2, 38]}
#### 0 |
<line-1>for i in range(int(input())):</line-1>
<line-3> prev=0</line-3>
<line-4> ma=-1</line-4>
<line-5> for i in range(1,len(s)):</line-5>
<line-6> if s[i]=='R':</line-6>
<line-7> ma=max(ma,i-prev)</line-7>
<line-9> print(ma) </line-9>
<line-10> </line-10> | {"code": "<line-2> s='R' + input() + 'R'</line-2>\n<line-8> prev=i</line-8>", "lines": [2, 8]}
#### 0 |
<line-1>def isvalid(s):</line-1>
<line-3> for i in l:</line-3>
<line-4> count=0</line-4>
<line-5> for j in range(len(i)):</line-5>
<line-6> if(s[j]!=i[j]):</line-6>
<line-7> count+=1</line-7>
<line-8> if(count>1):</line-8>
<line-9> return 0</line-9>
<line-10>... | {"code": "<line-2> nonlocal l</line-2>\n<line-36> else:</line-36>", "lines": [2, 36]}
#### 0 |
<line-1></line-1>
<line-3></line-3>
<line-4>for _ in range(T):</line-4>
<line-5> a, b = list(map(int, input().split()))</line-5>
<line-6> print(max(max(a, b), min(a, b) * 2)**2)</line-6> | {"code": "<line-2>T = int(input())</line-2>", "lines": [2]}
#### 0 |
<line-1>from sys import stdin</line-1>
<line-3> n = int(input())</line-3>
<line-4> l = list(map(int,input().split()))</line-4>
<line-5> id = list(zip(l,list(range(n))))</line-5>
<line-6> id.sort()</line-6>
<line-7> val, pos = zip(*id)</line-7>
<line-8> blok = []</line-8>
<line-9> cur = [pos[0]]</li... | {"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-58> best = max(best, (ind+1)+(l1-i1))</line-58>", "lines": [2, 58]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>def search(i,j):</line-4>
<line-5> L=[]</line-5>
<line-6></line-6>
<line-7> c=0</line-7>
<line-8></line-8>
<line-9> while CHECK[i][j]==1<<30:</line-9>
<line-10> L.append((i,j))</line-10>
<line-11> </line-11>
<line-12> CHECK[i][j]=c</lin... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-111> ANSC+=y</line-111>", "lines": [2, 111]}
#### 0 |
<line-1>t = int(input())</line-1>
<line-2></line-2>
<line-4> n = int(input())</line-4>
<line-6> print(*set(a))</line-6> | {"code": "<line-3>for _ in range(t):</line-3>\n<line-5> a = list(map(int, input().split()))</line-5>", "lines": [3, 5]}
#### 0 |
<line-1>import math</line-1>
<line-3>import heapq</line-3>
<line-4>import copy</line-4>
<line-5>import heapq</line-5>
<line-6>from collections import deque</line-6>
<line-7>def na():</line-7>
<line-8> n = int(input())</line-8>
<line-9> b = [int(x) for x in input().split()]</line-9>
<line-10> return n,b</line-10>
<line-... | {"code": "<line-2>from decimal import Decimal</line-2>\n<line-98>\tans += s</line-98>", "lines": [2, 98]}
#### 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, M = list(map(int, input().split()))</line-5>
<line-6> E = [[] for aa in range(N)]</line-6>
<line-7> for __ in range(M):</line-7>
<line-8> a, b = list(map(int, input().split()))</line-8>
<line-9>... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-35> print(len(EVEN))</line-35>", "lines": [2, 35]}
#### 0 |
<line-1>from sys import stdin</line-1>
<line-3></line-3>
<line-4>rgb = 'RGB'</line-4>
<line-5></line-5>
<line-6>for query in range(int(stdin.readline())):</line-6>
<line-7> n, k = list(map(int, stdin.readline().split()))</line-7>
<line-8> s = stdin.readline()</line-8>
<line-9></line-9>
<line-10> ans = math.inf... | {"code": "<line-2>import math</line-2>\n<line-17> ans = min(ans, dp[i + k] - dp[i])</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>Q = int(input())</line-4>
<line-5>for _ in range(Q):</line-5>
<line-6> N = int(input())</line-6>
<line-7> A = [int(a) for a in input().split()]</line-7>
<line-8> X = {}</line-8>
<line-9> for a in A:</line-9>
<line-10> if a in X:</line-10>
<line-11... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-25> prev = ne</line-25>", "lines": [2, 25]}
#### 0 |
<line-1>t = int(input())</line-1>
<line-3> n = int(input())</line-3>
<line-4> l = list([int(x)- 1 for x in input().split()])</line-4>
<line-5> out = []</line-5>
<line-6></line-6>
<line-7> ll = [(l[i], i) for i in range(n)]</line-7>
<line-8> ll.sort()</line-8>
<line-9></line-9>
<line-10> swap = (-1,-1)... | {"code": "<line-2>for _ in range(t):</line-2>\n<line-71> print(-1)</line-71>", "lines": [2, 71]}
#### 0 |
<line-1>for _ in range(int(input())):</line-1>
<line-3> A = []</line-3>
<line-4> x = 1</line-4>
<line-5> while True:</line-5>
<line-6> if (m * x) % 10 not in A:</line-6>
<line-7> A.append((m * x) % 10)</line-7>
<line-8> else:</line-8>
<line-9> break</line-9>
<line-10> ... | {"code": "<line-2> n, m = list(map(int, input().split()))</line-2>\n<line-12> n //= m</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>def read_int():</line-1>
<line-3></line-3>
<line-4></line-4>
<line-5>def read_ints():</line-5>
<line-6> return list(map(int, input().split(' ')))</line-6>
<line-7></line-7>
<line-8></line-8>
<line-9>t = read_int()</line-9>
<line-10>for case_num in range(t):</line-10>
<line-11> n = read_int()</line-11>
<li... | {"code": "<line-2> return int(input())</line-2>\n<line-27> break</line-27>", "lines": [2, 27]}
#### 0 |
<line-1>for _ in range(int(input())):</line-1>
<line-3> s = input()</line-3>
<line-4> st = 0</line-4>
<line-5> fans = 0</line-5>
<line-6> for x in s:</line-6>
<line-7> if x == ')':</line-7>
<line-8> st -= 1</line-8>
<line-9> else:</line-9>
<line-10> st += 1</line-10>
<lin... | {"code": "<line-2> n = int(input())</line-2>\n<line-13> st = 0</line-13>", "lines": [2, 13]}
#### 0 |
<line-1>for _ in range(int(input())):</line-1>
<line-3> s=input()</line-3>
<line-4> a=""</line-4>
<line-5> b=""</line-5>
<line-6> flag=1</line-6>
<line-7> for i in s:</line-7>
<line-8> if flag:</line-8>
<line-9> if i=="2":</line-9>
<line-10> a+="1"</line-10>
<line-11> ... | {"code": "<line-2> n=int(input())</line-2>\n<line-30> print(a)</line-30>", "lines": [2, 30]}
#### 0 |
<line-1># coding: utf-8</line-1>
<line-3></line-3>
<line-4>def solve(s, c):</line-4>
<line-5> if(len(s)==1):</line-5>
<line-6> if s[0]==c:</line-6>
<line-7> return 0</line-7>
<line-8> else:</line-8>
<line-9> return 1</line-9>
<line-10> ans1 = sum([i!=c for i in s[:len(s)//2]]) ... | {"code": "<line-2># Your code here!</line-2>\n<line-16> input()</line-16>", "lines": [2, 16]}
#### 0 |
<line-1>def read_int():</line-1>
<line-3></line-3>
<line-4></line-4>
<line-5>def read_ints():</line-5>
<line-6> return list(map(int, input().split(' ')))</line-6>
<line-7></line-7>
<line-8></line-8>
<line-9>t = read_int()</line-9>
<line-10>for case_num in range(t):</line-10>
<line-11> n, m = read_ints()</line-11>... | {"code": "<line-2> return int(input())</line-2>\n<line-21> binary = '{:b}'.format(ans)</line-21>", "lines": [2, 21]}
#### 0 |
<line-1>import sys</line-1>
<line-2></line-2>
<line-4>int1 = lambda x: int(x) - 1</line-4>
<line-5>p2D = lambda x: print(*x, sep="\n")</line-5>
<line-6>def II(): return int(sys.stdin.readline())</line-6>
<line-7>def MI(): return map(int, sys.stdin.readline().split())</line-7>
<line-8>def LI(): return list(map(int, sys.... | {"code": "<line-3>sys.setrecursionlimit(10 ** 5)</line-3>\n<line-64> print(len(ans))</line-64>", "lines": [3, 64]}
#### 0 |
<line-1>from sys import stdin, stdout</line-1>
<line-3>import sys,os,math</line-3>
<line-4></line-4>
<line-5>#sys.setrecursionlimit(10**6)</line-5>
<line-6></line-6>
<line-7>T = int(input())</line-7>
<line-8>for _ in range(T):</line-8>
<line-9> N, M = list(map(int, input().split()))</line-9>
<line-10> DS = [0] * ... | {"code": "<line-2>import functools</line-2>\n<line-47> for e in ES:</line-47>", "lines": [2, 47]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>T = int(input())</line-4>
<line-5>for _ in range(T):</line-5>
<line-6> N = int(input())</line-6>
<line-7> A = [int(a) for a in input().split()]</line-7>
<line-8> </line-8>
<line-9> if max(A) == min(A):</line-9>
<line-10> print(1)</line-10>
<line-1... | {"code": "<line-2>input = lambda: sys.stdin.readline().rstrip()</line-2>\n<line-22> print(3)</line-22>", "lines": [2, 22]}
#### 0 |
<line-1>n,l = map(int,input().split())</line-1>
<line-3>for i in range(n):</line-3>
<line-4> a.append(input())</line-4>
<line-5> </line-5>
<line-7>print("".join(str(i) for i in a))</line-7> | {"code": "<line-2>a = []</line-2>\n<line-6>a.sort()</line-6>", "lines": [2, 6]}
#### 0 |
<line-1>for _ in range(int(input())):</line-1>
<line-3> if a * n != b * m:</line-3>
<line-4> print('NO')</line-4>
<line-5> else:</line-5>
<line-6> ar = []</line-6>
<line-7> for i in range(n):</line-7>
<line-8> ar.append([0] * m)</line-8>
<line-9> x, y = 0, a</line-9>
<line-1... | {"code": "<line-2> n, m, a, b = list(map(int, input().split()))</line-2>\n<line-24> for i in range(n):</line-24>", "lines": [2, 24]}
#### 0 |
<line-1>s = input()</line-1>
<line-3>ind = -1</line-3>
<line-4>f = False</line-4>
<line-5>for i in range(n):</line-5>
<line-6> if s[i] == '[':</line-6>
<line-7> f = True</line-7>
<line-8> elif s[i] == ':':</line-8>
<line-9> if f:</line-9>
<line-10> ind = i</line-10>
<line-11> b... | {"code": "<line-2>n = len(s)</line-2>\n<line-30> ans += 1</line-30>", "lines": [2, 30]}
#### 0 |
<line-1>num = list(map(int, input()))</line-1>
<line-3>for i in range(-1, -len(num) - 1, -1):</line-3>
<line-4> if num[i] == 0:</line-4>
<line-5> continue</line-5>
<line-6> num[i] -= 1</line-6>
<line-7> for j in range(i + 1, 0):</line-7>
<line-8> num[j] = 9</line-8>
<line-9> if sum(num) > sum(... | {"code": "<line-2>best = num[:]</line-2>\n<line-11>s = ''.join(map(str, best)).lstrip('0')</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>def main():</line-1>
<line-3> n = len(s)</line-3>
<line-4> t = int(str(int(s[0]) + 1) + '0' * (n - 1))</line-4>
<line-5></line-5>
<line-7></line-7>
<line-8>main()</line-8> | {"code": "<line-2> s = input()</line-2>\n<line-6> print(t - int(s))</line-6>", "lines": [2, 6]}
#### 0 |
<line-1>from collections import defaultdict as dd</line-1>
<line-3>def nn():</line-3>
<line-4> return int(input())</line-4>
<line-5></line-5>
<line-6>def li():</line-6>
<line-7> return list(input())</line-7>
<line-8></line-8>
<line-9>def mi():</line-9>
<line-10> return list(map(int, input().split()))</line-10>
<line-11... | {"code": "<line-2>import math</line-2>\n<line-65>\t\tmaxtotal=max(maxtotal,curtotal)</line-65>", "lines": [2, 65]}
#### 0 |
<line-1>x=int(input())</line-1>
<line-3>def ok(mm):</line-3>
<line-4> while mm<0: mm+=1440</line-4>
<line-5> hh=mm//60</line-5>
<line-6> mm=mm%60</line-6>
<line-7> return hh%10==7 or hh//10==7 or mm%10==7 or mm//10==7</line-7>
<line-8>for y in range(999):</line-8>
<line-9> if ok(h*60+m-y*x):</line-9>
<line-11> ... | {"code": "<line-2>h,m=list(map(int,input().split()))</line-2>\n<line-10> print(y)</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>n, pos, l, r = map(int, input().split())</line-1>
<line-2></line-2>
<line-4> if l <= pos and pos <= r:</line-4>
<line-5> if pos - l < r - pos:</line-5>
<line-6> print(pos - l + 1 + r - l + 1)</line-6>
<line-7> else:</line-7>
<line-8> print(r - pos + 1 + r - l + 1)</line-8>... | {"code": "<line-3>if l > 1 and r < n:</line-3>\n<line-17>else:</line-17>", "lines": [3, 17]}
#### 0 |
<line-1>for _ in range(int(input())):</line-1>
<line-3> A = []</line-3>
<line-4> for _1 in range(n):</line-4>
<line-5> d, h = list(map(int, input().split()))</line-5>
<line-6> A.append([d, h])</line-6>
<line-7> A.sort(reverse=True)</line-7>
<line-8> if A[0][0] >= x:</line-8>
<line-9> prin... | {"code": "<line-2> n, x = list(map(int, input().split()))</line-2>\n<line-17> else:</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>n, m = map(int, input().split())</line-1>
<line-3>else:</line-3>
<line-4> c = n - m</line-4>
<line-5> l = 0</line-5>
<line-6> r = 10 ** 18</line-6>
<line-7> while r - l > 1:</line-7>
<line-8> md = (r + l) // 2</line-8>
<line-9> if (1 + md) * md // 2 < c:</line-9>
<line-10> l... | {"code": "<line-2>if (m >= n): print(n)</line-2>\n<line-12> r = md</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>cards=list(input().split())</line-1>
<line-3>lp=[0]*9</line-3>
<line-4>ls=[0]*9</line-4>
<line-5>for item in cards:</line-5>
<line-6> if item[1]=='m':</line-6>
<line-7> lm[int(item[0])-1]+=1</line-7>
<line-8> elif item[1]=='p':</line-8>
<line-9> lp[int(item[0])-1]+=1</line-9>
<line-10> el... | {"code": "<line-2>lm=[0]*9</line-2>\n<line-35> m=max(sum(lm[i:i+3]),sum(lp[i:i+3]),sum(ls[i:i+3]),m)</line-35>", "lines": [2, 35]}
#### 0 |
<line-1>from sys import stdin, stdout</line-1>
<line-2></line-2>
<line-4>n, m = map(int, stdin.readline().split())</line-4>
<line-5>left, right, down, up = [], [], [], []</line-5>
<line-6>coordinates = []</line-6>
<line-7></line-7>
<line-8>for i in range(k):</line-8>
<line-9> x1, y1, x2, y2 = map(int, stdin.readline... | {"code": "<line-3>k = int(stdin.readline())</line-3>\n<line-104>else:</line-104>", "lines": [3, 104]}
#### 0 |
<line-2>r=n%7</line-2>
<line-3>d=n//7</line-3>
<line-4>print(2*d+max(0,r-5),2*d+min(r,2))</line-4> | {"code": "<line-1>n=int(input())</line-1>", "lines": [1]}
#### 0 |
<line-1>from fractions import gcd</line-1>
<line-3> return a*b//gcd(a, b)</line-3>
<line-4>n, a, b, p, q = list(map(int, input().split(' ')))</line-4>
<line-5>red = n//a</line-5>
<line-6>blue = n//b</line-6>
<line-7>if (p<q):</line-7>
<line-8> red -= n//lcm(a, b)</line-8>
<line-9>else:</line-9>
<line-11></line-11... | {"code": "<line-2>def lcm(a, b):</line-2>\n<line-10> blue -= n//lcm(a, b)</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>x = A.count('G')</line-3>
<line-4>num_1 = 0</line-4>
<line-5>num_2 = 0</line-5>
<line-6>max_num = 0</line-6>
<line-7>flag = 0</line-7>
<line-8>for i in range(n):</line-8>
<line-9> if A[i] == 'G' and flag == 0:</line-9>
<line-10> num_1 += 1</line-10>
<line-11> elif ... | {"code": "<line-2>A = input()</line-2>\n<line-33> max_num = num_1 + num_2</line-33>", "lines": [2, 33]}
#### 0 |
<line-1>#This code is dedicated to Vlada S.</line-1>
<line-2></line-2>
<line-4> def __init__(self, reqs, number):</line-4>
<line-5> self.reqs = list(map(int, reqs.split()[1:]))</line-5>
<line-6> self.available = False</line-6>
<line-7> self.in_stack = False</line-7>
<line-8> self.number = number</line-8>
<line-9></... | {"code": "<line-3>class Course:</line-3>\n<line-49>\tprint(answer.count(\" \"))</line-49>", "lines": [3, 49]}
#### 0 |
<line-1>import sys</line-1>
<line-2></line-2>
<line-4>f = sys.stdin</line-4>
<line-5>n,k = list(map(int, f.readline().split()))</line-5>
<line-6>a = list(map(int, f.readline().split()))</line-6>
<line-7>aset = set(a)</line-7>
<line-8>st = []</line-8>
<line-9>failed = False</line-9>
<line-10>ai = 0</line-10>
<line-11>ap... | {"code": "<line-3>#f = open('input', 'r')</line-3>\n<line-31>else:</line-31>", "lines": [3, 31]}
#### 0 |
<line-1>import sys</line-1>
<line-3>if c==0:</line-3>
<line-4> if a==b:</line-4>
<line-5> print('YES')</line-5>
<line-6> else:</line-6>
<line-7> print('NO')</line-7>
<line-8> return</line-8>
<line-9>if (b-a)%c==0 and (b-a)//c>=0:</line-9>
<line-10> print('YES')</line-10>
<line-12> print('NO... | {"code": "<line-2>a,b,c=map(int,input().split())</line-2>\n<line-11>else:</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>cnt1 = int(input())</line-1>
<line-3>cnt3 = int(input())</line-3>
<line-4>cnt4 = int(input())</line-4>
<line-5>if cnt1 != cnt4:</line-5>
<line-6> print(0)</line-6>
<line-7> return</line-7>
<line-8></line-8>
<line-9>if (cnt3 != 0 and cnt1 == 0):</line-9>
<line-10> print(0)</line-10>
<line-12></line-12>
<line-13>... | {"code": "<line-2>cnt2 = int(input())</line-2>\n<line-11>\treturn</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>def read_ints():</line-1>
<line-3></line-3>
<line-4>n, k, t = read_ints()</line-4>
<line-5>if t <= k:</line-5>
<line-6> print(t)</line-6>
<line-7>elif t > n:</line-7>
<line-8> print(k + n - t)</line-8>
<line-10> print(k)</line-10> | {"code": "<line-2>\treturn [int(i) for i in input().split()]</line-2>\n<line-9>else:</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>from collections import deque</line-1>
<line-3>mn = [ 300 for i in range( len( S ) ) ]</line-3>
<line-4>for i in range( len( S ) - 1, -1, -1 ):</line-4>
<line-5> if i == len( S ) - 1:</line-5>
<line-6> mn[ i ] = ord( S[ i ] )</line-6>
<line-7> else:</line-7>
<line-8> mn[ i ] = min( mn[ i + 1 ], ord( S[ ... | {"code": "<line-2>S = input()</line-2>\n<line-15> dq.pop()</line-15>", "lines": [2, 15]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>T = int(input())</line-4>
<line-5>for _ in range(T):</line-5>
<line-6> n = int(input())</line-6>
<line-7> lastP = 0</line-7>
<line-8> lastC = 0</line-8>
<line-9> works = True</line-9>
<line-10> for _ in range(n):</line-10>
<line-11> p, c = list... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-22> else:</line-22>", "lines": [2, 22]}
#### 0 |
<line-1>s = input()</line-1>
<line-3>m = int(s[3:])</line-3>
<line-4></line-4>
<line-5>def ispalin(h, m):</line-5>
<line-6> s = "%02d:%02d"%(h,m)</line-6>
<line-7> return s == s[::-1]</line-7>
<line-8></line-8>
<line-9>for d in range(999999):</line-9>
<line-10> if ispalin(h, m):</line-10>
<line-11> prin... | {"code": "<line-2>h = int(s[:2])</line-2>\n<line-15> h = (h+1)%24</line-15>", "lines": [2, 15]}
#### 0 |
<line-1>read = lambda: list(map(int, input().split()))</line-1>
<line-3>a = list(read())</line-3>
<line-4>x, y = a.index(1), a.index(n)</line-4>
<line-6>print(ans)</line-6> | {"code": "<line-2>n = int(input())</line-2>\n<line-5>ans = max(x, y, n - x - 1, n - y - 1)</line-5>", "lines": [2, 5]}
#### 0 |
<line-1>import sys, math</line-1>
<line-3>pal='AHIMOoTUVvWwXxY'</line-3>
<line-4>n=len(s)</line-4>
<line-5>l=0</line-5>
<line-6>r=n-1</line-6>
<line-7>flag=True</line-7>
<line-8>fir='pq'</line-8>
<line-9>sec='bd'</line-9>
<line-10>while l<=r:</line-10>
<line-11> if s[l]==s[r] and s[l] in pal:</line-11>
<line-12> ... | {"code": "<line-2>s=input()</line-2>\n<line-31>else:</line-31>", "lines": [2, 31]}
#### 0 |
<line-1>a = list(input())</line-1>
<line-3>a.sort()</line-3>
<line-4>a = a[::-1]</line-4>
<line-5>prefix = ""</line-5>
<line-6>while(len(a) > 0):</line-6>
<line-7> for i in range(len(a)):</line-7>
<line-8> num = prefix + a[i] + "".join(sorted(a[:i] + a[i + 1:]))</line-8>
<line-9> if (int(num) <= b):</line-9>
<line-10... | {"code": "<line-2>b = int(input())</line-2>\n<line-12>\t\t\tbreak</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>s = [ [ c for c in input() ] for i in range(10) ]</line-1>
<line-3> for i in range(10):</line-3>
<line-4> for j in range(10):</line-4>
<line-5> ok = True</line-5>
<line-6> for k in range(5):</line-6>
<line-7> if j+k>9: ok = False</line-7>
<line-8> elif s[i][j+k] != 'X': ok = False</l... | {"code": "<line-2>def win():</line-2>\n<line-33> s[i][j] = '.'</line-33>", "lines": [2, 33]}
#### 0 |
<line-1>#!/usr/bin/env python3</line-1>
<line-2></line-2>
<line-4> import sys</line-4>
<line-5></line-5>
<line-6> readln = sys.stdin.readline</line-6>
<line-7> try:</line-7>
<line-8> while True:</line-8>
<line-9> n, k = list(map(int, input().split()))</line-9>
<line-10> a = [['0'] ... | {"code": "<line-3>def main():</line-3>\n<line-41> pass</line-41>", "lines": [3, 41]}
#### 0 |
<line-1>from math import log</line-1>
<line-3></line-3>
<line-4>s = ['x^y^z', 'x^z^y', '(x^y)^z', 'y^x^z', 'y^z^x', '(y^x)^z', 'z^x^y', 'z^y^x', '(z^x)^y']</line-4>
<line-5></line-5>
<line-6>x, y, z = list(map(Decimal, input().split()))</line-6>
<line-7></line-7>
<line-8>f = []</line-8>
<line-9>f += [(Decimal(log(x)) *... | {"code": "<line-2>from decimal import Decimal</line-2>\n<line-19>f.sort()</line-19>", "lines": [2, 19]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>ans = n</line-3>
<line-4>now = ''</line-4>
<line-5>ma = 0</line-5>
<line-6>for i in range(n // 2):</line-6>
<line-7> now += st[i]</line-7>
<line-8> t = ''</line-8>
<line-9> for j in range(i + 1, 2 * i + 2):</line-9>
<line-10> t += st[j]</line-10>
<line-11> if... | {"code": "<line-2>st = input()</line-2>\n<line-12> ma = i</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>b, a = d = [], []</line-3>
<line-4>h, s = [], []</line-4>
<line-5></line-5>
<line-6>for i in range(n):</line-6>
<line-7> f, k = input().split()</line-7>
<line-8> d[int(k)].append(f)</line-8>
<line-9></line-9>
<line-10>m = len(a)</line-10>
<line-11>for i in a:</line-11>
<l... | {"code": "<line-2>t = [1] + [0] * n</line-2>\n<line-67>d = '\\nmove '</line-67>", "lines": [2, 67]}
#### 0 |
<line-1>x=int(input())</line-1>
<line-3> r=0</line-3>
<line-4> while a>0:</line-4>
<line-5> r+=a%10</line-5>
<line-6> a//=10</line-6>
<line-7> return r</line-7>
<line-8>def d(a,b):</line-8>
<line-9> r=0</line-9>
<line-10> for i in range(6):</line-10>
<line-11> if a%10!=b%10:</line-11>
<line-12> r += ... | {"code": "<line-2>def s(a):</line-2>\n<line-19> c=min(c,d(x,i))</line-19>", "lines": [2, 19]}
#### 0 |
<line-1>from math import gcd</line-1>
<line-3> a%=m</line-3>
<line-4> r=1</line-4>
<line-5> while b:</line-5>
<line-6> if b&1:r=r*a%m</line-6>
<line-7> a=a*a%m</line-7>
<line-8> b>>=1</line-8>
<line-9> return r</line-9>
<line-10></line-10>
<line-11>def f(n):</line-11>
<line-12> r=[]</line-12>
<line-13> if (n&1)==0:<... | {"code": "<line-2>def powmod(a,b,m):</line-2>\n<line-44> r=[(a//gcd(a,c)*c,b*d) for a,b in r for c,d in ords]</line-44>", "lines": [2, 44]}
#### 0 |
<line-1>m = 10** 6 + 3</line-1>
<line-2></line-2>
<line-4>p = 1</line-4>
<line-5>for i in range(n):</line-5>
<line-6> p *= 2</line-6>
<line-7> if p > k:</line-7>
<line-8> break</line-8>
<line-9>if p < k:</line-9>
<line-10> print('1 1')</line-10>
<line-11> return</line-11>
<line-12></line-12>
<line-13... | {"code": "<line-3>n, k = list(map(int, input().split()))</line-3>\n<line-29> break</line-29>", "lines": [3, 29]}
#### 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> latitude = 0</line-11>
... | {"code": "<line-2>Codeforces Good Bye 2016 Contest Problem B</line-2>\n<line-44> print(value, end=end)</line-44>", "lines": [2, 44]}
#### 0 |
<line-1>import sys, collections</line-1>
<line-2></line-2>
<line-4> if b == 0: return a</line-4>
<line-5> return gcd(b, a % b)</line-5>
<line-6></line-6>
<line-7>def lcm(a, b):</line-7>
<line-8> return a // gcd(a, b) * b</line-8>
<line-9></line-9>
<line-10>def extgcd(a, b):</line-10>
<line-11> if b == 0: re... | {"code": "<line-3>def gcd(a, b):</line-3>\n<line-102>ans = f(x0, T, R + 1) - f(x0, T, L)</line-102>", "lines": [3, 102]}
#### 0 |
<line-1>n, a, b = map(int, input().split())</line-1>
<line-3>for i in range(1, n):</line-3>
<line-5>print(ans)</line-5> | {"code": "<line-2>ans = 0</line-2>\n<line-4> ans = max(ans, min(a // i, b // (n - i)))</line-4>", "lines": [2, 4]}
#### 0 |
<line-1>n,m=list(map(int,input().split()))</line-1>
<line-3>def clr(ss):</line-3>
<line-4> cc = None</line-4>
<line-5> for s in ss:</line-5>
<line-6> for c in s:</line-6>
<line-7> if cc is None:</line-7>
<line-8> cc = c</line-8>
<line-9> elif cc != c:</line-9>
<line-10>... | {"code": "<line-2>f=[input() for _ in range(n)]</line-2>\n<line-34> return</line-34>", "lines": [2, 34]}
#### 0 |
<line-1>def f(n):</line-1>
<line-3> while right - left > 1:</line-3>
<line-4> mid = (left + right) // 2</line-4>
<line-5> x = 6 * mid * (mid + 1) // 2 + 5 * (mid + 1)</line-5>
<line-6> if x > n:</line-6>
<line-7> right = mid</line-7>
<line-8> else:</line-8>
<line-9> left = mid</line-9>
<line-10> if left >= 0:</... | {"code": "<line-2>\tleft, right = -1, n + 1</line-2>\n<line-32>\tprint(x, y)</line-32>", "lines": [2, 32]}
#### 0 |
<line-1>a, b, c = list(map(int, input().split()))</line-1>
<line-3>p[0] = 1</line-3>
<line-4>p[a] = 1</line-4>
<line-5>p[b] = 1</line-5>
<line-6>for i in range(c + 1):</line-6>
<line-7> if p[i]:</line-7>
<line-8> p[i + a] = 1</line-8>
<line-9> p[i + b] = 1</line-9>
<line-10>if p[c]:</line-10>
<line-11>... | {"code": "<line-2>p = [0] * 100000</line-2>\n<line-12>else:</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>def main():</line-1>
<line-3></line-3>
<line-4> x = list(map(int, input().split()))</line-4>
<line-5> y = list(map(int, input().split()))</line-5>
<line-6></line-6>
<line-7> x.append(x[0] + l)</line-7>
<line-8> y.append(y[0] + l)</line-8>
<line-9></line-9>
<line-10> a = [x[i + 1] - x[i] for i in range(n)]</line... | {"code": "<line-2>\tn, l = map(int, input().split())</line-2>\n<line-17>\tprint(\"NO\")</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>s = input()</line-1>
<line-3>n = len(s)</line-3>
<line-4>for l in range(n):</line-4>
<line-5> for r in range(l, n):</line-5>
<line-6> if s[l:r+1] != s[l:r+1][::-1]:</line-6>
<line-8>print(mx)</line-8> | {"code": "<line-2>mx = 0</line-2>\n<line-7> mx = max(mx, r - l + 1)</line-7>", "lines": [2, 7]}
#### 0 |
<line-1>'''input</line-1>
<line-3>3123 3123</line-3>
<line-4>2777 2777</line-4>
<line-5>2246 2246</line-5>
<line-6>2246 2246</line-6>
<line-7>1699 1699</line-7>
<line-8>'''</line-8>
<line-9>n = int(input())</line-9>
<line-10>x = []</line-10>
<line-11>f = 0</line-11>
<line-12>for _ in range(n):</line-12>
<line-13> a, b ... | {"code": "<line-2>5</line-2>\n<line-21>else:</line-21>", "lines": [2, 21]}
#### 0 |
<line-1>inf = 10 ** 6</line-1>
<line-3>a = list(map(int, input().split()))</line-3>
<line-4>dist = [inf] * n</line-4>
<line-5>for i in range(len(a)):</line-5>
<line-6> if not a[i]:</line-6>
<line-7> dist[i] = 0</line-7>
<line-8> cur = 1</line-8>
<line-9> i1 = i</line-9>
<line-10> while i1... | {"code": "<line-2>n = int(input())</line-2>\n<line-19> cur += 1</line-19>", "lines": [2, 19]}
#### 0 |
<line-1>n=int(input())</line-1>
<line-3>m=len(s)</line-3>
<line-4>z=[[0,0]]</line-4>
<line-5>for c in s:</line-5>
<line-6> ind = z[-1][c]</line-6>
<line-7> z[-1][c] = len(z)</line-7>
<line-8> z.append(z[ind][:])</line-8>
<line-9>assert(len(z) == m+1)</line-9>
<line-10>z[m][0] = z[m][1] = m # make it sticky</line-10>
<l... | {"code": "<line-2>s=[c=='1' for c in input()]</line-2>\n<line-40> if s1 == m: res += v</line-40>", "lines": [2, 40]}
#### 0 |
<line-1>from math import *</line-1>
<line-3>a = []</line-3>
<line-4>n = int(input())</line-4>
<line-5>for i in range(n):</line-5>
<line-6> x,y = list(map(int,input().split()))</line-6>
<line-7> # calculate counterclockwise angle between (1,0) and this vector</line-7>
<line-8> t = acos(x/sqrt(x**2+y**2))</line-... | {"code": "<line-2># stores counterclockwise angle between vector (1,0) and each vector in a</line-2>\n<line-27> ans = b[i]</line-27>", "lines": [2, 27]}
#### 0 |
<line-1>d, k, a, b, t = list(map(int, input().split()))</line-1>
<line-2></line-2>
<line-4>t2 = d * a + ((d - 1) // k) * t</line-4>
<line-5>t3 = max(0, d - k) * b + min(k, d) * a</line-5>
<line-6>dd = d % k</line-6>
<line-7>d1 = d - dd</line-7>
<line-9></line-9>
<line-10>print(min([t1, t2, t3, t4]))</line-10> | {"code": "<line-3>t1 = d * b</line-3>\n<line-8>t4 = d1 * a + max(0, (d1 // k - 1) * t) + dd * b</line-8>", "lines": [3, 8]}
#### 0 |
<line-1>n, k = map(int, input().split())</line-1>
<line-3>i = 1</line-3>
<line-4>n1 = n</line-4>
<line-5>while i * i <= n:</line-5>
<line-6> if n % i == 0:</line-6>
<line-7> div.append(i)</line-7>
<line-8> div.append(n // i)</line-8>
<line-9> i += 1</line-9>
<line-10>div.sort()</line-10>
<line-11>mx... | {"code": "<line-2>div = []</line-2>\n<line-20> print(mx * (i + 1), end= \" \")</line-20>", "lines": [2, 20]}
#### 0 |
<line-1>ct=0</line-1>
<line-3>x=[0]*5</line-3>
<line-4>for i in range(1, b+1):</line-4>
<line-5> x[i%5]+=1</line-5>
<line-6>for i in range(1, a+1):</line-6>
<line-8>print(ct)</line-8> | {"code": "<line-2>a, b = list(map(int, input().split(' ')))</line-2>\n<line-7> ct+=x[(0-i)%5]</line-7>", "lines": [2, 7]}
#### 0 |
<line-1>N, X = list(map(int, input().split()))</line-1>
<line-3></line-3>
<line-4>dp = [[0]*4 for _ in range(N+1)]</line-4>
<line-5></line-5>
<line-6>for i in range(1, N+1):</line-6>
<line-7> dp[i][0] = max(dp[i-1][0] + A[i-1], 0)</line-7>
<line-8> dp[i][1] = max(dp[i-1][1] + A[i-1] * X, dp[i][0])</line-8>
<line-... | {"code": "<line-2>A = [int(a) for a in input().split()]</line-2>\n<line-10> dp[i][3] = max(dp[i-1][3], dp[i][2])</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>def main():</line-1>
<line-3> m, n, k = list(map(int, input().split()))</line-3>
<line-4> if n < m:</line-4>
<line-5> n, m = m, n</line-5>
<line-6> lo, hi = 1, k + 1</line-6>
<line-7> while lo + 1 < hi:</line-7>
<line-8> mid = (lo + hi) // 2</line-8>
<line-9> t = mid - 1</line-9... | {"code": "<line-2> from math import sqrt</line-2>\n<line-22> main()</line-22>", "lines": [2, 22]}
#### 0 |
<line-1>k = int(input())</line-1>
<line-2></line-2>
<line-4> print(k)</line-4>
<line-5>else:</line-5>
<line-6> num_arr = [9*(i+1)* 10**i for i in range(11)]</line-6>
<line-7></line-7>
<line-8> index = 0</line-8>
<line-9></line-9>
<line-10> while True:</line-10>
<line-11> if k<=num_arr[index]:</line-1... | {"code": "<line-3>if k<=9:</line-3>\n<line-24> string_num = str(10**(digit-1)+ num-1)</line-24>", "lines": [3, 24]}
#### 0 |
<line-1>n, m, r = map(int, input().split())</line-1>
<line-3>B = list(map(int, input().split()))</line-3>
<line-4>x = min(S)</line-4>
<line-5>y = max(B)</line-5>
<line-6>cnt = r % x</line-6>
<line-7>act = r // x</line-7>
<line-9>print(max(r, cnt))</line-9> | {"code": "<line-2>S = list(map(int, input().split()))</line-2>\n<line-8>cnt += act * y</line-8>", "lines": [2, 8]}
#### 0 |
<line-1>s = input()</line-1>
<line-3>if len(s)%2==0:</line-3>
<line-4> n = (len(s)-1)//2+1</line-4>
<line-5>else:</line-5>
<line-6> n = (len(s)-1)//2</line-6>
<line-7>for i in range(n, len(s)-1):</line-7>
<line-8> a = i</line-8>
<line-9> b = len(s)-i-1</line-9>
<line-10> if s[:a+1]==s[b:]:</line-10>
<lin... | {"code": "<line-2>t = 0</line-2>\n<line-15>if t==0:</line-15>", "lines": [2, 15]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>for r in range(100):</line-3>
<line-4> a = 1</line-4>
<line-5> b = 2**(r + 1) - 3</line-5>
<line-6> c = -2 * n</line-6>
<line-7> d = b * b - 4 * a * c</line-7>
<line-8> if d < 0:</line-8>
<line-9> continue</line-9>
<line-10> le = 0</line-10>
<line-11> ... | {"code": "<line-2>res = set()</line-2>\n<line-25>if not list(res):</line-25>", "lines": [2, 25]}
#### 0 |
<line-1>from collections import Counter</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>def main():</line-5>
<line-6> n, = r()</line-6>
<line-7> s = input()</line-7>
<line-8> cost = list(r())</line-8>
<line-9></line-9>
<line-10> ans = 0</line-10>
<line-11></line-11>
<line-12> cnt = Counter()</line-12>
<line-13></l... | {"code": "<line-3>r = lambda: list(map(int, input().split()))</line-3>\n<line-29>\tprint(sum(cost) - ans)</line-29>", "lines": [3, 29]}
#### 0 |
<line-1>w,m=map(int,input().split())</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>while(m>0 and bb):</line-5>
<line-6> x=m%w</line-6>
<line-7> if x==1:m-=1</line-7>
<line-8> elif x==w-1:m+=1</line-8>
<line-9> elif x!=0:bb=False</line-9>
<line-10> m//=w</line-10>
<line-11> </line-11>
<line-13>else:print("NO")</l... | {"code": "<line-3>bb=True</line-3>\n<line-12>if bb:print(\"YES\")</line-12>", "lines": [3, 12]}
#### 0 |
<line-1>from collections import defaultdict</line-1>
<line-2></line-2>
<line-4> as_bin = bin(n)[2:]</line-4>
<line-5> cnt = defaultdict(int)</line-5>
<line-6> cnt.update({i : 1 for i, b in enumerate(reversed(as_bin)) if b == '1'})</line-6>
<line-7> curr_len = len(cnt)</line-7>
<line-8> curr_pow = len(as_... | {"code": "<line-3>def solve(n, k):</line-3>\n<line-40> print('Yes')</line-40>", "lines": [3, 40]}
#### 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.