question stringlengths 0 30.2k | answer stringlengths 55 2.44k |
|---|---|
<line-1>n, t = list(map(int,input().split()))</line-1>
<line-3></line-3>
<line-4></line-4>
<line-5>for _ in range(t):</line-5>
<line-6> g[0][0] += 1.0</line-6>
<line-7> for i in range(n):</line-7>
<line-8> for j in range(i+1):</line-8>
<line-9> spill = max(0, g[i][j] - 1.0)</line-9>
<line-10> ... | {"code": "<line-2>g = [[0.0] * i for i in range(1,n+1)]</line-2>\n<line-21> cnt += 1</line-21>", "lines": [2, 21]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>if n <= 1:</line-3>
<line-4> print(-1)</line-4>
<line-5> return</line-5>
<line-6>dx = [1e9, -1e9]</line-6>
<line-7>dy = [1e9, -1e9]</line-7>
<line-8>for x, y in points:</line-8>
<line-9> dx[0] = min(dx[0], x)</line-9>
<line-10> dx[1] = max(dx[1], x)</line-10>
<line-11> dy[0] = ... | {"code": "<line-2>points = [[int(x) for x in input().split()] for _ in range(n)]</line-2>\n<line-16>else:</line-16>", "lines": [2, 16]}
#### 0 |
<line-1>'''input</line-1>
<line-3>4</line-3>
<line-4>2</line-4>
<line-5>'''</line-5>
<line-6></line-6>
<line-7>def list_input():</line-7>
<line-8> return list(map(int,input().split()))</line-8>
<line-9>def map_input():</line-9>
<line-10> return map(int,input().split())</line-10>
<line-11>def map_string():</line-1... | {"code": "<line-2>6</line-2>\n<line-27>b = int(input())</line-27>", "lines": [2, 27]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>p = input()</line-3>
<line-4>m = 0</line-4>
<line-5>suc = True</line-5>
<line-6>for i in range(n-1):</line-6>
<line-7> m = max(m,a[i])</line-7>
<line-8> if p[i] == '0' and m>(i+1):</line-8>
<line-9> suc = False</line-9>
<line-10> break</line-10>
<line-11>if ... | {"code": "<line-2>a = list(map(int,input().split()))</line-2>\n<line-13>else:</line-13>", "lines": [2, 13]}
#### 0 |
<line-1>seat = input()</line-1>
<line-3>col = seat[-1]</line-3>
<line-4>row = int(seat[:-1])</line-4>
<line-5>row -= 1</line-5>
<line-6></line-6>
<line-7>blocks_to_serve = row // 4</line-7>
<line-8>time = (6 * 2 + 4) * blocks_to_serve</line-8>
<line-9></line-9>
<line-10>if row % 2 == 1:</line-10>
<line-11> time += 6... | {"code": "<line-2>time_to = {'a': 4, 'f': 1, 'b': 5, 'e': 2, 'c': 6, 'd': 3}</line-2>\n<line-13>time += time_to[col]</line-13>", "lines": [2, 13]}
#### 0 |
<line-1>n, bx = list(map(int, input().split()))</line-1>
<line-3>x = 0</line-3>
<line-4>for i in range(n):</line-4>
<line-5> x *= bx</line-5>
<line-6> x += x1[i]</line-6>
<line-7></line-7>
<line-8>n, by = list(map(int, input().split()))</line-8>
<line-9>y1 = list(map(int, input().split()))</line-9>
<line-10>y = 0</line... | {"code": "<line-2>x1 = list(map(int, input().split()))</line-2>\n<line-19>else:</line-19>", "lines": [2, 19]}
#### 0 |
<line-1>from math import *</line-1>
<line-3>if n==3:</line-3>
<line-4> li=list(map(int,input().split()))</line-4>
<line-5> ans=0</line-5>
<line-6> flag=0</line-6>
<line-7> for i in li:</line-7>
<line-8> ans^=i</line-8>
<line-9> if ans==0:</line-9>
<line-10> print("BitAryo")</line-10>
<line-... | {"code": "<line-2>n=int(input())</line-2>\n<line-31> else:</line-31>", "lines": [2, 31]}
#### 0 |
<line-1>n,k=map(int,input().split())</line-1>
<line-3>pf=[]</line-3>
<line-4>needed=[]</line-4>
<line-5>for i in range(2,40000):</line-5>
<line-6> if k%i==0:</line-6>
<line-7> pf.append(i)</line-7>
<line-8> c=0</line-8>
<line-9> while k%i==0:</line-9>
<line-10> k//=i</line-10>
<line-11> c+=1</line-11>
<line-12> ... | {"code": "<line-2>l=list(map(int,input().split()))</line-2>\n<line-61>\t\tbreak</line-61>", "lines": [2, 61]}
#### 0 |
<line-1>alpha = [chr(ord('a')+i) for i in range(26)]</line-1>
<line-3>s = input()</line-3>
<line-5></line-5>
<line-6>print('YES' if max(arr) <= k else 'NO')</line-6> | {"code": "<line-2>n,k = list(map(int,input().split()))</line-2>\n<line-4>arr = [s.count(alpha[i]) for i in range(26)]</line-4>", "lines": [2, 4]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>mn = min(A)</line-3>
<line-4></line-4>
<line-5>I = [i for i in range(len(A)) if A[i] == mn]</line-5>
<line-7>print(mindiff)</line-7> | {"code": "<line-2>A = [int(x) for x in input().split()]</line-2>\n<line-6>mindiff = min(I[i]-I[i-1] for i in range(1,len(I)))</line-6>", "lines": [2, 6]}
#### 0 |
<line-1>from fractions import gcd</line-1>
<line-2></line-2>
<line-4>per = w*b//gcd(w,b)</line-4>
<line-5>can = (t//per+1)*min(w,b)-1</line-5>
<line-6>if t%per<min(w,b):</line-6>
<line-7> can-=min(w,b)</line-7>
<line-8> can+=t%per+1</line-8>
<line-9>g = gcd(can,t)</line-9>
<line-10>can//=g</line-10>
<line-12>prin... | {"code": "<line-3>t,w,b = map(int,input().split())</line-3>\n<line-11>t//=g</line-11>", "lines": [3, 11]}
#### 0 |
<line-1>x, y, z = map(int, input().split())</line-1>
<line-3> if x == y:</line-3>
<line-4> print('0')</line-4>
<line-5> elif x > y:</line-5>
<line-6> print('+')</line-6>
<line-7> else:</line-7>
<line-8> print('-')</line-8>
<line-9>else:</line-9>
<line-10> if x > y + z:</line-10>
<line-1... | {"code": "<line-2>if z == 0:</line-2>\n<line-14> else:</line-14>", "lines": [2, 14]}
#### 0 |
<line-1># </line-1>
<line-3></line-3>
<line-4>sys.setrecursionlimit(1000000)</line-4>
<line-5>def getIntList():</line-5>
<line-6> return list(map(int, input().split())) </line-6>
<line-7></line-7>
<line-8>try :</line-8>
<line-9> #raise ModuleNotFoundError</line-9>
<line-10> import numpy</line-10>
<line... | {"code": "<line-2>import collections, atexit, math, sys, bisect </line-2>\n<line-95> down = mid</line-95>", "lines": [2, 95]}
#### 0 |
<line-1>t=int(input())</line-1>
<line-3> n,x=map(int,input().split())</line-3>
<line-4> s=input()</line-4>
<line-5> L=[0]</line-5>
<line-6> for i in s:</line-6>
<line-7> if i=='0':L.append(L[-1]+1)</line-7>
<line-8> else:L.append(L[-1]-1)</line-8>
<line-9> L.pop(0)</line-9>
<line-10> k=L... | {"code": "<line-2>for i in ' '*t:</line-2>\n<line-23> if i==x:c=-1</line-23>", "lines": [2, 23]}
#### 0 |
<line-1>s = input().split()</line-1>
<line-3>s = s[0]</line-3>
<line-4>if s.count('0') < k:</line-4>
<line-5> if s.count('0') > 0:</line-5>
<line-6> print(len(s) - 1)</line-6>
<line-7> else:</line-7>
<line-8> print(len(s))</line-8>
<line-9> return</line-9>
<line-10>have = 0</line-10>
<line-11>its... | {"code": "<line-2>k = int(s[1])</line-2>\n<line-17> print(its - have)</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>n, m, k, x, y = list(map(int, input().split()))</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>onebig = (2*n-2)*m or m</line-5>
<line-6></line-6>
<line-7>oo = k // onebig</line-7>
<line-8></line-8>
<line-9>for i in range(n):</line-9>
<line-10> for j in range(m):</line-10>
<line-11> if i == 0 or ... | {"code": "<line-3>ans = [[0] * m for x in range(n)]</line-3>\n<line-31>_ans = ans[x-1][y-1]</line-31>", "lines": [3, 31]}
#### 0 |
<line-1>turns = int(input())</line-1>
<line-3>s1 = input()</line-3>
<line-4>s2 = input()</line-4>
<line-5></line-5>
<line-6>d0 = dict()</line-6>
<line-7>d1 = dict()</line-7>
<line-8>d2 = dict()</line-8>
<line-9></line-9>
<line-10>alphabet = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz'</line-10>
<line-11>for c... | {"code": "<line-2>s0 = input()</line-2>\n<line-52>else:</line-52>", "lines": [2, 52]}
#### 0 |
<line-1>read = lambda: map(int, input().split())</line-1>
<line-3>cur = 0</line-3>
<line-4>cnt = 0</line-4>
<line-5>while cur < c:</line-5>
<line-6> cur = max(0, cur - l)</line-6>
<line-7> cur += min(v1, v0 + a * cnt)</line-7>
<line-9>print(cnt)</line-9> | {"code": "<line-2>c, v0, v1, a, l = read()</line-2>\n<line-8> cnt += 1</line-8>", "lines": [2, 8]}
#### 0 |
<line-1>import math</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>def prime(p):</line-5>
<line-6> if p == 1:</line-6>
<line-7> return False</line-7>
<line-8> fl=True</line-8>
<line-9> for i in range(2,math.ceil(p**0.5) + 1):</line-9>
<line-10> if p % i == 0:</line-10>
<line-11> ... | {"code": "<line-3>n=int(input())</line-3>\n<line-40> break</line-40>", "lines": [3, 40]}
#### 0 |
<line-1>n, m = list(map(int, input().split()))</line-1>
<line-3>ans = 0</line-3>
<line-4>for i in range(n):</line-4>
<line-5> s = input()</line-5>
<line-6> ans += s.count('*')</line-6>
<line-7> p.append(s)</line-7>
<line-8>dp = []</line-8>
<line-9>for i in range(n):</line-9>
<line-10> dp.append([0] * m)</li... | {"code": "<line-2>p = []</line-2>\n<line-32>if not f:</line-32>", "lines": [2, 32]}
#### 0 |
<line-2></line-2>
<line-3>k = n%m</line-3>
<line-4>print(min(k*b, (m - k)*a))</line-4> | {"code": "<line-1>n, m, a, b = list(map(int, input().split()))</line-1>", "lines": [1]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>res = 0</line-3>
<line-4>new_a = []</line-4>
<line-5>for i in range(n):</line-5>
<line-6> if a[i] % 2 == 0:</line-6>
<line-7> if a[i] > 0:</line-7>
<line-8> res += a[i]</line-8>
<line-9> else:</line-9>
<line-10> new_a.append(a[i])</line-10>
<line-... | {"code": "<line-2>a = list(map(int, input().split()))</line-2>\n<line-21> break</line-21>", "lines": [2, 21]}
#### 0 |
<line-1>from math import factorial</line-1>
<line-2></line-2>
<line-3></line-3>
<line-5> if n == 1:</line-5>
<line-6> yield [0]</line-6>
<line-7> yield [1]</line-7>
<line-8> else:</line-8>
<line-9> for p in lol(n - 1):</line-9>
<line-10> p.append(0)</line-10>
<line-11> y... | {"code": "<line-4>def lol(n):</line-4>\n<line-79> cnt %= M</line-79>", "lines": [4, 79]}
#### 0 |
<line-1>big = 100010</line-1>
<line-3> mu = [1]*big</line-3>
<line-4> mu[0] = 0</line-4>
<line-5> P = [True]*big</line-5>
<line-6> P[0] = P[1] = False</line-6>
<line-7> for i in range(2,big):</line-7>
<line-8> if P[i]:</line-8>
<line-9> j = i</line-9>
<line-10> while j<big:</... | {"code": "<line-2>def gen_mu():</line-2>\n<line-31> s += (-mu[i])*(p)*mod_inv(1-p)</line-31>", "lines": [2, 31]}
#### 0 |
<line-1>from math import sqrt</line-1>
<line-3>l, r, x, y = list(map(int, input().split()))</line-3>
<line-4>if y % x != 0:</line-4>
<line-5> print(0)</line-5>
<line-6> return</line-6>
<line-7>lo = (l + x - 1) // x</line-7>
<line-8>hi = r // x</line-8>
<line-9>p = y // x</line-9>
<line-10>s = 0</line-10>
<line-11... | {"code": "<line-2>from fractions import gcd</line-2>\n<line-17> k1 += 1</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>from math import gcd</line-1>
<line-3>if b < a:</line-3>
<line-4> a, b = b, a</line-4>
<line-5>if a == b:</line-5>
<line-6> print(0)</line-6>
<line-7> return</line-7>
<line-8>c = b - a</line-8>
<line-9>i = 1</line-9>
<line-10>ans = a * b // gcd(a, b)</line-10>
<line-11></line-11>
<line-12>def get(x):</... | {"code": "<line-2>a, b = list(map(int, input().split()))</line-2>\n<line-32> i += 1</line-32>", "lines": [2, 32]}
#### 0 |
<line-1>n, k = list(map(int, input().split()))</line-1>
<line-3>s = sum(a)</line-3>
<line-4>ans = 0</line-4>
<line-5>c = k - 0.5</line-5>
<line-6>while s / n < c:</line-6>
<line-7> s += k</line-7>
<line-8> n += 1</line-8>
<line-10>print(ans)</line-10> | {"code": "<line-2>a = list(map(int, input().split()))</line-2>\n<line-9> ans += 1</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>n=int(input())</line-1>
<line-3>pos=0</line-3>
<line-4>neg=0</line-4>
<line-5>for a in ar:</line-5>
<line-6> if(a>0):pos+=1</line-6>
<line-7> elif a<0:neg+=1</line-7>
<line-8>if(pos*2>=n):</line-8>
<line-9> print(1)</line-9>
<line-10>elif neg*2>=n:</line-10>
<line-11> print(-1)</line-11>
<line-13> ... | {"code": "<line-2>ar=list(map(int,input().split()))</line-2>\n<line-12>else:</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>from sys import stdin as cin</line-1>
<line-3></line-3>
<line-4>def main():</line-4>
<line-5> n = int(cin.readline())</line-5>
<line-6> o = 0</line-6>
<line-7> for x in range(9, 0, -1):</line-7>
<line-8> if 10 ** x // 2 <= n:</line-8>
<line-9> ##print(x)</line-9>
<line-10> ... | {"code": "<line-2>from sys import stdout as cout</line-2>\n<line-16> print(n * (n - 1) // 2)</line-16>", "lines": [2, 16]}
#### 0 |
<line-1>a,b=list(map(int,input().split()))</line-1>
<line-3>e=a*b</line-3>
<line-4>f=c*d</line-4>
<line-5>n=0</line-5>
<line-6>while e%2==0:e=e//2</line-6>
<line-7>while e%3==0:e=e//3</line-7>
<line-8>while f%2==0:f=f//2</line-8>
<line-9>while f%3==0:f=f//3</line-9>
<line-10>if e!=f:print("-1")</line-10>
<line-11>else:... | {"code": "<line-2>c,d=list(map(int,input().split()))</line-2>\n<line-55> print(a,b)</line-55>", "lines": [2, 55]}
#### 0 |
<line-1>a, b, x, y = map(int, input().split())</line-1>
<line-3> if b >= y:</line-3>
<line-4> print('Vasiliy')</line-4>
<line-5> else:</line-5>
<line-6> z = y - b</line-6>
<line-7> t = max(x - z, 0)</line-7>
<line-8> if a - z <= t:</line-8>
<line-9> print('Polycarp')</line-9... | {"code": "<line-2>if a >= x:</line-2>\n<line-20> else:</line-20>", "lines": [2, 20]}
#### 0 |
<line-1>import sys</line-1>
<line-3>a, b = list(map(int, input().split()))</line-3>
<line-4>a -= 1</line-4>
<line-5>b -= 1</line-5>
<line-6>ctr = 1</line-6>
<line-7>for i in range(arr[a] - 1):</line-7>
<line-8> b += 1</line-8>
<line-9> if (b == 7):</line-9>
<line-10> b = 0</line-10>
<line-12>print(ctr)</li... | {"code": "<line-2>arr = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]</line-2>\n<line-11> ctr += 1</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>def zero(strx):</line-1>
<line-3> str2 = list(strx)</line-3>
<line-4> for i in range(1, len(str2)):</line-4>
<line-5> str3 = str2[:]</line-5>
<line-6> str3[i] = '0'</line-6>
<line-7> k.append(''.join(str3))</line-7>
<line-8> return k</line-8>
<line-9>a = []</line-9>
<line-10>for i ... | {"code": "<line-2> k = []</line-2>\n<line-17> ct+=1</line-17>", "lines": [2, 17]}
#### 0 |
<line-2>print(max((i+1)*(n-i)for i in range(n)))</line-2> | {"code": "<line-1>n=int(input())</line-1>", "lines": [1]}
#### 0 |
<line-1>fact = [ 1 ]</line-1>
<line-3> fact.append( fact[ i - 1 ] * i )</line-3>
<line-4></line-4>
<line-5>from collections import defaultdict</line-5>
<line-6></line-6>
<line-7>N, K, S = list(map( int, input().split() ))</line-7>
<line-8>A = list( map( int, input().split() ) )</line-8>
<line-9></line-9>
<line-10>ldp ... | {"code": "<line-2>for i in range( 1, 20, 1 ):</line-2>\n<line-38> ans += ldp[ N // 2 & 1 ][ i ][ key ] * rdp[ N - N // 2 & 1 ][ j ][ S - key ]</line-38>", "lines": [2, 38]}
#### 0 |
<line-1>t = int(input())</line-1>
<line-3> n,k = list(map(int,input().split()))</line-3>
<line-4> a = list(map(int,input().split()))</line-4>
<line-5> for i in range(60, -1, -1):</line-5>
<line-6> m = k ** i</line-6>
<line-7> for j in range(n):</line-7>
<line-8> if a[j] >= m:</line-8>
... | {"code": "<line-2>for _ in range(t):</line-2>\n<line-13> else:</line-13>", "lines": [2, 13]}
#### 0 |
<line-1>a, b, c = map(int, input().split())</line-1>
<line-3>p = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]</line-3>
<line-4>t = [{} for i in range(101)]</line-4>
<line-5>ans = {}</line-5>
<line-6>for i in p:</line-6>
<line-7> j = i</line-7>
<line-8> m = 1</li... | {"code": "<line-2>d = 1073741824</line-2>\n<line-29> s += y</line-29>", "lines": [2, 29]}
#### 0 |
<line-1>a, b, c, d = input(), input(), input(), input()</line-1>
<line-3>x = "X"</line-3>
<line-4>for i in range(4):</line-4>
<line-5> if a[i] == x:</line-5>
<line-6> a = a[:i] + a[i + 1:]</line-6>
<line-7> break</line-7>
<line-8>c = c + d[::-1]</line-8>
<line-9></line-9>
<line-10>for i in range(4):</l... | {"code": "<line-2>a = a + b[::-1]</line-2>\n<line-21>else:</line-21>", "lines": [2, 21]}
#### 0 |
<line-1>n=int(input())</line-1>
<line-3>pw=[1]</line-3>
<line-4>last=1</line-4>
<line-5>for i in range(70):</line-5>
<line-6> if (last>1e19):</line-6>
<line-7> break</line-7>
<line-8> pw.append(last*n)</line-8>
<line-9> last=last*n</line-9>
<line-10>dp=[1e19]*100</line-10>
<line-11>for i in range(100):<... | {"code": "<line-2>s=input()</line-2>\n<line-22> dp[j][power+1]=min(dp[j][power+1],dp[i][power]+int(cur)*pw[power])</line-22>", "lines": [2, 22]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>i = 0</line-3>
<line-4>a = 0</line-4>
<line-5>while i < n and L[i] > a:</line-5>
<line-6> a = L[i]</line-6>
<line-7> i += 1</line-7>
<line-8>while i < n and L[i] == a:</line-8>
<line-9> i += 1</line-9>
<line-10>while i < n and L[i] < a:</line-10>
<line-11> a = L[i]<... | {"code": "<line-2>L = list(map(int, input().split()))</line-2>\n<line-15>else:</line-15>", "lines": [2, 15]}
#### 0 |
<line-1>def gg(n,lol):</line-1>
<line-3> cur = 1</line-3>
<line-4> lol2 = lol</line-4>
<line-5> while(2*lol+1<=n):</line-5>
<line-6> cur *= 2</line-6>
<line-7> ans += cur</line-7>
<line-8> lol = 2*lol+1</line-8>
<line-9> lol2 *= 2</line-9>
<line-10> if lol2*2 <= n:</line-10>
<line-11> ans += n-lol2*2+1 </line-11>
... | {"code": "<line-2>\tans = 0</line-2>\n<line-29>else:</line-29>", "lines": [2, 29]}
#### 0 |
<line-1>def INV(a, m) :</line-1>
<line-3> y = 0</line-3>
<line-4> x = 1 </line-4>
<line-5> if (m == 1) :</line-5>
<line-6> return 0 </line-6>
<line-7> while (a > 1) : </line-7>
<line-8> q = a // m </line-8>
<line-9> t = m </line-9>
<line-10> m = a % m</line-10>
<line-11> a... | {"code": "<line-2> m0 = m</line-2>\n<line-72> return 0</line-72>", "lines": [2, 72]}
#### 0 |
<line-1>a, b = [int(i) for i in input().split()]</line-1>
<line-3>e, f = [int(i) for i in input().split()]</line-3>
<line-4>if c+e <=a and max(d,f) <=b:</line-4>
<line-5> print("YES")</line-5>
<line-6>elif c+e <=b and max(d,f) <=a:</line-6>
<line-7> print("YES")</line-7>
<line-8>elif c+f <=a and max(d,e) <=b:</li... | {"code": "<line-2>c, d = [int(i) for i in input().split()]</line-2>\n<line-20>else:</line-20>", "lines": [2, 20]}
#### 0 |
<line-1>def main():</line-1>
<line-3> a = set(map(int, input().split()))</line-3>
<line-4> if abs(b1) > l:</line-4>
<line-5> print(0)</line-5>
<line-6> else:</line-6>
<line-7> if b1 == 0:</line-7>
<line-8> if 0 in a:</line-8>
<line-9> print(0)</line-9>
<line-10> ... | {"code": "<line-2> (b1, q, l, m) = list(map(int, input().split()))</line-2>\n<line-45> main()</line-45>", "lines": [2, 45]}
#### 0 |
<line-1>3</line-1>
<line-2></line-2>
<line-4>import sys</line-4>
<line-5>def return:</line-5>
<line-6> print(-1)</line-6>
<line-7> return</line-7>
<line-8></line-8>
<line-9>n, m = readln()</line-9>
<line-10>mon = [list(input()) for _ in range(n)]</line-10>
<line-11>hor = [i for i in range(n) if mon[i] != ['.'] * ... | {"code": "<line-3>def readln(): return list(map(int, input().split()))</line-3>\n<line-68> mon[maxi][j] = '+'</line-68>", "lines": [3, 68]}
#### 0 |
<line-1>def egcd(a, b):</line-1>
<line-3> while a != 0:</line-3>
<line-4> q, r = b//a, b%a</line-4>
<line-5> m, n = x-u*q, y-v*q</line-5>
<line-6> b,a, x,y, u,v = a,r, u,v, m,n</line-6>
<line-7> gcd = b</line-7>
<line-8> return gcd, x, y</line-8>
<line-9></line-9>
<line-10></line-10>
<line... | {"code": "<line-2> x,y, u,v = 0,1, 1,0</line-2>\n<line-54> print(\"NO\")</line-54>", "lines": [2, 54]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3> print('zero')</line-3>
<line-4>elif n == 1:</line-4>
<line-5> print('one')</line-5>
<line-6>elif n == 2:</line-6>
<line-7> print('two')</line-7>
<line-8>elif n == 3:</line-8>
<line-9> print('three')</line-9>
<line-10>elif n == 4:</line-10>
<line-11> print('four')</line-11>
<li... | {"code": "<line-2>if n == 0:</line-2>\n<line-77>\t\tres += '-nine'</line-77>", "lines": [2, 77]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>mx = 1</line-3>
<line-4>p = 1</line-4>
<line-5>for i in range(1, n + 2):</line-5>
<line-6> if a[i] == a[i - 1] + 1:</line-6>
<line-7> p += 1</line-7>
<line-8> mx = max(p, mx)</line-8>
<line-9> else:</line-9>
<line-11>print(max(0, mx - 2))</line-11> | {"code": "<line-2>a = [0] + list(map(int, input().split())) + [1001]</line-2>\n<line-10> p = 1</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>def main():</line-1>
<line-3> a = list(int(x) for x in input().split())</line-3>
<line-4> s = sum(a)</line-4>
<line-5> t = 0</line-5>
<line-6> for i in range(n):</line-6>
<line-7> t += a[i]</line-7>
<line-8> if 2 * t >= s:</line-8>
<line-9> print(i + 1)</line-9>
<line-11></l... | {"code": "<line-2> n = int(input())</line-2>\n<line-10> return</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>n=int(input())</line-1>
<line-3>for i in range(n):</line-3>
<line-4> for j in range(n):</line-4>
<line-5> graph[0][(i,j)]=[(k,j) for k in range(n)]+[(i,k) for k in range(n)]</line-5>
<line-6> graph[0][(i,j)].remove((i,j))</line-6>
<line-7> graph[0][(i,j)].remove((i,j))</line-7>
<line-8> ... | {"code": "<line-2>graph=[{},{},{}]</line-2>\n<line-54>a=min(best)</line-54>", "lines": [2, 54]}
#### 0 |
<line-1>n, m, k = map(int, input().split())</line-1>
<line-3>a -= 1</line-3>
<line-4>b -= 1</line-4>
<line-5>def p(x):</line-5>
<line-6> return x // (m * k)</line-6>
<line-7>def e(x):</line-7>
<line-8> return (x - p(x) * m * k) // k</line-8>
<line-9>def lift(x):</line-9>
<line-10> return min(5 * x, 10 + x)</line-10>
<l... | {"code": "<line-2>a, b = map(int, input().split())</line-2>\n<line-15>else:</line-15>", "lines": [2, 15]}
#### 0 |
<line-1>s = input()</line-1>
<line-3>while i < len(s) and s[i] == '0':</line-3>
<line-4> i += 1</line-4>
<line-5>cnt = 0</line-5>
<line-6>while i < len(s):</line-6>
<line-7> if s[i] == '0':</line-7>
<line-8> cnt += 1</line-8>
<line-9> i += 1</line-9>
<line-10></line-10>
<line-11>if cnt >= 6:</line-11>
<... | {"code": "<line-2>i = 0</line-2>\n<line-13>else:</line-13>", "lines": [2, 13]}
#### 0 |
<line-1>s = list(input())</line-1>
<line-3>ind_t = 0</line-3>
<line-4>ind_s = 0</line-4>
<line-5>while ind_s < len(s) and ind_t < 26:</line-5>
<line-6> if ord(s[ind_s]) <= ord(target[ind_t]):</line-6>
<line-7> s[ind_s] = target[ind_t]</line-7>
<line-8> ind_t += 1</line-8>
<line-9> ind_s += 1</line-9>
<line-10... | {"code": "<line-2>target = 'abcdefghijklmnopqrstuvwxyz'</line-2>\n<line-14>else:</line-14>", "lines": [2, 14]}
#### 0 |
<line-1>import heapq as hq</line-1>
<line-3></line-3>
<line-4>import math</line-4>
<line-5>n,m,r, k= input().split()</line-5>
<line-6>N = int(n)</line-6>
<line-7>M = int(m)</line-7>
<line-8>R = int(r)</line-8>
<line-9>K = int(k)</line-9>
<line-10></line-10>
<line-11>q = PriorityQueue()</line-11>
<line-12></line-12>
<li... | {"code": "<line-2>from queue import PriorityQueue</line-2>\n<line-70> print(i)</line-70>", "lines": [2, 70]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>if n == 1:</line-3>
<line-4> if A[0] >= 0:</line-4>
<line-5> print(A[0])</line-5>
<line-6> else:</line-6>
<line-7> print(-A[0]-1)</line-7>
<line-8> return</line-8>
<line-9>for i in range(n):</line-9>
<line-10> if A[i] < 0:</line-10>
<line-11> pa... | {"code": "<line-2>A = list(map(int, input().split()))</line-2>\n<line-23>A[indmim] = -A[indmim]-1</line-23>", "lines": [2, 23]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>def factorization(n):</line-4>
<line-5> res = []</line-5>
<line-6> limit = math.ceil(math.sqrt(n))</line-6>
<line-7> p = 2</line-7>
<line-8> cnt = 0</line-8>
<line-9></line-9>
<line-10> while n % p == 0:</line-10>
<line-11> cnt += 1</line-11>
<... | {"code": "<line-2>import math</line-2>\n<line-66> ans = n_div[k - 1]</line-66>", "lines": [2, 66]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3></line-3>
<line-4>import itertools</line-4>
<line-5>for x in range(1,10**n):</line-5>
<line-6> good = False</line-6>
<line-7> s = str(x)</line-7>
<line-8> for p in itertools.permutations(a, len(s)):</line-8>
<line-9> good |= all([int(s[i]) in v for i, v in enumerate(p)])<... | {"code": "<line-2>a = sorted([list(map(int, input().split())) for i in range(n)])</line-2>\n<line-12> return</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>def main():</line-1>
<line-3> num_2 = 0</line-3>
<line-4> num_5 = 0</line-4>
<line-5> x = n</line-5>
<line-6> while (x % 2 == 0):</line-6>
<line-7> num_2 += 1</line-7>
<line-8> x //= 2</line-8>
<line-9> </line-9>
<line-10> while (x % 5 == 0):</line-10>
<line-11> num_5 += 1</line-11>
<line-12> x //= 5</line... | {"code": "<line-2>\tn, k = map(int, input().split())</line-2>\n<line-15>\tprint(n * 5 ** num_5 * 2 ** num_2)</line-15>", "lines": [2, 15]}
#### 0 |
<line-1>n, m = map(int, input().split())</line-1>
<line-3>B = [[0] * m for _ in range(n)]</line-3>
<line-4>ans = []</line-4>
<line-5>for i in range(n - 1):</line-5>
<line-6> for j in range(m - 1):</line-6>
<line-7> if A[i][j] == 1 and A[i + 1][j] == 1 and A[i][j + 1] == 1 and A[i + 1][j + 1] == 1:</line-7>
<l... | {"code": "<line-2>A = [list(map(int, input().split())) for _ in range(n)]</line-2>\n<line-17>else:</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>r, s, p = list(map(int, input().split()))</line-1>
<line-3>dp[r][s][p] = 1</line-3>
<line-4>def nCk(n, k):</line-4>
<line-5> if n <= k:</line-5>
<line-6> return 1</line-6>
<line-7> res = 1</line-7>
<line-8> for i in range(k):</line-8>
<line-9> res *= n-i</line-9>
<line-10> for i in ran... | {"code": "<line-2>dp = [[[0] * (p+1) for _ in range(s+1)] for _ in range(r+1)]</line-2>\n<line-30>p_sum = sum([dp[0][0][pi] for pi in range(p+1)])</line-30>", "lines": [2, 30]}
#### 0 |
<line-1>read = lambda: list(map(int, input().split()))</line-1>
<line-3>R = min(r1, r2)</line-3>
<line-4>L = max(l1, l2)</line-4>
<line-5>ans = max(R - L + 1, 0)</line-5>
<line-7>print(ans)</line-7> | {"code": "<line-2>l1, r1, l2, r2, k = read()</line-2>\n<line-6>if L <= k <= R: ans = max(ans - 1, 0)</line-6>", "lines": [2, 6]}
#### 0 |
<line-1>#写経</line-1>
<line-3>import sys</line-3>
<line-4>sys.setrecursionlimit(10**9)</line-4>
<line-5>input = sys.stdin.readline</line-5>
<line-6>from bisect import bisect_left, bisect_right</line-6>
<line-7>INF = 10 **18</line-7>
<line-8></line-8>
<line-9>def resolve():</line-9>
<line-10> n, m = map(int, input().s... | {"code": "<line-2>#https://atcoder.jp/contests/abc168/submissions/14421546</line-2>\n<line-67> print(ans)</line-67>", "lines": [2, 67]}
#### 0 |
<line-1>t, s, x = list(map(int, input().split()))</line-1>
<line-3>if x - 1 > t and (x - 1 - t) % s == 0:</line-3>
<line-4> f = True</line-4>
<line-5>if x >= t and (x - t) % s == 0:</line-5>
<line-6> f = True</line-6>
<line-7>if f:</line-7>
<line-8> print('YES')</line-8>
<line-10> print('NO')</line-10> | {"code": "<line-2>f = False</line-2>\n<line-9>else:</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>for i in range(1, n + 1):</line-3>
<line-4> l, r = list(map(int, input().split()))</line-4>
<line-5> a.append([l, -r, i])</line-5>
<line-6>a.sort()</line-6>
<line-7>hh = a[0][1]</line-7>
<line-8>wahh = max(-1, a[0][2])</line-8>
<line-9>for i in range(1, n):</line-9>
<line... | {"code": "<line-2>a = []</line-2>\n<line-15> wahh = a[i][2]</line-15>", "lines": [2, 15]}
#### 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>if n%4: print("===")</line-7>
<line-8>else:</line-8>
<line-9> t=input().strip()</line-9>
<line-10> a=[n//4]*4</line-10>
<line-11> for i in t:</line-11>
<line-12> ... | {"code": "<line-3>#sys.stdin=open(\"data.txt\")</line-3>\n<line-33> else: out.append(i)</line-33>", "lines": [3, 33]}
#### 0 |
<line-1>def chk(l):</line-1>
<line-3> for j in range(2):</line-3>
<line-4> if l[i][j]==l[i][j+1]==l[i][j+2]=='x':</line-4>
<line-5> return True</line-5>
<line-6> for i in range(2):</line-6>
<line-7> for j in range(4):</line-7>
<line-8> if l[i][j]==l[i+1][j]==l[i+2][j]=='x':</line-8>
<line-9> return True</li... | {"code": "<line-2>\tfor i in range(4):</line-2>\n<line-27>\t\ta[i][j]='.'</line-27>", "lines": [2, 27]}
#### 0 |
<line-1>def solve(n,a):</line-1>
<line-3> for i in range(n):</line-3>
<line-4> tot+=a[i]</line-4>
<line-5> diffs = [] #alla suffix - prefix diffs[i]=prefix-suffix om delas innan element i</line-5>
<line-6> diffs.append(-tot)</line-6>
<line-7> for i in range(n):</line-7>
<line-8> tot-=2*a[i]</l... | {"code": "<line-2> tot=0</line-2>\n<line-40> a[i]=int(a[i])</line-40>", "lines": [2, 40]}
#### 0 |
<line-1>import sys</line-1>
<line-2></line-2>
<line-4>a = [int(x) for x in input().split()]</line-4>
<line-5>b = [int(x) for x in input().split()]</line-5>
<line-6></line-6>
<line-7>b.sort(reverse=True)</line-7>
<line-8></line-8>
<line-9>res = []</line-9>
<line-10>cur_b = 0</line-10>
<line-11>for a_i in a:</line-11>
<l... | {"code": "<line-3>n, k = list(map(int, input().split()))</line-3>\n<line-20>else:</line-20>", "lines": [3, 20]}
#### 0 |
<line-1>x,y,z = list(map(int,input().split()))</line-1>
<line-3>if a < x:</line-3>
<line-4> print("NO")</line-4>
<line-5> return</line-5>
<line-6>x -= a</line-6>
<line-7>y += x</line-7>
<line-8>if b < y:</line-8>
<line-9> print("NO")</line-9>
<line-10> return</line-10>
<line-11>y -= b</line-11>
<line-12>z +... | {"code": "<line-2>a,b,c = list(map(int,input().split()))</line-2>\n<line-15> return</line-15>", "lines": [2, 15]}
#### 0 |
<line-1>lanes = []</line-1>
<line-2></line-2>
<line-4> lanes.append(list(map(int, input().split())))</line-4>
<line-5></line-5>
<line-6>lanes.extend(lanes)</line-6>
<line-7></line-7>
<line-8>for i in range(4):</line-8>
<line-9> ln = lanes[i]</line-9>
<line-10> if (ln[3] and (ln[0] or ln[1] or ln[2])) or \</lin... | {"code": "<line-3>for i in range(4):</line-3>\n<line-16>else:</line-16>", "lines": [3, 16]}
#### 0 |
<line-1># A</line-1>
<line-2></line-2>
<line-4>l = list(map(int, list(input())))</line-4>
<line-5></line-5>
<line-6>if (1 in l or 4 in l or 7 in l or 0 in l) and (1 in l or 2 in l or 3 in l) and (3 in l or 6 in l or 9 in l or 0 in l) and (7 in l or 0 in l or 9 in l):</line-6>
<line-7> print("YES")</line-7>
<line-9> ... | {"code": "<line-3>input()</line-3>\n<line-8>else:</line-8>", "lines": [3, 8]}
#### 0 |
<line-1>n, f = list(map(int, input().split(' ')))</line-1>
<line-3>wow = []</line-3>
<line-4>for a0 in range(n):</line-4>
<line-5> k, l = list(map(int, input().split(' ')))</line-5>
<line-6> res += min(k, l)</line-6>
<line-7> wow.append(min(2*k, l) - min(k, l))</line-7>
<line-8>wow = sorted(wow)</line-8>
<line... | {"code": "<line-2>res = 0</line-2>\n<line-12> i -= 1</line-12>", "lines": [2, 12]}
#### 0 |
<line-1># You lost the game.</line-1>
<line-3>r = 0</line-3>
<line-4>for i in range(min(k,n//2)):</line-4>
<line-6>print(r)</line-6> | {"code": "<line-2>n,k = map(int, input().split())</line-2>\n<line-5> r += (n-2*i-1) + (n-2*i-2)</line-5>", "lines": [2, 5]}
#### 0 |
<line-1>n, m, k, l = map(int, input().split())</line-1>
<line-3>if cnt * m > n:</line-3>
<line-4> print(-1)</line-4>
<line-6> print(cnt)</line-6> | {"code": "<line-2>cnt = (k + l + m - 1) // m</line-2>\n<line-5>else:</line-5>", "lines": [2, 5]}
#### 0 |
<line-1>h, w = map(int, input().split())</line-1>
<line-3>for i in range(h):</line-3>
<line-4> row = str(input())</line-4>
<line-5> for j in range(w):</line-5>
<line-6> if row[j] == 'B':</line-6>
<line-7> x0, y0, x1, y1, c = min(x0, i), min(y0, j), max(x1, i), max(y1, j), c + 1</line-7>
<line-8>ln = max(x1 - ... | {"code": "<line-2>x0, y0, x1, y1, c = 1000, 1000, -1, -1, 0</line-2>\n<line-13>else:</line-13>", "lines": [2, 13]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>b = list(map(int, input().split()))</line-3>
<line-4></line-4>
<line-5>c = sum(a)</line-5>
<line-6>d = sum(b)</line-6>
<line-7></line-7>
<line-8>if c >= d:</line-8>
<line-9> print('Yes')</line-9>
<line-11> print('No')</line-11> | {"code": "<line-2>a = list(map(int, input().split()))</line-2>\n<line-10>else:</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>mn = 360</line-3>
<line-4>for i in range(n):</line-4>
<line-5> x = 0</line-5>
<line-6> for j in range(i, n):</line-6>
<line-7> x += a[j]</line-7>
<line-9>print(mn)</line-9> | {"code": "<line-2>a = list(map(int, input().split()))</line-2>\n<line-8> mn = min(mn, abs(x - (360 - x)))</line-8>", "lines": [2, 8]}
#### 0 |
<line-1># Contest: Codeforces Round #593 (Div. 2) (https://codeforces.com/contest/1236)</line-1>
<line-3></line-3>
<line-4>def rint():</line-4>
<line-5> return int(input())</line-5>
<line-6></line-6>
<line-7></line-7>
<line-8>def rints():</line-8>
<line-9> return list(map(int, input().split()))</line-9>
<line-10>... | {"code": "<line-2># Problem: B: Alice and the List of Presents (https://codeforces.com/contest/1236/problem/B)</line-2>\n<line-13>n, m = rints()</line-13>", "lines": [2, 13]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3> temp = n // 4</line-3>
<line-4> m = temp * 3</line-4>
<line-5> k = temp * 5</line-5>
<line-6>elif n % 2 == 0:</line-6>
<line-7> n //= 2</line-7>
<line-8> m = n**2 // 2</line-8>
<line-9> k = m + 1</line-9>
<line-10> m *= 2</line-10>
<line-11> k *= 2</li... | {"code": "<line-2>if n % 4 == 0:</line-2>\n<line-17>else:</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>def main():</line-1>
<line-3> for i in range(1, k + 1):</line-3>
<line-4> if (n % i != (i - 1)):</line-4>
<line-5> print("No")</line-5>
<line-6> return</line-6>
<line-8></line-8>
<line-9>main()</line-9> | {"code": "<line-2>\tn, k = map(int, input().split())</line-2>\n<line-7>\tprint(\"Yes\")</line-7>", "lines": [2, 7]}
#### 0 |
<line-1>a = input()</line-1>
<line-3>n, m = len(a), len(b)</line-3>
<line-4>if n > m: b = '0' * (n - m) + b</line-4>
<line-5>else: a = '0' * (m - n) + a</line-5>
<line-6>i = 0</line-6>
<line-7>while i < max(n, m) and a[i] == b[i]:</line-7>
<line-9>print('=' if i == max(n, m) else '<' if int(a[i]) < int(b[i]) else '>')<... | {"code": "<line-2>b = input()</line-2>\n<line-8> i += 1</line-8>", "lines": [2, 8]}
#### 0 |
<line-1>n,p=list(map(int,input().split()))</line-1>
<line-3>mod=10**9+7</line-3>
<line-4></line-4>
<line-5>f=[[[[0]*2 for _ in range(2)] for _ in range(2)] for _ in range(n+1)]</line-5>
<line-6></line-6>
<line-7>_2=[0]*(n+1)</line-7>
<line-8>_2[0]=1</line-8>
<line-9>for i in range(1,n+1):</line-9>
<line-10> _2[i]=(_... | {"code": "<line-2>nums=[0]+list(map(int,input().split()))</line-2>\n<line-40> ans=(ans+f[n][p][i][j])%mod</line-40>", "lines": [2, 40]}
#### 0 |
<line-1>n, a, b, c = map(int, input().split())</line-1>
<line-3>for i in range(50):</line-3>
<line-4> for j in range(50):</line-4>
<line-5> for k in range(50):</line-5>
<line-6> if (n + i + 2 * j + 3 * k) % 4 == 0:</line-6>
<line-8>print(res)</line-8> | {"code": "<line-2>res = 10 ** 100</line-2>\n<line-7> res = min(res, a * i + b * j + c * k)</line-7>", "lines": [2, 7]}
#### 0 |
<line-1>n,m = map(int, input().split())</line-1>
<line-3>for _ in range(m):</line-3>
<line-4> u,v = map(int, input().split())</line-4>
<line-5> g[u-1].append(v-1)</line-5>
<line-6></line-6>
<line-7>st = []</line-7>
<line-8>vis = [0 for _ in range(n)]</line-8>
<line-9>nxt = [0 for _ in range(n)]</line-9>
<line-10>... | {"code": "<line-2>g = [[] for i in range(n)]</line-2>\n<line-79> return</line-79>", "lines": [2, 79]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>n,m=list(map(int,input().split()))</line-4>
<line-5></line-5>
<line-6>A=[]</line-6>
<line-7>COVERED=[0]*(m+1)</line-7>
<line-8></line-8>
<line-9>for i in range(n):</line-9>
<line-10> x,y=list(map(int,input().split()))</line-10>
<line-11> A.append((x-y,x+y))</l... | {"code": "<line-2>input = sys.stdin.readline</line-2>\n<line-57> ANS=(min(ANS,DP[i]+(m+1-i)))</line-57>", "lines": [2, 57]}
#### 0 |
<line-1>import time</line-1>
<line-3>W = int(input())</line-3>
<line-4>M = [int(a) for a in input().split()]</line-4>
<line-5>A = [0] * 8</line-5>
<line-6>sTime = time.time()</line-6>
<line-7></line-7>
<line-8>s = 0</line-8>
<line-9>mi = 10**20</line-9>
<line-10>for i in range(8):</line-10>
<line-11> if s + M[i]*(i+... | {"code": "<line-2>import random</line-2>\n<line-35> mi = min(mi, W-s)</line-35>", "lines": [2, 35]}
#### 0 |
<line-1>3</line-1>
<line-3>#</line-3>
<line-4># This program is free software; you can redistribute it and/or</line-4>
<line-5># modify it under the terms of the GNU General Public License as</line-5>
<line-6># published by the Free Software Foundation; version 3</line-6>
<line-7>#</line-7>
<line-8># This program is di... | {"code": "<line-2># Copyright (C) 2017 Sayutin Dmitry.</line-2>\n<line-47> print(solve(a, l))</line-47>", "lines": [2, 47]}
#### 0 |
<line-1>x=int(input())</line-1>
<line-3>l.sort()</line-3>
<line-4>a=1</line-4>
<line-5>for i in l:</line-5>
<line-6> if i>=a:</line-6>
<line-8>print(a)</line-8> | {"code": "<line-2>l=list(map(int, input().split(' ')))</line-2>\n<line-7> a+=1</line-7>", "lines": [2, 7]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>for i in range(n - 1):</line-3>
<line-4> sm = sum(a[:i + 1])</line-4>
<line-5> tn = 0</line-5>
<line-6> res = True</line-6>
<line-7> has = False</line-7>
<line-8> for j in range(i + 1, n):</line-8>
<line-9> tn += a[j]</line-9>
<line-10> if (tn == sm... | {"code": "<line-2>a = list(map(int, list(input())))</line-2>\n<line-19>else:</line-19>", "lines": [2, 19]}
#### 0 |
<line-1>s = input()</line-1>
<line-3>for i in range(0, len(s)):</line-3>
<line-5>print("IGNORE HIM!" if len(q) % 2 == 1 else "CHAT WITH HER!")</line-5> | {"code": "<line-2>q = set()</line-2>\n<line-4> q.add(s[i])</line-4>", "lines": [2, 4]}
#### 0 |
<line-1>n, k = list(map(int, input().split()))</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>d = [0 for _ in range(n)]</line-5>
<line-6></line-6>
<line-7>for _ in range(n):</line-7>
<line-8> for i in range(n):</line-8>
<line-9> if i % k != _ % k:</line-9>
<line-11></line-11>
<line-12>print(max(abs(d[_]) for ... | {"code": "<line-3>t = list(map(int, input().split()))</line-3>\n<line-10> d[_] += t[i]</line-10>", "lines": [3, 10]}
#### 0 |
<line-1>import sys</line-1>
<line-3>input=sys.stdin.readline</line-3>
<line-4></line-4>
<line-5>n,a,b=map(int,input().split())</line-5>
<line-6></line-6>
<line-7>if a<b: a,b=b,a</line-7>
<line-8></line-8>
<line-9>if b==0:</line-9>
<line-10> # 1 01 001 0001 ... is optimal, plus a long series of 0's</line-10>
<line-11... | {"code": "<line-2>#sys.stdin=open(\"data.txt\")</line-2>\n<line-76> print(temp+n*(a+b))</line-76>", "lines": [2, 76]}
#### 0 |
<line-1>n, a, x, b, y = map(int, input().split())</line-1>
<line-2></line-2>
<line-4> if a == b:</line-4>
<line-5> break</line-5>
<line-6></line-6>
<line-7> a = a % n + 1</line-7>
<line-9></line-9>
<line-10>print("YNEOS"[a != b::2])</line-10> | {"code": "<line-3>while a != x and b != y and a != b:</line-3>\n<line-8>\tb = b - 1 if b - 1 else n</line-8>", "lines": [3, 8]}
#### 0 |
<line-1>x,y,l,r=list(map(int,input().split()))</line-1>
<line-3>a=0</line-3>
<line-4>b.add(l-1)</line-4>
<line-5>b.add(r+1)</line-5>
<line-6>for i in range(100):</line-6>
<line-7> xx=x**i</line-7>
<line-8> if xx>r: break</line-8>
<line-9> for j in range(100):</line-9>
<line-10> rr=xx+(y**j)</line-10>
<line-11> ... | {"code": "<line-2>b=set()</line-2>\n<line-16> a=max(a,b[i]-b[i-1]-1)</line-16>", "lines": [2, 16]}
#### 0 |
<line-1>def is_izi(k):</line-1>
<line-3> while (i * i <= k):</line-3>
<line-4> if (k % i == 0):</line-4>
<line-5> return 0</line-5>
<line-6> i += 1</line-6>
<line-7> return 1</line-7>
<line-8>n = int(input())</line-8>
<line-9>if (is_izi(n)):</line-9>
<line-10> print(1)</line-10>
<line-... | {"code": "<line-2> i = 2</line-2>\n<line-16> else:</line-16>", "lines": [2, 16]}
#### 0 |
<line-1>s = input()</line-1>
<line-3>res = ""</line-3>
<line-4></line-4>
<line-5>def check(s):</line-5>
<line-6> if (len(s) < 3):</line-6>
<line-7> return True</line-7>
<line-8> if (s[-1] not in st and s[-2] not in st and s[-3] not in st) and (s[-1] != s[-2] or s[-2] != s[-3] or s[-1] != s[-3]):</line-8>
<line-9> ret... | {"code": "<line-2>st = {'a', 'e', 'i', 'o', 'u', ' '}</line-2>\n<line-15>\tres += item</line-15>", "lines": [2, 15]}
#### 0 |
<line-1>n, m, k = list(map(int, input().split()))</line-1>
<line-3>t = list(map(int, input().split()))</line-3>
<line-4>pr = list(map(int, input().split()))</line-4>
<line-5>t2 = list(map(int, input().split()))</line-5>
<line-6>pr2 = list(map(int, input().split()))</line-6>
<line-7>mass1 = []</line-7>
<line-8>minans = ... | {"code": "<line-2>x, s = list(map(int, input().split()))</line-2>\n<line-25> minans = min(minans, (n - maxw) * mass1[uk1][1])</line-25>", "lines": [2, 25]}
#### 0 |
<line-1>n, k, m = list(map(int, input().split()))</line-1>
<line-3>l.sort()</line-3>
<line-4>s = sum(l)</line-4>
<line-5></line-5>
<line-6>ans = 0</line-6>
<line-7>for i in range(n + 1):</line-7>
<line-8> mi = m - s * i</line-8>
<line-9> if mi < 0:</line-9>
<line-10> break</line-10>
<line-11> cnt = (k +... | {"code": "<line-2>l = list(map(int, input().split()))</line-2>\n<line-16> ans = max(ans, cnt)</line-16>", "lines": [2, 16]}
#### 0 |
<line-1>N = int(input())</line-1>
<line-3> print(1)</line-3>
<line-5> print(0)</line-5>
<line-6></line-6> | {"code": "<line-2>if N in [1, 2, 4, 5, 9, 10, 20, 21, 41, 42, 84, 85, 169, 170, 340, 341, 681, 682, 1364, 1365, 2729, 2730, 5460, 5461, 10921, 10922, 21844, 21845, 43689, 43690, 87380, 87381, 174761, 174762, 349524, 349525, 699049, 699050]:</line-2>\n<line-4>else:</line-4>", "lines": [2, 4]}
#### 0 |
<line-1>n, m, k = map(int, input().split())</line-1>
<line-3>if k < n:</line-3>
<line-4> ans = k + 1, 1</line-4>
<line-5>else:</line-5>
<line-6> k -= n</line-6>
<line-7> r = n - k // (m - 1)</line-7>
<line-8> if r % 2:</line-8>
<line-9> c = m - k % (m - 1)</line-9>
<line-10> else:</line-10>
<line-... | {"code": "<line-2>ans = 0, 0</line-2>\n<line-12> ans = r, c</line-12>", "lines": [2, 12]}
#### 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.