question stringlengths 0 30.2k | answer stringlengths 55 2.44k |
|---|---|
<line-1>import math</line-1>
<line-3>a = sorted(map(int,input().split()))</line-3>
<line-4>l = [0]*n</line-4>
<line-5>for i in range(n):</line-5>
<line-6> l[i] = a[i] + l[i-1]</line-6>
<line-8> print(l[int(math.ceil(float(n)/(int(input())+1)))-1])</line-8> | {"code": "<line-2>n = int(input())</line-2>\n<line-7>for q in range(int(input())):</line-7>", "lines": [2, 7]}
#### 0 |
<line-1>for _ in range(int(input())):</line-1>
<line-3> count,e,perm = 0,0,1</line-3>
<line-4> while(True):</line-4>
<line-5> lim,start = N//(M**e),N//(M**(e + 1)) + 1</line-5>
<line-6> num = lim - start + 1</line-6>
<line-7> divs = num//M</line-7>
<line-8> if((start + divs*M) <= lim):</line-8>
<line-9> r = (star... | {"code": "<line-2> N,M = list(map(int,input().split()))</line-2>\n<line-20> break</line-20>", "lines": [2, 20]}
#### 0 |
<line-1>n = eval(input())</line-1>
<line-3></line-3>
<line-4>tree = dict()</line-4>
<line-5>i = 1</line-5>
<line-6>for j in r:</line-6>
<line-7> c = tree.get(j)</line-7>
<line-8> if c:</line-8>
<line-9> tree[j].append(i)</line-9>
<line-10> else:</line-10>
<line-11> tree[j] = [i]</line-11>
<line-12> if not tree.get(i)... | {"code": "<line-2>r = list(map(int, input().split()))</line-2>\n<line-18> s.append(str(elem))</line-18>", "lines": [2, 18]}
#### 0 |
<line-1>from sys import stdin</line-1>
<line-3> if num:</line-3>
<line-4> return num</line-4>
<line-5> return 0</line-5>
<line-6>for __ in range(int(stdin.readline().split()[0])):</line-6>
<line-7> n = int(stdin.readline().split()[0])</line-7>
<line-8> a = list(map(int, stdin.readline().split()))</line-8>
<line-9> cnt... | {"code": "<line-2>def gt(num):</line-2>\n<line-24> ans += gt(cntb.get(asum-bsum))</line-24>", "lines": [2, 24]}
#### 0 |
<line-1>t= int(input())</line-1>
<line-3> n = int(input())</line-3>
<line-4> m=0</line-4>
<line-5> m=n//(2**11)</line-5>
<line-6> n%=(2**11)</line-6>
<line-7> while(n>0):</line-7>
<line-8> num=n%2</line-8>
<line-9> m+=num</line-9>
<line-10> n//=2</line-10>
<line-12> t-=1</line-12> | {"code": "<line-2>while(t>0):</line-2>\n<line-11> print(m)</line-11>", "lines": [2, 11]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3>import sys, os</line-3>
<line-4></line-4>
<line-5>def closeMatches(patterns, word): </line-5>
<line-6> return get_close_matches(word, patterns, 1, 0.9)[0]</line-6>
<line-7></line-7>
<line-8>def get_string(): </line-8>
<line-9> return sys.stdin.readline().strip() </line-9>
... | {"code": "<line-2>from difflib import get_close_matches </line-2>\n<line-27>for j in ans:</line-27>", "lines": [2, 27]}
#### 0 |
<line-1>from math import gcd</line-1>
<line-3></line-3>
<line-4>def gcd_split(seq):</line-4>
<line-5> gcds= [int(gcd(a,b)==1) for a,b in zip(seq[1:],seq[:-1])]</line-5>
<line-6> gcds.append(int(gcd(seq[0],seq[-1])==1))</line-6>
<line-7> # print(gcds)</line-7>
<line-8> if max(gcds)==0:</line-8>
<line-9> return -1</line... | {"code": "<line-2>from itertools import groupby</line-2>\n<line-41> res = res + [0]*(N-1 -len(res))</line-41>", "lines": [2, 41]}
#### 0 |
<line-1>MAX = 100005</line-1>
<line-3>lazy = [0] * MAX;</line-3>
<line-4> </line-4>
<line-5>def updateRangeUtil(si, ss, se, us, ue, diff) :</line-5>
<line-6> if (lazy[si] != 0) :</line-6>
<line-7> tree[si] += lazy[si];</line-7>
<line-8> if (ss != se) :</line-8>
<line-9> lazy[si * 2 + 1] += l... | {"code": "<line-2>tree = [0] * MAX; </line-2>\n<line-79> updateRange(n, l, r, getSum(n, l, r)%1000000007);</line-79>", "lines": [2, 79]}
#### 0 |
<line-1>from collections import Counter</line-1>
<line-3> for _ in range(int(input())):</line-3>
<line-4> n=int(input())</line-4>
<line-5> s=input()</line-5>
<line-6> d1=dict(Counter(s))</line-6>
<line-7> </line-7>
<line-8> u,d,r,l=0,0,0,0</line-8>
<line-9> if 'U' in d1:</line-9>
<line-10> u=d1['U']</line-10>
<... | {"code": "<line-2>try:</line-2>\n<line-45>except:</line-45>", "lines": [2, 45]}
#### 0 |
<line-1>t=int(input())</line-1>
<line-3> n,a,b,c,d,p,q,y=list(map(int,input().split()))</line-3>
<line-4> l=list(map(int,input().split()))</line-4>
<line-5> ans = abs((l[b-1]-l[a-1]))*p</line-5>
<line-6> x=abs(l[c-1]-l[a-1])*p</line-6>
<line-7> if x<=y:</line-7>
<line-8> x=y+abs(l[d-1]-l[c-1])*q+abs(l[b-1]-l[d-1])*p</... | {"code": "<line-2>for _ in range(t):</line-2>\n<line-9> ans=min(ans,x)</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>t = int(input())</line-1>
<line-3> q = input().split()</line-3>
<line-4> n = int(q[0])</line-4>
<line-5> m = int(q[1])</line-5>
<line-6> k = int(q[2])</line-6>
<line-7> sumax = 0</line-7>
<line-8> b = []</line-8>
<line-9> for j in range(n):</line-9>
<line-10> a = [int(k) for k in inp... | {"code": "<line-2>for i in range(t):</line-2>\n<line-31> sumax = su</line-31>", "lines": [2, 31]}
#### 0 |
<line-1>lst=[1, 2, 4, 8, 13, 21, 31, 45, 66, 81, 97, 123, 148, 182, 204, 252, 290, 361, 401, 475, 565, 593, 662, 775, 822, 916, 970, 1016, 1159, 1312, 1395, 1523, 1572, 1821, 1896, 2029, 2254, 2379, 2510, 2780, 2925, 3155, 3354, 3591, 3797, 3998, 4297, 4433, 4779, 4851, 5123, 5243, 5298, 5751, 5998, 6374, 6801, 6925, 7... | {"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-8> print()</line-8>", "lines": [2, 8]}
#### 0 |
<line-1>import math</line-1>
<line-3>from functools import reduce</line-3>
<line-4>from collections import defaultdict</line-4>
<line-5># import sys</line-5>
<line-6># input = sys.stdin.readline</line-6>
<line-7></line-7>
<line-8>def inn():</line-8>
<line-9> return int(input())</line-9>
<line-10></line-10>
<line-11>def... | {"code": "<line-2>import bisect</line-2>\n<line-44>for i in k:</line-44>", "lines": [2, 44]}
#### 0 |
<line-1>for i in range(int(input())):</line-1>
<line-3> t=0</line-3>
<line-4> if n%2!=0:</line-4>
<line-5> n-=1</line-5>
<line-6> t+=1</line-6>
<line-7> t+=(n//k)</line-7>
<line-8> if n%k!=0:</line-8>
<line-10> print(t)</line-10> | {"code": "<line-2> n,k=list(map(int,input().split()))</line-2>\n<line-9> t+=1</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>def checkValidity(s):</line-1>
<line-3> previous = ""</line-3>
<line-4></line-4>
<line-5> for x in s:</line-5>
<line-6> if count == 0:</line-6>
<line-7> previous = x</line-7>
<line-8> count += 1</line-8>
<line-9> elif count == 1:</line-9>
<line-10> count = 0</line-10>
<line-11> if previous == x:</line... | {"code": "<line-2> count = 0</line-2>\n<line-19> s = input()</line-19>", "lines": [2, 19]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3> count=0</line-3>
<line-4> visited=set()</line-4>
<line-5> stack=set()</line-5>
<line-6> stack.add((l[row][col],row,col))</line-6>
<line-7> while stack:</line-7>
<line-8> ele=stack.pop()</line-8>
<line-9> visited.add((ele[1],ele[2]))</line-9>
<... | {"code": "<line-2>def solve(l,r,c,row,col,po):</line-2>\n<line-32> row,col,po=map(int,input().split())</line-32>", "lines": [2, 32]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5>s = list(input())</line-5>
<line-6>totalCal = 0</line-6>
<line-7></line-7>
<line-8>for i in range(len(s)):</line-8>
<line-9> if s[i] == 'D':</line-9>
<line-10> totalCal += d['D']</line-10>
<line-11> if s[i] == 'T':</line-11>... | {"code": "<line-3>d = { 'D': 238, 'T': 244, 'M': 138, 'B': 279, 'C': 186 }</line-3>\n<line-29>print(C)</line-29>", "lines": [3, 29]}
#### 0 |
<line-1>import math</line-1>
<line-3>for u in range(eval(input())):</line-3>
<line-4> n, q = list(map(int, input().split()))</line-4>
<line-5> for j in range(q):</line-5>
<line-6> i,k = list(map(int, input().split()))</line-6>
<line-7> if k>i:</line-7>
<line-8> c=0</line-8>
<line-9> print(c)</line-9>
<line-10> e... | {"code": "<line-2>f = math.factorial</line-2>\n<line-36> c=c%1000000007</line-36>", "lines": [2, 36]}
#### 0 |
<line-1>for t in range(int(input())):</line-1>
<line-3> r = input()</line-3>
<line-4> diff = list()</line-4>
<line-5> index = list()</line-5>
<line-6> cnt = 0</line-6>
<line-7> for i in range(len(s)):</line-7>
<line-8> if s[i] != r[i]:</line-8>
<line-9> cnt += 1</line-9>
<line-10> index.append(i)</line-10>
<line-1... | {"code": "<line-2> s = input()</line-2>\n<line-19> fmin = min(fmin, moves * oper)</line-19>", "lines": [2, 19]}
#### 0 |
<line-1>for _ in range(int(input())):</line-1>
<line-3> n=len(s)</line-3>
<line-4> t=0</line-4>
<line-5> ans=0</line-5>
<line-6> for i in range(n-1):</line-6>
<line-7> if(s[i]==s[i+1]):</line-7>
<line-8> t=t+1</line-8>
<line-9> x=t</line-9>
<line-10> for i in range(n):</line-10>
<line-11> t=x</line-11>
<line-12> i... | {"code": "<line-2> s=input()</line-2>\n<line-27> ans=ans+t</line-27>", "lines": [2, 27]}
#### 0 |
<line-1>from sys import stdout, stdin</line-1>
<line-3>n= n+m+o</line-3>
<line-4>l=[]</line-4>
<line-5>a=[]</line-5>
<line-6>for i in range(n):</line-6>
<line-7> b= int(stdin.readline())</line-7>
<line-8> if(b in l and b not in a):</line-8>
<line-9> l.append(b)</line-9>
<line-10> a.append(b)</line-1... | {"code": "<line-2>n,m,o = list(map(int, stdin.readline().split()))</line-2>\n<line-16>stdout.write(str(len(a)) + '\\n')</line-16>", "lines": [2, 16]}
#### 0 |
<line-1>t=int(input())</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> s=sum(a)</line-6>
<line-7> if a[0]*(s-a[0])<=a[n-1]*(s-a[n-1]):</line-7>
<line-8> print(a[0]*(s-a[0]))</line-8>
<line-10> print(a[n-1]*(s-a[n-1]))</line-10> | {"code": "<line-2>for _ in range(t):</line-2>\n<line-9> else:</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>T=int(input())</line-1>
<line-3>for _ in range(T):</line-3>
<line-4> N=int(input())</line-4>
<line-5> t.append(N)</line-5>
<line-6>N=max(t)+1</line-6>
<line-7>l=[0 for i in range(N)]</line-7>
<line-8>p=1</line-8>
<line-9>a=1</line-9>
<line-10>for i in range(1,N):</line-10>
<line-11> a=(a*i)%1000000007</line-11>... | {"code": "<line-2>t=[]</line-2>\n<line-14>for i in t:</line-14>", "lines": [2, 14]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3> for i in range(int(input())):</line-3>
<line-4> v1,t1,v2,t2,v3,t3=map(int,input().split())</line-4>
<line-5> ok = 0</line-5>
<line-6> if t1 <= t3 <= t2:</line-6>
<line-7> x, y = t2 - t3, t3 - t1</line-7>
<line-8> ok = x * v3 <= (x + y) * v1 and y * v3 <= (x + y) * ... | {"code": "<line-2>try:</line-2>\n<line-11>except:</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>t=int(input())</line-1>
<line-3> t=t-1</line-3>
<line-4> n,x=input().split()</line-4>
<line-5> n=int(n)</line-5>
<line-6> x=int(x)</line-6>
<line-7> d,l=input().split()</line-7>
<line-8></line-8>
<line-9> if d=='L':</line-9>
<line-10> p=x</line-10>
<line-11> elif d=='R':</line-11>
<line-12> p=(n-x)+1</line-12... | {"code": "<line-2>while t:</line-2>\n<line-23> lang='H'</line-23>", "lines": [2, 23]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3> s=input()</line-3>
<line-4> while(s.count("abc")!=0):</line-4>
<line-6> print(s) </line-6> | {"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-5> s=s.replace(\"abc\",\"\")</line-5>", "lines": [2, 5]}
#### 0 |
<line-1>from sys import stdin</line-1>
<line-3></line-3>
<line-4>def func(arr,n,l):</line-4>
<line-5> count=0</line-5>
<line-6> k=l//n</line-6>
<line-7> if n<len(arr):</line-7>
<line-8> for ele in arr[0:n]:</line-8>
<line-9> count+=max(0,k-ele)</line-9>
<line-10> else:</line-10>
<line-11> for ele in arr:</line-11>
... | {"code": "<line-2>from collections import Counter</line-2>\n<line-29> ans = x</line-29>", "lines": [2, 29]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3> x1,x2,x3,v1,v2=[int(x)for x in input().rstrip().split()]</line-3>
<line-4> t1=abs(x3-x1)/v1</line-4>
<line-5> t2=abs(x3-x2)/v2</line-5>
<line-6> if t1<t2:</line-6>
<line-7> print("Chef")</line-7>
<line-8> elif t1>t2:</line-8>
<line-9> print("Kefa")</line-9>
<line-10> el... | {"code": "<line-2>for t in range(int(input())):</line-2>\n<line-12> else:</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>try:</line-1>
<line-3> for i in range(t):</line-3>
<line-4> print("Case {}:".format(i+1), end=" ")</line-4>
<line-5> m, n = map(int,input().split())</line-5>
<line-6> x, y = map(int,input().split())</line-6>
<line-7> l = int(input())</line-7>
<line-8> a=input()</line-8>
<line-9> destx = a.count("R")-a.cou... | {"code": "<line-2> t=int(input())</line-2>\n<line-21>except:</line-21>", "lines": [2, 21]}
#### 0 |
<line-1>def isSolvable( W, R):</line-1>
<line-3> if LR < ML: return False</line-3>
<line-4> def dfs(d,i,c):</line-4>
<line-5> if d == ML: return c == 0</line-5>
<line-6> if i == len(W) + 1:</line-6>
<line-7> s = sum(LMap[w[-d-1]] if d < len(w) else 0 for w in W) + c</l... | {"code": "<line-2> LW, LR, F, ML, AW, V, LMap = len(W), len(R), set([w[0] for w in W+[R]]), max(map(len, W+[R])), W+[R], set(), {}</line-2>\n<line-26>else:</line-26>", "lines": [2, 26]}
#### 0 |
<line-1>t=int(input())</line-1>
<line-3> n,k=map(int,input().split())</line-3>
<line-4> m=list(map(int,input().split()))</line-4>
<line-5> a=0</line-5>
<line-6> for i in m:</line-6>
<line-7> if i>=k:</line-7>
<line-8> a=1</line-8>
<line-9> break</line-9>
<line-10> if a==1:</line-10>
<line-11> print('YES')</line-1... | {"code": "<line-2>for i in range(t):</line-2>\n<line-12> else:</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>def fun(a,cur,n,cnt):</line-1>
<line-3> return</line-3>
<line-4> for i in range(cur,n-1):</line-4>
<line-5> if i<n-2:</line-5>
<line-6> if a[i]>0 and a[i+1]>0:</line-6>
<line-7> a[i]-=1</line-7>
<line-8> a[i+1]-=1</line-8>
<line-9> a[i+2]+... | {"code": "<line-2> if cur>=n-1:</line-2>\n<line-30> fun(a,0,n,cnt)</line-30>", "lines": [2, 30]}
#### 0 |
<line-1>t=int(input())</line-1>
<line-3> x,n=[int(g) for g in input().split()]</line-3>
<line-4> sal=0</line-4>
<line-5> day=x</line-5>
<line-6> while day<n:</line-6>
<line-7> sal=sal+day</line-7>
<line-9> print(sal)</line-9> | {"code": "<line-2>for i in range(t):</line-2>\n<line-8> day+=x</line-8>", "lines": [2, 8]}
#### 0 |
<line-1>t = int(input())</line-1>
<line-3> M = 1000000007</line-3>
<line-4> n, m = list(map(int, input().split())) </line-4>
<line-5> ans = 1</line-5>
<line-6> tt = n//2</line-6>
<line-7> tt = tt * (tt + 1)</line-7>
<line-8> </line-8>
<line-9> ans = pow(m, tt, M)</line-9>
<line-10> </line-10>
<l... | {"code": "<line-2>while t != 0:</line-2>\n<line-11> print(ans)</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>import sys</line-1>
<line-3>from copy import copy</line-3>
<line-4></line-4>
<line-5>R = lambda t = int: t(eval(input()))</line-5>
<line-6>RL = lambda t = int: [t(x) for x in input().split()]</line-6>
<line-7>RLL = lambda n, t = int: [RL(t) for _ in range(n)]</line-7>
<line-8></line-8>
<line-9>def solve():</lin... | {"code": "<line-2>from collections import defaultdict</line-2>\n<line-36>for t in range(1, T + 1):</line-36>", "lines": [2, 36]}
#### 0 |
<line-1>from math import sqrt</line-1>
<line-2></line-2>
<line-4>ans = []</line-4>
<line-5></line-5>
<line-6>for _ in range(T):</line-6>
<line-7> X = int(input())</line-7>
<line-8></line-8>
<line-9> count = 0</line-9>
<line-10> x = 0</line-10>
<line-11> y = 0</line-11>
<line-12> while(x<=X):</line-12>
<line-13> p = in... | {"code": "<line-3>T = int(input())</line-3>\n<line-26>for i in ans:</line-26>", "lines": [3, 26]}
#### 0 |
<line-1>def sort_str(s):</line-1>
<line-3> for c in s:</line-3>
<line-4> o.append(c)</line-4>
<line-5> o.sort()</line-5>
<line-6> return "".join(o)</line-6>
<line-7>def find_ana(s):</line-7>
<line-8> if len(s) <= 1:</line-8>
<line-9> return 0</line-9>
<line-10> h = {}</line-10>
<line-11> ... | {"code": "<line-2> o = []</line-2>\n<line-22>for _ in range(t):</line-22>", "lines": [2, 22]}
#### 0 |
<line-1>t=int(input())</line-1>
<line-2> </line-2>
<line-4> sense=0</line-4>
<line-5> ctr=a</line-5>
<line-6> for c in range(n):</line-6>
<line-7> if val[c]<=ctr:</line-7>
<line-8> sense+=-1</line-8>
<line-9> else:</line-9>
<line-10> sense+=1</line-10>
<line-11> ctr+=l</line-11>
<line-12> return sense</line-12>
... | {"code": "<line-3>def vsense(val,a,l):</line-3>\n<line-40> print(ans)</line-40>", "lines": [3, 40]}
#### 0 |
<line-1></line-1>
<line-2></line-2>
<line-3>import fractions</line-3>
<line-5></line-5>
<line-6>f = sys.stdin</line-6>
<line-7></line-7>
<line-8>if len(sys.argv) > 1:</line-8>
<line-9> f = open(sys.argv[1], "rt")</line-9>
<line-10></line-10>
<line-11></line-11>
<line-12>sum_cache = {}</line-12>
<line-13></line-13>
<... | {"code": "<line-4>import sys</line-4>\n<line-138> r = calc(A_1, D, L, R)</line-138>", "lines": [4, 138]}
#### 0 |
<line-1>t=eval(input())</line-1>
<line-3> if k==n:</line-3>
<line-4> x+=[dist[n]]</line-4>
<line-5> return</line-5>
<line-6> for i in range(1,n+1):</line-6>
<line-7> if graph[k][i]!=0 and dist[i]==-1:</line-7>
<line-8> dist[i]=dist[k]+graph[k][i]</line-8>
<line-9> func(i,n,x,dist,graph)</line-9>
<line-10> dist... | {"code": "<line-2>def func(k,n,x,dist,graph):</line-2>\n<line-29> print(ans)</line-29>", "lines": [2, 29]}
#### 0 |
<line-1>from collections import defaultdict</line-1>
<line-3></line-3>
<line-4>def solve(mouse,n,m):</line-4>
<line-5> </line-5>
<line-6> # shadow matrix will contains the count of mice which affect (i,j) position</line-6>
<line-7> # if there is a mice at position (i,j) then in shadow matrix it will affect all ... | {"code": "<line-2>from itertools import product</line-2>\n<line-63> mouse.append(list(map(int,x)))</line-63>", "lines": [2, 63]}
#### 0 |
<line-1>for _ in range(int(input())):</line-1>
<line-3> a=[(1,3,5),(1,3,6),(1,4,5),(1,4,6),(2,3,5),(2,3,6),(2,4,5),(2,4,6)]</line-3>
<line-4> c=0</line-4>
<line-5> for i in a:</line-5>
<line-6> if len(set([l[i[0]-1],l[i[1]-1],l[i[2]-1]]))==1:</line-6>
<line-7> c=1</line-7>
<line-8> break</line-8>
<line-9> if c==1:... | {"code": "<line-2> l=list(map(str,input().split()))</line-2>\n<line-11> else:</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>for _ in range(int(input())):</line-1>
<line-3> a=[]</line-3>
<line-4> b=[]</line-4>
<line-5> for i in range(4*n-1):</line-5>
<line-6> c,d=list(map(int,input().split()))</line-6>
<line-7> a.append(c)</line-7>
<line-8> b.append(d)</line-8>
<line-9> c1=0</line-9>
<line-10> c2=0</line-10>
<line-11> for i in a:<... | {"code": "<line-2> n=int(input())</line-2>\n<line-14> c2^=i</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> motu, tomu = [], []</line-4>
<line-5> for i in range(n):</line-5>
<line-6> if i%2 == 0:</line-6>
<line-7> motu.append(arr[i])</line-7>
<line-8> else:</line-8>
<line-9> tomu.append((arr[i]))</line-9>
<lin... | {"code": "<line-2> n, k = map(int, input().split())</line-2>\n<line-22> else:</line-22>", "lines": [2, 22]}
#### 0 |
<line-1>dic = {}</line-1>
<line-3>#def tonum(num):</line-3>
<line-4># res=0</line-4>
<line-5># for i in range(len(num)):</line-5>
<line-6># res = 2*res + int(num[i])</line-6>
<line-7># return res</line-7>
<line-8></line-8>
<line-9>#for i in range(64):</line-9>
<line-10># number = tonum(num)</line-10>
<lin... | {"code": "<line-2>#num = \"1\"</line-2>\n<line-42> else:</line-42>", "lines": [2, 42]}
#### 0 |
<line-1>from operator import add</line-1>
<line-3></line-3>
<line-4>choices=[]</line-4>
<line-5></line-5>
<line-6>for x in range(1800):</line-6>
<line-7> num_str = list(map (int, str (2**x)))</line-7>
<line-8> suma = reduce (add, num_str)</line-8>
<line-9> choices.append(suma)</line-9>
<line-10>N=int(input())</line-10>... | {"code": "<line-2>from functools import reduce</line-2>\n<line-13> t=int(input())</line-13>", "lines": [2, 13]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3> def __init__(self,a,b=0,c=0):</line-3>
<line-4> self.val=a</line-4>
<line-5> self.a=b</line-5>
<line-6> self.b=c</line-6>
<line-7></line-7>
<line-8>arr=[]</line-8>
<line-9></line-9>
<line-10>def finder(node,val):</line-10>
<line-11> if(arr[node].val==0):</line-11>
<lin... | {"code": "<line-2>class node:</line-2>\n<line-48>\t# print(higher)</line-48>", "lines": [2, 48]}
#### 0 |
<line-1>import sys</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5> LENT = len(L)</line-5>
<line-6> MINT = 1</line-6>
<line-7> GOT = 0</line-7>
<line-8></line-8>
<line-9> DY = [ [{x: 0 for x in range(0, 10)}, 0, 0] ]</line-9>
<line-10></line-10>
<line-11> for i in L:</line-11>
<line-12></line-12>
<l... | {"code": "<line-3>def GRIG(L):</line-3>\n<line-36> L = [int(x) for x in list(input().strip())]</line-36>", "lines": [3, 36]}
#### 0 |
<line-1>divisors = [1 , 2 , 3 , 4 , 6 , 8 , 9 , 10 , 12 , 16 , 18 , 20 , 24 , 30 , 32 , 36 , 40 , 48 , 60 , 64 , 72 , 80 , 84 , 90 , 96 , 100 , 108 , 120 , 128 , 144 , 160 , 168 , 180 , 192 , 200 , 216 , 224 , 240 , 256 , 288 , 320 , 336 , 360 , 384 , 400 , 432 , 448 , 480 , 504 , 512 , 576 , 600 , 640 , 672 , 720 , 76... | {"code": "<line-2>numbers = [1 , 2 , 4 , 6 , 12 , 24 , 36 , 48 , 60 , 120 , 180 , 240 , 360 , 720 , 840 , 1260 , 1680 , 2520 , 5040 , 7560 , 10080 , 15120 , 20160 , 25200 , 27720 , 45360 , 50400 , 55440 , 83160 , 110880 , 166320 , 221760 , 277200 , 332640 , 498960 , 554400 , 665280 , 720720 , 1081080 , 1441440 , 216216... |
{"code": "<line-1>print(25)</line-1>", "lines": [1]}
#### 0 | |
<line-1>t = int(input())</line-1>
<line-2></line-2>
<line-4> n = int(input())</line-4>
<line-5> a = input().strip()</line-5>
<line-6> prev = a[0]</line-6>
<line-7> ans = -1</line-7>
<line-8> for i in a:</line-8>
<line-9> if prev == i:</line-9>
<line-10> ans += 1</line-10>
<line-12> p... | {"code": "<line-3>for _ in range(t):</line-3>\n<line-11> prev = i</line-11>", "lines": [3, 11]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3> a,b,c=list(map(int, input().split()))</line-3>
<line-4> p=a*100+b</line-4>
<line-5> mx=p </line-5>
<line-6> ans, cnt = 0, 0</line-6>
<line-7> while True:</line-7>
<line-8> cnt+=1 </line-8>
<line-9> if p<c or cnt==10000:</line-9>
<line-10> ... | {"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-19> ans=cnt</line-19>", "lines": [2, 19]}
#### 0 |
<line-1>test=int(input())</line-1>
<line-3> N=input()</line-3>
<line-4> X=[]</line-4>
<line-5> list2=[]</line-5>
<line-6> for x in N:</line-6>
<line-7> X.append(x)</line-7>
<line-8> list1=[]</line-8>
<line-9> list1=list(set(X))</line-9>
<line-10> output=''</line-10>
<line-11> for x in list1:</line-11>
<line-12> for y... | {"code": "<line-2>for i in range(test):</line-2>\n<line-27> output+=chr(k)</line-27>", "lines": [2, 27]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3>for _ in range(t):</line-3>
<line-4> n = int(input())</line-4>
<line-5> for i in range(n+1):</line-5>
<line-6> b = n</line-6>
<line-7> for space in range(n-i):</line-7>
<line-8> print(" ",end="")</line-8>
<line-9> for j in range(i+1):<... | {"code": "<line-2>t=int(input())</line-2>\n<line-19> a-=1</line-19>", "lines": [2, 19]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3>while t:</line-3>
<line-4> x = int(input())</line-4>
<line-5> arr = [int(i) for i in input().split()]</line-5>
<line-6> total = 0</line-6>
<line-7> for i in arr:</line-7>
<line-8> if i % 6 == 0:</line-8>
<line-9> total += 6</line-9>
<line-10> ... | {"code": "<line-2>t = int(input())</line-2>\n<line-12> print(total)</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>n=int(input())</line-1>
<line-3> k,x=map(int,input().split())</line-3>
<line-4> l=list(map(int,input().split()))</line-4>
<line-5> f,e,o=0,0,0</line-5>
<line-6> for i in l:</line-6>
<line-7> if(i%2==0):</line-7>
<line-8> e+=1</line-8>
<line-9> else:</line-9>
<line-10> o+=1</line-10... | {"code": "<line-2>for i in range(n):</line-2>\n<line-25> else:</line-25>", "lines": [2, 25]}
#### 0 |
<line-1>from math import *</line-1>
<line-3> n = int(input())</line-3>
<line-4> numberlist = list(map(int,input().split()))</line-4>
<line-6> print(numberlist[0]* ( len(numberlist) -1))</line-6> | {"code": "<line-2>for t in range(int(input())):</line-2>\n<line-5> numberlist.sort()</line-5>", "lines": [2, 5]}
#### 0 |
<line-1>a = int(input())</line-1>
<line-3> b = input()</line-3>
<line-4> if '5' in b or '0' in b:</line-4>
<line-5> print(1)</line-5>
<line-7> print(0)</line-7> | {"code": "<line-2>for i in range(a):</line-2>\n<line-6>\t\tcontinue</line-6>", "lines": [2, 6]}
#### 0 |
<line-1>c=0</line-1>
<line-3> a, b=map(int, input().split())</line-3>
<line-5>print(c%((10**9) +7)) </line-5> | {"code": "<line-2>for i in range (int(input ())):</line-2>\n<line-4>\tc+=abs(a-b)+1</line-4>", "lines": [2, 4]}
#### 0 |
<line-1>n = int(input())</line-1>
<line-3>for x in range(n):</line-3>
<line-4> l[x] = int(input())</line-4>
<line-5>for i in range(n):</line-5>
<line-6> z = 1</line-6>
<line-7> for j in range(1,l[i]+1):</line-7>
<line-8> for k in range(1,l[i]+1):</line-8>
<line-9> print(z,end='')</line-9>
<li... | {"code": "<line-2>l = [0] * n</line-2>\n<line-10> z += 2</line-10>", "lines": [2, 10]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3>for i in range(l1):</line-3>
<line-4> x=int(input())</line-4>
<line-5> y=list(map(int,input().split()))</line-5>
<line-6> z=list(map(int,input().split()))</line-6>
<line-7> if max(z)!=max(y):</line-7>
<line-8> print('YES')</line-8>
<line-10> print... | {"code": "<line-2>l1=int(input())</line-2>\n<line-9> else:</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>import sys</line-1>
<line-3>def mergeSortInversions(arr):</line-3>
<line-4> if len(arr) == 1:</line-4>
<line-5> return arr, 0</line-5>
<line-6> larr=len(arr)</line-6>
<line-7> a = arr[:larr//2]</line-7>
<line-8> b = arr[larr//2:]</line-8>
<line-9> a, ai = mergeSortInversions(a)</line-9>
<line-10> b, bi... | {"code": "<line-2>sys.setrecursionlimit(10000000)</line-2>\n<line-49> else:</line-49>", "lines": [2, 49]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3> cnt=0</line-3>
<line-4> for i in range(2,n+1):</line-4>
<line-5> a=n</line-5>
<line-6> while a!=0:</line-6>
<line-7> r=a%i</line-7>
<line-8> a=a//i</line-8>
<line-9> if r==1:</line-9>
<line-10> cnt+=1</line-10>
<... | {"code": "<line-2>def finder(n):</line-2>\n<line-20> else:</line-20>", "lines": [2, 20]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3> n,k=[int(i) for i in input().split()]</line-3>
<line-4> if(n%2==0):</line-4>
<line-5> if(k<(n*(n+1))//2 - 1 or k>3*((n//2)**2) - 1):print(-1)</line-5>
<line-6> elif(k==(n*(n+1))//2 - 1):</line-6>
<line-7> for i in range(1,n+1):print(i,'',end='')</line... | {"code": "<line-2>for i in range(int(input())):</line-2>\n<line-25> k,count,p,l,x = k-(n*(n+1))//2 + 1,0,0,[0 for i in range(n)],1</line-25>", "lines": [2, 25]}
#### 0 |
<line-1>t=int(input())</line-1>
<line-3> n=int(input())</line-3>
<line-4> p=10**9+7</line-4>
<line-5> a=(pow(3,n+1,p)-1)</line-5>
<line-6> </line-6>
<line-8> </line-8>
<line-9> print((((3*a)//2)%p-(2*(b))%p+p)%p)</line-9> | {"code": "<line-2>for _ in range(t):</line-2>\n<line-7> b=(pow(2,n+1,p)-1)</line-7>", "lines": [2, 7]}
#### 0 |
<line-1>import sys</line-1>
<line-2></line-2>
<line-4> r = [conv[i](x) for i, x in enumerate(input().strip().split(' '))]</line-4>
<line-5> return r[0] if len(r) == 1 else r</line-5>
<line-6></line-6>
<line-7>def _ra(conv) :</line-7>
<line-8> return list(map(conv, input().strip().split(' ')))</line-8>
<line-9></line-9>... | {"code": "<line-3>def _r(*conv) :</line-3>\n<line-63> if failed : </line-63>", "lines": [3, 63]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3>N = 10**6</line-3>
<line-4>sum_arr = [0] * (N + 1) </line-4>
<line-5>def lprime():</line-5>
<line-6> arr = [0] * (N + 1) </line-6>
<line-7> arr[0] = 1</line-7>
<line-8> arr[1] = 1</line-8>
<line-9> for i in range(2, math.ceil(math.sqrt(N) + 1)): </line-9>
<line... | {"code": "<line-2>import math</line-2>\n<line-24> x=int(input())</line-24>", "lines": [2, 24]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3></line-3>
<line-4>for i in range(T):</line-4>
<line-5> N,data,D,People = int(input()),list(map(int,list(input()))),int(input()),list(map(int,input().split()))</line-5>
<line-6> </line-6>
<line-7> data.insert(0,"|"),data.append("|")</line-7>
<line-8> infected = ... | {"code": "<line-2>T = int(input())</line-2>\n<line-34> infected.sort()</line-34>", "lines": [2, 34]}
#### 0 |
<line-1>t = int(input())</line-1>
<line-3> n,p = [int(x) for x in input().split()]</line-3>
<line-4> a = [int(x) for x in input().split()] </line-4>
<line-5> c = [x for x in a if x >= p//2]</line-5>
<line-6> h = [x for x in a if x <= p//10]</line-6>
<line-7> if len(c)==1 and len(h)==2 :</line-7>
<line-8> print("yes")<... | {"code": "<line-2>for z in range(t) :</line-2>\n<line-9> else:</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>for _ in range(int(input())):</line-1>
<line-3> k=int(k)</line-3>
<line-4> n="NOPE"</line-4>
<line-5> al=[0]*26</line-5>
<line-6> for ele in s:</line-6>
<line-7> al[ord(ele)-ord('a')]=1</line-7>
<line-8> l=len(s)</line-8>
<line-9> ans=[]</line-9>
<line-10> # print(al)</line-10>
<line-11> for i in range(26):</l... | {"code": "<line-2> s,k=map(str,input().split())</line-2>\n<line-22> else:</line-22>", "lines": [2, 22]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3></line-3>
<line-4>res = []</line-4>
<line-5>for i in range(t):</line-5>
<line-6> n = int(input())</line-6>
<line-7> arr = [int(i) for i in input().split()]</line-7>
<line-8> </line-8>
<line-9> num_2 = 0</line-9>
<line-10> num = 0</line-10>
<line-11> </line-11>
<line-12> fo... | {"code": "<line-2>t = int(input())</line-2>\n<line-21>for z in res:</line-21>", "lines": [2, 21]}
#### 0 |
<line-1>factorials=[1]</line-1>
<line-2></line-2>
<line-4> factorials.append(factorials[x-1]*x)</line-4>
<line-5> </line-5>
<line-6>x=int(input())</line-6>
<line-7></line-7>
<line-8>for x in range(x):</line-8>
<line-10> print(factorials[n])</line-10> | {"code": "<line-3>for x in range(1,201):</line-3>\n<line-9> n=int(input())</line-9>", "lines": [3, 9]}
#### 0 |
<line-1>s=int(input())</line-1>
<line-3> s-=1</line-3>
<line-4> a=input()</line-4>
<line-5> c=0</line-5>
<line-6> for x in a:</line-6>
<line-7> c+=int(x)</line-7>
<line-8> if(c<9 and len(a)!=1):</line-8>
<line-9> print(9-c%9)</line-9>
<line-11> print(min(9-c%9,c%9))</line-11> | {"code": "<line-2>while(s>0):</line-2>\n<line-10> else:</line-10>", "lines": [2, 10]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3>for _ in range(t):</line-3>
<line-4> n,m = map(int,input().split())</line-4>
<line-5> count=0</line-5>
<line-6> for i in range(n,m+1):</line-6>
<line-7> p=str(i)</line-7>
<line-8> if p[-1]=='2' or p[-1]=='3' or p[-1]=='9':</line-8>
<line-10> print(count)</line-10> | {"code": "<line-2>t=int(input())</line-2>\n<line-9> count+=1</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>def merge(intervals,start,mid,end):</line-1>
<line-3> bl = end-mid</line-3>
<line-4> </line-4>
<line-5> A = intervals[start:mid+1]</line-5>
<line-6> B = intervals[mid+1:end+1]</line-6>
<line-7> </line-7>
<line-8> p=0;q=0;k=start;</line-8>
<line-9> while(p<al and q<bl):</line-9>
<line-10> if(A[p]<B[q]):</line-1... | {"code": "<line-2> al = mid-start+1</line-2>\n<line-122> front += 1</line-122>", "lines": [2, 122]}
#### 0 |
<line-1></line-1>
<line-2></line-2>
<line-3>import fractions</line-3>
<line-5></line-5>
<line-6>f = sys.stdin</line-6>
<line-7></line-7>
<line-8>if len(sys.argv) > 1:</line-8>
<line-9> f = open(sys.argv[1], "rt")</line-9>
<line-10></line-10>
<line-11></line-11>
<line-12>def calc(N, M):</line-12>
<line-13> if M != N:</l... | {"code": "<line-4>import sys</line-4>\n<line-25> for a, b in rr:</line-25>", "lines": [4, 25]}
#### 0 |
<line-1>t=int(input())</line-1>
<line-3> n,m=[int(x) for x in input().split()]</line-3>
<line-4> mat=[]</line-4>
<line-5> ans=[]</line-5>
<line-6> for i in range(n+2):</line-6>
<line-7> l=[]</line-7>
<line-8> p=[]</line-8>
<line-9> for j in range(m+2):</line-9>
<line-10> l.append(0)</line-10>
<line-11> p.append(... | {"code": "<line-2>for _ in range(t):</line-2>\n<line-79> print(ans[i][j],end=\" \")</line-79>", "lines": [2, 79]}
#### 0 |
<line-1>for _ in range(int(input())):</line-1>
<line-3> reach = [0]*(x+1)</line-3>
<line-4> reach[0] = 1</line-4>
<line-5> i=1</line-5>
<line-6> while i**n<=x:</line-6>
<line-7> j = 1</line-7>
<line-8> while j+i**n<=x:</line-8>
<line-9> j+=1</line-9>
<line-10> j-=1</line-10>
... | {"code": "<line-2> x,n = map(int,input().split())</line-2>\n<line-16> #print(reach)</line-16>", "lines": [2, 16]}
#### 0 |
<line-1>r=[0,1,1,2,1,4,2,6,1,8,4]</line-1>
<line-2></line-2>
<line-4>if m==1:</line-4>
<line-5> while n%2!=1:</line-5>
<line-6> n=n/2</line-6>
<line-7> if n==1:</line-7>
<line-8> print(1)</line-8>
<line-9> else: </line-9>
<line-10> print(n-1) </line-10>
<line-11>elif (n+1)/2<m:</line-11>
<line-12> print(m)</line-... | {"code": "<line-3>n,m=[int(x) for x in input().split()]</line-3>\n<line-13>else:</line-13>", "lines": [3, 13]}
#### 0 |
<line-1>def base5(n):</line-1>
<line-3> for x in base5(n // 5): yield x</line-3>
<line-4> yield n % 5</line-4>
<line-5></line-5>
<line-6>def seq(n):</line-6>
<line-7> return int(''.join(str(2 * x) for x in base5(n)) or '0')</line-7>
<line-8></line-8>
<line-9>for i in range(eval(input())):</line-9>
<line-10> ... | {"code": "<line-2> if n == 0: return</line-2>\n<line-12> i=i+1</line-12>", "lines": [2, 12]}
#### 0 |
<line-1>res=""</line-1>
<line-3> ans=0</line-3>
<line-4> c=int(input())</line-4>
<line-5> for i in range(c):</line-5>
<line-6> n,m=list(map(int,input().split( )))</line-6>
<line-7> ans^=(n+m-2)%3</line-7>
<line-8> if ans:</line-8>
<line-9> res+="MasterChef\n"</line-9>
<line-10> else:</line-10>
<line-12>print(res)</l... | {"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-11> res+=\"Football\\n\"</line-11>", "lines": [2, 11]}
#### 0 |
<line-1>def dfs(ind,m,n,k):</line-1>
<line-3> return [""]</line-3>
<line-4> else:</line-4>
<line-5> temp = dfs(ind+1,m,n,k)</line-5>
<line-6> ans = []</line-6>
<line-7> if(len(temp)<k):</line-7>
<line-8> for i in temp:</line-8>
<line-9> for j in range(97,97+n):</line-9>
<line-10> ans += [chr(j)+i]</line-10... | {"code": "<line-2> if(ind == m):</line-2>\n<line-40>w.sort()</line-40>", "lines": [2, 40]}
#### 0 |
<line-1>while(True):</line-1>
<line-2> </line-2>
<line-4></line-4>
<line-5> if(n==0 and m==0 and x==0): </line-5>
<line-6> break</line-6>
<line-7> </line-7>
<line-8> </line-8>
<line-9> money=0</line-9>
<line-10> for i in range(n):</line-10>
<line-11> </line-11>
<line-13> print(money) </line-13> | {"code": "<line-3> n, m, x = map(int, input().split())</line-3>\n<line-12> money=money + (x+m*i)//n </line-12>", "lines": [3, 12]}
#### 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> a.sort()</line-5>
<line-6> b.sort()</line-6>
<line-7> s=0</line-7>
<line-8> for i in range(n):</line-8>
<line-10> print(s)</line-10> | {"code": "<line-2> n=int(input())</line-2>\n<line-9> s+=min(a[i],b[i])</line-9>", "lines": [2, 9]}
#### 0 |
<line-1>import sys</line-1>
<line-3></line-3>
<line-4>memo = {}</line-4>
<line-5>def recurse(arr, T1, T2, k, i):</line-5>
<line-6> if T1 >= k and T2 >= k:</line-6>
<line-7> return i</line-7>
<line-8></line-8>
<line-9> if i >= len(arr):</line-9>
<line-10> return float('inf')</line-10>
<line-11></line-11>
<line-12> if ... | {"code": "<line-2>sys.setrecursionlimit(100000)</line-2>\n<line-31> else:</line-31>", "lines": [2, 31]}
#### 0 |
<line-1># fast io</line-1>
<line-3>def fop(s): sys.stdout.write(str(s)+'\n')</line-3>
<line-4>def fip(): return sys.stdin.readline()</line-4>
<line-5>fintinp = lambda : int(fip()) </line-5>
<line-6>def flistinp(func= int): return list(map(func,fip().split())) </line-6>
<line-7>def fnsepline(n,func=str): return [func(fi... | {"code": "<line-2>import sys</line-2>\n<line-31> nums.add(qn)</line-31>", "lines": [2, 31]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3>for _ in range(n):</line-3>
<line-4> a=int(input())</line-4>
<line-5> if(a%2==0):</line-5>
<line-6> f=(a//2)-1</line-6>
<line-7> s=a-f</line-7>
<line-8> else:</line-8>
<line-9> f=(a//2)</line-9>
<line-11> print(f,s)</line-11> | {"code": "<line-2>n=int(input())</line-2>\n<line-10> s=a-f</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>import math</line-1>
<line-2></line-2>
<line-3></line-3>
<line-5></line-5>
<line-6>for _ in range(t):</line-6>
<line-7> n, m = list(map(int, input().strip().split()))</line-7>
<line-8> a = []</line-8>
<line-9> v = [-1] * 4</line-9>
<line-10></line-10>
<line-11> for i in range(n):</line-11>
<line-12> a.append(i... | {"code": "<line-4>t = int(input().strip())</line-4>\n<line-42> else:</line-42>", "lines": [4, 42]}
#### 0 |
<line-1>for _ in range(int(input().strip())):</line-1>
<line-3> lst = []</line-3>
<line-4> for i in range(n):</line-4>
<line-5> lst.append(i+1)</line-5>
<line-6> lst.append(1)</line-6>
<line-7> #print(lst)</line-7>
<line-8> for i in range(n):</line-8>
<line-9> print(''.join(str(e) for e... | {"code": "<line-2> n = int(input().strip())</line-2>\n<line-10> for x in range(n):</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>test = int(input())</line-1>
<line-3> n, m = map(int, input().split())</line-3>
<line-4> indexArray = list(map(int, input().split()))</line-4>
<line-5> mini = min(indexArray)</line-5>
<line-6> maxi = max(indexArray)</line-6>
<line-7> result = n*[0]</line-7>
<line-8> for i in range(n):</line-8>
<line-9> result[... | {"code": "<line-2>for _ in range(test):</line-2>\n<line-10> print(result[i], end=\" \")</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>from bisect import *</line-1>
<line-3> n,k = list(map(int,input().split()))</line-3>
<line-4> arr = list(map(int,input().split()))</line-4>
<line-5> arr.sort()</line-5>
<line-6> t = 1</line-6>
<line-7> result = 0</line-7>
<line-8> y = 0</line-8>
<line-9> while y < n:</line-9>
<line-10> if arr[y]<t:</line-10>
<... | {"code": "<line-2>for x in range(eval(input())):</line-2>\n<line-21> t = t*2</line-21>", "lines": [2, 21]}
#### 0 |
<line-1>for i in range(int(input())):</line-1>
<line-3> s=0</line-3>
<line-4> for i in range(n):</line-4>
<line-5> a,b,c=map(int,input().split())</line-5>
<line-6> d=(c/100)*a</line-6>
<line-7> e=a+d</line-7>
<line-8> f=e-((c/100)*e)</line-8>
<line-9> g=a-f</line-9>
<line-10> h=b*g</line-10>
<line-12> print(s)</l... | {"code": "<line-2> n=int(input())</line-2>\n<line-11> s=s+h</line-11>", "lines": [2, 11]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3>from math import ceil</line-3>
<line-4></line-4>
<line-5>mod = 1000000007</line-5>
<line-6>t = int(stdin.readline())</line-6>
<line-7>for _ in range(t):</line-7>
<line-8> m,n = list(map(int,input().split()))</line-8>
<line-9> if m < n:</line-9>
<line-10> m,n =... | {"code": "<line-2>from sys import stdin,stdout,setrecursionlimit</line-2>\n<line-19> # ans = (m*(m+1)*(2*m*n + 4*n + 2 - m*m - m)//12)</line-19>", "lines": [2, 19]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3> d=dict()</line-3>
<line-4> ls=[]</line-4>
<line-5> for i in range(int(input())):</line-5>
<line-6> ls=list(map(int,input().split()))</line-6>
<line-7> if ls[0] in d:</line-7>
<line-8> d[ls[0]]=max(ls[1],d[ls[0]])</line-8>
<line-9> else:</line-9>
<line-10> d[ls[0]]=... | {"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-17> # print(kd)</line-17>", "lines": [2, 17]}
#### 0 |
<line-1>t=int(input())</line-1>
<line-3> xyz = input().strip()</line-3>
<line-4> </line-4>
<line-5> string = 0</line-5>
<line-6></line-6>
<line-7> for i in range(len(xyz)//2):</line-7>
<line-9> </line-9>
<line-10> print(string)</line-10> | {"code": "<line-2>for _ in range(t):</line-2>\n<line-8> string = string + (abs(ord(xyz[i])-ord(xyz[len(xyz)-i-1])))</line-8>", "lines": [2, 8]}
#### 0 |
<line-1>t=int(input())</line-1>
<line-3>for i in range(t):</line-3>
<line-4> N=int(input())</line-4>
<line-5> a=list(map(int,input().split())) </line-5>
<line-6> rev=a[::-1] </line-6>
<line-7> dup=set(a) </line-7>
<line-8> if rev== a and list(dup) ==x: </line-8>
<line-9> print("yes")</line-9>
<line-11> print("no")... | {"code": "<line-2>x=[1,2,3,4,5,6,7]</line-2>\n<line-10> else:</line-10>", "lines": [2, 10]}
#### 0 |
<line-1>l= []</line-1>
<line-3> l.append(2**i)</line-3>
<line-4>T = int(input())</line-4>
<line-5></line-5>
<line-6>flag = 0</line-6>
<line-7>for t in range(T):</line-7>
<line-8> L,R = [int(i) for i in input().split()]</line-8>
<line-9> bL = bin(L)</line-9>
<line-10> lL = len(bL)-2</line-10>
<line-11> index = 1</line-1... | {"code": "<line-2>for i in range(62):</line-2>\n<line-26># 4378578345 584758454958</line-26>", "lines": [2, 26]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3>n = 201</line-3>
<line-4>v = [0 for i in range(n + 1)] </line-4>
<line-5></line-5>
<line-6>def gen():</line-6>
<line-7> for i in range(1, n + 1): </line-7>
<line-8> v[i] = i </line-8>
<line-9> </line-9>
<line-10> countDivision = [0 for i in range(n + 1)] </... | {"code": "<line-2>import sys</line-2>\n<line-37>except:</line-37>", "lines": [2, 37]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3> n = int(input())</line-3>
<line-4> k = n//4</line-4>
<line-5> # a,b,c = map(int,input().split())</line-5>
<line-6> a = sorted(map(int,input().split()))</line-6>
<line-7> a60 = (a[k-1],a[k])</line-7>
<line-8> a75 = (a[2*k-1],a[2*k])</line-8>
<line-9> a90 = (a[3*k-1],a[3*k]... | {"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-12> else :</line-12>", "lines": [2, 12]}
#### 0 |
<line-1># cook your dish here</line-1>
<line-3>for k in range(0,T):</line-3>
<line-4> N=int(input())</line-4>
<line-5> matrix=[]</line-5>
<line-6> for i in range(0,N):</line-6>
<line-7> a=list(map(int, input().split()))</line-7>
<line-8> matrix.append(a)</line-8>
<line-9> max_trace = []</line-9>
<line-10> for i in ra... | {"code": "<line-2>T=int(input())</line-2>\n<line-17> max_trace.append(trace2)</line-17>", "lines": [2, 17]}
#### 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.