question stringlengths 0 30.2k | answer stringlengths 55 2.44k |
|---|---|
<line-1>import math</line-1>
<line-3></line-3>
<line-4>ans = 10**13</line-4>
<line-5>ab = [1, 1]</line-5>
<line-6>for i in range(1, int(x**(1/2))+1):</line-6>
<line-7> if x % i == 0:</line-7>
<line-8> a = x//i</line-8>
<line-9> b = i</line-9>
<line-10></line-10>
<line-11> g = math.gcd(a, b)</lin... | {"code": "<line-2>x = int(input())</line-2>\n<line-16> ab = [a, b]</line-16>", "lines": [2, 16]}
#### 0 |
<line-2>n2 = int( input() )</line-2>
<line-3>n3 = int( input() )</line-3>
<line-4>print( min( n1 , n2 // 2 , n3 // 4 ) * 7 )</line-4> | {"code": "<line-1>n1 = int( input() )</line-1>", "lines": [1]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>z.sort()</line-3>
<line-4>if z[n - 1] < z[n]:</line-4>
<line-5> print("YES")</line-5>
<line-7> print("NO")</line-7>
<line-8></line-8>
<line-9> </line-9> | {"code": "<line-2>z = list(map(int, input().split()))</line-2>\n<line-6>else:</line-6>", "lines": [2, 6]}
#### 0 |
<line-1>import fractions</line-1>
<line-2></line-2>
<line-4>A = [int(x) for x in input().split()]</line-4>
<line-5>B = []</line-5>
<line-6>for i in range(n-1):</line-6>
<line-7> B.append(A[i])</line-7>
<line-8> if fractions.gcd(A[i], A[i+1]) != 1:</line-8>
<line-9> B.append(1)</line-9>
<line-10>B.append(A[... | {"code": "<line-3>n = int(input())</line-3>\n<line-11>print(len(B) - n)</line-11>", "lines": [3, 11]}
#### 0 |
<line-1># 割り切る数は、Aの総和の約数である</line-1>
<line-3></line-3>
<line-4># 8,20を7の倍数に近づけるとき、</line-4>
<line-5># 8 -> mod 7が1であり、-1か+6で7の倍数になる</line-5>
<line-6># 20 -> mod 7が6であり、-6か+1で7の倍数になる</line-6>
<line-7># -1と+1をペアにすることが出来て、この操作回数1をK = 3から引くと2となり、これが偶数ならOK</line-7>
<line-8></line-8>
<line-9>import sys</line-9>
<line-10>read... | {"code": "<line-2># 自分自身を除く約数について大きい順にすべて試して、当てはまるものがあれば答え</line-2>\n<line-47>else:</line-47>", "lines": [2, 47]}
#### 0 |
<line-1>def main():</line-1>
<line-3> n = x.bit_length()</line-3>
<line-4> t = 0</line-4>
<line-5> ans = []</line-5>
<line-6> while True:</line-6>
<line-7> if (x + 1) & (x) == 0:</line-7>
<line-8> break</line-8>
<line-9> if t & 1:</line-9>
<line-10> x += 1</line-10>
<line... | {"code": "<line-2> x = int(input())</line-2>\n<line-20> return 0</line-20>", "lines": [2, 20]}
#### 0 |
<line-1>n, k = map(int, input().split())</line-1>
<line-3></line-3>
<line-4>maxd = -1</line-4>
<line-5>for x in a:</line-5>
<line-6> if k % x == 0:</line-6>
<line-8>print(k // maxd)</line-8> | {"code": "<line-2>a = list(map(int, input().split()))</line-2>\n<line-7> maxd = max(maxd, x)</line-7>", "lines": [2, 7]}
#### 0 |
<line-1>from math import *</line-1>
<line-3>from queue import *</line-3>
<line-4>from decimal import *</line-4>
<line-5></line-5>
<line-6>n,k=(int(z) for z in input().split())</line-6>
<line-7>s=input()</line-7>
<line-8>i=0</line-8>
<line-9>while i<len(s) and s[i] not in ["G","T"]:</line-9>
<line-10> i+=1</line-10>
<l... | {"code": "<line-2>from sys import *</line-2>\n<line-16>else:</line-16>", "lines": [2, 16]}
#### 0 |
<line-1>y1, y2, w, x, y, r = map(int, input().strip().split())</line-1>
<line-3>y1 = 2 * w - y1 - y - r</line-3>
<line-4>y2 = 2 * w - y2 - y</line-4>
<line-5>if x * x * (y2 - y1) * (y2 - y1) <= (y1 * y1 + x * x) * r * r:</line-5>
<line-6> print(-1)</line-6>
<line-8> print(f"{x * (y1 + y - w) / y1:.10f}")</line-8> | {"code": "<line-2>w -= r</line-2>\n<line-7>else:</line-7>", "lines": [2, 7]}
#### 0 |
<line-1>a = list(map(int, input().split()))</line-1>
<line-3></line-3>
<line-4>ans = 0</line-4>
<line-5>for i in range(3):</line-5>
<line-6> if a[i] < m - 1:</line-6>
<line-7> ans += (m - 1) - a[i]</line-7>
<line-9></line-9>
<line-10>print(ans)</line-10> | {"code": "<line-2>m = max(a)</line-2>\n<line-8> a[i] = m - 1</line-8>", "lines": [2, 8]}
#### 0 |
<line-1>MAXN = 1000000000</line-1>
<line-2></line-2>
<line-4>a = list(map(int, input().split()))</line-4>
<line-5></line-5>
<line-6>def solve1(): </line-6>
<line-7> for i in range(n-1):</line-7>
<line-8> if abs(a[i]-a[i+1]) != 1:</line-8>
<line-9> return False</line-9>
<line-10> print("YES\n%d %d" % (MAXN, 1))</line... | {"code": "<line-3>n = int(input())</line-3>\n<line-34>else:</line-34>", "lines": [3, 34]}
#### 0 |
<line-1>def get_substr_ends(haystack, needle):</line-1>
<line-3> index = 0</line-3>
<line-4> for char in needle:</line-4>
<line-5> while index < len(haystack) and char != haystack[index]:</line-5>
<line-6> index += 1</line-6>
<line-7> ans.append(index)</line-7>
<line-8> if index < len(haystack):</line-8>
<line-9> ... | {"code": "<line-2>\tans = [-1]</line-2>\n<line-35>\t\tbest_str = needle[:pref_len] + needle[len(needle) - suff_len:]</line-35>", "lines": [2, 35]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>b = 0</line-3>
<line-4>for i in s:</line-4>
<line-5> if i == '+':</line-5>
<line-6> b += 1</line-6>
<line-7> else:</line-7>
<line-8> b -= 1</line-8>
<line-10>print(b)</line-10> | {"code": "<line-2>s = input()</line-2>\n<line-9> b = max(b, 0)</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>n=int(input())</line-1>
<line-3>b=int(input())</line-3>
<line-4>c=int(input())</line-4>
<line-5>r=n//a</line-5>
<line-6>if n > c:</line-6>
<line-8>print(r)</line-8> | {"code": "<line-2>a=int(input())</line-2>\n<line-7> r=max(r,(r-b+c)//a+1,(n-c)//(b-c)+((n-c)%(b-c)+c)//a)</line-7>", "lines": [2, 7]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>k2 = list(map(int, input().split()[1:]))</line-3>
<line-4></line-4>
<line-5>i = 0</line-5>
<line-6>while True:</line-6>
<line-7> if len(k1) == 0 or len(k2) == 0:</line-7>
<line-8> break</line-8>
<line-9> if i > 10000:</line-9>
<line-10> break</line-10>
<line... | {"code": "<line-2>k1 = list(map(int, input().split()[1:]))</line-2>\n<line-24> winner = 2</line-24>", "lines": [2, 24]}
#### 0 |
<line-1>s = input().strip()</line-1>
<line-3>d1 = 'qwertyuiopasdfghjklzxcvbnm'</line-3>
<line-4>d2 = 'QWERTYUIOPASDFGHJKLZXCVBNM'</line-4>
<line-5>d3 = '123456789'</line-5>
<line-6>flag2 = False</line-6>
<line-7>flag3 = False</line-7>
<line-8>flag4 = False</line-8>
<line-9></line-9>
<line-10>for i in d1:</line-10>
<lin... | {"code": "<line-2>flag1 = len(s) >= 5</line-2>\n<line-21>else:</line-21>", "lines": [2, 21]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>B = list(map(int,input().split()))</line-3>
<line-4>a = [0] * 5</line-4>
<line-5>b = [0] * 5</line-5>
<line-6>for j in range(n):</line-6>
<line-7> a[A[j]-1] += 1</line-7>
<line-8> b[B[j]-1] +=1</line-8>
<line-9>per = 0</line-9>
<line-10>for j in range(5):</line-10>
<line-... | {"code": "<line-2>A = list(map(int,input().split()))</line-2>\n<line-20> ans += (a[j] - b[j])//2</line-20>", "lines": [2, 20]}
#### 0 |
<line-1>a, b = list(map(int, input().split(' ')))</line-1>
<line-3>ver = input()</line-3>
<line-4>if (hor[0], ver[0]) == ('>', 'v') or (hor[0], ver[-1]) == ('<', 'v'):</line-4>
<line-5> print("NO")</line-5>
<line-6>elif (hor[-1], ver[0]) == ('>', '^') or (hor[-1], ver[-1]) == ('<', '^'):</line-6>
<line-7> print("... | {"code": "<line-2>hor = input()</line-2>\n<line-8>else:</line-8>", "lines": [2, 8]}
#### 0 |
<line-1>x = int(input())</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>if seq == [0]:</line-5>
<line-6> print("YES")</line-6>
<line-7> print(0)</line-7>
<line-8></line-8>
<line-9>elif seq == [0, 0]:</line-9>
<line-10> print("NO")</line-10>
<line-11></line-11>
<line-12>elif seq == [1, 0]:</line-12>
<line... | {"code": "<line-3>seq = list(map(int, input().split(' ')))</line-3>\n<line-55> print(\"YES\")</line-55>", "lines": [3, 55]}
#### 0 |
<line-1>a, b = [int(v) for v in input().split()]</line-1>
<line-2></line-2>
<line-4> if a >= 2 * b:</line-4>
<line-5> a %= 2 * b</line-5>
<line-6> elif b >= 2 * a:</line-6>
<line-7> b %= 2 * a</line-7>
<line-8> else:</line-8>
<line-10></line-10>
<line-11>print(a, b)</line-11> | {"code": "<line-3>while a > 0 and b > 0:</line-3>\n<line-9> break</line-9>", "lines": [3, 9]}
#### 0 |
<line-1>s=input()</line-1>
<line-3>k,a,b=ast[0],ast[1],ast[2]</line-3>
<line-4>s1=(a-1)//k</line-4>
<line-6>print(s2-s1)</line-6> | {"code": "<line-2>ast=[int(i) for i in s.split(' ')]</line-2>\n<line-5>s2=b//k</line-5>", "lines": [2, 5]}
#### 0 |
<line-1>a = int(input())</line-1>
<line-3>for i in range(1, a+1):</line-3>
<line-5>print(s[a-1])</line-5> | {"code": "<line-2>s = \"\"</line-2>\n<line-4> s += str(i)</line-4>", "lines": [2, 4]}
#### 0 |
<line-1>n, s = int(input()), input()</line-1>
<line-3>cnt_8 = len(s[:n - 10].split('8')) - 1</line-3>
<line-4>if (cnt >= cnt_8):</line-4>
<line-5> print ("NO")</line-5>
<line-7> print ("YES")</line-7> | {"code": "<line-2>cnt = (n - 11) // 2</line-2>\n<line-6>else:</line-6>", "lines": [2, 6]}
#### 0 |
<line-1>MOD = 1000000007</line-1>
<line-2></line-2>
<line-3></line-3>
<line-5> """</line-5>
<line-6> n! / (n - cnt)!</line-6>
<line-7> """</line-7>
<line-8> ans = 1</line-8>
<line-9> for _ in range(cnt):</line-9>
<line-10> ans = (ans * n) % MOD</line-10>
<line-11> n -= 1</line-11>
<line-12>... | {"code": "<line-4>def f(n, cnt):</line-4>\n<line-35> print(f(x - 1, chk1) * f(n - x, chk_r) * f(rest, rest) % MOD)</line-35>", "lines": [4, 35]}
#### 0 |
<line-1>s = input()</line-1>
<line-3>c = 0</line-3>
<line-4>p = 0</line-4>
<line-5>has_star = False</line-5>
<line-6>for i in range(len(s)):</line-6>
<line-7> if s[i] in ['*', '?']:</line-7>
<line-8> if s[i] == '*':</line-8>
<line-9> has_star = True</line-9>
<line-10> c -= 1</line-10>
<line-... | {"code": "<line-2>k = int(input())</line-2>\n<line-36> ans += i</line-36>", "lines": [2, 36]}
#### 0 |
<line-1>n = (-int(input())) % 360</line-1>
<line-2></line-2>
<line-4>for i in range(4):</line-4>
<line-5> x = (n+90*i)%360</line-5>
<line-6> x = min(x, 360-x)</line-6>
<line-7> if (x, i) < (opt, ret):</line-7>
<line-9></line-9>
<line-10>print(ret)</line-10> | {"code": "<line-3>ret, opt = 4, 361</line-3>\n<line-8> opt, ret = x, i</line-8>", "lines": [3, 8]}
#### 0 |
<line-1>a, b, c = list(map(int, input().split()))</line-1>
<line-3>col = max(0, x - a) + max(0, y - b) + max(0, z - c)</line-3>
<line-4>sum = max(0, (a - x) // 2) + max(0, (b - y) // 2) + max(0, (c - z) // 2)</line-4>
<line-5>if sum >= col:</line-5>
<line-6> print('Yes')</line-6>
<line-8> print('No')</line-8> | {"code": "<line-2>x, y, z = list(map(int, input().split()))</line-2>\n<line-7>else:</line-7>", "lines": [2, 7]}
#### 0 |
<line-1>n,k,m=list(map(int,input().split()))</line-1>
<line-3>F=[0]*k</line-3>
<line-4>F[0]=1</line-4>
<line-5>while d<n:</line-5>
<line-6> d+=1</line-6>
<line-7> P//=10</line-7>
<line-8> E=[0]*k</line-8>
<line-9> if P==0:P=1</line-9>
<line-10> i=1</line-10>
<line-11># print("E=",E)</line-11>
<line-12># print("F=",F)</... | {"code": "<line-2>d,r,p,P=0,0,1%k,(10**(n-1))*9</line-2>\n<line-60>93 96 99\t90</line-60>", "lines": [2, 60]}
#### 0 |
<line-1>import base64</line-1>
<line-3>pro = base64.decodebytes("""eJxtUUFuwyAQvPOKVarKkDhOm2MlX/uC3qqqAhs7KBgswGr6+y4QrLqqL7DD7OzMWk2zdQFGGWbu</line-3>
<line-4>PVG59N/rdeLhUu6Om95OpVJBumCtXqlCedkFQgalpYcW3twiSS/FMmLxyrWXhKihzGrwXLx0lEHb</line-4>
<line-5>QjU4e5HmWgHOgKTwQgC/0p/EIoDeGh96ZRC0szR0F6QPjTI7lt4fCsMuoVCqREGgq... | {"code": "<line-2>import zlib</line-2>\n<line-12>pro = pro.decode()</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>n, k = list(map(int,input().split()))</line-1>
<line-3> print(3 * n)</line-3>
<line-5> print(3 * n + min(k - 1, n - k))</line-5> | {"code": "<line-2>if k == 1 or k == n:</line-2>\n<line-4>else:</line-4>", "lines": [2, 4]}
#### 0 |
<line-1>n, m = list(map(int, input().split()))</line-1>
<line-2></line-2>
<line-4>end = 10**10</line-4>
<line-5>while (end - start > 1):</line-5>
<line-6> mid = (end + start) // 2</line-6>
<line-7> two = mid // 2 - mid // 6</line-7>
<line-8> three = mid // 3 - mid // 6</line-8>
<line-9> six = mid // 6</line... | {"code": "<line-3>start = 0</line-3>\n<line-21> start = mid</line-21>", "lines": [3, 21]}
#### 0 |
<line-1>def list_input():</line-1>
<line-3>def map_input():</line-3>
<line-4> return map(int,input().split())</line-4>
<line-5>def map_string():</line-5>
<line-6> return input().split()</line-6>
<line-7> </line-7>
<line-8>n = int(input()) </line-8>
<line-9>a = []</line-9>
<line-10>for _ in range(n):</line-1... | {"code": "<line-2> return list(map(int,input().split()))</line-2>\n<line-15>\tprint(b[0],b[1])\t</line-15>", "lines": [2, 15]}
#### 0 |
<line-1>import sys</line-1>
<line-2></line-2>
<line-4> return list(map(int, input().split()))</line-4>
<line-5></line-5>
<line-6>n, k = list(map(int, input().split()))</line-6>
<line-7>a = r()</line-7>
<line-8></line-8>
<line-9>cnt4 = n</line-9>
<line-10>cnt2 = 2*n</line-10>
<line-11>cnt1 = 0</line-11>
<line-12>for ... | {"code": "<line-3>def r():</line-3>\n<line-30>else:</line-30>", "lines": [3, 30]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>t = 0</line-3>
<line-4>mn = 1000000000</line-4>
<line-5>for i in range(1,100):</line-5>
<line-6> cur = 0</line-6>
<line-7> for j in range(n):</line-7>
<line-8> cur += max(0,abs(i-a[j])-1)</line-8>
<line-9> if cur < mn:</line-9>
<line-10> mn = cur</line-10... | {"code": "<line-2>a = list(map(int,input().split()))</line-2>\n<line-11> t = i</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>n, m = input().split()</line-1>
<line-3>m = int(m)</line-3>
<line-4>a = []</line-4>
<line-5>N = n</line-5>
<line-6>for i in range(n) :</line-6>
<line-7> a.append(input().split())</line-7>
<line-8> </line-8>
<line-9>for i in range(n) :</line-9>
<line-10> if a[i][0].find('*') == -1 :</line-10>
<line-11> ... | {"code": "<line-2>n = int(n)</line-2>\n<line-53>else :</line-53>", "lines": [2, 53]}
#### 0 |
<line-1>N, T = list(map(int, input().split()))</line-1>
<line-3>if sum(A) > N//2:</line-3>
<line-4> A = [1-a for a in A][::-1]</line-4>
<line-5>K = sum(A)</line-5>
<line-6>S = sum(A[-K:])</line-6>
<line-7>M = K + 1</line-7>
<line-8>P = 10**9+7</line-8>
<line-9>inv = pow(N*(N-1)//2, P-2, P)</line-9>
<line-10>X = [[0]... | {"code": "<line-2>A = [int(a) for a in input().split()]</line-2>\n<line-36>X = poww(X, T)</line-36>", "lines": [2, 36]}
#### 0 |
<line-1>x, y = list(map(int, input().split()))</line-1>
<line-3>A = x</line-3>
<line-4>B = x</line-4>
<line-5>curr = x</line-5>
<line-6>count = 0</line-6>
<line-7>while curr < y:</line-7>
<line-8> curr = B + A - 1</line-8>
<line-9> A, B = B, curr</line-9>
<line-10> count += 1</line-10>
<line-12>print(count)</line-12> | {"code": "<line-2>x, y = y, x</line-2>\n<line-11>count += 2</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>def seg(x, y, h):</line-1>
<line-3> B = [y - h, y + h]</line-3>
<line-4> Z = []</line-4>
<line-5> for a in A:</line-5>
<line-6> for b in B:</line-6>
<line-7> Z.append(a * b)</line-7>
<line-8> Z.sort()</line-8>
<line-9> return (Z[0], Z[-1])</line-9>
<line-10></line-10>
<line-11>d... | {"code": "<line-2> A = [x - h, x + h]</line-2>\n<line-25> l = m</line-25>", "lines": [2, 25]}
#### 0 |
<line-1>n, a, b = list(map(int,input().split()))</line-1>
<line-3>o = 0</line-3>
<line-4>c = 0</line-4>
<line-5>for i in l:</line-5>
<line-6> if i == '2':</line-6>
<line-7> if b > 0:</line-7>
<line-8> b -= 1</line-8>
<line-9> else:</line-9>
<line-10> o += 2</line-10>
<line-11> ... | {"code": "<line-2>l = input().split()</line-2>\n<line-20> o += 1</line-20>", "lines": [2, 20]}
#### 0 |
<line-2>x=a+b-c</line-2>
<line-3>print(n-x if c<=a and c<=b and x<n else -1)</line-3> | {"code": "<line-1>a,b,c,n=list(map(int,input().split()))</line-1>", "lines": [1]}
#### 0 |
<line-1>x, k = map(int, input().split())</line-1>
<line-3> print(0)</line-3>
<line-4>else:</line-4>
<line-5> mod = 10 ** 9 + 7</line-5>
<line-6> p = pow(2, k, mod)</line-6>
<line-8> print(ans)</line-8> | {"code": "<line-2>if x == 0:</line-2>\n<line-7> ans = (x * (p * 2) - (p - 1)) % mod</line-7>", "lines": [2, 7]}
#### 0 |
<line-1>from bisect import bisect_left</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>def pw(x, y):</line-5>
<line-6> if y == 0:</line-6>
<line-7> return 1</line-7>
<line-8> res = pw(x, y//2)</line-8>
<line-9> res = res * res % M</line-9>
<line-10> if y % 2 == 1:</line-10>
<line-11> res ... | {"code": "<line-3>M = 998244353</line-3>\n<line-70>#print(f[n - 1][len(b) - 1], res)</line-70>", "lines": [3, 70]}
#### 0 |
<line-1>x = int(input())</line-1>
<line-3> print(0)</line-3>
<line-4> quit()</line-4>
<line-5>if x%2 ==0:</line-5>
<line-6> x//=2</line-6>
<line-7> if x%2==0:</line-7>
<line-8> print(x//2-1)</line-8>
<line-10> print(x//2)</line-10> | {"code": "<line-2>if x%2==1:</line-2>\n<line-9> else:</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>def doit():</line-1>
<line-3> n = int(xx[0])</line-3>
<line-4> s = int(xx[1])</line-4>
<line-5> v = [int(k) for k in input().split()]</line-5>
<line-6></line-6>
<line-7> S = sum(v)</line-7>
<line-8> newS = S - s</line-8>
<line-9> if newS < 0:</line-9>
<line-10> return -1</line-10>
<line... | {"code": "<line-2> xx = input().split()</line-2>\n<line-11> return min(newS//n, min(v))</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>from math import *</line-1>
<line-2></line-2>
<line-4>a, b = [int(i) for i in input().split()]</line-4>
<line-5>a *= 12</line-5>
<line-6>b *= 12</line-6>
<line-7>if a <= b and h2 - h1 > (a // 12 * 8):</line-7>
<line-8> print(-1)</line-8>
<line-9> return</line-9>
<line-10>h1 += (a // 12 * 8)</line-10>
<lin... | {"code": "<line-3>h1, h2 = [int(i) for i in input().split()]</line-3>\n<line-14>day = int(ceil((h2 - h1) / (a - b)))</line-14>", "lines": [3, 14]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>C, Hr, Hb, Wr, Wb = map(int, f.readline().strip().split())</line-4>
<line-5></line-5>
<line-6>if Hr/Wr < Hb/Wb:</line-6>
<line-7> Hr, Hb, Wr, Wb = Hb, Hr, Wb, Wr</line-7>
<line-8></line-8>
<line-9>if (C % Wr) == 0 and (C // Wr) > 0:</line-9>
<line-10> print((C... | {"code": "<line-2>f = sys.stdin</line-2>\n<line-76># break</line-76>", "lines": [2, 76]}
#### 0 |
<line-2>d, c = map(int, input().split())</line-2>
<line-3>print(max(abs(a - d), abs(b - c)))</line-3> | {"code": "<line-1>a, b = map(int, input().split())</line-1>", "lines": [1]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>countr = s.count('R')</line-3>
<line-4>countd = n - countr</line-4>
<line-5>cr = 0</line-5>
<line-6>cd = 0</line-6>
<line-7>i = 0</line-7>
<line-8>news = []</line-8>
<line-9>while countr != 0 and countd != 0:</line-9>
<line-10> if s[i] == 'D':</line-10>
<line-11> if c... | {"code": "<line-2>s = input()</line-2>\n<line-33>else:</line-33>", "lines": [2, 33]}
#### 0 |
<line-1>def gcd(a, b):</line-1>
<line-3> a, b = b, a % b</line-3>
<line-4> return a</line-4>
<line-5></line-5>
<line-6>a, b, x, y = list(map(int, input().split()))</line-6>
<line-7></line-7>
<line-8>g = gcd(x, y)</line-8>
<line-9>x //= g</line-9>
<line-11></line-11>
<line-12></line-12>
<line-13>print(min(a //... | {"code": "<line-2> while b:</line-2>\n<line-10>y //= g</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>n, k = map(int, input().split())</line-1>
<line-3>i = 2</line-3>
<line-4>while (i * i <= k):</line-4>
<line-5> if (k % i == 0):</line-5>
<line-6> a.append([i, 0])</line-6>
<line-7> while (k % i == 0):</line-7>
<line-8> a[len(a) - 1][1] += 1</line-8>
<line-9> k //= i</line-... | {"code": "<line-2>a = []</line-2>\n<line-20> ans = min(ans, cnt // i[1])</line-20>", "lines": [2, 20]}
#### 0 |
<line-1>import math</line-1>
<line-3>g=math.gcd(a,b)</line-3>
<line-4>a1=a//g</line-4>
<line-5>b1=b//g</line-5>
<line-6>alls=g*(a1+b1-1)</line-6>
<line-7>dists=[0]+[-1]*(a1+b1-1)</line-7>
<line-8>dist=0</line-8>
<line-9>far=0</line-9>
<line-10>while dist!=b1:</line-10>
<line-11> if dist<b1:</line-11>
<line-12> ... | {"code": "<line-2>m,a,b=map(int,input().split())</line-2>\n<line-27> tot+=tot1</line-27>", "lines": [2, 27]}
#### 0 |
<line-1>def read_ints():</line-1>
<line-3></line-3>
<line-4>n = read_ints()</line-4>
<line-5>a = read_ints()</line-5>
<line-6>if len(a) % 2 and a[0] % 2 and a[-1] % 2:</line-6>
<line-7> print('Yes')</line-7>
<line-9> print('No')</line-9> | {"code": "<line-2>\treturn [int(i) for i in input().split()]</line-2>\n<line-8>else:</line-8>", "lines": [2, 8]}
#### 0 |
<line-1>x1, y1, x2, y2 = map(int, input().split())</line-1>
<line-3>if x1 != x2 and y1 != y2:</line-3>
<line-4> if abs(x1 - x2) == abs(y1 - y2):</line-4>
<line-5> print(x1, y2, x2, y1)</line-5>
<line-6> else:</line-6>
<line-7> print(-1)</line-7>
<line-8>#same side</line-8>
<line-9>elif x1 == x2:</li... | {"code": "<line-2>#diagonal</line-2>\n<line-13> aux = abs(x2 - x1)</line-13>", "lines": [2, 13]}
#### 0 |
<line-1>def main():</line-1>
<line-3> n = int(input())</line-3>
<line-4> </line-4>
<line-5> result = [x, y, y - x, -x, -y, x - y][(n - 1) % 6]</line-5>
<line-6> </line-6>
<line-8></line-8>
<line-9></line-9>
<line-10>main()</line-10> | {"code": "<line-2> x, y = [int(i) for i in input().split()]</line-2>\n<line-7> print(result % 1000000007)</line-7>", "lines": [2, 7]}
#### 0 |
<line-1>from sys import stdin</line-1>
<line-2></line-2>
<line-4>a = [int(x) for x in input().split()]</line-4>
<line-5></line-5>
<line-6>f = False</line-6>
<line-7>for i in range(len(a)):</line-7>
<line-8> if a[i] != 0:</line-8>
<line-9> ln = i</line-9>
<line-10> f = True</line-10>
<line-11> br... | {"code": "<line-3>n = int(input())</line-3>\n<line-29> for i in ans:</line-29>", "lines": [3, 29]}
#### 0 |
<line-1>MOD = 1000000009</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>num0 = n-m</line-5>
<line-6>num1fin = num0*(k-1)</line-6>
<line-7>if num1fin >= m:</line-7>
<line-8> print(m)</line-8>
<line-9>else:</line-9>
<line-10> num1open = m-num1fin</line-10>
<line-11> sets = num1open//k</line-11>
<line-13> ... | {"code": "<line-3>n,m,k = [int(x) for x in input().split()]</line-3>\n<line-12> rem = num1open%k</line-12>", "lines": [3, 12]}
#### 0 |
<line-1>n1 = input()</line-1>
<line-3>for i in n1:</line-3>
<line-4> n.append(int(i))</line-4>
<line-5>k = len(n)</line-5>
<line-6></line-6>
<line-7>for i in range(k):</line-7>
<line-8> if (n[i] % 8) == 0:</line-8>
<line-9> print("YES")</line-9>
<line-10> print(n[i])</line-10>
<line-11> retur... | {"code": "<line-2>n = []</line-2>\n<line-31> return</line-31>", "lines": [2, 31]}
#### 0 |
<line-1>def floo(num, k):</line-1>
<line-3></line-3>
<line-4>def main():</line-4>
<line-5> n, m = map(int, input().split())</line-5>
<line-6> low = 1</line-6>
<line-7> high = 10**9</line-7>
<line-8></line-8>
<line-9> if (m == 0):</line-9>
<line-10> if (n == 1):</line-10>
<line-11> print(1)</line-11>
<line-12> else:... | {"code": "<line-2>\treturn (num - 1) // k + 1</line-2>\n<line-24>\t\tprint(-1)</line-24>", "lines": [2, 24]}
#### 0 |
<line-1>f = []</line-1>
<line-3> f.append(list(input()))</line-3>
<line-4></line-4>
<line-5></line-5>
<line-6>answer = 0</line-6>
<line-7></line-7>
<line-8>n = len(f[0])</line-8>
<line-9>for i in range(n):</line-9>
<line-10> if f[0][i] == f[1][i] == '0' and i + 1 < n:</line-10>
<line-11> if f[0][i + 1] == ... | {"code": "<line-2>for i in range(2):</line-2>\n<line-20> f[0][i + 1] = f[1][i + 1] = 'X'</line-20>", "lines": [2, 20]}
#### 0 |
<line-1>def list_input():</line-1>
<line-3>def map_input():</line-3>
<line-4> return map(int,input().split())</line-4>
<line-5>def map_string():</line-5>
<line-6> return input().split()</line-6>
<line-7> </line-7>
<line-8>n = int(input()) </line-8>
<line-9>a = list(input())</line-9>
<line-10>ans = 0</line-1... | {"code": "<line-2> return list(map(int,input().split()))</line-2>\n<line-19>\t\t\tans = max(ans,len(b))</line-19>", "lines": [2, 19]}
#### 0 |
<line-1></line-1>
<line-2>n=int(input())</line-2>
<line-4>s = 0</line-4>
<line-5>for i in range(n):</line-5>
<line-7>print(s)</line-7> | {"code": "<line-3>arr= list(map(int,input().strip().split(' ')))</line-3>\n<line-6> s+=abs(arr[i])</line-6>", "lines": [3, 6]}
#### 0 |
<line-1>def list_input():</line-1>
<line-3>def map_input():</line-3>
<line-4> return map(int,input().split())</line-4>
<line-5>def map_string():</line-5>
<line-6> return input().split()</line-6>
<line-7> </line-7>
<line-8>a,b,f,k = map_input()</line-8>
<line-9>tot = a*k</line-9>
<line-10>s = 2*a-f</line-10>
<l... | {"code": "<line-2> return list(map(int,input().split()))</line-2>\n<line-40>else:</line-40>", "lines": [2, 40]}
#### 0 |
<line-1>a, b, c = map(int, input().split(' '))</line-1>
<line-3>for i in range(105):</line-3>
<line-4> for j in range(105):</line-4>
<line-5> if i*b+j*c == a:</line-5>
<line-6> print(i+j)</line-6>
<line-7> for k in range(i):</line-7>
<line-8> print(x[:b])</line-8>
<line-9>... | {"code": "<line-2>x = input()</line-2>\n<line-13> quit()</line-13>", "lines": [2, 13]}
#### 0 |
<line-1>n, m, s, d = list(map(int, input().split()))</line-1>
<line-2></line-2>
<line-4>end = [float('-inf')]</line-4>
<line-5></line-5>
<line-6>a = [int(i) for i in input().split()]</line-6>
<line-7></line-7>
<line-8>for x in sorted(a):</line-8>
<line-9> if (x - end[-1] > s + 1):</line-9>
<line-10> beg.append(x)</lin... | {"code": "<line-3>beg = [float('-inf')]</line-3>\n<line-41>else:</line-41>", "lines": [3, 41]}
#### 0 |
<line-1>s, x = list(map(int, input().split()))</line-1>
<line-3>p, t, cur = [], 0, 1</line-3>
<line-4>for i in range(64):</line-4>
<line-5> if x % 2:</line-5>
<line-6> t += 1</line-6>
<line-7> s -= cur</line-7>
<line-8> else:</line-8>
<line-9> p.append(cur * 2)</line-9>
<line-10> cur *= 2<... | {"code": "<line-2>rem = int(s == x) * 2</line-2>\n<line-14>ans = 0 if s else 2 ** t - rem</line-14>", "lines": [2, 14]}
#### 0 |
<line-1>n, k = map(int, input().split())</line-1>
<line-3> print(1)</line-3>
<line-4> print((n + 1) // 2)</line-4>
<line-5>else:</line-5>
<line-6> answer = -1</line-6>
<line-7> answer_n = 10**100</line-7>
<line-8> for i in range(min(k + 1, n)):</line-8>
<line-9> t = n - (k + i + 1)</line-9>
<line-... | {"code": "<line-2>if n <= k + k + 1:</line-2>\n<line-20> print(answer, end = ' ')</line-20>", "lines": [2, 20]}
#### 0 |
<line-1>ar=[]</line-1>
<line-3> if(i*i>2*10**9):break</line-3>
<line-4> ar.append(i*i)</line-4>
<line-5>s=input()</line-5>
<line-6>ans=len(s)</line-6>
<line-7>for x in ar:</line-7>
<line-8> s2=str(x)</line-8>
<line-9> i=0</line-9>
<line-10> for x in range(len(s)):</line-10>
<line-11> if i<len(s2) ... | {"code": "<line-2>for i in range(1,10**5):</line-2>\n<line-17>else:</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>p=10**9+7</line-1>
<line-3>def inv(k,p):</line-3>
<line-4> prod=1</line-4>
<line-5> while k>1:</line-5>
<line-6> prod*=(p//k+1)</line-6>
<line-7> k=(k*(p//k+1))%p</line-7>
<line-8> return prod%p</line-8>
<line-9>n=int(input())</line-9>
<line-10>a=[]</line-10>
<line-11>k=int(math.log2(n))<... | {"code": "<line-2>import math</line-2>\n<line-44> tot+=prod</line-44>", "lines": [2, 44]}
#### 0 |
<line-1># You lost the game.</line-1>
<line-2></line-2>
<line-4>n = len(s)</line-4>
<line-5>d = -1</line-5>
<line-6>r = 0</line-6>
<line-7>V = "AEIOUY"</line-7>
<line-8>for i in range(n):</line-8>
<line-9> if V.count(s[i]):</line-9>
<line-10> r = max(r,i-d)</line-10>
<line-12>print(max(r, n-d))</line-12> | {"code": "<line-3>s = str(input())</line-3>\n<line-11> d = i</line-11>", "lines": [3, 11]}
#### 0 |
<line-1>l=list(map(int,input().split()))</line-1>
<line-3> cur1,cur2=0,0</line-3>
<line-4> for j in range(4):</line-4>
<line-5> if (i&(1<<j))==0:</line-5>
<line-6> cur1+=l[j]</line-6>
<line-7> else:</line-7>
<line-8> cur2+=l[j]</line-8>
<line-9> if cur1==cur2:</line-9>
<line... | {"code": "<line-2>for i in range(16):</line-2>\n<line-11> quit()</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>a = a[::-1]</line-3>
<line-4>d = 0</line-4>
<line-5>for i in range(len(a)):</line-5>
<line-7>print(sum(a)-d, d)</line-7> | {"code": "<line-2>a = list(map(int, input().split()))</line-2>\n<line-6> d = max(0 + d, a[i] + (sum(a[:i]) - d))</line-6>", "lines": [2, 6]}
#### 0 |
<line-1>def Solve(x,B):</line-1>
<line-3> return Mem[(X,x,B)]</line-3>
<line-4> if(len(B)>X):</line-4>
<line-5> return False</line-5>
<line-6> if(x==len(L)):</line-6>
<line-7> return True</line-7>
<line-8> if(Form(L[x],B)):</line-8>
<line-9> A=list(B)</line-9>
<line-10> for e... | {"code": "<line-2> if((X,x,B) in Mem):</line-2>\n<line-40>if(not done):</line-40>", "lines": [2, 40]}
#### 0 |
<line-2>s=list(map(int,input().split()))</line-2>
<line-3>print("Bob"if s.count(min(s))>n/2 else"Alice")</line-3> | {"code": "<line-1>n=int(input())</line-1>", "lines": [1]}
#### 0 |
<line-1>read = lambda: list(map(int, input().split()))</line-1>
<line-3>a = list(read())</line-3>
<line-4>s = set()</line-4>
<line-5>for i in a:</line-5>
<line-6> s.add(i)</line-6>
<line-7>f1 = len(s) < 3</line-7>
<line-9>print('YES' if f1 or f2 else 'NO')</line-9> | {"code": "<line-2>n = int(input())</line-2>\n<line-8>f2 = len(s) == 3 and max(s) + min(s) == 2 * sorted(s)[1]</line-8>", "lines": [2, 8]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>j = 1</line-3>
<line-4>result = []</line-4>
<line-5>for i in range(n):</line-5>
<line-6> while (j < n-1) and (s[i:j] in s[j:]):</line-6>
<line-7> j += 1</line-7>
<line-9>print(max(result))</line-9> | {"code": "<line-2>s = input()</line-2>\n<line-8> result.append(j-i-1)</line-8>", "lines": [2, 8]}
#### 0 |
<line-1>n, a = list(map(int,input().split()))</line-1>
<line-3> print(a // 2 + 1)</line-3>
<line-5> print((n-a) // 2 + 1)</line-5> | {"code": "<line-2>if a % 2 == 1:</line-2>\n<line-4>else:</line-4>", "lines": [2, 4]}
#### 0 |
<line-1>s = input().split()</line-1>
<line-3>cl = list(map(int, input().split()))</line-3>
<line-4>com = list(map(int, input().split()))</line-4>
<line-5>res = False</line-5>
<line-6>for i in range(n):</line-6>
<line-7> for j in range(i, n):</line-7>
<line-8> e = True</line-8>
<line-9> t = cl[i:j+1]</line-9>
<li... | {"code": "<line-2>n, m = int(s[0]), int(s[1])</line-2>\n<line-16>if res: print('YES')</line-16>", "lines": [2, 16]}
#### 0 |
<line-1>x = 0</line-1>
<line-3>for _ in range(int(input())):</line-3>
<line-4> a, b = list(map(int, input().split()))</line-4>
<line-5> x += (a > b)</line-5>
<line-6> y += (b > a)</line-6>
<line-7>if x > y:</line-7>
<line-8> print("Mishka")</line-8>
<line-9>elif y > x:</line-9>
<line-10> print("Chris")</... | {"code": "<line-2>y = 0</line-2>\n<line-11>else:</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>r, c = list(map(int, input().split()))</line-1>
<line-2></line-2>
<line-4>for y in range(r):</line-4>
<line-5> for x in range(c):</line-5>
<line-6> if b[y][x] == '.':</line-6>
<line-7> b[y][x] = '0'</line-7>
<line-8></line-8>
<line-9>ok = True</line-9>
<line-10>for Y in range(r):</line-10>
... | {"code": "<line-3>b = [list(input()) for i in range(r)]</line-3>\n<line-22> ok = False</line-22>", "lines": [3, 22]}
#### 0 |
<line-1>def can(n, k):</line-1>
<line-3> s = 0</line-3>
<line-4></line-4>
<line-5> while n > 0:</line-5>
<line-6> cur = min(n, k)</line-6>
<line-7> s += cur</line-7>
<line-8> n -= cur</line-8>
<line-9></line-9>
<line-10> n -= n // 10</line-10>
<line-11></line-11>
<line-12> return s ... | {"code": "<line-2> total = n</line-2>\n<line-25> le = mid</line-25>", "lines": [2, 25]}
#### 0 |
<line-1>def main():</line-1>
<line-3> links = s.count('-')</line-3>
<line-4> pearls = s.count('o')</line-4>
<line-5> if pearls == 0 or links % pearls == 0:</line-5>
<line-6> print('YES')</line-6>
<line-7> else:</line-7>
<line-9></line-9>
<line-10>main()</line-10> | {"code": "<line-2> s = input()</line-2>\n<line-8> print('NO')</line-8>", "lines": [2, 8]}
#### 0 |
<line-1>n, m, k = map(int, input().split())</line-1>
<line-3>m -= n</line-3>
<line-4>left = k - 1</line-4>
<line-5>right = n - k</line-5>
<line-6></line-6>
<line-7>put = 1</line-7>
<line-8>while (m >= put):</line-8>
<line-9> m -= put</line-9>
<line-10> ans += 1</line-10>
<line-11> put += (left > 0) + (right > ... | {"code": "<line-2>ans = 1</line-2>\n<line-16> break</line-16>", "lines": [2, 16]}
#### 0 |
<line-1>N, M, K = list(map(int, input().split()))</line-1>
<line-3>S = [0]</line-3>
<line-4>for a in A:</line-4>
<line-5> S.append(S[-1]+M*a-K)</line-5>
<line-6>MI = [(10**50)] * M</line-6>
<line-7>ans = 0</line-7>
<line-8>for i in range(N+1):</line-8>
<line-9> MI[i%M] = min(MI[i%M], S[i])</line-9>
<line-10> f... | {"code": "<line-2>A = [int(a) for a in input().split()]</line-2>\n<line-11> ans = max(ans, (S[i]-MI[(i-j)%M] - K*((-j)%M))//M)</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>import math</line-1>
<line-3>if n == 0 : </line-3>
<line-4> print(0, 1)</line-4>
<line-5> print(0, m)</line-5>
<line-6> print(0, 0)</line-6>
<line-7> print(0, m - 1)</line-7>
<line-8>elif m == 0 : </line-8>
<line-9> print(1, 0)</line-9>
<line-10> print(n, 0)</line-10>
<line-11> print(0, 0)<... | {"code": "<line-2>n, m = list(map(int, input().split()))</line-2>\n<line-43> print(0, 0)</line-43>", "lines": [2, 43]}
#### 0 |
<line-1>import math</line-1>
<line-3></line-3>
<line-4>s = list(map(int, input()))</line-4>
<line-5>substr = input().rstrip()</line-5>
<line-6>t = list(map(int, substr))</line-6>
<line-7></line-7>
<line-8>m = len(s)</line-8>
<line-9>x, y = 0, m</line-9>
<line-10>z = (x + y) // 2</line-10>
<line-11>while z != x:</line-1... | {"code": "<line-2>from collections import Counter</line-2>\n<line-50>except ValueError:</line-50>", "lines": [2, 50]}
#### 0 |
<line-1>def main():</line-1>
<line-3> A = list(map(int, input().split()))</line-3>
<line-4> a = min(A)</line-4>
<line-5> b = max(A)</line-5>
<line-6> if a < mn or b > mx:</line-6>
<line-7> print("Incorrect")</line-7>
<line-8> return</line-8>
<line-9> cnt = 0</line-9>
<line-10> if a > mn:</line-10>
<line-11> cnt += 1... | {"code": "<line-2>\tn, m, mn, mx = map(int, input().split())</line-2>\n<line-17>\t\tprint(\"Incorrect\")</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>m = int(input())</line-1>
<line-3>while m > 0:</line-3>
<line-4> a += 5</line-4>
<line-5> b = a</line-5>
<line-6> c = 0</line-6>
<line-7> while b % 5 == 0:</line-7>
<line-8> b //= 5</line-8>
<line-9> c += 1</line-9>
<line-10> m -= c</line-10>
<line-11>if m < 0: print(0)</line-11>
<l... | {"code": "<line-2>a = 0</line-2>\n<line-13> print(5)</line-13>", "lines": [2, 13]}
#### 0 |
<line-1>def g():</line-1>
<line-3>n,m,k=g()</line-3>
<line-4>p=list(range(n+1))</line-4>
<line-5>z=[0]*(n+1)</line-5>
<line-6>for x in g():</line-6>
<line-7> z[x]=1</line-7>
<line-8>e=[]</line-8>
<line-9>for i in range(m):</line-9>
<line-10> u,v,w=g()</line-10>
<line-11> e+=[(w,u,v)]</line-11>
<line-12>e=sorted(e)</lin... | {"code": "<line-2> return list(map(int,input().split()))</line-2>\n<line-23> if z[v]==k:</line-23>", "lines": [2, 23]}
#### 0 |
<line-1>def main():</line-1>
<line-3> k = int(input())</line-3>
<line-4> n %= 6</line-4>
<line-5> a = [0, 1, 2]</line-5>
<line-6> for i in range(1, n + 1):</line-6>
<line-7> if (i % 2 == 1):</line-7>
<line-8> a[0], a[1] = a[1], a[0]</line-8>
<line-9> else:</line-9>
<line-10> a[1], a[2] = a[2], a[1]</line-10>
<lin... | {"code": "<line-2>\tn = int(input())</line-2>\n<line-11>\tprint(a[k])</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>INF = 10**9</line-3>
<line-4>minx = miny = INF</line-4>
<line-5>maxx = maxy = -INF</line-5>
<line-6></line-6>
<line-7>for i in range(n):</line-7>
<line-8> x1, y1, x2, y2 = list(map(int, input().split()))</line-8>
<line-9> s += abs(x1 - x2) * abs(y1 - y2)</line-9>
<line-10... | {"code": "<line-2>s = 0</line-2>\n<line-17>else:</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>def check(x, s):</line-1>
<line-3> for i in str(x):</line-3>
<line-4> k += int(i)</line-4>
<line-5> return x - k >= s</line-5>
<line-6></line-6>
<line-7></line-7>
<line-8>n, s = map(int, input().split())</line-8>
<line-9>l = 0</line-9>
<line-10>r = n</line-10>
<line-11>while r - l > 1:</line-11>
<l... | {"code": "<line-2> k = 0</line-2>\n<line-19>else:</line-19>", "lines": [2, 19]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>for i in range(n):</line-3>
<line-4> t = input().split(' ')</line-4>
<line-5> a = int(t[0])</line-5>
<line-6> b = int(t[1])</line-6>
<line-7> L[i] = (a, b)</line-7>
<line-8>if n <= 4:</line-8>
<line-9> print("YES")</line-9>
<line-10>else:</line-10>
<line-11> b... | {"code": "<line-2>L = [(0, 0)] * n</line-2>\n<line-38> else:</line-38>", "lines": [2, 38]}
#### 0 |
<line-1>mod=10**9+7</line-1>
<line-3></line-3>
<line-4>def POW(a,b):</line-4>
<line-5> if(b==0):</line-5>
<line-6> return 1</line-6>
<line-7> if(b&1):</line-7>
<line-8> return POW(a,b//2)**2*a%mod</line-8>
<line-9> else:</line-9>
<line-10> return POW(a,b//2)**2</line-10>
<line-11></line-11>
<line-12>def C(n,m):</lin... | {"code": "<line-2>f=[0]*500000</line-2>\n<line-28>\tans=(ans+t1*t2)%mod</line-28>", "lines": [2, 28]}
#### 0 |
<line-1>import itertools</line-1>
<line-3></line-3>
<line-4>def can_measure(a, d):</line-4>
<line-5> return any(i + d in a for i in a)</line-5>
<line-6></line-6>
<line-7>def main():</line-7>
<line-8> n, l, x, y = list(map(int, input().split()))</line-8>
<line-9> a = set(map(int, input().split()))</line-9>
<line-10> </l... | {"code": "<line-2>import math</line-2>\n<line-44>\tmain()</line-44>", "lines": [2, 44]}
#### 0 |
<line-1>import math</line-1>
<line-3>class SegmentTree():</line-3>
<line-4> def __init__(self, L, function = lambda x,y: x+y):</line-4>
<line-5> self.function = function</line-5>
<line-6> N = self.size = len(L)</line-6>
<line-7> M = 1 << N.bit_length()</line-7>
<line-8> self.margin = 2*M ... | {"code": "<line-2>from functools import reduce</line-2>\n<line-54> towers.modify(i+1, q + pie)</line-54>", "lines": [2, 54]}
#### 0 |
<line-1>def ii():</line-1>
<line-3>def mi():</line-3>
<line-4> return list(map(int, input().split()))</line-4>
<line-5>def li():</line-5>
<line-6> return list(mi())</line-6>
<line-7></line-7>
<line-8>n, k = mi()</line-8>
<line-9>h = li()</line-9>
<line-10>m = max(h)</line-10>
<line-11>f = [0] * (m + 1)</line-11>
... | {"code": "<line-2> return int(input())</line-2>\n<line-30> i = j</line-30>", "lines": [2, 30]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3></line-3>
<line-4>curr = 0</line-4>
<line-5>best = 0</line-5>
<line-6>prevs = [0] * 31</line-6>
<line-7>for v in l:</line-7>
<line-8> curr += v</line-8>
<line-9> if v >= 0:</line-9>
<line-10> for i in range(0, v):</line-10>
<line-11> prevs[i] = curr</lin... | {"code": "<line-2>l = list(map(int,input().split()))</line-2>\n<line-16> prevs[i] = min(prevs[i], curr)</line-16>", "lines": [2, 16]}
#### 0 |
<line-1>a, b, c = sorted(map(int, input().split()))</line-1>
<line-3> print('NO')</line-3>
<line-4>elif a == 3:</line-4>
<line-5> if b > 3:</line-5>
<line-6> print('NO')</line-6>
<line-7> elif b == 3:</line-7>
<line-8> if c > 3:</line-8>
<line-9> print('NO')</line-9>
<line-10> else:</line-10>
<line-11> print("YE... | {"code": "<line-2>if a > 3:</line-2>\n<line-24>\telse:</line-24>", "lines": [2, 24]}
#### 0 |
<line-1>#credits https://www.geeksforgeeks.org/minimum-steps-to-delete-a-ssing-after-repeated-deletion-of-palindrome-subssings/</line-1>
<line-2> </line-2>
<line-4>s=input()</line-4>
<line-5>N = len(s)</line-5>
<line-6>dp = [[0 for x in range(N + 1)] </line-6>
<line-7> for y in range(N + 1)]</line-7>
<line-8>D... | {"code": "<line-3>n=int(input())</line-3>\n<line-37> j += 1</line-37>", "lines": [3, 37]}
#### 0 |
<line-1>n=int(input())</line-1>
<line-3>m=int(input())</line-3>
<line-4>b=sorted(map(int,input().split()))</line-4>
<line-5>c=0</line-5>
<line-6>for i in range(n):</line-6>
<line-7> for j in range(m):</line-7>
<line-8> if abs(a[i]-b[j]) <= 1:</line-8>
<line-9> b[j]=-10</line-9>
<line-10> c+=1</line-10>
<l... | {"code": "<line-2>a=sorted(map(int,input().split()))</line-2>\n<line-11> break</line-11>", "lines": [2, 11]}
#### 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.