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 = (start+divs*M)%M</line-9>
<line-10> if(r == 0 or (r + (lim - (start + divs*M)) >= M)):</line-10>
<line-11> divs += 1</line-11>
<line-12> cmon = num - divs</line-12>
<line-13> if(e % 2 == 0):</line-13>
<line-14> count += cmon*((e+2)//2)</line-14>
<line-15> else:</line-15>
<line-16> count += cmon*(e//2 + 1)</line-16>
<line-17> perm = (perm * pow((e + 3)//2,cmon ,998244353))%998244353</line-17>
<line-18> e += 1</line-18>
<line-19> if(start == 1):</line-19>
<line-21> print(count,perm)</line-21>
|
{"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):</line-12>
<line-13> tree[i] = []</line-13>
<line-14> i += 1</line-14>
<line-15>s = []</line-15>
<line-16>for elem in tree:</line-16>
<line-17> if not tree[elem]:</line-17>
<line-19>print(' '.join(s))</line-19>
|
{"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> cnta = dict()</line-9>
<line-10> cnta.setdefault(0)</line-10>
<line-11> cntb = dict()</line-11>
<line-12> cntb.setdefault(0)</line-12>
<line-13> for i in a:</line-13>
<line-14> cnta[i] = gt(cnta.get(i)) + 1</line-14>
<line-15> asum = 0</line-15>
<line-16> bsum = sum(a)</line-16>
<line-17> ans = 0</line-17>
<line-18> for i in range(n-1):</line-18>
<line-19> asum += a[i]</line-19>
<line-20> bsum -= a[i]</line-20>
<line-21> cnta[a[i]] = gt(cnta.get(a[i])) - 1</line-21>
<line-22> cntb[a[i]] = gt(cntb.get(a[i])) + 1</line-22>
<line-23> ans += gt(cnta.get(bsum-asum))</line-23>
<line-25> print(ans)</line-25>
|
{"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>
<line-10></line-10>
<line-11>def get_ints(): </line-11>
<line-12> return map(int, sys.stdin.readline().strip().split()) </line-12>
<line-13>ans = []</line-13>
<line-14>test = int(input())</line-14>
<line-15>for i in range(test):</line-15>
<line-16> n,q = get_ints()</line-16>
<line-17> #ans = []</line-17>
<line-18> n = int(n)</line-18>
<line-19> q = int(q)</line-19>
<line-20> patterns=[]</line-20>
<line-21> for j in range(n):</line-21>
<line-22> s = get_string()</line-22>
<line-23> patterns.append(s)</line-23>
<line-24> for j in range(q):</line-24>
<line-25> word = get_string()</line-25>
<line-26> ans.append(closeMatches(patterns, word))</line-26>
<line-28> sys.stdout.write(j+"\n") </line-28>
|
{"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-9>
<line-10> else:</line-10>
<line-11> splits=[len(list(x))+1 for num,x in groupby(gcds) if num==0]</line-11>
<line-12> # print(splits)</line-12>
<line-13> if gcds[0]==gcds[-1]==0:</line-13>
<line-14> splits[0] += splits[-1]-1</line-14>
<line-15> splits = splits[:-1]</line-15>
<line-16> return splits</line-16>
<line-17></line-17>
<line-18>for _ in range(int(input())):</line-18>
<line-19> N=int(input())</line-19>
<line-20> A=[int(x) for x in input().split()]</line-20>
<line-21> split = gcd_split(A)</line-21>
<line-22> # print(split)</line-22>
<line-23> </line-23>
<line-24> res=[]</line-24>
<line-25> if split!=-1:</line-25>
<line-26> for K in range(2,N+1):</line-26>
<line-27> temp=(x for x in split if x>=K)</line-27>
<line-28> ins = sum([(x//(K-1)-1 if x%(K-1)==0 else x//(K-1)) for x in temp])</line-28>
<line-29> if ins==0:</line-29>
<line-30> break</line-30>
<line-31> else:</line-31>
<line-32> res.append(ins)</line-32>
<line-33> else:</line-33>
<line-34> for K in range(2,N+1):</line-34>
<line-35> ins = N//(K-1)+(N%(K-1)>0)</line-35>
<line-36> if ins==0:</line-36>
<line-37> break</line-37>
<line-38> else:</line-38>
<line-39> res.append(ins)</line-39>
<line-40> </line-40>
<line-42> print(*res)</line-42>
|
{"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] += lazy[si];</line-9>
<line-10> lazy[si * 2 + 2] += lazy[si];</line-10>
<line-11> lazy[si] = 0;</line-11>
<line-12> </line-12>
<line-13> if (ss > se or ss > ue or se < us) :</line-13>
<line-14> return; </line-14>
<line-15> </line-15>
<line-16> if (ss >= us and se <= ue) :</line-16>
<line-17> tree[si] += diff;</line-17>
<line-18> if (ss != se) :</line-18>
<line-19> lazy[si * 2 + 1] += diff;</line-19>
<line-20> lazy[si * 2 + 2] += diff;</line-20>
<line-21> return; </line-21>
<line-22> </line-22>
<line-23> mid = (ss + se) // 2;</line-23>
<line-24> updateRangeUtil(si * 2 + 1, ss,mid, us, ue, diff);</line-24>
<line-25> updateRangeUtil(si * 2 + 2, mid + 1,se, us, ue, diff);</line-25>
<line-26> tree[si] = min(tree[si * 2 + 1],tree[si * 2 + 2]); </line-26>
<line-27> </line-27>
<line-28>def updateRange(n, us, ue, diff) : </line-28>
<line-29> updateRangeUtil(0, 0, n - 1, us, ue, diff); </line-29>
<line-30> </line-30>
<line-31>def getSumUtil(ss, se, qs, qe, si) :</line-31>
<line-32> if (lazy[si] != 0) :</line-32>
<line-33> tree[si] += lazy[si];</line-33>
<line-34> if (ss != se) :</line-34>
<line-35> lazy[si * 2 + 1] += lazy[si];</line-35>
<line-36> lazy[si * 2 + 2] += lazy[si];</line-36>
<line-37> lazy[si] = 0;</line-37>
<line-38> </line-38>
<line-39> if (ss > se or ss > qe or se < qs) :</line-39>
<line-40> return 10e9; </line-40>
<line-41> </line-41>
<line-42> if (ss >= qs and se <= qe) :</line-42>
<line-43> return tree[si]; </line-43>
<line-44> </line-44>
<line-45> mid = (ss + se) // 2; </line-45>
<line-46> return min(getSumUtil(ss, mid, qs, qe, 2 * si + 1),getSumUtil(mid + 1, se, qs, qe, 2 * si + 2)); </line-46>
<line-47> </line-47>
<line-48>def getSum(n, qs, qe) : </line-48>
<line-49> if (qs < 0 or qe > n - 1 or qs > qe) :</line-49>
<line-50> #print("Invalid Input", end = "");</line-50>
<line-51> return -1;</line-51>
<line-52> </line-52>
<line-53> return getSumUtil(0, n - 1, qs, qe, 0); </line-53>
<line-54> </line-54>
<line-55>def constructSTUtil(arr, ss, se, si) : </line-55>
<line-56> if (ss > se) :</line-56>
<line-57> return;</line-57>
<line-58> if (ss == se) :</line-58>
<line-59> tree[si] = arr[ss];</line-59>
<line-60> return; </line-60>
<line-61> mid = (ss + se) // 2;</line-61>
<line-62> constructSTUtil(arr, ss, mid, si * 2 + 1);</line-62>
<line-63> constructSTUtil(arr, mid + 1, se, si * 2 + 2);</line-63>
<line-64> tree[si] = min(tree[si * 2 + 1], tree[si * 2 + 2]); </line-64>
<line-65> </line-65>
<line-66>def constructST(arr, n) :</line-66>
<line-67> constructSTUtil(arr, 0, n - 1, 0); </line-67>
<line-68> </line-68>
<line-69># Driver code </line-69>
<line-70>for _ in range(int(input())):</line-70>
<line-71> tree = [0] * MAX; </line-71>
<line-72> lazy = [0] * MAX;</line-72>
<line-73> n=int(input());</line-73>
<line-74> y=int(input());</line-74>
<line-75> arr=[1]*n;</line-75>
<line-76> constructST(arr, n);</line-76>
<line-77> for xyz in range(y):</line-77>
<line-78> l,r=list(map(int,input().split()));</line-78>
<line-80> print((getSum(n, 0, n-1)%1000000007));</line-80>
|
{"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>
<line-11> else:</line-11>
<line-12> u=0</line-12>
<line-13> if 'D' in d1:</line-13>
<line-14> d=d1['D']</line-14>
<line-15> else:</line-15>
<line-16> d=0</line-16>
<line-17> if 'R' in d1:</line-17>
<line-18> r=d1['R']</line-18>
<line-19> else:</line-19>
<line-20> r=0</line-20>
<line-21> if 'L' in d1:</line-21>
<line-22> l=d1['L']</line-22>
<line-23> else:</line-23>
<line-24> l=0</line-24>
<line-25> x=0</line-25>
<line-26> y=0</line-26>
<line-27> if l==r:</line-27>
<line-28> x=0</line-28>
<line-29> elif l>r:</line-29>
<line-30> x=-(l-r)</line-30>
<line-31> elif r>l:</line-31>
<line-32> x=r-l</line-32>
<line-33> if u==d:</line-33>
<line-34> y=0</line-34>
<line-35> elif d>u:</line-35>
<line-36> y=-(d-u)</line-36>
<line-37> elif u>d:</line-37>
<line-38> y=u-d</line-38>
<line-39> # print(x,y)</line-39>
<line-40> if x==0 and y==0:</line-40>
<line-41> print(n)</line-41>
<line-42> continue</line-42>
<line-43> </line-43>
<line-44> print(n-(abs(x)+abs(y)))</line-44>
<line-46> pass</line-46>
|
{"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</line-8>
<line-10> print(ans)</line-10>
|
{"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 input().split()]</line-10>
<line-11> b = b + [a]</line-11>
<line-12> for j in range(n):</line-12>
<line-13> su = 0</line-13>
<line-14> for x in range(k):</line-14>
<line-15> su = su +b[j][x]</line-15>
<line-16> if su > sumax:</line-16>
<line-17> sumax = su</line-17>
<line-18> for a in range(1, m-k+1):</line-18>
<line-19> su = su - b[j][a-1] +b[j][k+a-1]</line-19>
<line-20> if su > sumax:</line-20>
<line-21> sumax = su</line-21>
<line-22> for j in range(m):</line-22>
<line-23> su = 0</line-23>
<line-24> for x in range(k):</line-24>
<line-25> su = su + b[x][j]</line-25>
<line-26> if su > sumax:</line-26>
<line-27> sumax = su</line-27>
<line-28> for a in range(1, n-k+1):</line-28>
<line-29> su = su - b[a-1][j] + b[a+k-1][j]</line-29>
<line-30> if su > sumax:</line-30>
<line-32> print(sumax)</line-32>
<line-33> </line-33>
<line-34> </line-34>
|
{"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, 7460, 7547, 7789, 8220, 8503, 8730, 8942, 9882, 10200, 10587, 10898, 11289, 11614, 11876, 12034, 12931, 13394, 14047, 14534, 14901, 15166, 15688, 15972, 16619, 17355, 17932, 18845, 19071, 19631, 19670, 20722, 21948, 22526, 23291, 23564, 23881, 24596, 24768, 25631, 26037, 26255, 27219, 28566, 29775, 30094, 31311, 32217, 32620, 32912, 34277, 35330, 35469, 36204, 38647, 39160, 39223, 39943, 40800, 41882, 42549, 43394, 44879, 45907, 47421, 47512, 48297, 50064, 50902, 52703, 52764, 54674, 55307, 56663, 58425, 59028, 60576, 60995, 62205, 63129, 64488, 66999, 67189, 68512, 68984, 70170, 71365, 75618, 76793, 77571, 79047, 80309, 83179, 84345, 87016, 87874, 88566, 89607, 91718, 92887, 93839, 95103, 97974, 99583, 101337, 102040, 103626, 104554, 106947, 107205, 108622, 111837, 112800, 113949, 114642, 116291, 117177, 121238, 125492, 126637, 129170, 130986, 131697, 134414, 134699, 136635, 139964, 143294, 144874, 146605, 147499, 148593, 150146, 152318, 152834, 156836, 157150, 160782, 163010, 163502, 164868, 170984, 172922, 174171, 177853, 180249, 182071, 185403, 188314, 190726, 190894, 193477, 196832, 199646, 201472, 202699, 205325, 206811, 208748, 214435, 217182, 218011, 225350, 226682, 229163, 231694, 233570, 234619, 235152, 238727, 240814, 247822, 253857, 254305, 260433, 261620, 262317, 266550, 269195, 271511, 274250, 274753, 280180, 284289, 290005, 293034, 295037, 296506, 298414, 302663, 305782, 308841, 317739, 321173, 323672, 324806, 329181, 331018, 336642, 340901, 343359, 347001, 348110, 348899, 362520, 366119, 368235, 370696, 371542, 377450, 380366, 382012, 382245, 384957, 387479, 390518, 391462, 399174, 403920, 411847, 412671, 416880, 417991, 422453, 433973, 434773, 440619, 441148, 443779, 446065, 456289, 458426, 462402, 470670, 474668, 475800, 481476, 482868, 498435, 501084, 508193, 511258, 514644, 524307, 527197, 535369, 536903, 538331, 542020, 555275, 564016, 566106, 567408, 572027, 582478, 583407, 585871, 593257, 596837, 598426, 599784, 607794, 610404, 621790, 624574, 627703, 633442, 640047, 648858, 659179, 663558, 667337, 672815, 673522, 686013, 691686, 693169, 694279, 696931, 703162, 711364, 723249, 729860, 731008, 739958, 740124, 744403, 753293, 768134, 770113, 773912, 779917, 787407, 794900, 797567, 800658, 813959, 814414, 827123, 829129, 839728, 847430, 850695, 851627, 862856, 880796, 884725, 889285, 896691, 897160, 904970, 909586, 915254, 922852, 935695, 937825, 938876, 959937, 961353, 964857, 970227, 976356, 980581, 986799, 1008106, 1009835, 1016906, 1020306, 1028612, 1033242, 1036012, 1042818, 1050881, 1051783, 1060844, 1086402, 1092043, 1096162, 1103456, 1123464, 1134057, 1136410, 1144080, 1145152, 1147774, 1156687, 1164278, 1166255, 1174751, 1187057, 1195316, 1201262, 1207345, 1212654, 1218610, 1225019, 1227887, 1240777, 1247071, 1258235, 1265462, 1274089, 1279515, 1288613, 1298980, 1306248, 1326918, 1333809, 1341190, 1343482, 1367480, 1372734, 1374779, 1384952, 1388147, 1394240, 1395346, 1409612, 1417336, 1418943, 1423296, 1446209, 1448494, 1462599, 1468933, 1474698, 1496110, 1502217, 1508335, 1513944, 1549693, 1552361, 1558304, 1567726, 1578307, 1593543, 1594370, 1596552, 1604567, 1611655, 1638201, 1657904, 1661549, 1668344, 1684653, 1700848, 1704061, 1712218, 1733148, 1744400, 1756959, 1766186, 1770297, 1774640, 1783782, 1790804, 1797186, 1819167, 1822095, 1835790, 1838687, 1840248, 1843265, 1858487, 1871701, 1874449, 1907155, 1933219, 1941873, 1953108, 1960964, 1970086, 1995385, 2005526, 2006388, 2012407, 2022419, 2027444, 2032071, 2046348, 2049691, 2081218, 2085045, 2107005, 2111011, 2117147, 2128804, 2130734, 2133565, 2163069, 2165643, 2183398, 2186582, 2200866, 2228833, 2238757, 2260397, 2287997, 2303690, 2306210, 2311079, 2319657, 2347177, 2348345, 2364629, 2380657, 2386691, 2392303, 2413369, 2429645, 2435861, 2445907, 2454603, 2461156, 2481207, 2493269, 2496558, 2526270, 2549274, 2559084, 2565601, 2571993, 2574622, 2589585, 2602736, 2606052, 2635578, 2636056, 2649712, 2667175, 2697913, 2705598, 2716472, 2726625, 2740640, 2748032, 2769317, 2773637, 2777175, 2796454, 2808141, 2818050, 2822209, 2828335, 2853048, 2858954, 2879003, 2898699, 2906226, 2928135, 2935468, 2950167, 2955230, 2959204, 2981209, 2999992, 3013106, 3016185, 3016728, 3033485, 3041287, 3046405, 3085842, 3097363, 3129048, 3137101, 3148974, 3153026, 3165425, 3172200, 3187649, 3208795, 3228028, 3239797, 3265353, 3281537, 3310390, 3330139, 3349916, 3351744, 3360950, 3366598, 3375910, 3382995, 3411775, 3438201, 3447140, 3453811, 3471520, 3485127, 3522748, 3569412, 3575690, 3578298, 3585562, 3593337, 3624737, 3626198, 3651501, 3667524, 3674434, 3675907, 3738616, 3754186, 3765841, 3786330, 3807381, 3818043, 3829535, 3831874, 3838373, 3862508, 3910613, 3942689, 3950184, 3954465, 3978469, 3992767, 4014701, 4032219, 4033924, 4065368, 4078004, 4089606, 4101646, 4119004, 4155098, 4166329, 4176904, 4182945, 4197748, 4211593, 4218728, 4253237, 4275441, 4288635, 4298689, 4301972, 4329866, 4357640, 4392330, 4403327, 4415543, 4434657, 4454780, 4460817, 4467239, 4489541, 4518764, 4526891, 4541320, 4560957, 4568090, 4582032, 4609341, 4631837, 4683082, 4688874, 4714962, 4728230, 4733954, 4744119, 4797763, 4819301, 4823437, 4850997, 4865482, 4886981, 4907820, 4931122, 4957782, 5005971, 5014678, 5031077, 5054902, 5059300, 5088659, 5119815, 5135680, 5153376, 5210102, 5213548, 5253584]</line-1>
<line-3> n=int(input())</line-3>
<line-4> sum=0</line-4>
<line-5> for i in range(n):</line-5>
<line-6> print(lst[i],end=" ")</line-6>
<line-7> sum+=lst[i]</line-7>
<line-9> print(sum)</line-9>
|
{"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 inl():</line-11>
<line-12> return list(map(int, input().split()))</line-12>
<line-13></line-13>
<line-14>MOD = 10**9+7</line-14>
<line-15>INF = inf = 10**18+5</line-15>
<line-16></line-16>
<line-17>n = inn()</line-17>
<line-18>a = inl()</line-18>
<line-19>k = []</line-19>
<line-20>for q in range(inn()):</line-20>
<line-21> k.append(inn())</line-21>
<line-22></line-22>
<line-23>gcdn = reduce(math.gcd, a)</line-23>
<line-24>lim = max(k)+1</line-24>
<line-25>ans = defaultdict(int)</line-25>
<line-26>ans[1] = 0</line-26>
<line-27></line-27>
<line-28>for i in range(n):</line-28>
<line-29> cur_gcd = a[i]</line-29>
<line-30> for j in range(i, n):</line-30>
<line-31> cur_gcd = math.gcd(cur_gcd, a[j])</line-31>
<line-32> if cur_gcd==1 or cur_gcd//gcdn==1:</line-32>
<line-33> ans[cur_gcd] += (n-j)</line-33>
<line-34> break</line-34>
<line-35> ans[cur_gcd] += 1</line-35>
<line-36># print(ans)</line-36>
<line-37></line-37>
<line-38>keys = list(ans.keys())</line-38>
<line-39>ans1 = [0]*lim</line-39>
<line-40>for i in keys:</line-40>
<line-41> for j in range(i, lim, i):</line-41>
<line-42> ans1[j] += ans[i]</line-42>
<line-43># print(ans1[:10])</line-43>
<line-45> print(ans1[i])</line-45>
|
{"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-11>
<line-12> return "no"</line-12>
<line-13></line-13>
<line-14> return "yes"</line-14>
<line-15></line-15>
<line-16>t = int(input())</line-16>
<line-17></line-17>
<line-18>for _ in range(t):</line-18>
<line-20> print(checkValidity(s))</line-20>
|
{"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>
<line-10> if ele[0]<po:</line-10>
<line-11> count+=1 </line-11>
<line-12> if ele[1]-1>=0 and (ele[1]-1,ele[2]) not in visited:</line-12>
<line-13> if l[ele[1]-1][ele[2]]<po:</line-13>
<line-14> stack.add((l[ele[1]-1][ele[2]],ele[1]-1,ele[2]))</line-14>
<line-15> if ele[1]+1<r and (ele[1]+1,ele[2]) not in visited:</line-15>
<line-16> if l[ele[1]+1][ele[2]]<po:</line-16>
<line-17> stack.add((l[ele[1]+1][ele[2]],ele[1]+1,ele[2]))</line-17>
<line-18> if ele[2]-1>=0 and (ele[1],ele[2]-1) not in visited:</line-18>
<line-19> if l[ele[1]][ele[2]-1]<po:</line-19>
<line-20> stack.add((l[ele[1]][ele[2]-1],ele[1],ele[2]-1))</line-20>
<line-21> if ele[2]+1<c and (ele[1],ele[2]+1) not in visited:</line-21>
<line-22> if l[ele[1]][ele[2]+1]<po:</line-22>
<line-23> stack.add((l[ele[1]][ele[2]+1],ele[1],ele[2]+1))</line-23>
<line-24> return count</line-24>
<line-25>for _ in range(int(input())):</line-25>
<line-26> r,c,q=map(int,input().split())</line-26>
<line-27> l=[]</line-27>
<line-28> for i in range(r):</line-28>
<line-29> a=list(map(int,input().split()))</line-29>
<line-30> l.append(a)</line-30>
<line-31> for i in range(q):</line-31>
<line-33> print(solve(l,r,c,row-1,col-1,po))</line-33>
|
{"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>
<line-12> totalCal += d['T']</line-12>
<line-13> if s[i] == 'M':</line-13>
<line-14> totalCal += d['M']</line-14>
<line-15> if s[i] == 'B':</line-15>
<line-16> totalCal += d['B']</line-16>
<line-17> if s[i] == 'C':</line-17>
<line-18> totalCal += d['C']</line-18>
<line-19></line-19>
<line-20>R = totalCal // 50</line-20>
<line-21>Rm = totalCal % 50</line-21>
<line-22>C = Rm // 5</line-22>
<line-23>Cm = Rm % 5</line-23>
<line-24>x = totalCal - (R * 50 + C * 5)</line-24>
<line-25># print(totalCal - R * 50 + C * 5)</line-25>
<line-26>W = int(x * 4 * 0.5)</line-26>
<line-27># print(R * 50 + C * 5 + W * 0.5)</line-27>
<line-28>print(R)</line-28>
<line-30>print(W)</line-30>
|
{"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> else:</line-10>
<line-11> a=2**(n-i)</line-11>
<line-12> b=1</line-12>
<line-13> d=int(i-1)</line-13>
<line-14> e=1</line-14>
<line-15> h=1</line-15>
<line-16> g=1</line-16>
<line-17> #b=f(i-1)/f(k-1)/f(i-k)</line-17>
<line-18> if(k-1>i-k):</line-18>
<line-19> for z in range(i-k):</line-19>
<line-20> b=b*d</line-20>
<line-21> d=d-1</line-21>
<line-22> e=e*h</line-22>
<line-23> h=h+1</line-23>
<line-24> b=b/e</line-24>
<line-25> else:</line-25>
<line-26> for z in range(k-1):</line-26>
<line-27> b=b*d</line-27>
<line-28> d=d-1</line-28>
<line-29> e=e*g</line-29>
<line-30> g=g+1</line-30>
<line-31> b=b/e</line-31>
<line-32> </line-32>
<line-33> </line-33>
<line-34> </line-34>
<line-35> c=a*b</line-35>
<line-37> print(c)</line-37>
|
{"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-11> for i in range(1, len(index)):</line-11>
<line-12> diff.append(index[i] - index[i - 1] - 1)</line-12>
<line-13> diff.sort()</line-13>
<line-14> fmin = cnt ** 2</line-14>
<line-15> oper = cnt ; moves = cnt</line-15>
<line-16> for i in diff:</line-16>
<line-17> moves += i</line-17>
<line-18> oper -= 1</line-18>
<line-20> print(fmin)</line-20>
|
{"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> if(i!=0):</line-12>
<line-13> if(s[i]==s[i-1]):</line-13>
<line-14> t=t-1</line-14>
<line-15> else:</line-15>
<line-16> t=t+1</line-16>
<line-17> y=t</line-17>
<line-18> for j in range(i,n):</line-18>
<line-19> t=y</line-19>
<line-20> try:</line-20>
<line-21> if(s[j]==s[j+1]):</line-21>
<line-22> t=t-1</line-22>
<line-23> else:</line-23>
<line-24> t=t+1</line-24>
<line-25> except:</line-25>
<line-26> pass</line-26>
<line-28> print(ans)</line-28>
|
{"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-10>
<line-11> elif(b not in l):</line-11>
<line-12> l.append(b)</line-12>
<line-13></line-13>
<line-14></line-14>
<line-15>a.sort()</line-15>
<line-17>stdout.write(''.join([str(id) + '\n' for id in a]))</line-17>
<line-18> </line-18>
|
{"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>
<line-12> p=p*a%1000000007</line-12>
<line-13> l[i]=p</line-13>
<line-15> print(l[i])</line-15>
|
{"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) * v2</line-8>
<line-9> print('YES' if ok else 'NO')</line-9>
<line-10> </line-10>
<line-12> pass</line-12>
|
{"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>
<line-13></line-13>
<line-14> if p%2==1:</line-14>
<line-15> if l=='H':</line-15>
<line-16> lang='H'</line-16>
<line-17> else:</line-17>
<line-18> lang='E'</line-18>
<line-19> elif p%2==0:</line-19>
<line-20> if l=='H':</line-20>
<line-21> lang='E'</line-21>
<line-22> else:</line-22>
<line-24> print(p,lang)</line-24>
|
{"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>
<line-12> count+=max(0,ele-k)</line-12>
<line-13> return count </line-13>
<line-14></line-14>
<line-15>for _ in range(int(stdin.readline())):</line-15>
<line-16> s=stdin.readline().strip()</line-16>
<line-17> d=Counter(s)</line-17>
<line-18> arr=sorted(list(d.values()),reverse=True)</line-18>
<line-19> l=len(s)</line-19>
<line-20> val=[1]</line-20>
<line-21> for i in range(2,27):</line-21>
<line-22> if l%i==0:</line-22>
<line-23> val.append(i)</line-23>
<line-24></line-24>
<line-25> ans = float('inf')</line-25>
<line-26> for ele in val:</line-26>
<line-27> x = func(arr,ele,l)</line-27>
<line-28> if x < ans:</line-28>
<line-30> print(ans) </line-30>
|
{"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> elif t1==t2:</line-10>
<line-11> print("Draw")</line-11>
<line-13> pass</line-13>
|
{"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.count("L")</line-9>
<line-10> desty = a.count("U")-a.count("D")</line-10>
<line-11> #print(destx, desty)</line-11>
<line-12> </line-12>
<line-13> if (destx<0 or destx>m) or (desty<0 or desty>n):</line-13>
<line-14> result = "DANGER"</line-14>
<line-15> elif destx == x and desty == y:</line-15>
<line-16> result = "REACHED"</line-16>
<line-17> else:</line-17>
<line-18> result = "SOMEWHERE"</line-18>
<line-19> </line-19>
<line-20> print(result)</line-20>
<line-22> pass</line-22>
|
{"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</line-7>
<line-8> return dfs(d+1,0,s//10) if s % 10 == LMap[R[-d-1]] else False</line-8>
<line-9> if i < LW and d >= len(W[i]): return dfs(d,i+1,c)</line-9>
<line-10> ch = AW[i][-d-1]</line-10>
<line-11> if ch in LMap: return dfs(d,i+1,c)</line-11>
<line-12> for x in range((ch in F), 10):</line-12>
<line-13> if x not in V:</line-13>
<line-14> LMap[ch], _ = x, V.add(x)</line-14>
<line-15> if dfs(d,i+1,c): return True</line-15>
<line-16> V.remove(LMap.pop(ch))</line-16>
<line-17> return dfs(0,0,0)</line-17>
<line-18>n=int(input())</line-18>
<line-19>W=[]</line-19>
<line-20>for i in range(n):</line-20>
<line-21> W.append(str(input()))</line-21>
<line-22>R=input() </line-22>
<line-23>a=(isSolvable(W,R))</line-23>
<line-24>if a==True:</line-24>
<line-25> print("true")</line-25>
<line-27> print("false")</line-27>
|
{"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-11>
<line-13> print('NO')</line-13>
|
{"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]+=1</line-9>
<line-10> cnt[0]=(cnt[0]+1)%1000000007</line-10>
<line-11> fun(a,i,n,cnt)</line-11>
<line-12> a[i]+=1</line-12>
<line-13> a[i+1]+=1</line-13>
<line-14> a[i+2]-=1</line-14>
<line-15> else:</line-15>
<line-16> if a[i]>0 and a[i+1]>0:</line-16>
<line-17> a[i]-=1</line-17>
<line-18> a[i+1]-=1</line-18>
<line-19> a.append(1)</line-19>
<line-20> cnt[0]=(cnt[0]+1)%1000000007</line-20>
<line-21> fun(a,i,n+1,cnt)</line-21>
<line-22> a[i]+=1</line-22>
<line-23> a[i+1]+=1</line-23>
<line-24> a.pop()</line-24>
<line-25>tc=int(input())</line-25>
<line-26>for case in range(tc):</line-26>
<line-27> n=int(input())</line-27>
<line-28> a=list(map(int,input().split()))</line-28>
<line-29> cnt=[1]</line-29>
<line-31> print(cnt[0]%1000000007)</line-31>
<line-32> </line-32>
|
{"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>
<line-12> t -= 1</line-12>
<line-13> </line-13>
<line-14> </line-14>
|
{"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():</line-9>
<line-10> N, Q = RL()</line-10>
<line-11> P = RL()</line-11>
<line-12> B = RL()</line-12>
<line-13> phones = sorted(zip(P, B))</line-13>
<line-14> S = defaultdict(lambda : [])</line-14>
<line-15> </line-15>
<line-16> for p, b in phones:</line-16>
<line-17> for i in range(2**7):</line-17>
<line-18> if (i>>b) & 1:</line-18>
<line-19> S[i] += [p]</line-19>
<line-20> B = set(B)</line-20>
<line-21> I = [0] * len(B)</line-21>
<line-22></line-22>
<line-23> for _ in range(Q):</line-23>
<line-24> b, K = RL()</line-24>
<line-25> s = RL()</line-25>
<line-26> x = 0</line-26>
<line-27> for b in s:</line-27>
<line-28> x += 1<<b</line-28>
<line-29> if len(S[x]) < K:</line-29>
<line-30> print(-1)</line-30>
<line-31> else:</line-31>
<line-32> print(S[x][-K])</line-32>
<line-33> </line-33>
<line-34></line-34>
<line-35>T = 1#R()</line-35>
<line-37> solve()</line-37>
|
{"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 = int(sqrt(y))</line-13>
<line-14> count += 1</line-14>
<line-15> if(p*p>y):</line-15>
<line-16> x = p</line-16>
<line-17> y += p**2</line-17>
<line-18> else:</line-18>
<line-19> x = p+1</line-19>
<line-20> y += (p+1)**2</line-20>
<line-21> if(x<=X):</line-21>
<line-22> ans.append(count)</line-22>
<line-23> else:</line-23>
<line-24> ans.append(count-1)</line-24>
<line-25></line-25>
<line-27> print(i)</line-27>
|
{"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> c = 0</line-11>
<line-12> for i in range(len(s)):</line-12>
<line-13> for j in range(i+1, len(s)+1):</line-13>
<line-14> t = sort_str(s[i:j])</line-14>
<line-15> if t in h:</line-15>
<line-16> c += h[t]</line-16>
<line-17> h[t] += 1</line-17>
<line-18> else:</line-18>
<line-19> h[t] = 1</line-19>
<line-20> return c</line-20>
<line-21>t = int(input())</line-21>
<line-23> print(find_ana(input()))</line-23>
|
{"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>
<line-13> </line-13>
<line-14>while t:</line-14>
<line-15> n,l,a,b=list(map(int,input().split()))</line-15>
<line-16> val=list(map(int,input().split()))</line-16>
<line-17> val.sort()</line-17>
<line-18> sense=0</line-18>
<line-19> if b==a+n*l or vsense(val,a,l)<=0:</line-19>
<line-20> loc=a</line-20>
<line-21> else:</line-21>
<line-22> st=a</line-22>
<line-23> end=b-n*l</line-23>
<line-24> while st<=end:</line-24>
<line-25> m=(st+end)/2</line-25>
<line-26> chk=vsense(val,m,l)</line-26>
<line-27> if chk==0:</line-27>
<line-28> loc=m</line-28>
<line-29> break</line-29>
<line-30> elif chk<0:</line-30>
<line-31> end=m-1</line-31>
<line-32> else:</line-32>
<line-33> loc=m</line-33>
<line-34> st=m+1</line-34>
<line-35> ans=0</line-35>
<line-36> st=loc</line-36>
<line-37> for c in range(n):</line-37>
<line-38> ans+=abs(st-val[c])</line-38>
<line-39> st+=l</line-39>
<line-41> </line-41>
<line-42> t-=1</line-42>
|
{"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>
<line-14>def sum_func(x):</line-14>
<line-15> if x < 10:</line-15>
<line-16> return x</line-16>
<line-17></line-17>
<line-18> r = sum_cache.get(x)</line-18>
<line-19> if r is not None:</line-19>
<line-20> return r</line-20>
<line-21></line-21>
<line-22> xx = 0</line-22>
<line-23> while x > 0:</line-23>
<line-24> xx += x % 10</line-24>
<line-25> x /= 10</line-25>
<line-26></line-26>
<line-27> r = sum_func(xx)</line-27>
<line-28> sum_cache[x] = r</line-28>
<line-29></line-29>
<line-30> return r</line-30>
<line-31></line-31>
<line-32>def test():</line-32>
<line-33> for n in range(1):</line-33>
<line-34> print(n, sum_func(n))</line-34>
<line-35></line-35>
<line-36> print(sum_func(int(10**18 - 1)))</line-36>
<line-37></line-37>
<line-38>#~ test()</line-38>
<line-39>#~ sys.exit(1)</line-39>
<line-40></line-40>
<line-41>cycle_table = [</line-41>
<line-42> # Cycle len, markers # D_kfunc</line-42>
<line-43> [9, [1, 1, 1, 1, 1, 1, 1, 1, 1]], # 1</line-43>
<line-44> [9, [1, 1, 1, 1, 1, 1, 1, 1, 1]], # 2</line-44>
<line-45> [3, [1, 0, 0, 1, 0, 0, 1, 0, 0]], # 3</line-45>
<line-46> [9, [1, 1, 1, 1, 1, 1, 1, 1, 1]], # 4</line-46>
<line-47> [9, [1, 1, 1, 1, 1, 1, 1, 1, 1]], # 5</line-47>
<line-48> [3, [1, 0, 0, 1, 0, 0, 1, 0, 0]], # 6</line-48>
<line-49> [9, [1, 1, 1, 1, 1, 1, 1, 1, 1]], # 7</line-49>
<line-50> [9, [1, 1, 1, 1, 1, 1, 1, 1, 1]], # 8</line-50>
<line-51> [1, [1, 0, 0, 0, 0, 0, 0, 0, 0]], # 9</line-51>
<line-52>]</line-52>
<line-53></line-53>
<line-54>NUMBER = 9</line-54>
<line-55></line-55>
<line-56>def calc(A_1, D, L, R):</line-56>
<line-57> #~ print('calc ===', A_1, D, L, R)</line-57>
<line-58> A_L = A_1 + D * (L - 1)</line-58>
<line-59> A_L_kfunc = sum_func(A_L)</line-59>
<line-60> D_kfunc = sum_func(D)</line-60>
<line-61></line-61>
<line-62> #~ print(A_L, A_L_kfunc, D_kfunc)</line-62>
<line-63></line-63>
<line-64> n = R - L + 1</line-64>
<line-65></line-65>
<line-66> if D == 0:</line-66>
<line-67> return n * A_L_kfunc</line-67>
<line-68></line-68>
<line-69> cycle_len = cycle_table[D_kfunc - 1][0]</line-69>
<line-70> cycle_markers = list(cycle_table[D_kfunc - 1][1]) # copy</line-70>
<line-71> #~ print('cycle_len', cycle_len)</line-71>
<line-72></line-72>
<line-73> whole_part = n // cycle_len</line-73>
<line-74> remainder = n % cycle_len</line-74>
<line-75> #~ print('whole_part, remainder = ', whole_part, remainder)</line-75>
<line-76></line-76>
<line-77> counts = [whole_part * x for x in cycle_markers]</line-77>
<line-78> #~ print(counts)</line-78>
<line-79></line-79>
<line-80> pos = 0</line-80>
<line-81> for i in range(remainder):</line-81>
<line-82> counts[pos] += 1</line-82>
<line-83> pos = (pos + D_kfunc) % NUMBER</line-83>
<line-84></line-84>
<line-85> #~ print(counts)</line-85>
<line-86></line-86>
<line-87> r = 0</line-87>
<line-88> for i, x in enumerate(counts):</line-88>
<line-89> value = (A_L_kfunc - 1 + i) % NUMBER + 1</line-89>
<line-90> r += value * x</line-90>
<line-91></line-91>
<line-92> return r</line-92>
<line-93></line-93>
<line-94>def calc_dumb(A_1, D, L, R):</line-94>
<line-95> #~ print('dumb ===', A_1, D, L, R)</line-95>
<line-96> a = A_1 + D * (L - 1)</line-96>
<line-97></line-97>
<line-98> n = R - L + 1</line-98>
<line-99></line-99>
<line-100> r = 0</line-100>
<line-101></line-101>
<line-102> for i in range(n):</line-102>
<line-103> value = sum_func(a)</line-103>
<line-104> #~ print(a, value)</line-104>
<line-105> r += value</line-105>
<line-106> a += D</line-106>
<line-107></line-107>
<line-108> return r</line-108>
<line-109></line-109>
<line-110>def test1():</line-110>
<line-111> a1 = 1</line-111>
<line-112> L = 1</line-112>
<line-113> R = 1000</line-113>
<line-114> for d in range(100):</line-114>
<line-115> r1 = calc_dumb(a1, d, L, R)</line-115>
<line-116> r2 = calc(a1, d, L, R)</line-116>
<line-117> if r1 != r2:</line-117>
<line-118> print(a1, d, L, R, ":", r1, r2)</line-118>
<line-119></line-119>
<line-120></line-120>
<line-121>def test2():</line-121>
<line-122> a1 = 1</line-122>
<line-123> d = 9</line-123>
<line-124> L = 1</line-124>
<line-125> R = 9</line-125>
<line-126> r1 = calc_dumb(a1, d, L, R)</line-126>
<line-127> r2 = calc(a1, d, L, R)</line-127>
<line-128> print(r1, r2)</line-128>
<line-129></line-129>
<line-130>#~ test1()</line-130>
<line-131>#~ sys.exit(1)</line-131>
<line-132></line-132>
<line-133>T = int(f.readline().strip())</line-133>
<line-134></line-134>
<line-135>for case_id in range(1, T+1):</line-135>
<line-136> A_1, D, L, R = list(map(int, f.readline().strip().split()))</line-136>
<line-137></line-137>
<line-139></line-139>
<line-140> print(r)</line-140>
|
{"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[i]=-1</line-10>
<line-11> </line-11>
<line-12>while t:</line-12>
<line-13> graph=[[0 for i in range(11)]for j in range(11)]</line-13>
<line-14> v,e=list(map(int,input().split()))</line-14>
<line-15> for i in range(e):</line-15>
<line-16> x,y,w=list(map(int,input().split()))</line-16>
<line-17> graph[x][y]=w</line-17>
<line-18> graph[y][x]=w</line-18>
<line-19> x=[]</line-19>
<line-20> dist=[-1]*(v+1)</line-20>
<line-21> dist[1]=0</line-21>
<line-22> func(1,v,x,dist,graph)</line-22>
<line-23> x.sort()</line-23>
<line-24> val=x[0]</line-24>
<line-25> ans=0</line-25>
<line-26> for i in range(len(x)):</line-26>
<line-27> if val==x[i]:</line-27>
<line-28> ans+=1</line-28>
<line-30> t-=1</line-30>
|
{"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 four adjacent blocks </line-7>
<line-8> shadow=[[0 for i in range(m)]for j in range(n)]</line-8>
<line-9> for i,j in product(list(range(n)),list(range(m))):</line-9>
<line-10> if mouse[i][j]==1:</line-10>
<line-11> if i>0:</line-11>
<line-12> shadow[i-1][j]+=1</line-12>
<line-13> if j>0:</line-13>
<line-14> shadow[i][j-1]+=1</line-14>
<line-15> if i<n-1:</line-15>
<line-16> shadow[i+1][j]+=1</line-16>
<line-17> if j<m-1:</line-17>
<line-18> shadow[i][j+1]+=1</line-18>
<line-19> </line-19>
<line-20> # dp is a dictionary which contains a tuple of 3 values (i,j,0)=>we are coming at destination (i,j) from left side</line-20>
<line-21> # (i,j,1)=> we are coming at destination (i,j) from top </line-21>
<line-22> dp=defaultdict(int)</line-22>
<line-23> </line-23>
<line-24> # </line-24>
<line-25> dp[(0,0,0)]=dp[(0,0,1)]=shadow[0][0]-mouse[0][0]</line-25>
<line-26> </line-26>
<line-27> # fill only first row</line-27>
<line-28> # in first row we can only reach at (0,j) from (0,j-1,0) as we can't come from top.</line-28>
<line-29> </line-29>
<line-30> # so here we will assign count of mices which will affect current cell (shadow[0][i]) + previous result i.e,(0,j-1,0) and </line-30>
<line-31> # if mouse is in the current cell than we have to subtract it bcoz we have add it twice i.e, when we enter at this block </line-31>
<line-32> # and when we leave this block </line-32>
<line-33> for i in range(1,m):</line-33>
<line-34> dp[(0,i,0)]=dp[(0,i,1)]=shadow[0][i]-mouse[0][i]+dp[(0,i-1,0)]</line-34>
<line-35> </line-35>
<line-36> # same goes for first column</line-36>
<line-37> # we can only come at (i,0) from (i-1,0) i.e top</line-37>
<line-38> for i in range(1,n):</line-38>
<line-39> dp[(i,0,0)]=dp[(i,0,1)]=shadow[i][0]-mouse[i][0]+dp[(i-1,0,1)]</line-39>
<line-40> </line-40>
<line-41> </line-41>
<line-42> # for rest of the blocks </line-42>
<line-43> # for a block (i,j) we have to add shadow[i][j] and subtract mouse[i][j] from it for double counting</line-43>
<line-44> # now for each block we have two choices, either take its previous block with same direction or take previous block with different </line-44>
<line-45> # direction and subtract corner double counted mouse. We have to take min of both to find optimal answer</line-45>
<line-46> for i,j in product(list(range(1,n)),list(range(1,m))):</line-46>
<line-47> a=shadow[i][j]-mouse[i][j]</line-47>
<line-48> b=a</line-48>
<line-49> a+=min(dp[(i,j-1,0)],dp[(i,j-1,1)]-mouse[i-1][j])</line-49>
<line-50> b+=min(dp[(i-1,j,1)],dp[(i-1,j,0)]-mouse[i][j-1])</line-50>
<line-51> dp[(i,j,0)]=a</line-51>
<line-52> dp[(i,j,1)]=b</line-52>
<line-53> </line-53>
<line-54> # what if [0][0] and [n-1][m-1] have mice, so we have to add them as we haven't counted them yet.</line-54>
<line-55> </line-55>
<line-56> return min(dp[(n-1,m-1,0)],dp[(n-1,m-1,1)])+mouse[0][0]+mouse[n-1][m-1]</line-56>
<line-57> </line-57>
<line-58>for _ in range(int(input())):</line-58>
<line-59> n,m=list(map(int,input().split( )))</line-59>
<line-60> mouse=[]</line-60>
<line-61> for i in range(n):</line-61>
<line-62> x=input()</line-62>
<line-64> print(solve(mouse,n,m))</line-64>
<line-65> </line-65>
<line-66> </line-66>
<line-67> </line-67>
<line-68> </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-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:</line-9>
<line-10> print("YES")</line-10>
<line-12> print("NO")</line-12>
|
{"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:</line-11>
<line-12> c1^=i</line-12>
<line-13> for i in b:</line-13>
<line-15> print(c1,c2)</line-15>
|
{"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>
<line-10> motu.sort(reverse=True)</line-10>
<line-11> tomu.sort()</line-11>
<line-12> for i in range(len(motu)):</line-12>
<line-13> if len(tomu)-1<i:</line-13>
<line-14> break</line-14>
<line-15> if k==0:</line-15>
<line-16> break</line-16>
<line-17> if tomu[i]<motu[i]:</line-17>
<line-18> tomu[i], motu[i] = motu[i], tomu[i]</line-18>
<line-19> k-=1</line-19>
<line-20> if sum(tomu) > sum(motu):</line-20>
<line-21> print("YES")</line-21>
<line-23> print("NO")</line-23>
|
{"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>
<line-11># dic[num] = []</line-11>
<line-12># num = num+"0"</line-12>
<line-13></line-13>
<line-14>n = int(input())</line-14>
<line-15>flag=0</line-15>
<line-16>if n >= 68:</line-16>
<line-17> inp = input()</line-17>
<line-18> print("Yes")</line-18>
<line-19>else:</line-19>
<line-20> inp = [int(x) for x in input().split()]</line-20>
<line-21> for i in range(len(inp)-1):</line-21>
<line-22> for j in range(i+1,len(inp)):</line-22>
<line-23> xor = inp[i]^inp[j]</line-23>
<line-24> if xor in list(dic.keys()):</line-24>
<line-25> for pair in dic[xor]:</line-25>
<line-26> (x,y) = pair</line-26>
<line-27> if x != i and y!=j and x!=j and y!=i:</line-27>
<line-28> flag = 1</line-28>
<line-29> break</line-29>
<line-30></line-30>
<line-31> dic[xor].append((i,j))</line-31>
<line-32> else:</line-32>
<line-33> dic[xor] = []</line-33>
<line-34> dic[xor].append((i,j))</line-34>
<line-35> if flag is 1:</line-35>
<line-36> break</line-36>
<line-37> if flag is 1:</line-37>
<line-38> break</line-38>
<line-39></line-39>
<line-40> if flag is 1:</line-40>
<line-41> print("Yes")</line-41>
<line-43> print("No")</line-43>
<line-44> </line-44>
<line-45> </line-45>
|
{"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>
<line-11></line-11>
<line-12>for x in range(N):</line-12>
<line-14> print(choices[t])</line-14>
|
{"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>
<line-12> return val</line-12>
<line-13> else:</line-13>
<line-14> a=finder(arr[node].a,val)</line-14>
<line-15> b=finder(arr[node].b,val)</line-15>
<line-16> if(arr[node].val==1):</line-16>
<line-17> return a+b-a*b</line-17>
<line-18> else:</line-18>
<line-19> return a*b</line-19>
<line-20></line-20>
<line-21>t=int(input())</line-21>
<line-22>while(t>0):</line-22>
<line-23> x=input()</line-23>
<line-24> n=int(input())</line-24>
<line-25> arr.append(node(0))</line-25>
<line-26> for i in range(0,n):</line-26>
<line-27> vals=input().split()</line-27>
<line-28> sz=len(vals)</line-28>
<line-29> for i in range(0,sz):</line-29>
<line-30> vals[i]=int(vals[i])</line-30>
<line-31> if(vals[0]==0):</line-31>
<line-32> next=node(0)</line-32>
<line-33> arr.append(next)</line-33>
<line-34> else:</line-34>
<line-35> next=node(vals[0],vals[1],vals[2])</line-35>
<line-36> arr.append(next)</line-36>
<line-37> lower=0.0</line-37>
<line-38> higher=1.0</line-38>
<line-39> eps=1e-9</line-39>
<line-40> while((higher-lower)>eps):</line-40>
<line-41> mid=(higher+lower)/2.0 </line-41>
<line-42> if(finder(n,mid)>0.5):</line-42>
<line-43> higher=mid</line-43>
<line-44> else:</line-44>
<line-45> lower=mid</line-45>
<line-46> print("%.5f" %(higher))</line-46>
<line-47> arr=[]</line-47>
<line-49> t-=1</line-49>
|
{"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>
<line-13> DY.append([{x: 0 for x in range(0, 10)}, 0, 0])</line-13>
<line-14> GOT += 1</line-14>
<line-15></line-15>
<line-16> for j in range(0, GOT):</line-16>
<line-17></line-17>
<line-18> if DY[j][0][i] == 1:</line-18>
<line-19> DY[j][0][i] = 0</line-19>
<line-20> DY[j][1] -= 1</line-20>
<line-21> else:</line-21>
<line-22> DY[j][0][i] = 1</line-22>
<line-23> DY[j][1] += 1</line-23>
<line-24></line-24>
<line-25> DY[j][2] += 1</line-25>
<line-26></line-26>
<line-27> if DY[j][1] <= 1 and DY[j][2] > MINT:</line-27>
<line-28> MINT = DY[j][2]</line-28>
<line-29></line-29>
<line-30> return MINT</line-30>
<line-31></line-31>
<line-32>TESTCASES = int(input().strip())</line-32>
<line-33></line-33>
<line-34>for i in range(0, TESTCASES):</line-34>
<line-35> </line-35>
<line-37> </line-37>
<line-38> print(GRIG(L))</line-38>
|
{"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 , 768 , 800 , 864 , 896 , 960 , 1008 , 1024 , 1152 , 1200 , 1280 , 1344 , 1440 , 1536 , 1600 , 1680 , 1728 , 1792 , 1920 , 2016 , 2048 , 2304 , 2400 , 2688 , 2880 , 3072 , 3360 , 3456 , 3584 , 3600 , 3840 , 4032 , 4096 , 4320 , 4608 , 4800 , 5040 , 5376 , 5760 , 6144 , 6720 , 6912 , 7168 , 7200 , 7680 , 8064 , 8192 , 8640 , 9216 , 10080 , 10368 , 10752 , 11520 , 12288 , 12960 , 13440 , 13824 , 14336 , 14400 , 15360 , 16128 , 16384 , 17280 , 18432 , 20160 , 20736 , 21504 , 23040 , 24576 , 25920 , 26880 , 27648 , 28672 , 28800 , 30720 , 32256 , 32768 , 34560 , 36864 , 40320 , 41472 , 43008 , 46080 , 48384 , 49152 , 51840 , 53760 , 55296 , 57600 , 61440 , 62208 , 64512 , 65536 , 69120 , 73728 , 80640 , 82944 , 86016 , 92160 , 96768 , 98304 , 103680 , 107520 , 110592 , 115200 , 122880 , 124416 , 129024 , 131072 , 138240 , 147456 , 153600 , 161280 , 165888 , 172032 , 184320 , 193536 , 196608 , 207360 , 215040 , 221184 , 230400 , 245760]</line-1>
<line-3>t = int(input())</line-3>
<line-4>for x in range(0, t):</line-4>
<line-5> a = int(input())</line-5>
<line-6> i = 0</line-6>
<line-7> for y in divisors:</line-7>
<line-8> if y > a:</line-8>
<line-9> print("win", numbers[i])</line-9>
<line-10> break</line-10>
<line-11> i = i+1</line-11>
<line-13> print("lose")</line-13>
|
{"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 , 2162160 , 2882880 , 3603600 , 4324320 , 6486480 , 7207200 , 8648640 , 10810800 , 14414400 , 17297280 , 21621600 , 32432400 , 36756720 , 43243200 , 61261200 , 73513440 , 110270160 , 122522400 , 147026880 , 183783600 , 245044800 , 294053760 , 367567200 , 551350800 , 698377680 , 735134400 , 1102701600 , 1396755360 , 2095133040 , 2205403200 , 2327925600 , 2793510720 , 3491888400 , 4655851200 , 5587021440 , 6983776800 , 10475665200 , 13967553600 , 20951330400 , 27935107200 , 41902660800 , 48886437600 , 64250746560 , 73329656400 , 80313433200 , 97772875200 , 128501493120 , 146659312800 , 160626866400 , 240940299600 , 293318625600 , 321253732800 , 481880599200 , 642507465600 , 963761198400 , 1124388064800 , 1606268664000 , 1686582097200 , 1927522396800 , 2248776129600 , 3212537328000 , 3373164194400 , 4497552259200 , 6746328388800 , 8995104518400 , 9316358251200 , 13492656777600 , 18632716502400 , 26985313555200 , 27949074753600 , 32607253879200 , 46581791256000 , 48910880818800 , 55898149507200 , 65214507758400 , 93163582512000 , 97821761637600 , 130429015516800 , 195643523275200 , 260858031033600 , 288807105787200 , 391287046550400 , 577614211574400 , 782574093100800 , 866421317361600 , 1010824870255200 , 1444035528936000 , 1516237305382800 , 1732842634723200 , 2021649740510400 , 2888071057872000 , 3032474610765600 , 4043299481020800 , 6064949221531200 , 8086598962041600 , 10108248702552000 , 12129898443062400 , 18194847664593600 , 20216497405104000 , 24259796886124800 , 30324746107656000 , 36389695329187200 , 48519593772249600 , 60649492215312000 , 72779390658374400 , 74801040398884800 , 106858629141264000 , 112201560598327200 , 149602080797769600 , 224403121196654400 , 299204161595539200 , 374005201994424000 , 448806242393308800 , 673209363589963200 , 748010403988848000 , 897612484786617600 , 1122015605983272000 , 1346418727179926400 , 1795224969573235200 , 2244031211966544000 , 2692837454359852800 , 3066842656354276800 , 4381203794791824000 , 4488062423933088000 , 6133685312708553600 , 8976124847866176000 , 9200527969062830400]</line-2>\n<line-12> else:</line-12>", "lines": [2, 12]}
#### 0
|
{"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> print(ans)</line-12>
|
{"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> break</line-10>
<line-11> </line-11>
<line-12> else:</line-12>
<line-13> p-=c </line-13>
<line-14> a=p//100</line-14>
<line-15> b=p%100</line-15>
<line-16> p=b*100+a</line-16>
<line-17> if p>mx:</line-17>
<line-18> mx=p</line-18>
<line-20> </line-20>
<line-21> print(ans) </line-21>
|
{"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 in X:</line-12>
<line-13> if int(x)>=6:</line-13>
<line-14> n=int(x)*10+int(y)</line-14>
<line-15> list2.append(n)</line-15>
<line-16> for j in list1:</line-16>
<line-17> if int(j)>=6:</line-17>
<line-18> m=int(j)*10+int(j)</line-18>
<line-19> list2.remove(m)</line-19>
<line-20> list2.sort()</line-20>
<line-21> if len(list2)==0:</line-21>
<line-22> print(" ")</line-22>
<line-23> else:</line-23>
<line-24> list2.sort()</line-24>
<line-25> for k in list2:</line-25>
<line-26> if chr(k) not in output and 64<k<91:</line-26>
<line-28> print(output)</line-28>
<line-29> </line-29>
|
{"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):</line-9>
<line-10> print(b,end="")</line-10>
<line-11> b-=1</line-11>
<line-12> print()</line-12>
<line-13> for l in range(n):</line-13>
<line-14> a = n</line-14>
<line-15> for j1 in range(0,l+1):</line-15>
<line-16> print(" ",end="")</line-16>
<line-17> for k in range(n-l):</line-17>
<line-18> print(a,end="")</line-18>
<line-20></line-20>
<line-21> print()</line-21>
|
{"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> else:</line-10>
<line-11> total += (i % 6)</line-11>
<line-13> t -= 1</line-13>
|
{"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>
<line-11> if(o<=x//2):</line-11>
<line-12> f=1</line-12>
<line-13> elif(e<=x//2):</line-13>
<line-14> if((k-x)%2!=0):</line-14>
<line-15> f=0</line-15>
<line-16> else:</line-16>
<line-17> f=1</line-17>
<line-18> else:</line-18>
<line-19> if(x%2==0):</line-19>
<line-20> f=1</line-20>
<line-21> else:</line-21>
<line-22> f=0</line-22>
<line-23> if(f==1):</line-23>
<line-24> print('Jesse')</line-24>
<line-26> print('Walter')</line-26>
|
{"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>
<line-11> print()</line-11>
|
{"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('NO')</line-10>
|
{"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 = mergeSortInversions(b)</line-10>
<line-11> c = []</line-11>
<line-12> i = 0</line-12>
<line-13> j = 0</line-13>
<line-14> inversions = 0 + ai + bi</line-14>
<line-15> la=len(a)</line-15>
<line-16> while i < la and j < len(b):</line-16>
<line-17> if a[i] <= b[j]:</line-17>
<line-18> c.append(a[i])</line-18>
<line-19> i += 1</line-19>
<line-20> else:</line-20>
<line-21> c.append(b[j])</line-21>
<line-22> j += 1</line-22>
<line-23> inversions += (la-i)</line-23>
<line-24> c += a[i:]</line-24>
<line-25> c += b[j:]</line-25>
<line-26> return c, inversions </line-26>
<line-27>for _ in range(int(input())):</line-27>
<line-28> n,d=list(map(int,input().split()))</line-28>
<line-29> p=[int(o) for o in input().split()]</line-29>
<line-30> array=[[] for i in range(d)]</line-30>
<line-31> flag=0</line-31>
<line-32> for i in range(n):</line-32>
<line-33> array[i%d].append(p[i])</line-33>
<line-34> if p[i]%((i%d)+1)!=0:</line-34>
<line-35> flag=1</line-35>
<line-36> </line-36>
<line-37> </line-37>
<line-38> ans=0</line-38>
<line-39> dumarr=[0]*n</line-39>
<line-40> for i in range(d):</line-40>
<line-41> array[i],v=mergeSortInversions(array[i])</line-41>
<line-42> for j in range(len(array[i])):</line-42>
<line-43> dumarr[i+j*d]=array[i][j]</line-43>
<line-44> ans+=v</line-44>
<line-45> p=sorted(p)</line-45>
<line-46> # print(dumarr)</line-46>
<line-47> if dumarr==p:</line-47>
<line-48> print(ans)</line-48>
<line-50> print(-1)</line-50>
|
{"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>
<line-11> return cnt</line-11>
<line-12></line-12>
<line-13>t=int(input())</line-13>
<line-14>for _ in range(t):</line-14>
<line-15> n=int(input())</line-15>
<line-16> if n==0:</line-16>
<line-17> print(0)</line-17>
<line-18> elif n==1:</line-18>
<line-19> print('INFINITY')</line-19>
<line-21> print(finder(n))</line-21>
<line-22> </line-22>
|
{"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-7>
<line-8> print()</line-8>
<line-9> else:</line-9>
<line-10> k,count,p,l,x = k-(n*(n+1))//2 + 1,0,0,[0 for i in range(n)],1</line-10>
<line-11> while(k>0):p+=2 ;k,count = k-n+p ,count+1</line-11>
<line-12> for i in range(n,n-count+1,-1):l[x]=i ;x+=2</line-12>
<line-13> k=-k ;l[2*count - 1 +k],p = n-count+1 ,1</line-13>
<line-14> for i in range(n):</line-14>
<line-15> if(l[i]==0):l[i]=p ; p+=1 </line-15>
<line-16> for i in l:print(i,'',end='')</line-16>
<line-17> print()</line-17>
<line-18> else:</line-18>
<line-19> if(n==1):print(1) if(k==0) else print(-1) </line-19>
<line-20> elif(k<(n*(n+1))//2 - 1 or k>3*(n//2)*(n//2 + 1)):print(-1)</line-20>
<line-21> elif(k==(n*(n+1))//2 - 1):</line-21>
<line-22> for i in range(1,n+1):print(i,'',end='')</line-22>
<line-23> print()</line-23>
<line-24> else:</line-24>
<line-26> while(k>0): p+=2 ; k,count = k-n+p ,count+1</line-26>
|
{"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>
<line-10>def _rl() :</line-10>
<line-11> return list(input().strip())</line-11>
<line-12></line-12>
<line-13>def _rs() :</line-13>
<line-14> return input().strip()</line-14>
<line-15></line-15>
<line-16>def _a(k, *v) :</line-16>
<line-17> return all(x == k for x in v)</line-17>
<line-18></line-18>
<line-19>def _i(conv) :</line-19>
<line-20> for line in sys.stdin :</line-20>
<line-21> yield conv(line)</line-21>
<line-22>##################################################################</line-22>
<line-23></line-23>
<line-24>n = _r(int)</line-24>
<line-25>lookup = dict([(x, i) for i, x in enumerate(_ra(str))])</line-25>
<line-26>g = [(set(), dict()) for _ in range(n)]</line-26>
<line-27></line-27>
<line-28>m = _r(int)</line-28>
<line-29>for _ in range(m) :</line-29>
<line-30> c1, c2, d = _r(str, str, int)</line-30>
<line-31> i1 = lookup[c1]</line-31>
<line-32></line-32>
<line-33> g[i1][0].add(c2)</line-33>
<line-34> g[i1][1][c2] = d</line-34>
<line-35></line-35>
<line-36></line-36>
<line-37>t = _r(int)</line-37>
<line-38>for _ in range(t) :</line-38>
<line-39> k = _ra(str)[1:]</line-39>
<line-40> </line-40>
<line-41> failed = False</line-41>
<line-42> if len(set(k)) != len(k) :</line-42>
<line-43> failed = True</line-43>
<line-44></line-44>
<line-45> if not failed :</line-45>
<line-46> if k[0] not in lookup : </line-46>
<line-47> failed = True</line-47>
<line-48> else : </line-48>
<line-49> r = 0</line-49>
<line-50> v = g[lookup[k[0]]]</line-50>
<line-51></line-51>
<line-52> for i in range(1, len(k)) : </line-52>
<line-53> if k[i] not in v[0] : </line-53>
<line-54> failed = True</line-54>
<line-55> break</line-55>
<line-56></line-56>
<line-57> r += v[1][k[i]]</line-57>
<line-58> v = g[lookup[k[i]]]</line-58>
<line-59> </line-59>
<line-60> if not failed : </line-60>
<line-61> print(r)</line-61>
<line-62> </line-62>
<line-64> print('ERROR')</line-64>
|
{"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-10> if arr[i] == 0: </line-10>
<line-11> for j in range(i * i, N + 1, i): </line-11>
<line-12> arr[j] = 1</line-12>
<line-13> </line-13>
<line-14> curr_prime_sum = 0</line-14>
<line-15></line-15>
<line-16> for i in range(1, N + 1): </line-16>
<line-17> if arr[i] == 0: </line-17>
<line-18> curr_prime_sum += i </line-18>
<line-19> sum_arr[i] = curr_prime_sum </line-19>
<line-20> </line-20>
<line-21>n=int(input())</line-21>
<line-22>lprime()</line-22>
<line-23>for _ in range(n):</line-23>
<line-25> print(sum_arr[x]%10)</line-25>
|
{"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 = []</line-8>
<line-9> for i in range(1,N+1):</line-9>
<line-10> if(data[i]==1):</line-10>
<line-11> infected.append(i)</line-11>
<line-12> </line-12>
<line-13> i = 0</line-13>
<line-14> while(i<D):</line-14>
<line-15> boundary = People[i] + i</line-15>
<line-16> data.insert(boundary,"|")</line-16>
<line-17> times = len(infected)</line-17>
<line-18> for p in range(times):</line-18>
<line-19> index = infected[p]</line-19>
<line-20> if(index>=boundary):</line-20>
<line-21> index+=1</line-21>
<line-22> infected[p]+=1</line-22>
<line-23> if(data[index]==1):</line-23>
<line-24> if(data[index+1]==0):</line-24>
<line-25> data[index+1] = 1</line-25>
<line-26> infected.append(index+1)</line-26>
<line-27> if(data[index-1]==0):</line-27>
<line-28> data[index-1] = 1</line-28>
<line-29> infected.append(index-1)</line-29>
<line-30> else:</line-30>
<line-31> infected.remove(index)</line-31>
<line-32> times-=1</line-32>
<line-33> i+=1</line-33>
<line-35> </line-35>
<line-36> print(data.count(1))</line-36>
|
{"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")</line-8>
<line-10> print("no")</line-10>
|
{"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):</line-11>
<line-12> if len(ans)==l:</line-12>
<line-13> break</line-13>
<line-14> elif al[i]==1 and k>0:</line-14>
<line-15> k-=1</line-15>
<line-16> ans.append(chr(i+ord('a')))</line-16>
<line-17> elif al[i]==0:</line-17>
<line-18> ans.append(chr(i+ord('a')))</line-18>
<line-19> </line-19>
<line-20> if len(ans)!=l:</line-20>
<line-21> print(n)</line-21>
<line-23> print("".join(ans))</line-23>
|
{"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> for j in range(len(arr)):</line-12>
<line-13> if arr[j] == 2:</line-13>
<line-14> num_2 += 1</line-14>
<line-15> </line-15>
<line-16> if arr[j] > 2:</line-16>
<line-17> num += 1</line-17>
<line-18> </line-18>
<line-19> res.append(num_2 * num + (num * (num - 1)) // 2)</line-19>
<line-20> </line-20>
<line-22> print(z)</line-22>
|
{"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-10>
<line-11> intervals[k] = A[p]</line-11>
<line-12> k+=1;p+=1;</line-12>
<line-13> else:</line-13>
<line-14> intervals[k] = B[q]</line-14>
<line-15> k+=1;q+=1;</line-15>
<line-16> </line-16>
<line-17> while(p<al):</line-17>
<line-18> intervals[k] = A[p]</line-18>
<line-19> k+=1;p+=1;</line-19>
<line-20> while(q<bl):</line-20>
<line-21> intervals[k] = B[q]</line-21>
<line-22> k+=1;q+=1;</line-22>
<line-23> </line-23>
<line-24></line-24>
<line-25>def mergesort(intervals, start, end):</line-25>
<line-26> if(start<end):</line-26>
<line-27> mid = int((start+end)/2)</line-27>
<line-28> mergesort(intervals,start,mid)</line-28>
<line-29> mergesort(intervals,mid+1,end)</line-29>
<line-30> merge(intervals,start,mid,end)</line-30>
<line-31></line-31>
<line-32>t = int(input())</line-32>
<line-33>for _ in range(t):</line-33>
<line-34> n,m,k = map(int, input().split())</line-34>
<line-35> </line-35>
<line-36> cities = [[0,[]] for i in range(n)]</line-36>
<line-37> for i in range(m):</line-37>
<line-38> a,b = map(int, input().split())</line-38>
<line-39> cities[a-1][1].append(b-1)</line-39>
<line-40> cities[b-1][1].append(a-1)</line-40>
<line-41> </line-41>
<line-42> li = list(map(int, input().split()))</line-42>
<line-43> </line-43>
<line-44> def specialfunction():</line-44>
<line-45> mergesort(li,0,n-1)</line-45>
<line-46> if(k>len(li)):</line-46>
<line-47> print(-1)</line-47>
<line-48> else:</line-48>
<line-49> sum = 0</line-49>
<line-50> front = 0</line-50>
<line-51> rear = len(li)-1</line-51>
<line-52> for i in range(k):</line-52>
<line-53> if(i%2==0):</line-53>
<line-54> sum += li[rear]</line-54>
<line-55> rear -= 1</line-55>
<line-56> else:</line-56>
<line-57> sum += li[front]</line-57>
<line-58> front += 1</line-58>
<line-59> print(sum)</line-59>
<line-60> </line-60>
<line-61> if(m == 0):</line-61>
<line-62> specialfunction()</line-62>
<line-63> continue</line-63>
<line-64> </line-64>
<line-65> for i in range(n):</line-65>
<line-66> cities[i][0] = li[i]</line-66>
<line-67> </line-67>
<line-68> visited = [-1 for i in range(n)]</line-68>
<line-69> count = 0</line-69>
<line-70> museummonths = []</line-70>
<line-71> def searchUnvisited():</line-71>
<line-72> for i in range(n):</line-72>
<line-73> if(visited[i] == -1):</line-73>
<line-74> return i</line-74>
<line-75> return -1</line-75>
<line-76> </line-76>
<line-77> def bfs(ind,count):</line-77>
<line-78> museumcount = 0</line-78>
<line-79> queue = []</line-79>
<line-80> queue.append(ind)</line-80>
<line-81> visited[ind] = 1</line-81>
<line-82> museumcount += cities[ind][0]</line-82>
<line-83> count += 1</line-83>
<line-84> front = 0</line-84>
<line-85> rear = 0</line-85>
<line-86> while(front<=rear):</line-86>
<line-87> noe = len(cities[ind][1])</line-87>
<line-88> for i in range(noe):</line-88>
<line-89> if(visited[cities[ind][1][i]] == -1):</line-89>
<line-90> queue.append(cities[ind][1][i])</line-90>
<line-91> rear += 1</line-91>
<line-92> count += 1</line-92>
<line-93> museumcount += cities[cities[ind][1][i]][0]</line-93>
<line-94> visited[cities[ind][1][i]] = 1</line-94>
<line-95> front += 1</line-95>
<line-96> try:</line-96>
<line-97> ind = queue[front]</line-97>
<line-98> except:</line-98>
<line-99> break</line-99>
<line-100> museummonths.append(museumcount)</line-100>
<line-101> return count</line-101>
<line-102> </line-102>
<line-103> while(count<n):</line-103>
<line-104> for i in range(n):</line-104>
<line-105> if(visited[i] == -1):</line-105>
<line-106> count = bfs(i,count)</line-106>
<line-107> </line-107>
<line-108> mergesort(museummonths,0,len(museummonths)-1)</line-108>
<line-109> #print(museummonths)</line-109>
<line-110> if(k>len(museummonths)):</line-110>
<line-111> print(-1)</line-111>
<line-112> else:</line-112>
<line-113> sum = 0</line-113>
<line-114> front = 0</line-114>
<line-115> rear = len(museummonths)-1</line-115>
<line-116> for i in range(k):</line-116>
<line-117> if(i%2==0):</line-117>
<line-118> sum += museummonths[rear]</line-118>
<line-119> rear -= 1</line-119>
<line-120> else:</line-120>
<line-121> sum += museummonths[front]</line-121>
<line-123> print(sum)</line-123>
|
{"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:</line-13>
<line-14> return [(-1, -1)]</line-14>
<line-15> r = [(i+1, ((i+1) % N)+1) for i in range(N)]</line-15>
<line-16> return r</line-16>
<line-17></line-17>
<line-18>T = int(f.readline().strip())</line-18>
<line-19></line-19>
<line-20>for case_id in range(1, T+1):</line-20>
<line-21> N, M = list(map(int, f.readline().strip().split()))</line-21>
<line-22></line-22>
<line-23> rr = calc(N, M)</line-23>
<line-24></line-24>
<line-26> print(a, b)</line-26>
|
{"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(1000000000)</line-11>
<line-12> mat.append(l)</line-12>
<line-13> ans.append(p)</line-13>
<line-14> y=int(input())</line-14>
<line-15> for i in range(y):</line-15>
<line-16> a,b=[int(x) for x in input().split()]</line-16>
<line-17> mat[a][b]=1</line-17>
<line-18> ans[a][b]=0</line-18>
<line-19> y=int(input())</line-19>
<line-20> for i in range(y):</line-20>
<line-21> a,b=[int(x) for x in input().split()]</line-21>
<line-22> mat[a][b]=1000000000</line-22>
<line-23> ans[a][b]=1000000000</line-23>
<line-24> for i in range(1,n+1):</line-24>
<line-25> for j in range(1,m+1):</line-25>
<line-26> if mat[i][j]==1 or mat[i][j]==1000000000:</line-26>
<line-27> continue</line-27>
<line-28> else:</line-28>
<line-29> ans[i][j]=min(ans[i][j],ans[i][j-1]+1,ans[i-1][j]+1)</line-29>
<line-30> for i in range(n,0,-1):</line-30>
<line-31> for j in range(m,0,-1):</line-31>
<line-32> if mat[i][j] == 1 or mat[i][j] == 1000000000:</line-32>
<line-33> continue</line-33>
<line-34> else:</line-34>
<line-35> ans[i][j]=min(ans[i][j],ans[i+1][j]+1,ans[i][j+1]+1)</line-35>
<line-36> for i in range(1,n+1):</line-36>
<line-37> for j in range(m, 0, -1):</line-37>
<line-38> if mat[i][j] == 1 or mat[i][j] == 1000000000:</line-38>
<line-39> continue</line-39>
<line-40> else:</line-40>
<line-41> ans[i][j] = min(ans[i][j], ans[i - 1][j] + 1, ans[i][j + 1] + 1)</line-41>
<line-42> for i in range(n, 0, -1):</line-42>
<line-43> for j in range(1,m+1):</line-43>
<line-44> if mat[i][j] == 1 or mat[i][j] == 1000000000:</line-44>
<line-45> continue</line-45>
<line-46> else:</line-46>
<line-47> ans[i][j] = min(ans[i][j], ans[i + 1][j] + 1, ans[i][j - 1] + 1)</line-47>
<line-48> for i in range(1,n+1):</line-48>
<line-49> for j in range(1,m+1):</line-49>
<line-50> if mat[i][j]==1 or mat[i][j]==1000000000:</line-50>
<line-51> continue</line-51>
<line-52> else:</line-52>
<line-53> ans[i][j]=min(ans[i][j],ans[i][j-1]+1,ans[i-1][j]+1)</line-53>
<line-54> for i in range(n,0,-1):</line-54>
<line-55> for j in range(m,0,-1):</line-55>
<line-56> if mat[i][j] == 1 or mat[i][j] == 1000000000:</line-56>
<line-57> continue</line-57>
<line-58> else:</line-58>
<line-59> ans[i][j]=min(ans[i][j],ans[i+1][j]+1,ans[i][j+1]+1)</line-59>
<line-60> for i in range(1,n+1):</line-60>
<line-61> for j in range(m, 0, -1):</line-61>
<line-62> if mat[i][j] == 1 or mat[i][j] == 1000000000:</line-62>
<line-63> continue</line-63>
<line-64> else:</line-64>
<line-65> ans[i][j] = min(ans[i][j], ans[i - 1][j] + 1, ans[i][j + 1] + 1)</line-65>
<line-66> for i in range(n, 0, -1):</line-66>
<line-67> for j in range(1,m+1):</line-67>
<line-68> if mat[i][j] == 1 or mat[i][j] == 1000000000:</line-68>
<line-69> continue</line-69>
<line-70> else:</line-70>
<line-71> ans[i][j] = min(ans[i][j], ans[i + 1][j] + 1, ans[i][j - 1] + 1)</line-71>
<line-72> for i in range(1,n+1):</line-72>
<line-73> for j in range(1,m+1):</line-73>
<line-74> if mat[i][j]==1000000000:</line-74>
<line-75> print('X',end=" ")</line-75>
<line-76> elif ans[i][j]>=1000000000:</line-76>
<line-77> print('-1',end=" ")</line-77>
<line-78> else:</line-78>
<line-80> print()</line-80>
|
{"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>
<line-11> while j>=0:</line-11>
<line-12> if reach[j]>0:</line-12>
<line-13> reach[j+i**n]+=reach[j]</line-13>
<line-14> j-=1</line-14>
<line-15> i+=1</line-15>
<line-17> print(reach[-1])</line-17>
|
{"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-12>
<line-14> print(n-m)</line-14>
<line-15></line-15>
<line-16> </line-16>
|
{"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> k=eval(input())</line-10>
<line-11> while(i<k):</line-11>
<line-13> print(seq(i-1))</line-13>
|
{"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)</line-12>
<line-13> </line-13>
<line-14> </line-14>
|
{"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>
<line-11> else:</line-11>
<line-12> for i in temp:</line-12>
<line-13> ans += ["z"+i]</line-13>
<line-14> return ans</line-14>
<line-15>n,m,k = list(map(int,input().split()))</line-15>
<line-16>p = []</line-16>
<line-17>mr= []</line-17>
<line-18>for _ in range(m):</line-18>
<line-19> inp = [int(x) for x in input().split()]</line-19>
<line-20> mc = inp[0]</line-20>
<line-21> mi = 0</line-21>
<line-22> for j in range(1,n):</line-22>
<line-23> if(mc<inp[j]):</line-23>
<line-24> mc = inp[j]</line-24>
<line-25> mi = j</line-25>
<line-26> p += [inp]</line-26>
<line-27> mr += [mi]</line-27>
<line-28>ans = dfs(0,m,n,k)</line-28>
<line-29>w = []</line-29>
<line-30>for i in ans:</line-30>
<line-31> cst = 0</line-31>
<line-32> s = ""</line-32>
<line-33> for j in range(m):</line-33>
<line-34> if(i[j]!="z"):</line-34>
<line-35> s+=i[j]</line-35>
<line-36> cst += p[j][ord(i[j])-97]</line-36>
<line-37> else:</line-37>
<line-38> s += chr(mr[j]+97)</line-38>
<line-39> w += [(-cst,s)]</line-39>
<line-41>print(w[k-1][1])</line-41>
|
{"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 (T1, T2) in memo:</line-12>
<line-13> return memo[(T1, T2)]</line-13>
<line-14></line-14>
<line-15> t1 = recurse(arr, T1 + arr[i], T2, k, i+1)</line-15>
<line-16> t2 = recurse(arr, T1, T2 + arr[i], k, i+1) </line-16>
<line-17></line-17>
<line-18> memo[(T1, T2)] = min(t1, t2)</line-18>
<line-19> return memo[(T1, T2)]</line-19>
<line-20></line-20>
<line-21>for _ in range(int(input())):</line-21>
<line-22> n, k = list(map(int, input().split()))</line-22>
<line-23> lst = list(map(int, input().split()))</line-23>
<line-24></line-24>
<line-25> lst.sort(reverse = True)</line-25>
<line-26> memo = {}</line-26>
<line-27> res = recurse(lst, 0, 0, k, 0)</line-27>
<line-28></line-28>
<line-29> if res == float('inf'):</line-29>
<line-30> print(-1)</line-30>
<line-32> print(res)</line-32>
<line-33></line-33>
<line-34></line-34>
<line-35></line-35>
|
{"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(fip()) for _ in range(n)]</line-7>
<line-8>#-------------------code------------------------</line-8>
<line-9>def even(x):</line-9>
<line-10> x = bin(x).count('1')</line-10>
<line-11> return x%2==0</line-11>
<line-12> </line-12>
<line-13>for _ in range(fintinp()):</line-13>
<line-14> q =fintinp()</line-14>
<line-15> o = e =0 </line-15>
<line-16> nums = set()</line-16>
<line-17> for qn in range(q):</line-17>
<line-18> qn = fintinp()</line-18>
<line-19> if qn not in nums:</line-19>
<line-20> if even(qn): e+=1 </line-20>
<line-21> else: o+=1 </line-21>
<line-22> </line-22>
<line-23> for n in set(nums):</line-23>
<line-24> x = n^qn</line-24>
<line-25> if x not in nums:</line-25>
<line-26> if even(x): e+=1 </line-26>
<line-27> else: o+=1 </line-27>
<line-28> </line-28>
<line-29> nums.add(x)</line-29>
<line-30> </line-30>
<line-32> print(e,o)</line-32>
|
{"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(input().strip())</line-12>
<line-13></line-13>
<line-14> for i, ai in enumerate(a):</line-14>
<line-15> if ai.find('*') > -1:</line-15>
<line-16> v[2] = i</line-16>
<line-17> break</line-17>
<line-18></line-18>
<line-19> if v[2] == -1:</line-19>
<line-20> print(0)</line-20>
<line-21> else:</line-21>
<line-22></line-22>
<line-23> for i, ai in reversed(list(enumerate(a))):</line-23>
<line-24> if ai.find('*') > -1:</line-24>
<line-25> v[3] = i</line-25>
<line-26> break</line-26>
<line-27></line-27>
<line-28> for i in range(m):</line-28>
<line-29> x = [ai[i] for ai in a]</line-29>
<line-30> if '*' in x:</line-30>
<line-31> v[0] = i</line-31>
<line-32> break</line-32>
<line-33></line-33>
<line-34> for i in reversed(range(m)):</line-34>
<line-35> x = [ai[i] for ai in a]</line-35>
<line-36> if '*' in x:</line-36>
<line-37> v[1] = i</line-37>
<line-38> break</line-38>
<line-39></line-39>
<line-40> if v.count(v[0]) == len(v):</line-40>
<line-41> print(1)</line-41>
<line-43> print(int(math.ceil(max(v[3] - v[2], v[1] - v[0]) / 2.0)) + 1)</line-43>
|
{"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 in lst))</line-9>
<line-11> lst[x * 2 + 1] += 1</line-11>
|
{"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[i] = max(maxi - i, i - mini)</line-9>
<line-11> print()</line-11>
|
{"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>
<line-11> y += 1</line-11>
<line-12> elif arr[y]==t:</line-12>
<line-13> t = t*2</line-13>
<line-14> y += 1</line-14>
<line-15> else:</line-15>
<line-16> result += 1</line-16>
<line-17> t = t*2</line-17>
<line-18> </line-18>
<line-19> while t < 2**(k):</line-19>
<line-20> result += 1</line-20>
<line-22> print(result)</line-22>
|
{"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)</line-12>
|
{"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 = n,m</line-10>
<line-11></line-11>
<line-12> y = n-1</line-12>
<line-13> s1 = ((y*(y+1)) //2)%mod</line-13>
<line-14> s2 = ((y*(y+1)*(2*y+1)) //6)%mod</line-14>
<line-15> s3 = ((y*y*(y+1)*(y+1)) //4)%mod</line-15>
<line-16> </line-16>
<line-17> </line-17>
<line-18> ans = (m*n*s1 - (m+n)*s2+s3)%mod</line-18>
<line-20> </line-20>
<line-21> print(ans)</line-21>
<line-22> </line-22>
|
{"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]]=ls[1]</line-10>
<line-11> # print(d)</line-11>
<line-12> if len(d)<3:</line-12>
<line-13> print(0)</line-13>
<line-14> else:</line-14>
<line-15> kd=list(d.values())</line-15>
<line-16> kd.sort()</line-16>
<line-18> print(kd[-1]+kd[-2]+kd[-3])</line-18>
|
{"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")</line-11>
|
{"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-11>
<line-12> ans = 0</line-12>
<line-13> temp = 0</line-13>
<line-14> </line-14>
<line-15> while(index<=lL):</line-15>
<line-16> temp = L%l[index]</line-16>
<line-17> if temp>=l[index-1]:</line-17>
<line-18> if(l[index]-temp<=R-L+1):</line-18>
<line-19> ans= (ans +(l[index-1])*(l[index]-temp))%1000000007</line-19>
<line-20> else :</line-20>
<line-21> ans=(ans+(l[index-1])*(R-L+1))%1000000007</line-21>
<line-22> </line-22>
<line-23> </line-23>
<line-24> index+=1</line-24>
<line-25> print(ans)</line-25>
<line-27># 18091037982636824985 8589934592 4429185025 4294967296</line-27>
|
{"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)] </line-10>
<line-11> </line-11>
<line-12> for i in range(n + 1): </line-12>
<line-13> countDivision[i] = 2</line-13>
<line-14> </line-14>
<line-15> for i in range(2, n + 1, 1): </line-15>
<line-16> </line-16>
<line-17> </line-17>
<line-18> if (v[i] == i and countDivision[i] == 2): </line-18>
<line-19> for j in range(2 * i, n + 1, i): </line-19>
<line-20> if (countDivision[j] > 0): </line-20>
<line-21> v[j] = int(v[j] / i) </line-21>
<line-22> countDivision[j] -= 1</line-22>
<line-23>try:</line-23>
<line-24> t=int(sys.stdin.readline())</line-24>
<line-25> for _ in range(t):</line-25>
<line-26> gen()</line-26>
<line-27> x=int(sys.stdin.readline())</line-27>
<line-28> flag=0</line-28>
<line-29> for i in range(2,x//2+1):</line-29>
<line-30> if v[i]==1 and v[x-i]==1:</line-30>
<line-31> flag=1</line-31>
<line-32> #print(i,x-i)</line-32>
<line-33> if flag==1:</line-33>
<line-34> print("YES")</line-34>
<line-35> else:</line-35>
<line-36> print("NO")</line-36>
<line-38> pass</line-38>
|
{"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])</line-9>
<line-10> if a60[0]==a60[1] or a75[0]==a75[1] or a90[0]==a90[1] :</line-10>
<line-11> print(-1)</line-11>
<line-13> print(a60[1],a75[1],a90[1])</line-13>
|
{"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 range(0,N):</line-10>
<line-11> trace1=0</line-11>
<line-12> trace2=0</line-12>
<line-13> for j in range(0,i+1):</line-13>
<line-14> trace1+=matrix[j][N+j-i-1]</line-14>
<line-15> trace2+=matrix[N+j-i-1][j]</line-15>
<line-16> max_trace.append(trace1)</line-16>
<line-18> print(max(max_trace))</line-18>
<line-19></line-19>
<line-20> </line-20>
|
{"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.