question
stringlengths 0
30.2k
| answer
stringlengths 55
2.44k
|
|---|---|
<line-2></line-2>
<line-3>for _ in range(int(input())):</line-3>
<line-4> N,M=[int(a) for a in input().split()]</line-4>
<line-5> print(float(N+M-1))</line-5>
|
{"code": "<line-1>from math import factorial</line-1>", "lines": [1]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3></line-3>
<line-4>mod_val = 1000000007</line-4>
<line-5>rang = [0]*101</line-5>
<line-6>pow_cache = [0]*102</line-6>
<line-7>multisets = {}</line-7>
<line-8></line-8>
<line-9></line-9>
<line-10>def mod_pow(base, pow):</line-10>
<line-11> result = 1</line-11>
<line-12> while pow:</line-12>
<line-13> if pow&1:</line-13>
<line-14> result = (result*base) % mod_val</line-14>
<line-15> base = (base*base) % mod_val</line-15>
<line-16> pow = pow>>1</line-16>
<line-17> return result</line-17>
<line-18></line-18>
<line-19></line-19>
<line-20>def precalculate():</line-20>
<line-21></line-21>
<line-22> for i in range(1, 102):</line-22>
<line-23> pow_cache[i] = mod_pow(i, mod_val-2)</line-23>
<line-24></line-24>
<line-25></line-25>
<line-26>def cal_recurse(i, target_sum):</line-26>
<line-27> if target_sum == 0:</line-27>
<line-28> return 1</line-28>
<line-29> if i>=target_sum:</line-29>
<line-30> return 0</line-30>
<line-31> if (i, target_sum) in multisets:</line-31>
<line-32> return multisets[(i, target_sum)]</line-32>
<line-33> ans = cal_recurse(i+1, target_sum)</line-33>
<line-34> max_pos = target_sum//(i+1)</line-34>
<line-35> choose = rang[i+1]%mod_val</line-35>
<line-36> for j in range(1, max_pos+1):</line-36>
<line-37> temp = choose*cal_recurse(i+1, target_sum-j*(i+1))</line-37>
<line-38> # temp%=mod_val</line-38>
<line-39> ans += temp</line-39>
<line-40> ans %= mod_val</line-40>
<line-41> choose *= rang[i+1]+j</line-41>
<line-42> # choose %= mod_val</line-42>
<line-43> choose *= pow_cache[j+1]</line-43>
<line-44> choose %= mod_val</line-44>
<line-45> multisets[i, target_sum] = ans</line-45>
<line-46> return ans</line-46>
<line-47></line-47>
<line-48></line-48>
<line-49>def calculate(target_sum, rang_index):</line-49>
<line-50> populate(target_sum, rang_index)</line-50>
<line-51> return cal_recurse(0, target_sum)</line-51>
<line-52></line-52>
<line-53></line-53>
<line-54>def populate(target_sum, rang_i):</line-54>
<line-55> for i in range(1, target_sum+1):</line-55>
<line-56> rang[i] = rang_i[0] + (rang_i[1] + (rang_i[2] + rang_i[3]*i)*i)*i</line-56>
<line-57></line-57>
<line-58></line-58>
<line-59>_test_cases = int(input())</line-59>
<line-60>precalculate()</line-60>
<line-61>for _a_case in range(_test_cases):</line-61>
<line-62> rang = [0]*101</line-62>
<line-63> multisets = {}</line-63>
<line-64> _rang_index = [int(i) for i in input().split(' ')]</line-64>
<line-66> print(calculate(_target_sum, _rang_index))</line-66>
|
{"code": "<line-2>import sys</line-2>\n<line-65> _target_sum = int(input())</line-65>", "lines": [2, 65]}
#### 0
|
<line-1>arr = [0]*6</line-1>
<line-2></line-2>
<line-4>arr[2] = 250000*(0.10)</line-4>
<line-5>arr[3] = 250000*(0.15)</line-5>
<line-6>arr[4] = 250000*(0.20)</line-6>
<line-7>arr[5] = 250000*(0.25)</line-7>
<line-8></line-8>
<line-9>for _ in range(int(input())):</line-9>
<line-10> n = int(input())</line-10>
<line-11></line-11>
<line-12> tax = 0</line-12>
<line-13></line-13>
<line-14> if n<=250000:</line-14>
<line-15> tax = 0</line-15>
<line-16></line-16>
<line-17> elif 250000<n<=500000:</line-17>
<line-18> tax = sum(arr[:1])</line-18>
<line-19></line-19>
<line-20> rem = n - 250000</line-20>
<line-21></line-21>
<line-22> tax+= (rem)*(0.05)</line-22>
<line-23></line-23>
<line-24> elif 500000<n<=750000:</line-24>
<line-25> tax = sum(arr[:2])</line-25>
<line-26></line-26>
<line-27> rem = n - 500000</line-27>
<line-28></line-28>
<line-29> tax+= (rem)*(0.10)</line-29>
<line-30></line-30>
<line-31> elif 750000<n<=1000000:</line-31>
<line-32> tax = sum(arr[:3])</line-32>
<line-33></line-33>
<line-34> rem = n - 750000</line-34>
<line-35></line-35>
<line-36> tax+= (rem)*(0.15)</line-36>
<line-37></line-37>
<line-38> elif 1000000<n<=1250000:</line-38>
<line-39> tax = sum(arr[:4])</line-39>
<line-40></line-40>
<line-41> rem = n - 1000000</line-41>
<line-42></line-42>
<line-43> tax+= (rem)*(0.20)</line-43>
<line-44> </line-44>
<line-45> elif 1250000<n<=1500000:</line-45>
<line-46> tax = sum(arr[:5])</line-46>
<line-47></line-47>
<line-48> rem = n - 1250000</line-48>
<line-49></line-49>
<line-50> tax+= (rem)*(0.25)</line-50>
<line-51> </line-51>
<line-52> elif n>1500000:</line-52>
<line-53> tax = sum(arr[:6])</line-53>
<line-54></line-54>
<line-55> rem = n - 1500000</line-55>
<line-56></line-56>
<line-57> tax+= (rem)*(0.30)</line-57>
<line-58> </line-58>
<line-60> </line-60>
<line-61> print(res)</line-61>
<line-62></line-62>
<line-63></line-63>
<line-64></line-64>
<line-65> </line-65>
<line-66></line-66>
<line-67></line-67>
<line-68> </line-68>
<line-69></line-69>
|
{"code": "<line-3>arr[1] = 250000*(0.05)</line-3>\n<line-59> res = int(n - tax)</line-59>", "lines": [3, 59]}
#### 0
|
<line-1>N = int(input())</line-1>
<line-3>for i in range(N):</line-3>
<line-4> l.append(input())</line-4>
<line-5>for j in range(N-1,-1,-1):</line-5>
<line-6> s = '` '+ l[j]</line-6>
<line-7> n = len(s)-1</line-7>
<line-8> y = s[n]</line-8>
<line-9> f = ''</line-9>
<line-10> while y != '`':</line-10>
<line-11> w = ''</line-11>
<line-12> while y != ' ':</line-12>
<line-13> if ord(y) in range(97,123) or ord(y) in range(65,91):</line-13>
<line-14> w += y</line-14>
<line-15> n -= 1</line-15>
<line-16> y = s[n]</line-16>
<line-17> wf = ''</line-17>
<line-18> n -= 1</line-18>
<line-19> y = s[n]</line-19>
<line-20> x = len(w)</line-20>
<line-21> for k in range(x):</line-21>
<line-22> wf += w[x-k-1]</line-22>
<line-24> print(f)</line-24>
|
{"code": "<line-2>l = []</line-2>\n<line-23> f += wf+' '</line-23>", "lines": [2, 23]}
#### 0
|
<line-2>for h in range(int(input())):</line-2>
<line-3> n,q=map(int,input().split())</line-3>
<line-4> print(q*(n+q+1)/(q+1))</line-4>
|
{"code": "<line-1># cook your dish here</line-1>", "lines": [1]}
#### 0
|
<line-1>try:</line-1>
<line-3> N, K = map(int, input().split())</line-3>
<line-4> cell = []</line-4>
<line-5> count = 0</line-5>
<line-6> l = []</line-6>
<line-7> for __ in range(N):</line-7>
<line-8> inserted = list(map(int, input().split()))</line-8>
<line-9> cell.append(inserted)</line-9>
<line-10></line-10>
<line-11></line-11>
<line-12></line-12>
<line-13> </line-13>
<line-14></line-14>
<line-15></line-15>
<line-16></line-16>
<line-17></line-17>
<line-18> cell.sort(key=lambda x: x[1])</line-18>
<line-19> time = {}</line-19>
<line-20></line-20>
<line-21> for number in cell:</line-21>
<line-22> if number[2] not in time:</line-22>
<line-23> time[number[2]] = number[1]</line-23>
<line-24></line-24>
<line-25> count += 1</line-25>
<line-26> elif number[0] >= time[number[2]]:</line-26>
<line-27> time[number[2]] = number[1]</line-27>
<line-28> count += 1</line-28>
<line-29></line-29>
<line-30></line-30>
<line-31></line-31>
<line-32></line-32>
<line-33></line-33>
<line-34> print(count)</line-34>
<line-35></line-35>
<line-36></line-36>
<line-38> pass</line-38>
|
{"code": "<line-2> for _ in range(int(input())):</line-2>\n<line-37>except:</line-37>", "lines": [2, 37]}
#### 0
|
<line-2>print(a+b)</line-2>
|
{"code": "<line-1>a,b=map(int,input().split())</line-1>", "lines": [1]}
#### 0
|
<line-1>for _ in range(int(input())):</line-1>
<line-3> l = list(map(int,input().split()))</line-3>
<line-4> ans = 1</line-4>
<line-5> l1 = l[0]</line-5>
<line-6> for i in range(1,n):</line-6>
<line-7> if l[i] <= l1:</line-7>
<line-8> l1 = l[i]</line-8>
<line-10> print(ans)</line-10>
|
{"code": "<line-2> n = int(input())</line-2>\n<line-9> ans = ans + 1</line-9>", "lines": [2, 9]}
#### 0
|
<line-1>from math import *</line-1>
<line-3> return list(map(int,input().split()))</line-3>
<line-4>def map_input():</line-4>
<line-5> return list(map(int,input().split()))</line-5>
<line-6>def map_string():</line-6>
<line-7> return input().split()</line-7>
<line-8>def g(n):</line-8>
<line-9> return (n*(n+1)*(2*n+1))//6</line-9>
<line-10>def f(n):</line-10>
<line-11> ans = 0</line-11>
<line-12> for i in range(1,floor(sqrt(n))+1):</line-12>
<line-13> ans+=i*(i+floor(n/i))*(floor(n/i)+1-i)</line-13>
<line-14> return ans-g(floor(sqrt(n)))</line-14>
<line-15>for _ in range(int(input())):</line-15>
<line-17> print(f(n)%1000000007)</line-17>
<line-18></line-18>
|
{"code": "<line-2>def list_input():</line-2>\n<line-16> n=int(input())</line-16>", "lines": [2, 16]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3> A,B = map(int,input().split())</line-3>
<line-4> diff = abs(A-B)</line-4>
<line-5> count=0</line-5>
<line-6> if not(A^B):</line-6>
<line-7> print(-1)</line-7>
<line-8> else:</line-8>
<line-9> for i in range(1,int(diff**(1/2))+1):</line-9>
<line-10> if diff%i==0:</line-10>
<line-11> if diff/i==i:</line-11>
<line-12> count+=1 </line-12>
<line-13> else:</line-13>
<line-15> print(count)</line-15>
|
{"code": "<line-2>for test in range(0,int(input())):</line-2>\n<line-14> count+=2</line-14>", "lines": [2, 14]}
#### 0
|
<line-1>t = input()</line-1>
<line-3></line-3>
<line-4>for _ in range(t):</line-4>
<line-5> n, m, x, y = input().split()</line-5>
<line-6> n = int(n)</line-6>
<line-7> m = int(m)</line-7>
<line-8> x = int(x)</line-8>
<line-9> y = int(y)</line-9>
<line-10> n -= 1</line-10>
<line-11> m -= 1</line-11>
<line-12> flag = 0</line-12>
<line-13> if n % x == 0 and m % y == 0:</line-13>
<line-14> flag = 1</line-14>
<line-15> n -= 1</line-15>
<line-16> m -= 1</line-16>
<line-17> if n >= 0 and m >= 0:</line-17>
<line-18> if n % x == 0 and m % y == 0:</line-18>
<line-19> flag = 1</line-19>
<line-20> </line-20>
<line-21> if flag == 1:</line-21>
<line-22> print("Chefirnemo")</line-22>
<line-24> print("Pofik")</line-24>
|
{"code": "<line-2>t = int(t)</line-2>\n<line-23> else:</line-23>", "lines": [2, 23]}
#### 0
|
<line-1>def mForMaxSeq(arr, n):</line-1>
<line-3> for i in range(n):</line-3>
<line-4> if arr[i] in eim:</line-4>
<line-5> eim[arr[i]].append(i)</line-5>
<line-6> else:</line-6>
<line-7> eim[arr[i]] = [i]</line-7>
<line-8> </line-8>
<line-9> keys = sorted(eim.keys())</line-9>
<line-10> </line-10>
<line-11> # print(eim, keys)</line-11>
<line-12></line-12>
<line-13> connected = False</line-13>
<line-14> count = 0</line-14>
<line-15> pI = -1</line-15>
<line-16></line-16>
<line-17> nKeys = len(keys)</line-17>
<line-18> for i in range(nKeys-1):</line-18>
<line-19> </line-19>
<line-20> if not connected:</line-20>
<line-21> pI = eim[keys[i]][0]</line-21>
<line-22> </line-22>
<line-23> for idx in eim[keys[i+1]]:</line-23>
<line-24> if idx >pI:</line-24>
<line-25> connected = True</line-25>
<line-26> count += 1</line-26>
<line-27> pI = idx</line-27>
<line-28> break</line-28>
<line-29> else:</line-29>
<line-30> connected = False</line-30>
<line-31></line-31>
<line-32> for idx in eim[keys[i+1]]:</line-32>
<line-33> if idx > pI:</line-33>
<line-34> connected = True</line-34>
<line-35> count += 1</line-35>
<line-36> pI = idx</line-36>
<line-37> break</line-37>
<line-38></line-38>
<line-39> </line-39>
<line-40> return (nKeys - count)</line-40>
<line-41></line-41>
<line-42></line-42>
<line-43>def __starting_point():</line-43>
<line-44> for _ in range(int(input())):</line-44>
<line-45> n = int(input())</line-45>
<line-46> arr = list(map(int, input().split()))</line-46>
<line-47> </line-47>
<line-49> </line-49>
<line-50> </line-50>
<line-51></line-51>
<line-52>__starting_point()</line-52>
|
{"code": "<line-2> eim = dict()</line-2>\n<line-48> print(mForMaxSeq(arr, n))</line-48>", "lines": [2, 48]}
#### 0
|
<line-1>def solve(S):</line-1>
<line-3> return len(a)</line-3>
<line-4> </line-4>
<line-5> </line-5>
<line-6>t = int(input())</line-6>
<line-7></line-7>
<line-8>for _ in range(t):</line-8>
<line-10> print(solve(s))</line-10>
|
{"code": "<line-2> a = set(S)</line-2>\n<line-9> s = input()</line-9>", "lines": [2, 9]}
#### 0
|
<line-1>import numpy as np</line-1>
<line-2></line-2>
<line-4> shape = (n,n)</line-4>
<line-5> mat = np.zeros(shape, dtype=np.int64)</line-5>
<line-6> for i in range(n):</line-6>
<line-7> for j in range(l[i], r[i]):</line-7>
<line-8> mat[i][j]=1</line-8>
<line-9> </line-9>
<line-10> ans = np.eye(n,n, dtype=np.int64)</line-10>
<line-11> while(k>0):</line-11>
<line-12> if k%2 == 1:</line-12>
<line-13> ans = np.matmul(mat, ans)</line-13>
<line-14> ans%=2</line-14>
<line-15> mat = np.matmul(mat, mat)</line-15>
<line-16> mat%=2</line-16>
<line-17> k = k//2</line-17>
<line-18> result = []</line-18>
<line-19> for i in range(n):</line-19>
<line-20> aux = 0</line-20>
<line-21> for j in range(n):</line-21>
<line-22> if ans[i][j] == 1:</line-22>
<line-23> aux^=a[j]</line-23>
<line-24> result.append(aux)</line-24>
<line-25> return result</line-25>
<line-26> </line-26>
<line-27></line-27>
<line-28></line-28>
<line-29></line-29>
<line-30></line-30>
<line-31>t = int(input())</line-31>
<line-32>for i in range(t):</line-32>
<line-33> s = input().split()</line-33>
<line-34> n = int(s[0])</line-34>
<line-35> k = int(s[1])</line-35>
<line-36> a = []</line-36>
<line-37> l = []</line-37>
<line-38> r = []</line-38>
<line-39> s = input().split()</line-39>
<line-40> for i in range(n):</line-40>
<line-41> a.append(int(s[i]))</line-41>
<line-42> for i in range(n):</line-42>
<line-43> s = input().split()</line-43>
<line-44> l.append(int(s[0])-1)</line-44>
<line-45> r.append(int(s[1]))</line-45>
<line-46> arr = solve(n,k-1,a,l,r)</line-46>
<line-47> s = ""</line-47>
<line-48> for e in arr:</line-48>
<line-49> s += str(e)</line-49>
<line-51> print(s)</line-51>
|
{"code": "<line-3>def solve(n,k,a,l,r):</line-3>\n<line-50> s +=\" \"</line-50>", "lines": [3, 50]}
#### 0
|
<line-2>for _ in range(int(input())):</line-2>
<line-3> n,l,h=list(map(int,input().split()))</line-3>
<line-4> print(n-l+1+2**(l)-2,1+2**(h)-2+2**(h-1)*(n-h))</line-4>
|
{"code": "<line-1># cook your dish here</line-1>", "lines": [1]}
#### 0
|
<line-1>n,k = map(int,input().split())</line-1>
<line-3>prices.sort()</line-3>
<line-4>sum,cnt = 0, 0</line-4>
<line-5>for price in prices:</line-5>
<line-6> sum += price</line-6>
<line-7> if sum <= k: cnt += 1</line-7>
<line-9>print(cnt)</line-9>
|
{"code": "<line-2>prices = list(map(int,input().split()))</line-2>\n<line-8> else: break</line-8>", "lines": [2, 8]}
#### 0
|
<line-1>def add(A, B):</line-1>
<line-3> while B > 0:</line-3>
<line-4> U = A ^ B</line-4>
<line-5> B = (A & B) * 2</line-5>
<line-6> A = U</line-6>
<line-7> cnt += 1</line-7>
<line-8> return cnt</line-8>
<line-9></line-9>
<line-11> print(add(int(input(),2), int(input(), 2)))</line-11>
|
{"code": "<line-2> cnt = 0</line-2>\n<line-10>for _ in range(int(input())):</line-10>", "lines": [2, 10]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>def numDec(s):</line-3>
<line-4> if not s:</line-4>
<line-5> return 0</line-5>
<line-6></line-6>
<line-7> dp = [0 for _ in range(len(s) + 1)]</line-7>
<line-8></line-8>
<line-9> dp[0] = 1</line-9>
<line-10> dp[1] = 0 if s[0] == '0' else 1</line-10>
<line-11></line-11>
<line-12></line-12>
<line-13> for i in range(2, len(dp)):</line-13>
<line-14></line-14>
<line-15> if s[i-1] != '0':</line-15>
<line-16> dp[i] += dp[i-1]</line-16>
<line-17></line-17>
<line-18> two_digit = int(s[i-2 : i])</line-18>
<line-19> if two_digit >= 10 and two_digit <= 26:</line-19>
<line-20> dp[i] += dp[i-2]</line-20>
<line-21> return dp[len(s)]</line-21>
<line-22></line-22>
<line-23>t = int(input())</line-23>
<line-24></line-24>
<line-25>while(t):</line-25>
<line-26> t-=1</line-26>
<line-28> print(numDec(s)%1000000007)</line-28>
|
{"code": "<line-2># cook your dish here</line-2>\n<line-27> s = input()</line-27>", "lines": [2, 27]}
#### 0
|
<line-1>import sys</line-1>
<line-3>for i in range(0,test_cases):</line-3>
<line-4> count = input().split()</line-4>
<line-5> #print count</line-5>
<line-6> count_r = int(count[0])</line-6>
<line-7> count_g = int(count[1])</line-7>
<line-8> count_b = int(count[2])</line-8>
<line-9> k = int(input())</line-9>
<line-10> if k is 1:</line-10>
<line-11> total = 1</line-11>
<line-12> else: </line-12>
<line-13> total = 1</line-13>
<line-14> if count_r < k:</line-14>
<line-15> total = total + count_r</line-15>
<line-16> else:</line-16>
<line-17> total = total + (k-1)</line-17>
<line-18> if count_g < k:</line-18>
<line-19> total = total + count_g</line-19>
<line-20> else:</line-20>
<line-21> total = total + (k-1) </line-21>
<line-22> if count_b < k:</line-22>
<line-23> total = total + count_b</line-23>
<line-24> else:</line-24>
<line-26> </line-26>
<line-27> print(total)</line-27>
|
{"code": "<line-2>test_cases = int(input())</line-2>\n<line-25> total = total + (k-1)</line-25>", "lines": [2, 25]}
#### 0
|
<line-1>from bisect import bisect</line-1>
<line-3>def primeSeive(n):</line-3>
<line-4> prime = [True for i in range(n + 1)]</line-4>
<line-5> primes = []</line-5>
<line-6> p = 2</line-6>
<line-7> while (p * p <= n):</line-7>
<line-8> if (prime[p] == True):</line-8>
<line-9> for i in range(p * 2, n + 1, p):</line-9>
<line-10> prime[i] = False</line-10>
<line-11> p += 1</line-11>
<line-12> prime[0] = False</line-12>
<line-13> prime[1] = False</line-13>
<line-14> for p in range(n + 1):</line-14>
<line-15> if prime[p]:</line-15>
<line-16> primes.append(p)</line-16>
<line-17> return primes</line-17>
<line-18>arr = primeSeive(n)</line-18>
<line-19>fin = []</line-19>
<line-20>for i in arr:</line-20>
<line-21> fin.append(pow(i,4))</line-21>
<line-22>for _ in range(int(input())):</line-22>
<line-24> print(bisect(fin,n))</line-24>
|
{"code": "<line-2>n = 32000</line-2>\n<line-23> n = int(input())</line-23>", "lines": [2, 23]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3></line-3>
<line-4>for _ in range(int(stdin.readline())):</line-4>
<line-5> n, q = list(map(int, stdin.readline().split()))</line-5>
<line-6> arr = list(map(int, stdin.readline().split()))[:n]</line-6>
<line-7> od = ev = 0</line-7>
<line-8> for i in arr:</line-8>
<line-9> if bin(i).count('1')%2==0:</line-9>
<line-10> ev += 1</line-10>
<line-11> else:</line-11>
<line-12> od += 1</line-12>
<line-13> for _ in range(q):</line-13>
<line-14> p = int(stdin.readline())</line-14>
<line-15> if bin(p).count('1')%2==0:</line-15>
<line-16> stdout.write(str(ev) + " " + str(od) + "\n")</line-16>
<line-18> stdout.write(str(od) + " " + str(ev) + "\n")</line-18>
<line-19></line-19>
|
{"code": "<line-2>from sys import stdin, stdout</line-2>\n<line-17> else:</line-17>", "lines": [2, 17]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>for _ in range(t):</line-3>
<line-4> m,n = [int(d) for d in input().split()]</line-4>
<line-5></line-5>
<line-6> if m == 1:</line-6>
<line-7> arr = []</line-7>
<line-8> if n%4 == 0:</line-8>
<line-9> print(2)</line-9>
<line-10> arr = [[1,1,2,2]*(n//4)]</line-10>
<line-11> elif n%4 == 1:</line-11>
<line-12> if n == 1:</line-12>
<line-13> print(1)</line-13>
<line-14> arr = [[1]]</line-14>
<line-15> else:</line-15>
<line-16> print(2)</line-16>
<line-17> arr = [[1,1,2,2]*(n//4) + [1]]</line-17>
<line-18> elif n%4 == 2:</line-18>
<line-19> if n == 2:</line-19>
<line-20> print(1)</line-20>
<line-21> arr = [[1,1]]</line-21>
<line-22> else:</line-22>
<line-23> print(2)</line-23>
<line-24> arr = [[1,1,2,2]*(n//4) + [1,1]]</line-24>
<line-25> elif n%4 == 3:</line-25>
<line-26> print(2)</line-26>
<line-27> arr = [[1,1,2,2]*(n//4) + [1,1,2]]</line-27>
<line-28></line-28>
<line-29> elif m == 2:</line-29>
<line-30> if n%3 == 0:</line-30>
<line-31> print(3)</line-31>
<line-32> a1 = [1,2,3]*(n//3)</line-32>
<line-33> arr = [a1,a1]</line-33>
<line-34></line-34>
<line-35> elif n%3 == 1:</line-35>
<line-36> if n == 1:</line-36>
<line-37> print(1)</line-37>
<line-38> arr = [[1],[1]]</line-38>
<line-39> else:</line-39>
<line-40> print(3)</line-40>
<line-41> a1 = [1,2,3]*(n//3) + [1]</line-41>
<line-42> arr = [a1,a1]</line-42>
<line-43></line-43>
<line-44> elif n%3 == 2:</line-44>
<line-45> if n == 2:</line-45>
<line-46> print(2)</line-46>
<line-47> arr = [[1,2],[1,2]]</line-47>
<line-48> else:</line-48>
<line-49> print(3)</line-49>
<line-50> a1 = [1,2,3]*(n//3) + [1,2]</line-50>
<line-51> arr = [a1,a1]</line-51>
<line-52></line-52>
<line-53> elif m == 3:</line-53>
<line-54> if n == 1:</line-54>
<line-55> print(2)</line-55>
<line-56> arr = [[1],[1],[2]]</line-56>
<line-57> elif n == 2:</line-57>
<line-58> print(3)</line-58>
<line-59> arr = [[1,1],[2,2],[3,3]]</line-59>
<line-60> elif n == 3:</line-60>
<line-61> print(4)</line-61>
<line-62> arr = [[1,3,4],[4,2,1],[4,2,1]]</line-62>
<line-63> elif n == 4:</line-63>
<line-64> print(4)</line-64>
<line-65> arr = [[1,3,4,2],[4,2,1,3],[4,2,1,3]]</line-65>
<line-66> else:</line-66>
<line-67> if n%4 == 0:</line-67>
<line-68> print(4)</line-68>
<line-69> a1 = [1,3,4,2]*(n//4)</line-69>
<line-70> a2 = [4,2,1,3]*(n//4)</line-70>
<line-71> arr = [a1,a2,a2]</line-71>
<line-72> </line-72>
<line-73> elif n%4 == 1:</line-73>
<line-74> print(4)</line-74>
<line-75> a1 = [1,3,4,2]*(n//4) + [1]</line-75>
<line-76> a2 = [4,2,1,3]*(n//4) + [4]</line-76>
<line-77> arr = [a1,a2,a2]</line-77>
<line-78></line-78>
<line-79> elif n%4 == 2:</line-79>
<line-80> print(4)</line-80>
<line-81> a1 = [1,3,4,2]*(n//4) + [1,3]</line-81>
<line-82> a2 = [4,2,1,3]*(n//4) + [4,2]</line-82>
<line-83> arr = [a1,a2,a2]</line-83>
<line-84></line-84>
<line-85> elif n%4 == 3:</line-85>
<line-86> print(4)</line-86>
<line-87> a1 = [1,3,4,2]*(n//4) + [1,3,4]</line-87>
<line-88> a2 = [4,2,1,3]*(n//4) + [4,2,1]</line-88>
<line-89> arr = [a1,a2,a2]</line-89>
<line-90></line-90>
<line-91> else:</line-91>
<line-92> if n == 1:</line-92>
<line-93> print(2)</line-93>
<line-94> a1 = [1,3,4,2]*(n//4) + [1]</line-94>
<line-95> a2 = [4,2,1,3]*(n//4) + [2]</line-95>
<line-96> arr = []</line-96>
<line-97> i = 0</line-97>
<line-98> j = 0</line-98>
<line-99> c = 0</line-99>
<line-100> c1 = 0</line-100>
<line-101> for i in range(m):</line-101>
<line-102> if j == 0 and c < 3:</line-102>
<line-103> arr.append(a1)</line-103>
<line-104> c = c + 1</line-104>
<line-105> if c == 2:</line-105>
<line-106> j = 1</line-106>
<line-107> c = 0</line-107>
<line-108> else:</line-108>
<line-109> arr.append(a2)</line-109>
<line-110> c1 = c1 + 1</line-110>
<line-111> if c1 == 2:</line-111>
<line-112> j = 0</line-112>
<line-113> c1 = 0</line-113>
<line-114> </line-114>
<line-115> elif n == 2:</line-115>
<line-116> print(3)</line-116>
<line-117> arr = []</line-117>
<line-118> a1 = [1,1]</line-118>
<line-119> a2 = [2,2]</line-119>
<line-120> a3 = [3,3]</line-120>
<line-121></line-121>
<line-122> if m%3 == 1:</line-122>
<line-123> arr = [a1,a2,a3]*(m//3) + [a1]</line-123>
<line-124> elif m%3 == 2:</line-124>
<line-125> arr = [a1,a2,a3]*(m//3) + [a1,a2]</line-125>
<line-126> elif m%3 == 0:</line-126>
<line-127> arr = [a1,a2,a3]*(m//3)</line-127>
<line-128></line-128>
<line-129> else:</line-129>
<line-130> print(4)</line-130>
<line-131> if n%4 == 0:</line-131>
<line-132> a1 = [1,3,4,2]*(n//4)</line-132>
<line-133> a2 = [4,2,1,3]*(n//4)</line-133>
<line-134> arr = []</line-134>
<line-135> i = 0</line-135>
<line-136> j = 0</line-136>
<line-137> c = 0</line-137>
<line-138> c1 = 0</line-138>
<line-139> for i in range(m):</line-139>
<line-140> if j == 0 and c < 3:</line-140>
<line-141> arr.append(a1)</line-141>
<line-142> c = c + 1</line-142>
<line-143> if c == 2:</line-143>
<line-144> j = 1</line-144>
<line-145> c = 0</line-145>
<line-146> else:</line-146>
<line-147> arr.append(a2)</line-147>
<line-148> c1 = c1 + 1</line-148>
<line-149> if c1 == 2:</line-149>
<line-150> j = 0</line-150>
<line-151> c1 = 0</line-151>
<line-152></line-152>
<line-153> elif n%4 == 1:</line-153>
<line-154> a1 = [1,3,4,2]*(n//4) + [1]</line-154>
<line-155> a2 = [4,2,1,3]*(n//4) + [4]</line-155>
<line-156> arr = []</line-156>
<line-157> i = 0</line-157>
<line-158> j = 0</line-158>
<line-159> c = 0</line-159>
<line-160> c1 = 0</line-160>
<line-161> for i in range(m):</line-161>
<line-162> if j == 0 and c < 3:</line-162>
<line-163> arr.append(a1)</line-163>
<line-164> c = c + 1</line-164>
<line-165> if c == 2:</line-165>
<line-166> j = 1</line-166>
<line-167> c = 0</line-167>
<line-168> else:</line-168>
<line-169> arr.append(a2)</line-169>
<line-170> c1 = c1 + 1</line-170>
<line-171> if c1 == 2:</line-171>
<line-172> j = 0</line-172>
<line-173> c1 = 0</line-173>
<line-174></line-174>
<line-175> elif n%4 == 2:</line-175>
<line-176></line-176>
<line-177> a1 = [1,3,4,2]*(n//4) + [1,3]</line-177>
<line-178> a2 = [4,2,1,3]*(n//4) + [4,2]</line-178>
<line-179> arr = []</line-179>
<line-180> i = 0</line-180>
<line-181> j = 0</line-181>
<line-182> c = 0</line-182>
<line-183> c1 = 0</line-183>
<line-184> for i in range(m):</line-184>
<line-185> if j == 0 and c < 3:</line-185>
<line-186> arr.append(a1)</line-186>
<line-187> c = c + 1</line-187>
<line-188> if c == 2:</line-188>
<line-189> j = 1</line-189>
<line-190> c = 0</line-190>
<line-191> else:</line-191>
<line-192> arr.append(a2)</line-192>
<line-193> c1 = c1 + 1</line-193>
<line-194> if c1 == 2:</line-194>
<line-195> j = 0</line-195>
<line-196> c1 = 0</line-196>
<line-197></line-197>
<line-198> elif n%4 == 3:</line-198>
<line-199></line-199>
<line-200> a1 = [1,3,4,2]*(n//4) + [1,3,4]</line-200>
<line-201> a2 = [4,2,1,3]*(n//4) + [4,2,1]</line-201>
<line-202> arr = []</line-202>
<line-203> i = 0</line-203>
<line-204> j = 0</line-204>
<line-205> c = 0</line-205>
<line-206> c1 = 0</line-206>
<line-207> for i in range(m):</line-207>
<line-208> if j == 0 and c < 3:</line-208>
<line-209> arr.append(a1)</line-209>
<line-210> c = c + 1</line-210>
<line-211> if c == 2:</line-211>
<line-212> j = 1</line-212>
<line-213> c = 0</line-213>
<line-214> else:</line-214>
<line-215> arr.append(a2)</line-215>
<line-216> c1 = c1 + 1</line-216>
<line-217> if c1 == 2:</line-217>
<line-218> j = 0</line-218>
<line-219> c1 = 0</line-219>
<line-220></line-220>
<line-221></line-221>
<line-222></line-222>
<line-223> for i in range(m):</line-223>
<line-224> for j in range(n):</line-224>
<line-226> print()</line-226>
<line-227></line-227>
<line-228></line-228>
<line-229></line-229>
<line-230></line-230>
<line-231> </line-231>
<line-232> </line-232>
<line-233></line-233>
<line-234></line-234>
<line-235></line-235>
<line-236></line-236>
<line-237></line-237>
<line-238></line-238>
<line-239></line-239>
<line-240></line-240>
<line-241></line-241>
<line-242></line-242>
<line-243></line-243>
<line-244></line-244>
<line-245></line-245>
|
{"code": "<line-2>t = int(input())</line-2>\n<line-225> print(arr[i][j],end = \" \")</line-225>", "lines": [2, 225]}
#### 0
|
<line-1>mod = 10 ** 9 + 7</line-1>
<line-3>choice = {'1' : ['11', '21', '22'], '2' : ['11', '12', '21']}</line-3>
<line-4>def solve(a,b):</line-4>
<line-5> n = len(a)</line-5>
<line-6> if n == 1:</line-6>
<line-7> return 2</line-7>
<line-8> dp = Counter([('11', '11')])</line-8>
<line-9> for i in range(n-1):</line-9>
<line-10> new = Counter()</line-10>
<line-11> for x,y in (a[i], b[i]), (b[i], a[i]):</line-11>
<line-12> for p in choice[x]:</line-12>
<line-13> for q in choice[y]:</line-13>
<line-14> m = p[-1] + x </line-14>
<line-15> n = q[-1] + y</line-15>
<line-16> new[m,n] += dp[p,q]</line-16>
<line-17> new[m,n] %= mod</line-17>
<line-18> dp = new</line-18>
<line-19> ans = 0 </line-19>
<line-20> for i in '11', '21', :</line-20>
<line-21> for j in '11', '21':</line-21>
<line-22> ans += dp[i,j]</line-22>
<line-23> return (ans * 2) % mod</line-23>
<line-24></line-24>
<line-25> </line-25>
<line-26>t = int(input())</line-26>
<line-27>for _ in range(t):</line-27>
<line-28> a = input()</line-28>
<line-30> print(solve(a,b))</line-30>
|
{"code": "<line-2>from collections import Counter</line-2>\n<line-29> b = input()</line-29>", "lines": [2, 29]}
#### 0
|
<line-2> n=int(input())</line-2>
<line-3> print(bin(n).count("1")) </line-3>
|
{"code": "<line-1>for t in range(int(input())):</line-1>", "lines": [1]}
#### 0
|
<line-1>nCr = [[0 for x in range(1001)] for x in range(1001)]</line-1>
<line-2> </line-2>
<line-4> nCr[i][0]=1</line-4>
<line-5> nCr[i][i]=1</line-5>
<line-6>for i in range (1,1001):</line-6>
<line-7> for j in range (1,1001):</line-7>
<line-8> if i!=j:</line-8>
<line-9> nCr[i][j] = nCr[i-1][j] + nCr[i-1][j-1]</line-9>
<line-10> </line-10>
<line-11>t=eval(input())</line-11>
<line-12>for rajarshisarkar in range(0,t):</line-12>
<line-13> s,n,m,k=list(map(int,input().split(' ')))</line-13>
<line-14> foo=0.000000</line-14>
<line-15> tot = float(nCr[s-1][n-1])</line-15>
<line-16> if s==n:</line-16>
<line-17> print("1.000000\n")</line-17>
<line-18> continue</line-18>
<line-19> if k>n:</line-19>
<line-20> print("0.000000\n")</line-20>
<line-21> continue</line-21>
<line-22> if m>n:</line-22>
<line-23> wola=n</line-23>
<line-24> else:</line-24>
<line-25> wola=m</line-25>
<line-26> for i in range(k,wola):</line-26>
<line-28> print("%f\n"% (float(foo/tot)))</line-28>
|
{"code": "<line-3>for i in range (0,1001):</line-3>\n<line-27> foo+= ((nCr[m-1][i])*(nCr[s-m][n-i-1]))</line-27>", "lines": [3, 27]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>def swap(a,b):</line-3>
<line-4> return b,a</line-4>
<line-5></line-5>
<line-6>t = int(input())</line-6>
<line-7>while(t!=0):</line-7>
<line-8> z = list(map(int,input().strip().split(" ")))</line-8>
<line-9> x=z[0]</line-9>
<line-10> r=z[1]</line-10>
<line-11> a=z[2]</line-11>
<line-12> b=z[3]</line-12>
<line-13> #p = math.pi</line-13>
<line-14> peri = 2*r</line-14>
<line-15> tp = x*peri</line-15>
<line-16> </line-16>
<line-17> if(a<b):</line-17>
<line-18> a,b=swap(a,b)</line-18>
<line-19> t1 = tp/a</line-19>
<line-20> d2 = t1* b</line-20>
<line-21> dd = abs(tp-d2)</line-21>
<line-22> </line-22>
<line-23> if(dd%peri==0):</line-23>
<line-24> print(int(dd//peri)-1)</line-24>
<line-25> else:</line-25>
<line-26> n = int(dd//peri)</line-26>
<line-28> t-=1</line-28>
|
{"code": "<line-2>import math</line-2>\n<line-27> print(n)</line-27>", "lines": [2, 27]}
#### 0
|
<line-1>from decimal import Decimal</line-1>
<line-2></line-2>
<line-4>for _ in range(T):</line-4>
<line-5> N = int(input())</line-5>
<line-6> data = dict() </line-6>
<line-7> for __ in range(N):</line-7>
<line-8> ci, pi = input().split() </line-8>
<line-9> data[ci] = pi</line-9>
<line-10> S = list(input())</line-10>
<line-11> for i in range(len(S)):</line-11>
<line-12> if S[i] in data.keys():</line-12>
<line-13> S[i] = data[S[i]] </line-13>
<line-14> ###</line-14>
<line-15> S = "".join(S)</line-15>
<line-16> if '.' in S:</line-16>
<line-17> S = S.strip('0').rstrip('.')</line-17>
<line-18> else:</line-18>
<line-20> print(S or '0')</line-20>
|
{"code": "<line-3>T = int(input())</line-3>\n<line-19> S = S.lstrip('0')</line-19>", "lines": [3, 19]}
#### 0
|
<line-1></line-1>
<line-2>def issafe(r,c,r1,c1,graph):</line-2>
<line-4> return True</line-4>
<line-5> return False</line-5>
<line-6> </line-6>
<line-7></line-7>
<line-8>t=int(input())</line-8>
<line-9>for mmmmmm in range(t):</line-9>
<line-10> n,m=map(int,input().split())</line-10>
<line-11> x,y=map(int,input().split())</line-11>
<line-12> </line-12>
<line-13> graph=[[False]*(m+2) for _ in range(n+2)]</line-13>
<line-14></line-14>
<line-15> cost_graph=[[[-1,-1,-1] for __ in range(m)] for _ in range(n)]</line-15>
<line-16> </line-16>
<line-17> for i in range(n):</line-17>
<line-18> str1=input()</line-18>
<line-19> for j,val in enumerate(str1):</line-19>
<line-20> graph[i][j]=(val=='1')</line-20>
<line-21> </line-21>
<line-22> x=x-1</line-22>
<line-23> y=y-1</line-23>
<line-24> </line-24>
<line-25> set1=set()</line-25>
<line-26> set1.add((x,y,0))</line-26>
<line-27> cost_graph[x][y][0]=0</line-27>
<line-28> while(set1):</line-28>
<line-29> </line-29>
<line-30> set2=set()</line-30>
<line-31> </line-31>
<line-32> while(set1):</line-32>
<line-33> r,c,p=set1.pop()</line-33>
<line-34> </line-34>
<line-35> new_cost=cost_graph[r][c][p]+1</line-35>
<line-36> </line-36>
<line-37> if(p==0):</line-37>
<line-38> if issafe(r,c+1,r,c+2,graph):</line-38>
<line-39> if cost_graph[r][c+1][1]==-1 or cost_graph[r][c+1][1]>new_cost:</line-39>
<line-40> cost_graph[r][c+1][1]=new_cost</line-40>
<line-41> set2.add((r,c+1,1))</line-41>
<line-42> </line-42>
<line-43> if issafe(r+1,c,r+2,c,graph):</line-43>
<line-44> if cost_graph[r+1][c][2]==-1 or cost_graph[r+1][c][2]>new_cost:</line-44>
<line-45> cost_graph[r+1][c][2]=new_cost</line-45>
<line-46> set2.add((r+1,c,2))</line-46>
<line-47> </line-47>
<line-48> if issafe(r,c-2,r,c-1,graph):</line-48>
<line-49> if cost_graph[r][c-2][1]==-1 or cost_graph[r][c-2][1]>new_cost:</line-49>
<line-50> cost_graph[r][c-2][1]=new_cost</line-50>
<line-51> set2.add((r,c-2,1))</line-51>
<line-52> </line-52>
<line-53> if issafe(r-2,c,r-1,c,graph):</line-53>
<line-54> if cost_graph[r-2][c][2]==-1 or cost_graph[r-2][c][2]>new_cost:</line-54>
<line-55> cost_graph[r-2][c][2]=new_cost</line-55>
<line-56> set2.add((r-2,c,2))</line-56>
<line-57> </line-57>
<line-58> elif(p==1):</line-58>
<line-59> if issafe(r,c+2,r,c+2,graph):</line-59>
<line-60> if cost_graph[r][c+2][0]==-1 or cost_graph[r][c+2][0]>new_cost:</line-60>
<line-61> cost_graph[r][c+2][0]=new_cost</line-61>
<line-62> set2.add((r,c+2,0))</line-62>
<line-63> </line-63>
<line-64> if issafe(r+1,c,r+1,c+1,graph):</line-64>
<line-65> if cost_graph[r+1][c][1]==-1 or cost_graph[r+1][c][1]>new_cost:</line-65>
<line-66> cost_graph[r+1][c][1]=new_cost</line-66>
<line-67> set2.add((r+1,c,1))</line-67>
<line-68> </line-68>
<line-69> if issafe(r,c-1,r,c-1,graph):</line-69>
<line-70> if cost_graph[r][c-1][0]==-1 or cost_graph[r][c-1][0]>new_cost:</line-70>
<line-71> cost_graph[r][c-1][0]=new_cost</line-71>
<line-72> set2.add((r,c-1,0))</line-72>
<line-73> </line-73>
<line-74> if issafe(r-1,c,r-1,c+1,graph):</line-74>
<line-75> if cost_graph[r-1][c][1]==-1 or cost_graph[r-1][c][1]>new_cost:</line-75>
<line-76> cost_graph[r-1][c][1]=new_cost</line-76>
<line-77> set2.add((r-1,c,1))</line-77>
<line-78> </line-78>
<line-79> elif(p==2):</line-79>
<line-80> if issafe(r,c+1,r+1,c+1,graph):</line-80>
<line-81> if cost_graph[r][c+1][2]==-1 or cost_graph[r][c+1][2]>new_cost:</line-81>
<line-82> cost_graph[r][c+1][2]=new_cost</line-82>
<line-83> set2.add((r,c+1,2))</line-83>
<line-84> </line-84>
<line-85> if issafe(r+2,c,r+2,c,graph):</line-85>
<line-86> if cost_graph[r+2][c][0]==-1 or cost_graph[r+2][c][0]>new_cost:</line-86>
<line-87> cost_graph[r+2][c][0]=new_cost</line-87>
<line-88> set2.add((r+2,c,0))</line-88>
<line-89> </line-89>
<line-90> if issafe(r,c-1,r+1,c-1,graph):</line-90>
<line-91> if cost_graph[r][c-1][2]==-1 or cost_graph[r][c-1][2]>new_cost:</line-91>
<line-92> cost_graph[r][c-1][2]=new_cost</line-92>
<line-93> set2.add((r,c-1,2))</line-93>
<line-94> </line-94>
<line-95> if issafe(r-1,c,r-1,c,graph):</line-95>
<line-96> if cost_graph[r-1][c][0]==-1 or cost_graph[r-1][c][0]>new_cost:</line-96>
<line-97> cost_graph[r-1][c][0]=new_cost</line-97>
<line-98> set2.add((r-1,c,0))</line-98>
<line-99> set1=set2</line-99>
<line-100> </line-100>
<line-101> for _ in range(n):</line-101>
<line-102> for __ in range(m):</line-102>
<line-104> print()</line-104>
<line-105> </line-105>
<line-106> </line-106>
<line-107> </line-107>
<line-108> </line-108>
<line-109> </line-109>
<line-110> </line-110>
<line-111> </line-111>
<line-112> </line-112>
<line-113> </line-113>
<line-114> </line-114>
<line-115> </line-115>
<line-116> </line-116>
<line-117> </line-117>
<line-118> </line-118>
<line-119> </line-119>
|
{"code": "<line-3> if (graph[r][c] and graph[r1][c1]):</line-3>\n<line-103> print(cost_graph[_][__][0],end=\" \")</line-103>", "lines": [3, 103]}
#### 0
|
<line-1>def matrix(L,row,col,c):</line-1>
<line-3> dp=[]</line-3>
<line-4> for i in range(row+1):</line-4>
<line-5> temp=[]</line-5>
<line-6> for i in range(col+1):</line-6>
<line-7> temp.append([])</line-7>
<line-8> dp.append(temp)</line-8>
<line-9></line-9>
<line-10> for i in range(row+1):</line-10>
<line-11> dp[i][0]=0</line-11>
<line-12> for i in range(col+1):</line-12>
<line-13> dp[0][i]=0</line-13>
<line-14> for i in range(1,row+1):</line-14>
<line-15> for j in range(1,col+1):</line-15>
<line-16> if L[i-1][j-1]==c:</line-16>
<line-17> dp[i][j]=min(dp[i][j-1],dp[i-1][j],dp[i-1][j-1])+1</line-17>
<line-18> else:</line-18>
<line-19> dp[i][j]=0</line-19>
<line-20> d[dp[i][j]]=d.get(dp[i][j],0)+1</line-20>
<line-21>## for i in xrange(row+1):</line-21>
<line-22>## for j in xrange(col+1):</line-22>
<line-23>## print dp[i][j],</line-23>
<line-24>## print</line-24>
<line-25> return d</line-25>
<line-26></line-26>
<line-27>from sys import stdin</line-27>
<line-28>n,m,q=list(map(int,stdin.readline().split()))</line-28>
<line-29>L=[]</line-29>
<line-30>for i in range(n):</line-30>
<line-31> L.append(stdin.readline().strip())</line-31>
<line-32>male=matrix(L,n,m,'M')</line-32>
<line-33>female=matrix(L,n,m,'F')</line-33>
<line-34>for i in range(q):</line-34>
<line-35> query=stdin.readline().split()</line-35>
<line-36> if query[1]=='F':</line-36>
<line-37> if female.get(int(query[0]),0)==0:</line-37>
<line-38> print('no')</line-38>
<line-39> else:</line-39>
<line-40> print('yes')</line-40>
<line-41> else:</line-41>
<line-42> if male.get(int(query[0]),0)==0:</line-42>
<line-43> print('no')</line-43>
<line-45> print('yes')</line-45>
|
{"code": "<line-2> d={}</line-2>\n<line-44> else:</line-44>", "lines": [2, 44]}
#### 0
|
<line-1>for _ in range(int(input())):</line-1>
<line-3> n=len(s)</line-3>
<line-4> k=s[::-1]</line-4>
<line-5> a,b="",""</line-5>
<line-6> for i in range(n):</line-6>
<line-7> if s[i]!=k[i]:</line-7>
<line-8> a+=s[i+1:]</line-8>
<line-9> b+=k[i+1:]</line-9>
<line-10> break</line-10>
<line-11> else:</line-11>
<line-12> a+=s[i]</line-12>
<line-13> b+=k[i]</line-13>
<line-14> #print(a,b)</line-14>
<line-15> if a==a[::-1] or b==b[::-1]:</line-15>
<line-16> print("YES")</line-16>
<line-18> print("NO")</line-18>
|
{"code": "<line-2> s=str(input())</line-2>\n<line-17> else:</line-17>", "lines": [2, 17]}
#### 0
|
<line-1>s,n,s1,lis,new1=[],[],[],[],[]</line-1>
<line-3>q = int(input())</line-3>
<line-4>s.append(input().split(' '))</line-4>
<line-5>s1 = list([list(map(int,x)) for x in s])</line-5>
<line-6>sum1 = sum(s1[0])</line-6>
<line-7>if len(s1[0])%2!=0 :</line-7>
<line-8> z = (len(s1[0])+1)//2</line-8>
<line-9> n = list(itertools.combinations(s1[0],z))</line-9>
<line-10> for j in range(len(n)) :</line-10>
<line-11> x = sum(n[j])</line-11>
<line-12> if x==sum1//2 :</line-12>
<line-13> lis = n[j]</line-13>
<line-14> break</line-14>
<line-15> new1 = list(lis)</line-15>
<line-16> sum2 = sum(new1)</line-16>
<line-17> for j in range(len(lis)) :</line-17>
<line-18> y = lis[j]</line-18>
<line-19> s1[0].remove(y)</line-19>
<line-20> sum3=sum(s1[0])</line-20>
<line-21> if sum3>sum2 :</line-21>
<line-22> print(' '.join(map(str,s1[0])))</line-22>
<line-23> print(' '.join(map(str,new1)))</line-23>
<line-24> else :</line-24>
<line-25> print(' '.join(map(str,new1)))</line-25>
<line-26> print(' '.join(map(str,s1[0])))</line-26>
<line-27>else :</line-27>
<line-28> z = len(s1[0])//2</line-28>
<line-29> n = list(itertools.combinations(s1[0],z))</line-29>
<line-30> for j in range(len(n)) :</line-30>
<line-31> x = sum(n[j])</line-31>
<line-32> if x==sum1//2 :</line-32>
<line-33> lis = n[j]</line-33>
<line-34> break</line-34>
<line-35> #print lis,len(lis)</line-35>
<line-36> new1 = list(lis)</line-36>
<line-37> sum2 = sum(new1)</line-37>
<line-38> for j in range(len(lis)) :</line-38>
<line-39> y = lis[j]</line-39>
<line-40> s1[0].remove(y)</line-40>
<line-41> sum3 = sum(s1[0])</line-41>
<line-42> if sum3>sum2 :</line-42>
<line-43> print(' '.join(map(str,s1[0])))</line-43>
<line-44> print(' '.join(map(str,new1)))</line-44>
<line-45> else :</line-45>
<line-47> print(' '.join(map(str,s1[0])))</line-47>
|
{"code": "<line-2>import itertools</line-2>\n<line-46> print(' '.join(map(str,new1)))</line-46>", "lines": [2, 46]}
#### 0
|
<line-1>for _ in range(int(input())):</line-1>
<line-3> ar = list(map(int,input().split()))</line-3>
<line-4> d = {}</line-4>
<line-5> for ele in ar:</line-5>
<line-6> if ele in d:</line-6>
<line-7> d[ele] += 1</line-7>
<line-8> else:</line-8>
<line-9> d[ele] = 1</line-9>
<line-10> m = 99999</line-10>
<line-11> count = 0</line-11>
<line-12> for ele in d:</line-12>
<line-13> count+=1</line-13>
<line-14> if m>d[ele]:</line-14>
<line-15> m = d[ele]</line-15>
<line-16> if count!=8:</line-16>
<line-17> print(0)</line-17>
<line-19> print(m)</line-19>
|
{"code": "<line-2> n = int(input())</line-2>\n<line-18> else:</line-18>", "lines": [2, 18]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>for _ in range(int(input())):</line-3>
<line-4> n=int(input())</line-4>
<line-5> l=list(map(int, input().split()))</line-5>
<line-6> l.insert(0, 0)</line-6>
<line-7> l1=[0]*(n+1)</line-7>
<line-8> l1[1]=l[1]</line-8>
<line-9> for i in range(2, n+1):</line-9>
<line-11> </line-11>
<line-12> print(l1[-1]) </line-12>
|
{"code": "<line-2># cook your dish here</line-2>\n<line-10> l1[i]=max(l1[i-1]+l[i]*i, l1[i-2]+l[i-1]*i+l[i]*(i-1))</line-10>", "lines": [2, 10]}
#### 0
|
<line-1></line-1>
<line-2></line-2>
<line-3></line-3>
<line-4>t = int(input())</line-4>
<line-5></line-5>
<line-7> if (b == 0): return a</line-7>
<line-8> return gcd (b, a % b)</line-8>
<line-9></line-9>
<line-10>dp = {}</line-10>
<line-11></line-11>
<line-12>def solve (p, k, g, s, m, x, y, n):</line-12>
<line-13> if ((p, k, g) in dp): return dp[(p, k, g)];</line-13>
<line-14> </line-14>
<line-15> ans = 0</line-15>
<line-16></line-16>
<line-17> if (p == n): </line-17>
<line-18> if k >= x and k <= y:</line-18>
<line-19> ans = g</line-19>
<line-20> else:</line-20>
<line-21> ans = 0 </line-21>
<line-22> else: </line-22>
<line-23> for i in range (p, n):</line-23>
<line-24> </line-24>
<line-25> if (i - p + 1 > m): break</line-25>
<line-26> </line-26>
<line-27> temp = solve (i + 1, k + 1, gcd(g, int(s[p:i + 1])), s, m, x, y, n)</line-27>
<line-28> if (temp > ans):</line-28>
<line-29> ans = temp</line-29>
<line-30> </line-30>
<line-31> dp[(p, k, g)] = ans</line-31>
<line-32> return ans</line-32>
<line-33> </line-33>
<line-34></line-34>
<line-35>while t != 0:</line-35>
<line-36> dp = {}</line-36>
<line-37> t -= 1</line-37>
<line-38> n = int(input())</line-38>
<line-39> s = input()</line-39>
<line-40> m, x, y = list(map (int, input().split()))</line-40>
<line-41> x += 1</line-41>
<line-43> </line-43>
<line-44> print(solve (0, 0, 0, s, m, x, y, n))</line-44>
<line-45> </line-45>
|
{"code": "<line-6>def gcd (a, b):</line-6>\n<line-42> y += 1</line-42>", "lines": [6, 42]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>n=0;m=0;</line-3>
<line-4>A=[];B=[];</line-4>
<line-5>anscount=0;k=0;</line-5>
<line-6></line-6>
<line-7>def generate(n,m,l):</line-7>
<line-8> nonlocal anscount</line-8>
<line-9> if(len(l)==n+m):</line-9>
<line-10> X=l</line-10>
<line-11> i,j = 0,0</line-11>
<line-12> C=[0 for t in range(n+m)]</line-12>
<line-13> while((i+j)<(n+m)):</line-13>
<line-14> if(X[i+j] == 0):</line-14>
<line-15> C[i+j] = A[i]</line-15>
<line-16> i = i+1</line-16>
<line-17> else:</line-17>
<line-18> C[i+j] = B[j]</line-18>
<line-19> j = j+1</line-19>
<line-20> ans = len(C)</line-20>
<line-21> for i in range(1,len(C)):</line-21>
<line-22> if(C[i]==C[i-1]):</line-22>
<line-23> ans-=1</line-23>
<line-24> if(ans==k):</line-24>
<line-25> anscount+=1</line-25>
<line-26> else:</line-26>
<line-27> if(l.count(1)<m):</line-27>
<line-28> generate(n,m,l+[1])</line-28>
<line-29> if(l.count(0)<n):</line-29>
<line-30> generate(n,m,l+[0])</line-30>
<line-31> else:</line-31>
<line-32> if(l.count(0)<n):</line-32>
<line-33> generate(n,m,l+[0])</line-33>
<line-34>for _ in range(int(input())):</line-34>
<line-35> anscount=0</line-35>
<line-36> n,m,k=list(map(int,input().split()))</line-36>
<line-37> A=list(map(int,input().split()))</line-37>
<line-38> B=list(map(int,input().split()))</line-38>
<line-40> print(anscount)</line-40>
|
{"code": "<line-2># cook your dish here</line-2>\n<line-39> generate(n,m,[])</line-39>", "lines": [2, 39]}
#### 0
|
<line-1>def getsum(N):</line-1>
<line-3> return 9</line-3>
<line-4> if N==2:</line-4>
<line-5> return 99</line-5>
<line-6> s = ""</line-6>
<line-7> for i in range(0,N):</line-7>
<line-8> s = s+'5'</line-8>
<line-9> s = int(s)</line-9>
<line-10> if N%2==0:</line-10>
<line-11> s = s*pow(9,N//2-1)</line-11>
<line-12> else:</line-12>
<line-13> s = s*pow(9,N//2)</line-13>
<line-14> return s%(pow(10,9)+7)</line-14>
<line-15></line-15>
<line-16>def main():</line-16>
<line-17> t = int(input())</line-17>
<line-18> for _ in range(0,t):</line-18>
<line-19> N = int(input())</line-19>
<line-20> result = getsum(N)</line-20>
<line-21> print(result)</line-21>
<line-22>def __starting_point():</line-22>
<line-24></line-24>
<line-25>__starting_point()</line-25>
|
{"code": "<line-2>\tif N==1:</line-2>\n<line-23>\tmain()</line-23>", "lines": [2, 23]}
#### 0
|
<line-1>import sys</line-1>
<line-3>for t in range(T):</line-3>
<line-4> sys.stdin.readline().strip()</line-4>
<line-5> st = '0'+sys.stdin.readline().strip()+'0'</line-5>
<line-6> res = 0</line-6>
<line-7> for i in range(1,len(st)-1):</line-7>
<line-8> if st[i] == st[i-1] == st[i+1] == '0':</line-8>
<line-10> print(res)</line-10>
|
{"code": "<line-2>T = int(sys.stdin.readline().strip())</line-2>\n<line-9> res+=1</line-9>", "lines": [2, 9]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>for i in range(t):</line-3>
<line-4> n=int(input())</line-4>
<line-5> nums=list(map(int,input().split()))</line-5>
<line-6> k=int(input())</line-6>
<line-7> an=nums[k-1]</line-7>
<line-8> cn=0</line-8>
<line-9> for i in range(n):</line-9>
<line-10> if(nums[i]<an):</line-10>
<line-12></line-12>
<line-13> print(cn+1)</line-13>
|
{"code": "<line-2>t=int(input())</line-2>\n<line-11> cn+=1</line-11>", "lines": [2, 11]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>for i in range(a):</line-3>
<line-4> if(n%10==0):</line-4>
<line-5> n=n//10</line-5>
<line-6> else:</line-6>
<line-8> </line-8>
<line-9>print(n)</line-9>
|
{"code": "<line-2>n,a=map(int,input().split())</line-2>\n<line-7> n=n-1</line-7>", "lines": [2, 7]}
#### 0
|
<line-1>t=int(input())</line-1>
<line-3></line-3>
<line-4>for i in range(t) :</line-4>
<line-5> s = input()</line-5>
<line-6> a,b,c,n = s.split()</line-6>
<line-7> n=int(n)</line-7>
<line-8> d = int(a+b*n+c,2)</line-8>
<line-9> count.append(0)</line-9>
<line-10> while(d>0) :</line-10>
<line-11> d=(d&(d+1))-1</line-11>
<line-12> count[i]+=1</line-12>
<line-13></line-13>
<line-14></line-14>
<line-16> print(count[i])</line-16>
|
{"code": "<line-2>count=[]</line-2>\n<line-15>for i in range(t) :</line-15>", "lines": [2, 15]}
#### 0
|
<line-1>t=int(input())</line-1>
<line-3> n,m=list(map(int,input().split()))</line-3>
<line-4> l=[0]+list(map(int,input().split()))</line-4>
<line-5> s=0</line-5>
<line-6> c=1</line-6>
<line-7> m1=[]</line-7>
<line-8> for i in range(n):</line-8>
<line-9> d,f,b=list(map(int,input().split()))</line-9>
<line-10> if(l[d]>0):</line-10>
<line-11> m1.append(d)</line-11>
<line-12> s+=f</line-12>
<line-13> l[d]-=1</line-13>
<line-14> else:</line-14>
<line-15> m1.append(0)</line-15>
<line-16> s+=b</line-16>
<line-17> for i in range(n):</line-17>
<line-18> if(m1[i]==0):</line-18>
<line-19> for j in range(c,m+1):</line-19>
<line-20> if(l[j]>0):</line-20>
<line-21> m1[i]=j</line-21>
<line-22> l[j]-=1</line-22>
<line-23> c=j</line-23>
<line-24> break</line-24>
<line-26> print(*m1)</line-26>
|
{"code": "<line-2>for i in range(t):</line-2>\n<line-25> print(s)</line-25>", "lines": [2, 25]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>a,b=list(map(int,stdin.readline().split()))</line-3>
<line-4>left=[]</line-4>
<line-5>top=[]</line-5>
<line-6>for i in range(a):</line-6>
<line-7> c,d=list(map(int,stdin.readline().split()))</line-7>
<line-8> left.append(c)</line-8>
<line-9> top.append(d)</line-9>
<line-10>left.sort()</line-10>
<line-11>top.sort()</line-11>
<line-12>from bisect import bisect_right as br</line-12>
<line-13>from bisect import bisect_left as bl</line-13>
<line-14>row=0</line-14>
<line-15>col=0</line-15>
<line-16>total=0</line-16>
<line-17>cons_x=0</line-17>
<line-18>cons_y=0</line-18>
<line-19>for i in range(len(left)):</line-19>
<line-20> cons_x+=(abs(left[i]))</line-20>
<line-21> cons_y+=(abs(top[i]))</line-21>
<line-22>total=cons_x+cons_y</line-22>
<line-23>cc=stdin.readline().rstrip()</line-23>
<line-24>for i in cc:</line-24>
<line-25> if i=="R":</line-25>
<line-26> kk=br(left,col)</line-26>
<line-27> cons_x=(cons_x+kk-(a-kk))</line-27>
<line-28> col+=1</line-28>
<line-29> if i=="L":</line-29>
<line-30> kk=bl(left,col)</line-30>
<line-31> cons_x=(cons_x+(a-kk)-kk)</line-31>
<line-32> col-=1</line-32>
<line-33> if i=="U":</line-33>
<line-34> kk=br(top,row)</line-34>
<line-35> cons_y=(cons_y+kk-(a-kk))</line-35>
<line-36> row+=1</line-36>
<line-37> if i=="D":</line-37>
<line-38> kk=bl(top,row)</line-38>
<line-39> cons_y=(cons_y+(a-kk)-kk)</line-39>
<line-40> row-=1</line-40>
<line-42> stdout.write("\n")</line-42>
<line-43> </line-43>
<line-44></line-44>
|
{"code": "<line-2>from sys import stdin,stdout</line-2>\n<line-41> stdout.write(str(cons_x+cons_y))</line-41>", "lines": [2, 41]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>from math import floor</line-3>
<line-4>for _ in range(int(input())):</line-4>
<line-5> n,a,b,x,y,z=map(int,input().split())</line-5>
<line-6> arr=[-int(i) for i in input().split()]</line-6>
<line-7> days=((z-b-1)//y)</line-7>
<line-8> ans=0</line-8>
<line-9> hq.heapify(arr)</line-9>
<line-10> curr=a+days*x</line-10>
<line-11> while curr<z :</line-11>
<line-12> u=hq.heappop(arr)</line-12>
<line-13> u=-u</line-13>
<line-14> if u==0 :</line-14>
<line-15> break</line-15>
<line-16> else:</line-16>
<line-17> curr+=u</line-17>
<line-18> ans+=1</line-18>
<line-19> hq.heappush(arr,-(u//2))</line-19>
<line-20> if curr>=z:</line-20>
<line-21> print(ans)</line-21>
<line-23> print("RIP")</line-23>
|
{"code": "<line-2>import heapq as hq</line-2>\n<line-22> else:</line-22>", "lines": [2, 22]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>while(t>0):</line-3>
<line-4> n=int(input())</line-4>
<line-5> b=[int(x) for x in input().split()]</line-5>
<line-6> p=[float(x) for x in input().split()]</line-6>
<line-7> s=[0]*(10)</line-7>
<line-8> yet=2</line-8>
<line-9> mx=0</line-9>
<line-10> for i in range(n):</line-10>
<line-11> st=bin(b[i])</line-11>
<line-12> rng=len(st)-2</line-12>
<line-13> if(rng+2>yet):</line-13>
<line-14> for ml in range(rng+2-yet):</line-14>
<line-15> s.append(0)</line-15>
<line-16> if(rng>mx):</line-16>
<line-17> mx=rng</line-17>
<line-18> for k in range(2,rng+2):</line-18>
<line-19> if(st[k]=='1'):</line-19>
<line-20> s[rng-k+1]=(s[rng-k+1]*(1-p[i]))+((1-s[rng-k+1])*(p[i]))</line-20>
<line-21> # else:</line-21>
<line-22> # s[k-2]=(s[k-2]*1)</line-22>
<line-23> # print(s)</line-23>
<line-24> # print(mx)</line-24>
<line-25> mult=1</line-25>
<line-26> ans=0</line-26>
<line-27> for i in range(0,mx):</line-27>
<line-28> ans+=mult*s[i]</line-28>
<line-29> mult=mult*2</line-29>
<line-31> t-=1</line-31>
|
{"code": "<line-2>t=int(input())</line-2>\n<line-30> print(\"%.16f\" % ans)</line-30>", "lines": [2, 30]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3> n,k = [int(v) for v in input().split()]</line-3>
<line-4> ans = (n//2)*(k+2)</line-4>
<line-5> if n%2 == 0:</line-5>
<line-6> ans = ans</line-6>
<line-7> else:</line-7>
<line-9> </line-9>
<line-10> print(ans)</line-10>
|
{"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-8> ans += 1 + 2*k</line-8>", "lines": [2, 8]}
#### 0
|
<line-1>m=1000000007</line-1>
<line-3> if (a == 0): </line-3>
<line-4> return b </line-4>
<line-5> return gcd(b % a, a)</line-5>
<line-6>def modexp(x, n): </line-6>
<line-7> if (n == 0) : </line-7>
<line-8> return 1</line-8>
<line-9> elif (n % 2 == 0) : </line-9>
<line-10> return modexp((x * x) % m, n // 2) </line-10>
<line-11> else : </line-11>
<line-12> return (x * modexp((x * x) % m, </line-12>
<line-13> (n - 1) / 2) % m)</line-13>
<line-14>def getFractionModulo(a, b): </line-14>
<line-15> c = gcd(a, b)</line-15>
<line-16> a = a // c </line-16>
<line-17> b = b // c </line-17>
<line-18> d = modexp(b, m - 2) </line-18>
<line-19> ans = ((a % m) * (d % m)) % m</line-19>
<line-20> return ans</line-20>
<line-21>t=int(input())</line-21>
<line-22>for i in range(t):</line-22>
<line-23> n=int(input())</line-23>
<line-25> print(getFractionModulo(n-1,n+1))</line-25>
|
{"code": "<line-2>def gcd(a, b): </line-2>\n<line-24> n=n-1</line-24>", "lines": [2, 24]}
#### 0
|
<line-1>t = int(input())</line-1>
<line-3> n = int(input())</line-3>
<line-4> A = []</line-4>
<line-5> for i in range(0, n):</line-5>
<line-6> A.append([int(i) for i in input().split()])</line-6>
<line-7> ones = sum([sum(i) for i in A])</line-7>
<line-8> compare = n</line-8>
<line-9> ans = 0</line-9>
<line-10> for i in range(0, n):</line-10>
<line-11> if ones <= compare:</line-11>
<line-12> ans = i</line-12>
<line-13> break</line-13>
<line-15> print(ans)</line-15>
|
{"code": "<line-2>for i in range(t):</line-2>\n<line-14> compare += 2*(n-1-i)</line-14>", "lines": [2, 14]}
#### 0
|
<line-1></line-1>
<line-2>t = int(input())</line-2>
<line-3></line-3>
<line-5> a = input()</line-5>
<line-6> b = input()</line-6>
<line-7> </line-7>
<line-8> agts=bgts=afour=bfour=aseven=bseven=altf=bltf=afts=bfts=0;</line-8>
<line-9> </line-9>
<line-10> for j in a:</line-10>
<line-11> if j >= '7':</line-11>
<line-12> if j > '7':</line-12>
<line-13> agts += 1</line-13>
<line-14> else:</line-14>
<line-15> aseven += 1</line-15>
<line-16> elif j >= '4':</line-16>
<line-17> if j > '4':</line-17>
<line-18> afts += 1</line-18>
<line-19> else:</line-19>
<line-20> afour += 1</line-20>
<line-21> else:</line-21>
<line-22> altf += 1</line-22>
<line-23> </line-23>
<line-24> for j in b:</line-24>
<line-25> if j >= '7':</line-25>
<line-26> if j > '7':</line-26>
<line-27> bgts += 1</line-27>
<line-28> else:</line-28>
<line-29> bseven += 1</line-29>
<line-30> elif j >= '4':</line-30>
<line-31> if j > '4':</line-31>
<line-32> bfts += 1</line-32>
<line-33> else:</line-33>
<line-34> bfour += 1</line-34>
<line-35> else:</line-35>
<line-36> bltf += 1</line-36>
<line-37> </line-37>
<line-38> nseven = 0</line-38>
<line-39> nfour = 0</line-39>
<line-40> </line-40>
<line-41> if aseven > bfts:</line-41>
<line-42> aseven -= bfts;</line-42>
<line-43> nseven += bfts;</line-43>
<line-44> bfts = 0;</line-44>
<line-45> else:</line-45>
<line-46> bfts -= aseven;</line-46>
<line-47> nseven += aseven;</line-47>
<line-48> aseven = 0;</line-48>
<line-49> </line-49>
<line-50> if bseven > afts:</line-50>
<line-51> bseven -= afts;</line-51>
<line-52> nseven += afts;</line-52>
<line-53> afts = 0;</line-53>
<line-54> else:</line-54>
<line-55> afts -= bseven;</line-55>
<line-56> nseven += bseven;</line-56>
<line-57> bseven = 0;</line-57>
<line-58> </line-58>
<line-59> if aseven > bltf:</line-59>
<line-60> aseven -= bltf;</line-60>
<line-61> nseven += bltf;</line-61>
<line-62> bltf = 0;</line-62>
<line-63> else:</line-63>
<line-64> bltf -= aseven;</line-64>
<line-65> nseven += aseven;</line-65>
<line-66> aseven = 0;</line-66>
<line-67> </line-67>
<line-68> if bseven > altf:</line-68>
<line-69> bseven -= altf;</line-69>
<line-70> nseven += altf;</line-70>
<line-71> altf = 0;</line-71>
<line-72> else:</line-72>
<line-73> altf -= bseven;</line-73>
<line-74> nseven += bseven;</line-74>
<line-75> bseven = 0;</line-75>
<line-76> </line-76>
<line-77> if aseven > bfour:</line-77>
<line-78> aseven -= bfour;</line-78>
<line-79> nseven += bfour;</line-79>
<line-80> bfour = 0;</line-80>
<line-81> else:</line-81>
<line-82> bfour -= aseven;</line-82>
<line-83> nseven += aseven;</line-83>
<line-84> aseven = 0;</line-84>
<line-85> </line-85>
<line-86> if bseven > afour:</line-86>
<line-87> bseven -= afour;</line-87>
<line-88> nseven += afour;</line-88>
<line-89> afour = 0;</line-89>
<line-90> else:</line-90>
<line-91> afour -= bseven;</line-91>
<line-92> nseven += bseven;</line-92>
<line-93> bseven = 0;</line-93>
<line-94> </line-94>
<line-95> nseven += min(aseven,bseven)</line-95>
<line-96> </line-96>
<line-97> if afour > bltf:</line-97>
<line-98> afour -= bltf;</line-98>
<line-99> nfour += bltf;</line-99>
<line-100> bltf = 0</line-100>
<line-101> else:</line-101>
<line-102> bltf -= afour;</line-102>
<line-103> nfour += afour;</line-103>
<line-104> afour = 0;</line-104>
<line-105> </line-105>
<line-106> if bfour > altf:</line-106>
<line-107> bfour -= altf;</line-107>
<line-108> nfour += altf;</line-108>
<line-109> altf = 0</line-109>
<line-110> else:</line-110>
<line-111> altf -= bfour;</line-111>
<line-112> nfour += bfour;</line-112>
<line-113> bfour = 0;</line-113>
<line-114> </line-114>
<line-116> </line-116>
<line-117> print('7'*nseven + '4'*nfour)</line-117>
|
{"code": "<line-4>for i in range(0,t):</line-4>\n<line-115>\tnfour += min(afour,bfour)</line-115>", "lines": [4, 115]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>import numpy as np</line-3>
<line-4>n, s, q = [int(j) for j in input().split()]</line-4>
<line-5>edges = [int(j)-1 for j in input().split()]</line-5>
<line-6>costs = [int(j) for j in input().split()]</line-6>
<line-7>special = [int(j)-1 for j in input().split()]</line-7>
<line-8>queries = [[0] * 3 for _ in range(q)]</line-8>
<line-9>for i in range(q):</line-9>
<line-10> queries[i] = [int(j)-1 for j in input().split()]</line-10>
<line-11></line-11>
<line-12>edge_set = [[] for _ in range(n)]</line-12>
<line-13>for i in range(n-1):</line-13>
<line-14> edge_set[i+1].append(edges[i])</line-14>
<line-15> edge_set[edges[i]].append(i+1)</line-15>
<line-16></line-16>
<line-17>stored = np.zeros((s,n,1001),dtype=bool)</line-17>
<line-18>visited = [[] for _ in range(s)]</line-18>
<line-19>for i in range(s):</line-19>
<line-20> s_vertex = special[i]</line-20>
<line-21> s_cost = costs[s_vertex]</line-21>
<line-22> s_visited = visited[i]</line-22>
<line-23> s_visited.append(s_vertex)</line-23>
<line-24> s_stored = stored[i]</line-24>
<line-25> s_stored[s_vertex][0] = True</line-25>
<line-26> s_stored[s_vertex][s_cost] = True</line-26>
<line-27> for edge in edge_set[s_vertex]:</line-27>
<line-28> s_visited.append(edge)</line-28>
<line-29> s_stored[edge] = np.array(s_stored[s_vertex])</line-29>
<line-30> for j in range(1,n):</line-30>
<line-31> vertex = s_visited[j]</line-31>
<line-32> cost = costs[vertex]</line-32>
<line-33> s_stored[vertex][cost:1001] = np.logical_or(s_stored[vertex][0:1001-cost],s_stored[vertex][cost:1001])</line-33>
<line-34> for edge in edge_set[vertex]:</line-34>
<line-35> if edge not in s_visited:</line-35>
<line-36> s_visited.append(edge)</line-36>
<line-37> s_stored[edge] = np.array(s_stored[vertex])</line-37>
<line-38></line-38>
<line-39>for i in range(q):</line-39>
<line-40> first, second, max_cost = queries[i]</line-40>
<line-41> bool_array = np.zeros(max_cost+2,dtype=bool)</line-41>
<line-42> for j in range(s):</line-42>
<line-43> bool_array = np.logical_or(bool_array,np.logical_and(stored[j][first][:max_cost+2],stored[j][second][:max_cost+2]))</line-43>
<line-44> for j in range(max_cost+1,-1,-1):</line-44>
<line-45> if bool_array[j]:</line-45>
<line-47> break</line-47>
|
{"code": "<line-2># cook your dish here</line-2>\n<line-46> print(2 * j)</line-46>", "lines": [2, 46]}
#### 0
|
<line-1>import copy</line-1>
<line-3>a=[int(x) for x in input().split()]</line-3>
<line-4>b=[int(x) for x in input().split()]</line-4>
<line-5>c=[]</line-5>
<line-6>d=[]</line-6>
<line-7>lcs=[]</line-7>
<line-8>def lcsfn(a,c,corda,cordb):</line-8>
<line-9> for i in range(n+1):</line-9>
<line-10> d.append([0]*(n+1))</line-10>
<line-11> lcs.append([0]*(n+1))</line-11>
<line-12> for i in range(1,n+1):</line-12>
<line-13> for j in range(1,n+1):</line-13>
<line-14> if a[i-1]==c[j-1]:</line-14>
<line-15> lcs[i][j]=lcs[i-1][j-1]+1</line-15>
<line-16> d[i][j]='d'</line-16>
<line-17> elif lcs[i-1][j]>lcs[i][j-1]:</line-17>
<line-18> lcs[i][j]=lcs[i-1][j]</line-18>
<line-19> d[i][j]='u'</line-19>
<line-20> else:</line-20>
<line-21> lcs[i][j]=lcs[i][j-1]</line-21>
<line-22> d[i][j]='l'</line-22>
<line-23> i=n</line-23>
<line-24> j=n</line-24>
<line-25> cost=0</line-25>
<line-26> while i>=1 and j>=1:</line-26>
<line-27> if d[i][j]=='d':</line-27>
<line-28> corda.append(a[i-1])</line-28>
<line-29> cordb.append(b[j-1])</line-29>
<line-30> i-=1</line-30>
<line-31> j-=1</line-31>
<line-32> cost+=1</line-32>
<line-33> elif d[i][j]=='l':</line-33>
<line-34> j-=1</line-34>
<line-35> elif d[i][j]=='u':</line-35>
<line-36> i-=1</line-36>
<line-37> return cost</line-37>
<line-38></line-38>
<line-39></line-39>
<line-40>ma=-10**9</line-40>
<line-41>p1=[]</line-41>
<line-42>p2=[]</line-42>
<line-43>for i in range(-1000,1001):</line-43>
<line-44> c=[]</line-44>
<line-45> corda=[]</line-45>
<line-46> cordb=[]</line-46>
<line-47> for j in range(n):</line-47>
<line-48> c.append(b[j]+i)</line-48>
<line-49> p=lcsfn(a,c,corda,cordb)</line-49>
<line-50> if ma<p:</line-50>
<line-51> ma=p</line-51>
<line-52> p1=copy.deepcopy(corda)</line-52>
<line-53> p1=p1[::-1]</line-53>
<line-54> p2=copy.deepcopy(cordb)</line-54>
<line-55> p2=p2[::-1]</line-55>
<line-56>print(ma)</line-56>
<line-58>print(*p2)</line-58>
<line-59></line-59>
|
{"code": "<line-2>n=int(input())</line-2>\n<line-57>print(*p1)</line-57>", "lines": [2, 57]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3> g=input()</line-3>
<line-4> h=g[::-1]</line-4>
<line-5> if h==g :</line-5>
<line-6> print(1)</line-6>
<line-8> print(2)</line-8>
<line-9> </line-9>
|
{"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-7> else:</line-7>", "lines": [2, 7]}
#### 0
|
<line-1>import math</line-1>
<line-3> l.sort()</line-3>
<line-4> x = l[0] * l[-1]</line-4>
<line-5> vec = []</line-5>
<line-6> i = 2</line-6>
<line-7> while (i*i)<=x:</line-7>
<line-8> if x%i==0:</line-8>
<line-9> vec.append(i)</line-9>
<line-10> if x//i !=i:</line-10>
<line-11> vec.append(x//i)</line-11>
<line-12> i = i + 1</line-12>
<line-13> vec.sort() </line-13>
<line-14> if len(vec)!=n:</line-14>
<line-15> return -1</line-15>
<line-16> else:</line-16>
<line-17> j = 0</line-17>
<line-18> for it in range(n):</line-18>
<line-19> if(l[j] != vec[it]):</line-19>
<line-20> return -1</line-20>
<line-21> else:</line-21>
<line-22> j += 1</line-22>
<line-23> return x</line-23>
<line-24>def __starting_point():</line-24>
<line-25> t = int(input())</line-25>
<line-26> while t:</line-26>
<line-27> n = int(input())</line-27>
<line-28> arr = list(map(int,input().split()))</line-28>
<line-29> n = len(arr)</line-29>
<line-30> print(findnumber(arr,n))</line-30>
<line-31> print()</line-31>
<line-33>__starting_point()</line-33>
|
{"code": "<line-2>def findnumber(l,n):</line-2>\n<line-32> t=t-1</line-32>", "lines": [2, 32]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3> i = 2</line-3>
<line-4> factors =set()</line-4>
<line-5> while i * i <= n:</line-5>
<line-6> if n % i:</line-6>
<line-7> i += 1</line-7>
<line-8> else:</line-8>
<line-9> n //= i</line-9>
<line-10> factors.add(i)</line-10>
<line-11> if n > 1:</line-11>
<line-12> factors.add(n)</line-12>
<line-13> return factors</line-13>
<line-14>for _ in range(int(input())):</line-14>
<line-15> n=int(input())</line-15>
<line-16> a=list(map(int,input().split()))</line-16>
<line-17> ans=0</line-17>
<line-18> s=[]</line-18>
<line-19> for i in range(n):</line-19>
<line-20> s.append(sum(prime_factors(a[i])))</line-20>
<line-21> for i in range(n):</line-21>
<line-22> for j in range(n):</line-22>
<line-23> if i!=j and a[j]%a[i]==0 and s[j]%s[i]==0:</line-23>
<line-25> print(ans)</line-25>
|
{"code": "<line-2>def prime_factors(n):</line-2>\n<line-24> ans=ans+1</line-24>", "lines": [2, 24]}
#### 0
|
<line-1>import math</line-1>
<line-2></line-2>
<line-4>dp.append(0)</line-4>
<line-5>for i in range(1,1000005):</line-5>
<line-6> dp.append(math.log(i) + dp[i-1])</line-6>
<line-7></line-7>
<line-8>t = int(input())</line-8>
<line-9>for i in range(t):</line-9>
<line-10> n,m,p,k = input().split()</line-10>
<line-11> n = int(n)</line-11>
<line-12> m = int(m)</line-12>
<line-13> p = int(p)</line-13>
<line-14> k = int(k)</line-14>
<line-15></line-15>
<line-16> if p==0 or (n%2==0 and m%2==0):</line-16>
<line-17> ans = 1.0</line-17>
<line-18> print(ans)</line-18>
<line-19> elif n%2==1 and m%2==1:</line-19>
<line-20> ans=0.0</line-20>
<line-21> print(ans*100)</line-21>
<line-22> else:</line-22>
<line-23> P = 0</line-23>
<line-24> kln2 = k*math.log(2)</line-24>
<line-25> for i in range(p, k+1):</line-25>
<line-26> lnPi = dp[k] - dp[i] - dp[k-i] - kln2</line-26>
<line-27> Pi = pow(math.e, lnPi)</line-27>
<line-29> print(P)</line-29>
<line-30></line-30>
|
{"code": "<line-3>dp = []</line-3>\n<line-28>\t\t\tP += Pi</line-28>", "lines": [3, 28]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>for i in range(t):</line-3>
<line-4> n=int(input())</line-4>
<line-6> print(min(a))</line-6>
|
{"code": "<line-2>t=int(input())</line-2>\n<line-5> a=list(map(int,input().split()))</line-5>", "lines": [2, 5]}
#### 0
|
<line-1>for _ in range(int(input())):</line-1>
<line-3> a = list(map(int, input().split()))</line-3>
<line-4> b = list(map(int, input().split()))</line-4>
<line-5></line-5>
<line-6> a = [-1] + a[::-1]</line-6>
<line-7> mx = a.index(max(a))</line-7>
<line-8> dp = [0] * (n + 1)</line-8>
<line-9> for i in range(1, n + 1):</line-9>
<line-10> for x in b:</line-10>
<line-11> if i - x < 0: continue</line-11>
<line-12> if i - x < mx <= i:</line-12>
<line-13> dp[i] = 1</line-13>
<line-14> else:</line-14>
<line-16></line-16>
<line-17> print('Chef' if dp[-1] else 'Garry')</line-17>
|
{"code": "<line-2> n, k = map(int, input().split())</line-2>\n<line-15> dp[i] |= not dp[i - x]</line-15>", "lines": [2, 15]}
#### 0
|
<line-2>for _ in range(int(input())):</line-2>
<line-3> a=int(input())</line-3>
<line-4> print(a/2+2)</line-4>
|
{"code": "<line-1># cook your dish here</line-1>", "lines": [1]}
#### 0
|
<line-1>for i in range(int(input())):</line-1>
<line-3> m=[]</line-3>
<line-4> for j in range(n):</line-4>
<line-5> l=list(input())</line-5>
<line-6> m.append(l)</line-6>
<line-7> a=0</line-7>
<line-8> for k in range(k):</line-8>
<line-9> b=0</line-9>
<line-10> for p in range(n):</line-10>
<line-11> if m[p][k]=='1':</line-11>
<line-12> b+=1</line-12>
<line-13> if b>1:</line-13>
<line-15> print(a)</line-15>
|
{"code": "<line-2> n,k=map(int,input().split())</line-2>\n<line-14> a+=((b*(b-1))//2)</line-14>", "lines": [2, 14]}
#### 0
|
<line-1>for _ in range(int(input())):</line-1>
<line-3> arr=list(map(int,input().split()))</line-3>
<line-4> dp=[0]*num</line-4>
<line-5> dp[0]=1</line-5>
<line-6> ans=1</line-6>
<line-7> j=0</line-7>
<line-8> for i in range(1,num):</line-8>
<line-9> j=i+1</line-9>
<line-10> count=1</line-10>
<line-11> dp[i]=dp[i-1]%1000000007</line-11>
<line-12> if i-2>=0 and arr[i-2]==2:</line-12>
<line-13> dp[i]+=dp[i-2]%1000000007</line-13>
<line-14> if i-3>=0 and arr[i-3]==2:</line-14>
<line-15> dp[i]+=dp[i-3]</line-15>
<line-16> ans+=dp[i]%1000000007</line-16>
<line-17> if arr[i-1]==2 and i<num-1:</line-17>
<line-18> if i>=j or j==0:</line-18>
<line-19> j=i+1</line-19>
<line-20> while j<num and arr[j]==2:</line-20>
<line-21> j+=1</line-21>
<line-22> count=j-i</line-22>
<line-23> while j<len(arr) and arr[j]==2:</line-23>
<line-24> j+=1</line-24>
<line-25> count+=1</line-25>
<line-26> if j==num:</line-26>
<line-27> ans+=dp[i-1]*(count-1)%1000000007</line-27>
<line-28> elif count%2!=0:</line-28>
<line-29> if j<num-1 and arr[j+1]==2:</line-29>
<line-30> ans+=dp[i-1]*(count+1)%1000000007</line-30>
<line-31> else:</line-31>
<line-32> ans+=dp[i-1]*(count)%1000000007</line-32>
<line-33> elif count%2==0:</line-33>
<line-35> print(ans%1000000007)</line-35>
<line-36></line-36>
<line-37></line-37>
|
{"code": "<line-2>\tnum=int(input())</line-2>\n<line-34>\t\t\t\tans+=dp[i-1]*(count-1)%1000000007</line-34>", "lines": [2, 34]}
#### 0
|
<line-1>t= int(input())</line-1>
<line-3> n = int(input())</line-3>
<line-4> ar = []</line-4>
<line-5> y = []</line-5>
<line-6> for i in range(n):</line-6>
<line-7> ar.append( list(map(int,input().split())) )</line-7>
<line-8> y.append(ar[-1][1])</line-8>
<line-9> ar[-1].append(i)</line-9>
<line-10> </line-10>
<line-11> y.sort()</line-11>
<line-12> mny = y[0]</line-12>
<line-13> mxy = y[-1]</line-13>
<line-14> ar.sort()</line-14>
<line-15> ssx,ssy,ssi = ar[0]</line-15>
<line-16> bbx,bby,bbi = ar[-1]</line-16>
<line-17> </line-17>
<line-18> sbx,sby,sbi = ar[0]</line-18>
<line-19> bsx,bsy,bsi = ar[-1]</line-19>
<line-20> </line-20>
<line-21> for i in range(len(ar)):</line-21>
<line-22> if ar[i][0]>ssx:</line-22>
<line-23> sbx,sby,sbi = ar[i-1]</line-23>
<line-24> break</line-24>
<line-25> </line-25>
<line-26> for i in range(len(ar)-1,-1,-1):</line-26>
<line-27> if ar[i][0]<bsx:</line-27>
<line-28> bsx,bsy,bsi = ar[i+1]</line-28>
<line-29> break </line-29>
<line-30> </line-30>
<line-31> if (ssy <=mny):</line-31>
<line-32> print(1)</line-32>
<line-33> print(ssi+1,'NE')</line-33>
<line-34> continue</line-34>
<line-35> if (sby>=mxy):</line-35>
<line-36> print(1)</line-36>
<line-37> print(sbi+1,'SE')</line-37>
<line-38> continue</line-38>
<line-39> if (bsy <=mny):</line-39>
<line-40> print(1)</line-40>
<line-41> print(bsi+1,'NW')</line-41>
<line-42> continue</line-42>
<line-43> if (bby>=mxy):</line-43>
<line-44> print(1)</line-44>
<line-45> print(bbi+1,'SW')</line-45>
<line-46> continue </line-46>
<line-47> </line-47>
<line-48> print(2)</line-48>
<line-49> if(ssy<bby):</line-49>
<line-50> print(ssi+1,'NE')</line-50>
<line-51> print(bbi+1,'SW')</line-51>
<line-52> else:</line-52>
<line-54> print(bbi+1,'NW')</line-54>
<line-55> </line-55>
|
{"code": "<line-2>for _ in range(t):</line-2>\n<line-53> print(ssi+1,'SE')</line-53>", "lines": [2, 53]}
#### 0
|
<line-1># from math import log2</line-1>
<line-3># for i in range(1,N):</line-3>
<line-4># # print(i)</line-4>
<line-5># for m in range(i):</line-5>
<line-6># if( (m^(m+1))==i ):</line-6>
<line-7># print(i)</line-7>
<line-8># print(m,m+1,bin(m)[2:])</line-8>
<line-9># print()</line-9>
<line-10># break</line-10>
<line-11># # else:</line-11>
<line-12># # print(-1)</line-12>
<line-13># # print()</line-13>
<line-14>T = int(input())</line-14>
<line-15>ans = []</line-15>
<line-16></line-16>
<line-17>for _ in range(T):</line-17>
<line-18> N = int(input())</line-18>
<line-19></line-19>
<line-20> # x = log2(N+1)</line-20>
<line-21> if(N==1):</line-21>
<line-22> ans.append(2)</line-22>
<line-23> elif('0' not in bin(N)[2:]):</line-23>
<line-24> ans.append(N//2)</line-24>
<line-25> else:</line-25>
<line-26> ans.append(-1)</line-26>
<line-27></line-27>
<line-29> print(i)</line-29>
|
{"code": "<line-2># N = 10000</line-2>\n<line-28>for i in ans:</line-28>", "lines": [2, 28]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-2> </line-2>
<line-4> n=int(input())</line-4>
<line-5> arr=list(map(int,input().split()))</line-5>
<line-6> d={}</line-6>
<line-7> s=set()</line-7>
<line-8> flag=0</line-8>
<line-9> for i in range(n):</line-9>
<line-10> if arr[i] in list(d.keys()):</line-10>
<line-11> d[arr[i]]+=1</line-11>
<line-12> else:</line-12>
<line-13> d[arr[i]]=1</line-13>
<line-14> curr_ele=arr[i]</line-14>
<line-15> if (curr_ele in s) and arr[i-1]!=arr[i]:</line-15>
<line-16> flag=1</line-16>
<line-17> break</line-17>
<line-18> else:</line-18>
<line-19> s.add(arr[i])</line-19>
<line-20> c=list(d.values())</line-20>
<line-21> if len(c)!=len(set(c)):</line-21>
<line-22> flag=1</line-22>
<line-23> if flag==1:</line-23>
<line-24> print("NO")</line-24>
<line-26> print("YES")</line-26>
<line-27> </line-27>
<line-28> </line-28>
<line-29> </line-29>
<line-30> </line-30>
|
{"code": "<line-3>for __ in range(int(input())):</line-3>\n<line-25> else:</line-25>", "lines": [3, 25]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>for _ in range(t):</line-5>
<line-6> a,d,k,n,inc = map(int, input().strip().split())</line-6>
<line-7></line-7>
<line-8> res = a</line-8>
<line-9> for i in range(1, n):</line-9>
<line-10> if i%k == 0:</line-10>
<line-11> d += inc</line-11>
<line-13></line-13>
<line-14> print(res)</line-14>
|
{"code": "<line-3>t = int(input())</line-3>\n<line-12>\t\tres += d</line-12>", "lines": [3, 12]}
#### 0
|
<line-1>x=eval(input())</line-1>
<line-3> ans=0</line-3>
<line-4> d=input()</line-4>
<line-5> a=0</line-5>
<line-6> cont=0</line-6>
<line-7> for i in range(0,len(d)):</line-7>
<line-8> a+=len(d)-i</line-8>
<line-9> if d[i]=='7':</line-9>
<line-10> ans+=1+cont</line-10>
<line-11> cont+=1</line-11>
<line-12> else:</line-12>
<line-13> cont=0</line-13>
<line-15> print(ans)</line-15>
|
{"code": "<line-2>for x in range(0,x):</line-2>\n<line-14>\tans=a-ans</line-14>", "lines": [2, 14]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3> n = int(input())</line-3>
<line-4> a = list(map(int,input().split()))</line-4>
<line-5> a.sort()</line-5>
<line-6> i=1</line-6>
<line-7> while(i<n):</line-7>
<line-8> a[i-1],a[i] = a[i],a[i-1]</line-8>
<line-10> print(*a)</line-10>
|
{"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-9> i+=2</line-9>", "lines": [2, 9]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3> N, M = [int(x) for x in input().split()]</line-3>
<line-4> edges = [0]*M</line-4>
<line-5> dir = {}</line-5>
<line-6> nodes = [[] for j in range(N+1)]</line-6>
<line-7> ind = [0]*(N+1)</line-7>
<line-8> graph = {}</line-8>
<line-9> final_edges = []</line-9>
<line-10> for i in range(M):</line-10>
<line-11> u, v = [int(x) for x in input().split()]</line-11>
<line-12> nodes[u].append(v)</line-12>
<line-13> nodes[v].append(u)</line-13>
<line-14> dir[(u,v)]=1</line-14>
<line-15> dir[(v,u)] = 0</line-15>
<line-16> ind[v] += 1</line-16>
<line-17> graph[(u,v)] = graph[(v,u)] = i</line-17>
<line-18> final_edges.append([u,v])</line-18>
<line-19> if M%2!=0:</line-19>
<line-20> print(-1)</line-20>
<line-21> continue</line-21>
<line-22> for i in range(M):</line-22>
<line-23> u, v = final_edges[i]</line-23>
<line-24> if ind[u]%2!=0 and ind[v]%2!=0:</line-24>
<line-25> d = dir[(u,v)]</line-25>
<line-26> if d:</line-26>
<line-27> ind[u] += 1</line-27>
<line-28> ind[v] -= 1</line-28>
<line-29> dir[(u,v)] = 0</line-29>
<line-30> dir[(v,u)] = 1</line-30>
<line-31> edges[i] = abs(edges[i]-1)</line-31>
<line-32> else:</line-32>
<line-33> ind[u] -= 1</line-33>
<line-34> ind[v] += 1</line-34>
<line-35> dir[(u, v)] = 1</line-35>
<line-36> dir[(v, u)] = 0</line-36>
<line-37> edges[i] = abs(edges[i]-1)</line-37>
<line-38> s = []</line-38>
<line-39> for i in range(1, N+1):</line-39>
<line-40> if ind[i]%2:</line-40>
<line-41> s.append(i)</line-41>
<line-42> while s:</line-42>
<line-43> set1 = set()</line-43>
<line-44> for u in s:</line-44>
<line-45> if ind[u]%2:</line-45>
<line-46> v = nodes[u][0]</line-46>
<line-47> d = dir[(u,v)]</line-47>
<line-48> index = graph[(u, v)]</line-48>
<line-49> set1.add(v)</line-49>
<line-50> if d:</line-50>
<line-51> ind[u] += 1</line-51>
<line-52> ind[v] -= 1</line-52>
<line-53> dir[(u, v)] = 1</line-53>
<line-54> dir[(v, u)] = 1</line-54>
<line-55> edges[index] = abs(edges[index]-1)</line-55>
<line-56> else:</line-56>
<line-57> ind[u] -= 1</line-57>
<line-58> ind[v] += 1</line-58>
<line-59> dir[(u, v)] = 1</line-59>
<line-60> dir[(v, u)] = 0</line-60>
<line-61> edges[index] = abs(edges[index]-1)</line-61>
<line-62></line-62>
<line-64> print(*edges)</line-64>
|
{"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-63> s = set1</line-63>", "lines": [2, 63]}
#### 0
|
<line-1>#read input</line-1>
<line-3>caselist = []</line-3>
<line-4>for i in range(0, cases):</line-4>
<line-5> caselist.append(input())</line-5>
<line-6></line-6>
<line-7>#iterate each case</line-7>
<line-8>for j in range(0, cases):</line-8>
<line-9></line-9>
<line-10> #current case's parameters:</line-10>
<line-11> current_input = caselist[j].split(' ')</line-11>
<line-12> bots = int(current_input[0])</line-12>
<line-13> switch = int(current_input[1])</line-13>
<line-14></line-14>
<line-15> #generate botlist and cakelist</line-15>
<line-16> botlist = list(range(switch, bots)) + list(range(0, switch))</line-16>
<line-17> cakelist = [False] * bots</line-17>
<line-18></line-18>
<line-19></line-19>
<line-20> counter = 0</line-20>
<line-21> index = 0</line-21>
<line-22> for i in range(0,bots):</line-22>
<line-23> if cakelist[index] == False:</line-23>
<line-24> cakelist[index] = True</line-24>
<line-25> counter += 1</line-25>
<line-26> index = botlist[index]</line-26>
<line-27> else:</line-27>
<line-28> break</line-28>
<line-29></line-29>
<line-30> if counter == bots:</line-30>
<line-31> print("Yes")</line-31>
<line-33> print("No", counter)</line-33>
<line-34> </line-34>
<line-35></line-35>
<line-36> </line-36>
|
{"code": "<line-2>cases = int(input())</line-2>\n<line-32> else:</line-32>", "lines": [2, 32]}
#### 0
|
<line-1>n, q, k = map(int, input().split())</line-1>
<line-3>query = list(input())</line-3>
<line-4>q_ = len(query)</line-4>
<line-5>c1 = query.count('?')</line-5>
<line-6>c = arr.count(0)</line-6>
<line-7>if c == n:</line-7>
<line-8> for i in range(c1):</line-8>
<line-9> print(0)</line-9>
<line-10>else:</line-10>
<line-11> for i in range(q_):</line-11>
<line-12> if (i!=0) and (query[i] == '?' and query[i-1] == '?'):</line-12>
<line-13> print(max_c)</line-13>
<line-14> elif query[i] == '?':</line-14>
<line-15> max_c = cnt = 0</line-15>
<line-16> for j in range(n):</line-16>
<line-17> if (j != n - 1) and (arr[j] == 1 and arr[j + 1] == 1):</line-17>
<line-18> cnt += 1</line-18>
<line-19> else:</line-19>
<line-20> max_c = max(max_c, cnt + 1)</line-20>
<line-21> cnt = 0</line-21>
<line-22> if k < max_c:</line-22>
<line-23> max_c = k</line-23>
<line-24> break</line-24>
<line-25> print(max_c)</line-25>
<line-26> elif query[i] == '!':</line-26>
<line-27> temp = arr[n - 1]</line-27>
<line-29> arr.insert(0, temp)</line-29>
|
{"code": "<line-2>arr = list(map(int, input().split()))</line-2>\n<line-28> del arr[n - 1]</line-28>", "lines": [2, 28]}
#### 0
|
<line-1>import numpy as np</line-1>
<line-2></line-2>
<line-4>t=eval(input())</line-4>
<line-5>inp = ()</line-5>
<line-6></line-6>
<line-7>t1=ord('z')</line-7>
<line-8>#bag=[[0 for _ in xrange(t1)] for _ in xrange(N+1)]</line-8>
<line-9>bag=np.zeros((N+1,t1),dtype=np.int)</line-9>
<line-10>#print bag</line-10>
<line-11>while t:</line-11>
<line-12> t-=1</line-12>
<line-13> inp=input().split()</line-13>
<line-14> t2=ord(inp[3]) - ord('a')</line-14>
<line-15> t3=int(inp[1])</line-15>
<line-16> t4=int(inp[2]) + 1</line-16>
<line-17> if inp[0]=="1":</line-17>
<line-18> #print "enter"</line-18>
<line-19> bag[t3][t2]+=int(inp[2])</line-19>
<line-20></line-20>
<line-21></line-21>
<line-22> if inp[0]=="2":</line-22>
<line-23> sum=0</line-23>
<line-24> for i in range(t3,t4):</line-24>
<line-25> sum+=bag[i][t2]</line-25>
<line-26> print(sum)</line-26>
<line-27></line-27>
<line-28>#</line-28>
<line-29># for j in range(ord('z')-ord('a')):</line-29>
<line-30># for i in range(N+1):</line-30>
<line-32># print bag[i][j] ,i,j</line-32>
<line-33></line-33>
<line-34></line-34>
<line-35></line-35>
|
{"code": "<line-3>N=10**6+1</line-3>\n<line-31># if bag[i][j]!=0:</line-31>", "lines": [3, 31]}
#### 0
|
<line-1>n=eval(input())</line-1>
<line-3>m=eval(input())</line-3>
<line-4>for df in range(m):</line-4>
<line-5> x,y=list(map(int,input().split()))</line-5>
<line-6> arr=[]</line-6>
<line-7> arr=grades[x-1:y]</line-7>
<line-8> arr.sort()</line-8>
<line-9> sum=0</line-9>
<line-10> #arr.append(1000000)</line-10>
<line-11> for nh in range(0,len(arr)-1,1):</line-11>
<line-12> sum=sum+(arr[nh+1]-arr[nh])**2</line-12>
<line-14> print(sum)</line-14>
|
{"code": "<line-2>grades=list(map(int,input().split()))</line-2>\n<line-13> #print sum,len(arr),nh+1,nh</line-13>", "lines": [2, 13]}
#### 0
|
<line-1>import math</line-1>
<line-3> summation_N = (x*(x+1))//2</line-3>
<line-4> initial = x</line-4>
<line-5> power = 0</line-5>
<line-6> sum_A = 0</line-6>
<line-7> while x>=1:</line-7>
<line-8> count = (x+1)//2</line-8>
<line-9> sum_A += count * 2**power</line-9>
<line-10> x = x - count</line-10>
<line-11> power += 1</line-11>
<line-12> sum_B = summation_N - sum_A</line-12>
<line-13> ans = sum_B - (int(math.log(initial,2))+1)</line-13>
<line-14> return ans</line-14>
<line-15> </line-15>
<line-16>for _ in range(int(input())):</line-16>
<line-17> l,r = list(map(int,input().split()))</line-17>
<line-18> if l==1:</line-18>
<line-19> print(GLR(r))</line-19>
<line-21> print((GLR(r) - GLR(l-1)))# cook your dish here</line-21>
|
{"code": "<line-2>def GLR(x):</line-2>\n<line-20> else:</line-20>", "lines": [2, 20]}
#### 0
|
<line-1>#Note that it's python3 Code. Here, we are using input() instead of raw_input().</line-1>
<line-3></line-3>
<line-4>(n, k) = list(map(int, input().split(' ')))</line-4>
<line-5></line-5>
<line-6>ans = 0</line-6>
<line-7></line-7>
<line-8>for i in range(n):</line-8>
<line-9> x = int(input())</line-9>
<line-10> if x % k == 0:</line-10>
<line-12></line-12>
<line-13>print(ans) </line-13>
|
{"code": "<line-2>#You can check on your local machine the version of python by typing \"python --version\" in the terminal.</line-2>\n<line-11>\t\tans += 1</line-11>", "lines": [2, 11]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>for i in range(t):</line-3>
<line-4> a=0</line-4>
<line-5> n=int(input())</line-5>
<line-6> while(n>0):</line-6>
<line-7> a += n*n</line-7>
<line-9> print(a)</line-9>
|
{"code": "<line-2>t=int(input())</line-2>\n<line-8> n=n-2</line-8>", "lines": [2, 8]}
#### 0
|
<line-1>import math</line-1>
<line-2></line-2>
<line-3></line-3>
<line-5>hyp = math.sqrt(1+m*m)</line-5>
<line-6>cosx = 1/hyp</line-6>
<line-7>sinx = m/hyp</line-7>
<line-8></line-8>
<line-9>pts = [[], []]</line-9>
<line-10>for i in range(n):</line-10>
<line-11> p = input().split()</line-11>
<line-12> px = int(p[0])</line-12>
<line-13> py = int(p[1])</line-13>
<line-14> pts[0].append(cosx*px+sinx*py)</line-14>
<line-15> pts[1].append(cosx*py-sinx*px)</line-15>
<line-16></line-16>
<line-17>w = max(pts[0])-min(pts[0])</line-17>
<line-19></line-19>
<line-20>print(2*l+2*w)</line-20>
|
{"code": "<line-4>n,m = map(int, input().split())</line-4>\n<line-18>l = max(pts[1])-min(pts[1])</line-18>", "lines": [4, 18]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-2></line-2>
<line-4>s=[int(k) for k in input().split()]</line-4>
<line-5>x=l[1]*l[0]</line-5>
<line-6>for i in range(l[0]):</line-6>
<line-7> if(s[i]==1):</line-7>
<line-8> x+=l[2]</line-8>
<line-9> elif(s[i]==2):</line-9>
<line-10> x+=(l[2]*98/100)</line-10>
<line-11> elif(s[i]==3):</line-11>
<line-12> x+=(l[2]*96/100)</line-12>
<line-13> elif(s[i]==4):</line-13>
<line-14> x+=(l[2]*94/100)</line-14>
<line-15> elif(s[i]==5):</line-15>
<line-16> x+=(l[2]*92/100)</line-16>
<line-17> elif(s[i]==6):</line-17>
<line-18> x+=(l[2]*90/100)</line-18>
<line-19>if(x>=300):</line-19>
<line-20> print("YES")</line-20>
<line-22> print("NO")</line-22>
|
{"code": "<line-3>l=[int(k) for k in input().split()]</line-3>\n<line-21>else:</line-21>", "lines": [3, 21]}
#### 0
|
<line-1>from sys import stdin</line-1>
<line-3></line-3>
<line-4>input = stdin.readline</line-4>
<line-5></line-5>
<line-6>for _ in range(int(input())):</line-6>
<line-7> a, b, n = list(map(int, input().split()))</line-7>
<line-8> ab = Fraction(a, b)</line-8>
<line-9></line-9>
<line-10> p = set()</line-10>
<line-11></line-11>
<line-12> for i in range(1, n+1):</line-12>
<line-13> for j in range(n, 0, -1):</line-13>
<line-14> x = Fraction(i, j)</line-14>
<line-15></line-15>
<line-16> if x > ab:</line-16>
<line-17> break</line-17>
<line-18></line-18>
<line-19> p.add(x)</line-19>
<line-20></line-20>
<line-22></line-22>
<line-23> print(x.numerator, x.denominator)</line-23>
|
{"code": "<line-2>from fractions import Fraction</line-2>\n<line-21> x = sorted(p)[-2]</line-21>", "lines": [2, 21]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3> t=int(input()) </line-3>
<line-4> for i in range(t):</line-4>
<line-5> n=input() </line-5>
<line-6> n=n.lower()</line-6>
<line-7> a="berhampore"</line-7>
<line-8> b="serampore"</line-8>
<line-9> if a in n:</line-9>
<line-10> if b in n:</line-10>
<line-11> print("Both")</line-11>
<line-12> else:</line-12>
<line-13> print("GCETTB")</line-13>
<line-14> elif b in n:</line-14>
<line-15> if a in n:</line-15>
<line-16> print("Both")</line-16>
<line-17> else:</line-17>
<line-18> print("GCETTS")</line-18>
<line-19> else:</line-19>
<line-20> print("Others")</line-20>
<line-22> pass</line-22>
|
{"code": "<line-2>try:</line-2>\n<line-21>except Exception as e:</line-21>", "lines": [2, 21]}
#### 0
|
<line-1>def ugcd(n):</line-1>
<line-3> if(n==1):</line-3>
<line-4> return ans</line-4>
<line-5> elif(n%2==1):</line-5>
<line-6> ans = [[1, 2, n]]</line-6>
<line-7> else:</line-7>
<line-8> ans = [[1, 2]]</line-8>
<line-9> for k in range(1, int(n//2)):</line-9>
<line-10> ans.append([k*2+1, k*2+2])</line-10>
<line-11> return ans</line-11>
<line-12>t = int(input())</line-12>
<line-13>for i in range(t):</line-13>
<line-14> n = int(input())</line-14>
<line-15> s = (ugcd(n))</line-15>
<line-16> print(len(s))</line-16>
<line-17> for j in range(len(s)):</line-17>
<line-19> print(*s[j])</line-19>
|
{"code": "<line-2> ans = [[1]]</line-2>\n<line-18> print(len(s[j]), end=\" \")</line-18>", "lines": [2, 18]}
#### 0
|
<line-1>t=int(input())</line-1>
<line-3>li2=[31,28,31,30,31,30,31,31,30,31,30,31]</line-3>
<line-4>for z in range(t):</line-4>
<line-5> y,m,d=list(map(int,input().split(':')))</line-5>
<line-6> if y%4 == 0:</line-6>
<line-7> if y%100 == 0:</line-7>
<line-8> if y%400 == 0:</line-8>
<line-9> li=li1</line-9>
<line-10> else:</line-10>
<line-11> li=li2</line-11>
<line-12> else:</line-12>
<line-13> li=li1</line-13>
<line-14> else:</line-14>
<line-15> li=li2</line-15>
<line-16> c=0</line-16>
<line-17> if d%2 == 0:</line-17>
<line-18> while d%2 == 0:</line-18>
<line-19> c+=1</line-19>
<line-20> d+=2</line-20>
<line-21> if d>li[m-1]:</line-21>
<line-22> d=d%li[m-1]</line-22>
<line-23> m+=1</line-23>
<line-24> else: </line-24>
<line-25> while d%2 != 0:</line-25>
<line-26> c+=1</line-26>
<line-27> d+=2</line-27>
<line-28> if d>li[m-1]:</line-28>
<line-29> d=d%li[m-1]</line-29>
<line-31> print(c)</line-31>
<line-32> </line-32>
|
{"code": "<line-2>li1=[31,29,31,30,31,30,31,31,30,31,30,31]</line-2>\n<line-30> m+=1</line-30>", "lines": [2, 30]}
#### 0
|
<line-1>import sys</line-1>
<line-2></line-2>
<line-4> res = 1</line-4>
<line-5> xx=x</line-5>
<line-6> while n:</line-6>
<line-7> if n&1:</line-7>
<line-8> res = (res*xx)%m</line-8>
<line-9> xx=xx*xx%m</line-9>
<line-10> n >>= 1</line-10>
<line-11> return res</line-11>
<line-12></line-12>
<line-13>def circles(u):</line-13>
<line-14> r = 0</line-14>
<line-15> S = [(u,-1,0)]</line-15>
<line-16> Visited[u] = 0</line-16>
<line-17> for s in S:</line-17>
<line-18> for e in V[s[0]]:</line-18>
<line-19> if e[0] != s[1]:</line-19>
<line-20> if Visited[e[0]]==-1: </line-20>
<line-21> Visited[e[0]] = s[2]^e[1]</line-21>
<line-22> S.append((e[0], s[0], s[2]^e[1])) </line-22>
<line-23> elif Visited[e[0]] != s[2]^e[1]:</line-23>
<line-24> return -1</line-24>
<line-25> else:</line-25>
<line-26> r += s[0]<e[0]</line-26>
<line-27> return r</line-27>
<line-28></line-28>
<line-29>T = int(sys.stdin.readline())</line-29>
<line-30>for _ in range(T):</line-30>
<line-31> is_bad = False</line-31>
<line-32> empty = 0</line-32>
<line-33> n,Q = list(map(int, sys.stdin.readline().split()))</line-33>
<line-34> for _ in range(n-1):</line-34>
<line-35> sys.stdin.readline() </line-35>
<line-36> paths = []</line-36>
<line-37> V=list(map(list,[[]]*n))</line-37>
<line-38> for q in range(Q):</line-38>
<line-39> u,v,x = list(map(int, sys.stdin.readline().split()))</line-39>
<line-40> u-=1</line-40>
<line-41> v-=1</line-41>
<line-42> if (v,x^1) in V[u]:</line-42>
<line-43> is_bad = True</line-43>
<line-44> elif (v,x) in V[u]:</line-44>
<line-45> empty += 1</line-45>
<line-46> elif u!=v:</line-46>
<line-47> V[u].append((v,x))</line-47>
<line-48> V[v].append((u,x))</line-48>
<line-49> elif x==1:</line-49>
<line-50> is_bad = True</line-50>
<line-51> else:</line-51>
<line-52> empty += 1</line-52>
<line-53> paths.append((u,v,x))</line-53>
<line-54> if is_bad:</line-54>
<line-55> print(0)</line-55>
<line-56> elif n<=1:</line-56>
<line-57> print(1)</line-57>
<line-58> else:</line-58>
<line-59> Visited = [-1]*n</line-59>
<line-60> components = 0</line-60>
<line-61> for i in range(n):</line-61>
<line-62> if Visited[i]==-1:</line-62>
<line-63> components += 1</line-63>
<line-64> c = circles(i)</line-64>
<line-65> if c==-1:</line-65>
<line-66> is_bad = True</line-66>
<line-67> break</line-67>
<line-68> empty += c</line-68>
<line-69> if is_bad:</line-69>
<line-70> print(0)</line-70>
<line-72> print(powc(2,n-1-(Q-empty),10**9+7)) </line-72>
|
{"code": "<line-3>def powc(x,n,m):</line-3>\n<line-71> else:</line-71>", "lines": [3, 71]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>ls=[int(i) for i in input().split()]</line-3>
<line-4>cur=0</line-4>
<line-5>s=[0]</line-5>
<line-6>for i in ls:</line-6>
<line-7> cur=cur^i</line-7>
<line-8> s.append(cur)</line-8>
<line-9>for i in range(q):</line-9>
<line-11> print(s[k%(n+1)])</line-11>
|
{"code": "<line-2>n,q=map(int,input().split())</line-2>\n<line-10> k=int(input())</line-10>", "lines": [2, 10]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3> a = []</line-3>
<line-4> m = 1000000001</line-4>
<line-5> for i in range (len(l)):</line-5>
<line-6> k=int(l[i][1])</line-6>
<line-7> if (l[i][0]=='<' and l[i][2]=='Yes'):</line-7>
<line-8> a.append((1,1))</line-8>
<line-9> a.append((k,-1))</line-9>
<line-10> </line-10>
<line-11> if (l[i][0]=='<' and l[i][2]=='No'):</line-11>
<line-12> a.append((k,1))</line-12>
<line-13> a.append((m,-1))</line-13>
<line-14> </line-14>
<line-15> if (l[i][0]=='=' and l[i][2]=='Yes'):</line-15>
<line-16> a.append((k,1))</line-16>
<line-17> a.append((k+1,-1))</line-17>
<line-18></line-18>
<line-19> if (l[i][0]=='=' and l[i][2]=='No'):</line-19>
<line-20> a.append((1,1))</line-20>
<line-21> a.append((k,-1))</line-21>
<line-22> a.append((k+1,1))</line-22>
<line-23> a.append((m,-1))</line-23>
<line-24></line-24>
<line-25> if (l[i][0]=='>' and l[i][2]=='Yes'):</line-25>
<line-26> a.append((k+1,1))</line-26>
<line-27> a.append((m,-1))</line-27>
<line-28></line-28>
<line-29> if (l[i][0]=='>' and l[i][2]=='No'):</line-29>
<line-30> a.append((1,1))</line-30>
<line-31> a.append((k+1,-1))</line-31>
<line-32></line-32>
<line-33> a.sort()</line-33>
<line-34> w=0</line-34>
<line-35> r=0</line-35>
<line-36></line-36>
<line-37> for i in range (len(a)):</line-37>
<line-38> w+=a[i][1]</line-38>
<line-39> r=max(w,r)</line-39>
<line-40></line-40>
<line-41> return len(l)-r</line-41>
<line-42> </line-42>
<line-43> </line-43>
<line-44>def __starting_point():</line-44>
<line-45></line-45>
<line-46> T = int(input())</line-46>
<line-47> answer = []</line-47>
<line-48></line-48>
<line-49> for _ in range (T):</line-49>
<line-50> e = int(input())</line-50>
<line-51> temp = []</line-51>
<line-52> for q_t in range (e):</line-52>
<line-53> q = list(map(str,input().rstrip().split()))</line-53>
<line-54> temp.append(q)</line-54>
<line-55> result = guessingGame(temp)</line-55>
<line-57>__starting_point()</line-57>
|
{"code": "<line-2>def guessingGame (l):</line-2>\n<line-56> print(result)</line-56>", "lines": [2, 56]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3> t=int(input())</line-3>
<line-4> for i in range(t):</line-4>
<line-5> s=input()</line-5>
<line-6> i=int(s,16)</line-6>
<line-7> print(i)</line-7>
<line-9> print(e)</line-9>
|
{"code": "<line-2>try:</line-2>\n<line-8>except EOFError as e:</line-8>", "lines": [2, 8]}
#### 0
|
<line-1>try:</line-1>
<line-3> for _ in range(tc):</line-3>
<line-4> n=int(input())</line-4>
<line-5> st=""</line-5>
<line-6> b=1</line-6>
<line-7> for i in range(1,n+1):</line-7>
<line-8> b+=1</line-8>
<line-9> a=b</line-9>
<line-10> for j in range(1,n+1):</line-10>
<line-11> print(a,end='')</line-11>
<line-12> a+=1</line-12>
<line-13> print() </line-13>
<line-15> pass</line-15>
|
{"code": "<line-2> tc=int(input())</line-2>\n<line-14>except:</line-14>", "lines": [2, 14]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3> s=input()</line-3>
<line-4> count=0</line-4>
<line-5> i=0</line-5>
<line-6> while i<len(s)-1:</line-6>
<line-7> ch=s[i]</line-7>
<line-8> j=i+1 </line-8>
<line-9> while j<len(s) and s[j]==ch:</line-9>
<line-10> j+=1 </line-10>
<line-11> l=j-i</line-11>
<line-12> if i!=0 and j!=len(s) and s[i-1]==s[j] :</line-12>
<line-13> count+=1</line-13>
<line-14> count+=l*(l-1)//2</line-14>
<line-15> #print(s[i:j],count)</line-15>
<line-17> print(count) </line-17>
|
{"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-16> i=j</line-16>", "lines": [2, 16]}
#### 0
|
<line-1>import sys</line-1>
<line-2></line-2>
<line-4> queue = [position]</line-4>
<line-5> lastedit = []</line-5>
<line-6> dist[position[0]][position[1]] = 0 </line-6>
<line-7> while queue!=[]:</line-7>
<line-8> point = queue[0]</line-8>
<line-9> i = point[0]</line-9>
<line-10> j = point[1]</line-10>
<line-11> #print 'point',i,j</line-11>
<line-12> if visit1[i][j]==False:</line-12>
<line-13> visit1[i][j] = True</line-13>
<line-14> startx = max(i-k,0)</line-14>
<line-15> endx = min(i+k,n-1)</line-15>
<line-16> for x in range(startx,endx+1):</line-16>
<line-17> starty = max(0,j+abs(x-i)-k)</line-17>
<line-18> endy = min(m-1,j-abs(x-i)+k)</line-18>
<line-19> for y in range(starty,endy+1):</line-19>
<line-20> if (a[x][y]==0 and visit1[x][y]==False):</line-20>
<line-21> if visit2[x][y]==True:</line-21>
<line-22> lastedit.append([x,y])</line-22>
<line-23> #print x,y,</line-23>
<line-24> if dist[x][y]>dist[i][j]+1:</line-24>
<line-25> dist[x][y]=dist[i][j]+1</line-25>
<line-26> queue.append([x,y])</line-26>
<line-27> #print queue,dist</line-27>
<line-28> queue = queue[1:]</line-28>
<line-29> #print</line-29>
<line-30> return lastedit</line-30>
<line-31></line-31>
<line-32>for t in range(int(input())):</line-32>
<line-33> n,m,k1,k2 = list(map(int,input().split()))</line-33>
<line-34> a = []</line-34>
<line-35> for i in range(n):</line-35>
<line-36> a.append(list(map(int,input().split())))</line-36>
<line-37> #print a</line-37>
<line-38> value = sys.maxsize</line-38>
<line-39> listing = []</line-39>
<line-40> visit1 = [[False for i in range(m)]for j in range(n)]</line-40>
<line-41> visit2 = [[False for i in range(m)]for j in range(n)]</line-41>
<line-42> dist1 = [[sys.maxsize for i in range(m)]for j in range(n)]</line-42>
<line-43> dist2 = [[sys.maxsize for i in range(m)]for j in range(n)]</line-43>
<line-44> if k1>=k2:</line-44>
<line-45> spaces(a,n,m,k1,visit1,visit2,dist1,[0,0])</line-45>
<line-46> else:</line-46>
<line-47> spaces(a,n,m,k2,visit1,visit2,dist1,[0,m-1])</line-47>
<line-48> listing = spaces(a,n,m,k1,visit2,visit1,dist2,[0,0])</line-48>
<line-49> if k1>k2:</line-49>
<line-50> listing = spaces(a,n,m,k2,visit2,visit1,dist2,[0,m-1])</line-50>
<line-51> #print visit1</line-51>
<line-52> #sprint visit2</line-52>
<line-53> if k1==k2:</line-53>
<line-54> if dist1[0][m-1]==sys.maxsize:</line-54>
<line-55> print('-1')</line-55>
<line-56> else:</line-56>
<line-57> print(int((dist1[0][m-1]+1)/2))</line-57>
<line-58> else:</line-58>
<line-59> d = len(listing)</line-59>
<line-60> for i in range(d-1,-1,-1):</line-60>
<line-61> x = listing[i][0]</line-61>
<line-62> y = listing[i][1]</line-62>
<line-63> if visit1[x][y]==True and dist2[x][y]<value:</line-63>
<line-64> value = dist2[x][y]</line-64>
<line-65> if value!=sys.maxsize:</line-65>
<line-66> print(value)</line-66>
<line-68> print('-1')</line-68>
<line-69></line-69>
<line-70></line-70>
<line-71></line-71>
<line-72></line-72>
<line-73> </line-73>
<line-74> </line-74>
|
{"code": "<line-3>def spaces(a,n,m,k,visit1,visit2,dist,position):</line-3>\n<line-67> else:</line-67>", "lines": [3, 67]}
#### 0
|
<line-1>n=int(input())</line-1>
<line-3>b=[]</line-3>
<line-4>for i in range(1,1000001):</line-4>
<line-5> s = str(i)</line-5>
<line-6> p=1</line-6>
<line-7> flag=0</line-7>
<line-8> for e in s:</line-8>
<line-9> if e=='1':</line-9>
<line-10> flag=1</line-10>
<line-11> p=p*int(e)</line-11>
<line-12> if p==n:</line-12>
<line-13> if flag!=1:</line-13>
<line-14> a.append(i)</line-14>
<line-15> else:</line-15>
<line-17>print(len(a),len(b))</line-17>
|
{"code": "<line-2>a=[]</line-2>\n<line-16> b.append(i)</line-16>", "lines": [2, 16]}
#### 0
|
<line-1>#!/usr/bin/python</line-1>
<line-3></line-3>
<line-4>def __starting_point():</line-4>
<line-5> t = int(input())</line-5>
<line-6> for iteration in range(t):</line-6>
<line-7> r,c,m_inp,k_inp,j_inp = input().strip().split(" ")</line-7>
<line-8> r=int(r)</line-8>
<line-9> c=int(c)</line-9>
<line-10> m_inp=int(m_inp)</line-10>
<line-11> k_inp=int(k_inp)</line-11>
<line-12> j_inp=int(j_inp)</line-12>
<line-13></line-13>
<line-14> ans = ""</line-14>
<line-15> if (r*c) != (m_inp+k_inp+j_inp):</line-15>
<line-16> print("No")</line-16>
<line-17> continue</line-17>
<line-18> else:</line-18>
<line-19> flag = False</line-19>
<line-20> for i in range(6):</line-20>
<line-21> if flag:</line-21>
<line-22> break</line-22>
<line-23> if i==0:</line-23>
<line-24> m = m_inp</line-24>
<line-25> k = k_inp</line-25>
<line-26> j = j_inp</line-26>
<line-27> elif i==1:</line-27>
<line-28> m = j_inp</line-28>
<line-29> k = m_inp</line-29>
<line-30> j = k_inp</line-30>
<line-31> elif i==2:</line-31>
<line-32> m = k_inp</line-32>
<line-33> k = j_inp</line-33>
<line-34> j = m_inp</line-34>
<line-35> elif i==3:</line-35>
<line-36> m = m_inp</line-36>
<line-37> k = j_inp</line-37>
<line-38> j = k_inp</line-38>
<line-39> elif i==4:</line-39>
<line-40> m = k_inp</line-40>
<line-41> k = m_inp</line-41>
<line-42> j = j_inp</line-42>
<line-43> elif i==5:</line-43>
<line-44> m = j_inp</line-44>
<line-45> k = k_inp</line-45>
<line-46> j = m_inp</line-46>
<line-47> if m%r == 0:</line-47>
<line-48> r_remain_1 = r</line-48>
<line-49> c_remain_1 = c-(m/r)</line-49>
<line-50> </line-50>
<line-51> if k%r_remain_1 == 0:</line-51>
<line-52> r_remain_2 = r_remain_1</line-52>
<line-53> c_remain_2 = c_remain_1 - (k/r_remain_1)</line-53>
<line-54> if r_remain_2*c_remain_2 == j:</line-54>
<line-55> print("Yes")</line-55>
<line-56> flag = True</line-56>
<line-57> continue</line-57>
<line-58> if k%c_remain_1 == 0:</line-58>
<line-59> c_remain_2 = c_remain_1</line-59>
<line-60> r_remain_2 = r_remain_1 - (k/c_remain_1)</line-60>
<line-61> if r_remain_2*c_remain_2 == j:</line-61>
<line-62> print("Yes")</line-62>
<line-63> flag = True</line-63>
<line-64> continue</line-64>
<line-65> </line-65>
<line-66> if j%r_remain_1 == 0:</line-66>
<line-67> r_remain_2 = r_remain_1</line-67>
<line-68> c_remain_2 = c_remain_1 - (j/r_remain_1)</line-68>
<line-69> if r_remain_2*c_remain_2 == k:</line-69>
<line-70> print("Yes")</line-70>
<line-71> flag = True</line-71>
<line-72> continue</line-72>
<line-73> if j%c_remain_1 == 0:</line-73>
<line-74> c_remain_2 = c_remain_1</line-74>
<line-75> r_remain_2 = r_remain_1 - (j/c_remain_1)</line-75>
<line-76> if r_remain_2*c_remain_2 == k:</line-76>
<line-77> print("Yes")</line-77>
<line-78> flag = True</line-78>
<line-79> continue</line-79>
<line-80> </line-80>
<line-81> if m%c == 0:</line-81>
<line-82> c_remain_1 = c</line-82>
<line-83> r_remain_1 = r-(m/c) </line-83>
<line-84></line-84>
<line-85> if k%r_remain_1 == 0:</line-85>
<line-86> r_remain_2 = r_remain_1</line-86>
<line-87> c_remain_2 = c_remain_1 - (k/r_remain_1)</line-87>
<line-88> if r_remain_2*c_remain_2 == j:</line-88>
<line-89> print("Yes")</line-89>
<line-90> flag = True</line-90>
<line-91> continue</line-91>
<line-92> if k%c_remain_1 == 0:</line-92>
<line-93> c_remain_2 = c_remain_1</line-93>
<line-94> r_remain_2 = r_remain_1 - (k/c_remain_1)</line-94>
<line-95> if r_remain_2*c_remain_2 == j:</line-95>
<line-96> print("Yes")</line-96>
<line-97> flag = True</line-97>
<line-98> continue</line-98>
<line-99> </line-99>
<line-100> if j%r_remain_1 == 0:</line-100>
<line-101> r_remain_2 = r_remain_1</line-101>
<line-102> c_remain_2 = c_remain_1 - (j/r_remain_1)</line-102>
<line-103> if r_remain_2*c_remain_2 == k:</line-103>
<line-104> print("Yes")</line-104>
<line-105> flag = True</line-105>
<line-106> continue</line-106>
<line-107> if j%c_remain_1 == 0:</line-107>
<line-108> c_remain_2 = c_remain_1</line-108>
<line-109> r_remain_2 = r_remain_1 - (j/c_remain_1)</line-109>
<line-110> if r_remain_2*c_remain_2 == k:</line-110>
<line-111> print("Yes")</line-111>
<line-112> flag = True</line-112>
<line-113> continue</line-113>
<line-114> if not flag:</line-114>
<line-116>__starting_point()</line-116>
|
{"code": "<line-2>import sys</line-2>\n<line-115> print(\"No\")</line-115>", "lines": [2, 115]}
#### 0
|
<line-1>T = int(input())</line-1>
<line-2></line-2>
<line-4> max = 0</line-4>
<line-5> ans = ''</line-5>
<line-6> for i in A:</line-6>
<line-7> if i.count(X) > max:</line-7>
<line-8> max = i.count(X)</line-8>
<line-9> ans = i</line-9>
<line-10> return ans</line-10>
<line-11></line-11>
<line-12></line-12>
<line-13></line-13>
<line-14>for i in range(T):</line-14>
<line-15> N = int(input())</line-15>
<line-16> A = list(map(str,input().split()))</line-16>
<line-18> print(call_me(N,A,X))</line-18>
|
{"code": "<line-3>def call_me(N,A,X):</line-3>\n<line-17> X = input()</line-17>", "lines": [3, 17]}
#### 0
|
<line-1>x = input().split(" ")</line-1>
<line-3>ans = ''</line-3>
<line-4>l = 1</line-4>
<line-5>for i in x:</line-5>
<line-6> if i!=y and sorted(i) == sorted(y):</line-6>
<line-7> ans = ans + (str)(l)</line-7>
<line-8> l=l+1</line-8>
<line-10>print("The antidote is found in",ans)</line-10>
|
{"code": "<line-2>y = input()</line-2>\n<line-9>ans+='.'</line-9>", "lines": [2, 9]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>from math import factorial</line-3>
<line-4>for _ in range(int(input())):</line-4>
<line-5> s=input()</line-5>
<line-6> c=Counter(s)</line-6>
<line-7> k=factorial(len(s))</line-7>
<line-8> for value in c.values():</line-8>
<line-9> if value>1:</line-9>
<line-11> print(k%(10**9+7))</line-11>
|
{"code": "<line-2>from collections import Counter</line-2>\n<line-10> k=k//factorial(value)</line-10>", "lines": [2, 10]}
#### 0
|
<line-1>for _1 in range(int(input())):</line-1>
<line-3> s=input().strip()</line-3>
<line-4> answer=s</line-4>
<line-5> for i in range(len(s)):</line-5>
<line-6> c=s[i]</line-6>
<line-7> string=s[:i]+s[i+1:]</line-7>
<line-8> for j in range(len(string)+1):</line-8>
<line-10> print(answer)</line-10>
|
{"code": "<line-2> n=int(input())</line-2>\n<line-9> answer=min(answer, string[:j]+c+string[j:])</line-9>", "lines": [2, 9]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>for _ in range(int(input())):</line-3>
<line-4> n,a,k,min_k,e = int(input()),[int(i) for i in input().split()],0,0,-1 </line-4>
<line-5> for j in range(n):</line-5>
<line-6> if(a[j] != -1):break </line-6>
<line-7> for i in range(j,n):</line-7>
<line-8> if min_k==0:min_k,e = a[i],a[i]+1 </line-8>
<line-9> else:</line-9>
<line-10> if min_k < a[i]:min_k = a[i] </line-10>
<line-11> if(a[i] == -1):pass</line-11>
<line-12> else:</line-12>
<line-13> if(a[i] == e):pass</line-13>
<line-14> else:</line-14>
<line-15> if( k == 0):k = e-a[i]</line-15>
<line-16> else:</line-16>
<line-17> new_k = e-a[i]</line-17>
<line-18> if(new_k < 0):k = -1</line-18>
<line-19> else:k = gcd(k,new_k)</line-19>
<line-20> if(k<min_k or k<0): k = -1; break</line-20>
<line-21> if k != 0 and a[i]!=-1: e = a[i]%k+1</line-21>
<line-22> else:e += 1 </line-22>
<line-23> if(k == -1):print("impossible")</line-23>
<line-25> else:print(k) </line-25>
|
{"code": "<line-2>from math import gcd</line-2>\n<line-24> elif k == 0 :print(\"inf\")</line-24>", "lines": [2, 24]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>for z in range(p):</line-3>
<line-4> n=int(input())</line-4>
<line-5> a=[]</line-5>
<line-6> for i in range(8):</line-6>
<line-7> a.append(0)</line-7>
<line-8> for i in range(n):</line-8>
<line-9> x,y=list(map(int,input().split()))</line-9>
<line-10> if x<=8 and y>a[x-1]:</line-10>
<line-12> print(sum(a))</line-12>
|
{"code": "<line-2>p=int(input())</line-2>\n<line-11> a[x-1]=y</line-11>", "lines": [2, 11]}
#### 0
|
<line-1>import math</line-1>
<line-3> return math.hypot(y - w, z - x)</line-3>
<line-4></line-4>
<line-5>t = int(input())</line-5>
<line-6>while (t>0):</line-6>
<line-7> t = t -1</line-7>
<line-8> n, m = list(map(int,input().split()))</line-8>
<line-9> a = []</line-9>
<line-10> for i in range(0,n):</line-10>
<line-11> x,y = list(map(int,input().split()))</line-11>
<line-12> a.append([x,y])</line-12>
<line-13> for j in range(0,m):</line-13>
<line-14> p,q,r,s = list(map(int,input().split()))</line-14>
<line-15> nearest = -1</line-15>
<line-16> distance = 10000000000</line-16>
<line-17> for i in range(0,n):</line-17>
<line-18> way = dist(a[i][0],a[i][1],p,q)</line-18>
<line-19> if way < distance:</line-19>
<line-20> distance = way</line-20>
<line-21> nearest = i</line-21>
<line-22> print(nearest + 1)</line-22>
<line-24> a[nearest][1] = s</line-24>
<line-25></line-25>
|
{"code": "<line-2>def dist(w,x,y,z):</line-2>\n<line-23> a[nearest][0] = r</line-23>", "lines": [2, 23]}
#### 0
|
<line-1>t=int(input())</line-1>
<line-3> s=input()</line-3>
<line-4> zeroes=s.count('0')</line-4>
<line-5> ones=s.count('1')</line-5>
<line-6> if (len(s)%2==1 or zeroes==0 or ones==0):</line-6>
<line-7> ans= -1</line-7>
<line-8> else:</line-8>
<line-10> print(ans) </line-10>
|
{"code": "<line-2>for i in range(t):</line-2>\n<line-9> ans=abs(zeroes-ones)//2</line-9>", "lines": [2, 9]}
#### 0
|
<line-2> n = int(input())</line-2>
<line-3> q = "1"+"0"*(n//2)</line-3>
<line-4> print(1,q)</line-4>
|
{"code": "<line-1>for i in range(int(input())):</line-1>", "lines": [1]}
#### 0
|
<line-1>from math import gcd</line-1>
<line-3>a = []</line-3>
<line-4>for i in range(k):</line-4>
<line-5> try:</line-5>
<line-6> a += list(map(int, input().split()))</line-6>
<line-7> except:</line-7>
<line-8> pass</line-8>
<line-9>ans = n</line-9>
<line-10>for i in range(1, 2**k):</line-10>
<line-11> b = bin(i)[2:].rjust(k, "0")</line-11>
<line-12> c = []</line-12>
<line-13> for j in range(k):</line-13>
<line-14> if(b[j] == '1'):</line-14>
<line-15> c.append(a[j])</line-15>
<line-16> lcm = c[0]</line-16>
<line-17> for j in c[1:]:</line-17>
<line-18> lcm *= j // gcd(lcm, j)</line-18>
<line-19> temp = ((n - 1) // lcm) + 1</line-19>
<line-20> if(b.count('1')&1):</line-20>
<line-21> ans -= temp</line-21>
<line-22> else:</line-22>
<line-24>print(ans)</line-24>
<line-25></line-25>
|
{"code": "<line-2>n, k = list(map(int, input().split()))</line-2>\n<line-23> ans += temp</line-23>", "lines": [2, 23]}
#### 0
|
<line-1>for _ in range(int(input())):</line-1>
<line-3></line-3>
<line-4> i = 0</line-4>
<line-5></line-5>
<line-6> while i < len(s) - 1:</line-6>
<line-7> if s[i].isalpha() or s[i] == ')':</line-7>
<line-8> if s[i + 1].isdigit():</line-8>
<line-9> if i + 2 >= len(s) or s[i + 2] == ')':</line-9>
<line-10> s = s[:i+1] + ['*', s[i+1]] + s[i+2:]</line-10>
<line-11> else:</line-11>
<line-12> s = s[:i+1] + ['*', s[i+1], '+'] + s[i+2:]</line-12>
<line-13> i += 1</line-13>
<line-14> elif s[i + 1].isalpha() or s[i + 1] == '(':</line-14>
<line-15> s = s[:i+1] + ['+'] + s[i+1:]</line-15>
<line-16></line-16>
<line-17> i += 1</line-17>
<line-18></line-18>
<line-19> s = ''.join(s)</line-19>
<line-20></line-20>
<line-21> s = s.strip('+')</line-21>
<line-22></line-22>
<line-23> x = 2</line-23>
<line-24> y = 4</line-24>
<line-26></line-26>
<line-27> print(eval(s))</line-27>
|
{"code": "<line-2> s = list(input().strip())</line-2>\n<line-25> z = 10</line-25>", "lines": [2, 25]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3> n=int(input())</line-3>
<line-4> l1=[]</line-4>
<line-5> l2=[]</line-5>
<line-6> </line-6>
<line-7> for i in range(n):</line-7>
<line-8> s=input()</line-8>
<line-9> a=s[ :n//2].count('1')</line-9>
<line-10> b=s[n//2: ].count('1')</line-10>
<line-11> if a>b:</line-11>
<line-12> l1.append(a-b)</line-12>
<line-13> </line-13>
<line-14> elif a<b:</line-14>
<line-15> l2.append(b-a)</line-15>
<line-16> </line-16>
<line-17> p=sum(l1)</line-17>
<line-18> q=sum(l2)</line-18>
<line-19> </line-19>
<line-20> if p==q:</line-20>
<line-21> print(0)</line-21>
<line-22> </line-22>
<line-23> elif p>q:</line-23>
<line-24> diff=p-q</line-24>
<line-25> flag=0</line-25>
<line-26> for i in range(diff//2, 0, -1):</line-26>
<line-27> a=diff-i</line-27>
<line-28> if (i in l1) or (a in l1):</line-28>
<line-29> print(abs(a-i))</line-29>
<line-30> flag=1</line-30>
<line-31> break</line-31>
<line-32> </line-32>
<line-33> if flag==0:</line-33>
<line-34> print(diff)</line-34>
<line-35> </line-35>
<line-36> else:</line-36>
<line-37> diff=q-p</line-37>
<line-38> flag=0</line-38>
<line-39> for i in range(diff//2, 0, -1):</line-39>
<line-40> a=diff-i</line-40>
<line-41> if (i in l2) or (a in l2):</line-41>
<line-42> print(abs(a-i))</line-42>
<line-43> flag=1</line-43>
<line-44> break</line-44>
<line-45> </line-45>
<line-47> print(diff)</line-47>
|
{"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-46> if flag==0:</line-46>", "lines": [2, 46]}
#### 0
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.