question
stringlengths
0
30.2k
answer
stringlengths
55
2.44k
<line-1>for _ in range(int(input())):</line-1> <line-3> a=list(map(int,input().split()))</line-3> <line-4> x=int(input())</line-4> <line-5> for _ in range(1,n,2):</line-5> <line-6> a[_],a[_-1]=a[_-1],a[_]</line-6> <line-7> for _ in range(n):</line-7> <line-8> a[_]+=(a[_]%3)</line-8> <line-9> ...
{"code": "<line-2> n=int(input())</line-2>\n<line-33> else: </line-33>", "lines": [2, 33]} #### 0
<line-1># cook your dish here</line-1> <line-3>for _ in range(int(input())):</line-3> <line-4> n=int(input())</line-4> <line-5> a=list(map(int, input().split()))</line-5> <line-6> b=list(map(int, input().split()))</line-6> <line-7></line-7> <line-8> if a[0]!=0 or b[-1]!=0 or a[-1]!=b[0]:</line-8> <line-9> print('No')<...
{"code": "<line-2># cook your dish here</line-2>\n<line-30> if flag==0:</line-30>", "lines": [2, 30]} #### 0
<line-1>def search(arr, lenl, val):</line-1> <line-3> l = lenl - 1</line-3> <line-4></line-4> <line-5> total = 0</line-5> <line-6></line-6> <line-7> while (s <= l):</line-7> <line-8> m = int((s + l) / 2)</line-8> <line-9></line-9> <line-10> if (arr[m] <= val):</line-10> <line-11> total...
{"code": "<line-2> s = 0</line-2>\n<line-90> count += (q - 1)*lenl</line-90>", "lines": [2, 90]} #### 0
<line-1># cook your dish here</line-1> <line-3> if num%1==0:</line-3> <line-4> return int(num//1)</line-4> <line-5> else:</line-5> <line-6> return int((num//1)+1)</line-6> <line-7> </line-7> <line-8>for _ in range(int(input())):</line-8> <line-9> n=int(input())</line-9> <line-10> s=input()</line-10> <line-11> p=0</li...
{"code": "<line-2>def ceil(num):</line-2>\n<line-24> else:</line-24>", "lines": [2, 24]} #### 0
<line-1># cook your dish here</line-1> <line-3>while t:</line-3> <line-4> n=int(input())</line-4> <line-5> r1=input()</line-5> <line-6> r2=input()</line-6> <line-7> r1count=0</line-7> <line-8> r2count=0</line-8> <line-9> count=0</line-9> <line-10> for i in range(n):</line-10> <line-11> if(r1[i]=="*"):</line-11> <line-...
{"code": "<line-2>t=int(input())</line-2>\n<line-35> print(count)</line-35>", "lines": [2, 35]} #### 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.setrecursi...
{"code": "<line-2>import math;</line-2>\n<line-20> k=int(input())</line-20>", "lines": [2, 20]} #### 0
<line-1>from sys import setrecursionlimit</line-1> <line-3></line-3> <line-4>def solve(i):</line-4> <line-5> if i + k >= n:</line-5> <line-6> return 1</line-6> <line-7></line-7> <line-8> if i in dp:</line-8> <line-9> return dp[i]</line-9> <line-10></line-10> <line-11> mini = float('inf')</line-11...
{"code": "<line-2>setrecursionlimit(10 * 9)</line-2>\n<line-89> else:</line-89>", "lines": [2, 89]} #### 0
<line-1># cook your dish here</line-1> <line-3>try:long</line-3> <line-4>except NameError:long = int </line-4> <line-5>def fac(n):</line-5> <line-6> step,maxq,d = lambda x: 1 + (x<<2) - ((x>>1)<<1),long(floor(sqrt(n))),1</line-6> <line-7> q = n % 2 == 0 and 2 or 3 </line-7> <line-8> while q <= maxq and n % q !...
{"code": "<line-2>from math import floor, sqrt</line-2>\n<line-20> if su*(k-m*s) <0:m,di,su = 0,{},0</line-20>", "lines": [2, 20]} #### 0
<line-1>import random</line-1> <line-3>for testCase in range(t):</line-3> <line-4> n=int(input())</line-4> <line-5> array1=[]</line-5> <line-6> array2=[]</line-6> <line-7> array=[]</line-7> <line-8> for i in range(n) :</line-8> <line-9> array1.append(list(map(int,input().split())))</line-9> <line-10> for i in range(n)...
{"code": "<line-2>t=int(input())</line-2>\n<line-39>\t\tprint(x+1, end=' ')</line-39>", "lines": [2, 39]} #### 0
<line-1>n=int(input())</line-1> <line-3>dp=[0]*n </line-3> <line-4>dp[0]=ar[0]</line-4> <line-5>dp[1]=ar[1]</line-5> <line-6>for i in range(2,n):</line-6> <line-7> dp[i]=min(dp[i-2],dp[i-1])+ar[i]</line-7> <line-8> </line-8> <line-9>ar.reverse()</line-9> <line-10>#print(ar)</line-10> <line-11>dp1=[0]*n </line-11>...
{"code": "<line-2>ar=list(map(int,input().split()))</line-2>\n<line-15> dp1[i]=min(dp1[i-2],dp1[i-1])+ar[i]</line-15>", "lines": [2, 15]} #### 0
<line-1>for tc in range(int(input())):</line-1> <line-3> a, b = list(map(int, input().split()))</line-3> <line-4> pr = []</line-4> <line-5></line-5> <line-6> # 'L' is lexicographically lower than 'R'.</line-6> <line-7> # so, we should first try to apply L+ or L-</line-7> <line-8> # if we can't then only we'll try to ap...
{"code": "<line-2> N = int(input())</line-2>\n<line-35> print(len(pr))</line-35>", "lines": [2, 35]} #### 0
<line-1># cook your dish here</line-1> <line-3>MOD = 10 ** 9 + 7</line-3> <line-4> </line-4> <line-5>for t in range(int(input())):</line-5> <line-6> N, M, K = map(int, input().split())</line-6> <line-7> A = list(map(int, input().split()))</line-7> <line-8> I, D = [0] * (N + 2), [0] * (N + 2)</line-8> <line-9> ...
{"code": "<line-2># cook your dish here</line-2>\n<line-44> ans = ans * (mx - mn + 1) % MOD</line-44>", "lines": [2, 44]} #### 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> m,n = map(int,input().rstrip().split())</line-5> <line-6> cnt = len(str(n))</line-6> <line-7> x = pow(10,cnt)</line-7> <line-8> if n == x-1:</line-8> <line-9> print(m*cnt,m)</line-9> ...
{"code": "<line-2>from math import pow</line-2>\n<line-10> else:</line-10>", "lines": [2, 10]} #### 0
<line-1>from math import ceil</line-1> <line-2></line-2> <line-4> n = int(input())</line-4> <line-5> arr = [int(x) for x in input().split()]</line-5> <line-6> sarr = sum(arr)</line-6> <line-7> mavg = sarr/n</line-7> <line-8> while n>1:</line-8> <line-9> sarr -= arr.pop()</line-9> <line-10> n-=1</line-10> <line-12> pr...
{"code": "<line-3>for _ in range(int(input())):</line-3>\n<line-11> mavg = max(mavg, sarr/n)</line-11>", "lines": [3, 11]} #### 0
<line-1>import math</line-1> <line-3>for i in range(t):</line-3> <line-4> k=int(input())</line-4> <line-6> print(res)</line-6>
{"code": "<line-2>t=int(input())</line-2>\n<line-5> res=((pow(2,k,1000000007))*5)%1000000007</line-5>", "lines": [2, 5]} #### 0
<line-1># Md. Khairullah Gaurab</line-1> <line-3># gaurab.cse.sust@gmail.com</line-3> <line-4></line-4> <line-5></line-5> <line-6>test = int(input());</line-6> <line-7></line-7> <line-8>for i in range(test):</line-8> <line-9> N, S, K = list(map(int,input().split()));</line-9> <line-10> lis = list(map(int,input()...
{"code": "<line-2># SUST, CSE, 20th Batch</line-2>\n<line-14> print(ans[j],end=' ');</line-14>", "lines": [2, 14]} #### 0
<line-1>for u in range(int(input())):</line-1> <line-3> n=int(p[0])</line-3> <line-4> s=p[1]</line-4> <line-5> x,y=0,0</line-5> <line-6> for i in range(n):</line-6> <line-7> l=input()</line-7> <line-8> if(l[0]=='1'):</line-8> <line-9> y+=l.count('1')</line-9> <line-10> else:</line-10> <line-11> x+=l.count('0')</...
{"code": "<line-2> p=input().split()</line-2>\n<line-19> else:</line-19>", "lines": [2, 19]} #### 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> p = [int(x) for x in input().split()]</line-5> <line-6> q = [int(x) for x in input().split()]</line-6> <line-7> </line-7> <line-8> q[1] *= -1</line-8> <line-9> ...
{"code": "<line-2>try:</line-2>\n<line-13>except:</line-13>", "lines": [2, 13]} #### 0
<line-1># cook your dish here</line-1> <line-3>for _ in range(int(input())):</line-3> <line-4> </line-4> <line-5> n,x=list(map(int,input().split()))</line-5> <line-6> </line-6> <line-7> l=list(map(int,input().split()))</line-7> <line-8> battery=[]</line-8> <line-9> </line-9> <line-10> power=0</line-10> <line-11> i=0</l...
{"code": "<line-2>import bisect</line-2>\n<line-36> else:</line-36>", "lines": [2, 36]} #### 0
<line-1>n=int(input())</line-1> <line-3>for i in range(1,n+1):</line-3> <line-4> arr.append(i)</line-4> <line-5>c=0</line-5> <line-6>i=0</line-6> <line-7>f=0;</line-7> <line-8>while(c<n-1):</line-8> <line-9> if(arr[i%n]!=-1 and f):</line-9> <line-10> arr[i%n]=-1</line-10> <line-11> c=c+1</line-11> <line-12> f=0</lin...
{"code": "<line-2>arr=[]</line-2>\n<line-20> break;</line-20>", "lines": [2, 20]} #### 0
<line-1># cook your dish here</line-1> <line-3></line-3> <line-4></line-4> <line-5>import bisect</line-5> <line-6>for _ in range(int(input())):</line-6> <line-7> n = int(input())</line-7> <line-8> x1 , x2, x3 = [], [], []</line-8> <line-9> for i in range(n):</line-9> <line-10> x, y = list(map(int, input().split()))</l...
{"code": "<line-2># Author: Dancing Monkey | Created: 09.DEC.2018</line-2>\n<line-56> print(format(area, 'f'))</line-56>", "lines": [2, 56]} #### 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> s=input().strip()</line-5> <line-6> c=0</line-6> <line-7> for i in range(len(s)):</line-7> <line-8> if s[i]=='.':</line-8> <line-9> continue</line-9> <line-10> if s[i]=='H':</line-10> <line-11> c+=...
{"code": "<line-2>t=int(input())</line-2>\n<line-20> else:</line-20>", "lines": [2, 20]} #### 0
<line-1>t = eval(input())</line-1> <line-2></line-2> <line-4> h = 1</line-4> <line-5> triange = []</line-5> <line-6> while m >= h:</line-6> <line-7> triange.append(h)</line-7> <line-8> m -= h </line-8> <line-9> h += 1</line-9> <line-10> return len(triange)</line-10> <line-11></line-11> <line-12>triangulo = []</line-...
{"code": "<line-3>def moneda(m):</line-3>\n<line-17>for i in triangulo:</line-17>", "lines": [3, 17]} #### 0
<line-1>for u in range(int(input())):</line-1> <line-3> l=list(map(int,input().split()))</line-3> <line-4> d=list(map(int,input().split()))</line-4> <line-5> ka=[]</line-5> <line-6> k=[]</line-6> <line-7> l.sort()</line-7> <line-8> d.sort()</line-8> <line-9> for i in range(n):</line-9> <line-10> ...
{"code": "<line-2> n=int(input())</line-2>\n<line-19> else:</line-19>", "lines": [2, 19]} #### 0
<line-1>t =int(input())</line-1> <line-3> C=[ord(x)-ord('R') for x in list(input())]</line-3> <line-4> N=int(input())</line-4> <line-5> L=sum(C)</line-5> <line-6> r=1</line-6> <line-7> c=0</line-7> <line-8> while(r*L<N*12):</line-8> <line-9> c+=N*12-r*L</line-9> <line-11> print(c)</line-11> ...
{"code": "<line-2>for i in range(t):</line-2>\n<line-10> r+=1</line-10>", "lines": [2, 10]} #### 0
<line-1>def find_upper_bound(arr,key):</line-1> <line-3> while low<=high:</line-3> <line-4> mid = (low+high)//2 </line-4> <line-5> if arr[mid]==key:return mid</line-5> <line-6> elif arr[mid]>key and mid-1>=0 and arr[mid-1]<key:return mid </line-6> <line-7> elif arr[mid]>key:high = mid - 1 </line-7> <line-8> else:l...
{"code": "<line-2> low,high = 0,len(arr)-1</line-2>\n<line-28> l,r = map(int,input().split())</line-28>", "lines": [2, 28]} #### 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>def check(mid):</line-5> <line-6> pos = x[0]</line-6> <line-7> ct = 1</line-7> <line-8> for i in range(1,n):</line-8> <line-9> if...
{"code": "<line-2>import sys;input = sys.stdin.readline</line-2>\n<line-28> r = mid</line-28>", "lines": [2, 28]} #### 0
<line-1>n,m,k=map(int, input().split())</line-1> <line-3>check = [0]*m</line-3> <line-4>while k!= 0:</line-4> <line-5> x1,y1,x2,y2 =map(int,input().split())</line-5> <line-6> a.append([x1,y1,x2,y2])</line-6> <line-7> check[y1-1] += 1</line-7> <line-8> check[y2-1] += 1</line-8> <line-9> k-= 1</line-9> <line-10>maxi = ch...
{"code": "<line-2>a = []</line-2>\n<line-27> sum+= k*2</line-27>", "lines": [2, 27]} #### 0
<line-1>try:</line-1> <line-3> while(t > 0):</line-3> <line-4> t -= 1</line-4> <line-5> n,m = list(map(int,input().split()))</line-5> <line-6> a = [list(map(int,input().split())) for _ in range(n)]</line-6> <line-7> dp = [[0 for _ in range(m)] for _ in range(n)]</line-7> <line-8> a...
{"code": "<line-2> t = int(input())</line-2>\n<line-27>except:</line-27>", "lines": [2, 27]} #### 0
<line-1># cook your dish here</line-1> <line-3></line-3> <line-4>for _ in range(0,test):</line-4> <line-5> n = int(input())</line-5> <line-7> print(len(lister))</line-7>
{"code": "<line-2>test = int(input())</line-2>\n<line-6> lister = set(map(int,input().split()))</line-6>", "lines": [2, 6]} #### 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> a=list(map(int,input().split()))</line-5> <line-6> n=a[0]</line-6> <line-8> print(m*n//math.gcd(m,n))</line-8>
{"code": "<line-2>import math</line-2>\n<line-7> m=a[1]</line-7>", "lines": [2, 7]} #### 0
<line-1>for _ in range(int(input())):</line-1> <line-3> l=list(map(int, input().split()))</line-3> <line-4> l.sort()</line-4> <line-5> </line-5> <line-6> c=0</line-6> <line-7> mn=abs(l[0]+l[1]-k)</line-7> <line-8> for i in range(n-1):</line-8> <line-9> for j in range(i+1, n):</line-9> <line-10> temp=abs(l[i]+l[j]-k)...
{"code": "<line-2> n,k=list(map(int, input().split()))</line-2>\n<line-19> break</line-19>", "lines": [2, 19]} #### 0
<line-1># cook your dish here</line-1> <line-3>list1=[]</line-3> <line-4>for i in range(int(input())):</line-4> <line-5> x=int(input())</line-5> <line-6> ans=(pow(2,x,mod)-1)%mod</line-6> <line-7> list1.append((i+1,ans))</line-7> <line-9> print(f'Case {i[0]}: {i[1]}')</line-9>
{"code": "<line-2>mod=8589934592</line-2>\n<line-8>for i in list1:</line-8>", "lines": [2, 8]} #### 0
<line-1>'''Author- Akshit Monga'''</line-1> <line-3>input = stdin.readline</line-3> <line-4>t=int(input())</line-4> <line-5>for _ in range(t):</line-5> <line-6> n=int(input())</line-6> <line-7> a=[int(x) for x in input().split()]</line-7> <line-8> ans=0</line-8> <line-9> dp=[-1 for i in range(0,n+1)]</line-9> <line-10>...
{"code": "<line-2>from sys import stdin, stdout</line-2>\n<line-14> dp[i]=max(dp[i],var2+1)</line-14>", "lines": [2, 14]} #### 0
<line-1>from collections import Counter </line-1> <line-3> s = input()</line-3> <line-4> c = Counter(list(s))</line-4> <line-5> if len(c) == 1:</line-5> <line-6> print(0)</line-6> <line-7> else:</line-7> <line-8> m = min(c['b'], c['g'])</line-8> <line-9> ma = max(c['b'], c['g'])</line-9> <line-10> l = (ma - m + 1) ...
{"code": "<line-2>for _ in range(int(input())):</line-2>\n<line-23> r += 1</line-23>", "lines": [2, 23]} #### 0
<line-1>def f(a,n):</line-1> <line-3> </line-3> <line-4> for i in range(n):</line-4> <line-5> count = 1</line-5> <line-6> while(len(s1)>0 and a[i]<s1[-1][0]):</line-6> <line-7> count += s1[-1][1]</line-7> <line-8> s1.pop()</line-8> <line-9> s1.append((a[i],count))</line-9> <line-10> l[i] = ...
{"code": "<line-2> l,r,s1,s2 = [0]*n, [0]*n, [], []</line-2>\n<line-24> return count</line-24>", "lines": [2, 24]} #### 0
<line-1>t = int(input())</line-1> <line-3> n, m = map(int, input().split())</line-3> <line-4> arr1 = list(map(int, input().split()))</line-4> <line-5> arr2 = list(map(int, input().split()))</line-5> <line-6> hmap = {}</line-6> <line-7> for i in range(n):</line-7> <line-8> if arr1[i] in hmap:</line...
{"code": "<line-2>for i in range(t):</line-2>\n<line-25> print(x,end=' ')</line-25>", "lines": [2, 25]} #### 0
<line-1>t=int(input())</line-1> <line-3> k=1</line-3> <line-4> j=0</line-4> <line-5> n=int(input())</line-5> <line-6> while(n>0):</line-6> <line-7> if(n<=k):</line-7> <line-8> j+=1</line-8> <line-9> n=0</line-9> <line-10> elif n>2*k:</line-10> <line-11> j+=2</line-11> <line-12> n=n-2*k</line-12> <line-13> k...
{"code": "<line-2>while(t):</line-2>\n<line-17> print(j)</line-17>", "lines": [2, 17]} #### 0
<line-1># cook your dish here</line-1> <line-3></line-3> <line-4>import math</line-4> <line-5>def distinctPrimeFactors(num) :</line-5> <line-6> primes,sqrt = set(),int(math.sqrt(num))</line-6> <line-7> if (num == 2) :primes.add(num)</line-7> <line-8> for j in range(2, sqrt + 1) :</line-8> <line-9> if (n...
{"code": "<line-2># cook your dish here</line-2>\n<line-35> c += 1;res.append(count) </line-35>", "lines": [2, 35]} #### 0
<line-1>import math</line-1> <line-3> f = math.factorial</line-3> <line-4> return f(n) / f(r) / f(n-r)</line-4> <line-5>t=int(input())</line-5> <line-6>for i in range(1,t+1):</line-6> <line-7> n=int(input())</line-7> <line-8> arr = list(map(int, input().split()))</line-8> <line-9> m=0</line-9> <line-10> ans=0.0</line-1...
{"code": "<line-2>def comb(n,r):</line-2>\n<line-16> ans=ans/pow(2,m-1)</line-16>", "lines": [2, 16]} #### 0
<line-1># cook your dish here</line-1> <line-3> n,r=list(map(int,input().split()))</line-3> <line-4> l=list(map(int,input().split()))</line-4> <line-5> m=0</line-5> <line-6> for i in range(n-1):</line-6> <line-7> d=[]</line-7> <line-8> d.append(l[i])</line-8> <line-9> c=1</line-9> <line...
{"code": "<line-2>for u in range(int(input())):</line-2>\n<line-18> m=c</line-18>", "lines": [2, 18]} #### 0
<line-1>n, m = map(int, input().split())</line-1> <line-3>f = 1</line-3> <line-4>s = ((n)*(n+1))//2 - l - f</line-4> <line-5>for _ in range(m):</line-5> <line-6> k = int(input())</line-6> <line-7> if 2 <= k <= n-1 or k in [f, l]:</line-7> <line-8> l, f = f, l</line-8> <line-9> else:</line-9> <line-11> print(s+l+f)</li...
{"code": "<line-2>l = n</line-2>\n<line-10> l = k</line-10>", "lines": [2, 10]} #### 0
<line-1>import math</line-1> <line-3> return (math.floor(math.sqrt(b)) - math.ceil(math.sqrt(a)) + 1)</line-3> <line-4>for _ in range(int(input())):</line-4> <line-5> n=int(input())</line-5> <line-6> val=CountSquares(1,n)</line-6> <line-8> print(ans)</line-8>
{"code": "<line-2>def CountSquares(a, b):</line-2>\n<line-7> ans=val-val//3</line-7>", "lines": [2, 7]} #### 0
<line-1># cook your dish here</line-1> <line-3>tests = int(input())</line-3> <line-4>for _ in range(tests):</line-4> <line-5> n = int(input())</line-5> <line-6> weights = [int(j) for j in input().split()]</line-6> <line-7> edges = [[0] for _ in range(n-1)]</line-7> <line-8> for i in range(n-1):</line-8> <line-9...
{"code": "<line-2>import numpy as np</line-2>\n<line-51> else:</line-51>", "lines": [2, 51]} #### 0
<line-1>for i in range(int(input())):</line-1> <line-3> n=0</line-3> <line-4> for i in range(1,t+1):</line-4> <line-5> n=n+i</line-5> <line-6> x=[n]</line-6> <line-7> y=n</line-7> <line-8> for j in range(i,t+i-1):</line-8> <line-9> if j<t:</line-9> <line-10> z=y+j</line-10> <line-11> else:</line-11> <line-12...
{"code": "<line-2> t=int(input())</line-2>\n<line-14> y=z</line-14>", "lines": [2, 14]} #### 0
<line-1># cook your dish here</line-1> <line-3> n = int(input())</line-3> <line-4> ar = list(map(int, input().split()))</line-4> <line-5> </line-5> <line-6> count = 0</line-6> <line-7> for item in ar:</line-7> <line-8> if bin(item)[-1] == '0':</line-8> <line-10> </line-10> <line-11> print(co...
{"code": "<line-2>for test in range(int(input())):</line-2>\n<line-9> count += item</line-9>", "lines": [2, 9]} #### 0
<line-1>from sys import setrecursionlimit</line-1> <line-3></line-3> <line-4>def solve(i, j, c=0):</line-4> <line-5> if i > j:</line-5> <line-6> return 0</line-6> <line-7></line-7> <line-8> if (i, j) in dp:</line-8> <line-9> return dp[i, j]</line-9> <line-10></line-10> <line-11> x0 = solve(i+1, j, c^1)</line-11> <lin...
{"code": "<line-2>setrecursionlimit(10 ** 9)</line-2>\n<line-27> total = solve(0, n-1)</line-27>", "lines": [2, 27]} #### 0
<line-1>#!/usr/bin/env python2</line-1> <line-2> </line-2> <line-4> return 'a' <= c <= 'h'</line-4> <line-5>def gd(c):</line-5> <line-6> return '1' <= c <= '8'</line-6> <line-7> </line-7> <line-8>t = int(input())</line-8> <line-9>for i in range(t):</line-9> <line-10> line = input()</line-10> <line-11> if len(line) ...
{"code": "<line-3>def gc(c):</line-3>\n<line-29> else:</line-29>", "lines": [3, 29]} #### 0
<line-1>T=int(input()) # cook your dish here</line-1> <line-3> n=list(map(int,input().split()))</line-3> <line-4> a=n[0]</line-4> <line-5> b=n[1]</line-5> <line-6> c=n[2]</line-6> <line-7> l=[]</line-7> <line-8> A=list(map(int,input().split()))</line-8> <line-9> B=list(map(int,input().split()))</li...
{"code": "<line-2>for i in range(T): </line-2>\n<line-23> sum+=int(l[i])</line-23>", "lines": [2, 23]} #### 0
<line-1># cook your dish here</line-1> <line-3>for i in range(t):</line-3> <line-4> x=int(input())</line-4> <line-5> if x%10==0:</line-5> <line-6> print(0)</line-6> <line-7> elif x%5==0:</line-7> <line-8> print(1)</line-8> <line-10> print(-1)</line-10>
{"code": "<line-2>t=int(input())</line-2>\n<line-9> else:</line-9>", "lines": [2, 9]} #### 0
<line-1>for _ in range(int(input())):</line-1> <line-3> a=[]</line-3> <line-4> l=0</line-4> <line-5> for i in range(n):</line-5> <line-6> a.append(list(map(int,input().split())))</line-6> <line-7> for i in range(n-1,0,-1):</line-7> <line-8> r=a[i][i-1]+1</line-8> <line-9> if a[i][i]!=r:</line-9> <line-10> l+=1</li...
{"code": "<line-2> n=int(input())</line-2>\n<line-14> a[j][k],a[k][j]=a[k][j],a[j][k]</line-14>", "lines": [2, 14]} #### 0
<line-1># cook your dish here</line-1> <line-3>for _ in range(t):</line-3> <line-4> s=input()</line-4> <line-5> k=len(s)</line-5> <line-6> count=0</line-6> <line-7> for i in range(k-1):</line-7> <line-8> if(s[i]=="C"):</line-8> <line-9> if(s[i+1]=='E'or s[i+1]=='S' or s[i+1]=="C"):</line-9> <line-10> count+=1 </l...
{"code": "<line-2>t=int(input())</line-2>\n<line-19> else:</line-19>", "lines": [2, 19]} #### 0
<line-1>t=int(input())</line-1> <line-3> n=int(input())</line-3> <line-4> x=list(map(int,input().split()))</line-4> <line-5> dic={}</line-5> <line-6> dic2={}</line-6> <line-7> for i in range(n):</line-7> <line-8> dic2[x[i]]=1</line-8> <line-9> #print dic2</line-9> <line-10> if len(dic2)==n:</line-10> <line-11> n+=2</...
{"code": "<line-2>for q in range(t):</line-2>\n<line-34> dic.clear()</line-34>", "lines": [2, 34]} #### 0
<line-1>lucky = {4, 774, 7, 744, 777, 74, 747, 44, 77, 47, 474, 444, 477, 447}</line-1> <line-3>import sys </line-3> <line-4>sys.setrecursionlimit(10 ** 6)</line-4> <line-5>mod = 10 ** 9 + 7</line-5> <line-6>fact = [1]</line-6> <line-7>for i in range(1, 1001):</line-7> <line-8> fact.append(fact[-1] * i % mod)</line-...
{"code": "<line-2>from functools import lru_cache</line-2>\n<line-37> l = str(int(l) -1) </line-37>", "lines": [2, 37]} #### 0
<line-1>T=int(input())</line-1> <line-3>for t in range(T):</line-3> <line-4> R=int(input())</line-4> <line-5> a=2*(R**2)</line-5> <line-6> l.append(a)</line-6> <line-8> print(s)</line-8>
{"code": "<line-2>l=[]</line-2>\n<line-7>for s in l:</line-7>", "lines": [2, 7]} #### 0
<line-1>try:</line-1> <line-3> while t>0:</line-3> <line-4> [a,b]=[int(x) for x in input().split()]</line-4> <line-5> if a==1 and b==1:</line-5> <line-6> print(1)</line-6> <line-7> continue</line-7> <line-8> if a%2==0:</line-8> <line-9> o1=a//2</line-9> <line-10> e1=a//2</line-10> <line-11> else:</line-11> ...
{"code": "<line-2> t=int(input())</line-2>\n<line-24>except:</line-24>", "lines": [2, 24]} #### 0
<line-1># cook your dish here</line-1> <line-3># import bisect</line-3> <line-4>def insort(l, v):</line-4> <line-5> s = 0</line-5> <line-6> e = len(l)</line-6> <line-7> while True:</line-7> <line-8> mid = (s+e)//2</line-8> <line-9> if s == e or mid > len(l):</line-9> <line-10> break</l...
{"code": "<line-2># from queue import PriorityQueue</line-2>\n<line-77> # print(dic)</line-77>", "lines": [2, 77]} #### 0
<line-1># cook your dish here</line-1> <line-3>for i in range(t):</line-3> <line-4> v,w=list(map(int,input().strip().split(" ")))</line-4> <line-5> if v==w:</line-5> <line-6> print(v+1)</line-6> <line-7> elif v<w:</line-7> <line-8> print(v+1)</line-8> <line-9> else:</line-9> <line-10> p...
{"code": "<line-2>t=int(input())</line-2>\n<line-15> ct=0</line-15>", "lines": [2, 15]} #### 0
<line-1># cook your dish here</line-1> <line-3>from collections import defaultdict</line-3> <line-4>for _ in range(int(stdin.readline())):</line-4> <line-5> n=int(stdin.readline())</line-5> <line-6> lst=list(map(int, stdin.readline().split()))</line-6> <line-7> prefix_odd=[0]*n</line-7> <line-8> prefix_even...
{"code": "<line-2>from sys import stdin, stdout</line-2>\n<line-85> max_sum=temp_sum'''</line-85>", "lines": [2, 85]} #### 0
<line-2> n=int(input())</line-2> <line-3> print(n//2+1)</line-3>
{"code": "<line-1>for i in range(int(input())):</line-1>", "lines": [1]} #### 0
<line-1>import sys</line-1> <line-3></line-3> <line-4>def main(arr):</line-4> <line-5> </line-5> <line-6> k=len(arr[0])</line-6> <line-7> n=len(arr)</line-7> <line-8> dp=[[0]*k for i in range(n+1)]</line-8> <line-9> </line-9> <line-10> summation_arr=[]</line-10> <line-11> for i in range(len(arr)):</line-11> <line-12> ...
{"code": "<line-2>import math</line-2>\n<line-30> arr.append(list(map(int,input().split())))</line-30>", "lines": [2, 30]} #### 0
<line-1>def codn1(s1,s2,p):</line-1> <line-3> ind=0</line-3> <line-4> for i in range(len(s1)):</line-4> <line-5> if s1[i]!=s2[i]:</line-5> <line-6> c+=1</line-6> <line-7> ind=i</line-7> <line-8> if c>1 or ind==len(s1)-1:</line-8> <line-9> return 0</line-9> <line-10> if s1[ind]>s2[ind] and s1[ind] in s2[ind+1:]:</...
{"code": "<line-2>\tc=0</line-2>\n<line-64>\tans=max(ans,longest(i))</line-64>", "lines": [2, 64]} #### 0
<line-1>from math import sqrt</line-1> <line-2></line-2> <line-4>pairs = 0</line-4> <line-5></line-5> <line-6>for i in range(1, a+1):</line-6> <line-7> for j in range(1, b+1):</line-7> <line-8> root = sqrt(i**2 + j)</line-8> <line-9></line-9> <line-10> if not root - int(root):</line-10> <line-12></line-12> <line-13>p...
{"code": "<line-3>a, b = map(int, input().split())</line-3>\n<line-11> pairs += 1</line-11>", "lines": [3, 11]} #### 0
<line-1>def check(l,n):</line-1> <line-3> for i in range(n-1):</line-3> <line-4> x = l[i]</line-4> <line-5> c = 0</line-5> <line-6> j = i</line-6> <line-7> while (j+2<n and l[j+2]==x) or (j+1<n and l[j+1] == x):</line-7> <line-8> if l[j+1] == x:</line-8> <line-9> ...
{"code": "<line-2> m = 0</line-2>\n<line-20> a = list(map(int,input().split()))</line-20>", "lines": [2, 20]} #### 0
<line-1>N = int(input())</line-1> <line-3>flag = 0</line-3> <line-4>for i in range(N+1, 987654321):</line-4> <line-5> a = str(i)</line-5> <line-6> b = list(a)</line-6> <line-7> c = set(a)</line-7> <line-8> if '0' not in b:</line-8> <line-9> if len(b) == len(c):</line-9> <line-10> print(i)<...
{"code": "<line-2>i = N + 1</line-2>\n<line-14>if flag < 1:</line-14>", "lines": [2, 14]} #### 0
<line-1>import math</line-1> <line-3>def diff(li1, li2): </line-3> <line-4> li_dif = [i for i in li1 if i not in li2]</line-4> <line-5> return li_dif </line-5> <line-6>def segments(b):</line-6> <line-7> """A sequence of (x,y) numeric coordinates pairs """</line-7> <line-8> poly = [(i[0],i[1]) for i ...
{"code": "<line-2>from itertools import permutations as p</line-2>\n<line-34> x = round(av(yes[0])-perimeter(diff(b,yes[0])),2)</line-34>", "lines": [2, 34]} #### 0
<line-1># cook your dish here</line-1> <line-3>for i in range(str1):</line-3> <line-4> l1=[]</line-4> <line-5> str2=input()</line-5> <line-6> for i in str2:</line-6> <line-7> l1.append(i)</line-7> <line-8> </line-8> <line-9> count=0</line-9> <line-10> d=dict()</line-10> <line-11> d={'a':1,'b...
{"code": "<line-2>str1=int(input())</line-2>\n<line-22> count+=min([a,e,i,o,u])</line-22>", "lines": [2, 22]} #### 0
<line-1># cook your dish here</line-1> <line-3>def get_array(): return list(map(int , sys.stdin.readline().strip().split()))</line-3> <line-4>def get_ints(): return list(map(int, sys.stdin.readline().strip().split()))</line-4> <line-5>def input(): return sys.stdin.readline().strip()</line-5> <line-6>import math</line-6...
{"code": "<line-2>import sys</line-2>\n<line-27> print(n-r1+1)</line-27>", "lines": [2, 27]} #### 0
<line-1>t=int(input())</line-1> <line-3> t=t-1</line-3> <line-4> n=int(input())</line-4> <line-5> ans=0</line-5> <line-6> for i in range(1,n+1,1):</line-6> <line-7> sum=0;</line-7> <line-8> for j in range(1,i+1,1):</line-8> <line-9> sum=sum+j</line-9> <line-10> s=sum-i</line-...
{"code": "<line-2>while(t!=0):</line-2>\n<line-15> ans=ans+sum*i</line-15>", "lines": [2, 15]} #### 0
<line-1>isPrime=[1 for i in range(10001)]</line-1> <line-3>isPrime[0]=0</line-3> <line-4>isPrime[1]=0</line-4> <line-5>prime=[]</line-5> <line-6>for i in range(2,10001):</line-6> <line-7> if isPrime[i]:</line-7> <line-8> prime.append(i)</line-8> <line-9> for j in range(i*i,10001,i):</line-9> <line-10> isPrime[j]=0<...
{"code": "<line-2>cnt=[0 for i in range(10001)]</line-2>\n<line-20> n=int(input())</line-20>", "lines": [2, 20]} #### 0
<line-1># cook your dish here</line-1> <line-3>x=[]</line-3> <line-4>y=[]</line-4> <line-5>for _ in range(n):</line-5> <line-6> s=input().split(' ')</line-6> <line-7> x.append(int(s[0]))</line-7> <line-8> y.append(int(s[1]))</line-8> <line-9>q=x[0]</line-9> <line-10>w=y[0]</line-10> <line-11>for t in range(n-1):</line-...
{"code": "<line-2>n=int(input())</line-2>\n<line-23>print(abs(a))</line-23>", "lines": [2, 23]} #### 0
<line-1>n = int(input())</line-1> <line-3> t = int(input())</line-3> <line-4> li = sorted(list(map(int , input().split())))</line-4> <line-5> ans = 1</line-5> <line-6> dp = [li[1]-li[0]] + [0] * (t-2) + [li[t-1] - li[t-2]]</line-6> <line-7> for i in range(1 , t-1) :</line-7> <line-9> print(max(dp))</line-9>
{"code": "<line-2>for i in range(n) :</line-2>\n<line-8> dp[i] = min(li[i] - li[i-1] , li[i+1] - li[i])</line-8>", "lines": [2, 8]} #### 0
<line-1>from sys import stdin, stdout</line-1> <line-3>n = int(stdin.readline())</line-3> <line-4>#l = list(map(int, stdin.readline().split()))</line-4> <line-5>#l = [int(stdin.readline()) for _ in range(n)]</line-5> <line-6>#a, b = map(int, stdin.readline().split())</line-6> <line-7>for _ in range(n):</line-7> <line-8...
{"code": "<line-2>from collections import Counter</line-2>\n<line-21> #print()</line-21>", "lines": [2, 21]} #### 0
<line-1>for i in range(int(input())):</line-1> <line-3> m=list(map(int,input().split()))[:n]</line-3> <line-4> m.sort()</line-4> <line-5> t=0</line-5> <line-6> for j in range(n//2):</line-6> <line-8> print(t)</line-8>
{"code": "<line-2> n=int(input())</line-2>\n<line-7> t+=abs(m[j]-m[n-j-1])</line-7>", "lines": [2, 7]} #### 0
<line-1>t = int(input())</line-1> <line-2></line-2> <line-4> k = int(input())</line-4> <line-5> count = 1</line-5> <line-6> for _ in range(k):</line-6> <line-7> output = []</line-7> <line-8> for index in range(1,k+1):</line-8> <line-9> output.append(bin(count).replace("0b", ""))</line-...
{"code": "<line-3>for _ in range(t):</line-3>\n<line-10> count += 1</line-10>", "lines": [3, 10]} #### 0
<line-1># cook your dish here</line-1> <line-3> # A temp_arr is created to store </line-3> <line-4> # sorted array in merge function </line-4> <line-5> temp_arr = [0]*n </line-5> <line-6> return _mergeSort(arr, temp_arr, 0, n-1) </line-6> <line-7> </line-7> <line-8># This Function will use MergeSort to cou...
{"code": "<line-2>def mergeSort(arr, n): </line-2>\n<line-94> a = list(map(int,input().split()))</line-94>", "lines": [2, 94]} #### 0
<line-1>for _ in range(int(input())):</line-1> <line-3> s = ''</line-3> <line-4> for i in range(1, n + 1): s += str(i)</line-4> <line-5> for i in range(n, 0, -1):</line-5> <line-6> if i % 2 == 0:</line-6> <line-7> for j in range(i, 0, -1): print(j, end = '')</line-7> <line-8> else:</line-8> <line-10> print()</line...
{"code": "<line-2> n = int(input())</line-2>\n<line-9> for j in range(1, i + 1): print(j, end = '')</line-9>", "lines": [2, 9]} #### 0
<line-1>def solve(l):</line-1> <line-3> if m == 0 or m == len(l) - 1:</line-3> <line-4> return 1</line-4> <line-5> return 1 + min(solve(l[0:m]), solve(l[m+1:]))</line-5> <line-6></line-6> <line-7>tc = int(input())</line-7> <line-8>for test in range(tc):</line-8> <line-9> n = int(input())</line-9> <line-11> ...
{"code": "<line-2> m = l.index(max(l))</line-2>\n<line-10> l = list(map(int, input().split()))</line-10>", "lines": [2, 10]} #### 0
<line-1>import fractions</line-1> <line-3> h,u,d = list(map(int,input().split()))</line-3> <line-4> g = fractions.gcd(u,d)</line-4> <line-5> if (h%g!=0):</line-5> <line-6> print(-1)</line-6> <line-7> else:</line-7> <line-8> m = 0</line-8> <line-9> n = 0</line-9> <line-10> while (True):</line-10> <line-11> n = (fl...
{"code": "<line-2>for t in range(int(input())):</line-2>\n<line-14> m+=1</line-14>", "lines": [2, 14]} #### 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, k = map(int, input().split())</line-5> <line-6> if k == 0:</line-6> <line-7> print(0, n)</line-7> <line-8> else:</line-8> <line-9> print(n//k, n%k)</line-9> <line-11> pass</line-11>
{"code": "<line-2>try:</line-2>\n<line-10>except:</line-10>", "lines": [2, 10]} #### 0
<line-1>for _ in range(int(input())):</line-1> <line-3> H=list(map(int,input().split()))</line-3> <line-4> jumps=0</line-4> <line-5> paracount=0</line-5> <line-6> for i in range(len(H)-1):</line-6> <line-7> if H[i+1]-H[i]<=U and H[i+1]>=H[i]:</line-7> <line-8> jumps+=1</line-8> <line-9> elif H[i]>=H[i+1] and H[i]-H...
{"code": "<line-2> N,U,D=list(map(int,input().split()))</line-2>\n<line-14> else: break</line-14>", "lines": [2, 14]} #### 0
<line-1>try:</line-1> <line-3> k=[[0 for i in range(S+1)] for i in range(n+1)]</line-3> <line-4> for i in range(n+1):</line-4> <line-5> for j in range(S+1):</line-5> <line-6> if(j==0):</line-6> <line-7> k[i][j]=1</line-7> <line-8> elif(i==0):</li...
{"code": "<line-2> def countsubsetsum(S,arr,n):</line-2>\n<line-23>except EOFError as e:</line-23>", "lines": [2, 23]} #### 0
<line-1>import sys</line-1> <line-3>parents = [int(x)-1 for x in input().split(' ')]</line-3> <line-4>values = list(map(int , input().split(' ')))</line-4> <line-5>parents = [0]+parents</line-5> <line-6># print(parents)</line-6> <line-7># print(values)</line-7> <line-8>def single_node_cost(i):</line-8> <line-9> cost = ...
{"code": "<line-2>n = eval(input())</line-2>\n<line-19>for i in range(n):</line-19>", "lines": [2, 19]} #### 0
<line-1>for i in range(int(input())):</line-1> <line-3> laddus=0</line-3> <line-4> for j in range(int(n)):</line-4> <line-5> t=input().split()</line-5> <line-6> if t[0]=='CONTEST_WON':</line-6> <line-7> if(int(t[1])<=20):</line-7> <line-8> laddus+=300+20-int(t[1])</line-8> <line-9> else:</line-9> <line-10> ...
{"code": "<line-2> n,k=input().split()</line-2>\n<line-19> else:</line-19>", "lines": [2, 19]} #### 0
<line-1>def posSearch(arr, num):</line-1> <line-3> r = len(arr)</line-3> <line-4> if num < arr[l]:</line-4> <line-5> return 0</line-5> <line-6> elif num > arr[r-1]:</line-6> <line-7> return r</line-7> <line-8> while l < r:</line-8> <line-9> m = (l+r)//2</line-9> <line-10> if arr[m] == num:</line-10> <line-11> ret...
{"code": "<line-2> l = 0</line-2>\n<line-26> j = posSearch(narr, a)</line-26>", "lines": [2, 26]} #### 0
<line-1>for _ in range(int(input())):</line-1> <line-3> a=[int(z) for z in input().split()]</line-3> <line-4> m=0</line-4> <line-5> a1=list(set(a))</line-5> <line-6> for i in range(len(a1)):</line-6> <line-7> if a.count(a1[i])>m:</line-7> <line-9> print(n-m)</line-9> <line-10> </line-10> <line-11> </line-11>
{"code": "<line-2> n=int(input())</line-2>\n<line-8> m=a.count(a1[i])</line-8>", "lines": [2, 8]} #### 0
<line-1>try:</line-1> <line-3> n=a[0]</line-3> <line-4> k=a[1]</line-4> <line-5> hi=[]</line-5> <line-6> for i in range(n):</line-6> <line-7> hi.append(int(input()))</line-7> <line-8> hi.sort()</line-8> <line-9> diff=[]</line-9> <line-10> for i in range(n-k+1):</line-10> <line-11> dif...
{"code": "<line-2> a=list(map(int,input().split()))</line-2>\n<line-13>except:</line-13>", "lines": [2, 13]} #### 0
<line-1># cook your dish here</line-1> <line-3></line-3> <line-4>for _ in range(testcases):</line-4> <line-5> (N,K)=list(map(int,input().split()))</line-5> <line-6> array=list(map(int,input().split()))</line-6> <line-7> </line-7> <line-8> max=array[0]</line-8> <line-9> min=array[0]</line-9> <line-10> ...
{"code": "<line-2>testcases=int(input())</line-2>\n<line-18> min=min-K</line-18>", "lines": [2, 18]} #### 0
<line-1>for _ in range(int(input())):</line-1> <line-3> if(a==b):</line-3> <line-4> print('YES')</line-4> <line-5> elif(c==d):</line-5> <line-6> print('NO')</line-6> <line-7> </line-7> <line-8> else:</line-8> <line-9> if(abs(a-b)%abs(c-d)==0):</line-9> <line-10> print('YES')<...
{"code": "<line-2> a,b,c,d=list(map(int,input().split()))</line-2>\n<line-11> else:</line-11>", "lines": [2, 11]} #### 0
<line-1>for _ in range(int(input())):</line-1> <line-3> if x>0:</line-3> <line-4> a=list(map(int,input().split()))</line-4> <line-5> if y>0:</line-5> <line-6> b=list(map(int,input().split()))</line-6> <line-7> if x>0 and y>0:</line-7> <line-8> a=a+b</line-8> <line-9> c=n-len(list(set(a)))</line-9> <line-10> else:</...
{"code": "<line-2> n,r,x,y=map(int,input().split())</line-2>\n<line-13> x=min(c,r)</line-13>", "lines": [2, 13]} #### 0
<line-1># cook your dish here</line-1> <line-3>stringa=list(map(int,input().split()))</line-3> <line-4>counter=0</line-4> <line-5>counter1=0</line-5> <line-6>counter3=0</line-6> <line-7>somma1=0</line-7> <line-8>somma2=0</line-8> <line-9>massimo=0</line-9> <line-10>massimo1=0</line-10> <line-11>massimo3=0 </line-11> <l...
{"code": "<line-2>n=int(input())</line-2>\n<line-51> counter-=1</line-51>", "lines": [2, 51]} #### 0
<line-1># cook your dish here</line-1> <line-3> for _ in range(int(input())):</line-3> <line-4> n = int(input())</line-4> <line-5> li = [i for i in input()]</line-5> <line-6> a = 0</line-6> <line-7> while a+1<len(li):</line-7> <line-8> li[a],li[a+1] = li[a+1],li[a]</line-8> <line-9> a+=2</line-9> <line-10> li2...
{"code": "<line-2>try:</line-2>\n<line-22>except:</line-22>", "lines": [2, 22]} #### 0
<line-1>for i in range(int(input())):</line-1> <line-3> if(n<=2 or n>1000000007):</line-3> <line-4> print("0")</line-4> <line-5> else:</line-5> <line-6> prod=1</line-6> <line-7> for i in range(2,n):</line-7> <line-8> prod*=i</line-8> <line-9> if(prod>1000000007):</line-9> <line-11> print(((prod)*(n*prod-2))%100...
{"code": "<line-2> n=int(input())</line-2>\n<line-10> prod=prod%1000000007</line-10>", "lines": [2, 10]} #### 0
<line-1>def for1(M,k):</line-1> <line-3> x = k*k+0.0</line-3> <line-4> z=x</line-4> <line-5> for m in range(1,M):</line-5> <line-6> ret+=(M-m)/x</line-6> <line-7> x*=z</line-7> <line-8> return ret </line-8> <line-9> </line-9> <line-10>def for2(M,k):</line-10> <line-11> ret = 0.0</line-11> <line-12> x = k+0.0</line-1...
{"code": "<line-2> ret = 0.0</line-2>\n<line-22>M,N,K = list(map(int,input().split()))</line-22>", "lines": [2, 22]} #### 0
<line-1>for t in range(int(input())):</line-1> <line-3> ans = 0</line-3> <line-4> while n>0:</line-4> <line-5> ans+=b</line-5> <line-6> half = (n+1)/2 if n%2 else n/2</line-6> <line-7> ans+=m*half</line-7> <line-8> m*=2</line-8> <line-10> print(ans-b)</line-10> <line-11> </line-11>
{"code": "<line-2> n,b,m = list(map(int,input().split()))</line-2>\n<line-9> n=n-half</line-9>", "lines": [2, 9]} #### 0
<line-1>t=eval(input())</line-1> <line-3> l=eval(input())</line-3> <line-4> a=input().split()</line-4> <line-5> a=[int(x) for x in a]</line-5> <line-6> a=sorted(a)</line-6> <line-7> for i in range(l-1):</line-7> <line-9> print(min(a[0:l-1]))</line-9>
{"code": "<line-2>for q in range(t):</line-2>\n<line-8> a[i]=(a[i+1]-a[i]) </line-8>", "lines": [2, 8]} #### 0
<line-1># cook your code here</line-1> <line-3>x=len(n)</line-3> <line-4>no=list(map(int,n))</line-4> <line-5>temp=[0]*x</line-5> <line-6>if (x>2):</line-6> <line-7> sum=99</line-7> <line-8> for i in range(3,x):</line-8> <line-9> sum=sum+90</line-9> <line-10> sum=sum+10*(int(n[0])-1)</line-10> <line-11> sum=sum+int(n[...
{"code": "<line-2>n=input()</line-2>\n<line-28>else:</line-28>", "lines": [2, 28]} #### 0
<line-1>import sys</line-1> <line-2></line-2> <line-4>s = sys.stdin.readline().strip()</line-4> <line-5></line-5> <line-6>alph = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"</line-6> <line-7></line-7> <line-8>arr = [0]*26</line-8> <line-9>pref = []</line-9> <line-10></line-10> <line-11>for i in range(len(s)):</line-11> <line-12> for j...
{"code": "<line-3>n = int(sys.stdin.readline().strip())</line-3>\n<line-56>\tprint(ans)</line-56>", "lines": [3, 56]} #### 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> counter = 0</line-5> <line-6> even = 0</line-6> <line-7> for num in l:</line-7> <line-8> if num % 2 == 0:</line-8> <line-9> even += 1 </line-9> <line-10> if num % 2 == 1:</line-10> <li...
{"code": "<line-2>for i in range(t):</line-2>\n<line-11> counter += even</line-11>", "lines": [2, 11]} #### 0
<line-1># coding: utf-8</line-1> <line-3></line-3> <line-4>n=int(input())</line-4> <line-5>a=[]</line-5> <line-6>for i in range(n):</line-6> <line-7> x=int(input())</line-7> <line-8> a.append(x)</line-8> <line-9> </line-9> <line-10># print(a)</line-10> <line-11>ans=0</line-11> <line-12>m=[1]*n</line-12> <line-...
{"code": "<line-2># Your code here!</line-2>\n<line-16> m[i]=max(m[i],m[j]+1)</line-16>", "lines": [2, 16]} #### 0