question
stringlengths 0
30.2k
| answer
stringlengths 55
2.44k
|
|---|---|
<line-1>from sys import stdin, stdout</line-1>
<line-3>#a,b = map(int, stdin.readline().split())</line-3>
<line-4>#l1 = list(map(int, stdin.readline().split()))</line-4>
<line-5>l = [1,6,7]</line-5>
<line-6>c = 1</line-6>
<line-7>for x in range(3,100001):</line-7>
<line-8> if x%2==1:</line-8>
<line-9> a = l[c]*6</line-9>
<line-10> l.append(a)</line-10>
<line-11> else:</line-11>
<line-12> l.append(a+1)</line-12>
<line-13> c+=1</line-13>
<line-14>n = int(stdin.readline())</line-14>
<line-15>for _ in range(n):</line-15>
<line-17> print(l[s-1])</line-17>
|
{"code": "<line-2>#from math import gcd as g</line-2>\n<line-16> s = int(stdin.readline())</line-16>", "lines": [2, 16]}
#### 0
|
<line-1>for _ in range(int(input())):</line-1>
<line-3> for j in range(len(l)-1,-1,-1):</line-3>
<line-4> if l[j]==1:</line-4>
<line-5> l.pop()</line-5>
<line-6> else:</line-6>
<line-7> break</line-7>
<line-8> if l.count(1):</line-8>
<line-9> time,prev,z,c=0,0,0,0</line-9>
<line-10> for j in range(len(l)-1,-1,-1):</line-10>
<line-11> if l[j]==0:</line-11>
<line-12> z+=1</line-12>
<line-13> continue</line-13>
<line-14> if prev!=z:</line-14>
<line-15> prev=z</line-15>
<line-16> c+=1</line-16>
<line-17> time+=c+z</line-17>
<line-18></line-18>
<line-19> print(time)</line-19>
<line-21> print(0)</line-21>
<line-22></line-22>
|
{"code": "<line-2> l=list(map(int,input().strip()))</line-2>\n<line-20> else:</line-20>", "lines": [2, 20]}
#### 0
|
<line-1>n = int(input())</line-1>
<line-3> s = input()</line-3>
<line-4> l = len(s)</line-4>
<line-5> n1 = int(s[0])</line-5>
<line-7> print(n1+n2)</line-7>
|
{"code": "<line-2>for i in range(n):</line-2>\n<line-6> n2 = int(s[l-1])</line-6>", "lines": [2, 6]}
#### 0
|
<line-1>tc=int(input())</line-1>
<line-3> m,r=list(map(int,input().split()))</line-3>
<line-4> n=m**(r-1)</line-4>
<line-5> a=[i**n for i in range(1,2*n+1)]</line-5>
<line-6> tmp=2*n-1</line-6>
<line-7> for i in range(n):</line-7>
<line-8> for j in range(tmp-i):</line-8>
<line-10> print((a[n-1]/m)%1000000007)</line-10>
|
{"code": "<line-2>for case in range(tc):</line-2>\n<line-9> a[j]=a[j+1]-a[j]</line-9>", "lines": [2, 9]}
#### 0
|
<line-1>N,M,C = list(map(int, input().split()))</line-1>
<line-3></line-3>
<line-4>def add(u,k):</line-4>
<line-5> while u < len(tree):</line-5>
<line-6> tree[u] += k </line-6>
<line-7> u += u&-u</line-7>
<line-8></line-8>
<line-9>def query(k):</line-9>
<line-10> ans = 0</line-10>
<line-11> while k:</line-11>
<line-12> ans += tree[k]</line-12>
<line-13> k -= k&-k</line-13>
<line-14></line-14>
<line-15> return ans</line-15>
<line-16></line-16>
<line-17>def solve():</line-17>
<line-18> for _ in range(M):</line-18>
<line-19> op = input().split()</line-19>
<line-20> if op[0] == 'Q':</line-20>
<line-21> print(query(int(op[1])) + C)</line-21>
<line-22> else:</line-22>
<line-23> u,v,k = int(op[1]), int(op[2]), int(op[3]) </line-23>
<line-24> add(u, k)</line-24>
<line-25> add(v+1, -k)</line-25>
<line-26></line-26>
<line-27>def __starting_point():</line-27>
<line-29></line-29>
<line-30>__starting_point()</line-30>
|
{"code": "<line-2>tree = [0] * (N+1)</line-2>\n<line-28> solve()</line-28>", "lines": [2, 28]}
#### 0
|
<line-1>tc=int(input())</line-1>
<line-3> n,d=list(map(int,input().split()))</line-3>
<line-4> a=list(map(int,input().split()))</line-4>
<line-5> sm=sum(a)</line-5>
<line-6> f=True</line-6>
<line-7> if sm%n==0:</line-7>
<line-8> avg=sm/n</line-8>
<line-9> for i in range(d):</line-9>
<line-10> tmp_sm=0</line-10>
<line-11> tmp_n=0</line-11>
<line-12> for j in range(i,n,d):</line-12>
<line-13> tmp_sm=tmp_sm+a[j]</line-13>
<line-14> tmp_n+=1</line-14>
<line-15> if tmp_sm%tmp_n==0:</line-15>
<line-16> if avg!=tmp_sm/tmp_n:</line-16>
<line-17> f=False</line-17>
<line-18> break</line-18>
<line-19> else:</line-19>
<line-20> f=False</line-20>
<line-21> break</line-21>
<line-22> else:</line-22>
<line-23> f=False</line-23>
<line-24> if f:</line-24>
<line-25> ans=0</line-25>
<line-26> cur=0</line-26>
<line-27> for i in range(d):</line-27>
<line-28> for j in range(i,n,d):</line-28>
<line-29> cur=cur+avg-a[j]</line-29>
<line-30> ans=ans+abs(cur)</line-30>
<line-31> print(ans)</line-31>
<line-33> print(-1)</line-33>
|
{"code": "<line-2>for case in range(tc):</line-2>\n<line-32> else:</line-32>", "lines": [2, 32]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3></line-3>
<line-4>for _ in range(t):</line-4>
<line-5></line-5>
<line-6> n,s = input().split()</line-6>
<line-7></line-7>
<line-8> N = int(n) </line-8>
<line-9> r = N - len(s)</line-9>
<line-10></line-10>
<line-11> count = 0</line-11>
<line-12></line-12>
<line-13> if N>len(s):</line-13>
<line-14></line-14>
<line-15> count = pow(26, r-1,(10**9+7))</line-15>
<line-16> count*= (26+25*len(s))</line-16>
<line-17></line-17>
<line-19> print(count)</line-19>
<line-20></line-20>
|
{"code": "<line-2>t = int(input())</line-2>\n<line-18> count = count%(10**9 + 7)</line-18>", "lines": [2, 18]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>try:</line-3>
<line-4> n,d=map( int,input().split() )</line-4>
<line-5> a=list(map(int,input().split()))</line-5>
<line-6> a.sort()</line-6>
<line-7> z=abs(a[0]-d)</line-7>
<line-8> for j in range(n):</line-8>
<line-9> x=abs(a[j]-d)</line-9>
<line-10> z=math.gcd(x,z)</line-10>
<line-11> print(z) </line-11>
<line-12> </line-12>
<line-13> </line-13>
<line-15> pass</line-15>
|
{"code": "<line-2>import math</line-2>\n<line-14>except:</line-14>", "lines": [2, 14]}
#### 0
|
<line-1>def multiple_input(): return map(int, input().split())</line-1>
<line-2></line-2>
<line-3></line-3>
<line-5></line-5>
<line-6></line-6>
<line-7>mod = int(1e9) + 7</line-7>
<line-8>for _ in range(int(input())):</line-8>
<line-9> n, m = multiple_input()</line-9>
<line-10> a = list_input()</line-10>
<line-11> a.sort()</line-11>
<line-12> max_level = a[-1] + 1</line-12>
<line-13> levels = [0] * max_level</line-13>
<line-14> levels[0] = 1</line-14>
<line-15> for i in a:</line-15>
<line-16> levels[i] += 1</line-16>
<line-17> ans = 1</line-17>
<line-18> for i in range(1, max_level):</line-18>
<line-20> print(ans)</line-20>
|
{"code": "<line-4>def list_input(): return list(map(int, input().split()))</line-4>\n<line-19> ans = (ans * (pow(levels[i - 1], levels[i], mod))) % mod</line-19>", "lines": [4, 19]}
#### 0
|
<line-1>t=int(input())</line-1>
<line-3> n,k,l=map(int,input().split())</line-3>
<line-4> if k*l<n:</line-4>
<line-5> print(-1)</line-5>
<line-6> elif (k==1 and n>1):</line-6>
<line-7> print(-1)</line-7>
<line-8> else:</line-8>
<line-9> for j in range(n):</line-9>
<line-11> print()</line-11>
|
{"code": "<line-2>for i in range(t):</line-2>\n<line-10> print((j%k)+1,end=' ')</line-10>", "lines": [2, 10]}
#### 0
|
<line-1>test=int(input())</line-1>
<line-3> n=int(input())</line-3>
<line-4> a=list(map(int,input().split()))</line-4>
<line-5> b=[0]*(n+2)</line-5>
<line-6> b[n-1]=1</line-6>
<line-7> for i in range(n-2,-1,-1):</line-7>
<line-8> if(a[i]*a[i+1]<0):</line-8>
<line-9> b[i]=b[i+1]+1</line-9>
<line-10> else:</line-10>
<line-11> b[i]=1</line-11>
<line-12> for i in range(n):</line-12>
<line-14> print() </line-14>
|
{"code": "<line-2>for i in range(test):</line-2>\n<line-13> print(b[i], end=' ')</line-13>", "lines": [2, 13]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>t=int(input())</line-3>
<line-4>for i in range(t):</line-4>
<line-5> s,e,l,r=map(str,input().split())</line-5>
<line-6> l,r=int(l),int(r)</line-6>
<line-7> v=(d.index(e)-d.index(s)+8)%7</line-7>
<line-8> c=r+1</line-8>
<line-9> for i in range(l,r+1):</line-9>
<line-10> if i%7==v:</line-10>
<line-11> c=i</line-11>
<line-12> break</line-12>
<line-13> if c>r:</line-13>
<line-14> print('impossible')</line-14>
<line-15> elif c+7<=r:</line-15>
<line-16> print('many')</line-16>
<line-18> print(c)</line-18>
|
{"code": "<line-2>d=[\"saturday\",\"sunday\",\"monday\",\"tuesday\",\"wednesday\",\"thursday\",\"friday\"]</line-2>\n<line-17> else:</line-17>", "lines": [2, 17]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>def dist(a,b):</line-3>
<line-4> return abs(a[0]-b[0])+abs(a[1]-b[1])</line-4>
<line-5>n, m = map(int, input().split())</line-5>
<line-6>matrix=[]</line-6>
<line-7>id_matrix=[[0 for i in range(n)] for i in range(n)]</line-7>
<line-8>for _ in range(n):</line-8>
<line-9> matrix.append(list(map(int, input().split())))</line-9>
<line-10>charms=[]</line-10>
<line-11>for _ in range(m):</line-11>
<line-12> x,y,lungh = map(int, input().split())</line-12>
<line-13> x-=1 </line-13>
<line-14> y-=1</line-14>
<line-15> charms.append([x,y,lungh])</line-15>
<line-16>if m<=10:</line-16>
<line-17> for i in range(n):</line-17>
<line-18> for j in range(n):</line-18>
<line-19> flag=0</line-19>
<line-20> for charm in charms:</line-20>
<line-21> if dist([i,j],charm[:2])<=charm[2]:</line-21>
<line-22> flag=1</line-22>
<line-23> break</line-23>
<line-24> if flag==0:</line-24>
<line-25> matrix[i][j]=-float('Inf')</line-25>
<line-26> for i in range(1,n):</line-26>
<line-27> matrix[0][i]+=matrix[0][i-1]</line-27>
<line-28> matrix[i][0]+=matrix[i-1][0]</line-28>
<line-29> for i in range(1,n):</line-29>
<line-30> for j in range(1,n):</line-30>
<line-31> matrix[i][j]+=max(matrix[i-1][j], matrix[i][j-1])</line-31>
<line-32>else:</line-32>
<line-33> for charm in charms:</line-33>
<line-34> for i in range(-charm[2],charm[2]+1):</line-34>
<line-35> appo=charm[2]-abs(i)</line-35>
<line-36> for j in range(-appo, appo+1):</line-36>
<line-37> x=i+charm[0]</line-37>
<line-38> y=j+charm[1]</line-38>
<line-39> if x>=0 and x<n and y>=0 and y<n:</line-39>
<line-40> id_matrix[x][y]=1</line-40>
<line-41> if id_matrix[0][0]==0:</line-41>
<line-42> matrix[0][0]=-float('Inf')</line-42>
<line-43> for i in range(1,n):</line-43>
<line-44> if id_matrix[0][i]==0:</line-44>
<line-45> matrix[0][i]=-float('Inf')</line-45>
<line-46> else:</line-46>
<line-47> matrix[0][i]+=matrix[0][i-1]</line-47>
<line-48> if id_matrix[i][0]==0:</line-48>
<line-49> matrix[i][0]=-float('Inf')</line-49>
<line-50> else:</line-50>
<line-51> matrix[i][0]+=matrix[i-1][0]</line-51>
<line-52> for i in range(1,n):</line-52>
<line-53> for j in range(1,n):</line-53>
<line-54> if id_matrix[i][j]==0:</line-54>
<line-55> matrix[i][j]=-float('Inf')</line-55>
<line-56> else:</line-56>
<line-57> matrix[i][j]+=max(matrix[i-1][j], matrix[i][j-1])</line-57>
<line-58>if matrix[n-1][n-1]<-10**(10):</line-58>
<line-59> print('NO')</line-59>
<line-60>else:</line-60>
<line-62> print(matrix[n-1][n-1])</line-62>
|
{"code": "<line-2>import sys </line-2>\n<line-61> print('YES')</line-61>", "lines": [2, 61]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>count = 0</line-3>
<line-4>for _ in range(n):</line-4>
<line-5> L = list(map(int, input().split()))</line-5>
<line-6> if (L.count(1)>=2):</line-6>
<line-8> </line-8>
<line-9>print(count)</line-9>
|
{"code": "<line-2>n = int(input())</line-2>\n<line-7> count+=1</line-7>", "lines": [2, 7]}
#### 0
|
<line-2>a=list(map(int,input().split()))</line-2>
<line-3>a.sort()</line-3>
<line-4>print(a[-1],a[0])</line-4>
|
{"code": "<line-1>n=int(input())</line-1>", "lines": [1]}
#### 0
|
<line-1>from collections import Counter</line-1>
<line-3>for k in range(tc):</line-3>
<line-4> n=int(input())</line-4>
<line-5> a=list(map(int, input().rstrip().split()))</line-5>
<line-6> b= list(map(int, input().rstrip().split()))</line-6>
<line-7> cc=sorted(a+b)</line-7>
<line-8> #print('cc = ',cc)</line-8>
<line-9> p=[]</line-9>
<line-10> q=[]</line-10>
<line-11> #print('len(cc) = ',len(cc))</line-11>
<line-12> #print('len = ',(2*n))</line-12>
<line-13> #rx=0</line-13>
<line-14> for i in range(0,(2*n),2):</line-14>
<line-15> p.append(cc[i])</line-15>
<line-16> #rx+=1</line-16>
<line-17> for i in range(1,(2*n)+1,2):</line-17>
<line-18> q.append(cc[i])</line-18>
<line-19> </line-19>
<line-20> if(p!=q):</line-20>
<line-21> print('-1')</line-21>
<line-22> continue</line-22>
<line-23> a.sort()</line-23>
<line-24> b.sort()</line-24>
<line-25> #print(p)</line-25>
<line-26> #print(q)</line-26>
<line-27> if(a==b):</line-27>
<line-28> print('0')</line-28>
<line-29> continue</line-29>
<line-30> xx = list((Counter(a) - Counter(p)).elements())</line-30>
<line-31> yy = list((Counter(b) - Counter(p)).elements())</line-31>
<line-32> #print('xx = ',xx)</line-32>
<line-33> #print('yy = ',yy)</line-33>
<line-34> iu=len(xx)</line-34>
<line-35> gb=sorted(xx+yy)</line-35>
<line-36> #print(iu)</line-36>
<line-37> uu=xx[0]</line-37>
<line-38> vv=yy[0]</line-38>
<line-39> #print('uu = ',uu)</line-39>
<line-40> #print('vv = ',vv)</line-40>
<line-41> zz=min(cc[0],uu,vv)</line-41>
<line-42> #print('zz = ',zz)</line-42>
<line-43> ans=0</line-43>
<line-44> for i in range(iu):</line-44>
<line-45> if(gb[i]<=(zz*2)):</line-45>
<line-46> ans+=gb[i]</line-46>
<line-47> else:</line-47>
<line-48> ans+=(zz*2)</line-48>
<line-49> print(ans)</line-49>
<line-50> </line-50>
<line-51>#a = [1, 1, 1, 2, 3, 3]</line-51>
<line-52>#b = [1, 1, 2, 2, 3, 4]</line-52>
<line-53></line-53>
<line-54>'''c = []</line-54>
<line-55>i, j = 0, 0</line-55>
<line-56>while i < len(a) and j < len(b):</line-56>
<line-57> if a[i] == b[j]:</line-57>
<line-58> c.append(a[i])</line-58>
<line-59> i += 1</line-59>
<line-60> j += 1</line-60>
<line-61> elif a[i] > b[j]:</line-61>
<line-62> j += 1</line-62>
<line-63> else:</line-63>
<line-65>#print(c)</line-65>
|
{"code": "<line-2>tc=int(input())</line-2>\n<line-64> i += 1'''</line-64>", "lines": [2, 64]}
#### 0
|
<line-1>import math</line-1>
<line-3> count = 0</line-3>
<line-4> while (n): </line-4>
<line-5> n &= (n-1) </line-5>
<line-6> count+= 1</line-6>
<line-7> </line-7>
<line-8> return count</line-8>
<line-9>def f(ca,cb,i,cf,C,n,dp):</line-9>
<line-10> if ca<0 or cb<0:</line-10>
<line-11> return 0</line-11>
<line-12> if i==n:</line-12>
<line-13> if ca==0 and cb==0 and cf==0:</line-13>
<line-14> return 1</line-14>
<line-15> return 0</line-15>
<line-16> st=str(ca)+" "+str(cb)+" "+str(cf)+" "+str(i)</line-16>
<line-17> if dp.get(st)!=None:</line-17>
<line-18> return dp[st]</line-18>
<line-19> x=0 </line-19>
<line-20> if (C&(1<<i))>0:</line-20>
<line-21> x=1</line-21>
<line-22> if x==1:</line-22>
<line-23> #we will have odd num of set bits</line-23>
<line-24> if cf==1:</line-24>
<line-25> dp[st]=f(ca,cb,i+1,0,C,n,dp)+f(ca-1,cb-1,i+1,1,C,n,dp)</line-25>
<line-26> else:</line-26>
<line-27> dp[st]=f(ca-1,cb,i+1,0,C,n,dp)+f(ca,cb-1,i+1,0,C,n,dp)</line-27>
<line-28> else:</line-28>
<line-29> if cf==1:</line-29>
<line-30> dp[st]=f(ca-1,cb,i+1,1,C,n,dp)+f(ca,cb-1,i+1,1,C,n,dp)</line-30>
<line-31> else:</line-31>
<line-32> dp[st]=f(ca,cb,i+1,0,C,n,dp)+f(ca-1,cb-1,i+1,1,C,n,dp)</line-32>
<line-33> </line-33>
<line-34> return dp[st]</line-34>
<line-35>def ip():</line-35>
<line-36> </line-36>
<line-37> for _ in range(int(input())):</line-37>
<line-38> a,b,c=list(map(int,input().split()))</line-38>
<line-39> n=int(math.log(c,2))+1</line-39>
<line-40> dp={}</line-40>
<line-42>ip()</line-42>
|
{"code": "<line-2>def csb(n): </line-2>\n<line-41> print(f(csb(a),csb(b),0,0,c,n,dp))</line-41>", "lines": [2, 41]}
#### 0
|
<line-1>cards = ['A','2','3','4','5','6','7','8','9','T','J','Q','K']</line-1>
<line-2></line-2>
<line-4> nonlocal ans, confirm</line-4>
<line-5> rf_set = 'TJQKA'</line-5>
<line-6> rf = 1</line-6>
<line-7> for char in arr:</line-7>
<line-8> if char[0] not in rf_set:</line-8>
<line-9> rf = 0</line-9>
<line-10> break</line-10>
<line-11> if rf :</line-11>
<line-12> if len(set(suit)) == 1:</line-12>
<line-13> ans = 'royal flush'</line-13>
<line-14> confirm = 1</line-14>
<line-15>def straight_flush(arr): # and 'straight'</line-15>
<line-16> nonlocal ans,confirm</line-16>
<line-17> sf = 1</line-17>
<line-18> for i in range(1,5):</line-18>
<line-19> if arr[i] - arr[i-1] != 1:</line-19>
<line-20> sf = 0</line-20>
<line-21> break</line-21>
<line-22> if sf:</line-22>
<line-23> if len(set(suit)) == 1 :</line-23>
<line-24> ans = 'straight flush'</line-24>
<line-25> confirm = 1</line-25>
<line-26> else:</line-26>
<line-27> ans = 'straight'</line-27>
<line-28> confirm = 1</line-28>
<line-29>def four(arr):</line-29>
<line-30> nonlocal ans, confirm</line-30>
<line-31> f = 0</line-31>
<line-32> for char in arr:</line-32>
<line-33> if arr.count(char) == 4:</line-33>
<line-34> f = 1</line-34>
<line-35> break</line-35>
<line-36> if f:</line-36>
<line-37> confirm = 1</line-37>
<line-38> ans = 'four of a kind'</line-38>
<line-39>def full_house(arr): # and three</line-39>
<line-40> nonlocal ans, confirm</line-40>
<line-41> fh = 0</line-41>
<line-42> three = 0</line-42>
<line-43> two = 0</line-43>
<line-44> for char in arr:</line-44>
<line-45> if arr.count(char) == 3:</line-45>
<line-46> three = 1</line-46>
<line-47> elif arr.count(char) == 2:</line-47>
<line-48> two = 1</line-48>
<line-49> if three and two:</line-49>
<line-50> confirm = 1</line-50>
<line-51> ans = 'full house'</line-51>
<line-52> elif three:</line-52>
<line-53> confirm = 1</line-53>
<line-54> ans = 'three of a kind'</line-54>
<line-55>def two_pairs(arr):</line-55>
<line-56> nonlocal ans, confirm</line-56>
<line-57> temp = []</line-57>
<line-58> for char in arr:</line-58>
<line-59> if arr.count(char) == 2:</line-59>
<line-60> if char not in temp:</line-60>
<line-61> temp.append(char)</line-61>
<line-62> if len(temp) == 2:</line-62>
<line-63> confirm = 1</line-63>
<line-64> ans = 'two pairs'</line-64>
<line-65> elif len(temp) == 1:</line-65>
<line-66> confirm = 1</line-66>
<line-67> ans = 'pair'</line-67>
<line-68></line-68>
<line-69>def idex(char_x):</line-69>
<line-70> return cards.index(char_x)</line-70>
<line-71>for _ in range(int(input())):</line-71>
<line-72> onhand = list(input().split())</line-72>
<line-73> cards_set = [[],[]]</line-73>
<line-74> suit = []</line-74>
<line-75> confirm = 0</line-75>
<line-76> ans = ''</line-76>
<line-77> for c in onhand:</line-77>
<line-78> num = idex(c[0])</line-78>
<line-79> cards_set[0].append(num)</line-79>
<line-80> if num == 0:</line-80>
<line-81> cards_set[1].append(13)</line-81>
<line-82> else:</line-82>
<line-83> cards_set[1].append(num)</line-83>
<line-84> suit.append(c[1])</line-84>
<line-85> royal_flush(onhand)</line-85>
<line-86> if not confirm:</line-86>
<line-87> cards_set[0] = sorted(cards_set[0])</line-87>
<line-88> cards_set[1] = sorted(cards_set[1])</line-88>
<line-89> straight_flush(cards_set[0])</line-89>
<line-90> straight_flush(cards_set[1])</line-90>
<line-91> if not confirm:</line-91>
<line-92> four(cards_set[0])</line-92>
<line-93> four(cards_set[1])</line-93>
<line-94> if not confirm:</line-94>
<line-95> full_house(cards_set[0])</line-95>
<line-96> full_house(cards_set[1])</line-96>
<line-97> if not confirm:</line-97>
<line-98> if len(set(suit)) == 1:</line-98>
<line-99> confirm = 1</line-99>
<line-100> ans = 'flush'</line-100>
<line-101> if not confirm:</line-101>
<line-102> two_pairs(cards_set[0])</line-102>
<line-104> print(ans if confirm else 'high card')</line-104>
|
{"code": "<line-3>def royal_flush(arr):</line-3>\n<line-103> two_pairs(cards_set[1])</line-103>", "lines": [3, 103]}
#### 0
|
<line-1>import numpy as np</line-1>
<line-3> n = int(input())-1;soldiers = [int(j) for j in input().split()]</line-3>
<line-4> force = int(input());attacks = np.zeros(2*n,dtype=int);attacks[:n] = np.array(soldiers);attacks[n:2*n] = attacks[:n];shield = [0 for _ in range(n)];pow_of_2 = 1</line-4>
<line-5> while n // pow_of_2 > 0: pow_of_2 *= 2</line-5>
<line-6> soldier_of_attack = (2 * n - pow_of_2) % n;pow_of_2 = attacks[soldier_of_attack] > force</line-6>
<line-7> </line-7>
<line-8> for i in range(n):</line-8>
<line-9> if attacks[i] > force: shield[i] = 10 ** 11</line-9>
<line-10> elif n == 1: shield[i] = force</line-10>
<line-11> elif pow_of_2:</line-11>
<line-12> shield[i] = force; num_of_survivors = n; soldiers = list(attacks[i:i+n]); starting_soldier = (n - i) % n</line-12>
<line-13> if (num_of_survivors - starting_soldier) % 2 == 1: shield[i] += soldiers[-1]</line-13>
<line-14> soldiers = [soldiers[i] for i in range(num_of_survivors) if i < starting_soldier or (i - starting_soldier) % 2 == 0];num_of_survivors = starting_soldier + (num_of_survivors - starting_soldier - 1) // 2</line-14>
<line-15> if num_of_survivors > 1:</line-15>
<line-16> pow_2 = 1</line-16>
<line-17> while True:</line-17>
<line-18> attacker = num_of_survivors - (num_of_survivors % pow_2); pow_2 *= 2</line-18>
<line-19> if attacker == 0: break</line-19>
<line-20> if attacker % pow_2 == 0: shield[i] += soldiers[attacker]</line-20>
<line-21> elif i == soldier_of_attack: shield[i] = force</line-21>
<line-22> else: shield[i] = force + 1 </line-22>
<line-23> shield_needed = min(shield)</line-23>
<line-24> if shield_needed == 10 ** 11: print("impossible")</line-24>
<line-25> else:</line-25>
<line-26> print("possible")</line-26>
<line-28> if shield[i] == shield_needed:print(str(i+1) + " " + str(shield_needed));break</line-28>
|
{"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-27> for i in range(n):</line-27>", "lines": [2, 27]}
#### 0
|
<line-1>t=int(input())</line-1>
<line-3> n=int(input())</line-3>
<line-4> l=[]</line-4>
<line-5> for i in range(n):</line-5>
<line-6> l.append(list(map(int,input().split())));</line-6>
<line-7> m=[]</line-7>
<line-8> for i in l:</line-8>
<line-9> m.append((i[1]//(i[0]+1))*i[2])</line-9>
<line-10> res=max(m)</line-10>
<line-12> t=t-1</line-12>
|
{"code": "<line-2>while(t):</line-2>\n<line-11> print(res)</line-11>", "lines": [2, 11]}
#### 0
|
<line-1># Why do we fall ? So we can learn to pick ourselves up.</line-1>
<line-2></line-2>
<line-3></line-3>
<line-4></line-4>
<line-5></line-5>
<line-7>for _ in range(0,t):</line-7>
<line-8> n = int(input())</line-8>
<line-9> abc = [int(i) for i in input().split()]</line-9>
<line-10></line-10>
<line-11> i = 0</line-11>
<line-12></line-12>
<line-13> lst = [n]</line-13>
<line-14></line-14>
<line-15> for _ in range(0,100):</line-15>
<line-16> k = str(lst[-1]/abc[i%3]).split('.')</line-16>
<line-17> if int(k[1][0]) > 0:</line-17>
<line-18> lst.append(int(k[1][0]))</line-18>
<line-19> else:</line-19>
<line-20> lst.append(int(k[0][0]))</line-20>
<line-21> i += 1</line-21>
<line-22> pattern = []</line-22>
<line-23> ind = 0</line-23>
<line-24> while len(pattern) == 0:</line-24>
<line-25> for i in range(ind, len(lst) - 1):</line-25>
<line-26> check = lst[ind: i + 1] * 50</line-26>
<line-27> check = check[:len(lst) - ind]</line-27>
<line-28> if lst[ind:] == check:</line-28>
<line-29> pattern = check</line-29>
<line-30> break</line-30>
<line-31> if len(pattern):</line-31>
<line-32> break</line-32>
<line-33> ind += 1</line-33>
<line-34> final_pattern = []</line-34>
<line-35> for i in range(0, len(pattern)):</line-35>
<line-36> couldbe = pattern[:i + 1]</line-36>
<line-37> check = pattern[:i + 1] * 100</line-37>
<line-38> check = check[:len(pattern)]</line-38>
<line-39> if check == pattern:</line-39>
<line-40> final_pattern = couldbe</line-40>
<line-41> break</line-41>
<line-42> lp = len(final_pattern)</line-42>
<line-43> q = int(input())</line-43>
<line-44> for _ in range(0, q):</line-44>
<line-45> qq = int(input())</line-45>
<line-46> if qq < ind:</line-46>
<line-47> print(lst[qq])</line-47>
<line-48> else:</line-48>
<line-49> qq -= ind</line-49>
<line-50> kk = qq % lp</line-50>
<line-51> print(final_pattern[kk])</line-51>
<line-52></line-52>
<line-53></line-53>
<line-54></line-54>
<line-55></line-55>
<line-56></line-56>
<line-57></line-57>
<line-58></line-58>
<line-59>"""</line-59>
<line-60>1</line-60>
<line-61>56</line-61>
<line-62>3 5 7</line-62>
<line-63>4</line-63>
<line-64>0</line-64>
<line-65>1</line-65>
<line-66>2</line-66>
<line-68></line-68>
<line-69>"""</line-69>
|
{"code": "<line-6>t = int(input())</line-6>\n<line-67>3</line-67>", "lines": [6, 67]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3> n,q=map(int,input().split())</line-3>
<line-4> l=[int(i) for i in input().split()]</line-4>
<line-5> qry=[int(input()) for i in range(q)]</line-5>
<line-6> def cmp(sub1,sub2):</line-6>
<line-7> for i in range(len(sub1)):</line-7>
<line-8> if sub1[i]>sub2[i]:</line-8>
<line-9> return 1 </line-9>
<line-10> if sub1[i]<sub2[i]:</line-10>
<line-11> return 2 </line-11>
<line-12> return 1 </line-12>
<line-13> maxl=[]</line-13>
<line-14> for i in range(n):</line-14>
<line-15> for j in range(i,n):</line-15>
<line-16> maxl.append(max(l[i:j+1]))</line-16>
<line-17> maxl.sort(reverse=True)</line-17>
<line-19> print(maxl[i-1])</line-19>
|
{"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-18> for i in qry:</line-18>", "lines": [2, 18]}
#### 0
|
<line-1>from fractions import gcd</line-1>
<line-3> n = eval(input())</line-3>
<line-4> if n == 1:</line-4>
<line-5> print('1')</line-5>
<line-6> elif n == 2:</line-6>
<line-7> print('2')</line-7>
<line-8> elif n == 3:</line-8>
<line-9> print('6')</line-9>
<line-10> else:</line-10>
<line-11> c = n*(n-1)</line-11>
<line-12> k = n - 2</line-12>
<line-13> while True:</line-13>
<line-14> if gcd(k,n-1) == 1 and gcd(k,n) == 1:</line-14>
<line-15> break</line-15>
<line-16> k -= 1</line-16>
<line-17> d = (n-1)*(n - 2)</line-17>
<line-18> k1 = n - 3</line-18>
<line-19> while True:</line-19>
<line-20> if gcd(k1,n-1) == 1 and gcd(k1,n-2) == 1:</line-20>
<line-21> break</line-21>
<line-23> print(max(c*k,d*k1))</line-23>
|
{"code": "<line-2>for testCases in range(eval(input())):</line-2>\n<line-22> k1 -= 1</line-22>", "lines": [2, 22]}
#### 0
|
<line-1>#from itertools import combinations as c</line-1>
<line-3>l1=[]</line-3>
<line-4>if(n<3):</line-4>
<line-5> print("NO")</line-5>
<line-6>else:</line-6>
<line-7> l.sort()</line-7>
<line-8> for i in range(n-2):</line-8>
<line-9> if(l[i]+l[i+1]>l[i+2]):</line-9>
<line-10> l1.append([l[i+2],l[i+1],l[i]])</line-10>
<line-11>if(len(l1)!=0):</line-11>
<line-12> print("YES")</line-12>
<line-13> print(*max(l1))</line-13>
<line-15> print("NO")</line-15>
|
{"code": "<line-2>n=int(input());l=list(map(int,input().split()))</line-2>\n<line-14>else:</line-14>", "lines": [2, 14]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3> </line-3>
<line-4>def BinarySearch(a, x): </line-4>
<line-5> i = bisect_left(a, x) </line-5>
<line-6> if i != len(a) and a[i] == x: </line-6>
<line-7> return i </line-7>
<line-8> else: </line-8>
<line-9> return -1</line-9>
<line-10></line-10>
<line-11>for _t in range(int(input())):</line-11>
<line-12> _n, q = list(map(int, input().split()))</line-12>
<line-13> mounts = list(map(int, input().split()))</line-13>
<line-14> for _q in range(q):</line-14>
<line-15> query = list(map(int, input().split()))</line-15>
<line-16> if query[0] == 0:</line-16>
<line-17> mounts[query[1]] = query[2]</line-17>
<line-18> else:</line-18>
<line-19> curr = query[1]</line-19>
<line-20> prev = set(mounts[:curr+1])</line-20>
<line-21> for m in mounts[curr+1:]:</line-21>
<line-22> if m > mounts[curr] and m not in prev:</line-22>
<line-23> print(m)</line-23>
<line-24> break</line-24>
<line-26> print(-1)</line-26>
<line-27> </line-27>
|
{"code": "<line-2>from bisect import bisect_left </line-2>\n<line-25> else:</line-25>", "lines": [2, 25]}
#### 0
|
<line-1>try:</line-1>
<line-3> arr=list(map(int, input().split()))</line-3>
<line-4> forward = [0]*(n+1)</line-4>
<line-5> backward= [0]*(n+1)</line-5>
<line-6> backward[0]=arr[0]</line-6>
<line-7> backward[1]=arr[0]+arr[1]</line-7>
<line-8> for i in range(k, n):</line-8>
<line-9> forward[i]=arr[i] +max(forward[i-1],forward[i-2])</line-9>
<line-10></line-10>
<line-11> for i in range(2, n):</line-11>
<line-12> backward[i]=arr[i]+max(backward[i-1],backward[i-2])</line-12>
<line-13> </line-13>
<line-14> ans=-float("Inf")</line-14>
<line-15> for i in range(k-1, n):</line-15>
<line-16> ans=max(ans, forward[i]+backward[i]-arr[i])</line-16>
<line-17> print(ans)</line-17>
<line-19> pass</line-19>
|
{"code": "<line-2> n, k=map(int, input().split())</line-2>\n<line-18>except Exception:</line-18>", "lines": [2, 18]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3> n = int(input())</line-3>
<line-4> a = list(map(int, input().split()))</line-4>
<line-5> curr = 0</line-5>
<line-6> ans = 0</line-6>
<line-7> for x in a:</line-7>
<line-8> curr += x</line-8>
<line-10> print(ans)</line-10>
|
{"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-9> ans += abs(curr)</line-9>", "lines": [2, 9]}
#### 0
|
<line-1>#dt = {} for i in x: dt[i] = dt.get(i,0)+1</line-1>
<line-3>inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()]</line-3>
<line-4></line-4>
<line-5>n,k = ip()</line-5>
<line-6>x = ip()</line-6>
<line-7>x.sort()</line-7>
<line-8>if k == 1:</line-8>
<line-9> a = x[n//2]</line-9>
<line-10> b = x[n//2-1]</line-10>
<line-11>else:</line-11>
<line-12> s = sum(x)</line-12>
<line-13> a = s//n</line-13>
<line-14> b = a + 1</line-14>
<line-15>sa = sum([abs((a-i)**k) for i in x])</line-15>
<line-16>sb = sum([abs((b-i)**k) for i in x])</line-16>
<line-17>if sa < sb:</line-17>
<line-18> print(a)</line-18>
<line-20> print(b)</line-20>
|
{"code": "<line-2>import sys;input = sys.stdin.readline</line-2>\n<line-19>else:</line-19>", "lines": [2, 19]}
#### 0
|
<line-1>for _ in range(int(input())):</line-1>
<line-3></line-3>
<line-4></line-4>
<line-5> def maxConsequtiveOnes(lst):</line-5>
<line-6> _max = 0</line-6>
<line-7> _ones = [0]</line-7>
<line-8> for i in lst:</line-8>
<line-9> if i == 0:</line-9>
<line-10> _max += 1</line-10>
<line-11> if i == 1:</line-11>
<line-12> _max = 0</line-12>
<line-13> _ones.append(_max)</line-13>
<line-14> return max(_ones)</line-14>
<line-15></line-15>
<line-16></line-16>
<line-17> a = list(map(int, input().split()))</line-17>
<line-18> b = maxConsequtiveOnes(a)</line-18>
<line-19> if (b % 2 == 0):</line-19>
<line-20> print("No")</line-20>
<line-22> print("Yes")</line-22>
<line-23></line-23>
|
{"code": "<line-2> n=int(input())</line-2>\n<line-21> else:</line-21>", "lines": [2, 21]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>primes = {2,3,5,7,11,13,17}</line-3>
<line-4>edges = [(0,3),(0,1),(1,2),(1,4),(2,5),(3,4),(3,6),(4,5),(4,7),(5,8),(6,7),(7,8)]</line-4>
<line-5>x = [1,2,3,4,5,6,7,8,9]</line-5>
<line-6>avail = {tuple(x):0}</line-6>
<line-7>q = deque([x])</line-7>
<line-8>while q:</line-8>
<line-9> curr = q.popleft();</line-9>
<line-10> for e in edges:</line-10>
<line-11> if curr[e[0]]+curr[e[1]] in primes:</line-11>
<line-12> nxt = curr[0:]</line-12>
<line-13> nxt[e[0]],nxt[e[1]] = nxt[e[1]], nxt[e[0]] </line-13>
<line-14> nxtt = tuple(nxt)</line-14>
<line-15> if nxtt not in avail:</line-15>
<line-16> avail[nxtt] = avail[tuple(curr)]+1</line-16>
<line-17> q.append(nxt)</line-17>
<line-18>t = int(input())</line-18>
<line-19>while t:</line-19>
<line-20> inp = input()</line-20>
<line-21> grid = []</line-21>
<line-22> for i in range(3):</line-22>
<line-23> inp = input()</line-23>
<line-24> for j in inp.strip().split(" "):</line-24>
<line-25> grid.append(int(j))</line-25>
<line-26> gridt = tuple(grid)</line-26>
<line-27> if gridt in avail: print(avail[gridt])</line-27>
<line-29> t-= 1</line-29>
|
{"code": "<line-2>from collections import deque</line-2>\n<line-28> else: print(-1);</line-28>", "lines": [2, 28]}
#### 0
|
<line-1>def bookList():</line-1>
<line-3> bookNum=[int(x) for x in input().split()]</line-3>
<line-4> takenBooks=int(input())</line-4>
<line-5> for i in range(takenBooks):</line-5>
<line-6> takenBookPos=(int(input()))</line-6>
<line-7> a=bookNum[takenBookPos-1]</line-7>
<line-8> print(a)</line-8>
<line-10></line-10>
<line-11>bookList()</line-11>
|
{"code": "<line-2> numBooks=int(input())</line-2>\n<line-9> bookNum.remove(a)</line-9>", "lines": [2, 9]}
#### 0
|
<line-1>for _ in range(int(input())):</line-1>
<line-3> l=list(map(int,input().split()))</line-3>
<line-4> su=l[0]</line-4>
<line-5> for i in range(1,n):</line-5>
<line-7> print(su)</line-7>
|
{"code": "<line-2> n=int(input())</line-2>\n<line-6> su^=l[i]</line-6>", "lines": [2, 6]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3> n=int(input())</line-3>
<line-4> a=[int(x) for x in input().split()]</line-4>
<line-5> sum=0</line-5>
<line-6> for i in range(n):</line-6>
<line-7> if a[i]%2==0:</line-7>
<line-8> sum+=1</line-8>
<line-9> a[i]=sum </line-9>
<line-10> q=int(input())</line-10>
<line-11> while q:</line-11>
<line-12> l,r=map(int,input().split())</line-12>
<line-13> if l!=1:</line-13>
<line-14> c=a[r-1]-a[l-2]</line-14>
<line-15> else:</line-15>
<line-16> c=a[r-1] </line-16>
<line-17> if c==0:</line-17>
<line-18> print("ODD")</line-18>
<line-19> else:</line-19>
<line-21> q-=1</line-21>
|
{"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-20> print(\"EVEN\")</line-20>", "lines": [2, 20]}
#### 0
|
<line-1>T=int(input())</line-1>
<line-3> x,y=map(int,input().split())</line-3>
<line-4> while(y): </line-4>
<line-5> x, y = y, x % y</line-5>
<line-6> if x==1:</line-6>
<line-7> print("YES")</line-7>
<line-8> else:</line-8>
<line-10> T-=1</line-10>
|
{"code": "<line-2>while T:</line-2>\n<line-9> print(\"NO\")</line-9>", "lines": [2, 9]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3> n,m = list(map(int,input().split()))</line-3>
<line-4> colors = [0]*41; cost = [0]*41</line-4>
<line-5> color = 0</line-5>
<line-6> for i in range(n):</line-6>
<line-7> cc,pp = list(map(int,input().split()))</line-7>
<line-8> colors[cc] += 1</line-8>
<line-9> cost[cc] += pp</line-9>
<line-10> for i in colors:</line-10>
<line-11> if i>0: color += 1</line-11>
<line-12> dp2 = [[0]*41 for i in range(color+1)]</line-12>
<line-13> dp2[0] = [1]*41</line-13>
<line-14> for i in range(1,color+1):</line-14>
<line-15> for j in range(1,41):</line-15>
<line-16> dp2[i][j] = dp2[i][j-1]+dp2[i-1][j-1]*(2**colors[j]-1)</line-16>
<line-17> dp1 = [[0]*41 for i in range(color+1)]</line-17>
<line-18> for i in range(1,color+1):</line-18>
<line-19> for j in range(1,41):</line-19>
<line-20> dp1[i][j] = dp1[i][j-1]+dp1[i-1][j-1]*(2**colors[j]-1)+dp2[i-1][j-1]*cost[j]*(2**(colors[j]-1))</line-20>
<line-21> num=den=0</line-21>
<line-22> for i in range(m,color+1):</line-22>
<line-23> num += dp1[i][40]</line-23>
<line-25> print(num/den)</line-25>
|
{"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-24> den += dp2[i][40]</line-24>", "lines": [2, 24]}
#### 0
|
<line-1>for _ in range(int(input())):</line-1>
<line-3> ls = []</line-3>
<line-4> rs = []</line-4>
<line-5> lrs = []</line-5>
<line-6></line-6>
<line-7> for i in range(n):</line-7>
<line-8> l, r = map(int, input().split())</line-8>
<line-9> ls.append(l)</line-9>
<line-10> rs.append(r)</line-10>
<line-11> lrs.append((l, r, i))</line-11>
<line-12></line-12>
<line-13> lrs.sort()</line-13>
<line-14></line-14>
<line-15> c = 0</line-15>
<line-16> maxi = -1</line-16>
<line-17></line-17>
<line-18> res = [-1] * n</line-18>
<line-19> for l, r, i in lrs:</line-19>
<line-20> if ls[i] > maxi:</line-20>
<line-21> maxi = rs[i]</line-21>
<line-22> res[i] = c</line-22>
<line-23></line-23>
<line-24> elif rs[i] <= maxi:</line-24>
<line-25> res[i] = 1^c</line-25>
<line-26></line-26>
<line-27> else:</line-27>
<line-28> maxi = rs[i]</line-28>
<line-29> c ^= 1</line-29>
<line-31></line-31>
<line-32> print(*res, sep='')</line-32>
|
{"code": "<line-2> n = int(input())</line-2>\n<line-30> res[i] = c</line-30>", "lines": [2, 30]}
#### 0
|
<line-1>def main():</line-1>
<line-3> [n, m] = [int(i) for i in input().split()]</line-3>
<line-4> if n == m and n == 0:</line-4>
<line-5> break</line-5>
<line-6> cache = {}</line-6>
<line-7> for i in range(n):</line-7>
<line-8> dna = input().rstrip('\n')</line-8>
<line-9> if dna in cache:</line-9>
<line-10> cache[dna] = 1 + cache[dna]</line-10>
<line-11> else:</line-11>
<line-12> cache[dna] = 1</line-12>
<line-13> c = [0 for i in range(n + 1)]</line-13>
<line-14> for dna in cache:</line-14>
<line-15> c[cache[dna]] = 1 + c[cache[dna]]</line-15>
<line-16> for i in range(1, n + 1):</line-16>
<line-17> print(c[i])</line-17>
<line-18> </line-18>
<line-19>def __starting_point():</line-19>
<line-21>__starting_point()</line-21>
|
{"code": "<line-2> while True:</line-2>\n<line-20> main()</line-20>", "lines": [2, 20]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5> </line-5>
<line-6></line-6>
<line-7>t = int(input())</line-7>
<line-8>while t:</line-8>
<line-9> t-=1</line-9>
<line-10> c=0</line-10>
<line-11> ar=[int(i) for i in input().strip().split()]</line-11>
<line-12> for i in range(1,16):</line-12>
<line-13> b=bin(i)[2:].zfill(4)</line-13>
<line-14> s=0</line-14>
<line-15> for i in range(4):</line-15>
<line-16> if b[i]=='1':</line-16>
<line-17> s+=ar[i]</line-17>
<line-18> </line-18>
<line-19> if(s==0):</line-19>
<line-20> c=1</line-20>
<line-22> </line-22>
<line-23> print("Yes" if c==1 else "No")</line-23>
|
{"code": "<line-3># cook your dish here</line-3>\n<line-21> break</line-21>", "lines": [3, 21]}
#### 0
|
<line-1>from sys import stdin,stdout</line-1>
<line-3>n=int(input())</line-3>
<line-4>a=[[] for i in range(n)]</line-4>
<line-5>for i in range(n-1):</line-5>
<line-6> u,v=map(int,input().split())</line-6>
<line-7> a[u-1].append(v-1)</line-7>
<line-8> a[v-1].append(u-1)</line-8>
<line-9>b=[0]*n</line-9>
<line-10>vis=[0]*n</line-10>
<line-11>st=[(0,0)]</line-11>
<line-12>vis[0]=1</line-12>
<line-13>pa=[0]*n</line-13>
<line-14>while st:</line-14>
<line-15> x,y=st.pop()</line-15>
<line-16> b[x]=y</line-16>
<line-17> for i in a[x]:</line-17>
<line-18> if vis[i]==0:</line-18>
<line-19> pa[i]=x</line-19>
<line-20> vis[i]=1</line-20>
<line-21> if x==0:</line-21>
<line-22> st.append((i,y+len(a[x])-1))</line-22>
<line-23> else:</line-23>
<line-24> st.append((i,y+len(a[x])-2))</line-24>
<line-25>c=[]</line-25>
<line-26>for i in range(1,n):</line-26>
<line-27> if len(a[i])==1:</line-27>
<line-28> c.append((b[i],i))</line-28>
<line-29>c.sort()</line-29>
<line-30>ans=0</line-30>
<line-31>while c:</line-31>
<line-32> x,y=c.pop()</line-32>
<line-33> m=y</line-33>
<line-34> p=0</line-34>
<line-35> while y!=0 and pa[y]!=-1:</line-35>
<line-36> y=pa[y]</line-36>
<line-37> if pa[y]==-1:</line-37>
<line-38> break</line-38>
<line-39> if y!=0:</line-39>
<line-40> p+=(len(a[y])-2)</line-40>
<line-41> else:</line-41>
<line-42> p+=(len(a[y])-1)</line-42>
<line-43> if p>=1:</line-43>
<line-44> p=0</line-44>
<line-45> while m!=0 and pa[m]!=-1:</line-45>
<line-46> x=m</line-46>
<line-47> if pa[m]==-1:</line-47>
<line-48> break</line-48>
<line-49> m=pa[m]</line-49>
<line-50> pa[x]=-1</line-50>
<line-51> if m!=0:</line-51>
<line-52> p+=(len(a[m])-2)</line-52>
<line-53> else:</line-53>
<line-54> p+=(len(a[m])-1)</line-54>
<line-55> if y==0:</line-55>
<line-56> pa[0]=-1</line-56>
<line-57>for i in range(n):</line-57>
<line-58> if pa[i]!=-1:</line-58>
<line-59> st=[i]</line-59>
<line-60> pa[i]=-1</line-60>
<line-61> while st:</line-61>
<line-62> x=st.pop()</line-62>
<line-63> for j in a[x]:</line-63>
<line-64> if pa[j]!=-1:</line-64>
<line-65> pa[j]=-1</line-65>
<line-66> st.append(j)</line-66>
<line-68>print(ans)</line-68>
|
{"code": "<line-2>input=stdin.readline</line-2>\n<line-67> ans+=1</line-67>", "lines": [2, 67]}
#### 0
|
<line-1>testcase = int(input())</line-1>
<line-3> n = int(input())</line-3>
<line-5> print('\n') </line-5>
|
{"code": "<line-2>for case in range(testcase):</line-2>\n<line-4> print(2**(n-2)+1)</line-4>", "lines": [2, 4]}
#### 0
|
<line-1># This is not my code, it's Snehasish Karmakar's. Refer to http://www.codechef .com/viewsolution/7153774</line-1>
<line-3># Submitting it to try and work out if it can be sped up.</line-3>
<line-4></line-4>
<line-5>def compute_nCr(n,r) :</line-5>
<line-6> C[0][0]=1</line-6>
<line-7> for i in range(1,n+1) :</line-7>
<line-8># print "i",i</line-8>
<line-9> C[i][0]=1</line-9>
<line-10> for j in range(1,min(i,r)+1) :</line-10>
<line-11> if i!=j :</line-11>
<line-12> C[i][j]=(C[i-1][j-1]+C[i-1][j])%MOD</line-12>
<line-13> else :</line-13>
<line-14> C[i][j]=1</line-14>
<line-15> </line-15>
<line-16> </line-16>
<line-17>def solve(n,m) :</line-17>
<line-18> store=[C[m+i-1][i] for i in range(m+1)]</line-18>
<line-19> </line-19>
<line-20> for i in range(1,n+1) :</line-20>
<line-21> s=1</line-21>
<line-22> for j in range(1,m+1) :</line-22>
<line-23> s=(s+store[j])%MOD</line-23>
<line-24> store[j]=(s*C[m+j-1][j])%MOD</line-24>
<line-25> # print "a[%d][%d]=%d"%(i,j,s)</line-25>
<line-26> </line-26>
<line-27> return s </line-27>
<line-28> </line-28>
<line-29>MOD=1000000000</line-29>
<line-30>LIMIT=2000</line-30>
<line-31> </line-31>
<line-32>C=[[0] * (LIMIT + 1) for _ in range(2*LIMIT+1)]</line-32>
<line-33>compute_nCr(2*LIMIT,LIMIT)</line-33>
<line-34>t=int(input())</line-34>
<line-35> </line-35>
<line-36>while t :</line-36>
<line-37> n,m=list(map(int,input().split()))</line-37>
<line-39> t-=1</line-39>
|
{"code": "<line-2># for original version.</line-2>\n<line-38> print(solve(n,m))</line-38>", "lines": [2, 38]}
#### 0
|
<line-1>try:</line-1>
<line-3> for i in range(t):</line-3>
<line-4> n,k=map(int,input().split())</line-4>
<line-5> s=input()</line-5>
<line-6> l=[-1]*len(s)</line-6>
<line-7> numb=s.count('b')</line-7>
<line-8> x=numb</line-8>
<line-9> for j in range(len(s)):</line-9>
<line-10> if(s[j]=='a'):</line-10>
<line-11> l[j]=numb</line-11>
<line-12> if(s[j]=='b'):</line-12>
<line-13> numb=numb-1</line-13>
<line-14> #print(l)</line-14>
<line-15> count1=0</line-15>
<line-16> for j in range(len(l)):</line-16>
<line-17> if(l[j]>0):</line-17>
<line-18> count1=count1+(k*(2*l[j]+(k-1)*x))//2</line-18>
<line-19> elif(l[j]==0):</line-19>
<line-20> count1=count1+(k*(2*0+(k-1)*x))//2</line-20>
<line-21> print(count1)</line-21>
<line-23> pass</line-23>
|
{"code": "<line-2> t=int(input())</line-2>\n<line-22>except:</line-22>", "lines": [2, 22]}
#### 0
|
<line-1>for i in range(int(input())):</line-1>
<line-3> b=input().split()</line-3>
<line-4> if '0' in b:</line-4>
<line-5> print(100*(a-b.index('0'))+b.count('0')*1000)</line-5>
<line-7> print(0)</line-7>
|
{"code": "<line-2> a=int(input())</line-2>\n<line-6> else:</line-6>", "lines": [2, 6]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>from itertools import combinations</line-3>
<line-4>n = int(input())</line-4>
<line-5>t = list(combinations(list(map(int, input().split())), 2))</line-5>
<line-6>ar = 0</line-6>
<line-7>for i in t:</line-7>
<line-9>print(ar)</line-9>
|
{"code": "<line-2># cook your dish here</line-2>\n<line-8> ar += abs(i[0] - i[1])</line-8>", "lines": [2, 8]}
#### 0
|
<line-1>for _ in range(int(input())):</line-1>
<line-3> a=input()</line-3>
<line-4> b=input()</line-4>
<line-5> l=[]</line-5>
<line-6> flag=0</line-6>
<line-7> for i in range(n):</line-7>
<line-8> if b[i]!=a[i]:</line-8>
<line-9> if b[i] in a and b[i]<a[i]:</line-9>
<line-10> l.append(b[i])</line-10>
<line-11> else:</line-11>
<line-12> flag=1</line-12>
<line-13> break</line-13>
<line-14> if flag==1:</line-14>
<line-15> print(-1)</line-15>
<line-16> else:</line-16>
<line-17> if l==[]:</line-17>
<line-18> print(0)</line-18>
<line-19> else:</line-19>
<line-20> l = sorted(list(set(l)), reverse = True)</line-20>
<line-21> print(len(l))</line-21>
<line-22> for i in range(len(l)):</line-22>
<line-23> q=[]</line-23>
<line-24> r=[]</line-24>
<line-25> for j in range(len(a)):</line-25>
<line-26> if l[i]==b[j]:</line-26>
<line-27> q.append(j)</line-27>
<line-28> r.append(a[j])</line-28>
<line-29> if l[i] not in r:</line-29>
<line-30> for k in range(len(a)):</line-30>
<line-31> if a[k]==l[i]:</line-31>
<line-33> print(len(q),*q)</line-33>
<line-34> </line-34>
|
{"code": "<line-2> n=int(input())</line-2>\n<line-32> q.append(k)</line-32>", "lines": [2, 32]}
#### 0
|
<line-1>for _ in range(int(input())):</line-1>
<line-3> n,m=int(n),int(m)</line-3>
<line-4> x=y=c=0</line-4>
<line-5> l=list(map(int,input().split()))</line-5>
<line-6> for i in range(n):</line-6>
<line-7> for j in range(i,n):</line-7>
<line-8> x=x+l[j]</line-8>
<line-9> if (x%m)>y:</line-9>
<line-10> y=x%m</line-10>
<line-11> c=1</line-11>
<line-12> elif y==(x%m):</line-12>
<line-13> c+=1</line-13>
<line-15> print(y,c)</line-15>
<line-16></line-16>
|
{"code": "<line-2> n,m=input().split()</line-2>\n<line-14> x = 0</line-14>", "lines": [2, 14]}
#### 0
|
<line-1>def fact(n):</line-1>
<line-3> return 1</line-3>
<line-4> return n * fact(n-1)</line-4>
<line-5> </line-5>
<line-6>def ncr(n, r):</line-6>
<line-7> return fact(n)// (fact(r)*fact(n-r))</line-7>
<line-8> </line-8>
<line-9>t=int(input())</line-9>
<line-10></line-10>
<line-11>for _ in range(t):</line-11>
<line-12> n, k = list(map(int, input().split()))</line-12>
<line-13> a = list(map(int, input().split()))</line-13>
<line-14> a.sort()</line-14>
<line-15> count_z = a.count(a[k-1])</line-15>
<line-17> </line-17>
<line-18> print(ncr(count_z, count_z_seq))</line-18>
|
{"code": "<line-2> if n<2:</line-2>\n<line-16> count_z_seq = a[:k].count(a[k-1])</line-16>", "lines": [2, 16]}
#### 0
|
<line-1>import sys</line-1>
<line-2></line-2>
<line-4> s=sys.stdin.readline</line-4>
<line-5> n, m = list(map(int, s().split()))</line-5>
<line-6> nums={}</line-6>
<line-7> for i in range(1, n+1):</line-7>
<line-8> nums[i]=list(map(int, s().split()))</line-8>
<line-9> cases=int(s())</line-9>
<line-10> for case in range(cases):</line-10>
<line-11> px, py, qx, qy = list(map(int, s().split()))</line-11>
<line-12> ans=[]</line-12>
<line-13> for i in range(px, qx+1):</line-13>
<line-14> for j in range(py-1, qy):</line-14>
<line-15> ans.append(nums[i][j])</line-15>
<line-16> print(sum(ans))</line-16>
<line-17></line-17>
<line-18>def __starting_point():</line-18>
<line-20>__starting_point()</line-20>
|
{"code": "<line-3>def main():</line-3>\n<line-19> main()</line-19>", "lines": [3, 19]}
#### 0
|
<line-1>a=int(input())</line-1>
<line-3> c,d=list(map(int,input().split()))</line-3>
<line-4> crr=[[[0,0] for i in range(c+1)] for j in range(c+1)]</line-4>
<line-5> trr=[]</line-5>
<line-6> for i in range(c):</line-6>
<line-7> kk=list(input().split())</line-7>
<line-8> trr.append(kk)</line-8>
<line-9> for i in range(1,c+1):</line-9>
<line-10> for j in range(1,c+1):</line-10>
<line-11> if(trr[i-1][j-1]=='a'):</line-11>
<line-12> crr[i][j][0]=max(crr[i-1][j][0],crr[i][j-1][0])+1</line-12>
<line-13> if(j==1):</line-13>
<line-14> crr[i][j][1]=crr[i-1][j][1]+1</line-14>
<line-15> elif(i==1):</line-15>
<line-16> crr[i][j][1]=crr[i][j-1][1]+1</line-16>
<line-17> elif(crr[i-1][j][0]>crr[i][j-1][0]):</line-17>
<line-18> crr[i][j][1]=crr[i-1][j][1]+1</line-18>
<line-19> else:</line-19>
<line-20> crr[i][j][1]=crr[i][j-1][1]+1</line-20>
<line-21> else:</line-21>
<line-22> crr[i][j][0]=max(crr[i-1][j][0],crr[i][j-1][0])</line-22>
<line-23> if(j==1):</line-23>
<line-24> crr[i][j][1]=crr[i-1][j][1]+1</line-24>
<line-25> elif(i==1):</line-25>
<line-26> crr[i][j][1]=crr[i][j-1][1]+1</line-26>
<line-27> elif(crr[i-1][j][0]>crr[i][j-1][0]):</line-27>
<line-28> crr[i][j][1]=crr[i-1][j][1]+1</line-28>
<line-29> else:</line-29>
<line-30> crr[i][j][1]=crr[i][j-1][1]+1</line-30>
<line-31> </line-31>
<line-32> for i in range(d):</line-32>
<line-34> print(crr[m][n][1]-crr[m][n][0])</line-34>
<line-35> </line-35>
|
{"code": "<line-2>for _ in range(a):</line-2>\n<line-33> m,n=list(map(int,input().split()))</line-33>", "lines": [2, 33]}
#### 0
|
<line-1>t = eval(input())</line-1>
<line-3> n, m = list(map(int, input().split()))</line-3>
<line-4> if n*m == 2:</line-4>
<line-5> print('Yes')</line-5>
<line-6> elif (n*m)%2 == 0 and m != 1 and n != 1:</line-6>
<line-7> print('Yes')</line-7>
<line-9> print('No')</line-9>
|
{"code": "<line-2>for _ in range(t):</line-2>\n<line-8> else:</line-8>", "lines": [2, 8]}
#### 0
|
<line-1>def bestMovie():</line-1>
<line-3> for t in range(tests):</line-3>
<line-4> n = int(input())</line-4>
<line-5> L = list(map(int, input().split()))</line-5>
<line-6> R = list(map(int, input().split()))</line-6>
<line-7> maxIndex = -1</line-7>
<line-8> maxValue = 0</line-8>
<line-9> for i in range(n):</line-9>
<line-10> prod = L[i]*R[i]</line-10>
<line-11> if maxValue < prod:</line-11>
<line-12> maxValue = prod</line-12>
<line-13> maxIndex = i</line-13>
<line-14> elif maxValue == prod:</line-14>
<line-15> if R[maxIndex] < R[i]:</line-15>
<line-16> maxIndex = i</line-16>
<line-18></line-18>
<line-19>bestMovie()</line-19>
|
{"code": "<line-2> tests=int(input())</line-2>\n<line-17> print(maxIndex+1)</line-17>", "lines": [2, 17]}
#### 0
|
<line-1>for t in range(eval(input())):</line-1>
<line-3> n-=n%10</line-3>
<line-5> print(n*(n+1)/2*10)</line-5>
|
{"code": "<line-2> n=eval(input())</line-2>\n<line-4> n/=10</line-4>", "lines": [2, 4]}
#### 0
|
<line-1>T = int(input())</line-1>
<line-3> x = int(input())</line-3>
<line-4> l= [int(x) for x in input().split()]</line-4>
<line-5> t=[]</line-5>
<line-6> for i in range(len(l)):</line-6>
<line-8> print(max(t))</line-8>
|
{"code": "<line-2>for i in range(T):</line-2>\n<line-7> t.append(l[i]+i) </line-7>", "lines": [2, 7]}
#### 0
|
<line-1>def isSubsetSum(arr, n, sum): </line-1>
<line-3> for i in range(n + 1): </line-3>
<line-4> for j in range(sum + 1): </line-4>
<line-5> if (j == 0):subset[i % 2][j] = True</line-5>
<line-6> elif (i == 0):subset[i % 2][j] = False</line-6>
<line-7> elif (arr[i - 1] <= j):subset[i % 2][j] = subset[(i + 1) % 2][j - arr[i - 1]] or subset[(i + 1)% 2][j] </line-7>
<line-8> else:subset[i % 2][j] = subset[(i + 1) % 2][j] </line-8>
<line-9> return subset[n % 2][sum] </line-9>
<line-10>for _ in range(int(input())):</line-10>
<line-11> k,n,a = int(input()),int(input()),list(map(int,input().split()))</line-11>
<line-13> print(1) if isSubsetSum(a, n, k) else print(0)</line-13>
|
{"code": "<line-2> subset = [ [False for j in range(sum + 1)] for i in range(3) ] </line-2>\n<line-12> if sum(a) < k or k < min(a):print(0);continue</line-12>", "lines": [2, 12]}
#### 0
|
<line-1>def func(num):</line-1>
<line-3> if i < num//2 + 1:</line-3>
<line-4> print(' '*i, end='')</line-4>
<line-5> print('*')</line-5>
<line-6> else:</line-6>
<line-7> print(' '*(num-i-1), end='')</line-7>
<line-8> print('*')</line-8>
<line-9></line-9>
<line-10></line-10>
<line-11></line-11>
<line-12>for _ in range(int(input())):</line-12>
<line-14> func(num)</line-14>
|
{"code": "<line-2> for i in range(num):</line-2>\n<line-13> num = int(input())</line-13>", "lines": [2, 13]}
#### 0
|
<line-1>M = 10 ** 9 + 7</line-1>
<line-3> s,p,m,r = list(map(int, input())),0,1,0</line-3>
<line-4> for d in reversed(s):</line-4>
<line-5> p += d * m</line-5>
<line-6> m = m * 10 % M</line-6>
<line-7> for d in s:</line-7>
<line-8> r = (r * m + p) % M</line-8>
<line-10> print(r)</line-10>
|
{"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-9> p = (p * 10 - (m - 1) * d) % M</line-9>", "lines": [2, 9]}
#### 0
|
<line-1>t=int(input())</line-1>
<line-3> n=int(input())</line-3>
<line-4> b=1</line-4>
<line-5> if n%2:</line-5>
<line-6> c=n-2</line-6>
<line-7> for j in range(n//2):</line-7>
<line-8> print(" "*j+str(b) +" "*c+ str(b))</line-8>
<line-9> b+=1</line-9>
<line-10> c-=2</line-10>
<line-11> print(" "*(n//2)+str(b)+" "*(n//2))</line-11>
<line-12> b+=1</line-12>
<line-13> c=1</line-13>
<line-14> for j in range(n//2):</line-14>
<line-15> print(" "*(n//2-j-1)+str(b)+" "*c+ str(b))</line-15>
<line-16> b+=1</line-16>
<line-17> c+=2</line-17>
<line-18> else:</line-18>
<line-19> c=n-2</line-19>
<line-20> for j in range(n//2):</line-20>
<line-21> print(" "*j+str(b)+" "*c+str(b))</line-21>
<line-22> b+=1</line-22>
<line-23> c-=2</line-23>
<line-24> c=0</line-24>
<line-25> for j in range(n//2):</line-25>
<line-26> print(" "*(n//2-j-1)+str(b) +" "*c+ str(b))</line-26>
<line-28> c+=2</line-28>
<line-29> </line-29>
<line-30> </line-30>
<line-31> </line-31>
<line-32> </line-32>
<line-33> </line-33>
<line-34> </line-34>
|
{"code": "<line-2>for _ in range(t):</line-2>\n<line-27> b+=1</line-27>", "lines": [2, 27]}
#### 0
|
<line-1>t=int(input())</line-1>
<line-3> n=int(input())</line-3>
<line-4> </line-4>
<line-5> grid=[]</line-5>
<line-6> for _ in range(n):</line-6>
<line-7> temp=[]</line-7>
<line-8> temp=list(map(int,input().strip().split()))</line-8>
<line-9> temp.sort()</line-9>
<line-10> grid.append(temp)</line-10>
<line-11> </line-11>
<line-12> </line-12>
<line-13> curr=max(grid[n-1])</line-13>
<line-14> total=curr</line-14>
<line-15> for i in range(n-2,0-1,-1):</line-15>
<line-16> flag=0</line-16>
<line-17> for j in range(n-1,0-1,-1):</line-17>
<line-18> if grid[i][j]<curr:</line-18>
<line-19> flag=1</line-19>
<line-20> curr=grid[i][j]</line-20>
<line-21> total+=curr</line-21>
<line-22> break</line-22>
<line-23> </line-23>
<line-24> if flag==0:</line-24>
<line-25> total=-1</line-25>
<line-27> </line-27>
<line-28> print(total)</line-28>
<line-29> </line-29>
<line-30> </line-30>
<line-31> </line-31>
<line-32> </line-32>
<line-33> </line-33>
<line-34> </line-34>
|
{"code": "<line-2>for _ in range(t):</line-2>\n<line-26> break</line-26>", "lines": [2, 26]}
#### 0
|
<line-1>def getInput():</line-1>
<line-3> N =int(N_k[0])</line-3>
<line-4> k =int(N_k[1])</line-4>
<line-5> list = []</line-5>
<line-6> output = []</line-6>
<line-7> count = 0</line-7>
<line-8> for i in range(0,k):</line-8>
<line-9> val = input()</line-9>
<line-10> if(val!="CLOSEALL"):</line-10>
<line-11> val=val.split()</line-11>
<line-12> val = int (val[1])</line-12>
<line-13> if val not in list:</line-13>
<line-14> count= count +1</line-14>
<line-15> list.append(val)</line-15>
<line-16> else:</line-16>
<line-17> list.remove(val)</line-17>
<line-18> count= count -1</line-18>
<line-19> else:</line-19>
<line-20> count =0</line-20>
<line-21> while len(list) > 0: </line-21>
<line-22> list.pop()</line-22>
<line-23> output.append(count)</line-23>
<line-24> for each in output:</line-24>
<line-26>getInput()</line-26>
|
{"code": "<line-2> N_k = input().split()</line-2>\n<line-25> print(each)</line-25>", "lines": [2, 25]}
#### 0
|
<line-1>def __gcd(a, b): </line-1>
<line-2> </line-2>
<line-4> if (a == 0 or b == 0): </line-4>
<line-5> return 0; </line-5>
<line-6> </line-6>
<line-7> # base case </line-7>
<line-8> if (a == b): </line-8>
<line-9> return a; </line-9>
<line-10> </line-10>
<line-11> # a is greater </line-11>
<line-12> if (a > b): </line-12>
<line-13> return __gcd(a - b, b); </line-13>
<line-14> return __gcd(a, b - a); </line-14>
<line-15> </line-15>
<line-16># Function to find </line-16>
<line-17># number of squares </line-17>
<line-18>def NumberOfSquares(x, y): </line-18>
<line-19> </line-19>
<line-20> # Here in built PHP </line-20>
<line-21> # gcd function is used </line-21>
<line-22> s = __gcd(x, y); </line-22>
<line-23> </line-23>
<line-24> ans = (x * y) / (s * s); </line-24>
<line-25> </line-25>
<line-26> return int(ans);</line-26>
<line-27> </line-27>
<line-28>n=int(input())</line-28>
<line-29>while n:</line-29>
<line-30> n=n-1</line-30>
<line-32> print(NumberOfSquares(c, d))</line-32>
|
{"code": "<line-3> # Everything divides 0 </line-3>\n<line-31> c,d=map(int,input().split())</line-31>", "lines": [3, 31]}
#### 0
|
<line-1>K,A,B = map(int,input().split())</line-1>
<line-2> </line-2>
<line-4> print(K + 1)</line-4>
<line-5> return</line-5>
<line-6> </line-6>
<line-7>start = A - 1</line-7>
<line-8>K -= start</line-8>
<line-10>print(ans)</line-10>
|
{"code": "<line-3>if A + 2 > B:</line-3>\n<line-9>ans = K//2 * (B-A) + K%2 + start + 1</line-9>", "lines": [3, 9]}
#### 0
|
<line-1>a= [0, 0, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 0, 5, 2, 2, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 2, 7, 4, 0, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 2, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2, 0, 3, 1, 1, 0, 3, 3, 2, 2, 4, 4, 5, 5, 9, 3, 3, 0, 1, 1, 3, 0, 2, 1, 1, 0, 4, 5, 3, 7, 4, 8, 1, 1, 2]</line-1>
<line-2> </line-2>
<line-4> </line-4>
<line-5>for i in range(t):</line-5>
<line-6> n = int(input())</line-6>
<line-7> if a[n]>0:</line-7>
<line-8> print("Arjuna")</line-8>
<line-10> print("Bhima") </line-10>
|
{"code": "<line-3>t = int(input())</line-3>\n<line-9>\telse:</line-9>", "lines": [3, 9]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>T = int(input())</line-3>
<line-4></line-4>
<line-5>for i in range(T):</line-5>
<line-6> N,data = int(input()),list(map(int,input().split()))</line-6>
<line-7> if(N==3):</line-7>
<line-8> print(sum(data))</line-8>
<line-9> else:</line-9>
<line-10> best = data[0]+data[1]+data[2]</line-10>
<line-11> overall = best</line-11>
<line-12> k=len(data)</line-12>
<line-13> for i in range(1,k-2):</line-13>
<line-14> overall=overall - data[i-1] + data[i+2]</line-14>
<line-15> if(overall>best):</line-15>
<line-16> best = overall</line-16>
<line-17> j=max(data[1],data[-2])</line-17>
<line-18> l= data[-1]+data[0]+j</line-18>
<line-19> if(best < l):</line-19>
<line-21> print(best)</line-21>
|
{"code": "<line-2>#Moony and ICPC team</line-2>\n<line-20> best = l</line-20>", "lines": [2, 20]}
#### 0
|
<line-1>n=eval(input())</line-1>
<line-3>c=m=0</line-3>
<line-4>maxi=max(a)</line-4>
<line-5>for i in range(n):</line-5>
<line-6> if a[i]==maxi:</line-6>
<line-7> c+=1</line-7>
<line-8> m=max(c,m)</line-8>
<line-9> else:</line-9>
<line-11>print(m) </line-11>
|
{"code": "<line-2>a=list(map(int,input().split()))</line-2>\n<line-10> c=0</line-10>", "lines": [2, 10]}
#### 0
|
<line-1>from math import gcd</line-1>
<line-2></line-2>
<line-4></line-4>
<line-5></line-5>
<line-6>def test():</line-6>
<line-7> n = int(input())</line-7>
<line-8> a = list(map(int, input().split()))</line-8>
<line-9> a = list(set(a))</line-9>
<line-10> n = len(a)</line-10>
<line-11> if len(a) == 1:</line-11>
<line-12> print(2 * a[0])</line-12>
<line-13> return</line-13>
<line-14> g1 = [0 for i in range(n)]</line-14>
<line-15> g2 = [0 for i in range(n)]</line-15>
<line-16> g1[0] = a[0]</line-16>
<line-17> g2[n - 1] = a[n - 1]</line-17>
<line-18> for i in range(1, n):</line-18>
<line-19> g1[i] = gcd(g1[i - 1], a[i])</line-19>
<line-20> for i in range(n - 2, -1, -1):</line-20>
<line-21> g2[i] = gcd(g2[i + 1], a[i])</line-21>
<line-22> ans = 0</line-22>
<line-23> for i in range(n):</line-23>
<line-24> if i == 0:</line-24>
<line-25> ans = max(ans, g2[i + 1] + a[i])</line-25>
<line-26> elif i == n - 1:</line-26>
<line-27> ans = max(ans, g1[i - 1] + a[i])</line-27>
<line-28> else:</line-28>
<line-29> ans = max(ans, gcd(g1[i - 1], g2[i + 1]) + a[i])</line-29>
<line-30> print(ans)</line-30>
<line-31></line-31>
<line-32></line-32>
<line-33>if __author__ == 'Prateek':</line-33>
<line-34> t = int(input())</line-34>
<line-36> test()</line-36>
|
{"code": "<line-3>__author__ = 'Prateek'</line-3>\n<line-35> for _ in range(t):</line-35>", "lines": [3, 35]}
#### 0
|
<line-2> n,k=map(int,input().split())</line-2>
<line-3> print(((2*n*(k-1))+2)/k)</line-3>
|
{"code": "<line-1>for _ in range(int(input())):</line-1>", "lines": [1]}
#### 0
|
<line-1>t=int(input())</line-1>
<line-3> n=int(input())</line-3>
<line-4> for i in range(0,n):</line-4>
<line-5> for j in range(0,n):</line-5>
<line-6> if i%2==0:</line-6>
<line-7> if j%2==0:</line-7>
<line-8> print(0,end="")</line-8>
<line-9> else:</line-9>
<line-10> print(1,end="")</line-10>
<line-11> else:</line-11>
<line-12> if j%2==0:</line-12>
<line-13> print(1,end="")</line-13>
<line-14> else:</line-14>
<line-16> print()</line-16>
<line-17> </line-17>
|
{"code": "<line-2>for t in range(t):</line-2>\n<line-15> print(0,end=\"\")</line-15>", "lines": [2, 15]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>for i in range(t):</line-3>
<line-4> n=int(input())</line-4>
<line-5> if n<101:</line-5>
<line-6> l1=[]</line-6>
<line-7> l2=[]</line-7>
<line-8> d=dict()</line-8>
<line-9> for i in range(1,2*n+1):</line-9>
<line-10> if i%2==0:</line-10>
<line-11> l1.append(int(input()))</line-11>
<line-12> else:</line-12>
<line-13> l2.append(str(input()))</line-13>
<line-14> r1=[]</line-14>
<line-15> for i in l1:</line-15>
<line-16> r1.append(i)</line-16>
<line-17> l1.sort()</line-17>
<line-18> ind=[]</line-18>
<line-19> for i in l1:</line-19>
<line-20> a=r1.index(i)</line-20>
<line-21> ind.append(a)</line-21>
<line-22> for i in ind:</line-22>
<line-23> print(l2[i])</line-23>
<line-24> else:</line-24>
<line-26> break</line-26>
<line-27> </line-27>
|
{"code": "<line-2>t=int(input())</line-2>\n<line-25> print(0)</line-25>", "lines": [2, 25]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3> n = int(input())</line-3>
<line-4> arr = list(map(int,input().split()))</line-4>
<line-5> l = []</line-5>
<line-6> for i in range(0, len(arr)): </line-6>
<line-7> for j in range(i+1, len(arr)): </line-7>
<line-8> if(arr[i] == arr[j]): </line-8>
<line-9> l.append(arr[j])</line-9>
<line-10> if (len(l) ==0):</line-10>
<line-11> print("prekrasnyy")</line-11>
<line-13> print("ne krasivo")</line-13>
|
{"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-12> else:</line-12>", "lines": [2, 12]}
#### 0
|
<line-2>for i in range(oo):</line-2>
<line-3> val = input()</line-3>
<line-4> print(val[::-1])</line-4>
|
{"code": "<line-1>oo = int(input())</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> </line-5>
<line-6> a = {}</line-6>
<line-7> </line-7>
<line-8> for i in range(n):</line-8>
<line-9> l = input()</line-9>
<line-10> </line-10>
<line-11> if l not in a:</line-11>
<line-12> a[l] = 1</line-12>
<line-13> else:</line-13>
<line-14> a[l] += 1</line-14>
<line-15> </line-15>
<line-16> done = []</line-16>
<line-17> ans = 0</line-17>
<line-18> </line-18>
<line-19> for i in a:</line-19>
<line-20> if a[i] != 0:</line-20>
<line-21> temp = [x for x in i.split()]</line-21>
<line-22> v = temp[0]</line-22>
<line-23> </line-23>
<line-24> v0 = v + " 0"</line-24>
<line-25> v1 = v + " 1"</line-25>
<line-26> </line-26>
<line-27> if(v0 in a and v1 in a):</line-27>
<line-28> if a[v0] > a[v1]:</line-28>
<line-29> ans += a[v0]</line-29>
<line-30> else:</line-30>
<line-31> ans += a[v1]</line-31>
<line-32> </line-32>
<line-33> a[v0] = a[v1] = 0</line-33>
<line-34> elif(v0 in a):</line-34>
<line-35> ans += a[v0]</line-35>
<line-36> a[v0] = 0</line-36>
<line-37> elif(v1 in a):</line-37>
<line-38> ans += a[v1]</line-38>
<line-40> </line-40>
<line-41> print(ans)</line-41>
|
{"code": "<line-3>for _ in range(t):</line-3>\n<line-39> a[v1] = 0</line-39>", "lines": [3, 39]}
#### 0
|
<line-1>testcases = int(input())</line-1>
<line-2></line-2>
<line-4> n = int(input())</line-4>
<line-5> my = list(map(int,input().split()))</line-5>
<line-6> opp = list(map(int,input().split()))</line-6>
<line-7> </line-7>
<line-8> my.sort(reverse = True)</line-8>
<line-9> opp.sort(reverse = True)</line-9>
<line-10> </line-10>
<line-11> j = 0</line-11>
<line-12> k = 0</line-12>
<line-13> while(k < n):</line-13>
<line-14> if(my[j] > opp[k]):</line-14>
<line-15> j += 1</line-15>
<line-17></line-17>
<line-18> print(j)</line-18>
|
{"code": "<line-3>for i in range(testcases):</line-3>\n<line-16> k += 1</line-16>", "lines": [3, 16]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>while t>0:</line-3>
<line-4> n=int(input())</line-4>
<line-5> if n==1:</line-5>
<line-6> print(1)</line-6>
<line-7> else:</line-7>
<line-8> c,num=1,2</line-8>
<line-9> while num<n:</line-9>
<line-10> num*=2</line-10>
<line-11> if num==n:</line-11>
<line-12> print(num)</line-12>
<line-13> else:</line-13>
<line-15> t-=1</line-15>
|
{"code": "<line-2>t=int(input())</line-2>\n<line-14> print(num//2)</line-14>", "lines": [2, 14]}
#### 0
|
<line-1>import math</line-1>
<line-3>import random</line-3>
<line-4>import re</line-4>
<line-5>import sys</line-5>
<line-6></line-6>
<line-7></line-7>
<line-8>r = 100000</line-8>
<line-9>prev = 1</line-9>
<line-10>s = set()</line-10>
<line-11>for i in range(1, r+1):</line-11>
<line-12> now = i ^ prev</line-12>
<line-13> s.add(now)</line-13>
<line-14> prev = now</line-14>
<line-15>s = list(s)</line-15>
<line-16>t = int(input())</line-16>
<line-17>while t > 0:</line-17>
<line-18> t -= 1</line-18>
<line-19> n, k = list(map(int, input().split()))</line-19>
<line-20></line-20>
<line-21> if n > 3:</line-21>
<line-22> if n % 2 == 0:</line-22>
<line-23> size = (n//2) + 2</line-23>
<line-24> else:</line-24>
<line-25> size = ((n-1)//2) + 2</line-25>
<line-26> else:</line-26>
<line-27> size = n</line-27>
<line-28> if size - k >= 0:</line-28>
<line-29> print(s[size-k])</line-29>
<line-31> print(-1)</line-31>
|
{"code": "<line-2>import os</line-2>\n<line-30> else:</line-30>", "lines": [2, 30]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>T = int(input())</line-3>
<line-4>for _ in range(T):</line-4>
<line-5> N, H = map(int, input().split())</line-5>
<line-6> A = list(map(int, input().split()))</line-6>
<line-7> low, high = 1, max(A)</line-7>
<line-8> while low != high:</line-8>
<line-9> time = 0</line-9>
<line-10> mid = (low + high) // 2</line-10>
<line-11> for i in range(N):</line-11>
<line-12> time += math.ceil(A[i] / mid)</line-12>
<line-13> </line-13>
<line-14> if time <= H :</line-14>
<line-15> high = mid</line-15>
<line-16> else:</line-16>
<line-18> print(high)</line-18>
|
{"code": "<line-2>import math</line-2>\n<line-17> low = mid + 1</line-17>", "lines": [2, 17]}
#### 0
|
<line-1>#!/usr/bin/env python</line-1>
<line-2></line-2>
<line-4>def fibo():</line-4>
<line-5> for i in range(500):</line-5>
<line-6> F.append(F[-2] + F[-1])</line-6>
<line-7></line-7>
<line-8>def main():</line-8>
<line-9> fibo()</line-9>
<line-10> #print len(str(F[-1]))</line-10>
<line-11> #print len(str(10**100))</line-11>
<line-12> while True:</line-12>
<line-13> try:</line-13>
<line-14> A, B = list(map(int, input().strip().split()[:2]))</line-14>
<line-15> if A == 0 and B == 0: break</line-15>
<line-16> print(len([x for x in F if x >= A and x <= B]))</line-16>
<line-17> except:</line-17>
<line-19></line-19>
<line-20>main()</line-20>
<line-21></line-21>
|
{"code": "<line-3>F = [1,1]</line-3>\n<line-18> break</line-18>", "lines": [3, 18]}
#### 0
|
<line-1>cases = int(input())</line-1>
<line-2></line-2>
<line-4> N, M, K = [int(i) for i in input().split()]</line-4>
<line-5> A = [int(i) for i in input().split()]</line-5>
<line-6> jad = 0</line-6>
<line-7> P = M*K</line-7>
<line-8></line-8>
<line-9> for milk in A:</line-9>
<line-10> if(milk>P):</line-10>
<line-11> jad += milk-P</line-11>
<line-12> else:</line-12>
<line-14></line-14>
<line-15> print(jad%1000000007)</line-15>
|
{"code": "<line-3>for case in range(cases):</line-3>\n<line-13> jad += milk%K</line-13>", "lines": [3, 13]}
#### 0
|
<line-1>n=int(input())</line-1>
<line-3>dp=[]</line-3>
<line-4>d={}</line-4>
<line-5>for i in range(n):</line-5>
<line-6> l.append(int(input()))</line-6>
<line-7> d[i]=[]</line-7>
<line-8> dp.append([0,0])</line-8>
<line-9></line-9>
<line-10>for i in range(n-1):</line-10>
<line-11> a,b=list(map(int,input().split()))</line-11>
<line-12> d[a-1].append(b-1)</line-12>
<line-13> d[b-1].append(a-1)</line-13>
<line-14>#print(l)</line-14>
<line-15>#print(d)</line-15>
<line-16></line-16>
<line-17>def dfs(ch,pa,visited):</line-17>
<line-18> dp[ch][1]=l[ch]</line-18>
<line-19> #print(dp[ch],ch+1)</line-19>
<line-20> for i in range(len(d[ch])):</line-20>
<line-21> if d[ch][i] not in visited:</line-21>
<line-22> visited.add(d[ch][i])</line-22>
<line-23> dfs(d[ch][i],ch,visited)</line-23>
<line-24> dp[ch][0]+=max(dp[d[ch][i]][0],dp[d[ch][i]][1])</line-24>
<line-25> dp[ch][1]+=dp[d[ch][i]][0]</line-25>
<line-26> #print(ch+1,dp[ch])</line-26>
<line-27>v=set()</line-27>
<line-28>v.add(0)</line-28>
<line-29>dfs(0,-1,v)</line-29>
<line-30></line-30>
<line-32>print(max(dp[0][0],dp[0][1]))</line-32>
<line-33></line-33>
<line-34> </line-34>
<line-35></line-35>
<line-36></line-36>
|
{"code": "<line-2>l=[]</line-2>\n<line-31>#print(dp)</line-31>", "lines": [2, 31]}
#### 0
|
<line-1>testCases = int(input())</line-1>
<line-3> n, k = list(map(int, input().split()))</line-3>
<line-4> sum = 0</line-4>
<line-5> i = 0</line-5>
<line-6> power = 1</line-6>
<line-7> while i <= n:</line-7>
<line-8> if k**power == i:</line-8>
<line-9> power += 1</line-9>
<line-10> else:</line-10>
<line-11> sum += i</line-11>
<line-12> i +=1 </line-12>
<line-14> print(answer)</line-14>
|
{"code": "<line-2>for c in range(testCases):</line-2>\n<line-13> answer = \"Case #\" + str(c + 1) + \": \" + str(sum)</line-13>", "lines": [2, 13]}
#### 0
|
<line-1>try:</line-1>
<line-2> </line-2>
<line-4> n = int(input())</line-4>
<line-5> print(0) if(n==1) else print(pow(2,n-1,10**9+7)-2) </line-5>
<line-7> pass</line-7>
<line-8></line-8>
<line-9> </line-9>
|
{"code": "<line-3> for _ in range(int(input())):</line-3>\n<line-6>except EOFError:</line-6>", "lines": [3, 6]}
#### 0
|
<line-1>t=int(input())</line-1>
<line-3> n=int(input())</line-3>
<line-4> l=list(map(int,input().split()))</line-4>
<line-5> if sum(l)!=n or max(l)==n:</line-5>
<line-6> print('-1')</line-6>
<line-7> else:</line-7>
<line-8> d=dict()</line-8>
<line-9> ans=[-1]*n</line-9>
<line-10> for i in range(0,n):</line-10>
<line-11> d[i]=1</line-11>
<line-12> for i in range(n):</line-12>
<line-13> if l[i]!=0:</line-13>
<line-14> count=l[i]</line-14>
<line-15> for k,v in list(d.items()):</line-15>
<line-16> if count>0 and v==1 and i!=k:</line-16>
<line-17> d[k]=0</line-17>
<line-18> ans[k]=i+1</line-18>
<line-19> count-=1</line-19>
<line-20> ind=-1</line-20>
<line-21> for i in range(0,len(ans)):</line-21>
<line-22> if ans[i]==-1:</line-22>
<line-23> ind=i</line-23>
<line-24> if ind==-1:</line-24>
<line-25> print(*ans)</line-25>
<line-26> else:</line-26>
<line-27> for i in range(len(ans)):</line-27>
<line-28> if ans[i]!=ind+1:</line-28>
<line-29> </line-29>
<line-30> </line-30>
<line-31> ans[ind]=ans[i]</line-31>
<line-32> ans[i]=ind+1</line-32>
<line-34> print(*ans)</line-34>
<line-35> </line-35>
<line-36> </line-36>
<line-37> </line-37>
<line-38> </line-38>
<line-39></line-39>
<line-40> </line-40>
<line-41> </line-41>
<line-42> </line-42>
<line-43></line-43>
<line-44> </line-44>
|
{"code": "<line-2>for _ in range(t):</line-2>\n<line-33> break</line-33>", "lines": [2, 33]}
#### 0
|
<line-1>T = int(input())</line-1>
<line-3> W = list(map(int, input().strip().split()))</line-3>
<line-4> S = W[0]</line-4>
<line-5> W = W[1:]</line-5>
<line-6> W = W[::-1]</line-6>
<line-7> i = 0</line-7>
<line-8> c = 0</line-8>
<line-9> flag = 0</line-9>
<line-10> while (len(W) != 0 or flag != 1) and i<len(W):</line-10>
<line-11> k = i</line-11>
<line-12> su = 0</line-12>
<line-13> while su <= S and k<len(W)-1:</line-13>
<line-14> su += W[k]</line-14>
<line-15> k += 1</line-15>
<line-16> if su-W[k-1]<=S:</line-16>
<line-17> c += 1</line-17>
<line-18> else:</line-18>
<line-19> flag = 1</line-19>
<line-21> print(c-1) </line-21>
|
{"code": "<line-2>for _ in range(T):</line-2>\n<line-20> i += 1</line-20>", "lines": [2, 20]}
#### 0
|
<line-1>from bisect import insort</line-1>
<line-3>for _ in range(int(input())):</line-3>
<line-4> n,k=list(map(int,input().split( )))</line-4>
<line-5> array=list(map(int,input().split( )))</line-5>
<line-6> ans=0</line-6>
<line-7> index=[]</line-7>
<line-8> for i in range(1,n+1):</line-8>
<line-9> index.append(ceil(k/(ceil(k/i))))</line-9>
<line-10> for i in range(n):</line-10>
<line-11> count=[0]*(2001)</line-11>
<line-12> temp=[]</line-12>
<line-13> for j in range(i,n):</line-13>
<line-14> count[array[j]]+=1</line-14>
<line-15> insort(temp,array[j])</line-15>
<line-16> #m=ceil(k/(j-i+1)) precalculate thes values in index array</line-16>
<line-17> #t=ceil(k/m)</line-17>
<line-18> x=temp[index[j-i]-1]</line-18>
<line-19> f=count[x]</line-19>
<line-20> if count[f]:</line-20>
<line-22> print(ans)</line-22>
|
{"code": "<line-2>from math import ceil</line-2>\n<line-21> ans+=1</line-21>", "lines": [2, 21]}
#### 0
|
<line-1>x = input()</line-1>
<line-3>z = x.find(y)</line-3>
<line-4>if z == -1 :</line-4>
<line-5> print('N')</line-5>
<line-7> print('Y')</line-7>
|
{"code": "<line-2>y = input()</line-2>\n<line-6>else :</line-6>", "lines": [2, 6]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>from math import gcd,sqrt,floor,factorial,ceil</line-3>
<line-4>from bisect import bisect_left,bisect_right</line-4>
<line-5>import bisect;</line-5>
<line-6>import sys;</line-6>
<line-7>from sys import stdin,stdout</line-7>
<line-8>import os</line-8>
<line-9>sys.setrecursionlimit(pow(10,7))</line-9>
<line-10>import collections</line-10>
<line-11>from collections import defaultdict,Counter</line-11>
<line-12>from statistics import median</line-12>
<line-13># input=stdin.readline</line-13>
<line-14># print=stdout.write</line-14>
<line-15>from queue import Queue</line-15>
<line-16>inf = float("inf")</line-16>
<line-17>from operator import neg;</line-17>
<line-18>mod=pow(10,9)+7</line-18>
<line-19>def fun(l):</line-19>
<line-20> m=[[l[0]]]</line-20>
<line-21> for i in range(1,n):</line-21>
<line-22> if m[-1][-1]==l[i]:</line-22>
<line-23> m[-1]+=[l[i]]</line-23>
<line-24> else:</line-24>
<line-25> m.append([l[i]])</line-25>
<line-26> count=[]</line-26>
<line-27> for i in range(len(m)):</line-27>
<line-28> count.append(len(m[i]))</line-28>
<line-29> return count;</line-29>
<line-30>def function(l1,index,prev,count):</line-30>
<line-31> tuple=(index,prev,count)</line-31>
<line-32> if tuple in dict:</line-32>
<line-33> return dict[tuple]</line-33>
<line-34> n=len(l1)</line-34>
<line-35> if index==n:</line-35>
<line-36> return 0;</line-36>
<line-37> if count>=3:</line-37>
<line-38> if index%2==prev:</line-38>
<line-39> dict[tuple]=function(l1,index+1,prev,count)</line-39>
<line-40> return function(l1,index+1,prev,count)</line-40>
<line-41> else:</line-41>
<line-42> dict[tuple]=l1[index]+function(l1,index+1,prev,count);</line-42>
<line-43> return dict[tuple]</line-43>
<line-44> if prev==None:</line-44>
<line-45> skip=l1[index]+function(l1,index+1,prev,count)</line-45>
<line-46> not_skip=function(l1,index+1,index%2,count+1)</line-46>
<line-47> maxa=min(skip,not_skip)</line-47>
<line-48> dict[tuple]=maxa</line-48>
<line-49> return maxa;</line-49>
<line-50></line-50>
<line-51> if index%2==prev:</line-51>
<line-52> dict[tuple]=function(l1,index+1,index%2,count)</line-52>
<line-53> return dict[tuple]</line-53>
<line-54> if index%2!=prev:</line-54>
<line-55> skip=l1[index]+function(l1,index+1,prev,count)</line-55>
<line-56> not_skip=function(l1,index+1,index%2,1+count)</line-56>
<line-57> maxa = min(skip, not_skip)</line-57>
<line-58> dict[tuple]=maxa</line-58>
<line-59> return maxa;</line-59>
<line-60></line-60>
<line-61>t=int(input())</line-61>
<line-62>for i in range(t):</line-62>
<line-63> s=input()</line-63>
<line-64> l=list(s)</line-64>
<line-65> n=len(l)</line-65>
<line-66> l=[int(i) for i in l]</line-66>
<line-67> l1=fun(l)</line-67>
<line-68> dict=defaultdict(int)</line-68>
<line-70> print(theta)</line-70>
|
{"code": "<line-2>import math;</line-2>\n<line-69> theta=function(l1,0,None,0)</line-69>", "lines": [2, 69]}
#### 0
|
<line-1>import sys</line-1>
<line-2></line-2>
<line-4># print(t)</line-4>
<line-5>for _ in range(t):</line-5>
<line-6> n,m = map(int,input().split());</line-6>
<line-7> s = [];</line-7>
<line-8> for i in range(n):</line-8>
<line-9> s.append(input())</line-9>
<line-10> ans = []</line-10>
<line-11> for i in range(n):</line-11>
<line-12> ans.append([])</line-12>
<line-13> for j in range(m):</line-13>
<line-14> ans[i].append([])</line-14>
<line-15> for i in range(n):</line-15>
<line-16> for j in range(m):</line-16>
<line-17> c = 0</line-17>
<line-18> if s[i][j] == 'U':</line-18>
<line-19> for k in range(i,-1,-1):</line-19>
<line-20> if s[k][j] == '#':</line-20>
<line-21> break</line-21>
<line-22> ans[k][j].append(c)</line-22>
<line-23> c+=1</line-23>
<line-24> elif s[i][j] == 'D':</line-24>
<line-25> for k in range(i,n):</line-25>
<line-26> if s[k][j] == '#':</line-26>
<line-27> break</line-27>
<line-28> ans[k][j].append(c)</line-28>
<line-29> c+=1</line-29>
<line-30> elif s[i][j] == 'L':</line-30>
<line-31> for k in range(j,-1,-1):</line-31>
<line-32> if s[i][k] == '#':</line-32>
<line-33> break</line-33>
<line-34> ans[i][k].append(c)</line-34>
<line-35> c+=1</line-35>
<line-36> elif s[i][j] == 'R':</line-36>
<line-37> for k in range(j,m):</line-37>
<line-38> if s[i][k] == '#':</line-38>
<line-39> break</line-39>
<line-40> ans[i][k].append(c)</line-40>
<line-41> c+=1</line-41>
<line-42> for i in range(n):</line-42>
<line-43> for j in range(m):</line-43>
<line-44> ans[i][j].sort()</line-44>
<line-45> res = []</line-45>
<line-46> for i in range(n):</line-46>
<line-47> for j in range(m):</line-47>
<line-48> c= 1</line-48>
<line-49> # print(ans[i][j])</line-49>
<line-50> for k in range(1,len(ans[i][j])):</line-50>
<line-51> # print(ans[i][j][k])</line-51>
<line-52> if ans[i][j][k] == ans[i][j][k-1]:</line-52>
<line-53> c+=1</line-53>
<line-54> else :</line-54>
<line-55> if c!=1:</line-55>
<line-56> res.append(c)</line-56>
<line-57> c = 1</line-57>
<line-58> if k==len(ans[i][j])-1:</line-58>
<line-59> if c!=1:</line-59>
<line-60> res.append(c)</line-60>
<line-61> pairs = 0</line-61>
<line-62> # print(res)</line-62>
<line-63> for i in range(len(res)):</line-63>
<line-65> </line-65>
<line-66> print(pairs)</line-66>
|
{"code": "<line-3>t = int(input())</line-3>\n<line-64>\t\tpairs += ((res[i]*(res[i]-1))//2)</line-64>", "lines": [3, 64]}
#### 0
|
<line-1>for t in range(int(input())):</line-1>
<line-3> solvedbychef = 0</line-3>
<line-4> solvedbyappy = 0</line-4>
<line-5> for i in range(n+1):</line-5>
<line-6> if i % a == 0 and i % b == 0 :</line-6>
<line-7> continue</line-7>
<line-8> elif i%a == 0 :</line-8>
<line-9> solvedbyappy+=1</line-9>
<line-10> elif i%b == 0:</line-10>
<line-11> solvedbychef+=1</line-11>
<line-12> totalsolved = solvedbychef + solvedbyappy</line-12>
<line-13> if totalsolved>=k:</line-13>
<line-14> print("Win")</line-14>
<line-16> print("Lose")</line-16>
|
{"code": "<line-2> n, a , b , k = map(int,input().split())</line-2>\n<line-15> else :</line-15>", "lines": [2, 15]}
#### 0
|
<line-1>let_to_num = {'A':[0,5], 'B':[1,6], 'C':[2,7], 'D':[3,8], 'E':[4,9]}</line-1>
<line-2></line-2>
<line-4> 5:'A', 6:'B', 7:'C', 8:'D', 9:'E'}</line-4>
<line-5></line-5>
<line-6>connections = {0:(1,4,5), 1:(0,2,6), 2:(1,3,7), 3:(2,4,8), 4:(0,3,9), 5:(0,7,8),</line-6>
<line-7> 6:(1,8,9), 7:(2,5,9), 8:(3,5,6), 9:(4,6,7)}</line-7>
<line-8></line-8>
<line-9>T = int(input())</line-9>
<line-10></line-10>
<line-11>for i in range(T):</line-11>
<line-12> s = input()</line-12>
<line-13> out_1, out_2= [],[]</line-13>
<line-14> flag1, flag2 = True, True</line-14>
<line-15> for c in range(len(s)):</line-15>
<line-16> #print out_1, out_2, flag1, flag2</line-16>
<line-17> if c == 0:</line-17>
<line-18> out_1.append(let_to_num[s[c]][0])</line-18>
<line-19> out_2.append(let_to_num[s[c]][1])</line-19>
<line-20> #print out_1, out_2, '\n'</line-20>
<line-21> else:</line-21>
<line-22> if flag1:</line-22>
<line-23> conn_1 = set(connections[out_1[-1]])</line-23>
<line-24> to_conn_1 = set(let_to_num[s[c]])</line-24>
<line-25> </line-25>
<line-26> if len(conn_1.intersection(to_conn_1))==0:</line-26>
<line-27> flag1 = False</line-27>
<line-28> else:</line-28>
<line-29> out_1.extend(list(conn_1.intersection(to_conn_1)))</line-29>
<line-30> </line-30>
<line-31> #print 'out1',conn_1, to_conn_1, flag1, conn_1.intersection(to_conn_1)</line-31>
<line-32> if flag2:</line-32>
<line-33> conn_2 = set(connections[out_2[-1]])</line-33>
<line-34> to_conn_2 = set(let_to_num[s[c]])</line-34>
<line-35> </line-35>
<line-36> if len(conn_2.intersection(to_conn_2))==0:</line-36>
<line-37> flag2 = False</line-37>
<line-38> else:</line-38>
<line-39> out_2.extend(list(conn_2.intersection(to_conn_2)))</line-39>
<line-40> #print 'out2', conn_2, to_conn_2, flag2, conn_2.intersection(to_conn_2)</line-40>
<line-41> #print out_1, out_2, flag1, flag2, '\n'</line-41>
<line-42> if (not flag1) and (not flag2):</line-42>
<line-43> break</line-43>
<line-44> if (not flag1) and (not flag2):</line-44>
<line-45> print(-1)</line-45>
<line-46> continue</line-46>
<line-47> elif flag1 and (not flag2):</line-47>
<line-48> print(''.join(str(k) for k in out_1))</line-48>
<line-49> continue</line-49>
<line-50> elif flag2 and (not flag1):</line-50>
<line-51> print(''.join(str(k) for k in out_2))</line-51>
<line-52> continue</line-52>
<line-53> else:</line-53>
<line-55> continue</line-55>
|
{"code": "<line-3>num_to_let = {0:'A', 1:'B', 2:'C', 3:'D', 4:'E',</line-3>\n<line-54> print(min(''.join(str(k) for k in out_1), ''.join(str(k) for k in out_2)))</line-54>", "lines": [3, 54]}
#### 0
|
<line-1>import math</line-1>
<line-3>for i in range(T):</line-3>
<line-4> N,M,S=input().split()</line-4>
<line-5> N=int(N)</line-5>
<line-6> M=int(M)</line-6>
<line-7> S=int(S)</line-7>
<line-8> ls=list(map(int,input().split()))</line-8>
<line-9> maxx=max(ls)</line-9>
<line-10> if S<17 and maxx<=50:</line-10>
<line-11> ls.sort()</line-11>
<line-12> total_sum = M * S</line-12>
<line-13> count = 0</line-13>
<line-14> sum = 0</line-14>
<line-15> for i in ls:</line-15>
<line-16> if i / S > 2:</line-16>
<line-17> continue</line-17>
<line-18> else:</line-18>
<line-19> sum = sum + math.ceil(i / S) * S</line-19>
<line-20> if sum <= total_sum:</line-20>
<line-21> count = count + 1</line-21>
<line-23># cook your dish here</line-23>
|
{"code": "<line-2>T=int(input())</line-2>\n<line-22> print(count)</line-22>", "lines": [2, 22]}
#### 0
|
<line-1>import sys</line-1>
<line-3>from collections import deque</line-3>
<line-4>from fractions import Fraction as f</line-4>
<line-5>from copy import *</line-5>
<line-6>from bisect import * </line-6>
<line-7>from heapq import *</line-7>
<line-8>from math import *</line-8>
<line-9>from itertools import permutations </line-9>
<line-10> </line-10>
<line-11>def eprint(*args):</line-11>
<line-12> print(*args, file=sys.stderr)</line-12>
<line-13>zz=1</line-13>
<line-14> </line-14>
<line-15>#sys.setrecursionlimit(10**6)</line-15>
<line-16>if zz:</line-16>
<line-17> input=sys.stdin.readline</line-17>
<line-18>else: </line-18>
<line-19> sys.stdin=open('input.txt', 'r')</line-19>
<line-20> sys.stdout=open('all.txt','w')</line-20>
<line-21>def li():</line-21>
<line-22> return [int(xx) for xx in input().split()]</line-22>
<line-23>def fli():</line-23>
<line-24> return [float(x) for x in input().split()] </line-24>
<line-25>def comp(a,b):</line-25>
<line-26> if(a>b):</line-26>
<line-27> return 2</line-27>
<line-28> return 2 if a==b else 0 </line-28>
<line-29>def gi(): </line-29>
<line-30> return [xx for x in input().split()]</line-30>
<line-31>def fi():</line-31>
<line-32> return int(input())</line-32>
<line-33>def swap(a,i,j):</line-33>
<line-34> a[i],a[j]=a[j],a[i] </line-34>
<line-35>def si():</line-35>
<line-36> return list(input().rstrip()) </line-36>
<line-37>def mi():</line-37>
<line-38> return map(int,input().split()) </line-38>
<line-39>def gh():</line-39>
<line-40> sys.stdout.flush()</line-40>
<line-41>def graph(n,m):</line-41>
<line-42> for i in range(m):</line-42>
<line-43> x,y=mi()</line-43>
<line-44> a[x].append(y)</line-44>
<line-45> a[y].append(x)</line-45>
<line-46>def bo(i):</line-46>
<line-47> return ord(i)-ord('a')</line-47>
<line-48> </line-48>
<line-49> </line-49>
<line-50>t=fi()</line-50>
<line-51>while t>0:</line-51>
<line-52> t-=1</line-52>
<line-53> n,z1,z2=mi()</line-53>
<line-54> d={}</line-54>
<line-55> a=li()</line-55>
<line-56> flag=0</line-56>
<line-57> for i in a:</line-57>
<line-58> d[i]=1</line-58>
<line-59> d[-i]=1</line-59>
<line-60> if i==z1 or i==z2 or i==-z1 or i==-z2:</line-60>
<line-61> flag=1</line-61>
<line-62> break</line-62>
<line-63> if flag:</line-63>
<line-64> print(1)</line-64>
<line-65> continue </line-65>
<line-66> for i in d:</line-66>
<line-67> p=[i-z1,i-z2]</line-67>
<line-68> c=1</line-68>
<line-69> for j in p:</line-69>
<line-70> if j in d:</line-70>
<line-71> c*=0</line-71>
<line-73> print(0 if flag else 2) </line-73>
|
{"code": "<line-2>from collections import defaultdict as dd</line-2>\n<line-72> flag|=c </line-72>", "lines": [2, 72]}
#### 0
|
<line-1>t=int(input())</line-1>
<line-2></line-2>
<line-4> n,x=map(int,input().split())</line-4>
<line-5> a=list(map(int,input().split()))</line-5>
<line-6> </line-6>
<line-7> mx=max(a)</line-7>
<line-8> mn=min(a)</line-8>
<line-9> </line-9>
<line-10> if (mx-mn<x):</line-10>
<line-11> print("YES")</line-11>
<line-13> print("NO")</line-13>
|
{"code": "<line-3>for t1 in range(t):</line-3>\n<line-12>\telse:</line-12>", "lines": [3, 12]}
#### 0
|
<line-1>t = int(input())</line-1>
<line-3> x, y, k, n = [int(x) for x in input().split()]</line-3>
<line-4> k = k*2</line-4>
<line-5> temp = abs(x-y)</line-5>
<line-6> if(temp%k == 0):</line-6>
<line-7> print("Yes")</line-7>
<line-9> print("No")</line-9>
|
{"code": "<line-2>for _ in range(t):</line-2>\n<line-8> else:</line-8>", "lines": [2, 8]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-2></line-2>
<line-4> </line-4>
<line-5></line-5>
<line-6>def minstairs(n,k):</line-6>
<line-7> stairsHeight=[]</line-7>
<line-8> stairs=0</line-8>
<line-9> current = 0</line-9>
<line-10> stairsHeight=list(map(int, input().split()))</line-10>
<line-11> stairsHeight=np.array(stairsHeight)</line-11>
<line-12> curr=0</line-12>
<line-13> for i in range(n):</line-13>
<line-14> if stairsHeight[i]-curr<=k:</line-14>
<line-15> curr=stairsHeight[i]</line-15>
<line-16> else:</line-16>
<line-17> if (stairsHeight[i]-curr)%k==0:</line-17>
<line-18> stairs+=((stairsHeight[i]-curr)//k)-1</line-18>
<line-19> else:</line-19>
<line-20> stairs+=(stairsHeight[i]-curr)//k</line-20>
<line-21> curr=stairsHeight[i]</line-21>
<line-22> return stairs</line-22>
<line-23> </line-23>
<line-24>T=int(input())</line-24>
<line-25>for i in range(T):</line-25>
<line-27> print(minstairs(n,k))</line-27>
|
{"code": "<line-3>import numpy as np</line-3>\n<line-26> n,k =list(map(int,input().split()))</line-26>", "lines": [3, 26]}
#### 0
|
<line-1>for _ in range(int(input())):</line-1>
<line-3> ans = 0</line-3>
<line-4> for i in range(y, x+1, y):</line-4>
<line-5> if i%y == 0:</line-5>
<line-7> print(ans)</line-7>
|
{"code": "<line-2> x, y = map(int, input().split())</line-2>\n<line-6> ans += i%10</line-6>", "lines": [2, 6]}
#### 0
|
<line-2>for i in range(oo):</line-2>
<line-3> val = int(input())</line-3>
<line-4> print((val**2)*3.14)</line-4>
|
{"code": "<line-1>oo = int(input())</line-1>", "lines": [1]}
#### 0
|
<line-1># cook your dish here</line-1>
<line-3>for i in range(t):</line-3>
<line-4> n=int(input())</line-4>
<line-5> ar=list(map(int,input().split()))</line-5>
<line-6> tot=0</line-6>
<line-7> st=0</line-7>
<line-8> for j in range(1,n):</line-8>
<line-9> if(ar[j-1]>ar[j]):</line-9>
<line-10> si=j-st</line-10>
<line-11> c=(si*(si+1))//2</line-11>
<line-12> tot+=c</line-12>
<line-13> st=j</line-13>
<line-14> si=n-st</line-14>
<line-15> c=(si*(si+1))//2</line-15>
<line-17> print(tot)</line-17>
|
{"code": "<line-2>t=int(input())</line-2>\n<line-16> tot+=c</line-16>", "lines": [2, 16]}
#### 0
|
<line-1>from collections import Counter</line-1>
<line-3> a = Counter(A)</line-3>
<line-4> b = Counter(B)</line-4>
<line-5> ans = 0</line-5>
<line-6> for i in a:</line-6>
<line-7> if i in b:</line-7>
<line-8> ans += min(a[i],b[i])</line-8>
<line-9> </line-9>
<line-10> return ans</line-10>
<line-11> </line-11>
<line-12> </line-12>
<line-13>t = int(input())</line-13>
<line-14></line-14>
<line-15>for _ in range(t):</line-15>
<line-16> A = input()</line-16>
<line-18> print(solve(A,B))</line-18>
|
{"code": "<line-2>def solve(A,B):</line-2>\n<line-17> B = input()</line-17>", "lines": [2, 17]}
#### 0
|
<line-1>for _ in range(int(input())):</line-1>
<line-3> a = list(map(int, input().split()))</line-3>
<line-4> s = set(a)</line-4>
<line-5></line-5>
<line-6> if n == 1 or len(s) > 2:</line-6>
<line-7> print(-1)</line-7>
<line-8> continue</line-8>
<line-9></line-9>
<line-10> if len(s) == 1:</line-10>
<line-11> x = s.pop()</line-11>
<line-12></line-12>
<line-13> if x == 0:</line-13>
<line-14> print(n)</line-14>
<line-15> elif x == n-1:</line-15>
<line-16> print(0)</line-16>
<line-17> else:</line-17>
<line-18> print(-1)</line-18>
<line-19></line-19>
<line-20> continue</line-20>
<line-21></line-21>
<line-22> x, y = sorted(s)</line-22>
<line-23> xc, yc = a.count(x), a.count(y)</line-23>
<line-24></line-24>
<line-25> if xc == y and xc == x + 1:</line-25>
<line-26> print(yc)</line-26>
<line-28> print(-1)</line-28>
|
{"code": "<line-2> n = int(input())</line-2>\n<line-27> else:</line-27>", "lines": [2, 27]}
#### 0
|
<line-1>try:</line-1>
<line-3> s,s1=0,0</line-3>
<line-4> x,k=[int(i) for i in input().split()]</line-4>
<line-5> for i in range(2,x+1):</line-5>
<line-6> if(x%i==0):</line-6>
<line-7> s=s+i**k</line-7>
<line-8> for i in range(2,k+1):</line-8>
<line-9> if(k%i==0):</line-9>
<line-10> s1+=i*x</line-10>
<line-11> print(s,s1)</line-11>
<line-13> pass</line-13>
|
{"code": "<line-2> for _ in range(int(input())):</line-2>\n<line-12>except EOFError as e:</line-12>", "lines": [2, 12]}
#### 0
|
<line-1>from sys import stdin, stdout</line-1>
<line-3>from collections import defaultdict as dd</line-3>
<line-4>import math</line-4>
<line-5>def geti(): return list(map(int, input().strip().split()))</line-5>
<line-6>def getl(): return list(map(int, input().strip().split()))</line-6>
<line-7>def gets(): return input()</line-7>
<line-8>def geta(): return int(input())</line-8>
<line-9>def print_s(s): stdout.write(s+'\n')</line-9>
<line-10></line-10>
<line-11>def solve():</line-11>
<line-12> for _ in range(geta()):</line-12>
<line-13> n=geta()</line-13>
<line-14> n=bin(n).split('b')[1]</line-14>
<line-15> print(n.count('0'))</line-15>
<line-16></line-16>
<line-17></line-17>
<line-18>def __starting_point():</line-18>
<line-20></line-20>
<line-21>__starting_point()</line-21>
|
{"code": "<line-2>input = stdin.readline</line-2>\n<line-19> solve()</line-19>", "lines": [2, 19]}
#### 0
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.