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)</line-11>
<line-12> a *= g</line-12>
<line-13> b *= g</line-13>
<line-14> if ans > max(a, b):</line-14>
<line-15> ans = max(a, b)</line-15>
<line-17></line-17>
<line-18>print(ab[0], ab[1])</line-18>
|
{"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[-1])</line-10>
<line-12>print(' '.join(map(str, B)))</line-12>
<line-13></line-13>
<line-14></line-14>
|
{"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>readline = sys.stdin.readline</line-10>
<line-11></line-11>
<line-12>N,K = map(int,readline().split())</line-12>
<line-13>A = list(map(int,readline().split()))</line-13>
<line-14></line-14>
<line-15>all = sum(A)</line-15>
<line-16>divisors = []</line-16>
<line-17>for i in range(1,int(all ** 0.5) + 1):</line-17>
<line-18> if all % i == 0:</line-18>
<line-19> divisors.append(i)</line-19>
<line-20> divisors.append(all // i)</line-20>
<line-21></line-21>
<line-22>divisors = sorted(divisors,reverse = True)</line-22>
<line-23></line-23>
<line-24>#print(divisors)</line-24>
<line-25></line-25>
<line-26>for d in divisors:</line-26>
<line-27> mods = [0] * (N)</line-27>
<line-28> for i in range(len(A)):</line-28>
<line-29> mods[i] = A[i] % d</line-29>
<line-30> mods = sorted(mods)</line-30>
<line-31> #print("d",d,"mods",mods)</line-31>
<line-32> mods_front = [0] * N</line-32>
<line-33> mods_front[0] = mods[0]</line-33>
<line-34> for i in range(1,N):</line-34>
<line-35> mods_front[i] = mods_front[i - 1] + mods[i]</line-35>
<line-36> mods_back = [0] * N</line-36>
<line-37> mods_back[-1] = d - mods[-1]</line-37>
<line-38> #print("mods_front",mods_front)</line-38>
<line-39> for i in range(N - 2,-1,-1):</line-39>
<line-40> mods_back[i] = mods_back[i + 1] + (d - mods[i])</line-40>
<line-41> #print("mods_back",mods_back)</line-41>
<line-42> for i in range(N - 1):</line-42>
<line-43> if mods_front[i] == mods_back[i + 1]:</line-43>
<line-44> if K >= min(mods_front[i],mods_back[i + 1]):</line-44>
<line-45> print(d)</line-45>
<line-46> return</line-46>
<line-48> print(1)</line-48>
|
{"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-11> else:</line-11>
<line-12> for i in range(n - 1, -1, -1):</line-12>
<line-13> if not (1 << i) & x:</line-13>
<line-14> ans.append(i + 1)</line-14>
<line-15> x ^= (1 << (i + 1)) - 1</line-15>
<line-16> break</line-16>
<line-17> t += 1</line-17>
<line-18> print(t)</line-18>
<line-19> print(*ans)</line-19>
<line-21></line-21>
<line-22>main()</line-22>
|
{"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>
<line-11>i+=k</line-11>
<line-12>while i<len(s) and s[i] not in ["G","T","#"]:</line-12>
<line-13> i+=k</line-13>
<line-14>if i>=len(s) or s[i]=="#":</line-14>
<line-15> print("NO")</line-15>
<line-17> print("YES")</line-17>
|
{"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-10>
<line-11> return True</line-11>
<line-12></line-12>
<line-13>def solve2():</line-13>
<line-14> w = -1</line-14>
<line-15> for i in range(n-1):</line-15>
<line-16> d = abs(a[i]-a[i+1])</line-16>
<line-17> if d != 1:</line-17>
<line-18> if w == -1:</line-18>
<line-19> w = d</line-19>
<line-20> elif w != d:</line-20>
<line-21> return False</line-21>
<line-22> if w <= 0:</line-22>
<line-23> return False</line-23>
<line-24> for i in range(n-1):</line-24>
<line-25> if abs(a[i]-a[i+1]) == 1 and (a[i]-1)//w != (a[i+1]-1)//w:</line-25>
<line-26> return False</line-26>
<line-27> print("YES\n%d %d" % (MAXN, w))</line-27>
<line-28> return True</line-28>
<line-29></line-29>
<line-30>if solve1():</line-30>
<line-31> pass</line-31>
<line-32>elif solve2():</line-32>
<line-33> pass</line-33>
<line-35> print("NO")</line-35>
|
{"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> index += 1</line-9>
<line-10> return ans</line-10>
<line-11></line-11>
<line-12>haystack = input()</line-12>
<line-13>needle = input()</line-13>
<line-14></line-14>
<line-15>pref = get_substr_ends(haystack, needle)</line-15>
<line-16>suff = get_substr_ends(haystack[::-1], needle[::-1])</line-16>
<line-17></line-17>
<line-18>pref_index = 0</line-18>
<line-19>suff_len = 0</line-19>
<line-20>while suff_len < len(suff) and suff[suff_len] < len(haystack):</line-20>
<line-21> suff_len += 1</line-21>
<line-22></line-22>
<line-23>suff_len -= 1</line-23>
<line-24>best_str = needle[len(needle) - suff_len:]</line-24>
<line-25></line-25>
<line-26>if len(best_str) == len(needle):</line-26>
<line-27> print(needle)</line-27>
<line-28> return</line-28>
<line-29></line-29>
<line-30>for pref_len in range(1, len(pref)):</line-30>
<line-31> while suff_len >= 0 and suff[suff_len] + pref[pref_len] + 2 > len(haystack):</line-31>
<line-32> suff_len -= 1</line-32>
<line-33> ans = pref_len + suff_len</line-33>
<line-34> if ans > len(best_str) and suff_len >= 0:</line-34>
<line-36></line-36>
<line-37>print(best_str if best_str else '-')</line-37>
|
{"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-11> if k1[0] > k2[0]:</line-11>
<line-12> k1 = k1[1:] + k2[0:1] + k1[0:1]</line-12>
<line-13> k2 = k2[1:]</line-13>
<line-14> else:</line-14>
<line-15> k2 = k2[1:] + k1[0:1] + k2[0:1]</line-15>
<line-16> k1 = k1[1:]</line-16>
<line-17> i += 1</line-17>
<line-18></line-18>
<line-19>if i > 10000:</line-19>
<line-20> print(-1)</line-20>
<line-21>else:</line-21>
<line-22> winner = 1</line-22>
<line-23> if len(k1) == 0:</line-23>
<line-25> print(i, winner)</line-25>
|
{"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>
<line-11> if i in s:</line-11>
<line-12> flag2 = True</line-12>
<line-13>for i in d2:</line-13>
<line-14> if i in s:</line-14>
<line-15> flag3 = True</line-15>
<line-16>for i in d3:</line-16>
<line-17> if i in s:</line-17>
<line-18> flag4 = True </line-18>
<line-19>if(flag1 and flag2 and flag3 and flag4):</line-19>
<line-20> print("Correct")</line-20>
<line-22> print("Too weak")</line-22>
<line-23></line-23>
|
{"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-11> if (a[j] + b[j]) % 2 == 1:</line-11>
<line-12> per = 1</line-12>
<line-13> break</line-13>
<line-14>if per == 1:</line-14>
<line-15> print(-1)</line-15>
<line-16>else:</line-16>
<line-17> ans = 0</line-17>
<line-18> for j in range(5):</line-18>
<line-19> if a[j] > b[j]:</line-19>
<line-21> print(ans)</line-21>
|
{"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("NO")</line-7>
<line-9> print("YES")</line-9>
|
{"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-13> print("YES")</line-13>
<line-14> print('1->0')</line-14>
<line-15></line-15>
<line-16>elif seq == [0, 0, 0]:</line-16>
<line-17> print("YES")</line-17>
<line-18> print("(0->0)->0")</line-18>
<line-19></line-19>
<line-20>elif seq == [1, 0, 0]:</line-20>
<line-21> print("NO")</line-21>
<line-22></line-22>
<line-23>elif seq[x-1] == 1:</line-23>
<line-24> print("NO")</line-24>
<line-25></line-25>
<line-26>#ENDS IN 1</line-26>
<line-27> </line-27>
<line-28>elif seq[x-2] == 1:</line-28>
<line-29> print("YES")</line-29>
<line-30></line-30>
<line-31> print('->'.join([str(x) for x in seq]))</line-31>
<line-32></line-32>
<line-33></line-33>
<line-34>#ENDS IN 10</line-34>
<line-35></line-35>
<line-36>elif seq == [1] * (x-2) + [0, 0]:</line-36>
<line-37> print("NO")</line-37>
<line-38></line-38>
<line-39>#000 BELOW</line-39>
<line-40>elif seq[x-3] == 0:</line-40>
<line-41> a = ('->'.join([str(x) for x in seq][0:x-3]))</line-41>
<line-42> print("YES")</line-42>
<line-43></line-43>
<line-44> print(a + '->(0->0)->0')</line-44>
<line-45></line-45>
<line-46>#100</line-46>
<line-47>else:</line-47>
<line-48> last = 0</line-48>
<line-49> for i in range(x-1):</line-49>
<line-50> if seq[i] == 0 and seq[i+1] == 1:</line-50>
<line-51> last = i</line-51>
<line-52> seq[last] = '(0'</line-52>
<line-53> seq[last+1] = '(1'</line-53>
<line-54> seq[x-2] = '0))'</line-54>
<line-56> print('->'.join([str(x) for x in seq]))</line-56>
|
{"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> return ans</line-12>
<line-13></line-13>
<line-14></line-14>
<line-15>def main():</line-15>
<line-16> n, x, pos = list(map(int, input().split()))</line-16>
<line-17> chk1 = 0</line-17>
<line-18> chk_r = 0</line-18>
<line-19> left = 0</line-19>
<line-20> right = n</line-20>
<line-21> while left < right:</line-21>
<line-22> middle = (left + right) // 2</line-22>
<line-23> if middle <= pos:</line-23>
<line-24> if middle < pos:</line-24>
<line-25> chk1 += 1</line-25>
<line-26> left = middle + 1</line-26>
<line-27> else:</line-27>
<line-28> chk_r += 1</line-28>
<line-29> right = middle</line-29>
<line-30> if chk1 > x - 1 or chk_r > n - x:</line-30>
<line-31> print(0)</line-31>
<line-32> else:</line-32>
<line-33> # (x - 1)! / (x - 1 - chk1)! * (n - x)! / (n - x - chk_r)! * (n - chk1 - chk_r - 1)!</line-33>
<line-34> rest = n - chk1 - chk_r - 1</line-34>
<line-36></line-36>
<line-37></line-37>
<line-38>main()</line-38>
|
{"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-11> else:</line-11>
<line-12> p += 1</line-12>
<line-13> c += 1</line-13>
<line-14>if k < c:</line-14>
<line-15> print("Impossible")</line-15>
<line-16>elif (not has_star) and (k > p):</line-16>
<line-17> print("Impossible")</line-17>
<line-18>else:</line-18>
<line-19> signs_to_add = k - c</line-19>
<line-20> ans = ""</line-20>
<line-21> for i in s:</line-21>
<line-22> if signs_to_add == 0:</line-22>
<line-23> if i not in ['*', '?']:</line-23>
<line-24> ans += i</line-24>
<line-25> else:</line-25>
<line-26> ans = ans[:-1]</line-26>
<line-27> continue</line-27>
<line-28> if i == '?':</line-28>
<line-29> signs_to_add -= 1</line-29>
<line-30> elif i == '*':</line-30>
<line-31> signs_to_add -= 1</line-31>
<line-32> while signs_to_add > 0:</line-32>
<line-33> ans += ans[-1]</line-33>
<line-34> signs_to_add -= 1</line-34>
<line-35> else:</line-35>
<line-37> print(ans)</line-37>
<line-38></line-38>
|
{"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)</line-12>
<line-13> while i<10:</line-13>
<line-14> j=(-i*p)%k</line-14>
<line-15> f=0</line-15>
<line-16> while f<k:</line-16>
<line-17> E[f]+=F[j]</line-17>
<line-18> f+=1</line-18>
<line-19> j+=1</line-19>
<line-20> if j==k:j=0</line-20>
<line-21> i+=1</line-21>
<line-22> r+=E[0]*P</line-22>
<line-23> p=p*10%k</line-23>
<line-24> E[0]=0</line-24>
<line-25> i=1</line-25>
<line-26> while i<k:</line-26>
<line-27> F[i]=(F[i]+E[i])%m</line-27>
<line-28> i+=1</line-28>
<line-29># print(E,P)</line-29>
<line-30> F[0]=1</line-30>
<line-31>#print("r=",r)</line-31>
<line-32>print(r%m)</line-32>
<line-33>#i=10**n</line-33>
<line-34>#j=10**(n-1)</line-34>
<line-35>#r=0</line-35>
<line-36>#F=[0]*k</line-36>
<line-37>#while j<i:</line-37>
<line-38># x=str(j)</line-38>
<line-39># l=len(x)</line-39>
<line-40># a=l</line-40>
<line-41># while a:</line-41>
<line-42># a-=1</line-42>
<line-43># s=int(x[a:l])</line-43>
<line-44># if s>0 and s%k==0:</line-44>
<line-45># r+=1</line-45>
<line-46># break</line-46>
<line-47># j+=1</line-47>
<line-48>#print()</line-48>
<line-49>#print(r)</line-49>
<line-50>"""</line-50>
<line-51>3 6 9</line-51>
<line-52>13 16 19 12 15 18</line-52>
<line-53>23 26 29 21 24 27</line-53>
<line-54>33 36 39 30</line-54>
<line-55>43 46 49 42 45 48</line-55>
<line-56>53 56 59 51 54 57</line-56>
<line-57>63 66 69 60</line-57>
<line-58>73 76 79 72 75 78</line-58>
<line-59>83 86 89 81 84 87</line-59>
<line-61>"""</line-61>
|
{"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/EIoDeGh96ZRC0szR0F6QPjTI7lt4fCsMuoVCqREGgqqH6qjIxBSZo</line-5>
<line-6>cADdTZTXIFie6dCZM8BhDwJOp7SDZuz6zLn3OMXplv+uTKCKwWAdKECDysxLoKzxs1Z4fpRObkb5</line-6>
<line-7>6ZfNTDSDbimlAo44+QDPLI4+MzRBYy1Yto0bxPqINTzCOe7uKSsUlQPKFJFzFtmkWlN3dhKcmhpu</line-7>
<line-8>2xw05R14FyyG1NSwdQm/QJxwY/+93OKGdA2uRgtt3hPp1RALLjzV2OkYmZSJCB40ku/AISORju2M</line-8>
<line-9>XOEPkISOLVzJ/ShtPCedXfwLCdxjfPIDQSHUSQ==</line-9>
<line-10>""".encode())</line-10>
<line-11>pro = zlib.decompress(pro)</line-11>
<line-13>exec(pro)</line-13>
|
{"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-9>
<line-10></line-10>
<line-11> nn = n</line-11>
<line-12> mm = m</line-12>
<line-13></line-13>
<line-14> nn -= two</line-14>
<line-15> mm -= three</line-15>
<line-16> nn = max(nn, 0)</line-16>
<line-17> mm = max(mm, 0)</line-17>
<line-18> if (six >= nn + mm):</line-18>
<line-19> end = mid</line-19>
<line-20> else:</line-20>
<line-22>print(end)</line-22>
|
{"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-10>
<line-11> a.append(int(input()))</line-11>
<line-12>b = list(set(a[::]))</line-12>
<line-13>if(len(b) == 2 and a.count(a[0]) == n//2):</line-13>
<line-14> print("YES")</line-14>
<line-16>else: print("NO") </line-16>
|
{"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 i in range(k):</line-12>
<line-13> x = min((a[i]+1)//4, cnt4)</line-13>
<line-14> cnt4 -= x</line-14>
<line-15> a[i] = max(0, a[i]-4*x)</line-15>
<line-16></line-16>
<line-17>cnt2 += cnt4</line-17>
<line-18>cnt1 += cnt4</line-18>
<line-19>for i in range(k):</line-19>
<line-20> x = min(a[i]//2, cnt2)</line-20>
<line-21> cnt2 -= x</line-21>
<line-22> a[i] = max(0, a[i]-2*x)</line-22>
<line-23></line-23>
<line-24>cnt1 += cnt2</line-24>
<line-25>for i in range(k):</line-25>
<line-26> cnt1 -= a[i]</line-26>
<line-27></line-27>
<line-28>if (cnt1 < 0):</line-28>
<line-29> print('NO')</line-29>
<line-31> print('YES')</line-31>
<line-32></line-32>
<line-33></line-33>
<line-34> </line-34>
<line-35></line-35>
|
{"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>
<line-12>print(t,mn)</line-12>
|
{"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> n-=1</line-11>
<line-12> else :</line-12>
<line-13> break</line-13>
<line-14>if n != 1 :</line-14>
<line-15> for i in range(len(a)-1,-1,-1) :</line-15>
<line-16> if a[i][0].find('*') == -1 :</line-16>
<line-17> n-=1</line-17>
<line-18> else :</line-18>
<line-19> break</line-19>
<line-20>#print(n)</line-20>
<line-21></line-21>
<line-22>M = m</line-22>
<line-23>br = 0</line-23>
<line-24>for i in range(m) :</line-24>
<line-25> count = 0</line-25>
<line-26> for j in range(len(a)) :</line-26>
<line-27> if a[j][0][i] != ('*') :</line-27>
<line-28> count+=1</line-28>
<line-29> else :</line-29>
<line-30> br = 1</line-30>
<line-31> break</line-31>
<line-32> if br == 1 :</line-32>
<line-33> break</line-33>
<line-34> if count == N :</line-34>
<line-35> m-=1</line-35>
<line-36>br = 0</line-36>
<line-37>if m != 1 :</line-37>
<line-38> for i in range(M-1,-1,-1) :</line-38>
<line-39> count = 0</line-39>
<line-40> for j in range(len(a)) :</line-40>
<line-41> if a[j][0][i] != ('*') :</line-41>
<line-42> count+=1</line-42>
<line-43> else :</line-43>
<line-44> br = 1</line-44>
<line-45> break</line-45>
<line-46> if br == 1 :</line-46>
<line-47> break</line-47>
<line-48> if count == N :</line-48>
<line-49> m-=1</line-49>
<line-50>#print(m)</line-50>
<line-51>if m > n :</line-51>
<line-52> print(m)</line-52>
<line-54> print(n)</line-54>
|
{"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]*M for _ in range(M)]</line-10>
<line-11>for i in range(M):</line-11>
<line-12> if i > 0: X[i-1][i] = ((K-i+1)**2*inv)%P</line-12>
<line-13> if i < M-1: X[i+1][i] = (N-2*K+i+1)*(i+1)*inv%P</line-13>
<line-14> X[i][i] = (1-((K-i)**2*inv)-(N-2*K+i)*(i)*inv)%P</line-14>
<line-15></line-15>
<line-16>def ddd(n):</line-16>
<line-17> for i in range(1, 100):</line-17>
<line-18> if (n*i%P) < 100:</line-18>
<line-19> return (n*i%P), i</line-19>
<line-20> return -1, -1</line-20>
<line-21>def poww(MM, n):</line-21>
<line-22> if n == 1:</line-22>
<line-23> return MM</line-23>
<line-24> if n % 2:</line-24>
<line-25> return mult(poww(MM, n-1), MM)</line-25>
<line-26> return poww(mult(MM,MM), n//2)</line-26>
<line-27>def mult(M1, M2):</line-27>
<line-28> Y = [[0] * M for _ in range(M)]</line-28>
<line-29> for i in range(M):</line-29>
<line-30> for j in range(M):</line-30>
<line-31> for k in range(M):</line-31>
<line-32> Y[i][j] += M1[i][k] * M2[k][j]</line-32>
<line-33> Y[i][j] %= P</line-33>
<line-34> return Y</line-34>
<line-35></line-35>
<line-37></line-37>
<line-38>print(X[S][K])</line-38>
|
{"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>def check(a, b, c, d, h):</line-11>
<line-12> x1, y1 = seg(a, d, h)</line-12>
<line-13> x2, y2 = seg(b, c, h)</line-13>
<line-14> return max(x1, x2) <= min(y1, y2)</line-14>
<line-15></line-15>
<line-16>a, b = list(map(int, input().split()))</line-16>
<line-17>c, d = list(map(int, input().split()))</line-17>
<line-18>l = 0</line-18>
<line-19>r = max(abs(a), abs(b), abs(c), abs(d))</line-19>
<line-20>for i in range(100):</line-20>
<line-21> m = (l + r) / 2</line-21>
<line-22> if check(a, b, c, d, m):</line-22>
<line-23> r = m</line-23>
<line-24> else:</line-24>
<line-26>print((r + l) / 2)</line-26>
<line-27></line-27>
|
{"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> if i == '1':</line-11>
<line-12> if a > 0:</line-12>
<line-13> a -= 1</line-13>
<line-14> elif b > 0:</line-14>
<line-15> b -= 1</line-15>
<line-16> c += 1</line-16>
<line-17> elif c > 0:</line-17>
<line-18> c -= 1</line-18>
<line-19> else:</line-19>
<line-21>print(o)</line-21>
|
{"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 = res * x % M</line-11>
<line-12> return res</line-12>
<line-13></line-13>
<line-14>def cal(x, y):</line-14>
<line-15> y += x - 1</line-15>
<line-16> res = 1</line-16>
<line-17> for i in range(1, x + 1):</line-17>
<line-18> res = res * (y - i + 1)</line-18>
<line-19> res = res * pw(i, M - 2) % M</line-19>
<line-20> return res % M</line-20>
<line-21></line-21>
<line-22>n = int(input())</line-22>
<line-23>a = []</line-23>
<line-24>b = []</line-24>
<line-25>res = 1</line-25>
<line-26>for i in range(n):</line-26>
<line-27> a.append(list(map(int, input().split())))</line-27>
<line-28> res = res * (a[-1][1] + 1 - a[-1][0]) % M</line-28>
<line-29> b.append(a[-1][0])</line-29>
<line-30> b.append(a[-1][1] + 1)</line-30>
<line-31> b = set(b)</line-31>
<line-32> b = sorted(list(b))</line-32>
<line-33></line-33>
<line-34>g = [b[i + 1] - b[i] for i in range(len(b) - 1)]</line-34>
<line-35></line-35>
<line-36>for i in range(n):</line-36>
<line-37> a[i][0] = bisect_left(b, a[i][0])</line-37>
<line-38> a[i][1] = bisect_left(b, a[i][1] + 1)</line-38>
<line-39></line-39>
<line-40>a = a[::-1]</line-40>
<line-41></line-41>
<line-42>f = [[0 for _ in range(len(b))] for __ in range(n)]</line-42>
<line-43></line-43>
<line-44>for i in range(a[0][0], len(b)):</line-44>
<line-45> if i == 0:</line-45>
<line-46> f[0][i] = g[i]</line-46>
<line-47> else:</line-47>
<line-48> if i < a[0][1]:</line-48>
<line-49> f[0][i] = (f[0][i - 1] + g[i]) % M</line-49>
<line-50> else:</line-50>
<line-51> f[0][i] = f[0][i - 1]</line-51>
<line-52> </line-52>
<line-53>for i in range(1, n):</line-53>
<line-54> for j in range(a[i][0], len(b)):</line-54>
<line-55> if j > 0:</line-55>
<line-56> f[i][j] = f[i][j - 1]</line-56>
<line-57> if j < a[i][1]:</line-57>
<line-58> for k in range(i, -1, -1):</line-58>
<line-59> if a[k][1] <= j or j < a[k][0]:</line-59>
<line-60> break</line-60>
<line-61> if k == 0 or j != 0:</line-61>
<line-62> tmp = cal(i - k + 1, g[j])</line-62>
<line-63> if k > 0:</line-63>
<line-64> f[i][j] += f[k - 1][j - 1] * tmp % M</line-64>
<line-65> else:</line-65>
<line-66> f[i][j] += tmp</line-66>
<line-67> f[i][j] %= M</line-67>
<line-68> </line-68>
<line-69>#print(f)</line-69>
<line-71>print(f[n - 1][len(b) - 1] * pw(res, M - 2) % M)</line-71>
|
{"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-12> </line-12>
<line-13>print(doit())</line-13>
|
{"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>
<line-11>if h1 >= h2:</line-11>
<line-12> print(0)</line-12>
<line-13> return</line-13>
<line-15>print(day)</line-15>
|
{"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 // Wr)*Hr)</line-10>
<line-11> </line-11>
<line-12>elif (C // Wr) == 0:</line-12>
<line-13> print((C // Wb)*Hb)</line-13>
<line-14></line-14>
<line-15>else:</line-15>
<line-16> nmax = (C // Wr)</line-16>
<line-17> pmax = nmax*Hr + ((C - nmax*Wr) // Wb) * Hb</line-17>
<line-18> dmax = ((C - (nmax-0)*Wr) % Wb)</line-18>
<line-19> #print(0, pmax, dmax)</line-19>
<line-20> </line-20>
<line-21> #</line-21>
<line-22> #pm1 = (nmax-1)*Hr + ((C - (nmax-1)*Wr) // Wb) * Hb </line-22>
<line-23> #if pm1>pmax:</line-23>
<line-24> # pmax = pm1</line-24>
<line-25> if Hr/Wr > Hb/Wb:</line-25>
<line-26> dx = dmax * (Hb/Wb) / (Hr/Wr - Hb/Wb) </line-26>
<line-27> elif Hr/Wr < Hb/Wb: </line-27>
<line-28> dx = 0 </line-28>
<line-29> else:</line-29>
<line-30> dx = Wb * Wr</line-30>
<line-31> if Wr<Wb:</line-31>
<line-32> nmax = (C // Wb)</line-32>
<line-33> pmax = nmax*Hb + ((C - nmax*Wb) // Wr) * Hr </line-33>
<line-34> if Wr>Wb:</line-34>
<line-35> nmax = (C // Wr)</line-35>
<line-36> pmax = nmax*Hr + ((C - nmax*Wr) // Wb) * Hb </line-36>
<line-37> </line-37>
<line-38> if Wr>Wb and dx>0: </line-38>
<line-39> for k in range(1, C//Wr):</line-39>
<line-40> if k*Wr > dx:</line-40>
<line-41> break</line-41>
<line-42> pk = (nmax-k)*Hr + ((C - (nmax-k)*Wr) // Wb) * Hb </line-42>
<line-43> dk = ((C - (nmax-k)*Wr) % Wb)</line-43>
<line-44> #print(k, pmax, pk, dk)</line-44>
<line-45> if pk>pmax:</line-45>
<line-46> pmax = pk</line-46>
<line-47> if dk==0 :</line-47>
<line-48> break</line-48>
<line-49> elif Wr<Wb and dx>0: </line-49>
<line-50> for j in range(1, C//Wb+1):</line-50>
<line-51> k = nmax - (C-j*Wb)//Wr</line-51>
<line-52> if k*Wr > dx:</line-52>
<line-53> break</line-53>
<line-54> </line-54>
<line-55> pk = (nmax-k)*Hr + ((C - (nmax-k)*Wr) // Wb) * Hb </line-55>
<line-56> dk = ((C - (nmax-k)*Wr) % Wb)</line-56>
<line-57> #print(j, k, pmax, pk, dk, (nmax-k), ((C - (nmax-k)*Wr) // Wb) )</line-57>
<line-58> if pk>pmax:</line-58>
<line-59> pmax = pk</line-59>
<line-60> #dmax = dk</line-60>
<line-61> if dk==0 :</line-61>
<line-62> break </line-62>
<line-63> </line-63>
<line-64># elif Wr<Wb and dx>0: </line-64>
<line-65># for j in range(1, C//Wb+1):</line-65>
<line-66># k = (j*Wb - dmax)//Wr</line-66>
<line-67># if k*Wr > dx:</line-67>
<line-68># break</line-68>
<line-69># pk = (nmax-k)*Hr + ((C - (nmax-k)*Wr) // Wb) * Hb </line-69>
<line-70># dk = ((C - (nmax-k)*Wr) % Wb)</line-70>
<line-71># print(j, k, pmax, pk, dk, (nmax-k), ((C - (nmax-k)*Wr) // Wb) )</line-71>
<line-72># if pk>pmax:</line-72>
<line-73># pmax = pk</line-73>
<line-74># #dmax = dk</line-74>
<line-75># if dk==0 :</line-75>
<line-77> </line-77>
<line-78> print(pmax) </line-78>
|
{"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 cd == 0:</line-11>
<line-12> cr += 1</line-12>
<line-13> countr -= 1</line-13>
<line-14> news.append('D')</line-14>
<line-15> else:</line-15>
<line-16> cd -= 1</line-16>
<line-17> else:</line-17>
<line-18> if cr == 0:</line-18>
<line-19> cd += 1</line-19>
<line-20> countd -= 1</line-20>
<line-21> news.append('R')</line-21>
<line-22> else:</line-22>
<line-23> cr -= 1</line-23>
<line-24> i += 1</line-24>
<line-25> if i >= n:</line-25>
<line-26> s = list(news)</line-26>
<line-27> news = []</line-27>
<line-28> n = len(s)</line-28>
<line-29> i = 0</line-29>
<line-30> </line-30>
<line-31>if countr > 0:</line-31>
<line-32> print('R')</line-32>
<line-34> print('D')</line-34>
|
{"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 // x, b // y))</line-13>
|
{"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-9>
<line-10> i += 1</line-10>
<line-11>if (k > 1):</line-11>
<line-12> a.append([k, 1])</line-12>
<line-13>ans = 10 ** 20</line-13>
<line-14>for i in a:</line-14>
<line-15> cnt = 0</line-15>
<line-16> x = i[0]</line-16>
<line-17> while (x <= n):</line-17>
<line-18> cnt += n // x;</line-18>
<line-19> x *= i[0]</line-19>
<line-21>print(ans)</line-21>
|
{"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> dist+=a1</line-12>
<line-13> far=max(dist,far)</line-13>
<line-14> else:</line-14>
<line-15> dist-=b1</line-15>
<line-16> if dists[dist]==-1:</line-16>
<line-17> dists[dist]=far</line-17>
<line-18>tot=0</line-18>
<line-19>for i in range(a1+b1):</line-19>
<line-20> if i*g<=m and dists[i]*g<=m:</line-20>
<line-21> tot+=(m+1-dists[i]*g)</line-21>
<line-22>if alls<m:</line-22>
<line-23> mod=m%g</line-23>
<line-24> times=m//g</line-24>
<line-25> diff=times-a1-b1</line-25>
<line-26> tot1=g*(diff*(diff+1)//2)+(mod+1)*(diff+1)</line-26>
<line-28>print(tot)</line-28>
|
{"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:</line-9>
<line-10> aux = abs(y2 - y1)</line-10>
<line-11> print(x1 + aux, y1, x1 + aux, y2)</line-11>
<line-12>elif y1 == y2:</line-12>
<line-14> print(x1, y1 + aux, x2, y1 + aux)</line-14>
|
{"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> break</line-11>
<line-12>if not f:</line-12>
<line-13> print('NO')</line-13>
<line-14>else:</line-14>
<line-15> print('YES')</line-15>
<line-16> l = 0</line-16>
<line-17> i = ln + 1</line-17>
<line-18> ans = []</line-18>
<line-19> while i < len(a):</line-19>
<line-20> if a[i] == 0:</line-20>
<line-21> i += 1</line-21>
<line-22> else:</line-22>
<line-23> ans.append((l+1, i))</line-23>
<line-24> l = i</line-24>
<line-25> i += 1</line-25>
<line-26> if l < len(a):</line-26>
<line-27> ans.append((l+1, i))</line-27>
<line-28> print(len(ans))</line-28>
<line-30> print(i[0],i[1])</line-30>
<line-31></line-31>
|
{"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> print(((pow(2,sets,MOD)-1)*2*k+rem+num1fin)%MOD)</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> return</line-11>
<line-12></line-12>
<line-13>if k > 1:</line-13>
<line-14> for i in range(k):</line-14>
<line-15> t = n[i] * 10</line-15>
<line-16> for j in range(i+1, k):</line-16>
<line-17> if (t+n[j]) % 8 == 0:</line-17>
<line-18> print("YES")</line-18>
<line-19> print(t+n[j])</line-19>
<line-20> return</line-20>
<line-21>if k > 2:</line-21>
<line-22> for i in range(k):</line-22>
<line-23> t = n[i]*100</line-23>
<line-24> for j in range(i+1, k):</line-24>
<line-25> l = n[j]*10</line-25>
<line-26> for e in range(j+1, k):</line-26>
<line-27> #print(t, l, n[e])</line-27>
<line-28> if (t+l+n[e]) % 8 == 0:</line-28>
<line-29> print("YES")</line-29>
<line-30> print(t+l+n[e])</line-30>
<line-32>print("NO")</line-32>
|
{"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:</line-12>
<line-13> print(-1)</line-13>
<line-14> return</line-14>
<line-15></line-15>
<line-16> for i in range(m):</line-16>
<line-17> k, f = map(int, input().split())</line-17>
<line-18> low = max(low, (k + f - 1) // f)</line-18>
<line-19> if (f > 1):</line-19>
<line-20> high = min(high, (k - 1) // (f - 1))</line-20>
<line-21> if (floo(n, low) == floo(n, high)):</line-21>
<line-22> print(floo(n, low))</line-22>
<line-23> else:</line-23>
<line-25></line-25>
<line-26></line-26>
<line-27></line-27>
<line-28>main()</line-28>
|
{"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] == '0':</line-11>
<line-12> answer += 1</line-12>
<line-13> f[0][i + 1] = 'X'</line-13>
<line-14> elif f[1][i + 1] == '0':</line-14>
<line-15> answer += 1</line-15>
<line-16> f[1][i + 1] = 'X'</line-16>
<line-17></line-17>
<line-18> elif (f[1][i] == '0' or f[0][i] == '0') and i + 1 < n and f[0][i + 1] == f[1][i + 1] == '0':</line-18>
<line-19> answer += 1</line-19>
<line-21></line-21>
<line-22></line-22>
<line-23>print(answer)</line-23>
|
{"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-10>
<line-11>for i in range(n):</line-11>
<line-12> for j in range(i,n):</line-12>
<line-13> b = a[i:j+1]</line-13>
<line-14> for k in b:</line-14>
<line-15> if k.lower() != k:</line-15>
<line-16> break</line-16>
<line-17> else:</line-17>
<line-18> b = set(b)</line-18>
<line-20>print(ans) </line-20>
|
{"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>
<line-11>cur = 0</line-11>
<line-12>cnt = b</line-12>
<line-13>go = 0</line-13>
<line-14>ans = 0</line-14>
<line-15>while cur < tot:</line-15>
<line-16> go = 1-go</line-16>
<line-17> if(go == 1):</line-17>
<line-18> if cnt < s and cnt < tot-cur:</line-18>
<line-19> if(cnt < f):</line-19>
<line-20> print(-1)</line-20>
<line-21> break</line-21>
<line-22> cnt = b</line-22>
<line-23> ans += 1</line-23>
<line-24> cnt -= (a-f)</line-24>
<line-25> else: cnt -= a </line-25>
<line-26> else:</line-26>
<line-27> if cnt < a+f and cnt < tot-cur:</line-27>
<line-28> if(cnt < a-f):</line-28>
<line-29> print(-1)</line-29>
<line-30> break</line-30>
<line-31> cnt = b</line-31>
<line-32> ans += 1</line-32>
<line-33> cnt -= (f)</line-33>
<line-34> else:cnt -= a </line-34>
<line-35> cur += a</line-35>
<line-36> # print(cur,cnt,ans) </line-36>
<line-37> if(cnt < 0):</line-37>
<line-38> print(-1)</line-38>
<line-39> break</line-39>
<line-41> print(ans)</line-41>
|
{"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> x = x[b:]</line-9>
<line-10> for l in range(j):</line-10>
<line-11> print(x[:c])</line-11>
<line-12> x = x[c:]</line-12>
<line-14>print(-1)</line-14>
|
{"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)</line-10>
<line-11> end.append(x)</line-11>
<line-12> else:</line-12>
<line-13> end[-1] = x</line-13>
<line-14></line-14>
<line-15>last = 0</line-15>
<line-16>R = []</line-16>
<line-17>J = []</line-17>
<line-18></line-18>
<line-19>for i in range(1, len(beg)):</line-19>
<line-20> R.append(beg[i] - 1 - last)</line-20>
<line-21> last = (beg[i] - 1)</line-21>
<line-22> </line-22>
<line-23> J.append(end[i] + 1 - last)</line-23>
<line-24> last = (end[i] + 1)</line-24>
<line-25></line-25>
<line-26>ok = True</line-26>
<line-27>for x in J:</line-27>
<line-28> if (x > d):</line-28>
<line-29> ok = False</line-29>
<line-30>for x in R:</line-30>
<line-31> if (x < s):</line-31>
<line-32> ok = False</line-32>
<line-33></line-33>
<line-34></line-34>
<line-35>if ok:</line-35>
<line-36> for i in range(len(R)):</line-36>
<line-37> print('RUN', R[i])</line-37>
<line-38> print('JUMP', J[i])</line-38>
<line-39> if (last < m):</line-39>
<line-40> print('RUN', m - last)</line-40>
<line-42> print('IMPOSSIBLE')</line-42>
|
{"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</line-10>
<line-11> x //= 2</line-11>
<line-12>for i in p[::-1]:</line-12>
<line-13> if s >= i: s -= i</line-13>
<line-15>print(ans)</line-15>
|
{"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-10> if t % (k + k + 1) >= k + 1:</line-10>
<line-11> if 2 + t // (k + k + 1) < answer_n:</line-11>
<line-12> answer = i + 1</line-12>
<line-13> answer_n = 2 + t // (k + k + 1)</line-13>
<line-14> if t % (k + k + 1) == 0:</line-14>
<line-15> if 1 + t // (k + k + 1) < answer_n:</line-15>
<line-16> answer = i + 1</line-16>
<line-17> answer_n = 1 + t // (k + k + 1) </line-17>
<line-18> print(answer_n)</line-18>
<line-19> while answer <= n:</line-19>
<line-21> answer += k + k + 1</line-21>
<line-22> </line-22>
|
{"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) and s[x]==s2[i]:</line-11>
<line-12> i+=1</line-12>
<line-13> if(i==len(s2)):</line-13>
<line-14> ans=min(ans,len(s)-i)</line-14>
<line-15>if(ans==len(s)):</line-15>
<line-16> print(-1)</line-16>
<line-18> print(ans)</line-18>
|
{"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))</line-11>
<line-12>x=n</line-12>
<line-13>while x>0:</line-13>
<line-14> y=x//2</line-14>
<line-15> a.append(x-y)</line-15>
<line-16> x=y</line-16>
<line-17>c=[sum(a[i:]) for i in range(k+1)]</line-17>
<line-18>b=[n//(3*2**i)-n//(6*2**i) for i in range(k+1)]</line-18>
<line-19>d=[n//2**i-n//(3*2**i) for i in range(k+1)]</line-19>
<line-20>facs=[1]*(n+1)</line-20>
<line-21>for i in range(2,n+1):</line-21>
<line-22> facs[i]=(i*facs[i-1])%p</line-22>
<line-23>if n<3*(2**(k-1)):</line-23>
<line-24> start=k</line-24>
<line-25>else:</line-25>
<line-26> start=0</line-26>
<line-27>tot=0</line-27>
<line-28>for j in range(start,k+1):</line-28>
<line-29> prod=1</line-29>
<line-30> for i in range(j,k):</line-30>
<line-31> prod*=b[i]</line-31>
<line-32> prod*=d[j]</line-32>
<line-33> for i in range(j):</line-33>
<line-34> prod*=a[i]</line-34>
<line-35> prod%=p</line-35>
<line-36> prod*=facs[n]</line-36>
<line-37> e=[a[i] for i in range(j)]+[d[j]]+[b[i] for i in range(j,k)]</line-37>
<line-38> f=[sum(e[:i+1]) for i in range(k+1)]</line-38>
<line-39> g=1</line-39>
<line-40> for guy in f:</line-40>
<line-41> g*=guy</line-41>
<line-42> prod*=inv(g,p)</line-42>
<line-43> prod%=p</line-43>
<line-45>print(tot%p)</line-45>
|
{"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-10> print("YES")</line-10>
<line-12>print("NO")</line-12>
|
{"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 in range(len(B)):</line-10>
<line-11> r=A[e]</line-11>
<line-12> A[e]=L[x]</line-12>
<line-13> if(Solve(x+1,tuple(sorted(A)))):</line-13>
<line-14> Mem[(X,x,B)]=True</line-14>
<line-15> return True</line-15>
<line-16> A[e]=r</line-16>
<line-17> A+=[L[x]]</line-17>
<line-18> if(Solve(x+1,tuple(sorted(A)))):</line-18>
<line-19> Mem[(X,x,B)]=True</line-19>
<line-20> return True</line-20>
<line-21> Mem[(X,x,B)]=False</line-21>
<line-22> return False</line-22>
<line-23></line-23>
<line-24>def Form(x,B):</line-24>
<line-25> for i in range(len(B)):</line-25>
<line-26> for j in range(i,len(B)):</line-26>
<line-27> if(B[i]+B[j]==x):</line-27>
<line-28> return True</line-28>
<line-29> return False</line-29>
<line-30> </line-30>
<line-31>n=int(input())</line-31>
<line-32>L=list(map(int,input().split()))</line-32>
<line-33>done=False</line-33>
<line-34>Mem={}</line-34>
<line-35>for X in range(1,n+1):</line-35>
<line-36> if(Solve(1,(L[0],))):</line-36>
<line-37> print(X)</line-37>
<line-38> done=True</line-38>
<line-39> break</line-39>
<line-41> print(-1)</line-41>
|
{"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>
<line-10> for k in range(1, m+1):</line-10>
<line-11> e = t.count(k)==com[k-1] and e</line-11>
<line-12> if e:</line-12>
<line-13> res = True</line-13>
<line-14> break</line-14>
<line-15> </line-15>
<line-17>else: print('NO')</line-17>
|
{"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")</line-10>
<line-12> print("Friendship is magic!^^")</line-12>
|
{"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>
<line-11> for X in range(c):</line-11>
<line-12> if not b[Y][X].isdigit():</line-12>
<line-13> continue</line-13>
<line-14> p = 0</line-14>
<line-15> for dy in range(-1, 2):</line-15>
<line-16> for dx in range(-1, 2):</line-16>
<line-17> y = Y + dy</line-17>
<line-18> x = X + dx</line-18>
<line-19> if 0 <= y < r and 0 <= x < c:</line-19>
<line-20> p += b[y][x] == '*'</line-20>
<line-21> if p != int(b[Y][X]):</line-21>
<line-23></line-23>
<line-24>print(["NO", "YES"][ok])</line-24>
|
{"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 * 2 >= total</line-12>
<line-13></line-13>
<line-14>n = int(input())</line-14>
<line-15></line-15>
<line-16>le = 0</line-16>
<line-17>rg = n</line-17>
<line-18></line-18>
<line-19>while rg - le > 1:</line-19>
<line-20> mid = (rg + le) // 2</line-20>
<line-21></line-21>
<line-22> if can(n, mid):</line-22>
<line-23> rg = mid</line-23>
<line-24> else:</line-24>
<line-26></line-26>
<line-27>print(rg)</line-27>
|
{"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 > 0)</line-11>
<line-12> if (left): left -= 1</line-12>
<line-13> if (right): right -= 1</line-13>
<line-14> if (left == right == 0):</line-14>
<line-15> ans += (m // put)</line-15>
<line-17>print(ans)</line-17>
|
{"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> for j in range(M):</line-10>
<line-12>print(ans)</line-12>
<line-13></line-13>
|
{"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)</line-11>
<line-12> print(n - 1, 0)</line-12>
<line-13>else :</line-13>
<line-14> l = math.sqrt((n - 1) ** 2 + m ** 2) + math.sqrt(n ** 2 + m ** 2) + math.sqrt(n ** 2 + (m - 1) ** 2)</line-14>
<line-15> l1 = max(m, n) + math.sqrt(n * n + m * m) * 2</line-15>
<line-16> l2 = math.sqrt(n ** 2 + m ** 2) + math.sqrt((n - 1) ** 2 + m ** 2) * 2</line-16>
<line-17> l3 = math.sqrt(n ** 2 + m ** 2) + math.sqrt((m - 1) ** 2 + n ** 2) * 2</line-17>
<line-18> ans = max(l, l1, l2, l3)</line-18>
<line-19> if l == ans :</line-19>
<line-20> print(1, 0)</line-20>
<line-21> print(n, m)</line-21>
<line-22> print(0, 0)</line-22>
<line-23> print(n, m - 1)</line-23>
<line-24> elif l1 == ans :</line-24>
<line-25> if n > m :</line-25>
<line-26> print(n, m)</line-26>
<line-27> print(0, 0)</line-27>
<line-28> print(n, 0)</line-28>
<line-29> print(0, m)</line-29>
<line-30> else :</line-30>
<line-31> print(n, m)</line-31>
<line-32> print(0, 0)</line-32>
<line-33> print(0, m)</line-33>
<line-34> print(n, 0)</line-34>
<line-35> elif l2 == ans :</line-35>
<line-36> print(1, 0)</line-36>
<line-37> print(n, m)</line-37>
<line-38> print(0, 0)</line-38>
<line-39> print(n - 1, m)</line-39>
<line-40> else :</line-40>
<line-41> print(0, 1)</line-41>
<line-42> print(n, m)</line-42>
<line-44> print(n, m - 1)</line-44>
|
{"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-11>
<line-12> if z + math.floor(math.log10(z)) + 1 <= m:</line-12>
<line-13> x = z</line-13>
<line-14> else:</line-14>
<line-15> y = z</line-15>
<line-16> z = (x + y)//2</line-16>
<line-17>m1 = z</line-17>
<line-18>k = math.floor(math.log10(m1)) + 1</line-18>
<line-19></line-19>
<line-20>D = Counter(s)</line-20>
<line-21>D.subtract(list(map(int, str(m1))))</line-21>
<line-22>D.subtract(t)</line-22>
<line-23>try:</line-23>
<line-24> c1 = min(i for i in range(1, 10) if D[i] > 0)</line-24>
<line-25> c2 = t[0]</line-25>
<line-26></line-26>
<line-27> D[c1] -= 1</line-27>
<line-28> _prefix = [c1]</line-28>
<line-29> </line-29>
<line-30> for c in range(c2):</line-30>
<line-31> _prefix += [c] * D[c]</line-31>
<line-32> _suffix = []</line-32>
<line-33> for c in range(c2 + 1, 10):</line-33>
<line-34> _suffix += [c] * D[c]</line-34>
<line-35> num = ''.join([str(c2)] * D[c2])</line-35>
<line-36> prefix = ''.join(map(str, _prefix))</line-36>
<line-37> suffix = ''.join(map(str, _suffix))</line-37>
<line-38></line-38>
<line-39> if c2 == 0:</line-39>
<line-40> print((min(prefix + substr + num + suffix,</line-40>
<line-41> prefix + num + substr + suffix)))</line-41>
<line-42> else:</line-42>
<line-43> D[c1] += 1</line-43>
<line-44> st = []</line-44>
<line-45> for c in range(10):</line-45>
<line-46> st += [c] * D[c]</line-46>
<line-47> print((min(prefix + substr + num + suffix,</line-47>
<line-48> prefix + num + substr + suffix,</line-48>
<line-49> substr + ''.join(map(str, st)))))</line-49>
<line-51> print(substr + '0'*D[0])</line-51>
|
{"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</line-11>
<line-12> if b < mx:</line-12>
<line-13> cnt += 1</line-13>
<line-14> if m + cnt <= n:</line-14>
<line-15> print("Correct")</line-15>
<line-16> else:</line-16>
<line-18></line-18>
<line-19>main()</line-19>
|
{"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>
<line-12>else:</line-12>
<line-14> print(a, a + 1, a + 2, a + 3, a + 4)</line-14>
|
{"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)</line-12>
<line-13>def q(x):</line-13>
<line-14> if x!=p[x]:</line-14>
<line-15> p[x]=q(p[x])</line-15>
<line-16> return p[x]</line-16>
<line-17>for w,u,v in e:</line-17>
<line-18> u=q(u);v=q(v)</line-18>
<line-19> if u!=v:</line-19>
<line-20> if u%5==3:</line-20>
<line-21> u,v=v,u</line-21>
<line-22> p[u]=v;z[v]+=z[u]</line-22>
<line-24> print(((str(w)+' ')*k));return</line-24>
|
{"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>
<line-12></line-12>
<line-13></line-13>
<line-14>main()</line-14>
|
{"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> minx = min(minx, x1, x2)</line-10>
<line-11> maxx = max(maxx, x1, x2)</line-11>
<line-12> miny = min(miny, y1, y2)</line-12>
<line-13> maxy = max(maxy, y1, y2)</line-13>
<line-14></line-14>
<line-15>if (maxx - minx) == (maxy - miny) and s == (maxx - minx) ** 2:</line-15>
<line-16> print ("YES")</line-16>
<line-18> print ("NO")</line-18>
|
{"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>
<line-12> m = (l + r) // 2</line-12>
<line-13> if check(m, s):</line-13>
<line-14> r = m</line-14>
<line-15> else:</line-15>
<line-16> l = m</line-16>
<line-17>if check(r, s):</line-17>
<line-18> print(n - r + 1)</line-18>
<line-20> print(0)</line-20>
|
{"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> b0 = True</line-11>
<line-12> b1 = True</line-12>
<line-13> b2 = True</line-13>
<line-14> L0 = []</line-14>
<line-15> L1 = []</line-15>
<line-16> L2 = []</line-16>
<line-17> for j in range(n):</line-17>
<line-18> if (L[0][0]-L[1][0])*(L[0][1]-L[j][1])!=(L[0][1]-L[1][1])*(L[0][0]-L[j][0]):</line-18>
<line-19> L2.append(L[j])</line-19>
<line-20> if (L[2][0]-L[0][0])*(L[2][1]-L[j][1])!=(L[2][1]-L[0][1])*(L[2][0]-L[j][0]):</line-20>
<line-21> L1.append(L[j])</line-21>
<line-22> if (L[2][0]-L[1][0])*(L[2][1]-L[j][1])!=(L[2][1]-L[1][1])*(L[2][0]-L[j][0]):</line-22>
<line-23> L0.append(L[j])</line-23>
<line-24> if len(L0) >= 3:</line-24>
<line-25> for j in range(2, len(L0)):</line-25>
<line-26> if (L0[0][0]-L0[1][0])*(L0[0][1]-L0[j][1])!=(L0[0][1]-L0[1][1])*(L0[0][0]-L0[j][0]):</line-26>
<line-27> b0 = False</line-27>
<line-28> if len(L1) >= 3:</line-28>
<line-29> for j in range(2, len(L1)):</line-29>
<line-30> if (L1[0][0]-L1[1][0])*(L1[0][1]-L1[j][1])!=(L1[0][1]-L1[1][1])*(L1[0][0]-L1[j][0]):</line-30>
<line-31> b1 = False</line-31>
<line-32> if len(L2) >= 3:</line-32>
<line-33> for j in range(2, len(L2)):</line-33>
<line-34> if (L2[0][0]-L2[1][0])*(L2[0][1]-L2[j][1])!=(L2[0][1]-L2[1][1])*(L2[0][0]-L2[j][0]):</line-34>
<line-35> b2 = False</line-35>
<line-36> if b0 or b1 or b2:</line-36>
<line-37> print("YES")</line-37>
<line-39> print("NO")</line-39>
|
{"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):</line-12>
<line-13> if(m>n):</line-13>
<line-14> return 0</line-14>
<line-15> t=f[n]*POW(f[m],mod-2)%mod*POW(f[n-m],mod-2)%mod</line-15>
<line-16> return t</line-16>
<line-17></line-17>
<line-18></line-18>
<line-19>f[0]=1</line-19>
<line-20>for i in range(1,500000):</line-20>
<line-21> f[i]=f[i-1]*i%mod</line-21>
<line-22>a,b,k,t=list(map(int,input().split(' ')))</line-22>
<line-23></line-23>
<line-24>ans=0</line-24>
<line-25>for i in range(0,2*t+1):</line-25>
<line-26> t1=POW(-1,i)*C(2*t,i)%mod</line-26>
<line-27> t2=(C(210000+2*k*t-a+b+2*t-1-(2*k+1)*i+1,2*t)-C(1+2*k*t-a+b+2*t-1-(2*k+1)*i,2*t))%mod</line-27>
<line-29>print(ans)</line-29>
|
{"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> </line-10>
<line-11> can_x = can_measure(a, x)</line-11>
<line-12> can_y = can_measure(a, y)</line-12>
<line-13> if can_x and can_y:</line-13>
<line-14> print(0)</line-14>
<line-15> elif can_x:</line-15>
<line-16> print(1)</line-16>
<line-17> print(y)</line-17>
<line-18> elif can_y:</line-18>
<line-19> print(1)</line-19>
<line-20> print(x)</line-20>
<line-21> else:</line-21>
<line-22> for i in a:</line-22>
<line-23> if i + x + y in a:</line-23>
<line-24> print(1)</line-24>
<line-25> print(i + x)</line-25>
<line-26> break</line-26>
<line-27> else:</line-27>
<line-28> t = i + x - y in a</line-28>
<line-29> if 0 <= i + x <= l and t:</line-29>
<line-30> print(1)</line-30>
<line-31> print(i + x)</line-31>
<line-32> break;</line-32>
<line-33> if 0 <= i - y <= l and t:</line-33>
<line-34> print(1)</line-34>
<line-35> print(i - y)</line-35>
<line-36> break;</line-36>
<line-37> </line-37>
<line-38> else:</line-38>
<line-39> print(2)</line-39>
<line-40> print(x, y)</line-40>
<line-41> </line-41>
<line-42></line-42>
<line-43>def __starting_point():</line-43>
<line-45></line-45>
<line-46>__starting_point()</line-46>
|
{"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 - N</line-8>
<line-9> self.L = [None for i in range(self.margin)] + L</line-9>
<line-10> for i in range(M-1, 0, -1):</line-10>
<line-11> x, y = self.L[i<<1], self.L[i<<1|1]</line-11>
<line-12> self.L[i] = None if x is None or y is None else function(x, y)</line-12>
<line-13> def modify(self, pos, value):</line-13>
<line-14> p = pos + self.margin</line-14>
<line-15> self.L[p] = value </line-15>
<line-16> while p > 1:</line-16>
<line-17> x, y = self.L[p], self.L[p^1]</line-17>
<line-18> if p&1: x, y = y, x</line-18>
<line-19> self.L[p>>1] = None if x is None or y is None else self.function(x, y)</line-19>
<line-20> p>>=1</line-20>
<line-21> def query(self, left, right):</line-21>
<line-22> l, r = left + self.margin, right + self.margin</line-22>
<line-23> stack = []</line-23>
<line-24> void = True</line-24>
<line-25> while l < r:</line-25>
<line-26> if l&1:</line-26>
<line-27> if void:</line-27>
<line-28> result = self.L[l]</line-28>
<line-29> void = False</line-29>
<line-30> else:</line-30>
<line-31> result = self.function(result, self.L[l])</line-31>
<line-32> l+=1</line-32>
<line-33> if r&1:</line-33>
<line-34> r-=1</line-34>
<line-35> stack.append(self.L[r])</line-35>
<line-36> l>>=1</line-36>
<line-37> r>>=1</line-37>
<line-38> init = stack.pop() if void else result</line-38>
<line-39> return reduce(self.function, reversed(stack), init)</line-39>
<line-40></line-40>
<line-41>n = int(input())</line-41>
<line-42>pies, index, first_equal = [0]*n, [0]*n, [0]*n</line-42>
<line-43>for i in range(n):</line-43>
<line-44> r, h = [int(x) for x in input().split()]</line-44>
<line-45> pies[i] = r*r*h</line-45>
<line-46>s_pies = list(sorted(enumerate(pies), key = lambda p: p[1]))</line-46>
<line-47>for i in range(n): index[s_pies[i][0]] = i</line-47>
<line-48>for i in range(1, n):</line-48>
<line-49> first_equal[s_pies[i][0]] = i if s_pies[i][1] != s_pies[i-1][1] else first_equal[s_pies[i-1][0]]</line-49>
<line-50>towers = SegmentTree([0]*(n+1), max)</line-50>
<line-51>for j, pie in enumerate(pies):</line-51>
<line-52> i, k = index[j], first_equal[j]</line-52>
<line-53> q = towers.query(0, k+1)</line-53>
<line-55>print(math.pi * towers.query(0, n+1))</line-55>
|
{"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>
<line-12>for hi in h:</line-12>
<line-13> f[hi] += 1</line-13>
<line-14>for i in range(m - 1, 0, -1):</line-14>
<line-15> f[i] += f[i + 1]</line-15>
<line-16></line-16>
<line-17>ans = 0</line-17>
<line-18>i = m</line-18>
<line-19>while i > 0:</line-19>
<line-20> if f[i] == n:</line-20>
<line-21> break</line-21>
<line-22> j = i</line-22>
<line-23> cur = 0</line-23>
<line-24> while j > 0:</line-24>
<line-25> if cur + f[j] > k:</line-25>
<line-26> break</line-26>
<line-27> cur += f[j]</line-27>
<line-28> j -= 1</line-28>
<line-29> ans += 1</line-29>
<line-31>print(ans)</line-31>
|
{"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</line-11>
<line-12> for i in range(v, 31):</line-12>
<line-13> best = max(curr - prevs[i] - i, best)</line-13>
<line-14> else:</line-14>
<line-15> for i in range(31):</line-15>
<line-17>print(best)</line-17>
|
{"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("YES")</line-11>
<line-12>elif a == 1:</line-12>
<line-13> print('YES')</line-13>
<line-14>else:</line-14>
<line-15> if b == 2:</line-15>
<line-16> print('YES')</line-16>
<line-17> elif b > 4:</line-17>
<line-18> print('NO')</line-18>
<line-19> elif b == 4:</line-19>
<line-20> if c == 4:</line-20>
<line-21> print('YES')</line-21>
<line-22> else:</line-22>
<line-23> print('NO')</line-23>
<line-25> print('NO')</line-25>
|
{"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 = [[[] for x in range(N + 1)] </line-8>
<line-9> for y in range(N + 1)]</line-9>
<line-10>ss=""</line-10>
<line-11>re=""</line-11>
<line-12>for i in range(0,N):</line-12>
<line-13> if re!=s[i]:</line-13>
<line-14> ss+=re</line-14>
<line-15> re=s[i]</line-15>
<line-16>ss+=re</line-16>
<line-17>a=ss</line-17>
<line-18>N=len(a)</line-18>
<line-19>for l in range(1, N + 1): </line-19>
<line-20> i = 0</line-20>
<line-21> j = l - 1</line-21>
<line-22> while j < N: </line-22>
<line-23> if (l == 1): </line-23>
<line-24> dp[i][j] = 1</line-24>
<line-25> else: </line-25>
<line-26></line-26>
<line-27> dp[i][j] =1+dp[i + 1][j]</line-27>
<line-28></line-28>
<line-29> for K in range(i + 1, j + 1): </line-29>
<line-30> if (a[i] == a[K]):</line-30>
<line-31> if dp[i][j]>=dp[i ][K - 1] + dp[K + 1][j]:</line-31>
<line-32> dp[i][j] = dp[i][K - 1] + dp[K + 1][j]</line-32>
<line-33></line-33>
<line-34> </line-34>
<line-35> </line-35>
<line-36> i += 1</line-36>
<line-38></line-38>
<line-39>print(dp[0][N-1])</line-39>
<line-40></line-40>
|
{"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>
<line-12>print(c)</line-12>
|
{"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.