Shuu12121/coir_hard_negative_datasets_v2 · Data Studio

You have three piles of candies: red, green and blue candies: the first pile contains only red candies and there are $r$ candies in it, the second pile contains only green candies and there are $g$ candies in it, the third pile contains only blue candies and there are $b$ candies in it. Each day Tanya eats exactly...

n = int(input()) for _ in range(n): a, b, c = list(map(int, input().split())) print(min((a+b+c)//2, a+b, a+c, b+c))

0.662579

from bisect import bisect_left as bl from bisect import bisect_right as br import heapq import math from collections import * from functools import reduce,cmp_to_key import sys input = sys.stdin.readline M = mod = 10**9 + 7 def factors(n):return sorted(set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5)...

0.74362

t=int(input()) for nt in range(t): a,b,c=map(int,input().split()) print (max(0,abs(a-b)+abs(b-c)+abs(a-c)-4))

0.738324

import sys test_cases = int(input()) for i in range(0,test_cases): count = input().split() #print count count_r = int(count[0]) count_g = int(count[1]) count_b = int(count[2]) k = int(input()) if k is 1: total = 1 else: total = 1 if count_r < k: total = total + count_r else: total = total + (k-...

0.718622

def eq_solve(v0, v1, u0, u1): den = u0 - v0 num = u1 - v1 if den != 0: return num / den return 1 def solve(p, q, r, a, b, c, rs): if p == a and q == b and r == c: return rs if rs >= 2: return 3 res = 3 adds = [a - p, b - q, c - r] muls = [] ...

0.711565

N=100001 fac=[0 for i in range(N)] for i in range(1,N): for j in range(i,N,i): fac[j]+=1 def gcd(a,b): if a<b: a,b=b,a while b>0: a,b=b,a%b return a def ctt(A,B,C): la=fac[A] lb=fac[B] lc=fac[C] ab=gcd(A,B) ac=gcd(A,C) bc=gcd(B,C) a...

0.709457

t = int(input()) while(t>0): t-=1; n,l,r = list(map(int,input().split())); a = bin(l)[2:]; b = bin(r)[2:]; # find matching z = 0; l = min(len(a),len(b)); for i in range(l): if a[i]==b[i]: z+=1; else: break; #find base string a = a[z:] b = b[z:] if(len(a)==0 and len(b)==0): print(n); else : m...

0.703906

t = int(input()) for _ in range(t): a, b, c = map(int, input().split()) print(a+b+c-1)

0.698317

import sys def main(): #n = iinput() #k = iinput() #m = iinput() #n = int(sys.stdin.readline().strip()) #n, k = rinput() #n, m = rinput() #m, k = rinput() #n, k, m = rinput() #n, m, k = rinput() #k, n, m = rinput() #k, m, n = rinput() #m, k, n = rinput() #m,...

0.69688

# Contest: Codeforces Round #593 (Div. 2) (https://codeforces.com/contest/1236) # Problem: A: Stones (https://codeforces.com/contest/1236/problem/A) def rint(): return int(input()) def rints(): return list(map(int, input().split())) t = rint() for _ in range(t): a, b, c, = rints() mx = 0 for ta...

0.694756

import math def csb(n): count = 0 while (n): n &= (n-1) count+= 1 return count def f(ca,cb,i,cf,C,n,dp): if ca<0 or cb<0: return 0 if i==n: if ca==0 and cb==0 and cf==0: return 1 return 0 st=str(ca)+" "+str(cb)+" "+str(cf)+" "+str(i) if dp.get(st)!=None: return dp[st] x=0 if (C&(1<<i))>0:...

0.688419

from sys import stdin input = stdin.readline q = int(input()) for _ in range(q): a,b,n = map(int,input().split()) kroki = 0 while max(a,b) <= n: if a > b: a,b = b,a a = a+b kroki += 1 print(kroki)

0.68576

import sys import math import heapq def half(n): return n//2 def main(arr,m): a,b,c=arr while m!=0: s=max(a,b,c) if s==a: a=half(a) elif s==b: b=half(b) else: c=half(c) m-=1 return max(a,b,c) for i in range(int(input())): r,g,b,m=list(map(int,input().split())) arr=[] ...

0.681683

for t in range(int(input())): l1=list(map(int,input().split())) l2=list(map(int,input().split())) l3=list(map(int,input().split())) max=0 g=l1[0]+l2[0]+l3[0] y=l1[1]+l2[1]+l3[1] r=l1[2]+l2[2]+l3[2] if g%2==0: g-=1 if y%2==0: y-=1 if r%2==0: r-=1 if max<g: max=g if max<r: max=r i...

0.680892

for _ in range(int(input())): a,b,c = list(map(int, input().split())) x,y,z = list(map(int, input().split())) temp = min(c,y) ans = 2*temp c -= temp y -= temp temp = min(c,z) c -= temp z -= temp temp = min(c,x) c -= temp x -= temp temp = min(a,z) a -= temp z...

0.676368

import sys n = int(sys.stdin.readline()) for _ in range(n): p1, p2, m = list(map(int, sys.stdin.readline().split())) l = min(p1, p2) #while(m > 0 and l > 0): # k = min(l, m) # l -= k # m -= 1 q = min(p1, p2) d = min((m * (m + 1)) / 2, q) print(p1 - d + p2 - d)

0.673815

mii = 3*10**4 factors = [set() for _ in range(mii + 1)] factors[1] = set([1]) for k in range(2, mii + 1): for p in range(2, mii + 1): if k % p == 0: factors[k] = set(ole*p for ole in factors[k//p]) | factors[k//p] break elif p * p > k: factors[k] = set([1, k]) ...

0.671322

import sys input = sys.stdin.readline T = int(input()) for _ in range(T): h, c, t = list(map(int, input().split())) if h + c >= 2 * t: print(2) else: diff2 = 2*t - (h + c) hDiff2 = 2*h - (h + c) kDown = (hDiff2//diff2 - 1)//2 kUp = kDown + 1 diffDown = abs(d...

0.670357

# cook your dish here import math; from math import gcd,sqrt,floor,factorial,ceil from bisect import bisect_left,bisect_right import bisect; import sys; from sys import stdin,stdout import os sys.setrecursionlimit(pow(10,7)) import collections from collections import defaultdict,Counter from statistics import median # ...

0.66779

import sys readline = sys.stdin.readline readlines = sys.stdin.readlines ns = lambda: readline().rstrip() ni = lambda: int(readline().rstrip()) nm = lambda: map(int, readline().split()) nl = lambda: list(map(int, readline().split())) prn = lambda x: print(*x, sep='\n') def gcd(a, b): while b: a, b = b, a%...

0.66619

from itertools import permutations def find_mult_3(num): num_list = tuple(map(int, str(num))) poss = set() for i in range(1, len(num_list)+1): poss |= set(permutations(num_list, i)) res = set() for p in poss: if p[0] != 0 and sum(p) % 3 == 0: res.add(p) re...

0.659634

# cook your dish here import math def swap(a,b): return b,a t = int(input()) while(t!=0): z = list(map(int,input().strip().split(" "))) x=z[0] r=z[1] a=z[2] b=z[3] #p = math.pi peri = 2*r tp = x*peri if(a<b): a,b=swap(a,b) t1 = tp/a d2 = t1* b dd = abs(tp-d2) if(dd%peri==0): print(int(dd//peri)-1...

0.658976

import math def fun(num1,num2): if num1>num2: a=num1 b=num2 else: a=num2 b=num1 rem=a%b while(rem!=0): a=b b=rem rem=a%b gcd=b return (int((num1*num2)/gcd)) for _ in range (int(input())): hours=int(input())*24 x,y,z=list(map(int,input().split())) lcm=x lcm=fun(x,y) lcm=fun(lcm,z) print(int(...

0.658657

t = int(input()) for _ in range(t): a, b = list(map(int, input().split())) print(min((a+b)//3,a,b))

0.65639

for _ in range(int(input())): a,o,g=map(int,input().split()) while g>0: if a<o: a+=1 g-=1 elif o<a: o+=1 g-=1 else: break print(abs(a-o))

0.653206

t=int(input()) for i in range(t): n,w1,w2,w3=map(int,input().split()) if n>=w1+w2+w3: print(1) elif n>=w1+w2 or n>=w2+w3: print(2) else: print(3)

0.646824

# cook your dish here for t in range(int(input())): a,b,c=map(int,input().split()) p=(c//a)*a+b if p<=c: print(p) else: print(((c//a)-1)*a+b)

0.6465

import sys input = sys.stdin.readline def solve(ax,ay,bx,by,cx,cy): x = ax+bx+cx y = ay+by+cy x -= x//3+1 y -= y//3+1 if x==y: return x if 0 <= x <= 1 else abs(x)+1 else: return max(abs(x), abs(y)) T = int(input()) for _ in range(T): ax,ay,bx,by,cx,cy = map(int,input().spli...

0.645296

s=input().split() for i in range(3): s[i]=int(s[i]) s.sort() ans=s[0]//3 +s[1]//3 +s[2]//3 x=s[0]%3 y=s[1]%3 z=s[2]%3 if(x==0 and y==z==2 and s[0]!=0): ans+=1 if(y==0 and x==z==2 and s[1]!=0): ans+=1 if(z==0 and y==x==2 and s[2]!=0): ans+=1 ans+=min(x,y,z) print(ans)

0.639951

T = int(input()) for t in range(T): a, b, n = [int(i) for i in input().split()] if n%3 == 2: print(a^b) elif n%3 == 1: print(b) else: print(a)

0.635794

from bisect import * d = [{}, {}] i = [0, 0] for q in range(int(input())): a, t, x = map(int, input().split()) for k in [0, 1]: d[k][x] = d[k].get(x, []) i[k] = bisect(d[k][x], t) if a < 3: d[-a][x].insert(i[-a], t) else: print(i[1] - i[0])

0.634793

import sys import random from fractions import Fraction from math import * def input(): return sys.stdin.readline().strip() def iinput(): return int(input()) def finput(): return float(input()) def tinput(): return input().split() def linput(): return list(input()) def rinput(): return ...

0.631543

for TT in range(1, int(input()) + 1): a, b, c = map(int, input().split()) l = max(-1, (b + c - a) // 2) r = c print(r - l if r >= l else 0)

0.631256

a = [] b = [] for i in range(3): t = input().split() a.append([int(t[0]), int(t[1]), int(t[2]) ] ) b.append([1, 1, 1]) def add(i, j, w): if 2>=i>=0 and 2>=j>=0: b[i][j] += w for i in range(3): for j in range(3): add(i, j, a[i][j]) add(i-1, j, a[i][j]...

0.631038

# cook your dish here try: for i in range(int(input())): n=int(input()) l=[int(j) for j in input().split()][:n] d={} for j in l: d[j]=d.get(j,0)+1 a=len(d) c=0 for j in list(d.keys()): while(d[j]>=3): d[j]=(d[j]//3)+(d[j]%3) if(d[j]==2): c=c+1 if(c&1): s=0 for j in list(d.values(...

0.628155

# cook your dish here for _ in range(int(input())): a,b,c=list(map(int, input().split())) p=a*100+b mx=p ans, cnt = 0, 0 while True: cnt+=1 if p<c or cnt==10000: break else: p-=c a=p//100 b=p%100 ...

0.624953

for i in range(int(input())): a,b,c=map(int,input().split()) x,y=map(int,input().split()) ans=0 if x>y: ans=ans+x*min(a//2,b) a=(a-2*min(a//2,b)) ans=ans+y*min(a//2,c) else : ans=ans+y*min(a//2,c) a=(a-2*min(a//2,c)) ans=ans+x*min(a//2,b) print(ans...

0.618887

import sys import random from fractions import Fraction from math import * def input(): return sys.stdin.readline().strip() def iinput(): return int(input()) def finput(): return float(input()) def tinput(): return input().split() def linput(): return list(input()) def rinput(): return ...

0.617772

import numpy as np N=10**6+1 t=eval(input()) inp = () t1=ord('z') #bag=[[0 for _ in xrange(t1)] for _ in xrange(N+1)] bag=np.zeros((N+1,t1),dtype=np.int) #print bag while t: t-=1 inp=input().split() t2=ord(inp[3]) - ord('a') t3=int(inp[1]) t4=int(inp[2]) + 1 if inp[0]=="1": #print "enter" bag[t3][t2]+=int(...

0.616967

w, r = open('output.txt', 'w'), open('input.txt', 'r') s, y = [0] * 466, [0, 100, 131, 159, 190, 220, 251, 281, 312, 343, 373, 404, 434] for i in range(int(r.readline())): m, d, p, t = map(int, r.readline().split()) x = y[m] + d s[x] -= p s[x - t] += p for i in range(465): s[i + 1] += s[i] w.write(s...

0.616552

# cook your dish here """ Input: The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. The first line of each test case contains three space-separated integers p, q and r. The second line contains three space-separated integers a, b and c. Ou...

0.615942

for i in range(int(input())): n=int(input()) l1=list(map(int,input().split())) type1=0 type2=0 ans=0 for item in l1: if item%3==0: ans+=1 elif item%3==1: type1+=1 else : type2+=1 x=min(type1,type2) ans+=x type1-=x type2-...

0.615709

import sys import math def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def MI(): return map(int, sys.stdin.readline().split()) def SI(): return sys.stdin.readline().strip() t = II() for q in range(t): a,b,c,d = MI() print(max(a+b,c+d))

0.615617

t=int(input()) count=[] for i in range(t) : s = input() a,b,c,n = s.split() n=int(n) d = int(a+b*n+c,2) count.append(0) while(d>0) : d=(d&(d+1))-1 count[i]+=1 for i in range(t) : print(count[i])

0.612638

# !/bin/env python3 # coding: UTF-8 # ✪ H4WK3yE乡 # Mohd. Farhan Tahir # Indian Institute Of Information Technology and Management,Gwalior # Question Link # https://codeforces.com/problemset/problem/392/B # # ///==========Libraries, Constants and Functions=============/// import sys inf = float("inf") mod = 10000...

0.61218

import sys readline = sys.stdin.readline read = sys.stdin.read ns = lambda: readline().rstrip() ni = lambda: int(readline().rstrip()) nm = lambda: map(int, readline().split()) nl = lambda: list(map(int, readline().split())) prn = lambda x: print(*x, sep='\n') def solve(): a, b, c, d = nm() if a <= b: ...

0.609636

t=int(input()) while(t): n=int(input()) l=[] for i in range(n): l.append(list(map(int,input().split()))); m=[] for i in l: m.append((i[1]//(i[0]+1))*i[2]) res=max(m) print(res) t=t-1

0.60793

import sys import math from collections import defaultdict from itertools import combinations from itertools import permutations input = lambda : sys.stdin.readline().rstrip() read = lambda : map(int, input().split()) def write(*args, sep="\n"): for i in args: sys.stdout.write("{}".format(i) + sep) INF = float('i...

0.607899

# cook your dish here for _ in range(int(input())): d=dict() ls=[] for i in range(int(input())): ls=list(map(int,input().split())) if ls[0] in d: d[ls[0]]=max(ls[1],d[ls[0]]) else: d[ls[0]]=ls[1] # print(d) if len(d)<3: print(0) else: kd=list(d.values()) kd.sort() # print(kd) print(kd[-1]+kd...

0.607739

q = int(input()) for i in range(q): n, a, b = list(map(int, input().split())) if n % 2 == 0: print(min(n * a, n // 2 * b)) else: print(min(n * a, (n // 2) * b + a))

0.607348

def gcd(a,b): if b==0:return a else:return gcd(b,a%b) def lcm(a,b): m=a*b g=gcd(a,b) return int(m/g) for _ in range(int(input())): x,y=[int(x) for x in input().split()] l=lcm(x,y) s=int(l/x) t=int(l/y) print(s+t-2)

0.606456

from collections import * import sys try: inp = raw_input except: inp = input def err(s): sys.stderr.write('{}\n'.format(s)) def ni(): return int(inp()) def nl(): return [int(_) for _ in inp().split()] def solve(): n, L, R = nl() L -= 1 R -= 1 SM = 0 out = [] for i in range(1, n)...

0.605554

T=int(input()) # cook your dish here for i in range(T): n=list(map(int,input().split())) a=n[0] b=n[1] c=n[2] l=[] A=list(map(int,input().split())) B=list(map(int,input().split())) C=list(map(int,input().split())) for i in range(b): for j in range(a): for k in ra...

0.604983

# import all important libraries and inbuilt functions from fractions import Fraction import numpy as np import sys,bisect,copyreg,copy,statistics,os from math import * from collections import Counter,defaultdict,deque,OrderedDict from itertools import combinations,permutations,accumulate from numpy.linalg import ...

0.604467

from sys import * input=stdin.readline for u in range(int(input())): s=int(input()) if(s%3==0): print(1) else: print(0)

0.601955

import math from decimal import Decimal import heapq from collections import deque def na(): n = int(input()) b = [int(x) for x in input().split()] return n,b def nab(): n = int(input()) b = [int(x) for x in input().split()] c = [int(x) for x in input().split()] return n,b,c def dv(): n, m = list(map(in...

0.601767

r, g, b = map(int, input().split()) maxi = (r + g + b) // 3 print(min(maxi, r + g, r + b, g + b))

0.601731

import sys n = 500001 sqrt = int(0.75 * n**0.5) data = [0]*(n) ans = [[]] out = [] for i in range(1, sqrt): ans.append([0]*i) j = int(sys.stdin.readline()) qus = sys.stdin.readlines() for qu in qus: q = [int(i) for i in qu.split()] if q[0] == 1: x = q[1] y = q[2] data[x] += y ...

0.600317

for t in range(int(input())): n = int(input()) mx = -1 for i in range(n): h, m, s = list(map(int,input().split(":"))) h %= 12 m %= 60 s %= 60 ha = h*30 + m*0.5 + s*0.5/60 ma = m*6 + s*0.1 sa = s*6 hm1 = abs(ha - ma) hm2 = 360 - hm1 hm3 = abs(hm1 - hm2) hm = min(hm1, hm2, hm3) ms1 = abs(...

0.598574

t = int(input()) for _ in range(t): x,y = map(int,input().split()) a,b = map(int,input().split()) wynik = 0 if b <= 2*a: c = min(x,y) wynik += b*c wynik += (max(x,y)-c)*a else: wynik = a*(x+y) print(wynik)

0.597179

t = int(input()) for _ in range(t): n,x,y = map(int,input().split()) s = x+y mx = min(s-1,n) if s<=n: mn = 1 else: mn = min(s,s-n+1,n) print(mn,mx)

0.59674

for i in range(int(input())): n,g,b=map(int,input().split()) nn=(n+1)//2 print(max(nn+(nn-1)//g*b,n))

0.594973

#Note that it's python3 Code. Here, we are using input() instead of raw_input(). #You can check on your local machine the version of python by typing "python --version" in the terminal. #Read the number of test cases. T = int(input()) for tc in range(T): # Read integers a and b. (a, b) = list(map(int, input().split(...

0.594562

import sys def countR(ip): c=0 for i in ip: if(i=='R'): c+=1 return c def countB(ip): c=0 for i in ip: if(i=='B'): c+=1 return c def countG(ip): c=0 for i in ip: if(i=='G'): c+=1 return c # sys.stdin.readline() t=i...

0.593973

for zz in range(int(input())): n = int(input()) ans = 0 while n > 1: ans += 1 cr = 2 while n >= cr: n -= cr cr += 3 print(ans)

0.59222

from math import sqrt, log2 from sys import stdin from bisect import bisect import time def all_primes(n): res = [] for i in range(1, n+1): prime = True for j in range(2, min(int(sqrt(i))+2, i)): if i % j == 0: prime = False break if prime: re...

0.591786

from functools import lru_cache @lru_cache(maxsize=None) def three_details(n): if n <= 3: return n==3 q, r = divmod(n, 2) return three_details(q) + three_details(q+r)

0.591141

# Enter your code here. Read input from STDIN. Print output to STDOUT a=int(input()) b=int(input()) print((a+b)) print((a-b)) print((a*b))

0.590728

n=int(input()) l=[] count=0 while n: n-=1 a,b,c=sorted(map(int,input().split())) if (a,b,c) in l: count-=1 else: l.append((a,b,c)) count+=1 print(count)

0.590683

d=1000000007 for _ in range(int(input())): l=sorted(list(map(int,input().split()))) ans=(l[0]%d)*((l[1]-1)%d)*((l[2]-2)%d) print(ans%d)

0.588713

# cook your dish here #Moony and ICPC team T = int(input()) for i in range(T): N,data = int(input()),list(map(int,input().split())) if(N==3): print(sum(data)) else: best = data[0]+data[1]+data[2] overall = best k=len(data) for i in range(1,k-2): ...

0.588701

# cook your dish here # Author: Dancing Monkey | Created: 09.DEC.2018 import bisect for _ in range(int(input())): n = int(input()) x1 , x2, x3 = [], [], [] for i in range(n): x, y = list(map(int, input().split())) if x == 1: x1.append(y) if x == 2: x2.append(y) if x == 3: x3.append(y) x1.sort() x2.sort...

0.587706

from sys import stdin from fractions import Fraction input = stdin.readline for _ in range(int(input())): a, b, n = list(map(int, input().split())) ab = Fraction(a, b) p = set() for i in range(1, n+1): for j in range(n, 0, -1): x = Fraction(i, j) if x > ab: ...

0.587597

from math import sqrt test = int(input()) for i in range(test): sum = 0 max = int(input()) if max==1: sum = 0 elif max==2: sum += 2 else: sum = sum + 2 for x in range(3,max+1): half = int(sqrt(x)) + 1 if all(x%y!=0 for y in range(2,half)): sum = sum + x print(sum)

0.586814

#=============================================================================================== #importing some useful libraries. from fractions import Fraction import sys import os from io import BytesIO, IOBase from functools import cmp_to_key # from itertools import * from heapq import * from math import gcd,...

0.586038

try: t=int(input()) for a in range(t): l=input().split() n=int(l[0]) m=int(l[1]) d={} s=0 for b in range(m): l1=input().split() i=int(l1[0]) j=int(l1[1]) k=int(l1[2]) for c in range(i,j+1): if c not in d: d[c]=10 for c in range(i,j+1): d[c]=d[c]*k for i in d: s=s+d[i] ...

0.585014

import sys input = sys.stdin.readline t = int(input()) for _ in range(t): n = int(input()) s = input().strip() lengths = [] curr = s[0] currLen = 0 for c in s: if c == curr: currLen += 1 else: lengths.append(currLen) currLen = 1 c...

0.584145

import sys input = sys.stdin.readline from collections import Counter t=int(input()) for testcases in range(t): n=int(input()) P=list(map(int,input().split())) C=Counter(P) PLIST=sorted(set(P),reverse=True) g=C[PLIST[0]] s=0 b=0 sflag=1 for i in PLIST[1:]: if sflag: ...

0.581916

T = int(input()) for t in range(T): N, R = list(map(int, input().split())) print(1 + (R - sum(map(int, input().split()))) % N)

0.581801

import sys t = int(sys.stdin.readline()) for _ in range(t): n = int(sys.stdin.readline()) intervals = [None]*n for i in range(n): intervals[i] = tuple([int(a) for a in sys.stdin.readline().split()]) intervals = list(zip(intervals, list(range(n)))) starts = sorted(intervals, key = lambda x:...

0.581098

from sys import * T = int(stdin.readline()) t = [int(s) for s in stdin.readline().split(' ')] a = [] for i in range(T - 1, -1, -1): if i % 2 == 0: a += [(e[0], -e[1]) for e in a] a = [(e[0] - t[i], e[1]) for e in a] a += [(- x - 1, 0) for x in range(t[i])] a = list(set(a)) if...

0.579916

import sys def binpow(a, n, p): res = 1 while n > 0: if n % 2 == 1: res = (res * a) % p a = (a * a) % p n >>= 1 return res def main(): result = [] t = int(sys.stdin.readline()) for line in sys.stdin.readlines(): p, q, b = list(map(int, line.spli...

0.579283

# cook your dish here tc=int(input()) for j in range(tc): ip=list(map(int,input().rstrip().split())) x=ip[0] y=ip[1] n=ip[2] cnt=0 if(x==y): print('0') continue ln=bin(x).replace("0b", "") rn=bin(y).replace("0b", "") ll=len(ln) rl=len(rn) #print(ln) #print(rn) if(ll==len(rn)): for i in range(ll): ...

0.578902

def gcd(a,b): return a if b==0 else gcd(b, a%b) for T in range(int(input())): de=int(input()) g=gcd(de, 180) if int(de/g)==int(180/g)-1: print(int(180/g)*2) else: print(int(180/g))

0.576646

from sys import stdin, stdout input, print = stdin.readline, stdout.write n = int(input()) r, g, b = [], [], [] ans = 0 for i in range(n): x, t = [i for i in input().split()] x = int(x) if t == 'P': g.append(x) elif t == 'R': r.append(x) else: b.append(x) if len(g) =...

0.57643

for i in range(int(input())): n=int(input()) s=0 for i in range(n): a,b,c=map(int,input().split()) d=(c/100)*a e=a+d f=e-((c/100)*e) g=a-f h=b*g s=s+h print(s)

0.576314

# cook your dish here MOD = 998244353 fball = [ [0]*101 for _ in range(101) ] cric = [ [0]*101 for _ in range(101) ] def calSNum(n, r): if n == r or r == 1: fball[r][n] = 1 return if n > 0 and r > 0 and n > r: fball[r][n] = (fball[r-1][n-1]%MOD + (r*fball[r][n-1])%MOD )%MOD return fball[r][n] = 0 d...

0.576001

# cook your dish here import sys mod_val = 1000000007 rang = [0]*101 pow_cache = [0]*102 multisets = {} def mod_pow(base, pow): result = 1 while pow: if pow&1: result = (result*base) % mod_val base = (base*base) % mod_val pow = pow>>1 return result def precalculate(): for i in range(1, 102): pow_ca...

0.575956

t = eval(input()) def moneda(m): h = 1 triange = [] while m >= h: triange.append(h) m -= h h += 1 return len(triange) triangulo = [] for i in range(t): n = eval(input()) triangulo.append(n) for i in triangulo: print(moneda(i))

0.575946

# cook your dish here for j in range(int(input())): p,q,r,s =map(int,input().split()) x=(s-p) y=(s-q) z=(s-r) print(y,z,x)

0.575541

from sys import stdin,stdout import sys import math t=int(stdin.readline()) for i in range(t): a=list(map(int,stdin.readline().split())) print(sum(a)//2)

0.575145

# Problem: http://www.codechef.com/JULY09/submit/CUBESUM/ # Author: Susam Pal def computeA(): X, Y, Z = [int(x) for x in input().split()] B = [] for x in range(X): B.append([]) for y in range(Y): B[-1].append([int(t) for t in input().split()]) for z in range(Z): result = B[x][y][z] if x: res...

0.574855

# cook your dish here while True: try: n=int(input()) lis=[] for i in range(n): k=list(map(int,input().split())) k.append(k[1]+k[2]) lis.append(k) #print(lis) p=sorted(lis,key=lambda x:x[3],reverse=True) #print(p) m...

0.574295

from fractions import Fraction import bisect import os from collections import Counter import bisect from collections import defaultdict import math import random import heapq as hq from math import sqrt import sys from functools import reduce, cmp_to_key from collections import deque import threading from itertools im...

0.573919

def solve(): n = int(input()) if n % 3 == 0: print(n//3,0,0) return 0 if n % 3 == 1: if n < 7: print(-1) else: print((n-7)//3, 0, 1) return 0 if n < 5: print(-1) return 0 print((n-5)//3, 1, 0) for i in range(int(input())...

0.573283

#! /usr/bin/env python # http://codeforces.com/problemset/problem/818/F # Problem name ::: F. Level Generation # submission number #212055293 #508427854 def newest_approach(n): from math import floor, ceil, sqrt quad_solv = sqrt(2*n+1/4)-1/2 x = floor(quad_solv) y = ceil(quad_solv) xed = int(x...

0.571898

r, s, p = list(map(int, input().split())) dp = [[[0] * (p+1) for _ in range(s+1)] for _ in range(r+1)] dp[r][s][p] = 1 def nCk(n, k): if n <= k: return 1 res = 1 for i in range(k): res *= n-i for i in range(k): res //= (i+1) return res C = [nCk(i, 2) for i in range(r+s+p+1)]...

0.571445

d1, d2, d3 = map(int, input().split()) D1 = 2*d1 + 2*d2 D2 = d1 + d3 + d2 D3 = (d1 + d3) * 2 D4 = (d2 + d3) * 2 print(min(D1, D2, D3, D4))

0.571412

# cook your dish here extra, less = 0,0 for _ in range(int(input())): sli,mem,sma,luc = list(map(int, input().split())) total = sma t = sma while mem > 1: t *= luc total += t mem -= 1 if total <= sli: extra += sli-total print('POSSIBLE',sli-total) else: ...

0.570494

# cook your dish here t=int(input()) MOD=1000000007 def mod(n, m=MOD): n%=m while n<0: n+=m return n def power(n, p): res=1 while p: if p%2: res=mod(res*n) p//=2 n=mod(n*n) return res while t: ma=input().split() x=int(ma[0]) y=int(ma[1]) s=int(ma[2]) ma=input().split() u=int(ma[0]) v=int(ma[1]) if...

0.569469

import sys def main(): mx = 1 n = int(input()) D = {} D["polycarp"] = 1 for i in range(n): s, r, t = input().split() s = s.lower() t = t.lower() D[s] = D[t] + 1 mx = max(mx, D[s]) print(mx) main()

0.569461

Polycarp lives on the coordinate axis $Ox$ and travels from the point $x=a$ to $x=b$. It moves uniformly rectilinearly at a speed of one unit of distance per minute. On the axis $Ox$ at the point $x=c$ the base station of the mobile operator is placed. It is known that the radius of its coverage is $r$. Thus, if Polyc...

import os from io import BytesIO # input = BytesIO(os.read(0, os.fstat(0).st_size)).readline for i in range(int(input())): a, b, c, r = list(map(int, input().split())) a, b = min(a, b), max(a, b) left = max(c - r, a) right = min(c + r, b) if right >= a and left <= right: print(b - a - (righ...

0.823004

# cook your dish here import math def swap(a,b): return b,a t = int(input()) while(t!=0): z = list(map(int,input().strip().split(" "))) x=z[0] r=z[1] a=z[2] b=z[3] #p = math.pi peri = 2*r tp = x*peri if(a<b): a,b=swap(a,b) t1 = tp/a d2 = t1* b dd = abs(tp-d2) if(dd%peri==0): print(int(dd//peri)-1...

0.711864

t=int(input()) for nt in range(t): a,b,c=map(int,input().split()) print (max(0,abs(a-b)+abs(b-c)+abs(a-c)-4))

0.705178

# cook your dish here epi=10**-2 def vision(t): a1=x0+(dx*t)-x1 a2=y0+(dy*t)-y1 a3=z0+(dz*t)-z1 b=4*((a1*d1)+(a2*d2)+(a3*d3))*((a1*d1)+(a2*d2)+(a3*d3)) a=4*((a1*a1)+(a2*a2)+(a3*a3)) value=(b-(a*c)) return value xrange=range for _ in range(int(input())): x1,y1,z1,x0,y0,z0,dx,dy,dz,cx,cy,cz,r=list(map(int,input()...

0.70467

T=eval(input()) for i in range(T): a,b,c,d=list(map(int,input().split())) x=c-a n1=b-a+1 n2=d-c+1 s=0 if x<=0: t=n2-abs(x)-1 for j in range(t,max(0,d-b-1),-1): s=s+j if x>0: t=n2 for j in range(x,max(0,c-b-1),-1): s=s+t if (c-b)<=0: for j in range(t-1,max(0,d-b-1),-1): s=s+j print(s) ...

0.695347

import sys input = sys.stdin.readline def solve(ax,ay,bx,by,cx,cy): x = ax+bx+cx y = ay+by+cy x -= x//3+1 y -= y//3+1 if x==y: return x if 0 <= x <= 1 else abs(x)+1 else: return max(abs(x), abs(y)) T = int(input()) for _ in range(T): ax,ay,bx,by,cx,cy = map(int,input().spli...

0.687663

#!/usr/bin/env python3 # 600D_circles.py - Codeforces.com/problemset/problem/600/D by Sergey 2015 import unittest import sys import math import decimal ############################################################################### # Circles Class (Main Program) #######################################################...

0.653347

import sys import math input=sys.stdin.readline def binary(l,r,co,b,c): x=(l+r)/2 #print(x) val1=(2*x+b)*math.sin(x) val2=(x**2+b*x+c)*math.cos(x) x=(l+r)/2 val=val1-val2 if(abs(val)<.0000001 or co==150): return (l+r)/2 if(val<0): return binary((l+r)/2,r,co+1,b,c) else: return binary(l,(l+r)/2,co+1,b,c) ...

0.637041

R=lambda:list(map(int,input().split())) r,d=R() def ok(): x,y,z=R() return 1 if (r-d+z)**2<=x*x+y*y<=(r-z)**2 else 0 print(sum(ok() for i in range(int(input()))))

0.633582

t = int(input()) for i in range(t): d,v,l,r = list(map(int, input().split())) ans = d // v ans -= r//v - (l-1)//v print(ans)

0.632135

for _ in range(int(input())): n,r,x,y=map(int,input().split()) if x>0: a=list(map(int,input().split())) if y>0: b=list(map(int,input().split())) if x>0 and y>0: a=a+b c=n-len(list(set(a))) else: l=x+y c=n-l x=min(c,r) print(x)

0.630371

import sys readline = sys.stdin.readline readall = sys.stdin.read ns = lambda: readline().rstrip() ni = lambda: int(readline().rstrip()) nm = lambda: map(int, readline().split()) nl = lambda: list(map(int, readline().split())) prn = lambda x: print(*x, sep='\n') def solve(): a, b, c, d = nm() m = 10**6 + 10 ...

0.628903

for i in range(int(input())): a,b,c=map(int,input().split()) x,y=map(int,input().split()) ans=0 if x>y: ans=ans+x*min(a//2,b) a=(a-2*min(a//2,b)) ans=ans+y*min(a//2,c) else : ans=ans+y*min(a//2,c) a=(a-2*min(a//2,c)) ans=ans+x*min(a//2,b) print(ans...

0.628659

for TT in range(1, int(input()) + 1): a, b, c = map(int, input().split()) l = max(-1, (b + c - a) // 2) r = c print(r - l if r >= l else 0)

0.621079

t = int(input()) while(t>0): t-=1; n,l,r = list(map(int,input().split())); a = bin(l)[2:]; b = bin(r)[2:]; # find matching z = 0; l = min(len(a),len(b)); for i in range(l): if a[i]==b[i]: z+=1; else: break; #find base string a = a[z:] b = b[z:] if(len(a)==0 and len(b)==0): print(n); else : m...

0.616786

for _ in range(int(input())): a,b,c = list(map(int, input().split())) x,y,z = list(map(int, input().split())) temp = min(c,y) ans = 2*temp c -= temp y -= temp temp = min(c,z) c -= temp z -= temp temp = min(c,x) c -= temp x -= temp temp = min(a,z) a -= temp z...

0.612071

import sys input = sys.stdin.readline T = int(input()) for _ in range(T): h, c, t = list(map(int, input().split())) if h + c >= 2 * t: print(2) else: diff2 = 2*t - (h + c) hDiff2 = 2*h - (h + c) kDown = (hDiff2//diff2 - 1)//2 kUp = kDown + 1 diffDown = abs(d...

0.611426

# Contest: Codeforces Round #593 (Div. 2) (https://codeforces.com/contest/1236) # Problem: A: Stones (https://codeforces.com/contest/1236/problem/A) def rint(): return int(input()) def rints(): return list(map(int, input().split())) t = rint() for _ in range(t): a, b, c, = rints() mx = 0 for ta...

0.608717

import math import sys input = sys.stdin.readline def main(): MAX_N = int(1e6) + 1 dp = [0 for i in range(MAX_N)] vals = [[] for i in range(10)] for i in range(10): dp[i] = i vals[i].append(i) for i in range(10, MAX_N): prod = 1 for j in str(i): i...

0.606968

q = int(input()) for _ in range(q): l, r, d = list(map(int, input().split())) if d < l: print(d) else: v = d * (r // d) while v <= r: v += d print(v)

0.606566

import sys input = sys.stdin.readline t = int(input()) out = [] for _ in range(t): a, b, c, d = list(map(int, input().split())) dX = c - a dY = d - b out.append(dX * dY + 1) print('\n'.join(map(str,out)))

0.604269

import sys import math def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def MI(): return map(int, sys.stdin.readline().split()) def SI(): return sys.stdin.readline().strip() t = II() for q in range(t): a,b,c,d = MI() print(max(a+b,c+d))

0.601818

r, D, x = map(int, input().split()) for i in range(10): x = r * x - D print(x)

0.596589

import sys input = sys.stdin.readline n, r = map(int, input().split()) xs = list(map(int, input().split())) points = [] for x in xs: y = r for x0, y0 in points: if abs(x - x0) <= 2 * r: y = max(y, y0 + ((2*r)**2 - (x-x0)**2)**0.5) points.append((x, y)) print(" ".join("%.20f" % p[1] for p in points))

0.594172

x0, y0, A, C, B, D = list(map(int, input().split())) pts = [[x0, y0]] for i in range(100): nx, ny = [pts[-1][0] * A + B, pts[-1][1] * C + D] pts.append([nx, ny]) if max(nx, ny) > 10000000000000000 * 10000000000000000: break x, y, t = list(map(int, input().split())) # print (pts[0]) # print (pts[1]) # print (pts[2...

0.593226

import sys import string from math import gcd import getpass import math from decimal import Decimal import pprint def ria(): return [int(i) for i in input().split()] if getpass.getuser() != 'frohenk': filename = 'half' # sys.stdin = open('input.txt') # sys.stdout = open('output.txt', 'w') else: ...

0.591818

# cook your dish here for _ in range (int(input())): x1,y1,x2,y2=map(int,input().split()) av1=(x1+y1)/2 av2=(x2+y2)/2 if(av1>av2): print(av1-av2," DEGREE(S) ABOVE NORMAL") else: print(av2-av1," DEGREE(S) BELOW NORMAL")

0.589997

# cook your dish here def solve(l,r,c,row,col,po): count=0 visited=set() stack=set() stack.add((l[row][col],row,col)) while stack: ele=stack.pop() visited.add((ele[1],ele[2])) if ele[0]<po: count+=1 if ele[1]-1>=0 and (ele[1]-1,ele[2]) not in visited:...

0.588396

T = int(input()) for t in range(T): N, R = list(map(int, input().split())) print(1 + (R - sum(map(int, input().split()))) % N)

0.587959

#-*- coding:utf-8 -*- import sys # class Point: # def __init__(self, x, y): # self.x = x # self.y = y # def mul(self, k): # return Point(k * self.x, k * self.y) # def __add__(self, other): # return Point(self.x + other.x, self.y + other.y) # def __sub__(self, other)...

0.587836

def eq_solve(v0, v1, u0, u1): den = u0 - v0 num = u1 - v1 if den != 0: return num / den return 1 def solve(p, q, r, a, b, c, rs): if p == a and q == b and r == c: return rs if rs >= 2: return 3 res = 3 adds = [a - p, b - q, c - r] muls = [] ...

0.586911

# cook your dish here for t in range(int(input())): a,b,c=map(int,input().split()) p=(c//a)*a+b if p<=c: print(p) else: print(((c//a)-1)*a+b)

0.585891

for _ in range(int(input())): n, x, a, b = map(int, input().split()) print(min(abs(a - b) + x, n - 1))

0.585084

# cook your dish here """ Input: The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. The first line of each test case contains three space-separated integers p, q and r. The second line contains three space-separated integers a, b and c. Ou...

0.580588

# cook your dish here MOD = 998244353 fball = [ [0]*101 for _ in range(101) ] cric = [ [0]*101 for _ in range(101) ] def calSNum(n, r): if n == r or r == 1: fball[r][n] = 1 return if n > 0 and r > 0 and n > r: fball[r][n] = (fball[r-1][n-1]%MOD + (r*fball[r][n-1])%MOD )%MOD return fball[r][n] = 0 d...

0.579231

import sys # sys.stdin = open('in.txt') s = sys.stdin.read().split() p = 0 def getSm(k, a, b, c, d): return (k + 1) * a - (k * (k + 1) >> 1) * b * d t = int(s[p]) p += 1 res = [] for _ in range(t): a = int(s[p]) p += 1 b = int(s[p]) p += 1 c = int(s[p]) p += 1 d = int(s[p]) p...

0.579022

from bisect import * d = [{}, {}] i = [0, 0] for q in range(int(input())): a, t, x = map(int, input().split()) for k in [0, 1]: d[k][x] = d[k].get(x, []) i[k] = bisect(d[k][x], t) if a < 3: d[-a][x].insert(i[-a], t) else: print(i[1] - i[0])

0.578141

import sys readline = sys.stdin.readline read = sys.stdin.read ns = lambda: readline().rstrip() ni = lambda: int(readline().rstrip()) nm = lambda: map(int, readline().split()) nl = lambda: list(map(int, readline().split())) prn = lambda x: print(*x, sep='\n') def solve(): a, b, c, d = nm() if a <= b: ...

0.575979

import sys NORM = 2000000 LIMIT = NORM * 2 + 1 class segmentTree: def __init__(self, n): self.n = n self.t = [0] * (n * 2) self.lazy = [0] * n def apply(self, p, value): self.t[p] += value if p < self.n: self.lazy[p] += value def build(self, p): while p > 1: p >>= 1 self.t[p] = max(self.t[...

0.575132

# cook your dish here import heapq as hq from math import floor for _ in range(int(input())): n,a,b,x,y,z=map(int,input().split()) arr=[-int(i) for i in input().split()] days=((z-b-1)//y) ans=0 hq.heapify(arr) curr=a+days*x while curr<z : u=hq.heappop(arr) u=-u if u==0 : break else: curr+=u ans+...

0.574998

for __ in range(int(input())): a, b, c, d = list(map(int, input().split())) if a == c or b == d: print(abs(a - c) + abs(b - d)) else: print(abs(a - c) + abs(b - d) + 2)

0.574551

from math import * zzz = int(input()) for zz in range(zzz): a, b, x, y = list(map(int, input().split())) print(max(x*b, (a-x-1)*b, y*a, (b - y - 1)*a))

0.568017

import sys import math from collections import defaultdict from itertools import combinations from itertools import permutations input = lambda : sys.stdin.readline().rstrip() read = lambda : map(int, input().split()) def write(*args, sep="\n"): for i in args: sys.stdout.write("{}".format(i) + sep) INF = float('i...

0.56764

# cook your dish here from sys import stdin,stdout a,b=list(map(int,stdin.readline().split())) left=[] top=[] for i in range(a): c,d=list(map(int,stdin.readline().split())) left.append(c) top.append(d) left.sort() top.sort() from bisect import bisect_right as br from bisect import bisect_left as bl row=0 col=0 total...

0.565329

def meeting_time(Ta, Tb, r): if Ta == 0: return "{:.2f}".format(abs(Tb)) elif Tb == 0: return "{:.2f}".format(abs(Ta)) else: return "{:.2f}".format(abs(Ta * Tb / (Tb - Ta)))

0.564187

w, r = open('output.txt', 'w'), open('input.txt', 'r') s, y = [0] * 466, [0, 100, 131, 159, 190, 220, 251, 281, 312, 343, 373, 404, 434] for i in range(int(r.readline())): m, d, p, t = map(int, r.readline().split()) x = y[m] + d s[x] -= p s[x - t] += p for i in range(465): s[i + 1] += s[i] w.write(s...

0.562213

a, b, c = list(map(int, input().split())) x1, y1, x2, y2 = list(map(int, input().split())) ans0 = round(abs(x1 - x2) + abs(y1 - y2), 9) if a * b ==0: print(ans0) raise SystemExit x11 = (-c - b * y1) / a y12 = (-c - a * x1) / b x21 = (-c - b * y2) / a y22 = (-c - a * x2) / b ans1 = abs(x1 - x11) + abs(x21 - x2)...

0.562051

t=int(input()) for i in range(t): a,k=list(map(int,input().split())) x1,x2,x3=list(map(int,input().split())) big=max(x1,x2,x3) small=min(x1,x2,x3) q=big-small-2*k if q>=a: print(0) elif -1*q>=0: print(a*a) else: print(a*(a-q))

0.560901

# cook your dish here for j in range(int(input())): p,q,r,s =map(int,input().split()) x=(s-p) y=(s-q) z=(s-r) print(y,z,x)

0.557882

class Solution: def countGoodTriplets(self, arr: List[int], a: int, b: int, c: int) -> int: da = defaultdict(set) db = defaultdict(set) dc = defaultdict(set) for i in range(len(arr)-1): for j in range(i+1,len(arr)): dis = abs(arr[j]-arr[i]) ...

0.557802

""" Codeforces Contest 288 Div 2 Problem C Author : chaotic_iak Language: Python 3.4.2 """ ################################################### SOLUTION def main(): m,t,r = read() w = read() if t < r: return -1 covers = [0]*1000 ct = 0 for i in w: x = covers[i] for j in range(...

0.557346

import math def dist(w,x,y,z): return math.hypot(y - w, z - x) t = int(input()) while (t>0): t = t -1 n, m = list(map(int,input().split())) a = [] for i in range(0,n): x,y = list(map(int,input().split())) a.append([x,y]) for j in range(0,m): p,q,r,s = list(map(int,input().split())) nearest = -1 distanc...

0.556579

import sys def findRoom(x,y,i): R = [(x,y)] GRID[x][y] = i for n in R: GRID[n[0]][n[1]] = i if n[0]>0 and GRID[n[0]-1][n[1]]==0 and H[n[0]-1][n[1]]: GRID[n[0]-1][n[1]] = i R.append((n[0]-1,n[1])) if n[0]<N-1 and GRID[n[0]+1][n[1]]==0 and H[n[0]][n[1]]: GRID[n[0]+1][n[1]] = i R.append((n[0]+1,n[1]...

0.555911

import sys def inside(a,b): return ((a[0]-b[0])**2 + (a[1]-b[1])**2) < (a[2]+b[2])**2 def main(): pi = 3.14159265358979323 n = int(sys.stdin.readline()) a = [] p = [-1]*n for i in range(n): x,y,r = map(int,sys.stdin.readline().split()) a.append([x,y,r]) for i in range(n):...

0.555771

import math t=eval(input()) while t: t=t-1 r1,h1,r2,h2=list(map(float,input().split())) vol1=(math.pi*r1*r1*h1)/3 + (2*math.pi*r1*r1*r1)/3 vol2=math.pi*r2*r2*h2 print("%.8f %.8f" % (vol1,vol2))

0.555418

t=int(input()) for j in range(t): a,b,c,d=map(int, input().split()) print(b,c,c)

0.554763

import sys import math import heapq def half(n): return n//2 def main(arr,m): a,b,c=arr while m!=0: s=max(a,b,c) if s==a: a=half(a) elif s==b: b=half(b) else: c=half(c) m-=1 return max(a,b,c) for i in range(int(input())): r,g,b,m=list(map(int,input().split())) arr=[] ...

0.554154

# cook your dish here # cook your dish here class Animal: def __init__(self): start, end, starting_time = map(int, input().split()) self.ending_time = starting_time + abs(start - end) self.velocity = 1 if end >= start else -1 self.eaten_by = -1, 10 ** 10 ...

0.551281

t=int(input()) for _ in range(t): n,a,b,c,d,p,q,y=list(map(int,input().split())) l=list(map(int,input().split())) ans = abs((l[b-1]-l[a-1]))*p x=abs(l[c-1]-l[a-1])*p if x<=y: x=y+abs(l[d-1]-l[c-1])*q+abs(l[b-1]-l[d-1])*p ans=min(ans,x) print(ans)

0.550705

# cook your dish here for _ in range(int(input())): a,b,c=list(map(int, input().split())) p=a*100+b mx=p ans, cnt = 0, 0 while True: cnt+=1 if p<c or cnt==10000: break else: p-=c a=p//100 b=p%100 ...

0.550685

# cook your dish here from collections import namedtuple CurrentPosition = namedtuple('current_position', 'points, cell, pairs') T = int(input()) for _ in range(T): R, C, N = map(int, input().split()) Sx, Sy = map(int, input().split()) tx = map(int, input().split()) ty = map(int, input().split()) ...

0.550008

n, h, a, b, k = map(int, input().split()) for i in range(k): t1, f1, t2, f2 = map(int, input().split()) if t1 == t2: print(abs(f1 - f2)) elif f1 >= a and f1 <= b: print(abs(t2 - t1) + abs(f2 - f1)) elif f1 < a: print(abs(a - f1) + abs(t2 - t1) + abs(f2 - a)) elif f1 > b: ...

0.548006

t =int(input()) for i in range(t): C=[ord(x)-ord('R') for x in list(input())] N=int(input()) L=sum(C) r=1 c=0 while(r*L<N*12): c+=N*12-r*L r+=1 print(c)

0.547495

T=int(input()) # cook your dish here for i in range(T): n=list(map(int,input().split())) a=n[0] b=n[1] c=n[2] l=[] A=list(map(int,input().split())) B=list(map(int,input().split())) C=list(map(int,input().split())) for i in range(b): for j in range(a): for k in ra...

0.546338

import sys, collections def gcd(a, b): if b == 0: return a return gcd(b, a % b) def lcm(a, b): return a // gcd(a, b) * b def extgcd(a, b): if b == 0: return 1, 0 x, y = extgcd(b, a % b) return y, x - a // b * y def prime_factor(n): res = collections.defaultdict(int) i = 2 while ...

0.54496

#!/usr/bin/env python3 def main(): try: while True: s, x1, x2 = list(map(int, input().split())) t1, t2 = list(map(int, input().split())) p, d = list(map(int, input().split())) def travel(src, trg): nonlocal d if src == trg: ...

0.544359

t = int(input()) for _ in range(t): x,y = map(int,input().split()) a,b = map(int,input().split()) wynik = 0 if b <= 2*a: c = min(x,y) wynik += b*c wynik += (max(x,y)-c)*a else: wynik = a*(x+y) print(wynik)

0.544295

import sys def main(): n, q, c = list(map(int, sys.stdin.readline().split())) a = [] c += 1 for i in range(c): t = [] for j in range(102): t.append([0] * 102) a.append(t) for i in range(n): x, y, s = list(map(int, sys.stdin.readline().split())) ...

0.543823

import sys input = sys.stdin.readline G0=[[[[0]*5500 for i in range(6)] for j in range(6)] for k in range(6)] G1=[[[[0]*5500 for i in range(6)] for j in range(6)] for k in range(6)] G2=[[[[0]*5500 for i in range(6)] for j in range(6)] for k in range(6)] for x in range(1,6): for y in range(1,6): for z in...

0.542729

def main(): import sys input = sys.stdin.readline import heapq def dijkstra_heap(s,g,edge): #始点sから各頂点への最短距離 d = [10**20] * (n+2) used = [True] * (n+2) #True:未確定 d[s] = 0 used[s] = False edgelist = [] sx,sy,sr=edge[s][0],edge[s][1],edge[s][2] ...

0.542533

import math def csb(n): count = 0 while (n): n &= (n-1) count+= 1 return count def f(ca,cb,i,cf,C,n,dp): if ca<0 or cb<0: return 0 if i==n: if ca==0 and cb==0 and cf==0: return 1 return 0 st=str(ca)+" "+str(cb)+" "+str(cf)+" "+str(i) if dp.get(st)!=None: return dp[st] x=0 if (C&(1<<i))>0:...

0.54002

for i in range(int(input())): n=int(input()) s=0 for i in range(n): a,b,c=map(int,input().split()) d=(c/100)*a e=a+d f=e-((c/100)*e) g=a-f h=b*g s=s+h print(s)

0.539191

import sys import math from math import sqrt import bisect small = 10**5+1 big = 10**18+1 pos = [] f = pos.append #pos.add(1) j = 2 while True: #if sqrt(j).is_integer(): # j+=1 # continue j2 = j*j i = j*j2 if i>=big: break #if int(i**0.5+0.5)**2==i: # j+=1 # ...

0.539117

import bisect def inpl(): return [int(i) for i in input().split()] X = int(input()) K = int(input()) r = [0] + inpl() stu = [()]*(K+1) stu[0] = (X, 0, 0) for i, v in enumerate(r[1:], 1): s, t, u = stu[i-1] if i%2: rs = r[i-1] - r[i] ap = - rs - t if ap >= s: stu[i] = 0, 0, 0...

0.537315

from math import sqrt class pro(object): def __init__(self,dif,sc): self.dif=dif self.sc=sc def __lt__(self,other): return self.dif>other.dif T=int(input()) mul=[1] for i in range(100): mul.append(mul[i]*10/9) inf=1000000007 for t in range(T): n=int(input()) effi,tim=list(m...

0.53705

def solve(L, R): res = 0 for i in range(32): for j in range(32): l = (L >> i) <> j) << j #print(l, r) if l>>i&1==0 or r>>j&1==0: continue l -= 1<<i r -= 1<<j if l & r: continue...

0.536449

for _ in range(int(input())): s, a, b, c = list(map(int, input().split())) x = s // c x += b * (x // a) print(x)

0.535502

import sys R,x,y,s,t = list(map(int,input().split())) if (s-x)**2 + (t-y)**2 > R*R: print(x,y,R) return dx = x - s dy = y - t r = (dx**2 + dy**2)**.5 if abs(r)<1e-9: dx = 1 dy = 0 else: dx /= r dy /= r a = s + dx*(R + r)/2 b = t + dy*(R + r)/2 print(a,b,(R+r)/2)

0.535216

from collections import * import sys try: inp = raw_input except: inp = input def err(s): sys.stderr.write('{}\n'.format(s)) def ni(): return int(inp()) def nl(): return [int(_) for _ in inp().split()] def solve(): n, L, R = nl() L -= 1 R -= 1 SM = 0 out = [] for i in range(1, n)...

0.534695

for _ in range(int(input())): a,o,g=map(int,input().split()) while g>0: if a<o: a+=1 g-=1 elif o<a: o+=1 g-=1 else: break print(abs(a-o))

0.533711

import sys from operator import itemgetter def count(a, b, num_a, num_b, cur_time): current_result = 0 #print('count time = ', cur_time, "num_a =", num_a, 'num_b = ', num_b) if num_a * a + num_b * b <= cur_time and cur_time >= 0: cur_time -= num_a * a + num_b * b current_result = num_a + num_b if num_a < tota...

0.533708

withFile = 0 if(withFile == 1): fin = open('input.txt', 'r') fout = open('output.txt', 'w') def getl(): if(withFile == 0): return input() else: return fin.readline() def printl(s): if(withFile == 0): print(s) else: fout.write(str(s)) def get_arr(): x ...

0.533436

eps=1e-8 t=int(input()) for ii in range(t): n=int(input()) l=[int(i) for i in input().split() ] b=[int(i) for i in input().split() ] v=[int(i) for i in input().split() ] c=[int(i) for i in input().split() ] greatest_time=l[0]/v[0] for i in range(1,n): if v[i]>0: greatest_...

0.532505

import sys def _r(*conv) : r = [conv[i](x) for i, x in enumerate(input().strip().split(' '))] return r[0] if len(r) == 1 else r def _ra(conv) : return list(map(conv, input().strip().split(' '))) def _rl() : return list(input().strip()) def _rs() : return input().strip() def _a(k, *v) : return all(x == k for ...

0.53227

import math leftpeople = set() rightpeople = set() n, vl = list(map(int, input().split())) def leftinterval(x0, v0, t): if x0 / v0 <= t: return (0, 10**6) if x0 / (vl + v0) > t: return (-1, -2) leftbound = x0 rightbound = (vl * vl - v0 * v0) * t + x0 * v0 rightbound /= vl right...

0.53071

# cook your dish here for u in range(int(input())): n,r=list(map(int,input().split())) l=list(map(int,input().split())) m=0 for i in range(n-1): d=[] d.append(l[i]) c=1 while(i+c<n): d.append(l[i+c]) d.sort(reverse=True) if(d[0]+d[1]<=r...

0.530244

a,b,l,r=list(map(int, input().split())) length=int(l/(a+b)) if a==3 and b==1 and l==4 and r==10: print(4) return l-=length*(a+b) r-=length*(a+b) if r>=4*a+4*b: r=4*a+4*b if b>=a: _A=[] for i in range(a): _A.append(i+1) for i in range(b): _A.append(a) for i in range(a): ...

0.529689

l= [] for i in range(62): l.append(2**i) T = int(input()) flag = 0 for t in range(T): L,R = [int(i) for i in input().split()] bL = bin(L) lL = len(bL)-2 index = 1 ans = 0 temp = 0 while(index<=lL): temp = L%l[index] if temp>=l[index-1]: if(l[index]-temp<=R-L+1): ans= (ans +(l[index-1])*(l[index]-t...

0.527802

from bisect import bisect_left as bl from bisect import bisect_right as br import heapq import math from collections import * from functools import reduce,cmp_to_key import sys input = sys.stdin.readline M = mod = 10**9 + 7 def factors(n):return sorted(set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5)...

0.527628

#AUTHOR:: AMAN VERMA try: for _ in range(int(input())): row,column=list(map(int,input().split(" "))) x_x,y_y=list(map(int,input().split(" "))) ab=max((x_x-0),(row-x_x-1)) ba=max((y_y-0),(column-y_y-1)) print(ab+ba) except: pass

0.527249

import sys test_cases = int(input()) for i in range(0,test_cases): count = input().split() #print count count_r = int(count[0]) count_g = int(count[1]) count_b = int(count[2]) k = int(input()) if k is 1: total = 1 else: total = 1 if count_r < k: total = total + count_r else: total = total + (k-...

0.5271

# cook your dish here def isValid(mid): time = 0.0 for i in range(n): if time < c[i]: time = c[i] time += mid # cannon cooling elif time >= c[i] and time <= c[i] + d: time += mid # cannon cooling else: return False return True t = int(input()) while t != 0: n, d = list(map(int, input().split())) ...

0.526575

import sys def countR(ip): c=0 for i in ip: if(i=='R'): c+=1 return c def countB(ip): c=0 for i in ip: if(i=='B'): c+=1 return c def countG(ip): c=0 for i in ip: if(i=='G'): c+=1 return c # sys.stdin.readline() t=i...

0.526501

t = int(input()) def gcd(x, y): while y: x, y = y, x % y return x for i in range(t): a, b, q = map(int, input().split()) z = gcd(a, b) target = (a * b)//z pref = [0] for j in range(1, target + 1): if (j%a)%b != (j%b)%a: pref.append(pref[-1]+1) else: ...

0.525413

N=100001 fac=[0 for i in range(N)] for i in range(1,N): for j in range(i,N,i): fac[j]+=1 def gcd(a,b): if a<b: a,b=b,a while b>0: a,b=b,a%b return a def ctt(A,B,C): la=fac[A] lb=fac[B] lc=fac[C] ab=gcd(A,B) ac=gcd(A,C) bc=gcd(B,C) a...

0.525219

for i in range(eval(input())): n,m,z,l,r,b = list(map(int, input().split())) rows=n columns=m hand_rest=n*(m+1) if(m%2==0): hand_rest -=max(0,n-l-r) if(l+r+(2*b)<=hand_rest): # print "kanu" print(min(n*m,l+r+z+b)) else: temp=l+r+(hand_rest-l-r)/2 # print "parth" print(min(n*m,temp+z))

0.524072

t = int(input()) for _ in range(t): n, k = [int(x) for x in input().split()] l1, r1 = [int(x) for x in input().split()] l2, r2 = [int(x) for x in input().split()] if l1 > l2: l1, r1, l2, r2 = l2, r2, l1, r1 if l2 < r1: # they already intersect. start = (min(r1, r2) - max(l1...

0.523975

def find_upper_bound(arr,key): low,high = 0,len(arr)-1 while low<=high: mid = (low+high)//2 if arr[mid]==key:return mid elif arr[mid]>key and mid-1>=0 and arr[mid-1]<key:return mid elif arr[mid]>key:high = mid - 1 else:low = mid + 1 return mid def get_query(l): nonlocal prefix_storer,bin_storer ind ...

0.523643

import sys import math a, b, n = list(map(int, str.split(sys.stdin.readline()))) s = lambda i: a + (i - 1) * b S = lambda i: a * i + b * i * (i - 1) // 2 for _ in range(n): l, t, m = list(map(int, str.split(sys.stdin.readline()))) # Si = a * r + b * r * (r - 1) / 2 # Si = b / 2 * r ^ 2 - (b / 2 - a) * r ...

0.523409

for _ in range(int(input())): n, x, y, d = map(int, input().split()) tt = abs(x - y) if tt % d != 0: ans = -1 if (y - 1) % d == 0: ans = (x - 1 + d - 1) // d + (y - 1) // d if (n - y) % d == 0: cc = (n - x + d - 1) // d + (n - y) // d if ans == -1 or cc < ans: ans = cc print(ans) else: print(...

0.522963

def main(): n,m = list(map(int, input().split())) r,c = list(map(int, input().split())) L,R = list(map(int, input().split())) lab = [input() for _ in range(n)] r -= 1 c -= 1 inf = n*m+1 dist = [[inf] * m for _ in range(n)] dist[r][c] = 0 Q = [(r,c)] for x,y in Q: ...

0.52217

Hooray! Polycarp turned $n$ years old! The Technocup Team sincerely congratulates Polycarp! Polycarp celebrated all of his $n$ birthdays: from the $1$-th to the $n$-th. At the moment, he is wondering: how many times he turned beautiful number of years? According to Polycarp, a positive integer is beautiful if it cons...

s = [] for i in range(1, 10): k = 0 for l in range(1, 10): k *= 10 k += i s.append(k) s.sort() q = int(input()) while q: n = int(input()) l = 0 r = len(s) while l + 1 < r: m = (l + r) // 2 if s[m] <= n: l = m else: r = m ...

0.647875

# ========== //\\ //|| ||====//|| # || // \\ || || // || # || //====\\ || || // || # || // \\ || || // || # ========== // \\ ======== ||//====|| # code def solve(): x = int(input()) ans = 0 ok = 0 ...

0.712382

for i in range(1,int(input())): #More than 2 lines will result in 0 score. Do not leave a blank line also print((10**i//9 * i))

0.711172

l = [0] def count(size): nums = (10**size - 10**(size - 1)) small = l[size-1] + size large = l[size-1] + nums * size if len(l) <= size: l.append(large) return (nums * (small + large))//2 def test(minSize, size, val): out = minSize * val + size * ((val + 1) * val)//2 return out q ...

0.708837

for t in range(eval(input())): n=eval(input()) n-=n%10 n/=10 print(n*(n+1)/2*10)

0.708771

for _ in range(int(input())): n=input().rstrip() n=[ele for ele in n] l=len(n) m=10**18+8 ini=1 for i in range(l-1,-1,-1): if int(n[i])<=m: if ini==1: m=int(n[i]) else: m=max(m,n[i]) else: m=int(n[i])-1 n[i]=str(m) for j in range(l-1,i,-1): n[j]='9' i=0 while n[i]=='0': i+=1...

0.69035

# cook your dish here t= int(input()) for i in range(t): cnt=0 n=int(input()) while(n>=100): n-=100 cnt+=1 while(n>=50): n-=50 cnt+=1 while(n>=10): n-=10 cnt+=1 while(n>=5): n-=5 cnt+=1 while(n>=2): n-=2 cnt+=1 ...

0.690215

t = int(input()) while t > 0: s = int(input()) while s % 10 == 0 : s /= 10 print(''.join(reversed(str(s)))) t = t - 1

0.68858

for _ in range(int(input())): N = input() num = list(N) s=0 for n in num: if n.isnumeric(): s+=int(n) #print(s) x=(10-s%10)%10 print(int(N)*10+int(x))

0.687034

for i in range(1,int(input())+1): #More than 2 lines will result in 0 score. Do not leave a blank line also print(((10**i//9)**2))

0.673763

# cook your dish here def getAns(num): if num<10:return 2 last=int(str(num)[0]);rem=int(str(num)[1:]);steps=2;p=len(str(num))-1 while True: steps+=rem//last+1;rem=rem%last if last>0:rem=rem+10**p-last last=last-1 if last==0: p=p-1;last=9 if(len(str(rem))==1):rem=0 els...

0.664889

import math from decimal import Decimal import heapq import copy import heapq from collections import deque def na(): n = int(input()) b = [int(x) for x in input().split()] return n,b def nab(): n = int(input()) b = [int(x) for x in input().split()] c = [int(x) for x in input().split()] return n,b,c def...

0.664559

def dlog(x, n): bigMod = 5 ** n ans = [None, 0, 1, 3, 2][x % 5] val = 2 ** ans % bigMod mod, phi = 5, 4 phiVal = 2 ** phi % bigMod for i in range(2, n + 1): nextMod = mod * 5 while val % nextMod != x % nextMod: val = val * phiVal % bigMod ans += phi phi *= 5 phiVal = (phiVal * ...

0.6616

#cook your recipe from math import factorial test_cases = int(input()) for _ in range(test_cases): n = int(input()) sum1 = 0 final_sum = 0 num = list(map(int, input().split())) rep_time = factorial(n - 1) rep_count = dict() for i in num: if i in rep_count: rep_count[i] +=1 else...

0.658726

#JMD #Nagendra Jha-4096 import sys import math #import fractions #import numpy ###File Operations### fileoperation=0 if(fileoperation): orig_stdout = sys.stdout orig_stdin = sys.stdin inputfile = open('W:/Competitive Programming/input.txt', 'r') outputfile = open('W:/Competitive Programming/output...

0.656439

for _ in range(int(input())): n = int(input()) # arr = list(map(int, input().split())) # n, m = map(int, input().split()) arr = [] x = 1 while n > 0: if (n % 10): arr.append((n % 10) * x) n //= 10 x *= 10 print(len(arr)) print(*arr)

0.650882

from math import sqrt, log2 from sys import stdin from bisect import bisect import time def all_primes(n): res = [] for i in range(1, n+1): prime = True for j in range(2, min(int(sqrt(i))+2, i)): if i % j == 0: prime = False break if prime: re...

0.650125

# cook your dish here t = int(input()) for _ in range(t): s = '' n = int(input()) if n==1: print(1) continue for i in range(1, n+1): s = s + str(i) print(s) p = 1 for i in range(n-1): s = '' for j in range(n): s = s + str(p + n) ...

0.644994

from sys import stdin, stdout input = stdin.readline from collections import defaultdict as dd import math def geti(): return list(map(int, input().strip().split())) def getl(): return list(map(int, input().strip().split())) def gets(): return input() def geta(): return int(input()) def print_s(s): stdout.write...

0.644542

pref = [] for i in range(10 ** 5 + 10): b = bin(i)[2:] if not any(b[j] == b[j+1] == '1' for j in range(len(b) - 1)): pref.append(i) else: pref.append(pref[-1]) for i in range(int(input())): print(pref[int(input())])

0.64356

def getsum(N): if N==1: return 9 if N==2: return 99 s = "" for i in range(0,N): s = s+'5' s = int(s) if N%2==0: s = s*pow(9,N//2-1) else: s = s*pow(9,N//2) return s%(pow(10,9)+7) def main(): t = int(input()) for _ in range(0,t): N = int(input()) result = getsum(N) print(result) def __starting...

0.641164

for t in range(int(input())): n=int(input()) print(bin(n).count("1"))

0.638582

t=int(input()) for tests in range(t): print(int(input()))

0.637517

from sys import stdin, stdout from collections import defaultdict input = stdin.readline for _ in range(int(input())): n = int(input()) chanek = 0 flag = 1 while n>0: if n%4==0 and n!=4: if flag: chanek += 1 n-=1 flag = 0 else: n-=1 flag = 1 elif n%2: if flag: chanek += 1 n-...

0.636143

for _ in range(int(input())): n=int(input()) n1=0 ans=1 while(n>0): d=int(n % 10) if(d!=0): if(d!=9 and d!=7 and d!=1): n1=3 elif(d==1): n1=1 else: n1=4 ans=(int(ans)*int(n1))% (1000000007) n/=10 else: n/=10 if(ans==1): print("0") else: print(ans %(1000000007))

0.635767

t = eval(input()) def moneda(m): h = 1 triange = [] while m >= h: triange.append(h) m -= h h += 1 return len(triange) triangulo = [] for i in range(t): n = eval(input()) triangulo.append(n) for i in triangulo: print(moneda(i))

0.631281

for _ in range(int(input())): n = int(input()) num = "" val = 1 for i in range(n): num += str(val) if val == 1: val = 0 else: val = 1 for i in range(n): print(num)

0.631144

t=int(input()) while(t): k=1 j=0 n=int(input()) while(n>0): if(n<=k): j+=1 n=0 elif n>2*k: j+=2 n=n-2*k k+=1 else: j+=2 n=0 print(j) t-=1

0.629281

import math t = int(input()) a = [-1, 0, 1] for i in range(58): temp = a[-1] + a[-2] temp = temp%10 a.append(temp) for _ in range(t): n = int(input()) temp = len(bin(n)) - 3 temp = 2**temp temp = temp%60 print(a[temp])

0.629013

for _ in range(int(input())): n = int(input()) bits = ['1'] while int(''.join(bits), 3) < n: bits.append('1') for i in range(len(bits)): bits[i] = '0' if int(''.join(bits), 3) < n: bits[i] = '1' print(int(''.join(bits), 3))

0.626362

t= int(input()) while(t>0): n = int(input()) m=0 m=n//(2**11) n%=(2**11) while(n>0): num=n%2 m+=num n//=2 print(m) t-=1

0.620384

def base5(n): if n == 0: return for x in base5(n // 5): yield x yield n % 5 def seq(n): return int(''.join(str(2 * x) for x in base5(n)) or '0') for i in range(eval(input())): k=eval(input()) while(i<k): i=i+1 print(seq(i-1))

0.620177

t=int(input()) for i in range(0,t): n=int(input()) lis=list(map(int,input().split())) lis2=[] for j in range(0,10): lis2.append(0) for j in range(0,len(lis)): lis2[lis[j]]+=1; s=sum(lis) while s%3!=0: if s%3==2: if lis2[2]>=1: lis2[2]-=1 s=s-2 elif lis2[5]>=1: lis2[5]-=1 s=s-5 elif...

0.619126

x=int(input()) for a in range(x): n=int(input()) L=[str(n)] c=1 while(len(L)!=n): L.append(str(n+c)) if len(L)==n: break L.append(str(n-c)) c+=1 a=" ".join(L) print(a)

0.61882

import fractions import sys f = sys.stdin if len(sys.argv) > 1: f = open(sys.argv[1], "rt") sum_cache = {} def sum_func(x): if x < 10: return x r = sum_cache.get(x) if r is not None: return r xx = 0 while x > 0: xx += x % 10 x /= 10 r = sum_func(xx) ...

0.614448

# cook your dish here import math for _ in range(int(input())): n=int(input()) c=0 while(n>0): i=int(math.sqrt(n)) c+=1 n=n-i**2 print(c)

0.612627

import math def magic(a,digits): m=a%10 if(m==4): return a+3 elif(m==7): p=list(str(a)) #print p for i in range(digits-1,-1,-1): #print p[i] if (p[i]=='4'): #print 'four' p[i]='7' p = ''.join(str(n) for ...

0.612547

import math for _ in range(int(input())): n=int(input()) if n==1: print(0) else: k=int(n**(0.5)) if k*k<n: k+=1 # print(n,k) ans=k-1 if k*(k-1)>=n: ans+=(k-2) else: ans+=(k-1) print(ans)

0.612373

import math def CountSquares(a, b): return (math.floor(math.sqrt(b)) - math.ceil(math.sqrt(a)) + 1) for _ in range(int(input())): n=int(input()) val=CountSquares(1,n) ans=val-val//3 print(ans)

0.611745

from math import sqrt T = int(input()) ans = [] for _ in range(T): X = int(input()) count = 0 x = 0 y = 0 while(x<=X): p = int(sqrt(y)) count += 1 if(p*p>y): x = p y += p**2 else: x = p+1 y += (p+1)**2 if(x<=X): ans.append(count) else: ans.append(count-1) for i in ans: print(i)

0.610431

# cook your dish here t=int(input()) for i in range(0,t): p=input() l=list(p) for j in range(0,len(l)): l[j]=int(l[j]) l[j]=l[j]-2 for j in range(0,len(l)): l[j]=str(l[j]) q=''.join(l) print(q)

0.610023

def persistence(n): n = str(n) count = 0 while len(n) > 1: p = 1 for i in n: p *= int(i) n = str(p) count += 1 return count # your code

0.608367

# cook your dish here for a0 in range(int(input())): n = int(input()) l = [] for i in range(1,n+1): l.append(i) for j in range(n): s = "" for k in l: s+=str(k) print(s) x = l[0] l.pop(0) l.append(x)

0.606151

# cook your dish here import math N = 10**6 sum_arr = [0] * (N + 1) def lprime(): arr = [0] * (N + 1) arr[0] = 1 arr[1] = 1 for i in range(2, math.ceil(math.sqrt(N) + 1)): if arr[i] == 0: for j in range(i * i, N + 1, i): arr[j] = 1 curr_prime_sum = 0 ...

0.604834

from sys import stdin for _ in range(int(stdin.readline())): n = int(stdin.readline()) n //= 2 k = 2 * int(n**0.5) print(k)

0.603772

import sys input = sys.stdin.readline for _ in range(int(input())): n = int(input()) ans = 0 f = 0 i = n while n: ans += i // 2**f n //= 2 f += 1 print(ans)

0.600605

t = int(input()) def conv(n): k = bin(n) k = k[2:] z = len(k) c = '1'*z if c == k: return False def find(n): x = bin(n)[2:] str = '' for i in x[::-1]: if i == '0': str+='1' break else: str+='0' return int(str[::-1],2) for i in range(t): n = ...

0.599779

# cook your dish here # cook your dish here def numDec(s): if not s: return 0 dp = [0 for _ in range(len(s) + 1)] dp[0] = 1 dp[1] = 0 if s[0] == '0' else 1 for i in range(2, len(dp)): if s[i-1] != '0': dp[i] += dp[i-1] two_digit = int(s[i-2 : i]) if two_digit >= 10 and two_digit <= 26: ...

0.595611

def gen(n): if n >= 10**16: return for i in range(10): x = 10*n + i if x % sum(map(int, str(x))): continue yield x for y in gen(x): yield y L = sorted(x for n in range(1, 10) for x in gen(n)) from bisect import bisect_left as bl, bisect_right as br def rthn_between(a, b): re...

0.59559

t=[[1]] def bell_numbers(start, stop): ## Swap start and stop if start > stop if stop < start: start, stop = stop, start if start < 1: start = 1 if stop < 1: stop = 1 c = 1 ## Bell numbers count while c <= stop: if c >= start: yield t[-1][0] ## Yield the Bell number of the previous row row ...

0.595485

testcase = int(input()) for case in range(testcase): n = int(input()) print(2**(n-2)+1) print('\n')

0.594361

def powerset(s): n = len(s) masks = [1 << j for j in range(n)] for i in range(2**n): yield [j + 1 for j in range(n) if (masks[j] & i)] def is_power2(num): return num != 0 and ((num & (num - 1)) == 0) def special(l): n = len(l) for i in range(n): lis = [i + 1] yield...

0.593822

# cook your dish here x=int(input()) for i in range(x): s=input() print(int(s[::-1]))

0.593502

# cook your dish here from sys import stdin import functools def gcd(a, b): if (a == 0): return b return gcd(b % a, a) MAX=10001 def func(ind, g, dp, n, a): if (ind == n): if (g == 1): return 1 else: return 0 if (dp[ind][g] != -1): return dp[ind][g] ans = (func(ind + 1, g, dp, n, a) +...

0.592722

from math import log10 def rocks(n): return (n + 1) * int(log10(n) + 1) - (10 ** int(log10(n) + 1) - 1) // 9

0.592658

import sys T = int(sys.stdin.readline().strip()) for t in range(T): sys.stdin.readline().strip() st = '0'+sys.stdin.readline().strip()+'0' res = 0 for i in range(1,len(st)-1): if st[i] == st[i-1] == st[i+1] == '0': res+=1 print(res)

0.592438

# cook your dish here for _ in range(int(input())): n=int(input()) if n==1: print("0") else: s=[] for i in range(n): s.append(str(i)) print(''.join(s)) p=1 for i in range(n-1): s.pop(n-1) s=[str(p)]+s print(''.jo...

0.592137

# for _ in range(1): for _ in range(int(input())): # a, b = map(int, input().split()) n = int(input()) # arr = list(map(int, input().split())) # s = input() x = (n + 3) // 4 y = n - x print(y * '9' + x * '8')

0.591825

for _ in range(int(input())): x, y = map(int, input().split()) ans = 0 for i in range(y, x+1, y): if i%y == 0: ans += i%10 print(ans)

0.591366

T=int(input()) for i in range(T): n=int(input()) if n==1: print("0") else: n=n-2 l=(n+1)*(2*n+3)*(n+2)/6 print(int(l))

0.590349

def interesting_nums(m): nums = [] for x in range(m + 1, 2 * m + 1): if x * m % (x - m) == 0: nums.append(x) return nums def main(): T = int(input()) for _ in range(T): num_list = interesting_nums(int(input())) print(len(num_list)) for num in num_list: print(num) main()

0.589904

# cook your dish here for i in range(int(input())): n = int(input()) flag = 0 while(n>0): if((n%10)%2 == 0): flag = 1 break n = n//10 if(flag == 0): print(0) else: print(1)

0.58941

t = int(input()) while(t>0): n=int(input()) if(n<=0): print(0) fact=1 start=1 for i in range(1,n+1): fact*=start start+=2 print(fact) t=t-1

0.58889

import sys import random from fractions import Fraction from math import * def input(): return sys.stdin.readline().strip() def iinput(): return int(input()) def finput(): return float(input()) def tinput(): return input().split() def linput(): return list(input()) def rinput(): return ...

0.588827

import sys input = sys.stdin.readline out = [] t = int(input()) for _ in range(t): n = int(input()) n -= 1 rem = n % 3 n //= 3 s = [] if n: n -= 1 while n >= 0: s.append([['00','00','00'],['01','10','11'],['10','11','01'],['11','01','10']][n % 4][rem]) ...

0.588152

t = int(input()) for _ in range(t): s = input() pref = [0]*len(s) if s[0]=="1": pref[0]+=1 for i in range(1,len(s)): if s[i]=="1": pref[i]+=1 pref[i]=pref[i]+pref[i-1] k=1 cnt=0 while (k+k*k)<=len(s): r = k+k*k i=r-1 while i<len(s): if (i-r)>=0: if pref[i]-pref[i-r]==k: cnt+=1 i+=...

0.587411

for zz in range(int(input())): n = int(input()) ans = 0 while n > 1: ans += 1 cr = 2 while n >= cr: n -= cr cr += 3 print(ans)

0.587235

t = int(input()) for _ in range(t): k = int(input()) count = 1 for _ in range(k): output = [] for index in range(1,k+1): output.append(bin(count).replace("0b", "")) count += 1 print(*output)

0.586116

# cook your dish here for _ in range(int(input(''))): n=int(input('')) x=bin(n) x=len(x)-2 if n==(2**(x-1)): print(n) else: print(2**x)

0.584775

# cook your dish here import sys def get_array(): return list(map(int , sys.stdin.readline().strip().split())) def get_ints(): return list(map(int, sys.stdin.readline().strip().split())) def input(): return sys.stdin.readline().strip() import math from collections import defaultdict from itertools import combinations_w...

0.583843

import sys,io,os,math from math import ceil,log,gcd,inf from itertools import permutations mod=1000000007 mod1=998244353 def printlist(n): sys.stdout.write(" ".join(map(str,n)) + "\n") printf=lambda n:sys.stdout.write(str(n)+"\n") def printns(n): sys.stdout.write(str(n)) def intinp(): return int(sys.stdi...

0.583294

def sort_str(s): o = [] for c in s: o.append(c) o.sort() return "".join(o) def find_ana(s): if len(s) <= 1: return 0 h = {} c = 0 for i in range(len(s)): for j in range(i+1, len(s)+1): t = sort_str(s[i:j]) if t in h: c += h[t] ...

0.582849

T=int(input()) t=[] for _ in range(T): N=int(input()) t.append(N) N=max(t)+1 l=[0 for i in range(N)] p=1 a=1 for i in range(1,N): a=(a*i)%1000000007 p=p*a%1000000007 l[i]=p for i in t: print(l[i])

0.581953

# cook your dish here import math; from math import gcd,sqrt,floor,factorial,ceil from bisect import bisect_left,bisect_right import bisect; import sys; from sys import stdin,stdout import os sys.setrecursionlimit(pow(10,7)) import collections from collections import defaultdict,Counter from statistics import median # ...

0.581548

# Why do we fall ? So we can learn to pick ourselves up. t = int(input()) for _ in range(0,t): n = int(input()) abc = [int(i) for i in input().split()] i = 0 lst = [n] for _ in range(0,100): k = str(lst[-1]/abc[i%3]).split('.') if int(k[1][0]) > 0: ...

0.581436

for _ in range(eval(input())): s = input() ans = 0 for i in s: if i.isdigit(): ans += int(i) print(ans)

0.579675

# cook your dish here test=int(input()) for _ in range(test): n=int(input()) n=list(bin(n)) ans=n.count('1') print(ans-1)

0.579236

# cook your dish here for _ in range(int(input())): n = int(input()) count = 1 l = 3*(n-1) i = 0 if n==1: print(1) continue while count<=l-n: for j in range(i+1): if j==i: print(count) count += 1 elif j==0: ...

0.577902

t = int(input()) for _ in range(t): A, B = list(map(int, input().split())) b = -1 B += 1 while B: b += 1 B //= 10 print(A*b)

0.575204

for _ in range(int(input().strip())): n = int(input().strip()) lst = [] for i in range(n): lst.append(i+1) lst.append(1) #print(lst) for i in range(n): print(''.join(str(e) for e in lst)) for x in range(n): lst[x * 2 + 1] += 1

0.575166

try: tc=int(input()) for _ in range(tc): n=int(input()) st="" b=1 for i in range(1,n+1): b+=1 a=b for j in range(1,n+1): print(a,end='') a+=1 print() except: pass

0.574729

def subCount(arr, n, k): mod = [] for i in range(k + 1): mod.append(0) cumSum = 0 for i in range(n): cumSum = cumSum + arr[i] # as the sum can be negative, # taking modulo twice mod[((cumSum % k) + k) % k] = mod[((cumSum % k) + k) % k] + 1 ...

0.573841

t=int(input()) for t in range(t): n=int(input()) s=input() a=[int(x) for x in s] p=a[n-1] print(str(p)*n)

0.573777

for i in range(int(input())): t=int(input()) n=0 for i in range(1,t+1): n=n+i x=[n] y=n for j in range(i,t+i-1): if j<t: z=y+j else: z=y+(2*t-j-1) x.append(z) y=z print(*x)

0.573464

for _ in range(int(input())): n = int(input()) s = '' for i in range(1, n + 1): s += str(i) for i in range(n, 0, -1): if i % 2 == 0: for j in range(i, 0, -1): print(j, end = '') else: for j in range(1, i + 1): print(j, end = '') print()

0.572946

import sys input = sys.stdin.readline t=int(input()) for testcases in range(t): n=int(input()) LIST=[input().strip() for i in range(n)] SET=set() ANS=0 CHANGE=set() for i in range(n): if LIST[i] in SET: ANS+=1 CHANGE.add(i) else: SET.add(LIS...

0.572747

def det(s, i, j): ans = 0 curr = i for a in s: if a == curr: ans += 1 if curr == i: curr = j else: curr = i if i == j: return ans return ans // 2 * 2 for t in range(int(input())): s = list(map(int, list(input()))) ans = 0 for i in range(...

0.570591

def sum_part(n): m, p, q, r, s = 1, 1, 1, 0, n while n > 9: n, d = divmod(n, 10) r += d * p p *= 10 if d: m = 1 else: m*= 2 s += q*n + m*memo[r] q *= 2 return s from collections import defaultdict qualified = defaultdict(list) memo = {n: n for n in ra...

0.56988

k=int(input()) a=0 b=1 for i in range(k): a+=b print(a) if b<(a+b)/sum(map(int,str(a+b))): b*=10

0.567771

# cook your dish here t = int(input()) while(t>0): n = int(input()) k=1 while(k<=n): print(k, end=' ') k+=1 print('\n') t-=1

0.567528

import sys def read_int(): return int(sys.stdin.readline()) def read_ints(): return list(map(int, sys.stdin.readline().split(' '))) t = read_int() for case_num in range(t): n, s = read_ints() a = [0] + [int(i) for i in str(n)] ds = sum(a) cost = 0 idx = len(a) - 1 radix = 1 whi...

0.56584

t=int(input()) while t>0 : a=int(input()) b=int(input()) l=int(input()) x=0 y=0 z=0 a1=0 b1=0 c1=0 while(a//10!=0 or a%10!=0): a1+=(a%10+((a//10)%10)*7+((a//100)%10)*49+((a//1000)%10)*343+((a//10000)%10)*2401+((a//100000)%10)*16807+((a//1000000)%10)*117649+((a//10000000)%10)*823543+((a//100000000)%10)*57648...

0.564515

import sys input = sys.stdin.readline for _ in range(int(input())): a, k = list(map(int, input().split())) for _ in range(k - 1): if '0' in str(a): break a += int(min(list(str(a)))) * int(max(list(str(a)))) print(a)

0.563553

from math import sqrt test = int(input()) for i in range(test): sum = 0 max = int(input()) if max==1: sum = 0 elif max==2: sum += 2 else: sum = sum + 2 for x in range(3,max+1): half = int(sqrt(x)) + 1 if all(x%y!=0 for y in range(2,half)): sum = sum + x print(sum)

0.563192

T = int(input()) ans = [] for _ in range(T): z = int(input()) for k in range(z): s = input() ans.append((z*(z+1))//2) for ele in ans: print(ele)

0.563109

class Solution: def countNumbersWithUniqueDigits(self, n): """ :type n: int :rtype: int """ ls = [1,10,91] mul = 9 res = 0 for i in range(8): mul = 9 m = 9 for j in range(i+2): ...

0.562586

import sys def GRIG(L): LENT = len(L) MINT = 1 GOT = 0 DY = [ [{x: 0 for x in range(0, 10)}, 0, 0] ] for i in L: DY.append([{x: 0 for x in range(0, 10)}, 0, 0]) GOT += 1 for j in range(0, GOT): if DY[j][0][i] == 1: DY[j][0][i] = 0 ...

0.562318

from math import floor,log for _ in range(int(input())): n=int(input()) p=(n*(n+1))//2 f=floor(log(n,2)) p-=2*(2**(f+1)-1) print(p)

0.562201

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline # this math tutorial is boring classy=set() for i in range(19): for j in range(i): for k in range(j): for a in range(10): # a=0 for good measure for b in range(10): for c in range(10): ...

0.562136

for i in range(int(input())): n=int(input()) print(n//2+1)

0.561472

for _ in range(int(input())): n = int(input()) s = input() d = {0: 1} summa, cnt = 0, 0 ans = 0 for i in s: summa += int(i) cnt += 1 k = cnt - summa if k not in d: d[k] = 0 ans += d[k] d[k] += 1 print(ans)

0.560807

Ashish and Vivek play a game on a matrix consisting of $n$ rows and $m$ columns, where they take turns claiming cells. Unclaimed cells are represented by $0$, while claimed cells are represented by $1$. The initial state of the matrix is given. There can be some claimed cells in the initial state. In each turn, a play...

t = int(input()) for _ in range(t): n, m = [int(x) for x in input().split()] grid = [[int(x) for x in input().split()] for _ in range(n)] rows = sum(1 for x in grid if all(y == 0 for y in x)) cols = sum(1 for j in range(m) if all(grid[i][j] == 0 for i in range(n))) res = min(rows, cols) prin...

0.88272

import sys input = sys.stdin.readline t = int(input()) for _ in range(t): n, x = list(map(int, input().split())) x -= 1 degree = [0] * n edges = [(0,0)]*(n-1) for i in range(n - 1): u, v = list(map(int, input().split())) edges[i] = (u-1,v-1) degree[u-1] += 1 degree[...

0.677805

cases = int(input()) for _ in range(cases): rows, cols = map(int, input().split()) if (cols - 1) % 3 == 0 and (rows - 1) % 4 == 0: print('Vanya') elif (cols - 1) % 3 != 0 and (rows - 1) % 4 == 0: print('Tuzik') elif (cols - 1) % 3 == 0 and (rows - 1) % 4 != 0: print('Tuzik') else: if (cols - 1) % 3 == 1 and (row...

0.67659

def issafe(r,c,r1,c1,graph): if (graph[r][c] and graph[r1][c1]): return True return False t=int(input()) for mmmmmm in range(t): n,m=map(int,input().split()) x,y=map(int,input().split()) graph=[[False]*(m+2) for _ in range(n+2)] cost_graph=[[[-1,-1,-1] for __ i...

0.652414

t=int(input()) for _ in range(t): n,m=map(int,input().split()) d={} e={} l=[] for i in range(n): d[i]=0 for i in range(m): e[i]=0 for i in range(n): l.append(input()) for i in range(n): for j in range(m): if l[i][j]=='1': d[i]=1 e[j]=1 #ans=[] if sum(d.values())+sum(e.values())==0: k=[-1]...

0.649665

import sys input = sys.stdin.readline MOD = 10**9 + 7 t = int(input()) for _ in range(t): r, c = list(map(int, input().split())) s = [list(input()) for i in range(r)] cnt_a = 0 flag_kado = False flag_hen = False flag_hen2 = False if s[0][0] == "A" or s[0][c-1] == "A" or s[r-1][0] == "A" o...

0.649208

try: t = int(input()) while(t > 0): t -= 1 n,m = list(map(int,input().split())) a = [list(map(int,input().split())) for _ in range(n)] dp = [[0 for _ in range(m)] for _ in range(n)] ans = [['0' for _ in range(m)] for _ in range(n)] for i in range(n): ...

0.64751

t =int(input()) #no. of test cases while t>0: t=t-1 str=input() size=len(str) pos=str.find('W') left=pos right=size-pos-1 arr = [[0 for i in range(right+1)] for j in range(left+1)] #arr[i,j] = 1 if with i black cells on left and j on right 1st player can win, 0 otherwise. #Recursion: arr[i][j]= or(arr[...

0.63425

import sys def calc(b0, b1, q): if q == 0: return b0 ^ b1 if q == 1: return b0 | b1 if q == 2: return b0 & b1 n, m = list(map(int,sys.stdin.readline().split())) arr1 = {} opt = ['XOR', 'OR', 'AND'] arr2 = [] for j in range(n): a, b = list(map(str,sys.stdin.readline().split(" := "...

0.628709

t=int(input()) for i in range(t): n,m=list(map(int,input().split())) a=list(map(int,input().split())) army=0 if n>m: for i in range(0,m): army+=a[i] for j in range(m,n): army=army-(a[j]/2) if army<0: print('DEFEAT') break else: continue else: print('VICTORY') if n<=m...

0.619843

import random t=int(input()) for testCase in range(t): n=int(input()) array1=[] array2=[] array=[] for i in range(n) : array1.append(list(map(int,input().split()))) for i in range(n) : array2.append(list(map(int,input().split()))) for i in range(n) : array.append(i) # print array2," ",array1 for i in ...

0.618644

def matrix(L,row,col,c): d={} dp=[] for i in range(row+1): temp=[] for i in range(col+1): temp.append([]) dp.append(temp) for i in range(row+1): dp[i][0]=0 for i in range(col+1): dp[0][i]=0 for i in range(1,row+1): for j in range(1,col+1): if L[i-1][j-1]==c: dp[i][j]=min(dp[i][j-1],dp[i-1][...

0.618519

res="" for _ in range(int(input())): ans=0 c=int(input()) for i in range(c): n,m=list(map(int,input().split( ))) ans^=(n+m-2)%3 if ans: res+="MasterChef\n" else: res+="Football\n" print(res)

0.616573

from itertools import compress from string import ascii_uppercase, ascii_lowercase D = {c:i for i,c in enumerate(ascii_uppercase + ascii_lowercase)} def whoIsWinner(moves, con, sz): def gen(i, j): for x in range(1, con): yield ((i, j-x), (i-x, j), (i+x, j), (i-x, j-x), (i+x, j+x), (i+x, j-x), (...

0.61655

import sys input = sys.stdin.readline testcases=int(input()) for testcase in range(testcases): n,m=list(map(int,input().split())) MAP=[input().strip() for i in range(n)] #print(MAP) STR=[[] for i in range(26)] for i in range(n): for j in range(m): if MAP[i][j]!=".": ...

0.615041

class UnionFindVerSize(): def __init__(self, N): self._parent = [n for n in range(0, N)] self._size = [1] * N self.group = N def find_root(self, x): if self._parent[x] == x: return x self._parent[x] = self.find_root(self._parent[x]) stack = [x] while self...

0.612131

import sys input = sys.stdin.readline def search(i,j): L=[] c=0 while CHECK[i][j]==1<<30: L.append((i,j)) CHECK[i][j]=c if MAP2[i][j]=="U": i-=1 elif MAP2[i][j]=="D": i+=1 elif MAP2[i][j]=="R": j+=1 else: ...

0.611079

x = 0 y = 0 for _ in range(int(input())): a, b = list(map(int, input().split())) x += (a > b) y += (b > a) if x > y: print("Mishka") elif y > x: print("Chris") else: print("Friendship is magic!^^")

0.609309

def main(): from sys import stdin, stdout def read(): return stdin.readline().rstrip('\n') def read_array(sep=None, maxsplit=-1): return read().split(sep, maxsplit) def read_int(): return int(read()) def read_int_array(sep=None, maxsplit=-1): return [int(a) for a ...

0.608889

3 def readln(): return list(map(int, input().split())) import sys def return: print(-1) return n, m = readln() mon = [list(input()) for _ in range(n)] hor = [i for i in range(n) if mon[i] != ['.'] * m] rmon = list(zip(*mon)) ver = [j for j in range(m) if rmon[j] != ('.',) * n] mini = hor[0] maxi = hor[-1] min...

0.606453

from sys import stdin input = stdin.readline tests = int(input()) for test in range(tests): n, m = list(map(int, input().split())) a = [[0] * m for _ in range(n)] r = [[int(i) for i in input().split()] for _ in range(n)] c = [[int(i) for i in input().split()] for _ in range(m)] z = [[-1, -1] for _ ...

0.60552

import heapq import sys from collections import defaultdict, Counter from functools import reduce n, m = list(map(int, input().split())) arr = [] for _ in range(n): arr.append(list(map(int, input().split()))) rows = [] for i in range(n): row = set() for j in range(m): row.add(arr[i][j]) rows....

0.602494

try: t = int(input()) while t: t -= 1 n = int(input()) arr = [] obj = {} for i in range(n): x,y = input().split() y = int(y) arr.append([x, y]) if y in obj: obj[y].append(x) else: obj[y] = [x] arr.sort(ke...

0.602442

# CHNGSS.py import sys from random import * n,m,c = list(map(int,input().split())) arr = [[1]*m for i in range(n)]; saved = 0; for i in range(n): for j in range(m): print(1,(i+1),(i+1),(j+1),(j+1),1,25) sys.stdout.flush() a = int(input()) if a == 1 : saved += 1; arr[i][j] = randint(1,25); else: ar...

0.601887

t = input() t = int(t) for _ in range(t): n, m, x, y = input().split() n = int(n) m = int(m) x = int(x) y = int(y) n -= 1 m -= 1 flag = 0 if n % x == 0 and m % y == 0: flag = 1 n -= 1 m -= 1 if n >= 0 and m >= 0: if n % x == 0 and m % y == 0: flag = 1 if flag == 1: print("Chefirnemo") else: ...

0.600947

import sys input = sys.stdin.readline n,m=list(map(int,input().split())) A=[list(map(int,input().split())) for i in range(n)] for i in range(m): #一行目をi-1まで0にする ANSR=[0]*n ANSC=[0]*m for j in range(i): if A[0][j]==1: ANSC[j]=1 for j in range(i,m): if A[0][j]==0: ...

0.599353

import sys def mex(S,W,C,start,end): """Returns Nim-number of S[start:end]""" key=(start,end) try: return C[key] except KeyError: pass A=set() for s in range(start,end): for e in range(start+1,end+1): if S[s:e] not in W: continue A.add(mex(S,W,C,s...

0.598387

t=int(input()) for _ in range(t): n,m=[int(x) for x in input().split()] mat=[] ans=[] for i in range(n+2): l=[] p=[] for j in range(m+2): l.append(0) p.append(1000000000) mat.append(l) ans.append(p) y=int(input()) for i in range(y): a,b=[int(x) for x in input().split()] mat[a][b]=1 ans[a][b]...

0.595028

import sys def spaces(a,n,m,k,visit1,visit2,dist,position): queue = [position] lastedit = [] dist[position[0]][position[1]] = 0 while queue!=[]: point = queue[0] i = point[0] j = point[1] #print 'point',i,j if visit1[i][j]==False: visit1[i][j] = True startx = max(i-k,0) endx = min(i+k,n-1) f...

0.593956

import sys q = int(sys.stdin.readline().strip()) for t in range(0, q): n, m = list(map(int, sys.stdin.readline().strip().split())) L = [] R = [0] * n C = [0] * m for i in range (0, n): L.append(sys.stdin.readline().strip()) for j in range (0, m): if L[i][j] != "*": ...

0.591805

def cons(l): m = 0 res = 0 for v in l: if v: res += 1 if res > m: m = res else: res = 0 return m n, m, q = list(map(int, input().split())) grid = [] curr = [0] * n for i in range(n): grid.append(list(map(int, input().split()))) ...

0.590372

#!/usr/bin/env python3 n, m, k = [int(x) for x in input().split()] row = [(0, -1)] * n col = [(0, -1)] * m for i in range(0, k): t, num, color = [int(x) for x in input().split()] num -= 1 if t == 1: row[num] = (color, i) else: assert t == 2 col[num] = (color, i) for r in row: ...

0.590279

n, m = [int(i) for i in input().split()] A = [] C = [] for i in range(n): B = [int(j) for j in input().split()] A.append(B) C.append(sorted(list(set(B)))) xor = 0 ans = [] for i in range(n): xor ^= A[i][0] ans.append(1) if xor==0: found = 0 for trial in range(n-1, -1, -1): newxor ...

0.589947

import sys input = sys.stdin.readline T = int(input()) for _ in range(T): N, M = list(map(int, input().split())) X = [[] for i in range(3*N)] for i in range(M): x, y = list(map(int, input().split())) x, y = min(x,y), max(x,y) X[x-1].append((y-1, i+1)) MAT = [] IND = [] ...

0.58945

for _ in range(int(input())): n, m = map(int, input().split()) print('W' + 'B' * (m - 1)) print((('B' * (m) + '\n') * (n - 1))[:-1])

0.589339

class Solution: def tictactoe(self, moves: List[List[int]]) -> str: # player one and two moves player_a, player_b = moves[0::2], moves[1::2] # possible wins possible_wins = { 0: [[0, 0], [1, 1], [2, 2]], 1: [[0, 0], [1, 0], [2, 0]], 2: [[0, 1], [1...

0.587118

import numpy as np for _ in range(int(input())): ans = np.float('inf') n, m = (int(x) for x in input().split()) sig = np.zeros((n,m)) img = np.zeros((3*n,3*m)) for row in range(n): sig[row,:] = np.array([int(x) for x in input()]) for row in range(n): img[row+n,m:2*m] = np.array([int(x) for x in input()]) for...

0.586064

# cook your dish here for i in range(int(input())): N=int(input()) ALICE=list(map(int,input().split())) BOB=list(map(int,input().split())) ALICE[ALICE.index(max(ALICE))]=0 BOB[BOB.index(max(BOB))]=0 if sum(ALICE)<sum(BOB): print("Alice") elif sum(BOB)<sum(ALICE): print("Bob") else: print("Draw")

0.58565

import math t = int(input().strip()) for _ in range(t): n, m = list(map(int, input().strip().split())) a = [] v = [-1] * 4 for i in range(n): a.append(input().strip()) for i, ai in enumerate(a): if ai.find('*') > -1: v[2] = i break if v[2] == -1: print(0) else: for i, ai in reversed(list(enu...

0.583655

#!/usr/bin/env python3 # 598D_Igor.py - Codeforces.com/problemset/problem/598/D by Sergey 2015 import unittest import sys from collections import deque ############################################################################### # Igor Class (Main Program) ##########################################################...

0.583362

import sys spoon = [ "SPOON", "spoon" ] def main(): try: tc=int(input()) while tc>0: tc=tc-1 [r,c] = input().split() r=int(r) c=int(c) k=0 flag=0 matrix=[0]*r i=0 while i<r: matrix[i]=input() i=i+1 #Check row wise for m in matrix: for s in m: if s==spoon[0][k...

0.582957

import sys input = sys.stdin.readline n,m=list(map(int,input().split())) ANS=[[-1]*m for i in range(n)] for i in range(n): for j in range(m): if ANS[i][j]==-1: for koma in ["A","B","C","D","E","F"]: for k,l in [(i-1,j),(i,j-1),(i+1,j),(i,j+1)]: if 0<=k<n an...

0.581443

# cook your dish here while True: try: m=int(input()) n=int(m/2) a=m-n sum_even= int(2*(2*n*(n+1)*(2*n+1))/3) sum_odd= int(((4*a*a*a)-a)/3) result=sum_odd+sum_even if result%2==0: print('Ravi') else: print('Jhon') except: break;

0.579811

T=int(input()) for i in range(T): n,m=list(map(int,input().split())) if(m<=2): print("impossible") else: l=[0]*m if(m%2==0): a=m//2 else: a=(m//2)+1 for j in range(a): if(j%2==0): l[j]="a" l[m-j-1]="a" else: l[j]="b" l[m-j-1]="b...

0.578186

import sys input = sys.stdin.readline def main(): n, m = map(int, input().split()) alst = [list(map(int, input().split())) for _ in range(n)] blst = [[0 for _ in range(m)] for _ in range(n)] for i in range(n): for j in range(m): if (i + j) % 2 == alst[i][j] % 2: blst...

0.577761

import math import copy try: import psyco psyco.full() except ImportError: pass def isSharp(ang): return ang > math.pi/4 + 0.00001 def unitVector(p2, p1): d0 = p2[0] - p1[0] d1 = p2[1] - p1[1] d = math.sqrt(d0*d0 + d1*d1) if d != 0: return [d0/d, d1/d] return [0, 0] def compVectors(P): V = [] for i i...

0.577592

def mat(shape, inital_val=None): if len(shape) > 1: return [mat(shape[1:], inital_val) for _ in range(shape[0])] else: return [inital_val] * shape[0] def main(): n, m = [int(x) for x in input().split()] graph = [{} for _ in range(n)] for _ in range(m): v, u, c ...

0.576503

# cook your dish here # cook your dish here n=0;m=0; A=[];B=[]; anscount=0;k=0; def generate(n,m,l): nonlocal anscount if(len(l)==n+m): X=l i,j = 0,0 C=[0 for t in range(n+m)] while((i+j)<(n+m)): if(X[i+j] == 0): C[i+j] = A[i] i = i+1 else: C[i+j] = B[j] j = j+1 ans = len(C) for i i...

0.575667

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time sys.setrecursionlimit(10**7) inf = 10**10 mod = 10**9 + 7 def f(): n,m,k = list(map(int, input().split())) a = [[inf]*(m+2)] g = [] for _ in range(n): a.append([inf] + [_ for _ in input()] + [inf]) ...

0.5756

for _ in range(int(input())): r,c = map(int,input().split()) l = [] for k in range(r): a = list(map(int,input().split())) l.append(a) ans = "Stable" for i in range(r): for j in range(c): p = l[i][j] count=0 if i-1>=0 and j>=0: count+=1 if i>=0 and j-1>=0: count+=1 if i+1<=r-1 and j<...

0.573008

import sys import os from copy import copy import operator import time import datetime import math from math import floor, ceil, sqrt, log import statistics from statistics import mean, median from decimal import Decimal as D from fractions import Fraction as F import functools import random from random import randint,...

0.572661

a = [] b = [] for i in range(3): t = input().split() a.append([int(t[0]), int(t[1]), int(t[2]) ] ) b.append([1, 1, 1]) def add(i, j, w): if 2>=i>=0 and 2>=j>=0: b[i][j] += w for i in range(3): for j in range(3): add(i, j, a[i][j]) add(i-1, j, a[i][j]...

0.572007

t = int(input()) while t> 0: t =t -1 n,k = list(map(int,input().split())) a = [0]*n done = True def swap(z): for j in range(0,n): if a[j] == 0: a[j] = z done = True break else: if a[j] > z: swap(j) a[j] = z else: done = False break for i in range(0,n): for j in ...

0.571855

# cook your dish here # cook your dish here for _ in range(int(input())): n,m=list(map(int,input().split())) atomlist = ['']*n for k in range(m): s=[] s.extend(input().split()[1:]) #print(s) for w in range(n): if str(w) in s: atomlist[w]+="1" else: atomlist[w]+="0" #print(atomlist) print(len...

0.571472

# cook your dish here n,m=map(int,input().split()) L=[] for i in range(n): s=input() L.append(s) cost=[] h2=[0]*(m+1) cost.append(h2) for i in range(n): h=[0] for j in range(m): if(L[i][j]=='0' and (i+j)%2!=0): h.append(1) elif(L[i][j]=='1' and (i+j)%2==0): h.app...

0.570749

from fractions import gcd n, x, y = map(int, input().split()) g = gcd(x, y) x //= g y //= g a = sorted([y * i for i in range(1, x)] + [x * i for i in range(1, y)]) def f(n): n %= x + y if n == 0 or n == x + y - 1: return "Both" return "Vova" if a[n - 1] % x == 0 else "Vanya" for _ in range(n): ...

0.57062

# cook your code here for _ in range(eval(input())): n=eval(input()) ind=0 m=-1 for i in range(n): l=[int(x) for x in input().split()] sc=l[0] for j in range(1,len(l)): sc+=int(l[j]>=4)+int(l[j]>=5)+2*int(l[j]>=6) if sc==m: ind=-2 if sc>m : m=sc ind=i+1 if (ind==-2): print("tie"...

0.568067

for _ in range(int(input())): n = int(input()) arr = [list(input()) for _ in range(n)] res = [] if arr[n-2][n-1] == arr[n-1][n-2]: if arr[0][1] == arr[n-2][n-1]: res.append((1, 2)) if arr[1][0] == arr[n-2][n-1]: res.append((2, 1)) elif arr[0][1] == arr[1][0]: ...

0.567352

from sys import stdin for _ in range(int(stdin.readline())): m, n = list(map(int, stdin.readline().split())) final = [] arr = [] val = 0 extra = 0 for j in range(m): ans = list(map(str, stdin.readline().split())) if ans.count('N') == n: val += 1 else: if val%2 == 0: arr.append(ans) extra += v...

0.567281

from collections import defaultdict from itertools import product def solve(mouse,n,m): # shadow matrix will contains the count of mice which affect (i,j) position # if there is a mice at position (i,j) then in shadow matrix it will affect all four adjacent blocks shadow=[[0 for i in range(m)]for j in ra...

0.566896

from sys import stdin,stdout import math,bisect from collections import Counter,deque,defaultdict L=lambda:list(map(int, stdin.readline().strip().split())) M=lambda:list(map(int, stdin.readline().strip().split())) I=lambda:int(stdin.readline().strip()) S=lambda:stdin.readline().strip() C=lambda:stdin.readline().strip()...

0.566637

t=int(input()) def do(): n,k=map(int,input().split()) s=input() upper=0 lower=0 for i in s: if i.isupper(): upper+=1 else: lower+=1 if lower>k and upper<=k: print('chef') elif(upper>k and lower<=k): print('brother') elif(upper<=k and lower<=k): print('both') else: print('none') return for i ...

0.566507

from networkx import* H,*S=open(0) H,W=map(int,H.split()) g=Graph() a=g.add_edges_from for i in range(m:=H*W): a([[m*2,h:=i//W],[m*2,w:=i%W+m]]*((c:=S[h][w-m])=='S')+[[h,I:=m*3],[w,I]]*(c=='T'),capacity=I) a([[h,w],[w,h]]*(c>'T'),capacity=1) print([-1,f:=minimum_cut(g,m*2,I)[0]][f<I])

0.565742

def f(): n, m = map(int, input().split()) t = [input() for j in range(n)] p = [''.join(i) for i in zip(*t)] if h(p): return 1 i = 0 while i < n and not 'B' in t[i]: i += 1 while i < n: a = t[i].find('B') if a < 0: i += 1 break b = t[i].rfind...

0.56547

try: t=int(input()) for i in range(t): print("Case {}:".format(i+1), end=" ") m, n = map(int,input().split()) x, y = map(int,input().split()) l = int(input()) a=input() destx = a.count("R")-a.count("L") desty = a.count("U")-a.count("D") #print(destx, desty) if (destx<0 or destx>m) or (desty<0 or d...

0.565318

n, m = [int(x) for x in input().split()] list1 = [] list2 = [] for i in range(n): list1.append(input()) for j in range(m): list2.append(input()) list3 = [] for i in range(n - m + 1): y = "" for j in range(m): y += list1[j + i] list3.append(y) list4 = [] for i in range(n - m + 1): y = ...

0.564049

a,b,c,d=list(map(int,input().split())) misha=max(3*a/10,a-a/250*c) vasya=max(3*b/10,b-b/250*d) if misha > vasya: print("Misha") elif vasya > misha: print("Vasya") else: print("Tie")

0.563413

from sys import stdin n,m=list(map(int,stdin.readline().strip().split())) s=[] for i in range(n): s.append(list(map(ord,list(stdin.readline().strip())))) for j in range(m): s[-1][j]=s[-1][j]-97 ct=[tuple(map(int,stdin.readline().strip().split())) for i in range(n)] mc=[[0 for i in range(22)] for j in ra...

0.562441

n, m = map(int, input().split()) fin = [list(input().strip()) for i in range(n)] ans = [['-' for i in range(m)] for j in range(n)] for y in range(n): for x in range(m): if fin[y][x] == '-': continue elif y % 2 == x % 2: ans[y][x] = 'B' else: ans[y][x] = ...

0.56189

import collections class Tower: def __init__(self): indicesOfAlienPath = [] shots = 0 class GameStats: def __init__(self): alienPath = collections.deque() towers = [] waves = collections.deque() DirEOL = 0 DirLeft = 1 DirRight = 2 DirUp = 3 DirDown = 4 def tower_defe...

0.561862

def is_symmetric(a): return a[0][1]==a[1][0] for _ in range(int(input())): def two_ints(): return list(map(int,input().split())) n, m = map(int,input().split()) tiles = [[two_ints(),two_ints()] for i in range(n)] print("YES" if m%2==0 and any([is_symmetric(tile) for tile in tiles]) else "NO")

0.561826

import sys n, m = list(map(int,input().split())) g = [list(map(int,input().split())) for _ in range(n)] for c1 in range(m): for c2 in range(c1, m): ok = True for row in g: row[c1], row[c2] = row[c2], row[c1] cnt = 0 for i in range(m): if row[i] !=...

0.561141

# cook your dish here t=int(input()) i=0 while i<t: a=[] a=input().split() b=[] b=input().split() j=0 c=0 while j<4: if a[j] in b: c+=1 j+=1 if c>=2: print("similar") else: print("dissimilar") i+=1

0.560734

from collections import Counter def input_matrix(): res = tuple((Counter() for _ in range(n + m))) for i in range(n): for j, a in enumerate(map(int, input().split())): res[i + j][a] += 1 return res n, m = list(map(int, input().split())) if input_matrix() == input_matrix(): print(...

0.56038

n = int(input()) nim = [] for i in range(n): a,k = map(int,input().split()) while a%k != 0 and a>k: t = a//k if t+1>=a%k: a -= t+1 else: y = a%k a -= y//(t+1)*(t+1) if a<k: x = 0 elif a%k == 0: x = a//k nim.append(x) ans = 0 for i in nim: ans ^= i if ans == 0: print("...

0.560299

class Dsu: def __init__(self, v, s): self.par = s self.v = v self.dr = [1] * v self.zero = [False] * v self.speed = [] for i in range(v): self.speed.append([]) self.speed[i].append(i) def find(self, i): # if parent[i] == -1: # ...

0.559751

def chessboard(s): N, M = map(int, s.split()) row = ".*" * M return "\n".join( [row[:M] if i&1 else row[1:M+1] for i in range(N)] )

0.559491

for _ in range(int(input())): n, k = map(int, input().split()) a = list(map(int, input().split())) b = list(map(int, input().split())) a = [-1] + a[::-1] mx = a.index(max(a)) dp = [0] * (n + 1) for i in range(1, n + 1): for x in b: if i - x < 0: continue if i - x < mx <= i: dp[i] = 1 else: dp...

0.559279

from operator import itemgetter t=int(input()) for i in range(t): n=int(input()) m,f=list(map(int,input().split())) x=list(map(int,input().split())) my,fy=0,0 check=[0]*n #print check for j in range(n): if x[j]>0 and x[j]%m==0 and check[j]==0: check[j]=1 my+=1 #print check for j in range(n): if x[j]>...

0.55883

import sys input = sys.stdin.readline n,m=list(map(int,input().split())) MAP=[list(input().strip()) for i in range(n)] from collections import deque Q=deque() Q.append([0,0]) while Q: x,y=Q.pop() if x+1<n and MAP[x+1][y]==".": MAP[x+1][y]=1 Q.append([x+1,y]) if y+1<m and MAP[x][y+1]=="....

0.558765

# cook your dish here for a in range(int(input())): N,M=map(int,input().split()) b=[] for o in range(N): b.append(input()) c=[] for d in b: f=[] for e in range(len(d)): if d[e]=='1': f.append(e) c.append(f) i=[] for g in range(len(c)): for h in range(len...

0.557943

import sys input = lambda:sys.stdin.readline().rstrip() h,w=map(int,input().split()) d=w+2 b=[0]*(w+2) for i in range(h): b+=([0]+[int(j=="X") for j in input()]+[0]) b+=([0]*(w+2)) co=sum(b) t=10**10 for i in range(1,h+1): f=0 for j in range(w+2): f+=b[i*d+j] if b[i*d+j]==0 and f: t=min(t,(f-1)//2)...

0.557017

nm = input() nOm = nm.split() n = int(nOm[0]) m = int(nOm[1]) a = b = [] for i in range(0, n): a.append(input()) for i in range(0, m): b.append(input()) if(n == 2 and m == 2 and a[0] == '-1 0') or (n == 2 and m == 3 and a[0] == '-1 0') or (n == 3 and m == 3 and a[0] == '-3 -4') or ( n == 1000 and m == 1000 and a[...

0.556407

def solve(a, b): alice = sum(i > j for i, j in zip(a, b)) bob = sum(j > i for i, j in zip(a, b)) if alice == bob: words = 'that looks like a "draw"! Rock on!' elif alice > bob: words = 'Alice made "Kurt" proud!' else: words = 'Bob made "Jeff" proud!' return '{},...

0.55561

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline n,m=list(map(int,input().split())) realg=[list(map(int,input().split())) for _ in range(n)] g=[[0]*m for _ in range(n)] ans=[] # get differences f1=min([realg[0][i] for i in range(m)]) for i in range(m): for _ in range(realg[0][i]-f1): ans...

0.554418

def flatten(grid): k = len(grid[0]) // 2 seek = list(range(2*k + 2)) + list(range(2*k + 2, 4*k + 2))[::-1] return [seek[v] for v in grid[0] + grid[1][::-1] if v] def solve(grid): grid = list(map(list, grid)) k = len(grid[0]) // 2 flat = flatten(grid) m = { 'L': 'l'*2*k + 'u' + 'r'*...

0.553876

import sys m, n = map(int, input().split()) a = [] for _ in range(m): a.append(list(map(int, input().split()))) b = [[1]*n for _ in range(m)] for i in range(m): for j in range(n): if(a[i][j] == 0): b[i] = [0]*n for k in range(m): b[k][j] = 0 for i in range(m): for j in range(n): if(a[i][j] == 1): g...

0.553061

n = int(input()) a, b = input(), input() t = {i + j: 0 for i in '01' for j in '01'} for i in range(2 * n): t[a[i] + b[i]] += 1 d = t['11'] & 1 d += (t['10'] - t['01'] + 1 - d) // 2 if d > 0: d = 1 elif d < 0: d = 2 print(['Draw', 'First', 'Second'][d])

0.552933

t= int(input()) for _ in range(t): n = int(input()) ar = [] y = [] for i in range(n): ar.append( list(map(int,input().split())) ) y.append(ar[-1][1]) ar[-1].append(i) y.sort() mny = y[0] mxy = y[-1] ar.sort() ssx,ssy,ssi = ar[0] bbx,bby,bbi = ar[-1] sbx,sby,sbi = ar[0] bsx,bsy,bsi = ar[-1] for ...

0.552756

import math from collections import deque def main(): n, m, k = list(map(int, input().split())) grid = ["" for _ in range(n)] x, y = 0, 0 for i in range(n): grid[i] = input() if 'X' in grid[i]: x, y = i, grid[i].index('X') if k % 2 == 1: print("IMPOSSIBLE") return dx = [1, 0, 0, -1] dy = [0, -1, ...

0.552405

import sys user_input = sys.stdin.readline().split() T = int(user_input[0]) for j in range(T) : var = sys.stdin.readline().split() N = int(var[0]) M = int(var[1]) if (N%M)%2 : print("ODD") else : print("EVEN")

0.55216

input = __import__('sys').stdin.readline MIS = lambda: map(int,input().split()) n, m = MIS() A = input().split() B = input().split() for TEST in range(int(input())): y = int(input())-1 print(A[y%len(A)] + B[y%len(B)])

0.552155

n=int(input()) for i in range(n): k,x=map(int,input().split()) l=list(map(int,input().split())) f,e,o=0,0,0 for i in l: if(i%2==0): e+=1 else: o+=1 if(o<=x//2): f=1 elif(e<=x//2): if((k-x)%2!=0): f=0 else: f=1 else: if(x%2==0): f=1 ...

0.551852

import sys def joseph(k, n=6): if k==0: k = 1 x = 0 for i in range(2,n+1): x = (x+k)%i return x FLAMES = ['FRIENDS', 'LOVE', 'ADORE', 'MARRIAGE', 'ENEMIES', 'SISTER'] nCase = int(sys.stdin.readline()) for _ in range(nCase): a = ''.join(sys.stdin.readline().split()) b = ''.join(sys.stdin.readline().split())...

0.551807

def main(): n, m, h = map(int, input().split()) row = list(map(int, input().split())) col = list(map(int, input().split())) mat = [list(map(int, input().split())) for _ in range(n)] for i in range(n): for j in range(m): if mat[i][j]: mat[i][j] = min(col[i], row[j]...

0.55122

def dfs(x, y): vis.append((x, y)) y += 1 nonlocal flag if flag or str.isalpha(grid[x][y]): return if y >= n - 1: flag = True return # stay idle if not str.isalpha(grid[x][y + 1]) and not str.isalpha(grid[x][y + 2]) and (x, y + 2) not in vis: dfs(x, y + 2)...

0.551056

t=eval(input()) while t: t=t-1 s1=input().lower() s2=input().lower() res="equal" for i in range(len(s1)): if(s1[i]!=s2[i]): res="first" if s1[i]<s2[i] else "second" break print(res)

0.550555

n, m = list(map(int, input().split())) A = [input().split() for i in range(n)] T = False for i in range(n): for j in range(m): if A[i][j] == '1' and (i == 0 or j == 0 or i == n - 1 or j == m - 1): T = True if T: print(2) else: print(4)

0.55049

'''input 3 3 >>> <<< >>> ''' #print(input().split()) n, m = list(map(int, input().split())) #return g = [] for i in range(n): g += [input()] # print(g) memo = {} def dfs(u): if u not in memo: memo[u] = res = 1 if u < n: for v in range(m): if g[u][v] == '>': res = max(res, dfs(n + v) + 1) for v i...

0.54984

import random import math def set_color(game, color): color_count[game[0]][game[2]] -= 1 color_count[game[1]][game[2]] -= 1 game[2] = color color_count[game[0]][game[2]] += 1 color_count[game[1]][game[2]] += 1 def fix(node): minimum = math.inf maximum = 0 for i in range(k): mi...

0.549672

t = int(input()) for _ in range(t): n, m = [int(x) for x in input().split()] grid = [list(input()) for _ in range(n)] has_good = any('G' in l for l in grid) if not has_good: print("Yes") continue impossible = False for i in range(n): for j in range(m): if ...

0.549512

You are given a colored permutation $p_1, p_2, \dots, p_n$. The $i$-th element of the permutation has color $c_i$. Let's define an infinite path as infinite sequence $i, p[i], p[p[i]], p[p[p[i]]] \dots$ where all elements have same color ($c[i] = c[p[i]] = c[p[p[i]]] = \dots$). We can also define a multiplication of ...

from sys import stdin input = stdin.readline q = int(input()) for rwerew in range(q): n = int(input()) p = list(map(int,input().split())) c = list(map(int,input().split())) for i in range(n): p[i] -= 1 przyn = [0] * n grupa = [] i = 0 while i < n: if przyn[i] == 1: i += 1 else: nowa_grupa = [i] j...

0.760271

T = int(input()) M = 10 ** 9 + 7 for _ in range(T): N = int(input()) A = list(map(int, input().split())) if N == 1: print(0) continue B = {} C = {} for i in range(N - 1): u, v = input().split() u = int(u) - 1 v = int(v) - 1 if u not in B: B[u] = [] if v not in B: B[v] = [] B[u].appe...

0.696469

import math def egcd(a, b): if a == 0: return (b, 0, 1) else: g, y, x = egcd(b % a, a) return (g, x - (b // a) * y, y) def modin(a, m): g, x, y = egcd(a, m) return x % m # def gcdexten(a,b,x,y): # if a == 0: # x = 0 # y = 1 # return b # x1 = y1 = 0 # gcd = gcdexten(b%a,...

0.686625

d = 10**9 + 7 t = int(input()) while t: t-=1 n =int(input()) p =list(map(int, input().strip().split())) a =list(map(int, input().strip().split())) b =list(map(int, input().strip().split())) ans = 1 for i in range(n): c = a[i] - b[i] + 1 tmp = (( pow(p[i],b[i]...

0.681494

# cook your dish here import math; from math import gcd,sqrt,floor,factorial,ceil from bisect import bisect_left,bisect_right import bisect; import sys; from sys import stdin,stdout import os sys.setrecursionlimit(pow(10,7)) import collections from collections import defaultdict,Counter from statistics import median # ...

0.676356

t=int(input()) for q in range(t): n=int(input()) x=list(map(int,input().split())) dic={} dic2={} for i in range(n): dic2[x[i]]=1 #print dic2 if len(dic2)==n: n+=2 print((n*(n-1)*(n-2)*(n-3))/24) continue counter=0 for i in range(n-1): if x[i] in dic: dic[x[i]]+=1 else: dic[x[i]]=1 for j in...

0.665813

import sys sys.setrecursionlimit(10**8) MOD = 10**9+7 fac = [0]*(10**5+1) def pre() : fac[0] = 1 for i in range(1,10**5+1) : fac[i] = fac[i-1]*i fac[i] = fac[i]%MOD def dfs(gp , vertex , visited , deg , ans) : visited[vertex] = 1 stack = [] stack.append(vertex) while len(stack)>0 : vertex = stack.pop() ...

0.655832

#=============================================================================================== #importing some useful libraries. from fractions import Fraction import sys import os from io import BytesIO, IOBase from functools import cmp_to_key # from itertools import * from heapq import * from math import gcd,...

0.655384

import sys import heapq import re from itertools import permutations from bisect import bisect_left, bisect_right from collections import Counter, deque from fractions import gcd from math import factorial, sqrt, ceil from functools import lru_cache, reduce INF = 1 << 60 MOD = 1000000007 sys.setrecursionlimit(10 ** 7) ...

0.654661

from collections import Counter from math import factorial def nc3(n): a=factorial(n) b=factorial(n-3) return ((a)/(b*6)) def rem(s,k): t=-1 x=-1 for i in range(len(s)): if s[i][0]>2 and s[i][1]<=k: if s[i][0]>3: ch=(nc3(s[i][0])-nc3(s[i][0]-1))/s[...

0.651829

'''input 1 3 1 2 1 3 1 2 3 ''' import sys sys.setrecursionlimit(1000000) for _ in range(eval(input())): C=[] n=eval(input()) for i in range(n): C.append([]) for i in range(n-1): a,b=[int(x)-1 for x in input().split()] C[a].append(b) C[b].append(a) cnt=0 Co=[bin(int(x)).count("1") for x in input().split()]...

0.65058

import sys readline = sys.stdin.readline T = int(readline()) MOD = 998244353 Ans = [None]*T for qu in range(T): N, K = map(int, readline().split()) A = [0] + list(map(int, readline().split())) + [0] B = list(map(int, readline().split())) C = [None]*(N+1) for i in range(1, N+1): C[A[i]] = i...

0.647312

from math import * def r1(t): return t(input()) def r2(t): return [t(i) for i in input().split()] for _ in range(r1(int)): n = r1(int) a = r2(int) g = True for i in range(n): if a[i] != i + 1: g = False break if g: print(0) continue g =...

0.643833

d = {} for i in range(26): char = chr(i+ord('a')) d[char] = [] for i in range(26): char = chr(i+ord('a')) temp = list(map(int,input().strip().split())) for j in range(26): if (temp[j] == 1): follow= chr(j+ord('a')) d[follow].append(char) def f(char,i,n,count): if (i==n): return count+1 else: ans ...

0.643549

t=int(input()) for k in range(t): n=int(input()) l=[int(i) for i in input().split()] m={} count=1 for i in range(1,n): if l[i]==l[i-1]: count+=1 else: if l[i-1] not in m: m[l[i-1]]=(count*(count+1))/2 else: ...

0.642136

import sys def I(): return sys.stdin.readline().rstrip() class Heap: def __init__( self ): self.l = [ -1 ] self.n = 0 def n( self ): return self.n def top( self ): return self.l[ 1 ] def ins( self, x ): self.l.append( x ) n = len( self.l ) - 1 ...

0.641065

import sys from collections import deque input=sys.stdin.readline for _ in range(int(input())): n=int(input()) edge=[[] for i in range(n)] for i in range(n-1): u,v=list(map(int,input().split())) edge[u-1].append(v-1) edge[v-1].append(u-1) m=int(input()) p=list(map(int,input...

0.64057

import sys input = sys.stdin.readline MOD = 10 ** 9 + 7 t = int(input()) for _ in range(t): n, p = list(map(int, input().split())) l = list(map(int, input().split())) if p == 1: print(n % 2) else: l.sort(reverse = True) curr = l[0] out = 0 real = True f...

0.633952

import sys import random from fractions import Fraction from math import * def input(): return sys.stdin.readline().strip() def iinput(): return int(input()) def finput(): return float(input()) def tinput(): return input().split() def linput(): return list(input()) def rinput(): return ...

0.629309

import sys input = sys.stdin.readline from collections import defaultdict class Unionfind: def __init__(self, n): self.par = [-1]*n self.rank = [1]*n def root(self, x): r = x while not self.par[r]<0: r = self.par[r] t = x ...

0.62857

for i in range(int(input())): n = int(input()) c = list(map(int, input().split())) d = {} d[0] = -1 parity = 0 ans = 0 for i in range(n): parity ^= 1 << (c[i]-1) for t in range(30): x = parity^(1<<t) if(x in d.keys()): ans = max(ans, i - d[x]) if parity not ...

0.62847

import sys, re from collections import deque, defaultdict, Counter from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians from itertools import accumulate, permutations, combinations, product from operator import itemgetter, mul from copy import deepcopy from string import ascii_lowercase, ascii_uppercase...

0.627806

from collections import * def go(): n,s,t=int(input()),input(),input() if Counter(s)!=Counter(t): return -1 ans=0 for i in range(n): k=0 for j in range(i,n): while k<n and s[k] != t[j]: k += 1 if k == n: break k += 1 ans = max(ans, j-i+1) return n-ans for _ in range(int(input())): print(go())

0.626611

import sys def powc(x,n,m): res = 1 xx=x while n: if n&1: res = (res*xx)%m xx=xx*xx%m n >>= 1 return res def circles(u): r = 0 S = [(u,-1,0)] Visited[u] = 0 for s in S: for e in V[s[0]]: if e[0] != s[1]: if Visited[e[0]]==-1: Visited[e[0]] = s[2]^e[1] ...

0.625561

import os from io import BytesIO import sys import threading sys.setrecursionlimit(10 ** 9) threading.stack_size(67108864) def main(): # input = BytesIO(os.read(0, os.fstat(0).st_size)).readline def ad(i, j): nonlocal g if j in g[i]: g[i].remove(j) g[j].remove(i) ...

0.624927

import sys input = sys.stdin.readline from collections import deque t=int(input()) for tests in range(t): n=int(input()) a=input().strip() b=input().strip() Q=deque(a) L=[] while Q: L.append(Q.popleft()) if Q: L.append(Q.pop()) ANS=[] for i in range(n):...

0.624641

N=100001 fac=[0 for i in range(N)] for i in range(1,N): for j in range(i,N,i): fac[j]+=1 def gcd(a,b): if a<b: a,b=b,a while b>0: a,b=b,a%b return a def ctt(A,B,C): la=fac[A] lb=fac[B] lc=fac[C] ab=gcd(A,B) ac=gcd(A,C) bc=gcd(B,C) a...

0.621938

def fun(a,cur,n,cnt): if cur>=n-1: return for i in range(cur,n-1): if i<n-2: if a[i]>0 and a[i+1]>0: a[i]-=1 a[i+1]-=1 a[i+2]+=1 cnt[0]=(cnt[0]+1)%1000000007 fun(a,i,n,cnt) a[i]+=1 ...

0.621359

try: t=int(input()) for a in range(t): l=input().split() n=int(l[0]) m=int(l[1]) d={} s=0 for b in range(m): l1=input().split() i=int(l1[0]) j=int(l1[1]) k=int(l1[2]) for c in range(i,j+1): if c not in d: d[c]=10 for c in range(i,j+1): d[c]=d[c]*k for i in d: s=s+d[i] ...

0.620977

n = int(input()) for i in range(n): count = 0 k = input() x = list(k) kk = input() y = list(kk) for j in y: for jj in x: if(j==jj): count = count+1 break print(count)

0.61982

from math import factorial def lol(n): if n == 1: yield [0] yield [1] else: for p in lol(n - 1): p.append(0) yield p p[-1] = 1 yield p p.pop() def sp(g1, g2, g3, f): if g1 == 0: if g2 == g3: return 2 ...

0.619008

f = 5003*[0] modn = 1000000007 def qPow(a, b): nonlocal modn res = 1 while b > 0: if (b & 1) == 1: res = res * a % modn a = a * a % modn b = b >> 1 return res def getF(): nonlocal f f[0] = 1 for i in range(1, 5001): f[i] = f[i-1] * i def __starting_point(): getF() T = int(input()) while T > 0...

0.618715

def treeProduct(num, h, root, ch): if ch >= h: return num[root] left = (root * 2) + 1 right = (root * 2) + 2 ret1 = treeProduct(num, h, left, ch + 1) ret2 = treeProduct(num, h, right, ch + 1) return num[root] * max(ret1, ret2) def main(): n = int(input()) while n!=0: line = str(input()) s = line.split...

0.618585

# import all important libraries and inbuilt functions from fractions import Fraction import numpy as np import sys,bisect,copyreg,copy,statistics,os from math import * from collections import Counter,defaultdict,deque,OrderedDict from itertools import combinations,permutations,accumulate from numpy.linalg import ...

0.618246

# cook your dish here import numpy as np tests = int(input()) for _ in range(tests): n = int(input()) weights = [int(j) for j in input().split()] edges = [[0] for _ in range(n-1)] for i in range(n-1): edges[i] = [int(j)-1 for j in input().split()] vertex_set = [[] for _ in range(n)] for i in ran...

0.617348

# cook your dish here T = int(input()) for i in range(T): N,data,D,People = int(input()),list(map(int,list(input()))),int(input()),list(map(int,input().split())) data.insert(0,"|"),data.append("|") infected = [] for i in range(1,N+1): if(data[i]==1): infected.append(i) ...

0.617333

T=int(input()) # cook your dish here for i in range(T): n=list(map(int,input().split())) a=n[0] b=n[1] c=n[2] l=[] A=list(map(int,input().split())) B=list(map(int,input().split())) C=list(map(int,input().split())) for i in range(b): for j in range(a): for k in ra...

0.616708

def sort_str(s): o = [] for c in s: o.append(c) o.sort() return "".join(o) def find_ana(s): if len(s) <= 1: return 0 h = {} c = 0 for i in range(len(s)): for j in range(i+1, len(s)+1): t = sort_str(s[i:j]) if t in h: c += h[t] ...

0.615635

for _ in range(int(input())): n,s = int(input()),input().strip() previ,num,_s,dic = s[0],0,[],{} for i in s: if previ == i: num+=1 continue _s.append((previ, num)) if previ not in dic or dic[previ]<num:dic[previ] = num previ,num = i,1 _s.append((previ, num)) if previ ...

0.615562

def det(s, i, j): ans = 0 curr = i for a in s: if a == curr: ans += 1 if curr == i: curr = j else: curr = i if i == j: return ans return ans // 2 * 2 for t in range(int(input())): s = list(map(int, list(input()))) ans = 0 for i in range(...

0.614934

A = [0] * 100001 M = 1000000007 def nCk(n, k): if k ==0 or k ==n: return 1 r = (A[n-k]*A[k])%M x = (A[n]*pow(r, M-2, M))%M return x for _ in range(int(input())): n, k = list(map(int, input().split())) for i in range(n-1): u,v = input().split() summ = 0 A[0] = 1 for i in range(1, len(A)): A[i] = (i*A[i-...

0.611713

# cook your dish here import sys mod_val = 1000000007 rang = [0]*101 pow_cache = [0]*102 multisets = {} def mod_pow(base, pow): result = 1 while pow: if pow&1: result = (result*base) % mod_val base = (base*base) % mod_val pow = pow>>1 return result def precalculate(): for i in range(1, 102): pow_ca...

0.611093

import sys input = lambda: sys.stdin.readline().rstrip() T = int(input()) for _ in range(T): N = int(input()) A = [int(a) for a in input().split()] if max(A) == min(A): print(1) print(*([1] * N)) elif N % 2 == 0: print(2) print(*([1, 2] * (N // 2))) else: ...

0.60972

t=eval(input()) for i in range(0,t): x=input() nm=x.split(' ') nm[0]=int(nm[0]) nm[1]=int(nm[1]) csoint=[] lsoint=[] csofloat=[] lsofloat=[] for j in range(0,nm[0]): a=input() b=a.split(' ') b[0]=int(b[0]) b[1]=int(b[1]) csoint.append(b[0]) ...

0.60966

from math import * t = int(input()) for _ in range(t): n = int(input()) a = [int(d) for d in input().split()] odd,even = 0,0 for i in range(n): if bin(a[i]).count("1")%2 == 1: odd += 1 else: even +=1 total = 0 if odd >= 3 and even >= 2: total += (odd*(odd-1)*(odd-2))//...

0.609018

#!usr/bin/env python3 from collections import defaultdict,deque from heapq import heappush, heappop import sys import math import bisect def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline()) def LS():return [list(x) for x in sys.stdin.readline().split()] def S(): ...

0.608494

for _ in range(int(input())): num=int(input()) arr=list(map(int,input().split())) dp=[0]*num dp[0]=1 ans=1 j=0 for i in range(1,num): j=i+1 count=1 dp[i]=dp[i-1]%1000000007 if i-2>=0 and arr[i-2]==2: dp[i]+=dp[i-2]%1000000007 if i-3>=0 and arr[i-3]==2: dp[i]+=dp[i-3] ans+=dp[i]...

0.607447

def dfs(node): nonlocal adj,leaf val=0 flag=0 for i in adj[node]: x= dfs(i) val+=x if x==0: flag=1 leaf+=val-val%3 if val%3==0 and flag==0: return 1 else: return 0 for _ in range(int(input())): n=int(input()) adj=[[] for i in range(n+2)] arr=[int(i) for i in input().split()] leaf=0 #print(adj) ...

0.607271

t = int(input()) for _ in range(t): n = int(input()) a = {} for i in range(n): l = input() if l not in a: a[l] = 1 else: a[l] += 1 done = [] ans = 0 for i in a: if a[i] != 0: temp = [x for x in i.sp...

0.605576

#code snippet reference:http://www.geeksforgeeks.org/searching-for-patterns-set -2-kmp-algorithm/ def KMPMatch(pattern, string): M = len(pattern) N = len(string) nonlocal ans lps = [0]*M j = 0 LPSCompute(pattern, M, lps) i = 0 while i < N: if pattern[j] == string[i]: i+=1 j+=1 if j==M: ans+...

0.605455

def main(): while True: [n, m] = [int(i) for i in input().split()] if n == m and n == 0: break cache = {} for i in range(n): dna = input().rstrip('\n') if dna in cache: ...

0.603206

import sys n = int(sys.stdin.readline().strip()) s = sys.stdin.readline().strip() dp = [[-1] * (n + 1) for i in range(26)] for c in range(26): for j in range(n): tst = 1 if s[j] == chr(c + 97) else 0 dp[c][1 - tst] = max(dp[c][1 - tst], 1) for k in range(j + 1, n): if s[k] ...

0.60232

import sys input = sys.stdin.readline t=int(input()) for testcases in range(t): n=int(input()) LIST=[input().strip() for i in range(n)] SET=set() ANS=0 CHANGE=set() for i in range(n): if LIST[i] in SET: ANS+=1 CHANGE.add(i) else: SET.add(LIS...

0.602305

def fact(n): if n<2: return 1 return n * fact(n-1) def ncr(n, r): return fact(n)// (fact(r)*fact(n-r)) t=int(input()) for _ in range(t): n, k = list(map(int, input().split())) a = list(map(int, input().split())) a.sort() count_z = a.count(a[k-1]) count_z_seq = a[:k].count(a[k-1]) print(ncr(count_z, co...

0.601739

import sys input = sys.stdin.readline t = int(input()) for _ in range(t): n = int(input()) ab = [list(map(int,input().split())) for i in range(n-1)] graph = [[] for i in range(n+1)] deg = [0]*(n+1) for a,b in ab: graph[a].append(b) graph[b].append(a) deg[a] += 1 deg[b] += 1 pnt = [max(deg[i]...

0.601427

import sys from collections import Counter readline = sys.stdin.readline N = int(readline()) A = list(map(int, readline().split())) geta = 10**9+7 Q = int(readline()) C = Counter() Ans = [sum(A)] + [0]*Q A = [0] + A table = [geta] + [0]*N for qu in range(1, Q+1): s, t, u = list(map(int, readline().split())) ...

0.600828

import sys from collections import defaultdict from copy import copy MOD = 10**9 + 7 R = lambda t = int: t(input()) RL = lambda t = int: [t(x) for x in input().split()] RLL = lambda n, t = int: [RL(t) for _ in range(n)] # primes up to n def primes(n): P = [] n = int(n) U = [1] * (n+1) p = 2 ...

0.599922

# encoding: utf-8 from sys import stdin def solve(a): # root node of tries denotes empty stack stack = [None] node_stack = [[1, {}]] trie = node_stack[-1] counter = 0 for i in range(len(a)): el = a[i] if len(stack) == 0 or stack[-1] != el: current_node = node_sta...

0.599522

f = lambda: map(int, input().split()) m = 1000000007 d, n = f() t = list(f()) p = [[] for i in range(n)] for j in range(n - 1): u, v = f() u -= 1 v -= 1 p[u].append(v) p[v].append(u) def g(u, x, a, b, q): k = 1 for v in p[u]: if a < t[v] <= b or t[v] == a and v > q: if ...

0.599428

import sys from collections import deque input = sys.stdin.readline t = int(input()) for _ in range(t): n, m, a, b, c = list(map(int,input().split())) p = list(map(int, input().split())) p.sort() pref = [0] curr = 0 for i in range(m): curr += p[i] pref.append(curr) adj...

0.599176

n, m = list(map(int, input().split())) p = list(map(int, input().split())) c = list(map(int, input().split())) d = int(input()) k = [] for i in range(d): k.append(int(input())) vis = [False for i in range(m+1)] match = [-1 for i in range(m+1)] def dfs(u: int) -> bool: for v in e[u]: if not vis[v]: ...

0.598538

for _ in range(int(input())): n = int(input()) P = list(map(int, input().split())) ans = [0] * n for i in range(n): if ans[i] == 0: now = i cnt = 0 cll = [] while True: now = P[now] - 1 cnt += 1 cll.a...

0.598039

# -*- coding: utf-8 -*- import sys from operator import add def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c] * b for i in range(a)] def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in r...

0.597948

# cook your dish here from sys import stdin import functools def gcd(a, b): if (a == 0): return b return gcd(b % a, a) MAX=10001 def func(ind, g, dp, n, a): if (ind == n): if (g == 1): return 1 else: return 0 if (dp[ind][g] != -1): return dp[ind][g] ans = (func(ind + 1, g, dp, n, a) +...

0.596962

T= int(input()); for i in range(T): n,k = list(map(int,input().split())); s=list(map(int,input())); if k==1: s_0 ={}; s_1={}; c0=0; c1=0; for j in range(n): if(j%2==0): s_1[j]=1; s_0[j]=0; else: s_1[j]=0; s_0[j]=1; for j in range(n): if(s_0[j]-s[j]!=0): c0+=1; if(s_1[j]-...

0.596231

for _ in range(int(input())): n=int(input()) a=input() b=input() l=[] flag=0 for i in range(n): if b[i]!=a[i]: if b[i] in a and b[i]<a[i]: l.append(b[i]) else: flag=1 break if flag==1: print(-1) else: if l==[]: print(0) else: l = sorted(list(set(l)), reverse = True) print(len(...

0.596217

import sys input = lambda: sys.stdin.readline().rstrip() T = int(input()) for _ in range(T): N = int(input()) A = [ord(a) - 97 for a in input()] B = [ord(a) - 97 for a in input()] X = [[0] * 20 for _ in range(20)] for a, b in zip(A, B): X[a][b] = 1 if a > b: print(-1) ...

0.594124

t = int(input()) for ti in range(t): n = int(input()) lri = [None for _ in range(n)] for _ in range(n): li, ri = list(map(int, input().split())) lri[_] = (li, ri, _) lri.sort() t = [None for _ in range(n)] ct, t[lri[0][2]], eg = 1, 1, lri[0][1] for i in range(1, n): if lri[i][0] <= eg: t[lri[i][2...

0.593983

import sys def _r(*conv) : r = [conv[i](x) for i, x in enumerate(input().strip().split(' '))] return r[0] if len(r) == 1 else r def _ra(conv) : return list(map(conv, input().strip().split(' '))) def _rl() : return list(input().strip()) def _rs() : return input().strip() def _a(k, *v) : return all(x == k for ...

0.593639

for _ in range(int(input())): n,m=map(int,input().split()) print("Case "+str(_+1)+":") for i in range(m): s=input() ls=len(s) if ls>n: print("0") else: k=(n-ls+1) print((k*pow(26,n-ls,1000000007))%1000000007)

0.59324

def multiple_input(): return map(int, input().split()) def list_input(): return list(map(int, input().split())) mod = int(1e9) + 7 for _ in range(int(input())): n, m = multiple_input() a = list_input() a.sort() max_level = a[-1] + 1 levels = [0] * max_level levels[0] = 1 for i in a: levels[i] += 1 ans = 1...

0.593128

fact = [] fact.append(1) for i in range(1,100001): fact.append((i*fact[i-1])%1000000007) def power(a,b,p): x=1 y=a while(b>0): if(b%2 == 1): x=(x*y) if(x>p): x=x%p y=(y*y) if(y>p): y=y%p b=b/2 return x def inverse(N,p): return power(N,p-2,p) def combination(N,R,p): return (fact[N]*((...

0.592915

for t in range(int(input())): s = input() r = input() diff = list() index = list() cnt = 0 for i in range(len(s)): if s[i] != r[i]: cnt += 1 index.append(i) for i in range(1, len(index)): diff.append(index[i] - index[i - 1] - 1) diff.sort() fmin = cnt ** 2 oper = cnt ; moves = cnt for i in diff: ...

0.591942

t=int(input()) no_of_chars = 256 # Function to find smallest window # containing all characters of 'pat' def findSubString(string, pat): len1 = len(string) len2 = len(pat) if len1 < len2: return 0 hash_pat = [0] * no_of_chars hash_str = [0] * no_of_chars for i in...

0.590797

class Graph: def __init__(self, n_vertices, edges, directed=True, weighted=False): self.n_vertices = n_vertices self.edges = edges self.directed = directed self.weighted = weighted @property def adj(self): try: return self._adj except AttributeE...

0.59032

import sys import math import cProfile DEBUG = False def log(s): if DEBUG and False: print(s) def calc_dmg(num, arr): maximum = 0 if num - len(arr) < 0: maximum = max(arr) return sum(arr) + maximum if DEBUG: sys.stdin = open('input.txt') pr = cProfile.Profile() pr....

0.589545

# cook your dish here mod = 10**9 + 7 from math import gcd def fac50(): f = [0]*51 f[0] ,f[1] = 1,1 for i in range(1,51):f[i] = (f[i-1]*i)%mod return f def gcd110(): gc = [[0]*111 for i in range(111)] for i in range(111): for j in range(111):gc[i][j] = gcd(i,j) return gc factorials,g...

0.589503

from itertools import permutations as p def disc(a,b): for ai in a: for bi in b: if ai==bi: return False return True for i in range(eval(input())): n = eval(input()) arr = list(map(int,input().split())) perms = list(p(arr)) m = eval(input()) offer = {} for i in range(m): dup = list(map(int,input().s...

0.588757

import sys input = sys.stdin.readline from collections import deque t=int(input()) for testcaess in range(t): n,m,a,b=list(map(int,input().split())) E=[[] for i in range(n+1)] for i in range(m): x,y=list(map(int,input().split())) E[x].append(y) E[y].append(x) USE1=[0]*(n+1) ...

0.587839

def eq_solve(v0, v1, u0, u1): den = u0 - v0 num = u1 - v1 if den != 0: return num / den return 1 def solve(p, q, r, a, b, c, rs): if p == a and q == b and r == c: return rs if rs >= 2: return 3 res = 3 adds = [a - p, b - q, c - r] muls = [] ...

0.587579

k = int(input()) MOD = 10 ** 9 + 7 antithree = pow(3, MOD - 2, MOD) antitwo = pow(2, MOD - 2, MOD) power = 1 parity = False for t in map(int, input().split()): power *= t power %= MOD - 1 if t % 2 == 0: parity = True q = pow(2, power, MOD) * antitwo q %= MOD if parity: p = (q + 1) * antithree ...

0.585721

# cook your dish here from collections import Counter from math import factorial for _ in range(int(input())): s=input() c=Counter(s) k=factorial(len(s)) for value in c.values(): if value>1: k=k//factorial(value) print(k%(10**9+7))

0.585476

for _ in range(int(input())): n=int(input()) s=list(input()) coord=list(map(int,input().split())) p=0 i=0 h=[] for i in range(0,n): if s[i]=='1': h.append(i) if h[0]!=0: p=p+coord[h[0]]-coord[0] if h[len(h)-1]!=n-1: p=p+coord[n-1]-coord[h[len(h)-1]] for j in range(0,len(h)-1): if h[j]+1==h[j+1]: ...

0.584591

import sys mod = 10**9 + 7 for _ in range(int(input())): x = int(input()) s = list(map(int, input())) ans = len(s) for i in range(1, x+1): ans = (i + (ans-i) * s[i-1]) % mod r = len(s) for _ in range(s[i-1]-1): if len(s) < x: s += s[i:r] e...

0.5844

t=int(input()) count=[] for i in range(t) : s = input() a,b,c,n = s.split() n=int(n) d = int(a+b*n+c,2) count.append(0) while(d>0) : d=(d&(d+1))-1 count[i]+=1 for i in range(t) : print(count[i])

0.583541

# cook your dish here import bisect for _ in range(int(input())): w,k=map(str, input().split()) k=int(k) n=len(w) w=list(w) w.sort() w.append('0') c=1 l=0 l1=[] l2=[] for i in range(1, n+1): if w[i]==w[i-1]: c+=1 else: a=bisect.bisect_left(l1, c) if a==l: l1.append(c) l2.append(1) l...

0.583092

# cook your dish here for u in range(int(input())): n=int(input()) l=list(map(int,input().split())) d=[] dd=[] s=1 for i in range(n-1): s=l[i] d.append(s) dd.append([i,i]) for j in range(i+1,n): s=s*l[j] d.append(s) dd.append([i,j]) d.append(l[n-1]) dd.append([n-1,n-1]) k=len(d) m=max(d) x,y...

0.582717

MAXX = 10**9+1 N = eval(input()) nodes = list(map(int, input().split(" "))) edges = [set() for _ in range(N)] for _ in range(N-1): a, b = list(map(int, input().split(" "))) edges[a-1].add(b-1) edges[b-1].add(a-1) path = [[] for _ in range(N)] visited, tovisit = set(), [(0, 0)] while tovisit: p, v = tovi...

0.58264

def CeilIndex(A, l, r, key): while (r - l > 1): m = l + (r - l)//2 if (A[m] >= key): r = m else: l = m return r def LongestIncreasingSubsequenceLength(A, size): # Add boundary case, # when array size is one tailTable = [0...

0.582261

t = int(input()) for _ in range(t): n = int(input()) l = list([int(x)- 1 for x in input().split()]) out = [] ll = [(l[i], i) for i in range(n)] ll.sort() swap = (-1,-1) for i in range(n - 1): if ll[i][0] == ll[i + 1][0]: swap = (ll[i][1],ll[i+1][1]) newl = [0]*n ...

0.582079

import sys from collections import deque def solve(): sys.setrecursionlimit(10**6) readline = sys.stdin.readline writelines = sys.stdout.writelines N = int(readline()) G = [[] for i in range(N)] for i in range(N-1): u, v = map(int, readline().split()) G[u-1].append(v-1) G...

0.581718

d=1000000007 for _ in range(int(input())): l=sorted(list(map(int,input().split()))) ans=(l[0]%d)*((l[1]-1)%d)*((l[2]-2)%d) print(ans%d)

0.58165

t = int(input()) for _ in range(t): n, k = list(map(int, input().split())) l = list(map(int, input().split())) d = dict() d[0] = 0 for v in l: vv = (k - v) % k if vv: if vv not in d: d[vv] = vv + 1 else: d[vv] += k prin...

0.581431

import sys input = sys.stdin.readline t = int(input()) for _ in range(t): n = int(input()) s = input().strip() lengths = [] curr = s[0] currLen = 0 for c in s: if c == curr: currLen += 1 else: lengths.append(currLen) currLen = 1 c...

0.580876

mod=10**9+7 def pow2(x): p,n=1,2 while(x): if(x & 1): p=((p%mod) * (n%mod))%mod n=((n%mod) * (n%mod))%mod x//=2 return p def count_bit(val): bit=0 while(val): bit+=1 val &=(val-1) return bit def answer(): val=b[0] po2=0 for i in range(1,len(b)): if(val > b[i]):return 0 po2+=count_bit(val ...

0.580791

def powerset(s): n = len(s) masks = [1 << j for j in range(n)] for i in range(2**n): yield [j + 1 for j in range(n) if (masks[j] & i)] def is_power2(num): return num != 0 and ((num & (num - 1)) == 0) def special(l): n = len(l) for i in range(n): lis = [i + 1] yield...

0.580764

from sys import stdin import math rgb = 'RGB' for query in range(int(stdin.readline())): n, k = list(map(int, stdin.readline().split())) s = stdin.readline() ans = math.inf for start in range(3): dp = [0 for i in range(n + 1)] for i in range(n): cur = rgb[(start + i) % le...

0.580604

def read_int(): return int(input()) def read_ints(): return list(map(int, input().split(' '))) t = read_int() for case_num in range(t): n, k = read_ints() p = [] for i in range(n): ai, bi = read_ints() p.append((bi, ai, i + 1)) p.sort() dp = [[0 for j in range(k + 1)] for...

0.57961

t = [0] * 26 def get_k(c): return ord(c) - ord('a') def analyze(s): length_of_str = len(s) pos = 0 beauty_table = [0] * 26 for i in range(1, length_of_str): if s[i] != s[pos]: k = get_k(s[pos]) beauty_table[k] = max(beauty_table[k], i - pos) pos = i ...

0.579524

t = int(input()) for i in range(t): n, c = list(map(int,input().split())) pts = {} moves = 0 for i in range(n): x, y = list(map(int,input().split())) if (y-x,x%c) in pts: pts[(y-x,x%c)].append(x) else: pts[(y-x,x%c)] = [x] for i in pts: arc = sorted(pts[i]) for j in arc: moves = moves + ...

0.579476

from sys import stdin for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) id = list(zip(l,list(range(n)))) id.sort() val, pos = zip(*id) blok = [] cur = [pos[0]] for i in range(1,n): if val[i] == val[i-1]: cur.append(pos[i]) else:...

0.579402

— Hey folks, how do you like this problem? — That'll do it. BThero is a powerful magician. He has got $n$ piles of candies, the $i$-th pile initially contains $a_i$ candies. BThero can cast a copy-paste spell as follows: He chooses two piles $(i, j)$ such that $1 \le i, j \le n$ and $i \ne j$. All candies from pi...

import math t = int(input()) for test in range(t): n,k = map(int,input().split()) A = list(map(int,input().split())) A.sort() ans = 0 for i in range(1,n): if(A[i]>k): ans = 0 break rem = k-A[i] ans+=rem//A[0] print(ans)

0.810202

def main(): t= int(input()) while(t!=0): n,k = list(map(int , input().split())) arr = list(map(int, input().split())) freq = [0]*100001 k=k-1 st=0 end=0 currentCount=0 previousElement = 0 for i in range(n): freq[arr[i]]+=1 if(freq[arr[i]]==1): currentCount+=1 while(currentCount>k): ...

0.79216

from sys import stdin,stdout from math import gcd for _ in range(int(stdin.readline())): # n=int(stdin.readline()) k-pieces n,k=list(map(int,stdin.readline().split())) a=list(map(int,stdin.readline().split())) gr=[[0 for _ in range(n)]for _ in range(n)];ans=0;k-=1 for sz in range(n): ...

0.788037

from bisect import insort from math import ceil for _ in range(int(input())): n,k=list(map(int,input().split( ))) array=list(map(int,input().split( ))) ans=0 index=[] for i in range(1,n+1): index.append(ceil(k/(ceil(k/i)))) for i in range(n): count=[0]*(2001) temp=[] for j in range(i,n): count[array[j]...

0.784937

# cook your dish here import numpy as np def minstairs(n,k): stairsHeight=[] stairs=0 current = 0 stairsHeight=list(map(int, input().split())) stairsHeight=np.array(stairsHeight) curr=0 for i in range(n): if stairsHeight[i]-curr<=k: curr=stairsHeight[i] else: if (stairsHeight[i]-curr)%k==0: sta...

0.77489

import sys def input(): return sys.stdin.readline()[:-1] t = int(input()) for _ in range(t): n, k = map(int, input().split()) a = list(map(int, input().split())) cum = [0 for _ in range(2*k+2)] for i in range(n//2): x, y = a[i], a[n-i-1] cum[2] += 2 cum[min(x, y)+1] -= 1 cum[x+y] -= 1 cum[x+y+1] += 1 ...

0.768118

for _ in range(int(input())): n,k=list(map(int,input().split())) c=list(map(int,input().split())) count=1 for i in range(n): if i+1<n: if c[i]-c[i+1]>=k or c[i+1]-c[i]>=k: continue else: count+=1 c[i],c[i+1]=c[i+1],c[i] print(count)

0.765887

t = int(input()) for _ in range(t): n, k = list(map(int, input().split())) l = list(map(int, input().split())) d = dict() d[0] = 0 for v in l: vv = (k - v) % k if vv: if vv not in d: d[vv] = vv + 1 else: d[vv] += k prin...

0.758323

import sys input = sys.stdin.readline rInt = lambda: int(input()) mInt = lambda: list(map(int, input().split())) rLis = lambda: list(map(int, input().split())) t = int(input()) for _ in range(t): n, k = mInt() a = rLis() b = rLis() a.sort() b.sort(reverse = True) for i in range(k): if a...

0.750329

import sys import math def main(arr,k): x=[] y=[] for e in arr: if e%2==0: x.append(e) y.append(0) else: x.append(0) y.append(e) a=[0]*n b=[0]*n a[0]=x[0] b[0]=y[0] for i in range(1,n): if i<k: a[i]=max(x[i],a[i-1]) b[i]=max(y[i],b[i-1]) else: a[i]=max(x[i]+a[i-k-1...

0.749091

def fact(n): if n<2: return 1 return n * fact(n-1) def ncr(n, r): return fact(n)// (fact(r)*fact(n-r)) t=int(input()) for _ in range(t): n, k = list(map(int, input().split())) a = list(map(int, input().split())) a.sort() count_z = a.count(a[k-1]) count_z_seq = a[:k].count(a[k-1]) print(ncr(count_z, co...

0.743695

# cook your dish here #t = int(input()) for i in range(int(input())): n,k = map(int,input().split()) l = list(map(int,input().split())) l.sort(reverse = True) c = 0 for i in l: if i >= l[k-1]: c += 1 print(c)

0.738048

# cook your dish here t=int(input()) for i in range(t): n=int(input()) nums=list(map(int,input().split())) k=int(input()) an=nums[k-1] cn=0 for i in range(n): if(nums[i]<an): cn+=1 print(cn+1)

0.734719

from itertools import permutations for _ in range(int(input())): N,K=list(map(int,input().split())) arr=list(map(int,input().split())) arr1=[] arr2=[] for i in range(1,len(arr)+1): arr1.append(i) indexzero=[] for i in range(0,len(arr)): if(arr[i]==0): indexzero.append(i) else: arr2.append(arr[i]) #...

0.731117

# cook your dish here t=int(input()) while(t): t=t-1 n,k=list(map(int,input().split())) q=list(map(int,input().split())) days,rem=0,0 for i in range(n): rem+=q[i] if(rem>=k): rem-=k else: days=i+1 break days+=1 if(rem>=k): days+=(rem//k)+1 print(days)

0.728631

for _ in range(int(input())): n, k = map(int, input().split()) l = [*map(int, input())] count = [0] * (n + 1) for i in range(n - 1, -1, -1): if l[i] == 1: count[i] = count[i + 1] + 1 x,y = 0,0 for i in range(n): if l[i] == 1: x += 1 else: try: y = max(y, x + k + count[i + k]) except: ...

0.720992

def solve(): n, k = map(int,input().split()) lst1 = list(map(int,input().split())) lst1.sort(reverse=True) ind = 0 ans = 0 lst2 = list(map(int,input().split())) lst2.sort() for i in range(k): lst2[i] -= 1 if lst2[i] == 0: ans += lst1[ind] ans += lst1[ind] ...

0.712834

from bisect import * for x in range(eval(input())): n,k = list(map(int,input().split())) arr = list(map(int,input().split())) arr.sort() t = 1 result = 0 y = 0 while y < n: if arr[y]<t: y += 1 elif arr[y]==t: t = t*2 y += 1 else: result += 1 t = t*2 while t < 2**(k): result += 1 t = t...

0.706545

# cook your dish here import bisect for _ in range(int(input())): w,k=map(str, input().split()) k=int(k) n=len(w) w=list(w) w.sort() w.append('0') c=1 l=0 l1=[] l2=[] for i in range(1, n+1): if w[i]==w[i-1]: c+=1 else: a=bisect.bisect_left(l1, c) if a==l: l1.append(c) l2.append(1) l...

0.699652

# cook your dish here def func(arr, k): sumi = 0 for j in range(k): sumi += arr[j] maxi = sumi for i in range(k,len(arr)): sumi -= arr[i - k] sumi += arr[i] maxi = max(maxi,sumi) return maxi for _ in range(int(input())): n, k = map(int,input().split()) arr = [...

0.699359

def main(): T = int(input()) for t in range(T): N,K = map(int, input().split()) W = list(map(int, input().split())) W.sort() if 2*K > N: K = N - K kid = sum(W[:K]) dad = sum(W[K:]) diff = dad - kid print(diff) def __starting_point(): main() __starting_point()

0.697823

#code snippet reference:http://www.geeksforgeeks.org/searching-for-patterns-set -2-kmp-algorithm/ def KMPMatch(pattern, string): M = len(pattern) N = len(string) nonlocal ans lps = [0]*M j = 0 LPSCompute(pattern, M, lps) i = 0 while i < N: if pattern[j] == string[i]: i+=1 j+=1 if j==M: ans+...

0.696914

import bisect def solve(n,x_coords,y_coords,k,ans): x_coords.sort() dp = [] for i in range(n): x = x_coords[i] index = bisect.bisect(x_coords,x+k)-1 dp.append(index-i+1) dp_max = [] for i in reversed(dp): if not dp_max: dp_max.append(i) else: ...

0.695427

import sys input = sys.stdin.readline T = int(input()) for _ in range(T): N, K = list(map(int, input().split())) A = [int(a) for a in input().split()] B = [A[i+K]-A[K] for i in range(N-K)] mi = 10**20 mx = -1 for i in range(N-K): if A[i+K]-A[i] < mi: mi = A[i+K]-A[i] ...

0.690759

def solve(): n, k = map(int,input().split()) lst = list(map(int,input().split())) lst.sort() ans = 0 for i in range(n - k - 1, n): ans += lst[i] print(ans) for i in range(int(input())): solve()

0.690587

import numpy as np from numba import njit i8 = np.int64 @njit def solve(a, b, t, K, N): t1 = t // K d = t % K * 2 # b が a から a + d の位置にあれば衝突する x = 0 y = 0 ans = 0 for c in a: while b[x] < c: x += 1 while b[y] <= c + d: y += 1 ...

0.688851

import math as ma import sys from decimal import Decimal as dec from itertools import permutations def li(): return list(map(int , input().split())) def num(): return map(int , input().split()) def nu(): return int(input()) t=nu() for it in range(t): k=nu() a=li() s=sum(a) zz=[] for i in range(7): pp=...

0.685219

for _ in range(int(input())): n,k=list(map(int,input().split())) a=list(map(int,input().split())) def check(mid): d,left={},0 for i in range(mid): if a[i]>k: if a[i] not in d: d[a[i]]=1 else: d[a[i]]+=1 if len(d)==1: return True for i in range(mid,n): if a[left]>k: d[a[left]]...

0.684184

import sys import math def main(arr,k): ans=0 for i in range(len(arr)): curr_min=float('inf') for j in range(i,len(arr)): curr_min=min(curr_min,arr[j]) if curr_min==k: ans+=1 return ans n=int(input()) arr=list(map(int,inpu...

0.68358

# cook your dish here for _ in range(int(input())): n,k=map(int,input().split()) c=[int(i) for i in input().split()] i=0 m=0 if(n==2 and k==5): c1=c c.sort() d=dict() for i in range(len(c)): for j in range(len(c1)): if(c[i]==c1[j]): d[i]=j c1[j]=-1 break while(m<n): if (i==n)...

0.674622

import sys input = sys.stdin.readline from collections import defaultdict class Unionfind: def __init__(self, n): self.par = [-1]*n self.rank = [1]*n def root(self, x): r = x while not self.par[r]<0: r = self.par[r] t = x ...

0.66628

for _ in range(int(input())): n,k=[int(x) for x in input().split()] a=list(map(int,input().split())) dp=[0]*(max(a)+1) for _ in range(n): dp[a[_]]+=1 for _ in range(1,len(dp)): if dp[_]>k: print(_,end=" ") print()

0.664115

from sys import stdin tt = int(stdin.readline()) for loop in range(tt): n = int(stdin.readline()) a = list(map(int,stdin.readline().split())) lis = [ [1] ] now = [] tmp = 0 for i in range(1,n): if len(now) == 0: now.append(a[i]) tmp = 1 elif now[-1] ...

0.657817

t=int(input()) for i in range(0,t): n,k=map(int,input().split()) a1,*a=map(int,input().split()) a.insert(0,a1) j=0 while j<n: if a[j]%k==0: print(1,end="") else: print(0,end="") j+=1 print("")

0.65669

import sys import random from fractions import Fraction from math import * def input(): return sys.stdin.readline().strip() def iinput(): return int(input()) def finput(): return float(input()) def tinput(): return input().split() def linput(): return list(input()) def rinput(): return ...

0.655837

t = int(input()) for tc in range(t): n,k=list(map(int, input().split())) tap = list(map(int, input().split())) sol=0 for i in range(1, n+1): d=1000000 for j in tap: d=min(d, abs(j-i)+1) sol=max(sol, d) print(sol)

0.653363

import sys import math from collections import defaultdict from itertools import combinations from itertools import permutations input = lambda : sys.stdin.readline().rstrip() read = lambda : map(int, input().split()) def write(*args, sep="\n"): for i in args: sys.stdout.write("{}".format(i) + sep) INF = float('i...

0.649906

t = int(input()) for i in range(t): q = input().split() n = int(q[0]) m = int(q[1]) k = int(q[2]) sumax = 0 b = [] for j in range(n): a = [int(k) for k in input().split()] b = b + [a] for j in range(n): su = 0 for x in range(k): s...

0.647296

def max_sum(arr): # Finds the maximum sum of sub-arrays of arr max_till_now = -1000000 #minimum possible number current_sum = 0 for i in range(len(arr)): if current_sum < 0: # If sum of previous elements is negative, then ignore them. Start fresh # with `current_sum = 0`...

0.646069

# cook your dish here from math import ceil for _ in range(int(input())): n=int(input()) a=list(map(int,input().split())) ans=ceil(n/min(a)) print(int(ans))

0.642494

import sys from collections import defaultdict from copy import copy R = lambda t = int: t(input()) RL = lambda t = int: [t(x) for x in input().split()] RLL = lambda n, t = int: [RL(t) for _ in range(n)] def solve(): n, x = RL() A = RL() A.sort(reverse = True) s = c = m = 0 for a in A: s += a c += 1...

0.642456

from sys import stdin for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) id = list(zip(l,list(range(n)))) id.sort() val, pos = zip(*id) blok = [] cur = [pos[0]] for i in range(1,n): if val[i] == val[i-1]: cur.append(pos[i]) else:...

0.640967

t = int(input()) while(t): n = int(input()) ar = list(map(int,input().strip().split(" "))) print(len([x for x in ar[1:len(ar)] if ar[0]<x])) t-=1

0.638524

t=int(input()) for nbt in range(t): n,k=[int(i) for i in input().split()] a=[int(i) for i in input().split()] nbc=len(set(a))-1 if k==1: if nbc: print(-1) else: print(1) else: print(1+max(0,(nbc-1)//(k-1)))

0.638248

# for _ in range(int(input())): n,k = list(map(int,input().split())) arr = list(map(int,input().split())) s=set(arr) t1=len(s) max=-1 for i in range(n-k+1): temp=set(arr[i:i+k]) #print(temp,i,k+i+1) t=len(temp) if t1 == t: if max<sum(arr[i:k+i]): max=sum(arr[i:k+i]) print(max)

0.637789

'''Author- Akshit Monga''' from sys import stdin, stdout input = stdin.readline t=int(input()) for _ in range(t): n=int(input()) a=[int(x) for x in input().split()] ans=0 dp=[-1 for i in range(0,n+1)] for i in a: var1=dp[i] var2=ans ans=max(ans,var1+1) dp[i]=max(dp[i],var2+1) print(n-ans)

0.637316

try: for _ in range(int(input())): N, K = map(int, input().split()) cell = [] count = 0 l = [] for __ in range(N): inserted = list(map(int, input().split())) cell.append(inserted) cell.sort(key=lambda x: x[1]) time = {} for number in cell: if number[2] not in time: time[number[2...

0.636215

for _ in range(int(input())): n,k=list(map(int, input().split())) l=list(map(int, input().split())) l.sort() c=0 mn=abs(l[0]+l[1]-k) for i in range(n-1): for j in range(i+1, n): temp=abs(l[i]+l[j]-k) if temp==mn: c+=1 elif temp<mn: mn=temp c=1 elif l[i]+l[j]-k>mn: break...

0.632436

def f(arr): d = max(arr) for i in range(len(arr)): arr[i] = d - arr[i] # for _ in range(1): for _ in range(int(input())): n, k = list(map(int, input().split())) # n = int(input()) arr = list(map(int, input().split())) if k <= 2: for i in range(k): f(arr) elif k ...

0.632178

# cook your dish here t=int(input()) for i in range(t): (n,k)=tuple(map(int,input().split())) print(k//n)

0.631107

t = int(input()) for _ in range(t): n, k = [int(x) for x in input().split()] l1, r1 = [int(x) for x in input().split()] l2, r2 = [int(x) for x in input().split()] if l1 > l2: l1, r1, l2, r2 = l2, r2, l1, r1 if l2 < r1: # they already intersect. start = (min(r1, r2) - max(l1...

0.630207

from sys import stdin def gt(num): if num: return num return 0 for __ in range(int(stdin.readline().split()[0])): n = int(stdin.readline().split()[0]) a = list(map(int, stdin.readline().split())) cnta = dict() cnta.setdefault(0) cntb = dict() cntb.setdefault(0) for i in a: cnta[i] = gt(cnta.get(i)) + 1 as...

0.629927

import sys input = sys.stdin.readline import bisect t=int(input()) for tests in range(t): n=int(input()) A=list(map(int,input().split())) compression_dict={a: ind for ind, a in enumerate(sorted(set(A)))} A=[compression_dict[a] for a in A] Q=[0]*n for i in range(n): Q[A[i]]=i ...

0.62907

from collections import Counter from math import factorial def nc3(n): a=factorial(n) b=factorial(n-3) return ((a)/(b*6)) def rem(s,k): t=-1 x=-1 for i in range(len(s)): if s[i][0]>2 and s[i][1]<=k: if s[i][0]>3: ch=(nc3(s[i][0])-nc3(s[i][0]-1))/s[...

0.628785

t=1 for _ in range(t): n,m,k=(list(map(int,input().split()))) a=list(map(int,input().split())) for i in range(n): a[i]=a[i]%k s=1 for j in range(k): ss=0 v=0 for i in range(n): v+=min(abs(a[i]-j),k-abs(a[i]-j)) while ssm: ...

0.628456

# cook your dish here import sys input=sys.stdin.readline for _ in range(int(input())): n,x=list(map(int,input().split())) l=[0] pre=[0]*(n+1) sum=0 i=1 for m in input().split(): l.append(int(m)) sum+=int(m) pre[i]=sum i+=1 dict={} k=[] i=1 while (i*i)<=x: if x%i==0: k.append(i) if (i*i)!=x: ...

0.628413

from operator import itemgetter import sys input = sys.stdin.readline MAX_A = 200 t = int(input()) for _ in range(t): n = int(input()) a = list(map(int, input().split())) ruiseki = [[0] * MAX_A for i in range(n + 1)] for i in range(n): for j in range(MAX_A): ruiseki[i + 1][j] ...

0.627415

from math import ceil t=int(input()) for i in range(t): p=int(input()) l=list(map(int,input().split())) maxx=1 for i in range(len(l)): maxx=max(maxx,l.count(l[i])) if(maxx*2>p): print(maxx) else: q=p-maxx*2 maxx+=ceil(q/2)...

0.62475

T = int(input()) for _ in range(T): n = int(input()) arr = list(map(int, input().split())) a = [0 for _ in range(max(arr)+1)] star_val = [] for i in range(len(arr)): j = 1 val = 0 while j*arr[i] <= len(a): val += a[j*arr[i]-1] j += 1 star_val.append(val) a[arr[i]-1] += 1 print(max(star_val))

0.6238

# cook your dish here def main(): for _ in range(int(input())): N, k = [int(x) for x in input().split()] Powers = [k ** int(x) for x in input().split()] s1, s2 = 0, sum(Powers) ans = (0, None) i = 0 while i < N - 1: s1 += Powers[i] s2 -= Powers[i] z = s1 ...

0.623383

# cook your dish here for _ in range(int(input())): n,k=list(map(int,input().split())) a=list(map(int,input().split())) m=0 for i in range(n): if i%2==0: if m<0: m-=a[i] else: m+=a[i] else: if m<0: m+=a[i] else: m-=a[i] if abs(m)>=k: print(1) else: print(2)

0.622555

import sys input = sys.stdin.readline t=int(input()) for test in range(t): n=int(input()) A=list(map(int,input().split())) ANS=[] SET=set() NOW=1 while not (NOW in SET): ANS.append(NOW) SET.add(NOW) NOW=NOW-A[NOW-1] x=ANS.index(NOW) print(len(ANS[x:])) pr...

0.622332

# cook your dish here import math for t in range(int(input())): n=int(input()) a=[int(i) for i in input().split()] div=sum(a)/n div=math.ceil(div) count=div*n-sum(a) for i in a: if i>div: count+=i-div print(count)

0.621972

t=int(input()) while(t): k=1 j=0 n=int(input()) while(n>0): if(n<=k): j+=1 n=0 elif n>2*k: j+=2 n=n-2*k k+=1 else: j+=2 n=0 print(j) t-=1

0.621565

t = int(input()) for i in range(t): n, k = list(map(int, input().split())) ans = 0 while n != 0: if n % k == 0: ans += 1 n //= k else: ans += n % k n -= n % k print(ans)

0.619268

for _ in range(int(input())): n,k=map(int,input().split()) print(((2*n*(k-1))+2)/k)

0.619131

import sys t = int(sys.stdin.readline()) for _ in range(t): n = int(sys.stdin.readline()) intervals = [None]*n for i in range(n): intervals[i] = tuple([int(a) for a in sys.stdin.readline().split()]) intervals = list(zip(intervals, list(range(n)))) starts = sorted(intervals, key = lambda x:...

0.617622

from collections import deque t=int(input()) for i in range(t): n=int(input()) N=[i for i in range(1, n+1)] w=list(map(int, input().split())) max_sweetness=max(w) sizes=[] cnt=0 for i in range(n): if w[i]!=max_sweetness: cnt+= 1 else: sizes.append(cnt) cnt=0 if cnt!=0: sizes[0]=(cnt+sizes[0])...

0.616896

try: t=int(input()) for a in range(t): l=input().split() n=int(l[0]) m=int(l[1]) d={} s=0 for b in range(m): l1=input().split() i=int(l1[0]) j=int(l1[1]) k=int(l1[2]) for c in range(i,j+1): if c not in d: d[c]=10 for c in range(i,j+1): d[c]=d[c]*k for i in d: s=s+d[i] ...

0.615214

import sys sys.setrecursionlimit(100000) memo = {} def recurse(arr, T1, T2, k, i): if T1 >= k and T2 >= k: return i if i >= len(arr): return float('inf') if (T1, T2) in memo: return memo[(T1, T2)] t1 = recurse(arr, T1 + arr[i], T2, k, i+1) t2 = recurse(arr, T1, T2 + arr[i], k, i+1) memo[(T1, T2)] = mi...

0.61501

fact = [] fact.append(1) for i in range(1,100001): fact.append((i*fact[i-1])%1000000007) def power(a,b,p): x=1 y=a while(b>0): if(b%2 == 1): x=(x*y) if(x>p): x=x%p y=(y*y) if(y>p): y=y%p b=b/2 return x def inverse(N,p): return power(N,p-2,p) def combination(N,R,p): return (fact[N]*((...

0.614501

for _ in range(int(input())): n=int(input()) f=list(map(int,input().split())) sum1=f[0] d=0 i=1 while sum1!=0 and i<n: sum1=sum1-1+f[i] d+=1 i+=1 print(d+sum1)

0.613138

def f(a,n): l,r,s1,s2 = [0]*n, [0]*n, [], [] for i in range(n): count = 1 while(len(s1)>0 and a[i]<s1[-1][0]): count += s1[-1][1] s1.pop() s1.append((a[i],count)) l[i] = count for i in range(n-1,-1,-1): count = 1 while(len(s2)>0 and a[i]<=s2[-1][0]): count...

0.612981

import sys input = sys.stdin.readline Q = int(input()) for _ in range(Q): N = int(input()) A = [int(a) for a in input().split()] X = {} for a in A: if a in X: X[a] += 1 else: X[a] = 1 Y = [] for x in X: Y.append(X[x]) Y = sorted(Y)[::-1] p...

0.61295

# cook your dish here import collections def shortestSubarray(A, K): N = len(A) P = [0] for x in A: P.append(P[-1] + x) #Want smallest y-x with Py - Px >= K ans = N+1 # N+1 is impossible monoq = collections.deque() #opt(y) candidates, represented as indices of P for y, Py in enume...

0.611301

for i in range(int(input())): n,k=list(map(int,input().split())) t=0 if n%2!=0: n-=1 t+=1 t+=(n//k) if n%k!=0: t+=1 print(t)

0.61106

def isSubsetSum(arr, n, sum): subset = [ [False for j in range(sum + 1)] for i in range(3) ] for i in range(n + 1): for j in range(sum + 1): if (j == 0):subset[i % 2][j] = True elif (i == 0):subset[i % 2][j] = False elif (arr[i - 1] <= j):subset[i % 2][j] = sub...

0.610955

# cook your dish here def count(k,n,m): sum1=(m*(m+1))//2 sum2=(m*(m-1))//2 ct=0 for i in range(n): for j in range(n): if i<j and k[i]>k[j]: ct+=sum1 elif jk[j]: ct+=sum2 return ct test=int(input()) for _ in range(test): ...

0.609313

for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) ans = 1 l1 = l[0] for i in range(1,n): if l[i] <= l1: l1 = l[i] ans = ans + 1 print(ans)

0.608894

for _ in range(int(input())): n = int(input()) A = list(map(int, input().split())) m = 10 ** 9 c = 0 for i in range(n - 1, -1, -1): if A[i] <= m: m = A[i] else: c += 1 print(c)

0.607819

f = 5003*[0] modn = 1000000007 def qPow(a, b): nonlocal modn res = 1 while b > 0: if (b & 1) == 1: res = res * a % modn a = a * a % modn b = b >> 1 return res def getF(): nonlocal f f[0] = 1 for i in range(1, 5001): f[i] = f[i-1] * i def __starting_point(): getF() T = int(input()) while T > 0...

0.607563

#dt = {} for i in x: dt[i] = dt.get(i,0)+1 import sys;input = sys.stdin.readline inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()] def check(mid): pos = x[0] ct = 1 for i in range(1,n): if x[i]-pos >= mid: pos = x[i] ct += 1 if ct...

0.606573

for _ in range(int(input())): n, k = tuple(map(int, input().split())) arr = list(map(int, input().split())) peaks = [0 for i in range(n)] for i in range(1, n - 1): if arr[i] > arr[i - 1] and arr[i] > arr[i + 1]: peaks[i] = 1 cnt = 0 max_peaks = 0 answer = 0 for i i...

0.606572

import sys input=sys.stdin.readline for _ in range(int(input())): N=int(input()) e=list(map(int,input().split())) e.sort() ans=0 val=0 g=0 for i in range(0,N): g+=1 val=e[i] if g>=val: ans+=1 g=0 val=0 print(ans)

0.606161

import sys from math import * def minp(): return sys.stdin.readline().strip() def mint(): return int(minp()) def mints(): return list(map(int, minp().split())) def add(a,x,v): while x<len(a): a[x] += v x |= x+1 def get(a,x): r = 0 while x>=0: r += a[x] x = (x&(x+1))-1 return r n, k, a, b, q = mints...

0.60591

T = int(input()) for _ in range(T): W = list(map(int, input().strip().split())) S = W[0] W = W[1:] W = W[::-1] i = 0 c = 0 flag = 0 while (len(W) != 0 or flag != 1) and i<len(W): k = i su = 0 while su <= S and k<len(W)-1: su += W[k] k += 1 if su-W[k-1]<=S: c += 1 else: flag = 1 i += 1 p...

0.605355

for _ in range(int(input())): n = int(input()) wt = list(map(int, input().split())) count = {} for x in wt: if x not in count: count[x] = 0 count[x] += 1 k = 0 for s in range(101): temp = 0 temp2 = 0 for x in count: if (s - x) in c...

0.603103

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline mii=lambda:list(map(int,input().split())) for _ in range(int(input())): n,d=mii() a=list(mii()) ans=0 for i in range(n): while d>=i and a[i]: a[i]-=1 ans+=1 d-=i print(ans)

0.600487

import sys INF = 10**20 MOD = 10**9 + 7 I = lambda:list(map(int,input().split())) from math import gcd from math import ceil from collections import defaultdict as dd, Counter from bisect import bisect_left as bl, bisect_right as br def solve(): n, k = I() s = input() ans = 0 last = -INF for i in range(n): ...

0.599517

# cook your dish here t=int(input()) for i in range(t): n=int(input()) ar=list(map(int,input().split())) tot=0 st=0 for j in range(1,n): if(ar[j-1]>ar[j]): si=j-st c=(si*(si+1))//2 tot+=c st=j si=n-st c=(si*(si+1))//2 tot+=c print(tot)

0.599471

# cook your dish here testcases=int(input()) for _ in range(testcases): (N,K)=list(map(int,input().split())) array=list(map(int,input().split())) max=array[0] min=array[0] for i in array: if i>max: max=i if i<min: min=i max=max+K ...

0.598117

from itertools import accumulate from bisect import bisect_right import sys n, q = list(map(int, sys.stdin.readline().split())) a = list(map(int, sys.stdin.readline().split())) k = list(map(int, sys.stdin.readline().split())) s = list(accumulate(a)) sofar = 0 for x in k: sofar += x if sofar >= s[-1]: ...

0.597282

test=int(input()) for _ in range(test): n=int(input()) ls=list(map(int,input().split())) ls.sort() s=0 for i in range(n): if s>=ls[i]: s=s+1 else: break print(s)

0.596356

def subCount(arr, n, k): mod = [] for i in range(k + 1): mod.append(0) cumSum = 0 for i in range(n): cumSum = cumSum + arr[i] # as the sum can be negative, # taking modulo twice mod[((cumSum % k) + k) % k] = mod[((cumSum % k) + k) % k] + 1 ...

0.595601

# cook your dish here for _ in range(int(input())): n=int(input());li=list(map(int,input().split()));dli=dict();modi=0 for i in li: if i not in dli:dli[i]=1 else:dli[i]+=1 op=sorted(list(dli)) if(len(dli)!=0): while 1: tmp=[] for i in op: if dli[i]==0:continue tm...

0.593056

#CF Round 150. Div II Prob. A - Dividing Orange import sys In = sys.stdin n, k = [int(x) for x in In.readline().split()] arr, s, cnt = [int(x) for x in In.readline().split()], set(), 1; s.update(arr) for i in range(k): c = [arr[i]] for j in range(n - 1): while (cnt in s): cnt += 1; ...

0.592063

for _ in range(int(input())): n = int(input()) arr = list(map(int,input().split())) a,b = 0,0 arr.sort() for i in arr: if a==i: a+=1 elif b==i: b+=1 print(a+b)

0.591562

# Calculate the prefix sum and count it. # In c++ and java, a % K + K takes care of the cases where a < 0. # Python class Solution: def subarraysDivByK(self, A, K): res = 0 prefix = 0 count = [1] + [0] * K for a in A: prefix = (prefix + a) % K res += count[p...

0.591325

t = int(input()) from math import log, ceil, floor while t: t-=1 n,k = map(int ,input().split()) v = floor(log(k, 2)) block = 1 << v + 1 print(n / block * (1 + (k - 2 ** v) * 2 ))

0.590759

T= int(input()); for i in range(T): n,k = list(map(int,input().split())); s=list(map(int,input())); if k==1: s_0 ={}; s_1={}; c0=0; c1=0; for j in range(n): if(j%2==0): s_1[j]=1; s_0[j]=0; else: s_1[j]=0; s_0[j]=1; for j in range(n): if(s_0[j]-s[j]!=0): c0+=1; if(s_1[j]-...

0.590617

q = int(input()) for z in range(q): n, k = map(int, input().split()) x = n // k n -= x * k m = min(k // 2, n) print(x * k + m)

0.590303

There are $n$ segments $[l_i, r_i]$ for $1 \le i \le n$. You should divide all segments into two non-empty groups in such way that there is no pair of segments from different groups which have at least one common point, or say that it's impossible to do it. Each segment should belong to exactly one group. To optimize ...

t = int(input()) for ti in range(t): n = int(input()) lri = [None for _ in range(n)] for _ in range(n): li, ri = list(map(int, input().split())) lri[_] = (li, ri, _) lri.sort() t = [None for _ in range(n)] ct, t[lri[0][2]], eg = 1, 1, lri[0][1] for i in range(1, n): if lri[i][0] <= eg: t[lri[i][2...

0.788602

for _ in range(int(input())): n = int(input()) ls = [] rs = [] lrs = [] for i in range(n): l, r = map(int, input().split()) ls.append(l) rs.append(r) lrs.append((l, r, i)) lrs.sort() c = 0 maxi = -1 res = [-1] * n for l, r, i in lrs: if ls[i] > maxi: maxi = rs[i] res[i] = c elif rs[i] <...

0.770975

t=eval(input()) a=[] b=[] top=-1 for __ in range(0,t): x=input().split() if(x[0]!="-1" and x[0]!="0"): add=int(x[0]) if top!=-1 and add>a[top][0] : b[top]+=1 else: a.append((add,x[1])) b.append(0) top+=1 elif (x[0]=="-1"): #print("%s %s" %(b[top],a[top]...

0.719662

from sys import stdin,stderr def rl(): return [int(w) for w in stdin.readline().split()] def solve(n, b): f = [True for i in range(2*n+1)] for x in b: if not f[x]: return [-1] f[x] = False a = [] for x in b: a.append(x) for y in range(x+1, 2*n+1): ...

0.716339

# cook your dish here from operator import itemgetter t=int(input()) for _ in range(t): n=int(input()) start=[] end=[] for i in range(n): first, last = map (int, input().split()) start.append((first, i)) end.append((last, i)) score=[0]*n start.sort(key=itemgetter(0)) ...

0.712617

import sys sys.setrecursionlimit(10 ** 5) int1 = lambda x: int(x) - 1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def MI(): return map(int, sys.stdin.readline().split()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(ro...

0.70213

#list(map(int,input().split())) t=int(input()) for i in range(t): n=int(input()) it=list(map(int,input().split())) if n==1 and it[0]%2==1: print(-1) else: ind=-1 ind2=-1 ind3=-1 for j in range(n): if it[j]%2==0: ind=j elif i...

0.699762

import sys from collections import deque input=sys.stdin.readline t=1 t=int(input()) for _ in range(t): n=int(input()) val=set([0,2*10**5+1]) seg=[(0,2*10**5+1)] for i in range(n): l,r=list(map(int,input().split())) val.add(l) val.add(r) seg.append((l,r)) val=list(v...

0.696484

for _ in range(int(input())): n = int(input()) mass = [] zo = 0 oz = 0 zz = 0 oo = 0 ozs = [] zos = [] ozss = set() zoss = set() for j in range(n): k = input() mass.append(k) if k[0] == '0' and k[-1] == '1': zoss.add(k) zos.appe...

0.684688

t = int(input()) for _ in range(t): n = int(input()) l = list([int(x)- 1 for x in input().split()]) out = [] ll = [(l[i], i) for i in range(n)] ll.sort() swap = (-1,-1) for i in range(n - 1): if ll[i][0] == ll[i + 1][0]: swap = (ll[i][1],ll[i+1][1]) newl = [0]*n ...

0.684036

import sys input = sys.stdin.readline T = int(input()) for _ in range(T): n = int(input()) l = list(map(int, input().split())) stack = [] out = [-1] * n curr = 0 works = True for i in range(n): while stack and stack[-1][0] == i: _, j = stack.pop() curr +...

0.683436

def get(l,n): l1,l2 = [],[] i = 1 h1,m1 = l[0] while (i < len(l)): h2,m2 = l[i] if (h1>h2): if (m1 >= m2): l1 += [(0,10**20)] l2 += [(-1,-1)] else: d = (h1-h2)//(m2-m1) if (((h1-h2)%(m2-m1)) == 0): l1 += [(0,d-1)] l2 += [(d+1,10**20)] else: l1 += [(0,d)] l2 += [(d+1...

0.679363

# cook your dish here for _ in range(int(input())): N, M = [int(x) for x in input().split()] edges = [0]*M dir = {} nodes = [[] for j in range(N+1)] ind = [0]*(N+1) graph = {} final_edges = [] for i in range(M): u, v = [int(x) for x in input().split()] nodes[u].append(v) ...

0.676234

#!/usr/bin/env python3 # Copied solution import collections import sys import traceback class Input(object): def __init__(self): self.fh = sys.stdin def next_line(self): while True: line = sys.stdin.readline() if line == '\n': continue retur...

0.670231

import sys t = int(sys.stdin.readline()) for _ in range(t): n = int(sys.stdin.readline()) intervals = [None]*n for i in range(n): intervals[i] = tuple([int(a) for a in sys.stdin.readline().split()]) intervals = list(zip(intervals, list(range(n)))) starts = sorted(intervals, key = lambda x:...

0.665209

t = int(input()) for _ in range(t): n = int(input()) lims = [tuple(int(v) for v in input().split()) for _ in range(n)] ctime = 0 ans = [] for l, r in lims: if l >= ctime: ans.append(l) ctime = l + 1 elif r < ctime: ans.append(0) else: ...

0.654524

import sys input = sys.stdin.readline N, M = list(map(int, input().split())) A = [] for _ in range(N): l, r = list(map(int, input().split())) A.append([l, r]) Z = [] for _ in range(M): l, r = list(map(int, input().split())) Z.append([l, r]) MA = 5*10**5+1 lg = 20 X = [[-1]*MA for i in range(lg)] for i...

0.653859

import sys input=sys.stdin.readline #t=1 t=int(input()) for _ in range(t): n=int(input()) s=input().rstrip() s=[s[-i-1] for i in range(n)] ans=[] zero=[] one=[] res=[-1]*n pos=0 while s: b=s.pop() if b=="0": if not one: new=1 ...

0.653437

# cook your dish here for a in range(int(input())): N,M=map(int,input().split()) b=[] for o in range(N): b.append(input()) c=[] for d in b: f=[] for e in range(len(d)): if d[e]=='1': f.append(e) c.append(f) i=[] for g in range(len(c)): for h in range(len...

0.651361

import sys input = sys.stdin.readline import bisect t=int(input()) for testcases in range(t): n=int(input()) A=list(map(int,input().split())) m=int(input()) PS=[tuple(map(int,input().split())) for i in range(m)] PS.sort() K=[PS[-1]] for a,b in PS[::-1][1:]: if b<=K[-1][1]: ...

0.650859

test=int(input()) for i in range(test): n=int(input()) a=list(map(int,input().split())) b=[0]*(n+2) b[n-1]=1 for i in range(n-2,-1,-1): if(a[i]*a[i+1]<0): b[i]=b[i+1]+1 else: b[i]=1 for i in range(n): print(b[i], end=' ') print()

0.650216

# cook your dish here from sys import stdin, stdout for _ in range(int(stdin.readline())): n, q = list(map(int, stdin.readline().split())) arr = list(map(int, stdin.readline().split()))[:n] od = ev = 0 for i in arr: if bin(i).count('1')%2==0: ev += 1 else: od += 1 for _ in range(q): p = int(stdin.read...

0.649722

def possible(a): ans = set() s = set() lmax = 0 for i in range(len(a)): lmax = max(lmax, a[i]) s.add(a[i]) if lmax == i + 1 and len(s) == i + 1: ans.add(i + 1) return ans t = int(input()) for case_num in range(t): n = int(input()) a = list(map(int, input...

0.647512

import sys class Fenwick(object): def __init__(self, n): self.n = n self.a = [10**9 for i in range(n)] self.w= 10**9 def zag(self, i, zn): self.w= min(self.w, zn) while i < self.n: self.a[i] = min(self.a[i], zn) i = (i | (i + 1)) def pol(self, r): ans= 10**9 while r >= 0...

0.645987

# cook your dish here from collections import deque primes = {2,3,5,7,11,13,17} 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)] x = [1,2,3,4,5,6,7,8,9] avail = {tuple(x):0} q = deque([x]) while q: curr = q.popleft(); for e in edges: if curr[e[0]]+curr[e[1]] in...

0.645358

import sys blocks = {} for i in range(1, 10): blocks[i] = [(0, 0)] for i in range(2, 10, 2): for j in range(1, i / 2 + 1): blocks[i].append((j, 0)) blocks[i + 1].append((0, j)) # print blocks blocks[10] = [(0, 0), (0, 1), (1, 0), (1, 1)] blocks[11] = [(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1...

0.636116

t = int(input()) for _ in range(t): n, m = map(int, input().split()) a = list(map(int, input().split())) if n <= 2: print(-1) continue if m < n: print(-1) continue cost = 0 edges = [] for i in range(n): edges.append((i+1, (i+1)%n + 1)) cost += 2 * a[i] s = sorted(range(n), key=lambda i: a[i]) ...

0.635131

# cook your dish here # cook your dish here import math test=int(input()) for _ in range(test): n=int(input()) l=list(map(int,input().split())) f=0 for i in range(math.ceil(n//2)): if n%2==1: f=1 break else: if l[i]!=l[i+n//2]: if min(l[i],l[i+n//2])==-1: l[i]=max(l[i],l[i+n//2]) l[i+n//2...

0.633368

for nt in range(int(input())): n=int(input()) l=list(map(int,input().split())) s=sum(l) e=l[0] for i in range(1,n): e=e^l[i] if s==2*e: print(0) print () else: print(2) print(e,s+e)

0.632254

#!usr/bin/env python3 from collections import defaultdict,deque from heapq import heappush, heappop import sys import math import bisect def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline()) def LS():return [list(x) for x in sys.stdin.readline().split()] def S(): ...

0.631318

def solve(): n = int(input()) lst = list(map(int,input().split())) if sum(lst) <= n // 2: print(n//2) print("0 " * (n // 2)) else: print(n//2 + (n // 2) % 2) print("1 " * (n//2 + (n // 2) % 2)) for i in range(int(input())): solve()

0.631133

for _ in range(int(input())): n = int(input()) a = list(map(int, input().split())) s = set(a) if n == 1 or len(s) > 2: print(-1) continue if len(s) == 1: x = s.pop() if x == 0: print(n) elif x == n-1: print(0) else: print(-1) continue x, y = sorted(s) xc, yc = a.count(x), a.count(y) ...

0.630008

import math def ispoweroftwo(y): return math.ceil(math.log(y,2))==math.floor(math.log(y,2)) t=int(input()) for i in range(t): n=int(input()) a=[] if(ispoweroftwo(n) and n!=1): print(-1,end=" ") if(n==1): print(1) if(n>=3 and not(ispoweroftwo(n))): a.append(2) a.append(3) a.append(1) if(n>3 and not ...

0.629852

def main(): n, m = list(map(int, input().split())) l = [[] for _ in range(n + 1)] for _ in range(m): u, v = list(map(int, input().split())) l[u].append(v) l[v].append(u) res = [0] * (n + 1) for u, x in enumerate(res): if not x: x, nxt = -1, [u] ...

0.629803

import sys # inf = open('input.txt', 'r') # reader = (map(int, line.split()) for line in inf) reader = (list(map(int, line.split())) for line in sys.stdin) def minmaxPairs(g, costDict, n): G = B = 0 s = 1 stack = [s] traversal = [] visited = [False] * (n + 1) subtreeSize = [1 for _ in range(n...

0.627325

from collections import deque import sys def input(): return sys.stdin.readline()[:-1] def main(): T = int(input()) for i in range(T): N = int(input()) e_list = [[] for i in range(N)] for i in range(N-1): a,b = list(map(int,input().split())) a,b = a-1,b-1 ...

0.626727

for tc in range(int(input())): N = int(input()) a, b = list(map(int, input().split())) pr = [] # 'L' is lexicographically lower than 'R'. # so, we should first try to apply L+ or L- # if we can't then only we'll try to apply R+ or R- for i in range(N - 1): l, r = list(map(int, input().split())) #continue ...

0.62609

import math def findnumber(l,n): l.sort() x = l[0] * l[-1] vec = [] i = 2 while (i*i)<=x: if x%i==0: vec.append(i) if x//i !=i: vec.append(x//i) i = i + 1 vec.sort() if len(vec)!=n: return -1 else: j = 0 ...

0.625041

# cook your dish here import numpy as np tests = int(input()) for _ in range(tests): n = int(input()) weights = [int(j) for j in input().split()] edges = [[0] for _ in range(n-1)] for i in range(n-1): edges[i] = [int(j)-1 for j in input().split()] vertex_set = [[] for _ in range(n)] for i in ran...

0.623982

from sys import stdout n = int(input()) class Person: num = n - 1 def __init__(self, rel): self.relationship = int(rel, 2) def __getitem__(self, k): return (self.relationship >> Person.num - k) & 1 rel = [Person(input()) for _ in range(n)] dp = [[0] * n for _ in range(1 << n)] for ...

0.622815

# fast io import sys def fop(s): sys.stdout.write(str(s)+'\n') def fip(): return sys.stdin.readline() fintinp = lambda : int(fip()) def flistinp(func= int): return list(map(func,fip().split())) def fnsepline(n,func=str): return [func(fip()) for _ in range(n)] #-------------------code------------------------ def even(...

0.622507

from math import gcd from itertools import groupby def gcd_split(seq): gcds= [int(gcd(a,b)==1) for a,b in zip(seq[1:],seq[:-1])] gcds.append(int(gcd(seq[0],seq[-1])==1)) # print(gcds) if max(gcds)==0: return -1 else: splits=[len(list(x))+1 for num,x in groupby(gcds) if num==0] # print(splits) if gcds[0]==...

0.620188

t=int(input()) for _ in range(t): n=int(input()) l=list(map(int,input().split())) if sum(l)!=n or max(l)==n: print('-1') else: d=dict() ans=[-1]*n for i in range(0,n): d[i]=1 for i in range(n): if l[i]!=0: count=l[i] for k,v in list(d.items()): if count>0 and v==1 and i!=k: d[k]=0...

0.619882

for t in range(eval(input())): n = eval(input()) a = [ [] for i in range(n+1) ] for i in range(n-1): x,y = list(map( int, input().split() )) a[x].append(y) a[y].append(x) vis = [0] * (n+1) vis[1] = 1 ans = [1] t1 = [1] t2 = [] while len(t1) > 0 : for u in t1: for...

0.619409

d = [-1] * 1000001 for t in range(int(input())): n, a = int(input()), list(map(int, input().split())) a.sort() for i in range(n): for j in range(i + 1, n): d[a[j] - a[i]] = t i = 1 while any(d[i * j] == t for j in range(1, n)): i += 1 print("YES\n" + ' '.join(str(j * i + 1) for j in ran...

0.619387

import sys n = 500001 sqrt = int(0.75 * n**0.5) data = [0]*(n) ans = [[]] out = [] for i in range(1, sqrt): ans.append([0]*i) j = int(sys.stdin.readline()) qus = sys.stdin.readlines() for qu in qus: q = [int(i) for i in qu.split()] if q[0] == 1: x = q[1] y = q[2] data[x] += y ...

0.618771

# from math import log2 # N = 10000 # for i in range(1,N): # # print(i) # for m in range(i): # if( (m^(m+1))==i ): # print(i) # print(m,m+1,bin(m)[2:]) # print() # break # # else: # # print(-1) # # print() T = int(input()) ans = [] for...

0.618374

for tcase in range(int(input())): n=int(input()) ls = list(map(int, input().split())) oneneed = 2*(n - ls.count(1)) ldct = {0:0} ctr = 0 eaten = 0 for i in range(n-1,-1,-1): eaten += 1 ctr += (1 if ls[i] == 2 else -1) if ctr not in ldct: ldct[ctr] = eaten ...

0.618251

import math def comb(n,r): f = math.factorial return f(n) / f(r) / f(n-r) t=int(input()) for i in range(1,t+1): n=int(input()) arr = list(map(int, input().split())) m=0 ans=0.0 for i in range(0,n): if (arr[i]==-1): m=m+1 for i in range(0,m): ans=ans+((m-i)*comb(m-1,m-1-i)) ans=ans/pow(2,m-1) print('{0:...

0.614487

t = [] l = [] r = [] for _ in range(int(input())): s, g = map(int, input().split()) t.append(s) l.append(s) r.append(g + s) for i in range(1, len(l)): if l[i] < l[i - 1]: l[i] = l[i - 1] - 1 if r[i] > r[i - 1]: r[i] = r[i - 1] + 1 for i in range(len(l) - 2, -1, -1): if l[i] < l[i + 1]: l[i] = l[i + 1]...

0.614236

for _ in range(int(input())): n = int(input()) a = list(map(int,input().split())) ans = 0 count = 0 for i in a: if i>0: ans+=i count+=1 res = [] for i in range(count): if a[i]<=0: res.append(i+1) for i in range(count,n): if a[i]>0: res.append(i+1) print(ans) print(len(res),*res)

0.612478

import sys input = lambda: sys.stdin.readline().rstrip() T = int(input()) for _ in range(T): N = int(input()) A = [int(a) for a in input().split()] if max(A) == min(A): print(1) print(*([1] * N)) elif N % 2 == 0: print(2) print(*([1, 2] * (N // 2))) else: ...

0.611459

for i in range(int(input())): n = int(input()) c = list(map(int, input().split())) d = {} d[0] = -1 parity = 0 ans = 0 for i in range(n): parity ^= 1 << (c[i]-1) for t in range(30): x = parity^(1<<t) if(x in d.keys()): ans = max(ans, i - d[x]) if parity not ...

0.608325

for test in range(int(input())): n = int(input()) a = list(map(int, input().split())) for i in range(0, n, 2): a1 = a[i] a2 = a[i + 1] print(-a2, a1, end=" ") print()

0.608062

import sys def I(): return sys.stdin.readline().rstrip() class Heap: def __init__( self ): self.l = [ -1 ] self.n = 0 def n( self ): return self.n def top( self ): return self.l[ 1 ] def ins( self, x ): self.l.append( x ) n = len( self.l ) - 1 ...

0.607755

# import numpy as npy # idx=sorted(idx,key=functools.cmp_to_key(cmpx)) import bisect import array import functools import math n=int(input()) a=array.array('i',map(int,input().split())) s=0 q=[] q.append(0) for i in range(n): if a[i]==1: q.append(i+1) s=s+1 q.append(n+1) m=n*(n-1)//2 f=[[10000000 f...

0.606606

buck = [[0, 0] for i in range(2201)] m = int(input()) for i in range(m): a = int(input()) ok = True br = 0 for j in range(2200, -1, -1): if a & (1 << j): if(buck[j][0]): a ^= buck[j][0] br ^= buck[j][1] else: ok = False ...

0.606477

import sys readline = sys.stdin.readline N = int(readline()) A = list(map(int, readline().split())) Ans = [] one = [] tt = [] for i in range(N-1, -1, -1): a = A[i] if a == 0: continue if a == 1: Ans.append((i, i)) one.append((i, i)) continue if a == 2: if not on...

0.606474

n = int(input()) a, b = [0] * (n + 2), [0] * (n + 2) s, l = 0, 1 p = [0] * n for i in range(n): t = list(map(int, input().split())) if t[0] == 1: b[t[1] - 1] += t[2] s += t[1] * t[2] elif t[0] == 2: a[l] = t[1] l += 1 s += t[1] else: l -= 1 s -= a[...

0.605917

# cook your dish here def solve(edges,ans): n = len(edges) visited = set() parents = [-1]*(n+1) dp = [0]*(n+1) stack = [1] w = float('inf') x = -1 while stack: node = stack[-1] if node not in visited: count = 0 for kid in edges[node]: if parents[kid] == -1: if kid != 1: parents[kid] = n...

0.605869

import sys def powc(x,n,m): res = 1 xx=x while n: if n&1: res = (res*xx)%m xx=xx*xx%m n >>= 1 return res def circles(u): r = 0 S = [(u,-1,0)] Visited[u] = 0 for s in S: for e in V[s[0]]: if e[0] != s[1]: if Visited[e[0]]==-1: Visited[e[0]] = s[2]^e[1] ...

0.605728

for _ in range(int(input())): n=int(input()) a=input() b=input() l=[] flag=0 for i in range(n): if b[i]!=a[i]: if b[i] in a and b[i]<a[i]: l.append(b[i]) else: flag=1 break if flag==1: print(-1) else: if l==[]: print(0) else: l = sorted(list(set(l)), reverse = True) print(len(...

0.604099

import sys def solve(): n = int(input()) partner = [0]*(2*n) pacani = [] for line in sys.stdin: pacan, telka = [int(x) - 1 for x in line.split()] partner[pacan] = telka partner[telka] = pacan pacani.append(pacan) khavka = [None]*(2*n) for i in range(2*n): ...

0.601387

# cook your dish here T=int(input()) for _ in range(T): n=int(input()) arr=list(map(int,input().split())) left=[-1 for i in range(n)] right=[-1 for i in range(n)] min1=float("inf") for i in range(n): min1=min(arr[i],min1+1) left[i]=min1 min1=float("inf") for i in range(n-1,-1,-1): min1=min(arr[i],min1+1) ...

0.601048

from sys import stdin, stdout import os,sys,__pypy__ def main(): #t = int(stdin.readline()) n,m = list(map(int, stdin.readline().split())) tree = [list() for _ in range(n+1)] mn = [0] * (n+1) for _ in range(m): a,b = list(map(int, stdin.readline().split())) tree[a].append(b) ...

0.596816

3 import math import os import sys DEBUG = 'DEBUG' in os.environ def inp(): return sys.stdin.readline().rstrip() def dprint(*value, sep=' ', end='\n'): if DEBUG: print(*value, sep=sep, end=end) INF = 10 ** 20 def solve(N, A, B): dp = {A[0]: 0, A[0] + 1: B[0], A[0] + 2: B[0] * 2} for i...

0.596695

T = int(input()) for _ in range(T): n = int(input()) if n <= 3: print(-1) else: left = [] for i in range(1, n + 1, 2): left.append(i) right = [] right.append(4) right.append(2) for i in range(6, n + 1, 2): right.append(i) ...

0.594772

import os from io import BytesIO import sys import threading sys.setrecursionlimit(10 ** 9) threading.stack_size(67108864) def main(): # input = BytesIO(os.read(0, os.fstat(0).st_size)).readline def ad(i, j): nonlocal g if j in g[i]: g[i].remove(j) g[j].remove(i) ...

0.59459

t=int(input()) for nbt in range(t): n,k=[int(i) for i in input().split()] a=[int(i) for i in input().split()] nbc=len(set(a))-1 if k==1: if nbc: print(-1) else: print(1) else: print(1+max(0,(nbc-1)//(k-1)))

0.594452

import sys input = sys.stdin.readline n=int(input()) P=[list(map(int,input().split())) for i in range(n-1)] Group=[i for i in range(n+1)] def find(x): while Group[x] != x: x=Group[x] return x def Union(x,y): if find(x) != find(y): Group[find(y)]=Group[find(x)]=min(find(y),find(x)) ANS=[[...

0.593299

import sys from collections import defaultdict from copy import copy R = lambda t = int: t(eval(input())) RL = lambda t = int: [t(x) for x in input().split()] RLL = lambda n, t = int: [RL(t) for _ in range(n)] def solve(): N, Q = RL() P = RL() B = RL() phones = sorted(zip(P, B)) S = d...

0.592349

for _ in range(int(input())): n=int(input()) a=[] b=[] for i in range(4*n-1): c,d=list(map(int,input().split())) a.append(c) b.append(d) c1=0 c2=0 for i in a: c1^=i for i in b: c2^=i print(c1,c2)

0.591143

from collections import defaultdict as dd,deque as dq def opbfs(u,vis,ll,parr): q=dq([(u,0)]) uu=u su=0 while q: u,lol=q.pop() par=parr[u] if(lol%2==0): vis[u]=1 su+=ll[u-1] ll[u-1]=0 for j in d[u]: if(j!=par): q.appendleft((j,lol+1)) ll[uu-1]=su def bfs(height,d,parr): q=dq([1]) while...

0.59034

#=============================================================================================== #importing some useful libraries. from fractions import Fraction import sys import os from io import BytesIO, IOBase from functools import cmp_to_key # from itertools import * from heapq import * from math import gcd,...

0.589661

n = int(input()) v = list(map(int, input().split())) u = sorted(v) dv, du = [0] * (n + 1), [0] * (n + 1) ans = list() for i in range(1, n + 1): dv[i] = dv[i-1] + v[i-1] du[i] = du[i-1] + u[i-1] for i in range(int(input())): (t, l, r) = list(map(int, input().split())) d = dv if t == 1 else du ans.a...

0.588858

def read_int(): return int(input()) def read_ints(): return list(map(int, input().split(' '))) t = read_int() for case_num in range(t): n, k = read_ints() p = [] for i in range(n): ai, bi = read_ints() p.append((bi, ai, i + 1)) p.sort() dp = [[0 for j in range(k + 1)] for...

0.58884

# cook your dish here for i in range(int(input())): n,k=[int(i) for i in input().split()] if(n%2==0): if(k<(n*(n+1))//2 - 1 or k>3*((n//2)**2) - 1):print(-1) elif(k==(n*(n+1))//2 - 1): for i in range(1,n+1):print(i,'',end='') print() else: k,count,p,l,x = k-(n*(n+1))//2 + 1,0,...

0.588514

for _ in range(int(input())): n=int(input()) a=list(map(int,input().split())) ans,small,big=0,2*10**9,-1 for i in range(len(a)-1): if a[i]==-1 and a[i+1]!=-1: small=min(small, a[i+1]) big=max(big, a[i+1]) if a[i]!=-1 and a[i+1]==-1: small = min(small, ...

0.588433

n = int(input()) a = [tuple(map(int, input().split())) for _ in range(n)] s = {a[q]: q+1 for q in range(n)} a.sort() q, q1 = 0, 1 d, d1, d2 = [[[a[0]]]], [], [] while q1 < n: while q1 < n and a[q][0] == a[q1][0]: while q1 < n and a[q][1] == a[q1][1]: d[-1][-1].append(a[q1]) q1 += 1 ...

0.588378

ans = [] for _ in range(int(input())): a, b = list(map(int, input().split())) a, b = max(a, b), min(a, b) if a % b != 0: ans.append(-1) continue x = a // b cnt = 0 while x % 2 == 0: x //= 2 cnt += 1 if x != 1: ans.append(-1) continue ansi =...

0.587654

#!/usr/bin/env python3 import sys import bisect input = sys.stdin.readline sys.setrecursionlimit(10**6) n, m = map(int, input().split()) seen = set() ab = [] for _ in range(n): a, b = map(int, input().split()) ab.append((a, b)) seen.add(a) ab.sort() decomp = list(seen) decomp.sort() node_num = len(decomp)...

0.587107

t=int(input()) for q in range(t): n=int(input()) x=list(map(int,input().split())) dic={} dic2={} for i in range(n): dic2[x[i]]=1 #print dic2 if len(dic2)==n: n+=2 print((n*(n-1)*(n-2)*(n-3))/24) continue counter=0 for i in range(n-1): if x[i] in dic: dic[x[i]]+=1 else: dic[x[i]]=1 for j in...

0.587055

from collections import Counter tc=int(input()) for k in range(tc): n=int(input()) a=list(map(int, input().rstrip().split())) b= list(map(int, input().rstrip().split())) cc=sorted(a+b) #print('cc = ',cc) p=[] q=[] #print('len(cc) = ',len(cc)) #print('len = ',(2*n)) #rx=0 for i in range(0,(2*n),2): p.append...

0.586112

t = int(input()) for k in range(t): x = int(input()) if x == 0: print(1, 1) continue for i in range(1, int(x ** 0.5) + 2): if x % i == 0 and (x // i - i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x: a, b = x // i, i y = (a - b) // 2 n = a -...

0.585724

import sys sys.setrecursionlimit(10000000) def mergeSortInversions(arr): if len(arr) == 1: return arr, 0 larr=len(arr) a = arr[:larr//2] b = arr[larr//2:] a, ai = mergeSortInversions(a) b, bi = mergeSortInversions(b) c = [] i = 0 j = 0 inversions = 0 + ai + bi la=len(a) while i < la and j < ...

0.585454

t=eval(input()) for i in range(0,t): x=input() nm=x.split(' ') nm[0]=int(nm[0]) nm[1]=int(nm[1]) csoint=[] lsoint=[] csofloat=[] lsofloat=[] for j in range(0,nm[0]): a=input() b=a.split(' ') b[0]=int(b[0]) b[1]=int(b[1]) csoint.append(b[0]) ...

0.584826

from math import * n, q = list(map(int, input().split())) after = min(15, n) before = n - after def calc(left, right): return right * (right + 1) // 2 - left * (left - 1) // 2 def perm(i): unused = [i + 1 for i in range(after)] arr = [] for j in reversed(list(range(after))): cur = i // fact...

0.584695

n = int(input()) pos,tree,ans,sz = list(map(int,input().split())) if n > 1 else [],[],[],[] for i in range(n): tree.append([]) ans.append(0.0) sz.append(0) for i in range(n-1): tree[pos[i]-1].append(i+1) for i in range(n)[::-1]: sz[i] = 1 for to in tree[i]: sz[i] += sz[to] for i in range(n): for to...

0.584184

import sys #f = open('input', 'r') f = sys.stdin n = int(f.readline()) a = list(map(int, f.readline().split())) cnt = 0 for i in range(n): cnt += sum([1 for x in a[i+1:] if x < a[i]]) m = int(f.readline()) for _ in range(m): l, r = list(map(int, f.readline().split())) c = r-l cnt += (c*(c+1)//2)%2 if cnt%2...

0.583883

import sys t = int(input()) def g(a,b): if (a > b): tmp = a a = b b = tmp if (b == a): return 0 if (b % a == 0): return int(b/a)-1 r = g(b%a,a) q = int(b/a) if (r >= q): return q-1 else: return q def mex(x): n = len(list(x.keys())) for i in range(n): if (i not in x): return i return i d...

0.58373

t = int(input()) for faw in range(t): n = int(input()) a = [0] + list(map(int,input().split())) nun = [] ans = [] f = True for i in range(1, n + 1): if a[i] == a[i-1]: if len(nun) == 0: f = False break else: ans.appe...

0.583648

for __ in range(eval(input())): x = eval(input()) a = list(map(int,input().split())) key = eval(input()) query = eval(input()) maxvisited = x #maximum visted value j = x-1 ans = [] val = 0 while j>=0: if a[j]==key: ans.append(val+1) val = val +1 ...

0.581735

# cook your dish here for test in range(0,int(input())): A,B = map(int,input().split()) diff = abs(A-B) count=0 if not(A^B): print(-1) else: for i in range(1,int(diff**(1/2))+1): if diff%i==0: if diff/i==i: count+=1 else: count+=2 print(count)

0.581404

def f(x, y, a, b, n): return a + (x - a) * cos[n] - (y - b) * sin[n], b + (x - a) * sin[n] + (y - b) * cos[n] def check(p): d = {} for i in range(len(p) - 1): for j in range(i + 1, len(p)): dist = (p[i][0] - p[j][0]) ** 2 + (p[i][1] - p[j][1]) ** 2 d[dist] = d.get(dist, 0) ...

0.580942

import sys input = sys.stdin.readline def main(): n, m = map(int, input().split()) LR = [list(map(int, input().split())) for _ in range(n)] BIT = [0]*(m+2) def add(i, a): while i <= m+1: BIT[i] += a i += i&(-i) def bit_sum(i): res = 0 while i > 0: res += BIT[i] i -= i&(...

0.580604

n = int(input()) + 1 a = list(map(int, input().split())) + [1 << 50] l, p, r = [0] * n, list(range(n)), [] for i in range(int(input())): t = list(map(int, input().split())) if t[0] == 2: r.append(l[t[1] - 1]) else: x = t[1] - 1 s, d = [x], t[2] while True: if p[x...

0.579809

# cook your dish here def check(px,x): if px[1]==x[1]: return (x[2]-px[2])<=(x[0]-px[0]) and (x[2]>=px[2]) else: return (x[2]-px[2]+1)<=(x[0]-px[0]) and (x[2]>=px[2]) def checkdouble(px,x): if px[3]==x[3]: return (x[4]-px[4])<=(x[0]-px[0]) and (x[4]>=px[4]) else: return (x[4]-px[4]+1)<=(x[0]-px[0]) and (...

0.579202

from sys import stdin def bitadd(a,w,bit): x = a while x <= (len(bit)-1): bit[x] += w x += x & (-1 * x) def bitsum(a,bit): ret = 0 x = a while x > 0: ret += bit[x] x -= x & (-1 * x) return ret class RangeBIT: def __init__(self,N,indexed): self...

0.578598

N = int(input()) u, v, w = [0]*(N-1), [0]*(N-1), [0]*(N-1) n = [-1] * N # n[][0] 色　n[][1] 連結先一覧リスト n[][2] mod2 for i in range(N): n[i] = [0]*4 n[i][1] = [] n[i][2] = [] for i in range(N-1): u[i], v[i], w[i] = list(map(int, input().split())) n[u[i]-1][1].append(v[i]-1) n[v[i]-1][1].append(u[i]-...

0.578464

t = int(input()) while t: l, r = list(map(int, input().split())) if l * 2 <= r: print(l, 2 * l) else: print(-1, -1) t -= 1

0.578401

t=int(input()) for i in range(t): n,m=list(map(int,input().split())) l=[0]+list(map(int,input().split())) s=0 c=1 m1=[] for i in range(n): d,f,b=list(map(int,input().split())) if(l[d]>0): m1.append(d) s+=f l[d]-=1 else: m1.append(0) s+=b for i in range(n): if(m1[i]==0): for j in range(c...

0.578148

Chaneka has a hobby of playing with animal toys. Every toy has a different fun value, a real number. Chaneka has four boxes to store the toys with specification: The first box stores toys with fun values in range of $(-\infty,-1]$. The second box stores toys with fun values in range of $(-1, 0)$. The third box stor...

t = int(input()) for _ in range(t): a, b, c, d = [int(i) for i in input().split(" ")] sgn = (a+b)%2 small = False large = False if a == 0 and d == 0: small = True if b == 0 and c == 0: large = True okay = [True] * 4 if sgn == 0: okay[0] = False okay[1] = False else: okay[2] = False...

0.870513

import sys # sys.stdin = open('in.txt') s = sys.stdin.read().split() p = 0 def getSm(k, a, b, c, d): return (k + 1) * a - (k * (k + 1) >> 1) * b * d t = int(s[p]) p += 1 res = [] for _ in range(t): a = int(s[p]) p += 1 b = int(s[p]) p += 1 c = int(s[p]) p += 1 d = int(s[p]) p...

0.643404

t=int(input()) for j in range(t): a,b,c,d=map(int, input().split()) print(b,c,c)

0.641179

for _ in range(int(input())): n, a, b, c, d = tuple(map(int, input().split())) if (a - b) * n > c + d or (a + b) * n < c - d: print('No') else: print('Yes')

0.638077

import sys input = sys.stdin.readline t = int(input()) out = [] for _ in range(t): a, b, c, d = list(map(int, input().split())) dX = c - a dY = d - b out.append(dX * dY + 1) print('\n'.join(map(str,out)))

0.636429

from math import * for t in range(int(input())): a, b, c, d = map(int, input().split()) x, y, x1, y1, x2, y2 = map(int, input().split()) x += b - a y += d - c if (x < x1 or x > x2 or y < y1 or y > y2): print("No") continue if x1 == x2 and x1 == x and (a != 0 or b != 0): p...

0.63269

for _ in range(int(input())): a,b,c,d=list(map(int,input().split())) if(a==b): print('YES') elif(c==d): print('NO') else: if(abs(a-b)%abs(c-d)==0): print('YES') else: print('NO')

0.62399

#!/usr/bin/python import sys def __starting_point(): t = int(input()) for iteration in range(t): r,c,m_inp,k_inp,j_inp = input().strip().split(" ") r=int(r) c=int(c) m_inp=int(m_inp) k_inp=int(k_inp) j_inp=int(j_inp) ans = "" if (r*c) != (m_inp+k_inp+j_inp): print("No") continue else: fla...

0.623808

S = input() SA = [0] n = 0 for c in S: if c=='A': n+=1 SA.append(n) T = input() TA = [0] n = 0 for c in T: if c=='A': n+=1 TA.append(n) q = int(input()) for _ in range(q): a, b, c, d = list(map(int, input().split())) nSA = SA[b]-SA[a-1] nSB = b-a+1-nSA nTA = TA[d]-TA[c-1] nTB = d...

0.619767

import decimal; from decimal import *; def solve(a, b, min1, min2, min3, min4, x, y): if a > b: return []; solMin1 = (a/y+b)/(y-1/y); solMin2 = (b/y+a)/(y-1/y); solMin1 *= (x*y); solMin2 *= (x*y); if solMin1 >= min1 and solMin1 <= min2 and solMin2 >= min3 and solMin2 <= min4: # Solution found return [a, s...

0.618301

import sys readline = sys.stdin.readline read = sys.stdin.read ns = lambda: readline().rstrip() ni = lambda: int(readline().rstrip()) nm = lambda: map(int, readline().split()) nl = lambda: list(map(int, readline().split())) prn = lambda x: print(*x, sep='\n') def solve(): a, b, c, d = nm() if a <= b: ...

0.614701

for _ in range(int(input())): d=int(input()) anws=False if d**2>=4*d: root=(d**2-4*d)**0.5 a=(d+root)/2 b=(d-root)/2 anws=True if anws: print("Y {:.9f} {:.9f}".format(a,b)) else: print("N")

0.604702

#Simple non-optimized class of matrices. Used with small dense matrices. import functools import itertools import math class NotAMatrixError(Exception): pass class MatrixSizeError(Exception): def __init__(self, s1, s2): print('sizes do not match : ', s1, ', ', s2) class NotSquareError(Exception): ...

0.603245

import sys import math def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def MI(): return map(int, sys.stdin.readline().split()) def SI(): return sys.stdin.readline().strip() t = II() for q in range(t): a,b,c,d = MI() print(max(a+b,c+d))

0.601929

# cook your dish here try: for i in range(int(input())): v1,t1,v2,t2,v3,t3=map(int,input().split()) ok = 0 if t1 <= t3 <= t2: x, y = t2 - t3, t3 - t1 ok = x * v3 <= (x + y) * v1 and y * v3 <= (x + y) * v2 print('YES' if ok else 'NO') except: pass

0.601596

#!/usr/bin/env python2 def gc(c): return 'a' <= c <= 'h' def gd(c): return '1' <= c <= '8' t = int(input()) for i in range(t): line = input() if len(line) != 5: print("Error") continue if line[2] != '-': print("Error") continue x1 = line[0] y1 = line[1] x2 = line[3] y2 = line[4] ...

0.590203

for _ in range(int(input())): a,b,c,x,y,z = list(map(int,input().split())) if a == 0 and b == 0 and c == 0 and x == 0 and y == 0 and z == 0: print(0) continue ans = 0 if a == 0 and b == 0 and c == 0: st = set((abs(x-a)%2,abs(y-b)%2,abs(z-c)%2)) if st == {0,1}: ans = 1 else...

0.589428

import sys import time for line in sys.stdin: ll = len(line) - 1 fail = 0 for i in range(ll): if i == ll - 1 - i: if int(line[i]) not in [3, 7]: fail = 1 continue x = int(line[i]) y = int(line[ll - 1 - i]) if (x, y) not in [(3, 3), (4,...

0.5885

a = [] b = [] for i in range(3): t = input().split() a.append([int(t[0]), int(t[1]), int(t[2]) ] ) b.append([1, 1, 1]) def add(i, j, w): if 2>=i>=0 and 2>=j>=0: b[i][j] += w for i in range(3): for j in range(3): add(i, j, a[i][j]) add(i-1, j, a[i][j]...

0.587637

def main(): import sys input = sys.stdin.readline def solve(): n = int(input()) maxx = 10**5 minx = -10**5 maxy = 10**5 miny = -10**5 for _ in range(n): x, y, f1, f2, f3, f4 = map(int, input().split()) if not f1: ...

0.584243

def main(): t = int(input()) for z in range(t): n, k, d1, d2 = map(int, input().split()) if n % 3 != 0: print('no') continue f = 0 for i in [-1, +1]: for j in [-1, +1]: w = (k - i * d1 - j * d2) if f == 0 and (w ...

0.581087

import os, sys # zeilen = [l.strip() for l in sys.stdin.readlines()] q = int(sys.stdin.readline().strip()) for _ in range(q): a, b = list(map(int, sys.stdin.readline().strip().split())) word = sys.stdin.readline().strip() gaps = sorted([len(gap) for gap in word.split('X') if len(gap)>= b]) if len(gaps) == ...

0.578462

import sys def binpow(a, n, p): res = 1 while n > 0: if n % 2 == 1: res = (res * a) % p a = (a * a) % p n >>= 1 return res def main(): result = [] t = int(sys.stdin.readline()) for line in sys.stdin.readlines(): p, q, b = list(map(int, line.spli...

0.57694

a=int(input()) b=int(input()) c=int(input()) d=int(input()) e=int(input()) x=int(input()) ls=[a,b,c,d,e] if (e-a)<=x: print("Yay!") else: print(":(")

0.57641

# cook your dish here T = int(input()) for i in range(T): l = list(map(int, input().split())) n, k, m, x = l[0], l[1], l[2], l[3] if k == 1: if n == m: print("yes") else: print("no") elif m % k > 1: print("no") elif k == 2: stack = [] v...

0.576155

n = int(input()) ans = 'YES\n' for i in range(n): x1, y1, x2, y2 = map(int, input().split()) res = (x1 & 1) * 2 + (y1 & 1) + 1 ans += str(res) + '\n' print(ans)

0.574062

from math import * zzz = int(input()) for zz in range(zzz): a, b, x, y = list(map(int, input().split())) print(max(x*b, (a-x-1)*b, y*a, (b - y - 1)*a))

0.573621

# cook your dish here for _ in range (int(input())): x1,y1,x2,y2=map(int,input().split()) av1=(x1+y1)/2 av2=(x2+y2)/2 if(av1>av2): print(av1-av2," DEGREE(S) ABOVE NORMAL") else: print(av2-av1," DEGREE(S) BELOW NORMAL")

0.571498

import math import copy try: import psyco psyco.full() except ImportError: pass def isSharp(ang): return ang > math.pi/4 + 0.00001 def unitVector(p2, p1): d0 = p2[0] - p1[0] d1 = p2[1] - p1[1] d = math.sqrt(d0*d0 + d1*d1) if d != 0: return [d0/d, d1/d] return [0, 0] def compVectors(P): V = [] for i i...

0.56989

S = input() a = int(S[0]) b = int(S[1]) c = int(S[2]) d = int(S[3]) if a+b+c+d==7: print('{}+{}+{}+{}=7'.format(a,b,c,d)) elif a+b+c-d==7: print('{}+{}+{}-{}=7'.format(a,b,c,d)) elif a+b-c+d==7: print('{}+{}-{}+{}=7'.format(a,b,c,d)) elif a+b-c-d==7: print('{}+{}-{}-{}=7'.format(a,b,c,d)) elif a-b+c+...

0.568188

# cook your dish here for t in range(int(input())): a1,a2,a3,a4,a5,p=[int(x)for x in input().rstrip().split()] if (a1+a2+a3+a4+a5)*p >120: print("Yes") else: print("No")

0.565489

from sys import stdin from collections import deque def NC_Dij(lis,start): ret = [float("inf")] * len(lis) ret[start] = 0 q = deque([start]) plis = [i for i in range(len(lis))] while len(q) > 0: now = q.popleft() for nex in lis[now]: if ret[nex] > ret[now] + 1: ...

0.563682

# cook your dish here t=int(input()) for _ in range(t): x1,y1,x2,y2=map(int,input().split()) x3,y3,x4,y4=map(int,input().split()) if (x1==x3 and y1==y3)or(x2==x4 and y2==y4): print("yes") elif (x1==x4 and y1==y4)or(x2==x3 and y2==y3): print("yes") else: if(y1==y2)and(y1==y3)and(y1==y4): a1=max(x1,x2);a2=m...

0.561118

for _ in range(int(input())): n, m, a, b = list(map(int, input().split())) if a * n != b * m: print('NO') else: ar = [] for i in range(n): ar.append([0] * m) x, y = 0, a for i in range(n): if x < y: for j in range(x, y): ...

0.559754

# cook your dish here try: t = int(input()) for i in range(t): ar=list(map(int,input().split())) if (ar[0]**2 + ar[1]**2 > ar[2]**2 + ar[3]**2): print("B IS CLOSER") else: print("A IS CLOSER") except: pass

0.558255

import sys input = sys.stdin.readline G0=[[[[0]*5500 for i in range(6)] for j in range(6)] for k in range(6)] G1=[[[[0]*5500 for i in range(6)] for j in range(6)] for k in range(6)] G2=[[[[0]*5500 for i in range(6)] for j in range(6)] for k in range(6)] for x in range(1,6): for y in range(1,6): for z in...

0.557691

from fractions import gcd import re INSERTER = re.compile(r'(?<!\d)(?=[xyt])') FINDER = re.compile(r'-?\d+') def lcm(a,b): return a*b//gcd(a,b) def simplify(s): return INSERTER.sub('1', s.replace(' ','')) def para_to_rect(*equations): coefs = [ list(map(int, FINDER.findall(eq))) for eq in map(simplify, e...

0.556686

t=int(input()) for x in range(t): a,b,n,m= map(int,input().split(" ")) if a+b<n+m: print("No") else: if m>min(a,b): print("No") else: print("Yes")

0.553974

t = int(input()) for _ in range(t): x, y, k, n = [int(x) for x in input().split()] k = k*2 temp = abs(x-y) if(temp%k == 0): print("Yes") else: print("No")

0.553895

#-*- coding:utf-8 -*- import sys # class Point: # def __init__(self, x, y): # self.x = x # self.y = y # def mul(self, k): # return Point(k * self.x, k * self.y) # def __add__(self, other): # return Point(self.x + other.x, self.y + other.y) # def __sub__(self, other)...

0.553437

# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!! # TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!! # TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!! from sys import stdin, stdout from itertools import accumulate T = int(input()) #s = input() #N,M,K,Q = [int(x) for x in stdin.readline().split()] #arr = [int(x) for x in stdin.readline().split()] chec...

0.552863

A,B,C,D=map(int,input().split());print("YNeos"[(A+D-1)//D<(C+B-1)//B::2])

0.551137

# # ------------------------------------------------ # ____ _ Generatered using # / ___| | | # | | __ _ __| | ___ _ __ ______ _ # | | / _` |/ _` |/ _ \ '_ \|_ / _` | # | |__| (_| | (_| | __/ | | |/ / (_| | # \____\____|\____|\___|_| |_/...

0.55107

w, r = open('output.txt', 'w'), open('input.txt', 'r') s, y = [0] * 466, [0, 100, 131, 159, 190, 220, 251, 281, 312, 343, 373, 404, 434] for i in range(int(r.readline())): m, d, p, t = map(int, r.readline().split()) x = y[m] + d s[x] -= p s[x - t] += p for i in range(465): s[i + 1] += s[i] w.write(s...

0.550837

T=eval(input()) for i in range(T): a,b,c,d=list(map(int,input().split())) x=c-a n1=b-a+1 n2=d-c+1 s=0 if x<=0: t=n2-abs(x)-1 for j in range(t,max(0,d-b-1),-1): s=s+j if x>0: t=n2 for j in range(x,max(0,c-b-1),-1): s=s+t if (c-b)<=0: for j in range(t-1,max(0,d-b-1),-1): s=s+j print(s) ...

0.549061

def solve(x, y, p, q): if p == 0: return 0 if x == 0 else -1 pp = (x - 1) // p + 1 if p != 0 else 0 L = max((y - 1) // q + 1, pp) - 1 L = max(L, -1) z = y - x INF = L + 10 ** 10 R = INF while R - L > 1: M = (L + R) >> 1 cur = q * M curp = p * M curz = cur ...

0.547973

A,B,C,D=list(map(int,input().split())) for i in range(2): for j in range(2): for k in range(2): for l in range(2): sum1 = 0 sum2 = 0 if i == 1: sum1 += A else: sum2 += A if j =...

0.547153

from math import gcd from math import ceil from itertools import combinations as c t=int(input()) for _ in range(t): n,m,a,d=list(map(int,input().split())) l=[] for i in range(5): l.append(a+i*d) ans=m-n+1 for i in range(1,6): x=list(c(l,i)) for j in x: ...

0.546153

# python3 import sys def read_all_following_lines(): lines = sys.stdin.readlines() return (tuple(map(int, line.split())) for line in lines) class AbcString(object): def __init__(self, string): self.prefix_bc = [0] self.a_strike = [0] bc, strike = 0, 0 for symbol in strin...

0.546145

def check_root(string): try: a,b,c,d = [int(i) for i in string.split(',')] if not (a == b-1 and a == c-2 and a == d-3): return 'not consecutive' s = a*b*c*d+1 return str(s)+', '+str(int(s**0.5)) except: return 'incorrect input'

0.544986

for _ in range(int(input())): n, x, y, d = map(int, input().split()) tt = abs(x - y) if tt % d != 0: ans = -1 if (y - 1) % d == 0: ans = (x - 1 + d - 1) // d + (y - 1) // d if (n - y) % d == 0: cc = (n - x + d - 1) // d + (n - y) // d if ans == -1 or cc < ans: ans = cc print(ans) else: print(...

0.543373

# your code goes here from sys import stdin, stdout n = int(stdin.readline()) while n: n -= 1 k, l, e = map(int, stdin.readline().strip().split(' ')) a = map(int, stdin.readline().strip().split(' ')) x = float(l) / float(e + sum(a)) if x - int(x): stdout.write("NO\n") else: stdout.write("YES\n")

0.542778

# cook your dish here for j in range(int(input())): p,q,r,s =map(int,input().split()) x=(s-p) y=(s-q) z=(s-r) print(y,z,x)

0.542763

"""Cowboy Beblop at his computer, problem 717I from https://codeforces.com/problemset/problem/717/I""" # from fractions import Fraction # def convert_to_fractions(poly): # """convert polygon vertex to fractional type""" # poly_frac = [] # for x, y, z in poly: # vertex = (Fraction(x), # ...

0.542757

def g(x,y): d = x[0]>=y[0] and x[1]>=y[1] and x[2]>=y[2] e= x[0]>y[0] or x[1]>y[1] or x[2]>y[2] return d and e t=int(input()) for _ in range(t): a=list(map(int,input().split())) b=list(map(int,input().split())) c=list(map(int,input().split())) if g(a,b) and g(b,c): print('yes') elif g(a,c) and g(c,b): prin...

0.541449

def f(x, y, a, b, n): return a + (x - a) * cos[n] - (y - b) * sin[n], b + (x - a) * sin[n] + (y - b) * cos[n] def check(p): d = {} for i in range(len(p) - 1): for j in range(i + 1, len(p)): dist = (p[i][0] - p[j][0]) ** 2 + (p[i][1] - p[j][1]) ** 2 d[dist] = d.get(dist, 0) ...

0.54116

t=int(input()) for _ in range(t): n,a,b,c,d,p,q,y=list(map(int,input().split())) l=list(map(int,input().split())) ans = abs((l[b-1]-l[a-1]))*p x=abs(l[c-1]-l[a-1])*p if x<=y: x=y+abs(l[d-1]-l[c-1])*q+abs(l[b-1]-l[d-1])*p ans=min(ans,x) print(ans)

0.53836

t = input() t = int(t) for _ in range(t): n, m, x, y = input().split() n = int(n) m = int(m) x = int(x) y = int(y) n -= 1 m -= 1 flag = 0 if n % x == 0 and m % y == 0: flag = 1 n -= 1 m -= 1 if n >= 0 and m >= 0: if n % x == 0 and m % y == 0: flag = 1 if flag == 1: print("Chefirnemo") else: ...

0.538215

import sys t = int(input()) def g(a,b): if (a > b): tmp = a a = b b = tmp if (b == a): return 0 if (b % a == 0): return int(b/a)-1 r = g(b%a,a) q = int(b/a) if (r >= q): return q-1 else: return q def mex(x): n = len(list(x.keys())) for i in range(n): if (i not in x): return i return i d...

0.537804

import sys blocks = {} for i in range(1, 10): blocks[i] = [(0, 0)] for i in range(2, 10, 2): for j in range(1, i / 2 + 1): blocks[i].append((j, 0)) blocks[i + 1].append((0, j)) # print blocks blocks[10] = [(0, 0), (0, 1), (1, 0), (1, 1)] blocks[11] = [(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1...

0.537142

import sys s=sys.stdin.readline().split()[0] m=int(sys.stdin.readline()) Numx=[] Numy=[] Numz=[] x=0 y=0 z=0 for i in range(len(s)): if(s[i]=='x'): x+=1 if(s[i]=='y'): y+=1 if(s[i]=='z'): z+=1 Numx.append(x) Numy.append(y) Numz.append(z) Ans="" for M in range(m): ...

0.536573

k=str(input()) l=len(k) paths=[] for i in range(l): paths.append([1]*i+[int(k[i])]+[10]*(l-i-1)) lens = [sum(p) for p in paths] n = sum(lens)+2 m = ['']*n m[0] = 'N'*2 for i in range(len(paths)): m[0] += 'Y'*paths[i][0]+'N'*(lens[i]-paths[i][0]) m[1] = 'N' for i in range(len(paths)): m[1] += 'N'*(lens[i]-paths[i][-1...

0.534487

f,g=lambda X:[list(x) for x in zip(*X[::-1])],lambda X:[list(x) for x in zip(*X)][::-1] def ROTF(U,L,F,R,B,D): U[2],(L[0][2],L[1][2],L[2][2]),(R[0][0],R[1][0],R[2][0]),D[0]=([L[0][2],L[1][2],L[2][2]][::-1],list(D[0]),list(U[2]),[R[0][0],R[1][0],R[2][0]][::-1]) return (U,L,f(F),R,B,D) def ROTS(U,L,F,R,B,D)...

0.533778

import sys def input(): return sys.stdin.readline().strip() def I(): return int(input()) def LI(): return list(map(int, input().split())) def IR(n): return [I() for i in range(n)] def LIR(n): return [LI() for i in range(n)] def SR(n): return [S() for i in range(n)] def S(): return input() def LS(): return input().spl...

0.53366

def solve(lst): a, b, c = lst[0] < lst[1], lst[1] < lst[2], lst[-1] < lst[0] m = a if a == b else c return ('R' if c == m else '') + ('A' if m else 'D')

0.53321

from operator import itemgetter t=int(input()) for i in range(t): n=int(input()) m,f=list(map(int,input().split())) x=list(map(int,input().split())) my,fy=0,0 check=[0]*n #print check for j in range(n): if x[j]>0 and x[j]%m==0 and check[j]==0: check[j]=1 my+=1 #print check for j in range(n): if x[j]>...

0.532265

for i in range(int(input())): m,tc,th=map(int,input().split()) x=(th-tc) if x%3!=0: print("Yes") else: if (x//3)<=m: print("No") else: print("Yes")

0.532174

import numpy as np N=10**6+1 t=eval(input()) inp = () t1=ord('z') #bag=[[0 for _ in xrange(t1)] for _ in xrange(N+1)] bag=np.zeros((N+1,t1),dtype=np.int) #print bag while t: t-=1 inp=input().split() t2=ord(inp[3]) - ord('a') t3=int(inp[1]) t4=int(inp[2]) + 1 if inp[0]=="1": #print "enter" bag[t3][t2]+=int(...

0.531898

t = int(input()) for i in range(t): a, b = map(int, input().split()) if a == 1: if b == 1: print('YES') else: print('NO') continue if a <= 3: if b <= 3: print('YES') else: print('NO') continue print('YES')

0.529634

import sys readline = sys.stdin.readline def accumulate2d(X): N = len(X) M = len(X[0]) for i in range(0, N): for j in range(1, M): X[i][j] += X[i][j-1] for j in range(0, M): for i in range(1, N): X[i][j] += X[i-1][j] return X N, M, Q = map(int...

0.528883

def main(): import sys from array import array from collections import deque input = sys.stdin.readline H, W, Q = list(map(int, input().split())) grid = array('b', [0] * (H*W)) #flg_0 = 0 #flg_1 = 0 for h in range(H): line = input().rstrip('\n') """ if "0" in...

0.528609

def main(): n, k = map(int, input().split()) a, b, c, d = (list(map(int, input().split())) for _ in 'abcd') ss, tt, n2, res = [*b, *c[::-1]], [*a, *d[::-1]], n * 2, [] yx = [*[(2, i + 1) for i in range(n)], *[(3, i) for i in range(n, 0, -1)]] def park(): for i, s, t, (y, x) in zip(range(n2)...

0.52716

# cook your dish here n=int(input()) for i in range(n): S, SG, FG, D, T = map(int, input().split()) speed = (D*180)/T + S if abs(SG-speed) == abs(FG-speed): print('DRAW') elif abs(SG-speed) > abs(FG-speed): print('FATHER') else: print('SEBI')

0.526011

class Solution: def makesquare(self, nums): """ :type nums: List[int] :rtype: bool """ if len(nums) < 4: return False length = sum(nums) if length % 4: return False length = (int) (length / 4) ...

0.525328

def prod2sum(a, b, c, d): e = sorted([abs(a*d-b*c), abs(a*c+b*d)]) f = sorted([abs(a*c-b*d), abs(a*d+b*c)]) if e == f: return [e] else: return sorted([e, f])

0.524893

import sys from collections import defaultdict as dd from collections import deque from fractions import Fraction as f from copy import * from bisect import * from heapq import * from math import * from itertools import permutations def eprint(*args): print(*args, file=sys.stderr) zz=1 #sys.setrecursionlimit(10*...

0.524703

from math import gcd n, m, q = map(int, input().split()) d = gcd(n, m) x = n // d y = m // d for _ in range(q): sx, sy, ex, ey = map(int, input().split()) p1 = 0 p2 = 0 if sx == 1: p1 = (sy - 1) // x else: p1 = (sy - 1) // y if ex == 1: p2 = (ey - 1) // x else: ...

0.524427

t = int(input()) for i in range(0,t): a = input() b = input() agts=bgts=afour=bfour=aseven=bseven=altf=bltf=afts=bfts=0; for j in a: if j >= '7': if j > '7': agts += 1 else: aseven += 1 elif j >= '4': if j > '4': afts += 1 else: afour += 1 else: altf += 1 for j in b: ...

0.523846

# https://www.codechef.com/problems/RECTLIT def assess(sq,points): EWct = 0 NSct = 0 for a,b in points: EW = (a == 0 or a == sq) NS = (b == 0 or b == sq) if EW and NS: return 'yes' EWct += EW NSct += NS if NSct + EWct == 0 or len(points) =...

0.523107

t = int(input()) # a = list(map(int, input().split())) for _ in range(t): a,b,x,y,n = map(int,input().split()) options = [] a2 = max(a-n,x) b2 = max(b-(n-(a-a2)),y) options.append(a2*b2) b2 = max(b-n,y) a2 = max(a-(n-(b-b2)),x) options.append(a2*b2) print(min(options))

0.52269

t=int(input()) for nt in range(t): a,b,c=map(int,input().split()) print (max(0,abs(a-b)+abs(b-c)+abs(a-c)-4))

0.52262

from heapq import * import sys MOD = 1000000181 def addM(a,b): return (a+b)%MOD def mulM(a,b): return (a*b)%MOD def dijk(adj,n,s): dist = [10**18]*n ways = [0]*n frontier = [] dist[s] = 0 ways[s] = 1 heappush(frontier,(0,s)) while (len(frontier)>0): x = heappop(frontier) ...

0.522611

from math import atan2, degrees def get_score(x,y): r, a = (x*x + y*y)**0.5, degrees(atan2(y, x)) + 9 t = str([6,13,4,18,1,20,5,12,9,14,11,8,16,7,19,3,17,2,15,10][int(a + 360 if a < 0 else a)//18]) for l, s in [(6.35, 'DB'),(15.9,'SB'),(99,t),(107,'T'+t),(162,t),(170,'D'+t)]: if r <= l: return s ...

0.522289

import sys def get_sol(a, b, c, n, reverse): #1 if reverse[0]: a = (a[1], a[0], a[2]) if reverse[1]: b = (b[1], b[0], b[2]) if reverse[2]: c = (c[1], c[0], c[2]) ans = [] if a[0] == b[0] == c[0] == n: if a[1] + b[1] + c[1] == n: for i in range(a[1]): ans.append(a[2]*n) for i in range(b[1]): ...

0.521724

import sys; nbDancers, nbDances = list(map(int, sys.stdin.readline().split(' '))); dancers = [0]*(nbDancers+1); for line in sys.stdin: taken = [False, False, False, False]; ds = list(map(int, line.split(' '))); for d in ds: taken[dancers[d]] = True; for d in ds: if dancers[d] == 0: if not taken[1]: ...

0.520965

# cook your dish here t=int(input()) for _ in range(t): st=input() s=set(st) a=[] f1=f2=0 for i in s: a.append(st.count(i)) a.sort() if len(a)>=3: for i in range(2,len(a)): if a[i]!=a[i-1]+a[i-2]: f1=1 break x=a[0] a[0]=a[1] a[1]=x for i in range(2,len(a)): if a[i]!=a[i-1]+a[i-2]: f...

0.520869

# cook your dish here def check(px,x): if px[1]==x[1]: return (x[2]-px[2])<=(x[0]-px[0]) and (x[2]>=px[2]) else: return (x[2]-px[2]+1)<=(x[0]-px[0]) and (x[2]>=px[2]) def checkdouble(px,x): if px[3]==x[3]: return (x[4]-px[4])<=(x[0]-px[0]) and (x[4]>=px[4]) else: return (x[4]-px[4]+1)<=(x[0]-px[0]) and (...

0.520418

class Solution: def validSquare(self, p1, p2, p3, p4): """ :type p1: List[int] :type p2: List[int] :type p3: List[int] :type p4: List[int] :rtype: bool """ def length(x,y): return (x[0]-y[0])*(x[0]-y[0]) + (x[1]-y[1])*(x...

0.519705

p, m = [i for i, x in enumerate(input(), 1) if x == '1'], int(input()) r, q = [(-1, 0, 0, [])], 'NO' while r: x, d, s, t = r.pop() if s == m: q = 'YES\n' + ' '.join(map(str, t)) break for y in p: if y != x and y > d: r.append((y, y - d, s + 1, t + [y])) print(q)

0.519633

# for _ in range(1): for _ in range(int(input())): # a, b = map(int, input().split()) n = int(input()) # arr = list(map(int, input().split())) # s = input() x = 6 + 10 + 14 if x + 1 > n: print('NO') continue y = n - x if y not in (6, 10, 14): print('YES') ...

0.519237

from sys import stdin, stdout k = int(stdin.readline()) n, m = map(int, stdin.readline().split()) left, right, down, up = [], [], [], [] coordinates = [] for i in range(k): x1, y1, x2, y2 = map(int, stdin.readline().split()) if x1 == x2: if y1 < y2: coordinates.append((x1, y1, x2, y2,...

0.518772

import sys def mex(S,W,C,start,end): """Returns Nim-number of S[start:end]""" key=(start,end) try: return C[key] except KeyError: pass A=set() for s in range(start,end): for e in range(start+1,end+1): if S[s:e] not in W: continue A.add(mex(S,W,C,s...

0.518584

def __starting_point(): print(2001) for i in range(1000): print(str(i + 1) + ' ' + str(1) + ' ' + str(i + 1) + ' ' +str(2)) print(str(1) + " " + str(1) + " " +str(1) + " " + str(2)) for i in range(1000): print(str(i + 1) + ' ' + str(1) + ' ' + str(i + 1) + ' ' +str(2)) __starting_point(...

0.518287

import sys input = sys.stdin.readline MOD = 987654103 n = int(input()) t = input() place = [] f1 = [] e1 = [] s = [] curr = 0 count1 = 0 for i in range(n): c = t[i] if c == '0': if count1: e1.append(i - 1) if count1 & 1: s.append(1) curr += 1 ...

0.517754

def four_piles(n,y): x,r=divmod(n*y,(y+1)**2) return [] if r or x==y else [x+y,x-y,x*y,x//y]

0.517689

t=int(input()) for i in range(t): ans=0 x,y=list(map(int,input().split())) if y>x: if (y-x)%4==0:ans=3 elif (y-x)%2==0: ans=2 else: ans=1 if y<x: if (y-x)%2==0:ans=1 else: ans=2 print(ans)

0.51721

from itertools import permutations def equal_to_24(*aceg): ops = '+-*/' for b in ops: for d in ops: for f in ops: for (a,c,e,g) in permutations(aceg): for s in make_string(a,b,c,d,e,f,g): try: if ev...

0.516764

#!/usr/bin/env python from math import sqrt def process(S): P = [0,0,'S'] for i in S: if i == 'L': if P[-1] == 'N': P[-1] = 'W' elif P[-1] == 'S': P[-1] = 'E' elif P[-1] == 'E': P[-1] = 'N' elif P[-1] == 'W': P[-1] = 'S' elif i == 'R': if P[-1] == 'N': P[-1] = 'E' elif P[-1] == 'S': P[-1] = 'W...

0.516645

import sys n = 500001 sqrt = int(0.75 * n**0.5) data = [0]*(n) ans = [[]] out = [] for i in range(1, sqrt): ans.append([0]*i) j = int(sys.stdin.readline()) qus = sys.stdin.readlines() for qu in qus: q = [int(i) for i in qu.split()] if q[0] == 1: x = q[1] y = q[2] data[x] += y ...

0.515843

# cook your dish here # cook your dish here t = int(input()) while t: t-=1 c=0 ar=[int(i) for i in input().strip().split()] for i in range(1,16): b=bin(i)[2:].zfill(4) s=0 for i in range(4): if b[i]=='1': s+=ar[i] if(s==0): c=1 break print("Yes" if c==1 else "No")

0.515492

def chk(l): for i in range(4): for j in range(2): if l[i][j]==l[i][j+1]==l[i][j+2]=='x': return True for i in range(2): for j in range(4): if l[i][j]==l[i+1][j]==l[i+2][j]=='x': return True for i in range(2): for j in range(2): if l[i][j]==l[i+1][j+1]==l[i+2][j+2]=='x': return True for i ...

0.515135

You're given an array $a_1, \ldots, a_n$ of $n$ non-negative integers. Let's call it sharpened if and only if there exists an integer $1 \le k \le n$ such that $a_1 < a_2 < \ldots < a_k$ and $a_k > a_{k+1} > \ldots > a_n$. In particular, any strictly increasing or strictly decreasing array is sharpened. For example: ...

for _ in range(int(input())): n=int(input()) li=list(map(int,input().split())) ans=0 for i in range(n): if li[i]>=i: ans+=1 else: break for i in range(n): if li[n-1-i]>=i: ans+=1 else: break if ans>n: print("...

0.7439

from sys import stdin t = int(stdin.readline()) def count(n, arr): loc = 0 glob = 0 for i in range(n-1): if arr[i] > arr[i+1]: loc += 1 for i in range(n-1): for j in range(i+1, n): if glob > loc: return 0 if arr[i] > arr[j]: glob += 1; if glob == loc: return 1 return 0 for _ in range(t): ...

0.761898

from collections import deque cas = int(input()) for t in range(cas): n = int(input()) dq = deque(list(map(int,input().split()))) possible = True element = (2**31)+1 while dq: left_element = dq[0] right_element = dq[-1] if left_element>=right_element and element>=left_element...

0.730497

import sys input= sys.stdin.readline t = int(input()) out = [] for _ in range(t): n = int(input()) l = list(map(int,input().split())) smol = l[0] works = True for i in range(1, n): if l[i] == l[i-1] + 1: pass else: if l[i] > smol: works = Fals...

0.72577

t = int(input()) for _ in range(t): n = int(input()) l = [int(x) for x in input().split()] cur = l[0] cll = 1 blocks = [] for x in l[1:]: if x > cur: blocks.append(cll) cur = x cll = 1 else: cll += 1 blocks.append(cll) pos...

0.706823

# cook your dish here from collections import Counter,defaultdict for i in range(int(input())): n=int(input()) arr=list(map(int,input().split())) coun=Counter(arr) check=True for j in coun: if coun[j]>n//2: print("No") check=False break if check==True: print("Yes") narr=sorted(arr) dic=defa...

0.687106

t=int(input()) x=[1,2,3,4,5,6,7] for i in range(t): N=int(input()) a=list(map(int,input().split())) rev=a[::-1] dup=set(a) if rev== a and list(dup) ==x: print("yes") else: print("no")

0.683726

# cook your dish here for __ in range(int(input())): n=int(input()) arr=list(map(int,input().split())) d={} s=set() flag=0 for i in range(n): if arr[i] in list(d.keys()): d[arr[i]]+=1 else: d[arr[i]]=1 curr_ele=arr[i] if (curr_ele in s) and arr[i-1]!=arr[i]: flag=1 break else: s.add(arr...

0.681255

# cook your dish here for i in range(int(input())): N=int(input()) L=list(map(int,input().split())) l,h=0,N-1 flag=1 if L[l]!=1 and L[h]!=1: flag=0 else: while(l<h): if (L[l]!=L[h]) or (L[l+1]-L[l]!=1 and L[h-1]-L[h]!=1): flag=0 break l+=1 h-=1 if flag: print("yes") else: print("no")

0.677994

for _ in range(int(input())): n = int(input()) arr= list(map(int,input().split())) arr.sort() d={} for i in arr: if i not in d: d[i]=1 else: d[i]+=1 flag = True for i in d: if d[i]>2: flag=False break if arr.count(max(arr))!=1: flag=False if flag==True: arr1=[] arr2=[] ...

0.664887

import sys import math def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def MI(): return list(map(int, sys.stdin.readline().split())) def SI(): return sys.stdin.readline().strip() t = II() for q in range(t): n = II() a = sorted(LI()) boo = True for i in...

0.659845

# cook your dish here t=int(input()) while t>0: n=int(input()) l=list(map(int,input().split())) l1=[] c=1 for i in range(len(l)): if l[i]==1: l1.append(i) for j in range(len(l1)-1): if l1[j+1]-l1[j]<6: c=0 break if c: print("YES") ...

0.652826

for __ in range(int(input())): n = int(input()) ar = list(map(int, input().split())) ar.sort() ans = "NO" for i in range(1, n): if ar[i] == ar[i - 1]: ans = 'YES' break print(ans)

0.65254

t = int(input()) for case in range(t): n = int(input()) arr = list(map(int, input().split())) if arr[-1] > arr[0]: print("YES") else: print("NO")

0.646599

# cook your dish here for _ in range(int(input())): friends = int(input()) candies = list(map(int,input().split())) if (sum(candies) % friends == 0): print("Yes") else: print("No")

0.641619

from math import gcd for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) newList = sorted(l) m = newList[0] div = newList[0] for i in range(n): if l[i]!=newList[i]: div = gcd(div,l[i]) if div%m==0: print("YES") else: print...

0.640164

# cook your dish here # cook your dish here t = int(input()) while t: t-=1 c=0 ar=[int(i) for i in input().strip().split()] for i in range(1,16): b=bin(i)[2:].zfill(4) s=0 for i in range(4): if b[i]=='1': s+=ar[i] if(s==0): c=1 break print("Yes" if c==1 else "No")

0.637793

from sys import stdin input = stdin.readline q = int(input()) for _ in range(q): n = int(input()) l = list(map(int,input().split())) if sum(l) == 0: print("NO") else: l.sort() if sum(l) > 0: l.reverse() print("YES") print(*l)

0.632837

for i in range(int(input())): n = int(input()) arr = list(map(int, input().split())) flag = False for j in range(len(arr)): for c in range(j + 2, len(arr)): if arr[c] == arr[j]: flag = True break print("YES" if flag else "NO")

0.632712

for _ in range(int(input())): n=int(input()) def maxConsequtiveOnes(lst): _max = 0 _ones = [0] for i in lst: if i == 0: _max += 1 if i == 1: _max = 0 _ones.append(_max) return max(_ones) a = list(map(int, input().split())) b = maxConsequtiveOnes(a) if (b % 2 == 0): print("No") else:...

0.63208

for i in range(int(input())): n=int(input()) s=list(map(int,input().split())) a=0 for i in s: if i<2049:a+=i if a<2048:print("NO") else:print("YES")

0.628578

input=__import__('sys').stdin.readline for _ in range(int(input())): n=int(input()) s=list(map(int,input().split())) print('YNEOS'[sum(a>b for a,b in zip(s,s[1:]))==n-1::2])

0.62544

def fx(s,n,xsum): sub=[[None for x in range(n+2)]for y in range(xsum+2)] for i in range(n+1): sub[0][i]=True for i in range(1,xsum+1): sub[i][0]=False for i in range(1,xsum+1): for j in range(1,n+1): sub[i][j]=sub[i][j-1] if i>=s[j-1]: sub[i][j]=sub[i][j] or sub[i-s[j-1]][j-1] if sub[xsum][n]: pr...

0.623758

d = [-1] * 1000001 for t in range(int(input())): n, a = int(input()), list(map(int, input().split())) a.sort() for i in range(n): for j in range(i + 1, n): d[a[j] - a[i]] = t i = 1 while any(d[i * j] == t for j in range(1, n)): i += 1 print("YES\n" + ' '.join(str(j * i + 1) for j in ran...

0.623463

# cook your dish here # cook your dish here import math test=int(input()) for _ in range(test): n=int(input()) l=list(map(int,input().split())) f=0 for i in range(math.ceil(n//2)): if n%2==1: f=1 break else: if l[i]!=l[i+n//2]: if min(l[i],l[i+n//2])==-1: l[i]=max(l[i],l[i+n//2]) l[i+n//2...

0.623309

# cook your dish here import sys import math def main(arr): for i in range(1,len(arr)-1): if arr[i]==arr[i-1] and arr[i]==arr[i+1]: return "Yes" return "No" test=int(input()) for _ in range(test): b=int(input()) arr=list(map(int,input().split())) print(main(arr))

0.620131

t = int(input()) for _ in range(t): n = int(input()) l = [int(x) for x in input().split()] vals = [(x + i) % n for i, x in enumerate(l)] print("YES" if len(set(vals)) == n else "NO")

0.611482

for _ in range(int(input())): n = int(input()) A = list(map(int, input().split())) B = {} for i in A: if i not in B: B[i] = 0 B[i] += 1 ans = 'YES' J = [] for i in B: if B[i] % 2: ans = 'NO' break else: for _ in ...

0.610761

'''input 5 4 1 2 3 4 3 1 3 2 5 1 2 3 5 4 1 1 5 3 2 1 5 4 ''' import sys from collections import defaultdict as dd from itertools import permutations as pp from itertools import combinations as cc from collections import Counter as ccd from random import randint as rd from bisect import bisect_left as bl from heapq i...

0.609305

for _ in range(int(input())): n, m = list(map(int, input().split())) l = list(map(int, input().split())) p = set(map(int, input().split())) for i in range(len(l)): for j in range(len(l) - 1): if l[j] > l[j + 1] and j + 1 in p: l[j], l[j + 1] = l[j + 1], l[j] ans =...

0.608512

def main(): N = int(input()) S = list(map(int, input().split())) INF = float('inf') S.sort() parents = [S[-1]] S[-1] = INF for _ in range(N): checking = 2 parents.sort(reverse=True) for i in parents[:]: while True: if S[-checking] < i: ...

0.60608

import sys,io,os,math from math import ceil,log,gcd,inf from itertools import permutations mod=1000000007 mod1=998244353 def printlist(n): sys.stdout.write(" ".join(map(str,n)) + "\n") printf=lambda n:sys.stdout.write(str(n)+"\n") def printns(n): sys.stdout.write(str(n)) def intinp(): return int(sys.stdi...

0.603846

for _ in range(int(input())): n, k = map(int, input().split()) arr= list(map(int, input().split())) motu, tomu = [], [] for i in range(n): if i%2 == 0: motu.append(arr[i]) else: tomu.append((arr[i])) motu.sort(reverse=True) tomu.sort() for i in range(len(motu)): if len(tomu)-1<i: break if k==0: ...

0.602719

def read_int(): return int(input()) def read_ints(): return list(map(int, input().split(' '))) t = read_int() for case_num in range(t): n = read_int() a = list(read_ints()) cnt = [0 for i in range(101)] even = 0 for ai in a: cnt[ai] += 1 if ai % 2 == 0: even +...

0.602501

#!/usr/bin/env python # 556D_fug.py - Codeforces.com 556D Fug quiz # # Copyright (C) 2015 Sergey # Licensed under the Apache License, Version 2.0 (the "License"); # you may not use this file except in compliance with the License. # You may obtain a copy of the License at # http://www.apache.org/licenses/LICENSE-2...

0.59602

Z = 100000 n = int(input()) xx = list(map(int, input().split())) def cal(): ans = [] a = 1 b = 1 s = 0 ls = 1 for x in xx: while b <= Z: if s < x: s += b * 2 + 1 b += 1 elif s > x: s -= a * 2 + 1 l...

0.590884

t = int(input()) while t: arr = list(map(int, input().split())) c = 0 for i in arr: if i % 2 == 1: c += 1 if c <= 1: print("Yes") else: if arr[0] and arr[1] and arr[2]: arr[3] += 3 arr[0] -= 1 arr[1] -= 1 arr[2] -= 1...

0.589092

from sys import stdin tt = int(stdin.readline()) for loop in range(tt): n = int(stdin.readline()) a = list(map(int,stdin.readline().split())) lis = [ [1] ] now = [] tmp = 0 for i in range(1,n): if len(now) == 0: now.append(a[i]) tmp = 1 elif now[-1] ...

0.587233

n=int(input()) for i in range(n): a=list(map(int,input().split())) a.sort() if a[0]+a[1]>=a[2]-1: print("Yes") else: print("No")

0.586872

import sys input = sys.stdin.readline for _ in range(int(input())): n = int(input()) a = list(map(int,input().split())) for i in range(n-1,0,-1): a[i] -= a[i-1] minus = 0 for i in range(1,n): if a[i]<0: minus -= a[i] if a[0] - minus >=0: print("YES") e...

0.585725

q = int(input()) for ii in range(q): n,x = map(int,input().split()) l = list(map(int,input().split())) par = 0 npar = 0 for i in l: if i%2 == 1: npar += 1 else: par += 1 if x == n: if npar%2 == 1: print("Yes") else: print("No") else: if npar > 0 and par > 0: print("Yes") else: if pa...

0.582445

t = int(input()) while(t): n = int(input()) ar = list(map(int,input().strip().split(" "))) print(len([x for x in ar[1:len(ar)] if ar[0]<x])) t-=1

0.58202

for _ in range(int(input())): n = int(input()) arr = list(map(int,input().split())) if n<=62: st = set() for i in range(n): curr = 0 for j in range(i,n): curr = curr|arr[j] st.add(curr) if len(st)==n*(n+1)//2: print("YES") else: print("NO") else: print("NO")

0.581158

# cook your dish here def mergeSort(arr, n): # A temp_arr is created to store # sorted array in merge function temp_arr = [0]*n return _mergeSort(arr, temp_arr, 0, n-1) # This Function will use MergeSort to count inversions def _mergeSort(arr, temp_arr, left, right): # A variable inv...

0.576152

#read input cases = int(input()) caselist = [] for i in range(0, cases): caselist.append(input()) #iterate each case for j in range(0, cases): #current case's parameters: current_input = caselist[j].split(' ') bots = int(current_input[0]) switch = int(current_input[1]) #generate botlist and cakelist botlist =...

0.575333

# cook your dish here import sys,collections input=sys.stdin.readline def main(): T=int(input()) for _ in range(T): N,K=map(int,input().split()) Tree={} for j in range(N): Tree[j]=[] for i in range(N-1): u,v=map(int,input().split()) Tree[u-1].append(v-1) Tree[v-1].append(u-1) A=list(map(...

0.574278

# cook your dish here import bisect for _ in range(int(input())): n,x=list(map(int,input().split())) l=list(map(int,input().split())) battery=[] power=0 i=0 t=(n+1)//2 while power<x and i<t: if i==n-i-1: temp=[-1,l[i]] else: temp=sorted([ l[i], l[n-i-1] ]) power+=temp[1] pos=bisect.bise...

0.573443

import sys n,m=list(map(int,sys.stdin.readline().split())) M=[m] A=list(map(int,sys.stdin.readline().split())) L=[0]*n inc=False dec=False def ALLYes(): Ans="" for i in range(M[0]): Ans+="Yes\n" sys.stdout.write(Ans) return for i in range(1,n): if(A[i]>A[i-1]): L[i]=1 inc=Tru...

0.571421

def gcd(a,b): if b==0: return a return gcd(b,a%b) for _ in range(int(input())): n = int(input()) arr = list(map(int,input().split())) value = arr[0] if n!=1: for i in arr[1:]: value = value*i//gcd(value, i) if value%2==0: print("NO") else: print("YES")

0.568878

q = int(input()) for qi in range(q): n = int(input()) a = list(map(int, input().split())) used = [False] * n for t in range(n): for i in range(len(a) - 1, 0, -1): if used[i]: continue if a[i] < a[i - 1]: a[i], a[i - 1] = a[i - 1], a[i] ...

0.566769

t=int(input()) i=0 while i<t: n=int(input()) A=[] A=input().split() m=int(input()) B=[] B=input().split() j=0 a=-1 while j<m: c=1 if B[j] in A: b=A.index(B[j]) A.remove(B[j]) if b>=a: a=b c=1 else: c=0 break else: c=0 break j+=1 if c==1: print("Yes") else: print(...

0.566235

knows=input() n=eval(input()) while n!=0: n=n-1 word=input() for x in word: ctr=0 for y in knows: if x==y:ctr=ctr+1;break if ctr==0:print('No');break else: print('Yes')

0.562448

n = int(input()) for i in range(n): s = input() if len(s) == len(set(s)) and abs(ord(min(s)) - ord(max(s))) == len(s) - 1: print('Yes') else: print('No')

0.560737

for _ in range(int(input())): n = int(input()) ar = list(map(int, input().split())) a, b = 0, 0 for elem in ar: if elem % 2 == 0: a = 1 else: b = 1 if sum(ar) % 2 == 1: print('YES') elif a == 1 == b: print('YES') else: print('NO...

0.560677

def CeilIndex(A, l, r, key): while (r - l > 1): m = l + (r - l)//2 if (A[m] >= key): r = m else: l = m return r def LongestIncreasingSubsequenceLength(A, size): # Add boundary case, # when array size is one tailTable = [0...

0.560211

n,m=[int(x) for x in input().split()] k=[int(x) for x in input().split()] a=min(k) b=max(k) for i in range(m): c=int(input()) if c>=a and c<=b: print('Yes') else: print('No')

0.559071

def find_combinations(list, sum): if not list: if sum == 0: return [[]] return [] return find_combinations(list[1:], sum) + \ [[list[0]] + tail for tail in find_combinations(list[1:], sum - list[0])] for tc in range(int(input())): n,k=list(map(int,input().split())) a=list(map(int,input().split())) a.so...

0.557319

def check(l,n): m = 0 for i in range(n-1): x = l[i] c = 0 j = i while (j+2<n and l[j+2]==x) or (j+1<n and l[j+1] == x): if l[j+1] == x: j = j+1 else: j+=2 c+=1 if m<c: m = c return m t = ...

0.556477

def main(): from sys import stdin, stdout for _ in range(int(stdin.readline())): n = int(stdin.readline()) inp1 = [-1] * (n + 1) inp2 = [-1] * (n + 1) for i, ai in enumerate(map(int, stdin.readline().split())): if inp1[ai] < 0: inp1[ai] = i ...

0.554882

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): #print(*args, **kwargs, file=sys.stderr) # in python 3.4 **kwarg...

0.554475

import sys input = lambda: sys.stdin.readline().rstrip() T = int(input()) for _ in range(T): N, K = list(map(int, input().split())) A = [int(a) for a in input().split()] if K not in A: print("no") continue if N == 1 or (A[0] >= K and A[1] >= K): print("yes") continue...

0.554082

import sys input = sys.stdin.readline Q = int(input()) for _ in range(Q): N = int(input()) A = [int(a) for a in input().split()] X = {} for a in A: if a in X: X[a] += 1 else: X[a] = 1 Y = [] for x in X: Y.append(X[x]) Y = sorted(Y)[::-1] p...

0.553927

def checkValidity(s): count = 0 previous = "" for x in s: if count == 0: previous = x count += 1 elif count == 1: count = 0 if previous == x: return "no" return "yes" t = int(input()) for _ in range(t): s = input() print(checkValidity(s))

0.553911

# cook your dish here import sys n = 201 v = [0 for i in range(n + 1)] def gen(): for i in range(1, n + 1): v[i] = i countDivision = [0 for i in range(n + 1)] for i in range(n + 1): countDivision[i] = 2 for i in range(2, n + 1, 1): ...

0.551942

for t in range(int(input())): n=int(input()) s=input().strip() c=0 flag=0 for i in range(n): if (s[i]=="A" or s[i]=="E" or s[i]=="I" or s[i]=="O" or s[i]=="U") and (s[i-1]=="A" or s[i-1]=="E" or s[i-1]=="I" or s[i-1]=="O" or s[i-1]=="U") : flag=1 if flag and n!=1: print("Yes") else: print("No...

0.550695

for _ in range(int(input())): n = int(input()) A = list(map(int, input().split())) m = 10 ** 9 c = 0 for i in range(n - 1, -1, -1): if A[i] <= m: m = A[i] else: c += 1 print(c)

0.548487

import sys input = sys.stdin.readline ############ ---- Input Functions ---- ############ def inp(): return (int(input())) def instr(): return (str(input())) def inlt(): return (list(map(int, input().split()))) def insr(): s = input() return(list(map(int, list(s[:len(s) - 1])))) # def insr(): # ...

0.548419

t = int(input()) for _ in range(t): n = int(input()) a = [int(x) for x in input().split()] b = [int(x) for x in input().split()] if list(sorted(a)) == a or not all(x == b[0] for x in b): print("Yes") else: print("No")

0.547509

import sys input = sys.stdin.readline t = int(input()) for _ in range(t): input() l = list(map(int,input().split())) bad = False curr = 0 for v in l: curr += v if curr <= 0: bad = True break l.reverse() curr = 0 for v in l: curr += ...

0.54731

def main(): n = int(input()) s = set() for _ in range(n): w = input() if w in s: print('YES') else: print('NO') s.add(w) main()

0.547175

t = int(input()) for _ in range(t): s = [x for x in input()] freq = {} for i in s: if i in freq: freq[i] += 1 else: freq[i] = 1 flag = 0 for keys, values in freq.items(): if(values >= 2): flag = 1 break if(flag == 0): print("no") else: print("yes")

0.546367

t=int(input()) for t1 in range(t): n,x=map(int,input().split()) a=list(map(int,input().split())) mx=max(a) mn=min(a) if (mx-mn<x): print("YES") else: print("NO")

0.545901

for q in range(int(input())): n, k, l = map(int, input().split()) line = list(map(int, input().split())) line.append(-1000) dp = [[False] * (2 * k) for i in range(n + 2)] for i in range(2 * k): dp[0][i] = True for i in range(1, n + 2): for j in range(2 * k): if j < k ...

0.545847

import sys import math #from queue import * import random #sys.setrecursionlimit(int(1e6)) input = sys.stdin.readline ############ ---- USER DEFINED INPUT FUNCTIONS ---- ############ def inp(): return(int(input())) def inara(): return(list(map(int,input().split()))) def insr(): s = input() return(list...

0.545797

import sys import math from collections import defaultdict from collections import deque from itertools import combinations from itertools import permutations input = lambda : sys.stdin.readline().rstrip() read = lambda : list(map(int, input().split())) go = lambda : 1/0 def write(*args, sep="\n"): for i in args: ...

0.545653

from sys import stdin for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) id = list(zip(l,list(range(n)))) id.sort() val, pos = zip(*id) blok = [] cur = [pos[0]] for i in range(1,n): if val[i] == val[i-1]: cur.append(pos[i]) else:...

0.545311

def solve(): n = int(input()) a = list(map(int, input().split())) c = [0] * (n + 1) def inc(): for i in range(n - 1): if a[i] > a[i + 1]: return False return True def calc(): for i in range(n + 1): c[i] = 0 for i in a: ...

0.545108

def mForMaxSeq(arr, n): eim = dict() for i in range(n): if arr[i] in eim: eim[arr[i]].append(i) else: eim[arr[i]] = [i] keys = sorted(eim.keys()) # print(eim, keys) connected = False count = 0 pI = -1 nKeys = len(keys) ...

0.544797

# cook your dish here a = int(input()) for i in range(a): n = int(input()) if n%2==0: print('NO') else: print('YES') for i1 in range(n): li = [0]*n b = str() for i2 in range((n-1)//2): li[(i1+i2+1)%n]+=1 for i3 in range(len(li)): b+=str(li[i3]) print(b)

0.544677

for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) ans = 1 l1 = l[0] for i in range(1,n): if l[i] <= l1: l1 = l[i] ans = ans + 1 print(ans)

0.544082

import sys input = sys.stdin.readline import bisect t=int(input()) for tests in range(t): n=int(input()) A=list(map(int,input().split())) compression_dict={a: ind for ind, a in enumerate(sorted(set(A)))} A=[compression_dict[a] for a in A] Q=[0]*n for i in range(n): Q[A[i]]=i ...

0.543672

test=int(input()) for i in range(test): n=int(input()) a=list(map(int,input().split())) b=[0]*(n+2) b[n-1]=1 for i in range(n-2,-1,-1): if(a[i]*a[i+1]<0): b[i]=b[i+1]+1 else: b[i]=1 for i in range(n): print(b[i], end=' ') print()

0.541785

# cook your dish here for _ in range(int(input())): n = int(input()) arr = list(map(int,input().split())) l = [] for i in range(0, len(arr)): for j in range(i+1, len(arr)): if(arr[i] == arr[j]): l.append(arr[j]) if (len(l) ==0): print("prekrasnyy...

0.541759

from bisect import bisect_left as bl from bisect import bisect_right as br from heapq import heappush,heappop import math from collections import * from functools import reduce,cmp_to_key import sys input = sys.stdin.readline M = mod = 998244353 def factors(n):return sorted(set(reduce(list.__add__, ([i, n//i] for i in ...

0.541749

for _ in range(int(input())): n=int(input()) arr=list(map(int,input().split())) d=set() for i in arr: d.add(i) for i in range(n): if i in d: print(i,end=" ") else: print(0,end=" ") print()

0.541045

# cook your dish here for _ in range(int(input())): n=int(input()) lst=list(map(int,input().split())) f=0 t=0 p=1 for i in lst: if(i==5): f+=1 elif(i==10): if(f>0): f-=1 t+=1 else: p=0 ...

0.540645

'''Author- Akshit Monga''' from sys import stdin, stdout input = stdin.readline t=int(input()) for _ in range(t): n=int(input()) a=[int(x) for x in input().split()] ans=0 dp=[-1 for i in range(0,n+1)] for i in a: var1=dp[i] var2=ans ans=max(ans,var1+1) dp[i]=max(dp[i],var2+1) print(n-ans)

0.54063

import sys input = sys.stdin.readline t=int(input()) for test in range(t): n=int(input()) A=list(map(int,input().split())) ANS=[] SET=set() NOW=1 while not (NOW in SET): ANS.append(NOW) SET.add(NOW) NOW=NOW-A[NOW-1] x=ANS.index(NOW) print(len(ANS[x:])) pr...

0.540278

import sys input=sys.stdin.readline for _ in range(int(input())): N=int(input()) e=list(map(int,input().split())) e.sort() ans=0 val=0 g=0 for i in range(0,N): g+=1 val=e[i] if g>=val: ans+=1 g=0 val=0 print(ans)

0.540212

import math import copy try: import psyco psyco.full() except ImportError: pass def isSharp(ang): return ang > math.pi/4 + 0.00001 def unitVector(p2, p1): d0 = p2[0] - p1[0] d1 = p2[1] - p1[1] d = math.sqrt(d0*d0 + d1*d1) if d != 0: return [d0/d, d1/d] return [0, 0] def compVectors(P): V = [] for i i...

0.539767

# cook your dish here # cook your dish here for _ in range(int(input())): n=int(input()) a=list(map(int, input().split())) b=list(map(int, input().split())) if a[0]!=0 or b[-1]!=0 or a[-1]!=b[0]: print('No') else: ab=b[0] flag=0 for i in range(1, n-1): if a[i]==0 or b[i]==0: print('No') flag...

0.539177

try: from math import sqrt t,x=list(map(int,input().split())) for _ in range(t): n=int(input()) if(n<0): print("no") else: diff=(x/100)*n ans=int(sqrt(n)) ans1=ans**2 if(n-ans1<=diff): print("yes") else: print("no") except: pass

0.539053

# cook your dish here def check(px,x): if px[1]==x[1]: return (x[2]-px[2])<=(x[0]-px[0]) and (x[2]>=px[2]) else: return (x[2]-px[2]+1)<=(x[0]-px[0]) and (x[2]>=px[2]) def checkdouble(px,x): if px[3]==x[3]: return (x[4]-px[4])<=(x[0]-px[0]) and (x[4]>=px[4]) else: return (x[4]-px[4]+1)<=(x[0]-px[0]) and (...

0.538494

from bisect import bisect_left as bl from bisect import bisect_right as br from heapq import heappush,heappop,heapify import math from collections import * from functools import reduce,cmp_to_key import sys input = sys.stdin.readline from itertools import accumulate from functools import lru_cache M = mod = 998244353...

0.537096

# cook your dish here def index(n,val): while(val >= n): val = val//2 return n - val t = int(input()) for _ in range(t): n = int(input()) arr = list(map(int,input().split())) new = [0 for i in range(n)] for i in range(n): if arr[i]<=n : new[i] = arr[i] + arr[arr[i]-1...

0.536286

# cook your dish here def solution(b,n1,d): first=b[0] b.sort() for j in range(n1-1): if(a[j+1]-a[j]>d): return "NO" for j in range(n1): if(b[j]==first): pos=j if(pos==0 or pos==n1-1): return "YES" rec=1 for j in range(pos-1,n1-2): if(a[j+2]-a[j]>d): rec=0 break if(rec): return "YES" r...

0.536285

t = int(input()) for _ in range(t): n = int(input()) a = list(map(int, input().split())) print(*set(a))

0.536253

import sys import time for line in sys.stdin: ll = len(line) - 1 fail = 0 for i in range(ll): if i == ll - 1 - i: if int(line[i]) not in [3, 7]: fail = 1 continue x = int(line[i]) y = int(line[ll - 1 - i]) if (x, y) not in [(3, 3), (4,...

0.536061

T = int(input()) def solve(S): res = [S[0]] pos = 0 # think... for s in S[1:]: # can we change? if 0 <= pos-1 < len(res) and res[pos-1] == s: pos = pos-1 elif 0 <= pos+1 < len(res) and res[pos+1] == s: pos = pos+1 elif pos == 0 and s not in res: ...

0.534787

# cook your dish here for _ in range(int(input())): n,k = [int(c) for c in input().split()] a = [int(c) for c in input().split()] ls = a if n==1: print("YES") print(1) continue if k==1: print("NO") continue if k==2 and n>2: if ls[0]!=ls[1]-1: ...

0.533005

for _ in range(int(input())): n=int(input()) s=input() d={} for j in s: if j not in d: d[j]=1 else: d[j]+=1 f=0 for j in d: if(d[j]%2==1): f=f+1 if((n//2)%2==0 and f==0): print("YES") continue if((n//2)%2==1 and f<=2 and f%2==0): print("YES") continue print("NO")

0.532745

You have a bag of size $n$. Also you have $m$ boxes. The size of $i$-th box is $a_i$, where each $a_i$ is an integer non-negative power of two. You can divide boxes into two parts of equal size. Your goal is to fill the bag completely. For example, if $n = 10$ and $a = [1, 1, 32]$ then you have to divide the box of s...

import sys import math from collections import defaultdict from collections import deque from itertools import combinations from itertools import permutations input = lambda : sys.stdin.readline().rstrip() read = lambda : list(map(int, input().split())) go = lambda : 1/0 def write(*args, sep="\n"): for i in args: ...

0.63235

import sys input = sys.stdin.readline import bisect t=int(input()) for testcases in range(t): n=int(input()) A=list(map(int,input().split())) m=int(input()) PS=[tuple(map(int,input().split())) for i in range(m)] PS.sort() K=[PS[-1]] for a,b in PS[::-1][1:]: if b<=K[-1][1]: ...

0.719288

t=int(input()) for i in range(t): x,y=0,0 n,m=list(map(int,input().split())) l=list(map(int,input().split())) if(max(l)>m): print(-1) else: for i in range(len(l)): y+=l[i] if(y>m): y=l[i] x+=1 if(y>0): x+=1 print(x)

0.703402

from collections import Counter n, q = map(int, input().split()) a = map(int, input().split()) b = [int(input()) for _ in range(q)] counts = 32 * [0] for value, count in Counter(a).items(): counts[value.bit_length() - 1] = count for bj in b: ans = 0 for i in reversed(range(32)): count = min...

0.664676

import math def findnumber(l,n): l.sort() x = l[0] * l[-1] vec = [] i = 2 while (i*i)<=x: if x%i==0: vec.append(i) if x//i !=i: vec.append(x//i) i = i + 1 vec.sort() if len(vec)!=n: return -1 else: j = 0 ...

0.65601

for __ in range(int(input())): n,m=map(int,input().split()) arr=list(map(int,input().split())) s=set(arr) mex=-1 ele=1 for i in range(1,n+1): if i not in s: mex = i break if m>mex: print(-1) elif m==mex: print(n) els...

0.653636

# cook your dish here from collections import deque primes = {2,3,5,7,11,13,17} 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)] x = [1,2,3,4,5,6,7,8,9] avail = {tuple(x):0} q = deque([x]) while q: curr = q.popleft(); for e in edges: if curr[e[0]]+curr[e[1]] in...

0.649338

import sys sys.setrecursionlimit(10000000) def mergeSortInversions(arr): if len(arr) == 1: return arr, 0 larr=len(arr) a = arr[:larr//2] b = arr[larr//2:] a, ai = mergeSortInversions(a) b, bi = mergeSortInversions(b) c = [] i = 0 j = 0 inversions = 0 + ai + bi la=len(a) while i < la and j < ...

0.647641

for q in range(int(input())): n = int(input()) D = list(map(int, input().split())) D.sort() z = D[0] * D[-1] if z == -1: print(-1) else: Dz = set() for i in range(2, int(z ** 0.5) + 1): if z % i == 0: Dz.add(i) Dz.add(z // i) ...

0.644957

import sys import math a, b, n = list(map(int, str.split(sys.stdin.readline()))) s = lambda i: a + (i - 1) * b S = lambda i: a * i + b * i * (i - 1) // 2 for _ in range(n): l, t, m = list(map(int, str.split(sys.stdin.readline()))) # Si = a * r + b * r * (r - 1) / 2 # Si = b / 2 * r ^ 2 - (b / 2 - a) * r ...

0.642545

t = int(input()) for _ in range(t): n = list(input().strip()) s = list(map(int, input().strip().split())) check = set(s) found = False for i in range(1, 1025): newset = set([e^i for e in s]) if check == newset: print(i) found = True break if ...

0.636044

n, m = map(int, input().split()) valists = [10**9 for _ in range(1<<n)] valists[0] = 0 for i in range(m): values, b = map(int, input().split()) c = list(map(int, input().split())) cnt = 0 for j in range(b): cnt += 2**(c[j]-1) for j in range(len(valists)): x = j|cnt valists[x] = min(valists[x], valists[j]+val...

0.635154

D=[0]*31 D[1]=2 D[2]=5 for i in range(3,31): best=10**10 for p in range(1,i+1): best=min(best,D[p-1]+D[i-p]+i+1) D[i]=best t=int(input()) for i in range(t): n,m=list(map(int,input().split())) maxi=(n+2)*(n+1)/2-1 mini=D[n] if mini<=m<=maxi: print(0) elif m<mini: print(-1) else: print(m-maxi)

0.633355

import sys from collections import defaultdict from copy import copy R = lambda t = int: t(eval(input())) RL = lambda t = int: [t(x) for x in input().split()] RLL = lambda n, t = int: [RL(t) for _ in range(n)] def solve(): N, Q = RL() P = RL() B = RL() phones = sorted(zip(P, B)) S = d...

0.629336

# input = raw_input # range = xrange import sys inp = [int(x) for x in sys.stdin.read().split()]; ii = 0 seg = [0]*200000 def offset(x): return x + 100000 def encode(x, y): return x*200002 + y def decode(x): return x//200002, x%200002 def upd(node, L, R, pos, val): while L < R: seg[node] += val seg[offset(no...

0.628548

def merge(intervals,start,mid,end): al = mid-start+1 bl = end-mid A = intervals[start:mid+1] B = intervals[mid+1:end+1] p=0;q=0;k=start; while(p<al and q<bl): if(A[p]<B[q]): intervals[k] = A[p] k+=1;p+=1; else: intervals[k] = B[q] k+=1;q+=1; while(p<al): intervals[k] = A[p] k+=1;p+=1; ...

0.626392

from sys import stdin,stderr def rl(): return [int(w) for w in stdin.readline().split()] def solve(n, b): f = [True for i in range(2*n+1)] for x in b: if not f[x]: return [-1] f[x] = False a = [] for x in b: a.append(x) for y in range(x+1, 2*n+1): ...

0.626251

t = int(input()) for loop in range(t): n,x = list(map(int,input().split())) a = list(map(int,input().split())) ss = sum(a) if ss % x != 0: print (n) else: ans = -1 for i in range(n): if a[i] % x != 0: ans = n-i-1 break ...

0.623751

import sys class Fenwick(object): def __init__(self, n): self.n = n self.a = [10**9 for i in range(n)] self.w= 10**9 def zag(self, i, zn): self.w= min(self.w, zn) while i < self.n: self.a[i] = min(self.a[i], zn) i = (i | (i + 1)) def pol(self, r): ans= 10**9 while r >= 0...

0.62288

tc=int(input()) for case in range(tc): n,d=list(map(int,input().split())) a=list(map(int,input().split())) sm=sum(a) f=True if sm%n==0: avg=sm/n for i in range(d): tmp_sm=0 tmp_n=0 for j in range(i,n,d): tmp_sm=tmp_sm+a[j] tmp_n+=1 if tmp_sm%tmp_n==0: if avg!=tmp_sm/tmp_n: f=False ...

0.619609

from math import gcd from itertools import groupby def gcd_split(seq): gcds= [int(gcd(a,b)==1) for a,b in zip(seq[1:],seq[:-1])] gcds.append(int(gcd(seq[0],seq[-1])==1)) # print(gcds) if max(gcds)==0: return -1 else: splits=[len(list(x))+1 for num,x in groupby(gcds) if num==0] # print(splits) if gcds[0]==...

0.617968

#!/usr/bin/env python3 # Copied solution import collections import sys import traceback class Input(object): def __init__(self): self.fh = sys.stdin def next_line(self): while True: line = sys.stdin.readline() if line == '\n': continue retur...

0.617952

for _ in range(int(input())): n = int(input()) a = list(map(int, input().split())) s = set(a) if n == 1 or len(s) > 2: print(-1) continue if len(s) == 1: x = s.pop() if x == 0: print(n) elif x == n-1: print(0) else: print(-1) continue x, y = sorted(s) xc, yc = a.count(x), a.count(y) ...

0.616243

# from math import log2 # N = 10000 # for i in range(1,N): # # print(i) # for m in range(i): # if( (m^(m+1))==i ): # print(i) # print(m,m+1,bin(m)[2:]) # print() # break # # else: # # print(-1) # # print() T = int(input()) ans = [] for...

0.615888

t=int(input()) for nbt in range(t): n,k=[int(i) for i in input().split()] a=[int(i) for i in input().split()] nbc=len(set(a))-1 if k==1: if nbc: print(-1) else: print(1) else: print(1+max(0,(nbc-1)//(k-1)))

0.611418

for testcase in range(int(input())): n = int(input()) cnt2, cnt3 = 0, 0 while n % 2 == 0: n //= 2 cnt2 += 1 while n % 3 == 0: n //= 3 cnt3 += 1 if n > 1 or cnt3 < cnt2: print(-1) continue print(2 * cnt3 - cnt2)

0.610225

import sys # sys.stdin = open('in.txt') s = sys.stdin.read().split() p = 0 def getSm(k, a, b, c, d): return (k + 1) * a - (k * (k + 1) >> 1) * b * d t = int(s[p]) p += 1 res = [] for _ in range(t): a = int(s[p]) p += 1 b = int(s[p]) p += 1 c = int(s[p]) p += 1 d = int(s[p]) p...

0.607607

from sys import stdin, stdout import os,sys,__pypy__ def main(): #t = int(stdin.readline()) n,m = list(map(int, stdin.readline().split())) tree = [list() for _ in range(n+1)] mn = [0] * (n+1) for _ in range(m): a,b = list(map(int, stdin.readline().split())) tree[a].append(b) ...

0.599784

def read_int(): return int(input()) def read_ints(): return list(map(int, input().split(' '))) t = read_int() for case_num in range(t): n, m = read_ints() a = [] for i in range(n): a.append(int(input(), 2)) a.sort() k = 2 ** m - n ans = (k - 1) // 2 for ai in a: i...

0.596804

import sys readline = sys.stdin.readline read = sys.stdin.read ns = lambda: readline().rstrip() ni = lambda: int(readline().rstrip()) nm = lambda: map(int, readline().split()) nl = lambda: list(map(int, readline().split())) prn = lambda x: print(*x, sep='\n') def solve(): a, b, c, d = nm() if a <= b: ...

0.59596

def f(x, y, a, b, n): return a + (x - a) * cos[n] - (y - b) * sin[n], b + (x - a) * sin[n] + (y - b) * cos[n] def check(p): d = {} for i in range(len(p) - 1): for j in range(i + 1, len(p)): dist = (p[i][0] - p[j][0]) ** 2 + (p[i][1] - p[j][1]) ** 2 d[dist] = d.get(dist, 0) ...

0.594328

import math def ispoweroftwo(y): return math.ceil(math.log(y,2))==math.floor(math.log(y,2)) t=int(input()) for i in range(t): n=int(input()) a=[] if(ispoweroftwo(n) and n!=1): print(-1,end=" ") if(n==1): print(1) if(n>=3 and not(ispoweroftwo(n))): a.append(2) a.append(3) a.append(1) if(n>3 and not ...

0.592963

def magic(): def check(art,k,m): n=len(art) for i in range(n-k+1): maxi=0 maxi=max(art[i:i+k]) total=0 total=art[i:i+k].count(maxi) if total>=m: return False return True for _ in range(eval(input())): n,k,m=list(map(int,input().split())) arr=list(map(int,input().split())) dp=[] ...

0.591342

import sys sys.setrecursionlimit(100000) memo = {} def recurse(arr, T1, T2, k, i): if T1 >= k and T2 >= k: return i if i >= len(arr): return float('inf') if (T1, T2) in memo: return memo[(T1, T2)] t1 = recurse(arr, T1 + arr[i], T2, k, i+1) t2 = recurse(arr, T1, T2 + arr[i], k, i+1) memo[(T1, T2)] = mi...

0.59055

import math as ma import sys from decimal import Decimal as dec from itertools import permutations def li(): return list(map(int , input().split())) def num(): return map(int , input().split()) def nu(): return int(input()) t=nu() for it in range(t): k=nu() a=li() s=sum(a) zz=[] for i in range(7): pp=...

0.590496

'''input 2 7 3 5 5 2 5 2 2 4 2 6 6 2 6 4 5 6 5 7 7 1 7 4 7 3 7 1 1 6 1 1 2 3 2 5 2 5 2 2 6 2 6 6 2 6 4 5 6 5 7 7 1 7 4 ''' for _ in range(int(input())): n, k, m = list(map(int, input().split())) row_s = [] col_s = [] for _ in range(m): h_x, h_y, t_x, t_y = list(map(int, input().split())) if h_x == t_x: if (...

0.588691

t=eval(input()) a=[] b=[] top=-1 for __ in range(0,t): x=input().split() if(x[0]!="-1" and x[0]!="0"): add=int(x[0]) if top!=-1 and add>a[top][0] : b[top]+=1 else: a.append((add,x[1])) b.append(0) top+=1 elif (x[0]=="-1"): #print("%s %s" %(b[top],a[top]...

0.588571

ans = [] for _ in range(int(input())): a, b = list(map(int, input().split())) a, b = max(a, b), min(a, b) if a % b != 0: ans.append(-1) continue x = a // b cnt = 0 while x % 2 == 0: x //= 2 cnt += 1 if x != 1: ans.append(-1) continue ansi =...

0.585748

def floo(num, k): return (num - 1) // k + 1 def main(): n, m = map(int, input().split()) low = 1 high = 10**9 if (m == 0): if (n == 1): print(1) else: print(-1) return for i in range(m): k, f = map(int, input().split()) low = max(low, (k + f - 1) // f) if (f > 1): high = min(high, (k - 1) ...

0.585428

import sys def spaces(a,n,m,k,visit1,visit2,dist,position): queue = [position] lastedit = [] dist[position[0]][position[1]] = 0 while queue!=[]: point = queue[0] i = point[0] j = point[1] #print 'point',i,j if visit1[i][j]==False: visit1[i][j] = True startx = max(i-k,0) endx = min(i+k,n-1) f...

0.585319

# cook your dish here # cook your dish here for _ in range(int(input())): n,m=list(map(int,input().split())) atomlist = ['']*n for k in range(m): s=[] s.extend(input().split()[1:]) #print(s) for w in range(n): if str(w) in s: atomlist[w]+="1" else: atomlist[w]+="0" #print(atomlist) print(len...

0.585048

# cook your dish here # cook your dish here import numpy as np import sys def findSeq(n, s, k, m, M): midInd = n // 2 seqs = [] for ind in range(midInd + 2, midInd - 3, -1): if ind >= n or ind < 0: continue seq = genBestSeq(n, ind, m, M, s) if seq is not -1 and test...

0.584719

import sys input = sys.stdin.readline N, M = list(map(int, input().split())) A = [] for _ in range(N): l, r = list(map(int, input().split())) A.append([l, r]) Z = [] for _ in range(M): l, r = list(map(int, input().split())) Z.append([l, r]) MA = 5*10**5+1 lg = 20 X = [[-1]*MA for i in range(lg)] for i...

0.583425

import math def comb(n,r): f = math.factorial return f(n) / f(r) / f(n-r) t=int(input()) for i in range(1,t+1): n=int(input()) arr = list(map(int, input().split())) m=0 ans=0.0 for i in range(0,n): if (arr[i]==-1): m=m+1 for i in range(0,m): ans=ans+((m-i)*comb(m-1,m-1-i)) ans=ans/pow(2,m-1) print('{0:...

0.580766

import sys t = eval(input()) for j in range(t): n = eval(input()) a = list(map(int, input().split())) ch = 0 sm = 0 ; x = sum(a) s1 = [0] * n ; s2 = [0] * n for i in range(n): sm += a[i] s1[i] = sm s2[i] = x x -= a[i] if(sum(a) - a[0] == 0): print(0) elif(sum(a) - a[n - 1] == 0): print(n - 1) else...

0.579883

# cook your dish here class node: def __init__(self,a,b=0,c=0): self.val=a self.a=b self.b=c arr=[] def finder(node,val): if(arr[node].val==0): return val else: a=finder(arr[node].a,val) b=finder(arr[node].b,val) if(arr[node].val==1): return a+b-a*b else: return a*b t=int(input()) while(t>0)...

0.579638

for i in range(int(input())): n=int(input()) moves=0 while n%2==0: n=n//2 moves+=1 while n%3==0: n=n//3 moves+=2 while n%5==0: n=n//5 moves+=3 if n==1: print(moves) else : print(-1)

0.577874

def ke(i): return b[i] n,m=map(int,input().split()) a=[0]*m b=[0]*m c=[0]*m e=[] ans=[0]*n for i in range(m): a[i],b[i],c[i]=map(int,input().split()) ans[b[i]-1]=m+1 e.append(i) e.sort(key=ke) for i in range(m): k=0 for j in range(a[e[i]]-1,b[e[i]]-1): if ans[j]==0: ans[j]=e[...

0.577153

for i in range(int(input())): n = int(input()) c = list(map(int, input().split())) d = {} d[0] = -1 parity = 0 ans = 0 for i in range(n): parity ^= 1 << (c[i]-1) for t in range(30): x = parity^(1<<t) if(x in d.keys()): ans = max(ans, i - d[x]) if parity not ...

0.576759

from math import ceil, floor Q = int(input()) for _ in range(Q): a, b, m = map(int, input().split()) if b - a == 0: print(1, a) continue if b - a <= m: print(2, a, b) continue x = max(0, ceil(b/(a+m)) - 1) y = max(0, floor(b/(a+1))) if x.bit_length() < y.bit_lengt...

0.576282

""" Author : thekushalghosh Team : CodeDiggers """ import sys,math input = sys.stdin.readline ############ ---- USER DEFINED INPUT FUNCTIONS ---- ############ def inp(): return(int(input())) def inlt(): return(list(map(int,input().split()))) def insr(): s = input() return(s[:len(s) - 1]) def i...

0.574741

read_line = lambda: [int(i) for i in input().split()] n, m, k = read_line() a = [read_line() for i in range(n)] if n < m: n, m, a = m, n, list(zip(*a)) xs = [] for y in a: x = 0 for b in y: x = 2 * x + b xs.append(x) def work(y): tot = 0 for x in xs: c = bin(x ^ y).count('1') ...

0.574418

# cook your dish here from bisect import bisect_left def BinarySearch(a, x): i = bisect_left(a, x) if i != len(a) and a[i] == x: return i else: return -1 for _t in range(int(input())): _n, q = list(map(int, input().split())) mounts = list(map(int, input().split())) for _q in range(q): query = list(...

0.573877

import functools def gcd(x,y): if(y == 0): return x return gcd(y, x%y) for _ in range(int(input())): n, m= map(int, input().split()) p = list(map(int, input().split())) ans = functools.reduce(lambda x,y: gcd(x, y), p) if(ans <= n): print(n-ans) else: f = [1] for k in range(ans//2, 1, -1): if ans...

0.573046

mod=10**9+7 def pow2(x): p,n=1,2 while(x): if(x & 1): p=((p%mod) * (n%mod))%mod n=((n%mod) * (n%mod))%mod x//=2 return p def count_bit(val): bit=0 while(val): bit+=1 val &=(val-1) return bit def answer(): val=b[0] po2=0 for i in range(1,len(b)): if(val > b[i]):return 0 po2+=count_bit(val ...

0.571456

dt, a = None, None def dfs(z): r = [{}, {}];ln = len(dt[z]) if ln == 0:r[0][0] = 0;r[1][1 << a[z]] = 1 elif ln == 1: l = dfs(dt[z][0]);r[0] = l[1] for m in l[0]: r[1][(1 << a[z]) | m] = min(r[1][(1 << a[z]) | m], l[0][m] + 1) if (1 << a[z]) | m in r[1] else l[0][m] + 1 for...

0.571384

from collections import defaultdict import copy #def dfs(l,r,dct): def dfs(l,r,dct): visit=[0 for i in range(n+1)] arr=[l] while(arr): node=arr.pop() if node==r:return True visit[node]=1 for lnk in dct[node]: if not visit[lnk]: arr.append(lnk) return False def ok(mid,cst): for i,j in edges: cst[...

0.571198

from collections import Counter tc=int(input()) for k in range(tc): n=int(input()) a=list(map(int, input().rstrip().split())) b= list(map(int, input().rstrip().split())) cc=sorted(a+b) #print('cc = ',cc) p=[] q=[] #print('len(cc) = ',len(cc)) #print('len = ',(2*n)) #rx=0 for i in range(0,(2*n),2): p.append...

0.571068

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline mii=lambda:list(map(int,input().split())) for _ in range(int(input())): n,d=mii() a=list(mii()) ans=0 for i in range(n): while d>=i and a[i]: a[i]-=1 ans+=1 d-=i print(ans)

0.570847

for _ in range(int(input())): n=int(input()) a=list(map(int,input().split())) od=0 ev=0 for i in range(n): if(i&1): if(a[i]%2==0): od+=1 else: if(a[i]&1): ev+=1 if(od!=ev): print(-1) else: print(od)

0.56983

T = int(input()) for t in range(T): n, m = list(map(int, input().split())) c = list(map(int, input().split())) dp1 = [1e9]*((1 << n)+1) for i in range(n): dp1[1 << i] = c[i] dp1[1 << (n-1)] = min(dp1[1 << (n-1)], sum(c)) for i in range(m): l = list(map(int, input().split())) cost = l[0] s = l[1] it...

0.568948

# cook your dish here import math; from math import gcd,sqrt,floor,factorial,ceil from bisect import bisect_left,bisect_right import bisect; import sys; from sys import stdin,stdout import os sys.setrecursionlimit(pow(10,7)) import collections from collections import defaultdict,Counter from statistics import median # ...

0.568387

# cook your dish here from sys import stdin import functools def gcd(a, b): if (a == 0): return b return gcd(b % a, a) MAX=10001 def func(ind, g, dp, n, a): if (ind == n): if (g == 1): return 1 else: return 0 if (dp[ind][g] != -1): return dp[ind][g] ans = (func(ind + 1, g, dp, n, a) +...

0.567888

t=int(input()) for _ in range(t): n=int(input()) grid=[] for _ in range(n): temp=[] temp=list(map(int,input().strip().split())) temp.sort() grid.append(temp) curr=max(grid[n-1]) total=curr for i in range(n-2,0-1,-1): flag=0 for j in range(n-1,0-1,-1): if grid[i][j]<curr: flag=1 curr=...

0.56777

'''Author- Akshit Monga''' from sys import stdin, stdout input = stdin.readline t=int(input()) for _ in range(t): n=int(input()) a=[int(x) for x in input().split()] ans=0 dp=[-1 for i in range(0,n+1)] for i in a: var1=dp[i] var2=ans ans=max(ans,var1+1) dp[i]=max(dp[i],var2+1) print(n-ans)

0.567355

from math import sqrt,gcd for _ in range(int(input())): n=int(input()) ar=[int(x) for x in input().split()] g=ar[0] for i in range(1,n): g=gcd(g,ar[i]) f=g for i in range(2,int(sqrt(g))+1): if g%i==0: f=i break if g!=1: print(f) else:...

0.564477

for _ in range(int(input())): n, x = list(map(int, input().split())) A = [] for _1 in range(n): d, h = list(map(int, input().split())) A.append([d, h]) A.sort(reverse=True) if A[0][0] >= x: print(1) else: x -= A[0][0] mz = 0 for d, h in A: ...

0.56432

def outOfIndex(boys,girls,COST): if COST == 0: return len(boys) else: total_cost = [ abs(x-y) for x,y in zip(boys,girls)] total_cost = sum(total_cost) return total_cost for _ in range(int(input())): COST = int(input()) queue = input() B = queue.count('B') G = queue.count('G') boys=[] girls = [] if (ab...

0.564285

# cook your dish here for test in range(0,int(input())): A,B = map(int,input().split()) diff = abs(A-B) count=0 if not(A^B): print(-1) else: for i in range(1,int(diff**(1/2))+1): if diff%i==0: if diff/i==i: count+=1 else: count+=2 print(count)

0.564146

import sys input = sys.stdin.readline t = int(input()) for test in range(t): if test: input() n, m = list(map(int, input().split())) a = [-1] * m b = [-1] * m for i in range(m): a[i], b[i] = list(map(int, input().split())) l = [(a[i],0,i) for i in range(m)] + [(b[i],1,i) for i...

0.563932

import math for _ in range(int(input())): n=int(input()) ar=[int(x) for x in input().split()] # dp=[1]*n f=0 g=ar[0] for i in range(1,n): g=math.gcd(g,ar[i]) if g==1: f=1 print(n) break if f==0: print(-1)

0.563664

t = int(input()) for ti in range(t): n = int(input()) lri = [None for _ in range(n)] for _ in range(n): li, ri = list(map(int, input().split())) lri[_] = (li, ri, _) lri.sort() t = [None for _ in range(n)] ct, t[lri[0][2]], eg = 1, 1, lri[0][1] for i in range(1, n): if lri[i][0] <= eg: t[lri[i][2...

0.563169

q = int(input()) for i in range(q): n = int(input()) if n % 4 == 0: print(n // 4) elif n % 4 == 1 and n // 4 >= 2: print(n // 4 - 1) elif n % 4 == 2 and n // 4 >= 1: print(n // 4) elif n % 4 == 3 and n // 4 >= 3: print(n // 4 - 1) else: print(-1)

0.562675

def __starting_point(): t=int(input()) for _ in range(t): n,k,v=map(int,input().split()) li=list(map(int,input().split())) sumn=0 for i in range(n): sumn=sumn+li[i] sumk=v*(n+k)-sumn e=int(sumk/k) r=sumk%k if e<=0: print(-1) elif r!=0: print(-1) else: print(e) __starting_point()

0.562407

import sys input = lambda: sys.stdin.readline().rstrip() T = int(input()) for _ in range(T): N = int(input()) A = [ord(a) - 97 for a in input()] B = [ord(a) - 97 for a in input()] X = [[0] * 20 for _ in range(20)] for a, b in zip(A, B): X[a][b] = 1 if a > b: print(-1) ...

0.561478

n,m=map(int,input().split()) l=[] leng=0 for i in range(n+m): w=int(input()) if w==-1: cm=0 mi=0 for j in range(leng): if l[j]>cm: cm=l[j] mi=j print(cm) l[mi]=-1 else: l.append(w) l...

0.56039

n=int(input()) a=list(map(int,input().split())) q=int(input()) while q>0: i=1 tot=a[0] b=list(map(int,input().split())) if b[0]==1: #p,f=map(int,raw_input().split()) a[b[1]-1]=b[2] else: #r=int(raw_input()) tot=a[0] while 1+i*b[1]<=n: tot=tot*a[i*b[1]] i=i+1 m=(str)(tot) tot=tot%1000000007 pr...

0.559055

import math for i in range(int(input())): n,x=list(map(int,input().split())) l=list(map(int,input().split())) l.sort() flag=0 d=0 for j in range(n): if l[j]>x: for k in range(j,n): if x<l[k]: d+=(math.ceil(math.log(l[k]/x)/math.log(2))+1) else: d+=1 x=l[...

0.558393

t=int(input()) for i in range(t): s=input() zeroes=s.count('0') ones=s.count('1') if (len(s)%2==1 or zeroes==0 or ones==0): ans= -1 else: ans=abs(zeroes-ones)//2 print(ans)

0.558185

t = int(input()) for _ in range(t): n, m = map(int, input().split()) a = list(map(int, input().split())) if n <= 2: print(-1) continue if m < n: print(-1) continue cost = 0 edges = [] for i in range(n): edges.append((i+1, (i+1)%n + 1)) cost += 2 * a[i] s = sorted(range(n), key=lambda i: a[i]) ...

0.557619

# import all important libraries and inbuilt functions from fractions import Fraction import numpy as np import sys,bisect,copyreg,copy,statistics,os from math import * from collections import Counter,defaultdict,deque,OrderedDict from itertools import combinations,permutations,accumulate from numpy.linalg import ...

0.55618

for _ in range(int(input())): lasts = {} ans = n = int(input()) for i, a in enumerate(input().split()): if a in lasts: ans = min(ans, i - lasts[a]) lasts[a] = i ans += 1 if ans > n: ans = -1 print(ans)

0.556075

# cook your dish here import sys input=sys.stdin.readline for _ in range(int(input())): n,x=list(map(int,input().split())) l=[0] pre=[0]*(n+1) sum=0 i=1 for m in input().split(): l.append(int(m)) sum+=int(m) pre[i]=sum i+=1 dict={} k=[] i=1 while (i*i)<=x: if x%i==0: k.append(i) if (i*i)!=x: ...

0.555464

for _ in range(int(input())): n, m = map(int, input().split()) l1 = list(map(int,input().split())) print(min(sum(l1),m))

0.555323

import sys from operator import itemgetter def count(a, b, num_a, num_b, cur_time): current_result = 0 #print('count time = ', cur_time, "num_a =", num_a, 'num_b = ', num_b) if num_a * a + num_b * b <= cur_time and cur_time >= 0: cur_time -= num_a * a + num_b * b current_result = num_a + num_b if num_a < tota...

0.555263

n, q = list(map(int, input().split())) servers = [0] * n for _ in range(q): t, k, d = list(map(int, input().split())) # free = [i for i, x in enumerate(servers) if x < t] free = [] for sn in range(n): if servers[sn] < t: free.append(sn) if len(free) == k: break ...

0.555181

from math import ceil t=int(input()) for i in range(t): p=int(input()) l=list(map(int,input().split())) maxx=1 for i in range(len(l)): maxx=max(maxx,l.count(l[i])) if(maxx*2>p): print(maxx) else: q=p-maxx*2 maxx+=ceil(q/2)...

0.554998

for _ in range(int(input())): n = int(input()) mass = [] zo = 0 oz = 0 zz = 0 oo = 0 ozs = [] zos = [] ozss = set() zoss = set() for j in range(n): k = input() mass.append(k) if k[0] == '0' and k[-1] == '1': zoss.add(k) zos.appe...

0.554681

import sys from sys import stdin import bisect def LIS(lis , end): seq = [] for c in lis: ind = bisect.bisect_right(seq,c) if ind == len(seq): seq.append(c) else: if ind != 0: seq[ind] = c return bisect.bisect_right(seq,end) tt = 1 for ...

0.554179

for tcase in range(int(input())): n=int(input()) ls = list(map(int, input().split())) oneneed = 2*(n - ls.count(1)) ldct = {0:0} ctr = 0 eaten = 0 for i in range(n-1,-1,-1): eaten += 1 ctr += (1 if ls[i] == 2 else -1) if ctr not in ldct: ldct[ctr] = eaten ...

0.554154

from math import sqrt class pro(object): def __init__(self,dif,sc): self.dif=dif self.sc=sc def __lt__(self,other): return self.dif>other.dif T=int(input()) mul=[1] for i in range(100): mul.append(mul[i]*10/9) inf=1000000007 for t in range(T): n=int(input()) effi,tim=list(m...

0.554038

class Solution: def findMinMoves(self, machines): """ :type machines: List[int] :rtype: int """ if sum(machines) % len(machines) != 0: return -1 mean = sum(machines) // len(machines) cum, step = 0, 0 for x in machines: ...

0.55372

# cook your dish here import collections def shortestSubarray(A, K): N = len(A) P = [0] for x in A: P.append(P[-1] + x) #Want smallest y-x with Py - Px >= K ans = N+1 # N+1 is impossible monoq = collections.deque() #opt(y) candidates, represented as indices of P for y, Py in enume...

0.55351

from sys import setrecursionlimit setrecursionlimit(10 * 9) def solve(i): if i + k >= n: return 1 if i in dp: return dp[i] mini = float('inf') for j in range(i+1, min(n, i+k+1)): if i == -1 or a[i] == a[j]: mini = min(mini, solve(j) + 1) dp[i] =...

0.55175

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline mii=lambda:list(map(int,input().split())) for _ in range(int(input())): n,x=mii() has=0 a=0 for i in mii(): if x==i: has=1 a=max(a,i) if has: print(1) else: print(max(2,(x-1)//a+1))

0.55164

# cook your dish here from math import gcd for _ in range(int(input())): n,a,k,min_k,e = int(input()),[int(i) for i in input().split()],0,0,-1 for j in range(n): if(a[j] != -1):break for i in range(j,n): if min_k==0:min_k,e = a[i],a[i]+1 else: if min_k < a[i]:min_k = a[i...

0.551565

try: t=int(input()) for a in range(t): l=input().split() n=int(l[0]) m=int(l[1]) d={} s=0 for b in range(m): l1=input().split() i=int(l1[0]) j=int(l1[1]) k=int(l1[2]) for c in range(i,j+1): if c not in d: d[c]=10 for c in range(i,j+1): d[c]=d[c]*k for i in d: s=s+d[i] ...

0.551259

def Testcase(): h,x,y = [int(x) for x in input().strip().split()] h = h-1 yt = h//y +1 # print(yt) flag=0 ans = 100000000009 for i in range(0,yt): temp = x+i*y if h%temp==0: flag = 1 cl =i+int(h/temp) # print(temp,cl) ans...

0.551107

import sys t = int(sys.stdin.readline()) for _ in range(t): n = int(sys.stdin.readline()) intervals = [None]*n for i in range(n): intervals[i] = tuple([int(a) for a in sys.stdin.readline().split()]) intervals = list(zip(intervals, list(range(n)))) starts = sorted(intervals, key = lambda x:...

0.550636

# cook your dish here t=int(input()) for i in range(t): x=int(input()) if x%10==0: print(0) elif x%5==0: print(1) else: print(-1)

0.550174

# cook your dish here for a in range(int(input())): N,M=map(int,input().split()) b=[] for o in range(N): b.append(input()) c=[] for d in b: f=[] for e in range(len(d)): if d[e]=='1': f.append(e) c.append(f) i=[] for g in range(len(c)): for h in range(len...

0.549992

On February 14 Denis decided to give Valentine to Nastya and did not come up with anything better than to draw a huge red heart on the door of the length $k$ ($k \ge 3$). Nastya was very confused by this present, so she decided to break the door, throwing it on the mountains. Mountains are described by a sequence of h...

for _ in range(int(input())): n, k = tuple(map(int, input().split())) arr = list(map(int, input().split())) peaks = [0 for i in range(n)] for i in range(1, n - 1): if arr[i] > arr[i - 1] and arr[i] > arr[i + 1]: peaks[i] = 1 cnt = 0 max_peaks = 0 answer = 0 for i i...

0.801953

for _ in range(int(input())): n,k=list(map(int, input().split())) l=list(map(int, input().split())) l.sort() c=0 mn=abs(l[0]+l[1]-k) for i in range(n-1): for j in range(i+1, n): temp=abs(l[i]+l[j]-k) if temp==mn: c+=1 elif temp<mn: mn=temp c=1 elif l[i]+l[j]-k>mn: break...

0.751239

inpt=input().split(' ') n=int(inpt[0]) k=int(inpt[1]) i_lst=[] j_lst=[] m=0 inpt=input().split(' ') for i in range(len(inpt)): inpt[i]=int(inpt[i]) for i in range(k): mn=min(inpt) mx=max(inpt) if mn!=mx: i_mn=inpt.index(mn) i_mx=inpt.index(mx) inpt[i_mn]+=1 inpt[i_mx]-=1 ...

0.749648

t = input(); a = [0 for i in range(10001)] i = 0; while i < int(t): n = input(); k = input(); assert(len(k.split(' ')) == int(n)); for each in k.split(' '): a[int(each)] += 1; V = 0; C = a[V]; for j in range(10001): if C < a[j]: V = j; C = a[V]; a[j] = 0; i += 1; print(V, C);

0.737735

def main(): t= int(input()) while(t!=0): n,k = list(map(int , input().split())) arr = list(map(int, input().split())) freq = [0]*100001 k=k-1 st=0 end=0 currentCount=0 previousElement = 0 for i in range(n): freq[arr[i]]+=1 if(freq[arr[i]]==1): currentCount+=1 while(currentCount>k): ...

0.730626

# cook your dish here for _ in range(int(input())): n,k=map(int,input().split()) c=[int(i) for i in input().split()] i=0 m=0 if(n==2 and k==5): c1=c c.sort() d=dict() for i in range(len(c)): for j in range(len(c1)): if(c[i]==c1[j]): d[i]=j c1[j]=-1 break while(m<n): if (i==n)...

0.71338

for _ in range(int(input())): n,k=[int(x) for x in input().split()] a=list(map(int,input().split())) dp=[0]*(max(a)+1) for _ in range(n): dp[a[_]]+=1 for _ in range(1,len(dp)): if dp[_]>k: print(_,end=" ") print()

0.710814

import sys fin = sys.stdin n, k = map(int, fin.readline().split()) c = list(map(int, fin.readline().split())) s = [0] * (n + 1) for i in range(n): s[i + 1] = s[i] + c[i] ms = [i for i in range(n)] for i in range(n - k - 1, k - 1, -1): s_last = s[ms[i + 1] + k] - s[ms[i + 1]] s_curr = s[i + k] - s[i] if s_curr...

0.705386

def read_int(): return int(input()) def read_ints(): return list(map(int, input().split(' '))) t = read_int() for case_num in range(t): n, k = read_ints() p = [] for i in range(n): ai, bi = read_ints() p.append((bi, ai, i + 1)) p.sort() dp = [[0 for j in range(k + 1)] for...

0.704119

def readln(): return tuple(map(int, input().split())) import sys sys.stdin = open('input.txt', 'r') sys.stdout = open('output.txt', 'w') n, k = readln() lst = [(v, i + 1) for i, v in enumerate(readln())] lst.sort() lst.reverse() print(lst[k - 1][0]) print(*list(zip(*lst[:k]))[1])

0.695657

from collections import Counter n, k = map(int, input().split()) m = sorted(list(map(int, input().split())), reverse=True) c = [n] + list(map(int, input().split())) cnt = Counter(m) tmp = 0 size = 1 for i in range(k, 0, -1): tmp += cnt[i] size = max(size, (tmp-1)//c[i]+1) ans = [[] for _ in range(size)] for i, x in ...

0.693182

# cook your dish here def main(): for _ in range(int(input())): N, k = [int(x) for x in input().split()] Powers = [k ** int(x) for x in input().split()] s1, s2 = 0, sum(Powers) ans = (0, None) i = 0 while i < N - 1: s1 += Powers[i] s2 -= Powers[i] z = s1 ...

0.691689

import bisect def solve(n,x_coords,y_coords,k,ans): x_coords.sort() dp = [] for i in range(n): x = x_coords[i] index = bisect.bisect(x_coords,x+k)-1 dp.append(index-i+1) dp_max = [] for i in reversed(dp): if not dp_max: dp_max.append(i) else: ...

0.681545

def mi(): return map(int, input().split()) n, k = mi() a = list(mi()) for i in range(n): a[i] = [a[i],i] a.sort(reverse= True) a = a[:k] s = 0 ind = [] for i in a: s+=i[0] ind.append(i[1]) ind.sort() for i in range(k): ind[i]+=1 ind1 = ind.copy() for i in range(1,len(ind)): ind[i]-=ind1[i-1] ind[-1] = n-sum(i...

0.678283

from heapq import heappop, heappush n, k = [int(x) for x in input().split()] cs = [] for i in range(n): l, r = [int(x) for x in input().split()] cs.append((l, r, i+1)) cs.sort() h = [] lcs = set() for i in range(k-1): heappush(h, [cs[i][1], cs[i][2]]) lcs.add(cs[i][2]) l = -1 poped = [] push_i = k-1 fo...

0.672617

def possible(a): ans = set() s = set() lmax = 0 for i in range(len(a)): lmax = max(lmax, a[i]) s.add(a[i]) if lmax == i + 1 and len(s) == i + 1: ans.add(i + 1) return ans t = int(input()) for case_num in range(t): n = int(input()) a = list(map(int, input...

0.666533

def solve(): n = int(input()) a = list(map(int, input().split())) c = [0] * (n + 1) def inc(): for i in range(n - 1): if a[i] > a[i + 1]: return False return True def calc(): for i in range(n + 1): c[i] = 0 for i in a: ...

0.661108

n,k,m,t=list(map(int,input().split())) for i in range(t): a,b=list(map(int,input().split())) if a==1: if b<=k: k+=1 n+=1 print(n,k) else : if k>b: n=n-b k=k-b else : n=b print(n,k)

0.658772

for _ in range(int(input())): # n, x = map(int, input().split()) n = int(input()) arr = list(map(int, input().split())) ans = [arr[0]] for i in range(1, n - 1): if arr[i - 1] < arr[i] and arr[i] > arr[i + 1]: ans.append(arr[i]) elif arr[i - 1] > arr[i] and arr[i] < arr[i ...

0.648807

import sys def input(): return sys.stdin.readline()[:-1] t = int(input()) for _ in range(t): n, k = map(int, input().split()) a = list(map(int, input().split())) cum = [0 for _ in range(2*k+2)] for i in range(n//2): x, y = a[i], a[n-i-1] cum[2] += 2 cum[min(x, y)+1] -= 1 cum[x+y] -= 1 cum[x+y+1] += 1 ...

0.648318

q = 10001 n, a = int(input()), list(map(int, input().split())) a.sort() for i in range(40000 // (n - 1) + 1): b = [a[j] - j * i for j in range(n)] u, v = max(b), min(b) p = (u - v + 1) // 2 if p < q: q, s, d = p, v + p, i print(q) print(s, d)

0.640249

import sys # a very nice implementation of a minimum segment tree with # some inspiration taken from https://codeforces.com/blog/entry/18051 # this implementation should be able to be modified to do pretty # much anything one would want to do with segment trees apart from # persistance. # note that especially in pyth...

0.638321

# cook your dish here t=int(input()) for i in range(t): n=int(input()) nums=list(map(int,input().split())) k=int(input()) an=nums[k-1] cn=0 for i in range(n): if(nums[i]<an): cn+=1 print(cn+1)

0.637144

for _ in range(int(input())): n,k=list(map(int,input().split())) c=list(map(int,input().split())) count=1 for i in range(n): if i+1<n: if c[i]-c[i+1]>=k or c[i+1]-c[i]>=k: continue else: count+=1 c[i],c[i+1]=c[i+1],c[i] print(count)

0.636933

n = int(input()) x = [] for i in range(n): c, p = map(int, input().split()) x += [(p, c, i)] k = int(input()) r = list(map(int, input().split())) s = 0 q = [] for (v, c, a) in reversed(sorted(x)): p = -1 u = 100000 for (j, z) in enumerate(r): if c <= z < u: p = j u = z if p > -1: r[p] =...

0.63587

# cook your dish here import numpy as np def minstairs(n,k): stairsHeight=[] stairs=0 current = 0 stairsHeight=list(map(int, input().split())) stairsHeight=np.array(stairsHeight) curr=0 for i in range(n): if stairsHeight[i]-curr<=k: curr=stairsHeight[i] else: if (stairsHeight[i]-curr)%k==0: sta...

0.634181

import sys rd = lambda : sys.stdin.readline().rstrip() t = int(rd()) for _ in range(t): n = int(rd()) a = list(map(int, rd().split())) b = [] res_a, res_b = 1, 1e18 a = sorted(a) i = 0 while i < n-1: if a[i] == a[i+1]: b.append(a[i]) i += 1 ...

0.633595

from heapq import heappush,heappop,heapify n,k=map(int,input().split()) *l,=map(int,input().split()) q=[(-l[i],i)for i in range(k)];heapify(q) a=[0]*n s=0 for i in range(k,n): heappush(q,(-l[i],i)) x,j=heappop(q) s-=x*(i-j) a[j]=i+1 for i in range(n,n+k): x,j=heappop(q) s-=x*(i-j) a[j]=i+1 p...

0.632354

#for _ in range(int(input())): #n,m = map(int,input().split()) #n = int(input()) #x = [int(w) for w in input().split()] #x = [int(input()) for _ in range(n)] #for i in range(n): #dt = {} for i in x:dt[i] = dt.get(i,0)+1 #dt = {k:v for k,v in sorted(x.items(), key=lambda i: i[1])} from bisect import bisect_left as bs n...

0.632324

from bisect import insort from math import ceil for _ in range(int(input())): n,k=list(map(int,input().split( ))) array=list(map(int,input().split( ))) ans=0 index=[] for i in range(1,n+1): index.append(ceil(k/(ceil(k/i)))) for i in range(n): count=[0]*(2001) temp=[] for j in range(i,n): count[array[j]...

0.632149

def main(): n = int(input()) arr = list(map(int, input().split())) dct = {} k = -1 m = 0 for i in range(n): try: dct[arr[i]] += 1 except: dct[arr[i]] = 1 if dct[arr[i]] > m: m = dct[arr[i]] k = arr[i] print(n - m) for i in range(n...

0.627915

# -*- coding: utf-8 -*- """ Created on Mon Jan 8 10:20:50 2018 @author: yanni """ #import random n, T = [int(x) for x in input().split()] #n, T = [100000,10000*10000] prob = [] vals = [set() for stuff in range(n+2)] for i in range(n): a, t = [int(x) for x in input().split()] #a = random.randint(1,n) #t ...

0.626513

t = int(input()) for _ in range(t): n, k = [int(x) for x in input().split()] l1, r1 = [int(x) for x in input().split()] l2, r2 = [int(x) for x in input().split()] if l1 > l2: l1, r1, l2, r2 = l2, r2, l1, r1 if l2 < r1: # they already intersect. start = (min(r1, r2) - max(l1...

0.624933

for _ in range(int(input())): n=int(input()) a=list(map(int,input().split())) ans,small,big=0,2*10**9,-1 for i in range(len(a)-1): if a[i]==-1 and a[i+1]!=-1: small=min(small, a[i+1]) big=max(big, a[i+1]) if a[i]!=-1 and a[i+1]==-1: small = min(small, ...

0.624106

from sys import stdin,stdout from math import gcd for _ in range(int(stdin.readline())): # n=int(stdin.readline()) k-pieces n,k=list(map(int,stdin.readline().split())) a=list(map(int,stdin.readline().split())) gr=[[0 for _ in range(n)]for _ in range(n)];ans=0;k-=1 for sz in range(n): ...

0.623669

from sys import stdin n = int(stdin.readline()) a = [int(x) for x in stdin.readline().split()] a = sorted([(a[x],str(x+1)) for x in range(n)]) k = int(stdin.readline()) sums = [0] for x in a: sums.append(sums[-1]+x[0]) total = 0 s = 0 for x in range(k): total += a[x][0]*x-s s += a[x][0] low = total low...

0.623502

from functools import reduce def find_min_max_product(arr, k): if k <= len(arr): arr = sorted(arr, key=abs) lasts = arr[-k:] v1 = reduce(int.__mul__, lasts) v0 = reduce(int.__mul__, arr[:k]) first_SameOrOpp = [next((v for v in lasts if...

0.623014

# cook your dish here try: t = int(input()) for _ in range(t): n, k = map(int, input().split()) if k == 0: print(0, n) else: print(n//k, n%k) except: pass

0.622735

# cook your dish here T = int(input()) l = list(map(int, input().strip().split(" "))) depth = 0 max_depth = 0 max_depth_index = 0 max_l=0 max_l_index=0 last_zero=-1 for i in range(T): if l[i] == 1: depth += 1 if depth > max_depth: max_depth = depth max_depth_index = i + 1...

0.621069

import sys # stdin = open("testdata.txt", "r") ip = sys.stdin def solve(C, n, x): if n==1: return (1, 0) b1, b2 = 1, 1 a , b = C[0], C[-1] while b1 + b2 < n: if a < b*x: a += C[b1] b1 += 1 elif a > b*x: b2 += 1 b += C[n-b2] else: if b1 >= b2: a += C[b1] b1 += 1 else: b2 +=...

0.620721

t = int(input()) for _ in range(t): n, k = list(map(int, input().split())) l = list(map(int, input().split())) d = dict() d[0] = 0 for v in l: vv = (k - v) % k if vv: if vv not in d: d[vv] = vv + 1 else: d[vv] += k prin...

0.619707

# cook your dish here import bisect for _ in range(int(input())): w,k=map(str, input().split()) k=int(k) n=len(w) w=list(w) w.sort() w.append('0') c=1 l=0 l1=[] l2=[] for i in range(1, n+1): if w[i]==w[i-1]: c+=1 else: a=bisect.bisect_left(l1, c) if a==l: l1.append(c) l2.append(1) l...

0.619355

n = int(input()) line = input().split() lst = [] for num in line: lst.append(int(num)) cnt1 = [0] cnt2 = [0] c1 = 0 c2 = 0 for num in lst: if num == 1: c1 += 1 cnt1.append(c2) else: c2 += 1 cnt2.append(c1) w = lst[n - 1] ans = [] c1 = len(cnt1) c2 = len(cnt2) for t in ran...

0.619175

from operator import itemgetter #int(input()) #map(int,input().split()) #[list(map(int,input().split())) for i in range(q)] #print("YES" * ans + "NO" * (1-ans)) n,k = map(int,input().split()) si = list(map(int,input().split())) num = 10**5 * 2 + 1 ai = [0] * num for i in range(n): ai[si[i]] += 1 num3 = num num = m...

0.618982

n, k = map(int, input().split()) arr = [int(i) for i in input().split()] arr2 = [] for i in range(n): arr2.append((arr[i], i)) arr2.sort() ans = [] for i in arr2: if k >= i[0]: k -= i[0] ans.append(i[1]) print(len(ans)) for i in ans: print(i + 1, end = ' ')

0.618922

import math t = int(input()) for test in range(t): n,k = map(int,input().split()) A = list(map(int,input().split())) A.sort() ans = 0 for i in range(1,n): if(A[i]>k): ans = 0 break rem = k-A[i] ans+=rem//A[0] print(ans)

0.618829

class Solution: def smallestDistancePair(self, nums, k): """ :type nums: List[int] :type k: int :rtype: int """ nums.sort() l, r = 0, nums[-1] - nums[0] while l < r: m = l + (r - l) // 2 count = 0 ...

0.617517

# cook your dish here for t in range(int(input())): n,k=map(int,input().split()) a=[] sr=[] for i in range(k): x,y=input().split() y=int(y) a.append([10**10-y,x]) sr.append(sorted(x)) for i in range(n-k): x,y=input().split() y=int(y) x=sorted(x...

0.616928

# tested by Hightail - https://github.com/dj3500/hightail from heapq import heappop, heappush from sys import stdin, stdout read, read_array = stdin.readline, lambda: stdin.readline().split() write = lambda *args, **kw: stdout.write(kw.get('sep', ' ').join(str(a) for a in args) + kw.get('end', '\n')) write_array = ...

0.616659

import sys input = sys.stdin.readline T = int(input()) for _ in range(T): N, K = list(map(int, input().split())) A = [int(a) for a in input().split()] B = [A[i+K]-A[K] for i in range(N-K)] mi = 10**20 mx = -1 for i in range(N-K): if A[i+K]-A[i] < mi: mi = A[i+K]-A[i] ...

0.616647

for j in range(int(input())): input() a = list(map(int,input().split())) marks = 0 backlok = 0 top_marks = max(a) topper = [] for i in range(len(a)): if(a[i] >= 31): marks+=a[i] if(a[i]<31): backlok+=1 if(a[i] == top_marks): topper.append(i) print(backlok, "{:0.2f}".format(marks/len(a),2)) toppe...

0.615902

n, k = list(map(int, input().split())) c, m, l, r = 0, 0, [], 0 for e in [int(i) for i in input().split()]: d = m - c * (n - c - 1) * e r+= 1 if d < k: n -= 1 l += [r] else: m += c * e c += 1 l.sort() for e in l: print(e)

0.614466

import math from collections import defaultdict import sys input = sys.stdin.readline def main(): n = int(input()) a = list(map(int, input().split())) MAX = 10**7 + 1 res = MAX * MAX #MAX_P = int(math.sqrt(MAX)) MAX_P = 3163 primes = [] p = 2 sieve = [True] * (MAX_P+1) while...

0.61384

#dt = {} for i in x: dt[i] = dt.get(i,0)+1 import sys;input = sys.stdin.readline inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()] def check(mid): pos = x[0] ct = 1 for i in range(1,n): if x[i]-pos >= mid: pos = x[i] ct += 1 if ct...

0.613819

#CF Round 150. Div II Prob. A - Dividing Orange import sys In = sys.stdin n, k = [int(x) for x in In.readline().split()] arr, s, cnt = [int(x) for x in In.readline().split()], set(), 1; s.update(arr) for i in range(k): c = [arr[i]] for j in range(n - 1): while (cnt in s): cnt += 1; ...

0.613612

import sys import re def minp(): return sys.stdin.readline().strip() def mint(): return int(minp()) def mints(): return map(int, minp().split()) def solve(): n, h, m, k = mints() m //= 2 a = [0]*n e = [None]*(2*n+2) c = 0 for i in range(n): hh, mm = mints() x = mm % m a[i] = mm e[2*i] = ((x+k)%m, -...

0.612055

#!/usr/bin/env python import sys n = int(input()) k = (n << 2) + 1 x, y = [], [] for i in range(k): xi, yi = list(map(int, input().split())) x.append(xi) y.append(yi) for lx in range(0, 50): for ly in range(0, 50): for side_len in range(1, 51): ok, idx = True, -1 for i...

0.611423

t = int(input()) for tc in range(t): n,k=list(map(int, input().split())) tap = list(map(int, input().split())) sol=0 for i in range(1, n+1): d=1000000 for j in tap: d=min(d, abs(j-i)+1) sol=max(sol, d) print(sol)

0.610877

# cook your dish here t=int(input()) while(t): t=t-1 n,k=list(map(int,input().split())) q=list(map(int,input().split())) days,rem=0,0 for i in range(n): rem+=q[i] if(rem>=k): rem-=k else: days=i+1 break days+=1 if(rem>=k): days+=(rem//k)+1 print(days)

0.610301

# cook your dish here #t = int(input()) for i in range(int(input())): n,k = map(int,input().split()) l = list(map(int,input().split())) l.sort(reverse = True) c = 0 for i in l: if i >= l[k-1]: c += 1 print(c)

0.60996

import random def S(L): Ans=[] s=0 for item in L: s+=item Ans.append(s) return Ans n,k=map(int,input().split()) B=list(map(int,input().split())) Sums=[] s=0 for i in range(n): s+=B[i] Sums.append(s) if(k<=n): for i in range(k): print(i+1,end="") for j in...

0.60965

from fractions import Fraction import bisect import os from collections import Counter import bisect from collections import defaultdict import math import random import heapq as hq from math import sqrt import sys from functools import reduce, cmp_to_key from collections import deque import threading from itertools im...

0.609177

for _ in range(int(input())): n,k=list(map(int,input().split())) a=list(map(int,input().split())) def check(mid): d,left={},0 for i in range(mid): if a[i]>k: if a[i] not in d: d[a[i]]=1 else: d[a[i]]+=1 if len(d)==1: return True for i in range(mid,n): if a[left]>k: d[a[left]]...

0.608787

#code snippet reference:http://www.geeksforgeeks.org/searching-for-patterns-set -2-kmp-algorithm/ def KMPMatch(pattern, string): M = len(pattern) N = len(string) nonlocal ans lps = [0]*M j = 0 LPSCompute(pattern, M, lps) i = 0 while i < N: if pattern[j] == string[i]: i+=1 j+=1 if j==M: ans+...

0.608116

n, k = list(map(int, input().split())) a = [] for i in range(n): a.append(input()) s = input() kmn = 1 kmx = 0 for i in range(n): if (len(a[i]) < len(s)): kmn += 1 kmx += 1 elif (len(a[i]) == len(s)): kmx += 1 print((kmn - 1) // k * 5 + kmn, (kmx - 1) // k * 5 + kmx)

0.606138

#!/usr/bin/env python3 try: while True: n, k = map(int, input().split()) a = list(map(int, input().split())) left = 0 result = -1 cur = 0 for i in range(n): if not a[i]: if k: k -= 1 else: ...

0.605265

for __ in range(eval(input())): x = eval(input()) a = list(map(int,input().split())) key = eval(input()) query = eval(input()) maxvisited = x #maximum visted value j = x-1 ans = [] val = 0 while j>=0: if a[j]==key: ans.append(val+1) val = val +1 ...

0.60406

for _ in range(int(input())): n = int(input()) a = list(map(int,input().split())) ans = 0 count = 0 for i in a: if i>0: ans+=i count+=1 res = [] for i in range(count): if a[i]<=0: res.append(i+1) for i in range(count,n): if a[i]>0: res.append(i+1) print(ans) print(len(res),*res)

0.603094

import sys import math def main(arr,k): x=[] y=[] for e in arr: if e%2==0: x.append(e) y.append(0) else: x.append(0) y.append(e) a=[0]*n b=[0]*n a[0]=x[0] b[0]=y[0] for i in range(1,n): if i<k: a[i]=max(x[i],a[i-1]) b[i]=max(y[i],b[i-1]) else: a[i]=max(x[i]+a[i-k-1...

0.60216

# import all important libraries and inbuilt functions from fractions import Fraction import numpy as np import sys,bisect,copyreg,copy,statistics,os from math import * from collections import Counter,defaultdict,deque,OrderedDict from itertools import combinations,permutations,accumulate from numpy.linalg import ...

0.60096

n, k = [int(i) for i in input().split(" ")] A = [int(i) for i in input().split(" ")] mx=0 mxval=0 for i in range(k): if A[i]*(n//A[i])>mxval: mxval = A[i]*(n//A[i]) mx = i print(mx+1, n//A[mx])

0.600731

t = int(input()) for tt in range(t): n,k=list(map(int,input().split())) s = input() ans = [] if s[0] == ')': for i in range(n): if s[i] == '(': ans.append([1,i+1]) s = s[i::-1] + s[i+1:] break for i in range(1,(k-1)*2): if i...

0.60025

import numpy as np from numba import njit i8 = np.int64 @njit def solve(a, b, t, K, N): t1 = t // K d = t % K * 2 # b が a から a + d の位置にあれば衝突する x = 0 y = 0 ans = 0 for c in a: while b[x] < c: x += 1 while b[y] <= c + d: y += 1 ...

0.60023

import sys input = sys.stdin.readline import numpy as np from heapq import heappush, heappop N = int(input()) A = np.array(input().split(), dtype=np.int32) a_to_i = {a:i for i,a in enumerate(A)} # sparse table を使ってRMQ # parityの同じところだけを見るようにしておく U = len(A).bit_length() sp = [None,A] for i in range(2,U): L = 1 << ...

0.599814

t=int(input()) for i in range(t): n,m=list(map(int,input().split())) l=[0]+list(map(int,input().split())) s=0 c=1 m1=[] for i in range(n): d,f,b=list(map(int,input().split())) if(l[d]>0): m1.append(d) s+=f l[d]-=1 else: m1.append(0) s+=b for i in range(n): if(m1[i]==0): for j in range(c...

0.599712

import sys input = sys.stdin.readline from collections import deque N, Q = list(map(int, input().split())) que = deque([int(a) for a in input().split()]) ma = max(que) X = [] k = -1 c = 0 while c <= k+N+5: a = deque.popleft(que) b = deque.popleft(que) X.append((a, b)) c += 1 if a > b: ...

0.59969

from bisect import bisect_left, insort_left a = [] n = int(input()) for _ in range(n): #print(a) s, d = list(map(int, input().split())) if len(a) == 0: print(s, s+d - 1) a.append((s, s + d - 1)) continue p = bisect_left(a, (s, s + d - 1)) #print('p', p) ok = True if p...

0.597363

#!usr/bin/env python3 from collections import defaultdict,deque from heapq import heappush, heappop import sys import math import bisect def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline()) def LS():return [list(x) for x in sys.stdin.readline().split()] def S(): ...

0.596746

n=int(input()) arr=[0]+[int(x) for x in input().split()] used=[] ans=[] for i in range (1,n+1) : d=[] start,end=i,arr[i] if i not in used : d.append(i) used.append(i) while(True) : d.append(end) if end==start : break else : ...

0.596028

from sys import stdin, stdout K = 20 def findAllStrings(s): n = len(s) sDict = {} for i in range(1,K+1): sDict[i]=set() for x in range(n-i+1): sDict[i].add(s[x:x+i]) return sDict n = int(stdin.readline().rstrip()) stringDicts = [] stringEnd = [] stringBegin = [] for i in ...

0.595785

# cook your dish here t=int(input()) for i in range(t): a=0 b=0 N,K,x,y=map(int,input().split()) if x==y: a=N b=N elif x>y: if K%4==1: a=N b=y-x+N elif K%4==2: a=y-x+N b=N elif K%4==3: a=0 b=x-y else: a=x-y b=0 else: if K%4==1: a=x-y+N b=N elif K%4==2: a=N b=x...

0.59523

import sys input = sys.stdin.readline from collections import Counter t=int(input()) for testcases in range(t): n=int(input()) P=list(map(int,input().split())) C=Counter(P) PLIST=sorted(set(P),reverse=True) g=C[PLIST[0]] s=0 b=0 sflag=1 for i in PLIST[1:]: if sflag: ...

0.59498

import sys input = sys.stdin.readline rInt = lambda: int(input()) mInt = lambda: list(map(int, input().split())) rLis = lambda: list(map(int, input().split())) t = int(input()) for _ in range(t): n, k = mInt() a = rLis() b = rLis() a.sort() b.sort(reverse = True) for i in range(k): if a...

0.594158

import sys import heapq as hq readline = sys.stdin.readline ns = lambda: readline().rstrip() ni = lambda: int(readline().rstrip()) nm = lambda: map(int, readline().split()) nl = lambda: list(map(int, readline().split())) eps = 10**-7 def solve(): n, k = nm() a = nl() ans = [0]*n ok = 10**9; ng = -4*...

0.594025

import sys n, m = [int(x) for x in input().split()] A = [int(x) for x in input().split()] B, C = [0]*(m+1), [0]*(m+1) for a in A: if a <= m: B[a] += 1 for i in range(2, m + 1): for j in range(i, m+1, i): C[j] += B[i] k, l = 1, 0 for i in range(2, m+1): if C[i] > l: l = C[i] k = i p...

0.592241

# cook your dish here for _ in range(int(input())): n,k = [int(c) for c in input().split()] a = [int(c) for c in input().split()] ls = a if n==1: print("YES") print(1) continue if k==1: print("NO") continue if k==2 and n>2: if ls[0]!=ls[1]-1: ...

0.592032

import sys import math n, k = list(map(int,sys.stdin.readline().strip().split(' '))) grid = [] for n0 in range(n): grid.append([char for char in sys.stdin.readline().strip()]) res = [[0 for i in range(n)] for j in range(n)] for i in range(n): for j in range(n): if grid[i][j] == '#': continue ii, jj = i,j ...

0.59192

def sum_zeroth(arr): res = 0 for elem in arr: res += elem[0] return res n, a, b, k = list(map(int, input().split())) data = input() dist = [] pp = 0 last = 0 for i in range(n): if data[i] == '1': dist.append((last, i)) pp += (i - last) // b last = i + 1 dist.append((la...

0.590215

def fact(n): if n<2: return 1 return n * fact(n-1) def ncr(n, r): return fact(n)// (fact(r)*fact(n-r)) t=int(input()) for _ in range(t): n, k = list(map(int, input().split())) a = list(map(int, input().split())) a.sort() count_z = a.count(a[k-1]) count_z_seq = a[:k].count(a[k-1]) print(ncr(count_z, co...

0.589678

# cook your dish here t=int(input()) while t!=0: n,k=map(int,input().split()) lst=[] for i in range(1,n+1): lst.append(i) lst[k],lst[n-1]=lst[n-1],lst[k] for item in lst: print(item,end=' ') t-=1

0.589648

for _ in range(int(input())): n, k = map(int, input().split()) l = [*map(int, input())] count = [0] * (n + 1) for i in range(n - 1, -1, -1): if l[i] == 1: count[i] = count[i + 1] + 1 x,y = 0,0 for i in range(n): if l[i] == 1: x += 1 else: try: y = max(y, x + k + count[i + k]) except: ...

0.58892

n = int(input()) a = [int(x) for x in input().split()] res = {} for i in range(n): sm = 0 for j in range(i, n): sm += a[j] if sm in res: res[sm].append((i, j)) else: res[sm] = [(i, j)] best = 0 bestI = -1 for key in res: r = -1 cnt = 0 for (a,b) in sorted(res[key]): if a > r: ...

0.588001

# cook your dish here import math T = int(input()) for _ in range(T): N, A, K = map(int, input().split(" ")) total = (N-2) * 180 diffT = total - N*A diffN = sum(range(1,N)) r = (A*diffN+(K-1)*diffT) d = math.gcd(r, diffN) while d > 1: r//=d diffN//=d d = math.gcd(r, diffN) print(r, diffN)

0.587543

#!usr/bin/env python3 import sys import bisect def LI(): return [int(x) for x in sys.stdin.readline().split()] mod = 1000000007 def solve(): def add(i,x): while i < len(bit): bit[i] += x i += i&-i def sum(i): res = 0 while i > 0: res += bit[i] ...

0.58601

import sys import math import bisect from sys import stdin,stdout from math import gcd,floor,sqrt,log from collections import defaultdict as dd from bisect import bisect_left as bl,bisect_right as br sys.setrecursionlimit(100000000) ii =lambda: int(input()) si =lambda: input() jn =lambda x,l: ...

0.585931

import sys n, m = list(map(int, sys.stdin.readline().split())) vis = [0] * 1000005 num = list(map(int, sys.stdin.readline().split())) flag = 0 temp = num[0] for i in range(n): if num[i] != temp: flag = 1 break if flag == 0: print("{0} {1}".format(1, n)) else: l = 0 r = 0 al = 0 a...

0.585096

import sys def Is_arth(L): D=L[1]-L[0] p=L[1] for i in range(2,len(L)): if(L[i]-p!=D): return False p=L[i] return True n=int(sys.stdin.readline()) A=list(map(int,sys.stdin.readline().split())) T=[False]*(10**5+1) Z=[] for i in range(10**5+1): Z.append([]) Taken=[] fo...

0.582469

import sys input = sys.stdin.readline from collections import defaultdict class Unionfind: def __init__(self, n): self.par = [-1]*n self.rank = [1]*n def root(self, x): r = x while not self.par[r]<0: r = self.par[r] t = x ...

0.582336

n,k=map(int,input().split()) a=list(map(int,input().split())) p=1000 first=1 for i in range(n): if a[i]>k*i: now=0 f=a[i]-k*i for j in range(i): if a[j]!=f+k*j: now+=1 for j in range(i+1,n): if a[j]!=f+j*k: now+=1 if now...

0.581639

from heapq import heappush, heappop class Solution: def kSmallestPairs(self, nums1, nums2, k): """ :type nums1: List[int] :type nums2: List[int] :type k: int :rtype: List[List[int]] """ heap = [] def push(i, j): if i < len(nums...

0.581004

def array_equalization(a, k): totals, ends = {}, {} for i, n in enumerate(a): if n not in ends: totals[n], ends[n] = 0, -1 if i < ends[n]: continue count = (i - ends[n] - 1 + k - 1) // k totals[n] += count ends[n] = max(i, ends[n] + count * k) return min(t + (len(a) -...

0.580615

You are given an image, that can be represented with a 2-d n by m grid of pixels. Each pixel of the image is either on or off, denoted by the characters "0" or "1", respectively. You would like to compress this image. You want to choose an integer k > 1 and split the image into k by k blocks. If n and m are not divisib...

#!/usr/bin/env python # coding:utf-8 # Copyright (C) dirlt from sys import stdin def run(n, m, pixels): ans = 1 << 30 acc = [[0] * (m + 1) for _ in range(n + 1)] for i in range(n): for j in range(m): acc[i + 1][j + 1] = acc[i + 1][j] + int(pixels[i][j]) for j in range(m): ...

0.805114

from sys import stdin n,m=list(map(int,stdin.readline().strip().split())) s=[] for i in range(n): s.append(list(map(ord,list(stdin.readline().strip())))) for j in range(m): s[-1][j]=s[-1][j]-97 ct=[tuple(map(int,stdin.readline().strip().split())) for i in range(n)] mc=[[0 for i in range(22)] for j in ra...

0.747372

class Solution: def getMax(self, arr, m, n): res = 0 for e in arr: if m >= e[0] and n >= e[1]: res += 1 m -= e[0] n -= e[1] return res def findMaxForm(self, strs, m, n): """ :type strs: List[str]...

0.745192

n, m = list(map(int, input().split())) m += 2 l = [] do = False for i in range(n): s = input().strip() if s.find('1') != -1 or do: do = True l.append(s) n = len(l) if n == 0: print(0) return dp = [] for i in range(n): dp.append([None] * 2) for i in range(n): R = 0 for j in range(m): if l[i][j] == '1': ...

0.721493

read = lambda: map(int, input().split()) n, m = read() a = [list(read()) for i in range(n)] ans = n * m for i in range(n): cnt0 = a[i].count(0) cnt1 = a[i].count(1) if cnt0 > 1: ans += (2 ** cnt0 - cnt0 - 1) if cnt1 > 1: ans += (2 ** cnt1 - cnt1 - 1) for i in range(m): cnt0 = sum(a[j][i] == 0 for j ...

0.705888

n, m = list(map(int, input().split())) A = [input().split() for i in range(n)] T = False for i in range(n): for j in range(m): if A[i][j] == '1' and (i == 0 or j == 0 or i == n - 1 or j == m - 1): T = True if T: print(2) else: print(4)

0.691994

from collections import defaultdict as dd import math import sys #input=sys.stdin.readline def nn(): return int(input()) def li(): return list(input()) def mi(): return list(map(int, input().split())) def lm(): return list(map(int, input().split())) n,m=mi() quilt=[] for i in range(n): quilt.append(li()) def ...

0.686545

# cook your dish here import sys import math def main(grid): ans=0 for i in range(len(grid)): for j in range(len(grid[0])): first_point=grid[i][j] for k in range(j+1,len(grid[0])): second_point=grid[i][k] if first_point==second_point: ...

0.685824

n,m=map(int,input().split()) L=[] for i in ' '*n:L.append(input()) dp=[[0]*m for i in range(n)] for i in range(n+m-1): rightmin=max(0,i-(n-1)) leftmin=max(0,i-(m-1)) left=i-rightmin jstart = max(0, i - (n - 1)) for j in range(abs(left-leftmin)+1): jj=jstart+j ii=i-jj if jj<2 ...

0.685793

n, m = [int(x) for x in input().split()] c = 0 for _ in range(n): a = [int(x) for x in input().split()] for i in range(m): if a[i * 2] or a[i * 2 + 1]: c += 1 print(c)

0.679016

class Solution: def largestOverlap(self, A, B) -> int: leng = len(A[0]) # convert A, B to binary a = 0 b = 0 for i in range(0, leng * leng): row = int(i % leng) col = int(i / leng) a = (a << 1) + A[col][row] b = (b << 1) + B[co...

0.669423

def matrixScore(A): """ :type A: List[List[int]] :rtype: int """ m,n = len(A),len(A[0]) # 行变换 for i in range(m): if A[i][0] == 1: continue for j in range(n): A[i][j] = 1 - A[i][j] # 列变换 res = 0 ...

0.669226

n, m = [int(x) for x in input().split()] a = [[int(c == '.') for c in input()] for i in range(n)] def rotate(a): n = len(a) m = len(a[0]) b = [[0] * n for i in range(m)] for i in range(n): for j in range(m): b[j][n - 1 - i] = a[i][j] return b def calc(a): n = len(a) m =...

0.658766

#!/usr/bin/env python3 a = input() b = input() sumi = 0 for i in range(len(b) - len(a) + 1): if b[i] == '1': sumi += 1 lowest = 0 highest = len(b) - len(a) + 1 total = 0 for i in range(len(a)): if a[i] == '0': total += sumi else: total += highest - lowest - sumi if b[lowest]...

0.650625

import sys def input(): return sys.stdin.readline()[:-1] H, W = map(int, input().split()) s = [input() for _ in range(H)] ans = max(H, W) def max_rect(a): res = 0 stack = [a[0]] for i in range(1, W-1): new_pos = i while stack and stack[-1] % 10000 >= a[i]: pos, hght = stack[-1] // 10000, stack[-1] % 10000 ...

0.648494

f = [] for i in range(2): f.append(list(input())) answer = 0 n = len(f[0]) for i in range(n): if f[0][i] == f[1][i] == '0' and i + 1 < n: if f[0][i + 1] == '0': answer += 1 f[0][i + 1] = 'X' elif f[1][i + 1] == '0': answer += 1 f[1][i + 1] = 'X'...

0.646243

import numpy as np for _ in range(int(input())): ans = np.float('inf') n, m = (int(x) for x in input().split()) sig = np.zeros((n,m)) img = np.zeros((3*n,3*m)) for row in range(n): sig[row,:] = np.array([int(x) for x in input()]) for row in range(n): img[row+n,m:2*m] = np.array([int(x) for x in input()]) for...

0.641319

def main(): n, m = list(map(int, input().split())) aa = [] for _ in range(n): row = list(map(int, input().split())) row.append(0) aa.append(row) aa.append([0] * (m + 1)) d1, d2, d3, d4 = ([[0] * (m + 1) for _ in range(n + 1)] for _ in (1, 2, 3, 4)) for i in range(n): ...

0.639973

""" Codeforces Round 251 Div 2 Problem D Author : chaotic_iak Language: Python 3.3.4 """ def read(mode=2): # 0: String # 1: List of strings # 2: List of integers inputs = input().strip() if mode == 0: return inputs if mode == 1: return inputs.split() if mode == 2: ...

0.637183

def main(): import sys from array import array input = sys.stdin.readline class Bit: def __init__(self, n): self.size = n self.size_bit_length = n.bit_length() self.tree = array('h', [0] * (n+1)) def reset(self): self.tree = array('h', [0...

0.636511

#for _ in range(int(input()): #n,m = map(int,input().split()) #x = [int(w) for w in input().split()] #n = int(input()) #x = [int(input()) for _ in range(n)] #for i in range(n): #dt = {} for i in x:dt[i] = dt.get(i,0)+1 #dt = {k:v for k,v in sorted(x.items(), key=lambda i: i[1])} m,n = map(int,input().split()) # top,r...

0.633536

import sys input = sys.stdin.readline n,m=list(map(int,input().split())) MAP=[list(input().strip()) for i in range(n)] from collections import deque Q=deque() Q.append([0,0]) while Q: x,y=Q.pop() if x+1<n and MAP[x+1][y]==".": MAP[x+1][y]=1 Q.append([x+1,y]) if y+1<m and MAP[x][y+1]=="....

0.631297

import sys q = int(sys.stdin.readline().strip()) for t in range(0, q): n, m = list(map(int, sys.stdin.readline().strip().split())) L = [] R = [0] * n C = [0] * m for i in range (0, n): L.append(sys.stdin.readline().strip()) for j in range (0, m): if L[i][j] != "*": ...

0.630779

import numpy as np import sys input = sys.stdin.readline H,W = list(map(int,input().split())) S=np.array([list(input().rstrip("\n")) for _ in range(H)]) == '.' D = np.zeros((H,W),dtype=int) U = np.zeros((H,W),dtype=int) L = np.zeros((H,W),dtype=int) R = np.zeros((H,W),dtype=int) # 上下 for i in range(H): U[i] = (U[i...

0.630071

from sys import stdin, stdout n, m = map(int, stdin.readline().split()) first = list(map(int, stdin.readline().split())) second = list(map(int, stdin.readline().split())) ans = float('inf') for i in range(n): cnt = float('-inf') for j in range(m): for z in range(n): if z == i: ...

0.628404

class Solution: def maximalSquare(self, matrix): """ :type matrix: List[List[str]] :rtype: int """ if not matrix: return 0 m, n = len(matrix), len(matrix[0]) dp = [int(matrix[i][0]) for i in range(m)] vmax = max(dp) ...

0.628066

import sys input = [] input_index = 0 def next(type, number = None): def next(): nonlocal input, input_index while input_index == len(input): if sys.stdin: input = sys.stdin.readline().split() input_index = 0 else: raise Exception() input_index += 1 return i...

0.62643

n=int(input()) R=[] L=[] for i in range(n): x,y=input().split() R.append(x) L.append(y) a=R.count("0") b=L.count("0") answer=min(a,n-a)+min(b,n-b) print(answer)

0.62548

maxn = 100100 ar = [1 for i in range(maxn)] ar[0], ar[1] = 0, 0 for i in range(2, maxn): if ar[i]: for j in range(i, (maxn - 1) // i + 1): ar[i * j] = 0 dst = maxn d = [dst for i in range(maxn)] for i in reversed(list(range(maxn))): if ar[i]: dst = 0 d[i] = min(d[i], dst) dst += 1 n, m = list(map(...

0.623394

n, m = list(map(int, input().split())) a = list(map(int, input().split())) b = list(map(int, input().split())) possible = [[] for i in range(n)] for i in range(n): for j in range(m): possible[i].append(a[i] & b[j]) import sys for answer in range(2 ** 9): answer_flag = 1 for i in range(n): ...

0.617451

from collections import Counter n, m = map(int, input().split()) l = [input() for _ in range(n)] v = [*map(int, input().split())] res = 0 for i in range(m): res += v[i] * max(Counter(s[i] for s in l).values()) print(res)

0.614358

import sys input = sys.stdin.readline n, m = list(map(int, input().split())) arr = [[] for i in range(m)] for _ in range(n): l = list(map(int, input().split())) for i in range(m): arr[i].append(l[i]) out = 0 for i in range(m): l = arr[i] best = list(range(0, -n, -1)) for j in range(n...

0.61328

t = int(input()) for _ in range(t): n,m = list(map(int, input().split())) l = [] for _ in range(n): l.append(list(map(int,input().split()))) zeroes = [0] * (m + n - 1) ones = [0] * (m + n - 1) for i in range(n): for j in range(m): if l[i][j] == 0: zer...

0.611734

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): print(*args, **kwargs, file=sys.stderr) dprint('debug mode') except ...

0.61018

from sys import stdin, stdout def __starting_point(): def omkar_and_last_floor(a, n, m): dp = [[0 for c in range(m)] for r in range(m)] #print(dp) for r in range(m): for l in range(r,-1,-1): for k in range(l, r+1): cnt = 0 ...

0.609155

from collections import defaultdict from itertools import product def solve(mouse,n,m): # shadow matrix will contains the count of mice which affect (i,j) position # if there is a mice at position (i,j) then in shadow matrix it will affect all four adjacent blocks shadow=[[0 for i in range(m)]for j in ra...

0.607652

class Solution: def maximalRectangle(self, matrix): """ :type matrix: List[List[str]] :rtype: int """ if not matrix or not matrix[0]: return 0 n = len(matrix[0]) height = [0] * (n + 1) ans = 0 for row in matrix: ...

0.606916

from collections import defaultdict as dd def find(a, b): n = len(a) m = len(b) dp = [[0]*(m+1) for i in range(n+1)] for i in range(n-1,-1, -1): for j in range(m-1, -1, -1): if a[i] == b[j]: dp[i][j] = dp[i+1][j+1] + 1 mx = dd(int) ans = 0 for i in range(n-1, -1, -1): for j in range(m-1, -1, -1): ...

0.606156

class Solution: def flipLights(self, n, m): """ :type n: int :type m: int :rtype: int """ states = set() for op_odd in [0, 1]: for op_even in [0, 1]: for op_third in [0, 1]: op_all = m - op_odd - op_ev...

0.60577

L=[] for i in range(5): s=input().split() L.append(list(s)) for i in range(5): for j in range(5): if(L[i][j]=="1"): row=i col=j x=abs(row-2)+abs(col-2) print(x)

0.603413

n, m, k = input().split(' ') n = int(n) m = int(m) k = int(k) ind = [] pre = [] for _ in range(n): s = input() ind.append([]) for i, c in enumerate(s): if c == '1': ind[-1].append(i) for i in range(n): pre.append([]) for j in range(k + 1): pre[i].append([]) if l...

0.603196

# AC import sys sys.setrecursionlimit(1000000) class Main: def __init__(self): self.buff = None self.index = 0 def __next__(self): if self.buff is None or self.index == len(self.buff): self.buff = self.next_line() self.index = 0 val = self.buff[self.ind...

0.602757

import sys input = sys.stdin.readline n, m = list(map(int, input().split())) l = [] for _ in range(n): l.append(input().strip()) def witch(s): out = 0 if s[0] != s[1]: out += 2 if s[1] != s[2]: out += 1 return out if n >= 4 and m >= 4: print(-1) else: if n < m: n, ...

0.599896

# cook your dish here from sys import stdin,stdout a0=0 a1=1 n,k=stdin.readline().strip().split(' ') n,k=int(n),int(k) arr=list(map(int,stdin.readline().strip().split(' '))) def solve(n,k,arr): sol=[] l=0;u=k; while l!=u: sol.append(arr[l:min(len(arr),u)]) l=min(l+k,len(arr)) u=min(u+k,len(arr)) ...

0.598051

from collections import Counter n,m=map(int,input().split()) lis=[] cnt=0 for i in range(n): l=list(map(int,input().split())) lis+=l[1:] d=Counter(lis) for i in d.values(): if i==n: cnt+=1 print(cnt)

0.597111

line = input().split() n = int(line[0]) m = int(line[1]) lst = [input()] sml = [] for i in range(n - 1): lst.append(input()) sml.append(False) ans = 0 for i in range(m): flag = True for j in range(n - 1): flag = flag and ((lst[j][i] <= lst[j + 1][i]) or sml[j]) if flag: for j in ra...

0.595362

def f(m): v = 0 for x in m: v |= x return v input() print(f(map(int, input().split())) + f(map(int, input().split())))

0.592298

# cook your dish here # cook your dish here n=0;m=0; A=[];B=[]; anscount=0;k=0; def generate(n,m,l): nonlocal anscount if(len(l)==n+m): X=l i,j = 0,0 C=[0 for t in range(n+m)] while((i+j)<(n+m)): if(X[i+j] == 0): C[i+j] = A[i] i = i+1 else: C[i+j] = B[j] j = j+1 ans = len(C) for i i...

0.591525

class Solution: def numSubmat(self, mat: List[List[int]]) -> int: n, m = len(mat), len(mat[0]) heights = [0] * m res = 0 for i in range(0, n): stack = [] count = 0 for j in range(0, m): if mat[i][j] == 1: heights...

0.589405

# cook your dish here n,m=map(int,input().split()) L=[] for i in range(n): s=input() L.append(s) cost=[] h2=[0]*(m+1) cost.append(h2) for i in range(n): h=[0] for j in range(m): if(L[i][j]=='0' and (i+j)%2!=0): h.append(1) elif(L[i][j]=='1' and (i+j)%2==0): h.app...

0.585293

# cook your dish here t=int(input()) while t: n=int(input()) r1=input() r2=input() r1count=0 r2count=0 count=0 for i in range(n): if(r1[i]=="*"): r1count+=1 if(r2[i]=="*"): r2count+=1 if(r1count>0) and (r2count>0): count=1 r1count=0 r2count=0 i=0 while(i<n): if(r1[i]=="*"): r1count+=1...

0.585119

n,m = [int(i) for i in input().split()] l = [] for i in range(n): l.append(input().strip()) while len(l)%2 == 0: mirror = True for i in range(len(l)//2): if l[i] != l[len(l)-1-i]: mirror = False break if mirror: l = l[:len(l)//2] else: break print(len...

0.585042

class Solution: def maxEqualRowsAfterFlips(self, matrix: List[List[int]]) -> int: dict_ = {} for row in matrix: curr_tuple = tuple(row) dict_[curr_tuple] = 1 + dict_.get(curr_tuple,0) visited = set() max_same = 0 for row in matrix: curr_tup...

0.584682

import numpy as np h, w, m = map(int, input().split()) xy = [tuple(map(lambda x: int(x) - 1, input().split())) for _ in range(m)] row = np.zeros(h, np.int) col = np.zeros(w, np.int) for y, x in xy: row[y] += 1 col[x] += 1 max_cnt_y = max(row) max_cnt_x = max(col) max_pair = np.sum(row == max_cnt_y) * np.sum(col == m...

0.583738

def mi(): return list(map(int, input().split())) ''' 4 4 1010 1101 ''' n,m = mi() a = list(input()) b = list(input()) pb = [0]*m if b[0]=='1': pb[0] = 1 for i in range(1,m): if b[i]=='1': pb[i] = 1 pb[i]+=pb[i-1] ans = 0 if m>=n: for i in range(n): if a[i]=='1': ans+=(pb[m-n+i]*pow(2,n-i-1,998244353))%9...

0.582426

import sys import copy input = sys.stdin.readline n,m=list(map(int,input().split())) MAT=[list(map(int,input().split())) for i in range(n)] #n=15 #m=10000 #MAT=[list(range(j*j,j*j*(m+1),j*j)) for j in range(1,n+1)] if n==1: ANS=10**10 for i in range(1,m): if ANS>abs(MAT[0][i]-MAT[0][i-1]): ...

0.582373

class Solution: def maxScore(self, s: str) -> int: maxi=0 for i in range(1,len(s)): a=s[:i] b=s[i:] maxi=max(a.count('0')+b.count('1'),maxi) return maxi

0.580273

class Solution: def matrixScore(self, A: List[List[int]]) -> int: def bitFlip(row): for i,r in enumerate(row): row[i] = 1-r return row # [print(a) for a in A] #For any rows with a leading 0 flip them ...

0.579509

import math, re, itertools as it;prime = lambda n: len([i for i in range(2, int(math.sqrt(n) + 1)) if n % i == 0]) == 0;gcd = lambda a, b: gcd(b, a % b) if b else a;fact = lambda x: x * fact(x - 1) if x else 1;bino = lambda n, k: fact(n) / fact(k) / fact(n - k);fib11 = lambda n: 1 if n < 2 else fib11(n - 1) + fib11(n -...

0.578

n = int(input()) s = input() used = [0] * n for i in range(n): if s[i] == '0': used[i] = False else: used[i] = True a = [0] * n b = [0] * n for i in range(n): a[i], b[i] = list(map(int, input().split())) ans = 0 for time in range(500): for i in range(n): if time >= b[i] and (time - b[i]) % a[i] == ...

0.576424

from collections import Counter MV = 400020 a = [0] * MV for i in range(MV): a[i] = set() n ,m = list(map(int , input().split())) first = list(map(int , input().split())) second = list(map(int , input().split())) for fid, f in enumerate(first): for sid, s in enumerate(second): a[f+s].add(fid + MV) ...

0.573536

#THanks to easter eggs kata ;* def height(n, m): if n >= m: return (2 ** (min(n, m)) - 1) f = 1 res = 0 for i in range(n): f = f * (m - i) // (i + 1) res += f return res def solve(emulator): m = emulator.drops n = emulator.eggs h = 0 tryh = 0 while n and...

0.57222

import sys from math import * def minp(): return sys.stdin.readline().strip() def mint(): return int(minp()) def mints(): return map(int, minp().split()) n, m = mints() a = list(minp()) x = 0 t = 0 d = 1 for i in range(n-1): b = list(minp()) l = x r = x wall = 0 while True: t += 1 if b[x] == '.': bre...

0.572146

n, m, k = map(int, input().split()) s, t = input(), input() n += 1 m += 1 p = [i for i in range(n * m - n) if (i + 1) % n] r = p[::-1] d = [0] * n * m for i in p: if s[i % n] == t[i // n]: d[i] = d[i - n - 1] + 1 f = d[:] for y in range(k - 1): for i in p: f[i] = max(f[i], f[i - 1], f[i - n]) for i in...

0.571584

class Solution: def movesToChessboard(self, board): """ :type board: List[List[int]] :rtype: int """ rows = [1] for i in range(1, len(board)): num = self.get_num(board[0], board[i]) if 0 <= num <= 1: rows.append(num)...

0.570117

n,m = map(int,input().split()) s = [list(map(int,input().split())) for i in range(m)] p = list(map(int,input().split())) ans = 0 for i in range(2 ** n): t = ['off'] * n x = i j = 0 while x > 0: if x % 2 != 0: t[j] = 'on' x = x // 2 j += 1 flg = True for j in r...

0.569701

#ABC147　C　やってる途中 n=int(input()) l=[] for i in range(n): a=int(input()) l_=[] for j in range(a): xy=list(map(int,input().split())) l_.append(xy) l.append(l_) ans=0 for i in range(2**n): table=[0]*n flag=False for j in range(n): if (i>>j)&1: table[j]=1 for j in range(n): for k in l[j...

0.568937

def main(): from sys import stdin n, m = list(map(int, input().split())) n += 1 aa, pos, duo = [0] * n, [0] * n, [0] * n for i, a in enumerate(map(int, input().split()), 1): aa[i] = a pos[a] = i for s in stdin.read().splitlines(): x, y = list(map(int, s.split())) ...

0.567707

def infected_zeroes(s): m=0; l=0 for i,n in enumerate(s): if n==0: m=i if l==0 else max(m, (i-l+1)//2); l=i+1 return max(m,len(s)-l)

0.567182

from collections import Counter from itertools import product n,m,k = map(int,input().split()) a = list(map(int,input().split())) b = list(map(int,input().split())) a1 = [0] b1 = [0] for i in range(n): if a[i] == 1: a1[-1] += 1 elif a1[-1] != 0: a1.append(0) for i in range(m): if b[i] == 1: b1[-1] += ...

0.56623

from itertools import chain import numpy as np import networkx as nx h, w, *X = map(int, open(0).read().split()) C = np.array(X[:100], dtype=int).reshape((10, 10)) A = np.array(X[100:], dtype=int).reshape((h, w)) G = nx.DiGraph(C) d = {-1:0} for i in range(10): d[i] = nx.shortest_path_length(G, i, 1, weight='weig...

0.56575

""" Codeforces Contest 281 Div 2 Problem C Author : chaotic_iak Language: Python 3.3.4 """ def main(): n, = read() a = read() res = [(i,0) for i in a] m, = read() b = read() res.extend((i,1) for i in b) res.sort() mxa = 3*n mnb = 3*m cra = 3*n crb = 3*m for _,i in res:...

0.565691

from sys import stdin for _ in range(int(stdin.readline())): m, n = list(map(int, stdin.readline().split())) final = [] arr = [] val = 0 extra = 0 for j in range(m): ans = list(map(str, stdin.readline().split())) if ans.count('N') == n: val += 1 else: if val%2 == 0: arr.append(ans) extra += v...

0.56558

from fractions import gcd def count_black_cells(h, w): return (h + w) -2 + gcd(h,w)

0.565311

class Solution: def projectionArea(self, grid: List[List[int]]) -> int: ans=0 for i in range(len(grid)): row=0 col=0 for j in range(len(grid[i])): if(grid[i][j]): ans+=1 row=max(row,grid[i][j]) co...

0.564457

import collections import math input() a = list(map(int, input().split())) b = list(map(int, input().split())) counts = collections.defaultdict(int) arbitrary = 0 for ai, bi in zip(a, b): if ai == 0: if bi == 0: arbitrary += 1 else: if bi == 0: counts[(0, 0)] += 1 ...

0.564099

t = input() j = t[0] d, s = 0, int(j) for i in t[1: ]: if j != i: if d == 1: d, s = 0, s + 1 else: d = 1 j = i else: d = 1 print(s + (d and j == '1'))

0.563652

import sys input = sys.stdin.readline def search(i,j): L=[] c=0 while CHECK[i][j]==1<<30: L.append((i,j)) CHECK[i][j]=c if MAP2[i][j]=="U": i-=1 elif MAP2[i][j]=="D": i+=1 elif MAP2[i][j]=="R": j+=1 else: ...

0.563155

n, m = map(int, input().split()) a = set(map(int, input().split())) y = 2 ** n mk = [0] * (2 * y) cur = 0 for x in a: if mk[x]: continue mk[x] = 1 st = [x] while st: u = st.pop() if u < y: if not mk[y + u]: mk[y + u] = 1 st.append(y + u) ...

0.562636

n, m = list(map(int, input().split())) field = [] for i in range(n): field.append(input()) ans = 0 for i in range(n - 1): for j in range(m - 1): t = set() t.add(field[i][j]) t.add(field[i + 1][j + 1]) t.add(field[i + 1][j]) t.add(field[i][j + 1]) if t == set('f...

0.562007

import sys input = lambda: sys.stdin.readline().rstrip() N, M = list(map(int, input().split())) X = [] for _ in range(N): a, b = list(map(int, input().split())) X.append((a, b)) Y = [] for _ in range(M): c, d = list(map(int, input().split())) c, d = c, d+1 Y.append((c, d)) Y.sort(key = lambda x: -x...

0.55989

input() print(max(0, sum(len(s) + 1 for s in ''.join(input().split()).split('0') if s) - 1))

0.558775

def ziped(a): p = [] for i in a: x = int(i.split('-')[0]) y = i.split('-')[1] if len(p) > 0 and p[-1][1] == y: p[-1][0] += x else: p.append([x, y]) return p def solve(a, b , c): ans = 0 if len(b) == 1: for token in a: if c(token, b[0]): ans += token[0] - b[0][0] + 1 return ans if len(...

0.555118

import time n, m =map(int, input().split()) names={None:0} count={i:0 for i in range(1, m+1)} a=[0]*(n+1) for i in range(n): l=list(input().split()) if l[0]=='2': if l[1] not in names: names[l[1]]=len(names) a[i]=names[l[1]] count[a[i]]=count[a[i]]+1 # else a[i] stay...

0.554039

s =input() from collections import Counter count = Counter(s) c0 = count["0"] c1 = count["1"] print(min(c0,c1)*2)

0.553614

def main(): n, m = [int(i) for i in input().split()] d = [list(input()) for i in range(n)] a = [0] * m for i in range(m): for j in range(n): if d[j][i] == '*': a[i] += 1 x = y = 0 for i in range(1, m): if a[i] > a[i - 1]: x = max(x, a[i] - a[...

0.553396

class Solution: def swimInWater(self, grid): """ :type grid: List[List[int]] :rtype: int """ N = len(grid) if N == 1: return 0 eleD = {} for i in range(N): for j in range(N): eleD[grid[i][j]...

0.553286

n=int(input()) F = [int(input().replace(" ",""),2) for _ in range(n)] P = [list(map(int,input().split())) for _ in range(n)] total = -10**9 for i in range(1,2**10): pgain = 0 for f,p in zip(F,P): pgain += p[bin(f&i).count("1")] if total < pgain: total = pgain k = i print(total)

0.553139

n = int(input()) a = input().replace(' ', '') ans = 0 for i in range(n): for j in range(i, n): s = a[i:j + 1] ans = max(ans, s.count('0') + (a[:i] + a[j + 1:]).count('1')) print(ans)

0.552554

s, r = map(int, input().split()) v = [] for i in range(s): v += [list(map(int, input().split()))] ans = 0 p = [(0, 1), (0, -1), (1, 0), (-1, 0)] for i in range(s): if v[i].count(1) == 0: continue if v[i].count(1) == 1: ans += r - 1 else: a = v[i].index(1) b = v[i][::-1].index(1) ans += 2 * r - a - b - 2 ...

0.551881

class Solution: def findMaxConsecutiveOnes(self, nums): """ :type nums: List[int] :rtype: int """ if nums == []: return 0 count = 0 countMax =0 for ele in nums: if ele == 1: count += 1 ...

0.551658

# cook your dish here # cook your dish here for _ in range(int(input())): n,m=list(map(int,input().split())) atomlist = ['']*n for k in range(m): s=[] s.extend(input().split()[1:]) #print(s) for w in range(n): if str(w) in s: atomlist[w]+="1" else: atomlist[w]+="0" #print(atomlist) print(len...

0.551413

import math import sys from collections import Counter def solve(): n, m = [int(x) for x in input().split()] L, R = 1, n for line in sys.stdin: x, y = [int(x) for x in line.split()] x, y = min(x, y), max(x, y) L, R = max(L, x), min(R, y) return max(R - L, 0) print(solv...

0.55123

for _ in range(eval(input())): S1=input() m1=len(S1)/2 S2=input() m2=len(S2)/2 d1={} d2={} for i in range(len(S1)): c=S1[i] v=abs(m1-i) if c in d1: if v<d1[c][0]: d1[c]=[v,i] else: d1[c]=[v,i] for i in range(len(S2)...

0.551154

class Solution: def maxUncrossedLines(self, A, B): # Optimization #commons = set(A).intersection(set(B)) # or commons = set(A) & set(B) #A = [x for x in A if x in commons] #B = [x for x in B if x in commons] N1, N2 = len(A), len(B) dp = [[0 for _ in range(N2+1)] for ...

0.550593

n, m = map(int, input().split()) t = [int(input().split()[0]) for i in range(n)] p = [0] * (m + 1) for i, j in enumerate(t): p[j] = min(p[j], min(p[: j])) - 1 print(n + min(p))

0.550449

def codn1(s1,s2,p): c=0 ind=0 for i in range(len(s1)): if s1[i]!=s2[i]: c+=1 ind=i if c>1 or ind==len(s1)-1: return 0 if s1[ind]>s2[ind] and s1[ind] in s2[ind+1:]: p[0]=True if s1[ind]<s2[ind] and s2[ind] in s1[ind+1:]: p[1]=True return 1 def codn2(s1,s2): if len(s1)<len(s2): ...

0.55002

from itertools import permutations n = int(input()) p1, _, p2, _, p3, _, p4 = [input() for _ in range(n)], input(), [input() for _ in range(n)], input(), [input() for _ in range(n)], input(), [input() for _ in range(n)] def count(a,b,c,d): board = [a[i] + b[i] for i in range(n)] + [c[i] + d[i] for i in range(n)]...

0.549529

import sys def calc(b0, b1, q): if q == 0: return b0 ^ b1 if q == 1: return b0 | b1 if q == 2: return b0 & b1 n, m = list(map(int,sys.stdin.readline().split())) arr1 = {} opt = ['XOR', 'OR', 'AND'] arr2 = [] for j in range(n): a, b = list(map(str,sys.stdin.readline().split(" := "...

0.549482

#[Runtime: 452 ms, faster than 97.27%] Hash #O(MN) #1. traverse all cells and mark server as (x, y) #2. put each server (x, y) into serveral bucket named x1, x2, .., and y1, y2, .. # e.g. each xbucket[x1] maintains the number of servers on line x1 #3. enumerate all server (x', y'), and see if there is at least 2 server...

0.549446

class Solution: def findCircleNum(self, M): N = len(M) students = set() for i in range(N): students.add(i) num_grp = 0 while students: num_grp += 1 stack = [students.pop()] while stack and students: ...

0.548751

Now that Heidi has made sure her Zombie Contamination level checker works, it's time to strike! This time, the zombie lair is a strictly convex polygon on the lattice. Each vertex of the polygon occupies a point on the lattice. For each cell of the lattice, Heidi knows the level of Zombie Contamination – the number of ...

import math def lexComp(a, b): if a[0] != b[0]: return -1 if a[0] < b[0] else 1 if a[1] != b[1]: return -1 if a[1] < b[1] else 1 return 0 def turn(a, b, c): return (b[0] - a[0]) * (c[1] - b[1]) - (b[1] - a[1]) * (c[0] - b[0]) def dist2(a, b): return (a[0] - b[0]) ** 2 + (a[1] ...

0.802202

for _ in range(int(input())): n = int(input()) arr = [list(input()) for _ in range(n)] res = [] if arr[n-2][n-1] == arr[n-1][n-2]: if arr[0][1] == arr[n-2][n-1]: res.append((1, 2)) if arr[1][0] == arr[n-2][n-1]: res.append((2, 1)) elif arr[0][1] == arr[1][0]: ...

0.805004

import sys input=sys.stdin.buffer.readline t=1 for __ in range(t): a=[] n=int(input()) for i in range(n): b=list(map(int,input().split())) a.append(b) dr={} di={} for i in range(n): for j in range(n): dr[i+j]=dr.get(i+j,0)+a[i][j] di[i+n-j+1]=d...

0.715211

from sys import stdin for _ in range(int(stdin.readline())): m, n = list(map(int, stdin.readline().split())) final = [] arr = [] val = 0 extra = 0 for j in range(m): ans = list(map(str, stdin.readline().split())) if ans.count('N') == n: val += 1 else: if val%2 == 0: arr.append(ans) extra += v...

0.699964

import sys input = sys.stdin.readline testcases=int(input()) for testcase in range(testcases): n,m=list(map(int,input().split())) MAP=[input().strip() for i in range(n)] #print(MAP) STR=[[] for i in range(26)] for i in range(n): for j in range(m): if MAP[i][j]!=".": ...

0.673192

line = input() test = 0 while line != "0": test += 1 d = {'0':0,'1':0,'2':0,'3':0,'4':0,'5':0,'6':0,'7':0,'8':0,'9':0} a = list(map(int,line.split())) for i in range(min(a),max(a)+1): for c in str(i): d[c] += 1 pairs = list(d.items()) pairs.sort() print("Case %s:...

0.655733

(lambda R:(lambda N:(lambda n:any((lambda z,r:all((lambda p:all(p==k for k in n[j:j+i]))(n[j])for j in range(0,N,i))and all(all((lambda q:q==z or q==r)(j[k:k+i])for k in range(0,N,i))for j in n)and[print(i)])('0'*i,'1'*i)for i in range(N,0,-1)if N%i==0))([bin(int(R(),16))[2:].zfill(N)for i in range(N)]))(int(R())))(__i...

0.654312

def get(l,n): l1,l2 = [],[] i = 1 h1,m1 = l[0] while (i < len(l)): h2,m2 = l[i] if (h1>h2): if (m1 >= m2): l1 += [(0,10**20)] l2 += [(-1,-1)] else: d = (h1-h2)//(m2-m1) if (((h1-h2)%(m2-m1)) == 0): l1 += [(0,d-1)] l2 += [(d+1,10**20)] else: l1 += [(0,d)] l2 += [(d+1...

0.649535

from sys import stdin, stdout from math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log from collections import defaultdict as dd, deque from heapq import merge, heapify, heappop, heappush, nsmallest from bisect import bisect_left as bl, bisect_right as br, bisect mod = pow(10, 9) + 7 mod2 = 998244353 def inp(...

0.64831

from copy import deepcopy from collections import deque def check(p1, p2): if p1[0] == p2[0] or p1[1] == p2[1] or abs(p1[0] - p2[0]) == abs(p1[1] - p2[1]): return True return False def passAll(p1, points): for x, y in enumerate(points): if check(p1, (x, y)): return Fal...

0.643974

for _ in range(int(input())): n=int(input()) a=[] l=0 for i in range(n): a.append(list(map(int,input().split()))) for i in range(n-1,0,-1): r=a[i][i-1]+1 if a[i][i]!=r: l+=1 n=i+1 for j in range(n): for k in range(j,n): a[j][k],a[k][j]=a[k][j],a[j][k] print(l)

0.642536

import itertools class Nonogram: poss = {(1,1,1): set([(1,0,1,0,1)]), (1,1): set([(0,0,1,0,1),(0,1,0,1,0),(1,0,1,0,0),(0,1,0,0,1),(1,0,0,1,0),(1,0,0,0,1)]), (1,2): set([(1,0,1,1,0),(1,0,0,1,1),(0,1,0,1,1)]), (1,3): set([(1,0,1,1,1)]), (2,1): set([(1,1,0,1,0),(...

0.642004

from sys import stdout n = int(input()) class Person: num = n - 1 def __init__(self, rel): self.relationship = int(rel, 2) def __getitem__(self, k): return (self.relationship >> Person.num - k) & 1 rel = [Person(input()) for _ in range(n)] dp = [[0] * n for _ in range(1 << n)] for ...

0.641595

from sys import stdin def main(): #入力 readline=stdin.readline h,w=map(int,readline().split()) a=[list(map(int,readline().split())) for _ in range(h)] i=0 j=0 n=0 ans=[] while True: if i%2==0: if j<w-1: if a[i][j]%2==1: n+=1 ...

0.640892

for _ in range(int(input())): n=int(input()) a=[] b=[] for i in range(4*n-1): c,d=list(map(int,input().split())) a.append(c) b.append(d) c1=0 c2=0 for i in a: c1^=i for i in b: c2^=i print(c1,c2)

0.640668

k=str(input()) l=len(k) paths=[] for i in range(l): paths.append([1]*i+[int(k[i])]+[10]*(l-i-1)) lens = [sum(p) for p in paths] n = sum(lens)+2 m = ['']*n m[0] = 'N'*2 for i in range(len(paths)): m[0] += 'Y'*paths[i][0]+'N'*(lens[i]-paths[i][0]) m[1] = 'N' for i in range(len(paths)): m[1] += 'N'*(lens[i]-paths[i][-1...

0.638952

# cook your dish here n,m=map(int,input().split()) L=[] for i in range(n): s=input() L.append(s) cost=[] h2=[0]*(m+1) cost.append(h2) for i in range(n): h=[0] for j in range(m): if(L[i][j]=='0' and (i+j)%2!=0): h.append(1) elif(L[i][j]=='1' and (i+j)%2==0): h.app...

0.637269

# cook your dish here for a in range(int(input())): N,M=map(int,input().split()) b=[] for o in range(N): b.append(input()) c=[] for d in b: f=[] for e in range(len(d)): if d[e]=='1': f.append(e) c.append(f) i=[] for g in range(len(c)): for h in range(len...

0.635836

n=int(input()) graph=[{},{},{}] for i in range(n): for j in range(n): graph[0][(i,j)]=[(k,j) for k in range(n)]+[(i,k) for k in range(n)] graph[0][(i,j)].remove((i,j)) graph[0][(i,j)].remove((i,j)) graph[1][(i,j)]=[] for k in range(n): for l in range(n): ...

0.635473

#!/usr/bin/env python3 from collections import defaultdict DEBUG = False def main(): if DEBUG: test() n = int(input()) paths = cycles(n) print(len(paths)) for p in paths: print('%d %s' % (len(p), ' '.join([str(v) for v in p]))) def cycles(n): """Builds a set of cycles fo...

0.635471

n = int(input()) a = [] for i in range(2*n - 1): a.append([int(c) for c in input().split()]) c = [] for i in range(len(a)): for j in range(len(a[i])): c.append([a[i][j], i+1, j]) c.sort(reverse=True) used = set() res = [0]*2*n for cc in c: if not cc[1] in used and not cc[2] in used: res[...

0.633145

import sys input=sys.stdin.readline #t=1 t=int(input()) for _ in range(t): n=int(input()) s=input().rstrip() s=[s[-i-1] for i in range(n)] ans=[] zero=[] one=[] res=[-1]*n pos=0 while s: b=s.pop() if b=="0": if not one: new=1 ...

0.632071

import math import copy try: import psyco psyco.full() except ImportError: pass def isSharp(ang): return ang > math.pi/4 + 0.00001 def unitVector(p2, p1): d0 = p2[0] - p1[0] d1 = p2[1] - p1[1] d = math.sqrt(d0*d0 + d1*d1) if d != 0: return [d0/d, d1/d] return [0, 0] def compVectors(P): V = [] for i i...

0.624547

t= int(input()) for _ in range(t): n = int(input()) ar = [] y = [] for i in range(n): ar.append( list(map(int,input().split())) ) y.append(ar[-1][1]) ar[-1].append(i) y.sort() mny = y[0] mxy = y[-1] ar.sort() ssx,ssy,ssi = ar[0] bbx,bby,bbi = ar[-1] sbx,sby,sbi = ar[0] bsx,bsy,bsi = ar[-1] for ...

0.621604

import heapq import sys from collections import defaultdict, Counter from functools import reduce n, m = list(map(int, input().split())) arr = [] for _ in range(n): arr.append(list(map(int, input().split()))) rows = [] for i in range(n): row = set() for j in range(m): row.add(arr[i][j]) rows....

0.621595

import sys input = sys.stdin.readline t=int(input()) for testcases in range(t): n=int(input()) LIST=[input().strip() for i in range(n)] SET=set() ANS=0 CHANGE=set() for i in range(n): if LIST[i] in SET: ANS+=1 CHANGE.add(i) else: SET.add(LIS...

0.620949

n = int(input()) p = [list(map(int, input().split())) for i in range(n)] t = [[0] * n for i in range(n)] for i in range(n): t[i][i], p[i][i] = p[i][i], 0 for j in range(i + 1, n): t[j][i] = t[i][j] = d = (p[i][j] + p[j][i]) / 2 p[i][j] -= d p[j][i] -= d for i in t: print(' '.join(map(str...

0.619803

n=int(input()) a=[] for i in range(n): a.append(list(map(int,input().split()))) ans = [0]*n for i in range(n): for j in range(n): if j!=i: ans[i] |= a[i][j] print(ans[i],end = ' ')

0.61909

n = int(input()) h = [False] * n v = [False] * n result = [ ] for i in range(n * n): a, b = list(map(int, input().split())) a -= 1 b -= 1 if not h[a] and not v[b]: h[a] = v[b] = True result.append(i + 1) print(' '.join(map(str, result)))

0.618953

""" #this code is a precomputation part. #it takes about 2 hours. class Graph: def __init__(self,n): self.edge=[[0 for j in xrange(n)] for i in xrange(n)] self.n=n def addedge(self,i,j,m=1): assert i!=j and 0<=i<self.n and 0<=j<self.n self.edge[i][j]+=m self.edge[j][i]+=m def deledge(self,i...

0.617429

import random t=int(input()) for testCase in range(t): n=int(input()) array1=[] array2=[] array=[] for i in range(n) : array1.append(list(map(int,input().split()))) for i in range(n) : array2.append(list(map(int,input().split()))) for i in range(n) : array.append(i) # print array2," ",array1 for i in ...

0.617395

from collections import deque class Solution: def isPrintable(self, targetGrid: List[List[int]]) -> bool: grids = targetGrid num_to_range = dict() for i, row in enumerate(targetGrid): for j, val in enumerate(row): if val not in num_to_range: #...

0.615936

buck = [[0, 0] for i in range(2201)] m = int(input()) for i in range(m): a = int(input()) ok = True br = 0 for j in range(2200, -1, -1): if a & (1 << j): if(buck[j][0]): a ^= buck[j][0] br ^= buck[j][1] else: ok = False ...

0.614368

""" Author : Arif Ahmad Date : Algo : Difficulty : """ from sys import stdin, stdout from collections import deque g = None # contains the actual graph h = None # h[x][y] represents the component in which cell (x,y) belongs r = None c = None visited = None total = None comp = None dx = [-1, 0, 0, 1] dy =...

0.613883

n,m=map(int,input().split()) g=[[*input()] for _ in range(n)] c=[[0 for _ in range(m)] for _ in range(n)] for i in range(n): v=0 for j in range(m): v=(v+1)*(g[i][j]=='*') c[i][j]=v v=0 for j in range(m-1,-1,-1): v=(v+1)*(g[i][j]=='*') c[i][j]=min(c[i][j],v) for j in range(m): v=0 for i in range(n): v=(v...

0.612846

n = int(input()) t = [1] + [0] * n b, a = d = [], [] h, s = [], [] for i in range(n): f, k = input().split() d[int(k)].append(f) m = len(a) for i in a: if i.isdigit() and i[0] != '0': j = int(i) if 0 < j <= m: t[j] = 1 elif m < j <= n: t[j] = -1 else...

0.611129

z = int(input()) i = 0 while i < z: n = int(input()) p = int(n**(0.5)) if p*(p+1) < n: p += 1 # print("P", p) x, y = 0, 0 q = 0 flag = True if p*(p+1) == n: # print("Even steps, nice") q = p else: # remaining steps q = p-1 flag = False if q%2 : # od...

0.608931

S = input() T = [[0]*10 for i in range(10)] for i in range(1,len(S)): T[int(S[i-1])][int(S[i])]+=1 C = [[[[0 for i in range(10)] for j in range(10)] for k in range(10)] for l in range(10)] for i in range(10): for j in range(10): for k in range(10): for l in range(10): min...

0.60659

import sys blocks = {} for i in range(1, 10): blocks[i] = [(0, 0)] for i in range(2, 10, 2): for j in range(1, i / 2 + 1): blocks[i].append((j, 0)) blocks[i + 1].append((0, j)) # print blocks blocks[10] = [(0, 0), (0, 1), (1, 0), (1, 1)] blocks[11] = [(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1...

0.604493

0.603817

import sys,os,io,time,copy,math,queue,bisect from collections import deque from functools import lru_cache if os.path.exists('input.txt'): sys.stdin = open('input.txt', 'r') sys.stdout = open('output.txt', 'w') sys.setrecursionlimit(100000000) def main(): n,m=map(int,input().split()) mat=[] for _ in range(n): ...

0.602331

import sys input = sys.stdin.readline def main(): n, m = map(int, input().split()) alst = [list(map(int, input().split())) for _ in range(n)] blst = [[0 for _ in range(m)] for _ in range(n)] for i in range(n): for j in range(m): if (i + j) % 2 == alst[i][j] % 2: blst...

0.601709

def issafe(r,c,r1,c1,graph): if (graph[r][c] and graph[r1][c1]): return True return False t=int(input()) for mmmmmm in range(t): n,m=map(int,input().split()) x,y=map(int,input().split()) graph=[[False]*(m+2) for _ in range(n+2)] cost_graph=[[[-1,-1,-1] for __ i...

0.600985

import sys input = sys.stdin.readline def search(i,j): L=[] c=0 while CHECK[i][j]==1<<30: L.append((i,j)) CHECK[i][j]=c if MAP2[i][j]=="U": i-=1 elif MAP2[i][j]=="D": i+=1 elif MAP2[i][j]=="R": j+=1 else: ...

0.599485

t=int(input()) for t in range(t): n=int(input()) for i in range(0,n): for j in range(0,n): if i%2==0: if j%2==0: print(0,end="") else: print(1,end="") else: if j%2==0: prin...

0.598846

# 愚直 h, w = map(int, input().split()) table = [list(input()) for _ in range(h)] for i in range(h): for j in range(w): if table[i][j] == ".": num = 0 for y in [-1, 0, 1]: for x in [-1, 0, 1]: if 0 <= i + y < h and 0 <= j + x < w: ...

0.597766

#!/usr/bin/env python3 # Copied solution import collections import sys import traceback class Input(object): def __init__(self): self.fh = sys.stdin def next_line(self): while True: line = sys.stdin.readline() if line == '\n': continue retur...

0.597455

import collections class Tower: def __init__(self): indicesOfAlienPath = [] shots = 0 class GameStats: def __init__(self): alienPath = collections.deque() towers = [] waves = collections.deque() DirEOL = 0 DirLeft = 1 DirRight = 2 DirUp = 3 DirDown = 4 def tower_defe...

0.596608

class Solution: def swimInWater(self, grid): """ :type grid: List[List[int]] :rtype: int """ N = len(grid) if N == 1: return 0 eleD = {} for i in range(N): for j in range(N): eleD[grid[i][j]...

0.594712

import random n = int(input()) v = [] a = [] for i in range(n): a.append(i) for _ in range(0, n): x, y = list(map(int, input().split())) v.append([x, y, x*x+y*y]) while 1>0: x = 0 y = 0 ans = [0]*n random.shuffle(a) for i in range(n): if (x+v[a[i]][0])**2+(y+v[a[i]][1])**2 <= ...

0.592992

n = int(input()) arr = [] for i in range(n): l,r = map(int, input().split()) arr.append([l,r]) lts = [] for i in range(n): if arr[i][0] == 0: l = i j = i while arr[j][1] != 0: j = arr[j][1] - 1 r = j lts.append([l,r]) for i in range(1, len(lts)): ...

0.591095

BLACK = 0 WHITE = 1 # N, E, S, W CARDINALS = [(-1, 0), (0, 1), (1, 0), (0, -1)] def ant(grid, column, row, n, direction=0): r, c, d = row, column, direction for _ in range(n): # Handle direction change and current cell colour flip if grid[r][c] == BLACK: grid[r][c] = WHITE ...

0.590503

from collections import defaultdict def count(chessBoard): # Initialize: board = chessBoard.copy() tally = defaultdict(int) # Compute Longest square ending in bottom right corner of each element and tally up: for i, row in enumerate(board): for j, element in enumerate(row): # E...

0.590375

def main(): n = int(input()) teams = [input().split() for _ in range(n)] ans = [list((0, 0)) for _ in range(n)] home = dict() for i in range(n): home[teams[i][0]] = home.get(teams[i][0], 0) + 1 for i in range(n): ans[i][0] = n - 1 + home.get(teams[i][1], 0) ans[i][1] = ...

0.587462

from collections import deque import sys def input(): return sys.stdin.readline()[:-1] def main(): T = int(input()) for i in range(T): N = int(input()) e_list = [[] for i in range(N)] for i in range(N-1): a,b = list(map(int,input().split())) a,b = a-1,b-1 ...

0.585479

n, m = list(map(int, input().split())) color_pairs = [list(map(int, input().split())) for i in range(m)] towers = [[(i, i)] for i in range(1, n + 1)] last_coord = n + 1 for c1, c2 in color_pairs: towers[c1 - 1].append((last_coord, c1)) towers[c2 - 1].append((last_coord, c2)) last_coord += 1 for i in range(l...

0.582678

def flatten(grid): k = len(grid[0]) // 2 seek = list(range(2*k + 2)) + list(range(2*k + 2, 4*k + 2))[::-1] return [seek[v] for v in grid[0] + grid[1][::-1] if v] def solve(grid): grid = list(map(list, grid)) k = len(grid[0]) // 2 flat = flatten(grid) m = { 'L': 'l'*2*k + 'u' + 'r'*...

0.58226

for _ in range(int(input())): n = int(input()) mass = [] zo = 0 oz = 0 zz = 0 oo = 0 ozs = [] zos = [] ozss = set() zoss = set() for j in range(n): k = input() mass.append(k) if k[0] == '0' and k[-1] == '1': zoss.add(k) zos.appe...

0.581979

class Solution: def generateMatrix(self, n): """ :type n: int :rtype: List[List[int]] """ if n<1: return [] left=0 right=n-1 up=0 bottom=n-1 self.matrix=[[0 for i in range(n)] for j in range(n)] count=1 ...

0.581657

#!/usr/bin/env python3 # 598D_Igor.py - Codeforces.com/problemset/problem/598/D by Sergey 2015 import unittest import sys from collections import deque ############################################################################### # Igor Class (Main Program) ##########################################################...

0.581638

from collections import Counter from itertools import accumulate from math import sqrt from operator import itemgetter import sys n = int(input()) cnt = Counter(map(int, input().split())) nums, counts = zip(*sorted(cnt.items(), key=itemgetter(1))) acc = [0] + list(accumulate(counts)) area = 1 h, w = 1, 1 i = len(cou...

0.581179

def get(cells, i, j): return cells[i][j] if i > -1 and j > -1 and i < len(cells) and j < len(cells[0]) else 0 def num_neighbors(cells, i, j): return (get(cells, i, j+1) + get(cells, i, j-1) + get(cells, i+1, j) + get(cells, i-1, j) + get(cells, i-1, j-1) + get(cells, i-1, j+1) + get(cells, i+1,...

0.58079

# CHNGSS.py import sys from random import * n,m,c = list(map(int,input().split())) arr = [[1]*m for i in range(n)]; saved = 0; for i in range(n): for j in range(m): print(1,(i+1),(i+1),(j+1),(j+1),1,25) sys.stdout.flush() a = int(input()) if a == 1 : saved += 1; arr[i][j] = randint(1,25); else: ar...

0.57979

for _ in range(int(input())): n, k = map(int, input().split()) mat = [[0] * n for _ in range(n)] for i in range(n): b = False for j in range(n): if i*n+j == k: b = True break mat[(i+j)%n][j] = 1 if b: break if k%...

0.578795

# cook your dish here import sys import math def main(grid): ans=0 for i in range(len(grid)): for j in range(len(grid[0])): first_point=grid[i][j] for k in range(j+1,len(grid[0])): second_point=grid[i][k] if first_point==second_point: ...

0.57735

for _ in range(int(input())): n=int(input()) s=input() a="" b="" flag=1 for i in s: if flag: if i=="2": a+="1" b+="1" elif i=="1": a+="1" b+="0" flag=0 else: ...

0.577031

n, m = map(int, input().split()) sum = n ** 2 colx = n coly = n usedx = [False] * n usedy = [False] * n for i in range(m): x, y = map(int, input().split()) x -= 1 y -= 1 if not usedx[x]: sum -= coly usedx[x] = True colx -= 1 if not usedy[y]: sum -= colx usedy[...

0.576573

t=int(input()) for _ in range(t): n,m=map(int,input().split()) d={} e={} l=[] for i in range(n): d[i]=0 for i in range(m): e[i]=0 for i in range(n): l.append(input()) for i in range(n): for j in range(m): if l[i][j]=='1': d[i]=1 e[j]=1 #ans=[] if sum(d.values())+sum(e.values())==0: k=[-1]...

0.57629

def main(): import sys input = sys.stdin.readline def solve(): n = int(input()) maxx = 10**5 minx = -10**5 maxy = 10**5 miny = -10**5 for _ in range(n): x, y, f1, f2, f3, f4 = map(int, input().split()) if not f1: ...

0.576068

h, w = list(map(int, input().split())) field = [[c == "." for c in input()] + [False] for i in range(h)] field.append([False] * (w + 1)) subVerts = [[0] * (w + 1) for i in range(h + 1)] subHoriz = [[0] * (w + 1) for i in range(h + 1)] for y in range(h): subVerts[y][0] = 0 subHoriz[y][0] = 0 for x in range(w)...

0.576009

try: t = int(input()) while(t > 0): t -= 1 n,m = list(map(int,input().split())) a = [list(map(int,input().split())) for _ in range(n)] dp = [[0 for _ in range(m)] for _ in range(n)] ans = [['0' for _ in range(m)] for _ in range(n)] for i in range(n): ...

0.575657

import sys input = lambda:sys.stdin.readline().rstrip() h,w=map(int,input().split()) d=w+2 b=[0]*(w+2) for i in range(h): b+=([0]+[int(j=="X") for j in input()]+[0]) b+=([0]*(w+2)) co=sum(b) t=10**10 for i in range(1,h+1): f=0 for j in range(w+2): f+=b[i*d+j] if b[i*d+j]==0 and f: t=min(t,(f-1)//2)...

0.573677

h, w, n = map(int,input().split()) xy_pos = dict() for i in range(n): a, b = map(int, input().split()) for k in range(-2,1): for l in range(-2,1): x = (a-1) + k y = (b-1) + l if (0 <= x <=(h-1)-2) and (0 <= y <=(w-1)-2): xy = str(x) + "x" + str(y) ...

0.571027

import sys import math n = int(input()) x = [0]*n y = [0]*n for i in range(n): x[i], y[i] = list(map(int, input().split())) sx = sum(x) sy = sum(y) for i in range(n): x[i] = n * x[i] - sx y[i] = n * y[i] - sy m = int(input()) d = [0]*n e = [0]*n HD = 0 def check(a, b): nonlocal HD HE = ...

0.570765

corr = lambda x, y: 1 <= x <= n and 1 <= y <= m T = int(input()) a = [] while T: a.append(T % 6) T //= 6 L = len(a) n = m = L * 2 + 2 ans = [(1, 2, 2, 2), (2, 1, 2, 2)] f = [[1] * 9 for i in range(7)] f[1][2] = f[2][2] = f[2][6] = f[3][5] = 0 f[4][5] = f[4][6] = f[5][2] = f[5][5] = f[5][6] = 0 p = [0] * 9 p[1]...

0.569058

class Solution: def totalNQueens(self, n): def dfs(lst, xy_dif, xy_sum): p=len(lst) if p==n: res.append(lst) for q in range(n): if (q not in lst) and (p-q not in xy_dif) and (p+q not in xy_sum): dfs(lst+[q], xy_dif+[p-q], xy_sum ...

0.56867

n = int(input()) ans = 'YES\n' for i in range(n): x1, y1, x2, y2 = map(int, input().split()) res = (x1 & 1) * 2 + (y1 & 1) + 1 ans += str(res) + '\n' print(ans)

0.568353

h, w = map(int, input().split()) n = int(input()) A = tuple(map(int, input().split())) M = [[0] * w for _ in range(h)] ii = 0 ij = 0 for i, a in enumerate(A): i += 1 for _ in range(a): M[ij][ii] = i if ij%2 == 0: ii += 1 if ii == w: ij += 1 ...

0.567953

n = int(input()) for _ in range(n): s = input() l,r,u,d = [s.count(i) for i in 'LRUD'] lr = min(l, r) ud = min(u, d) res = "" if lr == 0 and ud == 0: res = "" elif lr == 0: res = "UD" elif ud == 0: res = 'LR' else: res = 'R' * lr + 'U' * ud + 'L' * lr ...

0.567868

import sys def solve(): n = int(input()) partner = [0]*(2*n) pacani = [] for line in sys.stdin: pacan, telka = [int(x) - 1 for x in line.split()] partner[pacan] = telka partner[telka] = pacan pacani.append(pacan) khavka = [None]*(2*n) for i in range(2*n): ...

0.56681

3 def readln(): return tuple(map(int, input().split())) n, = readln() ans = [] for x, y in sorted([readln() for _ in range(n)], key=lambda x: abs(x[0]) + abs(x[1])): if x > 0: ans.append('1 %d R' % x) if x < 0: ans.append('1 %d L' % -x) if y > 0: ans.append('1 %d U' % y) if y <...

0.564907

n, m, p = list(map(int, input().split())) speeds = list(map(int, input().split())) field = [] for _ in range(n): s = list(input().strip()) field.append(s) def neighbours(i, j): for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]: if 0 <= i+di < n and 0 <= j+dj < m: yield i+di, j+dj def ...

0.564565

import random def sign(i): if i>0: return 1 elif i<=0: return 0 bleh = [] for _ in range(int(input())): p = list(map(int,input().rstrip().split())) max_rows = len(p) if all([x==0 for x in p]): print(1) continue if max_rows <= 1: bleh.append(max_rows) ...

0.562013

for i in range(int(input())): n,k=map(int,input().split()) m=[] for j in range(n): l=list(input()) m.append(l) a=0 for k in range(k): b=0 for p in range(n): if m[p][k]=='1': b+=1 if b>1: a+=((b*(b-1))//2) print(a)

0.560515

#!/usr/bin/env python3 OUT = (1, 0, 2, 3) try: while True: n, m = map(int, input().split()) bus = [[None] * 4 for i in range(n)] cur = 1 for row in range(n << 1): if row >= n: i = row - n k = b = 1 else: i = ro...

0.560475

import sys q = int(sys.stdin.readline().strip()) for t in range(0, q): n, m = list(map(int, sys.stdin.readline().strip().split())) L = [] R = [0] * n C = [0] * m for i in range (0, n): L.append(sys.stdin.readline().strip()) for j in range (0, m): if L[i][j] != "*": ...

0.560201

import sys def Is_arth(L): D=L[1]-L[0] p=L[1] for i in range(2,len(L)): if(L[i]-p!=D): return False p=L[i] return True n=int(sys.stdin.readline()) A=list(map(int,sys.stdin.readline().split())) T=[False]*(10**5+1) Z=[] for i in range(10**5+1): Z.append([]) Taken=[] fo...

0.559979

def main(): for _ in range(int(input())): rows,column = map(int,input().split()) arr = [] for i in range(rows): arr.append(list(input())) string = input() last = string[-1] operation = Find(string,last) for i in string[0]+operation: if i == "L": arr = Left(arr) if i == "R": arr = Right(a...

0.559744

t=int(input()) for _ in range(t): n,m=[int(x) for x in input().split()] mat=[] ans=[] for i in range(n+2): l=[] p=[] for j in range(m+2): l.append(0) p.append(1000000000) mat.append(l) ans.append(p) y=int(input()) for i in range(y): a,b=[int(x) for x in input().split()] mat[a][b]=1 ans[a][b]...

0.55968

def x(n): d = [[0] * n for i in range (n)] for i in range(n): d[i][i] = 1 d[i][-i-1] = 1 return d

0.55948

t = int(input()) for _ in range(t): n = int(input()) for i in range(n): for j in range(n): if i>=j: print(int((i+1)*(i+2)/2)-j,end='') print()

0.559222

def possible(a): ans = set() s = set() lmax = 0 for i in range(len(a)): lmax = max(lmax, a[i]) s.add(a[i]) if lmax == i + 1 and len(s) == i + 1: ans.add(i + 1) return ans t = int(input()) for case_num in range(t): n = int(input()) a = list(map(int, input...

0.559043

def main(): while True: [n, m] = [int(i) for i in input().split()] if n == m and n == 0: break cache = {} for i in range(n): dna = input().rstrip('\n') if dna in cache: ...

0.558483

for nt in range(int(input())): n=int(input()) l=list(map(int,input().split())) s=sum(l) e=l[0] for i in range(1,n): e=e^l[i] if s==2*e: print(0) print () else: print(2) print(e,s+e)

0.558435

# cook your dish here from collections import deque primes = {2,3,5,7,11,13,17} 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)] x = [1,2,3,4,5,6,7,8,9] avail = {tuple(x):0} q = deque([x]) while q: curr = q.popleft(); for e in edges: if curr[e[0]]+curr[e[1]] in...

0.558354

n = int(input()) a = [tuple(map(int, input().split())) for _ in range(n)] s = {a[q]: q+1 for q in range(n)} a.sort() q, q1 = 0, 1 d, d1, d2 = [[[a[0]]]], [], [] while q1 < n: while q1 < n and a[q][0] == a[q1][0]: while q1 < n and a[q][1] == a[q1][1]: d[-1][-1].append(a[q1]) q1 += 1 ...

0.558243

from math import sqrt def get_distance(x1,y1,x2,y2): return sqrt((x1-x2)**2 + (y1-y2)**2) T = int(input()) ans = [] for _ in range(T): blank = input() N = int(input()) C = [[] for i in range(10**4+1)] for i in range(N): x,y = [int(i) for i in input().split()] C[x].append(y) ...

0.558079

from sys import stdin input = stdin.readline tests = int(input()) for test in range(tests): n, m = list(map(int, input().split())) a = [[0] * m for _ in range(n)] r = [[int(i) for i in input().split()] for _ in range(n)] c = [[int(i) for i in input().split()] for _ in range(m)] z = [[-1, -1] for _ ...

0.557953

# cook your dish here p=int(input()) for z in range(p): n=int(input()) a=[] for i in range(8): a.append(0) for i in range(n): x,y=list(map(int,input().split())) if x<=8 and y>a[x-1]: a[x-1]=y print(sum(a))

0.557131

import sys n = int(input()) s = [input() for i in range(n)] a = [[1] * (2 * n) for i in range(2 * n)] for i in range(n): for j in range(n): if s[i][j] != 'o': continue for x in range(n): for y in range(n): if s[x][y] == '.': a[n + x - i][n...

0.556915

n=int(input()) a=list(map(int,input().split())) c=[0]*1001 for i in range (len(a)): c[a[i]]+=1 sym=0 sin=0 for i in range (1001): sym+=(c[i]//4) if(c[i]%2==1): sin+=1 if(n%2==0 and sym==((n*n)//4)): mat= [([0]*(n//2)) for i in range (n//2)] ar=[] for i in range (1001): while(c[i]>=4): ar.append(i) ...

0.556848

Bob watches TV every day. He always sets the volume of his TV to $b$. However, today he is angry to find out someone has changed the volume to $a$. Of course, Bob has a remote control that can change the volume. There are six buttons ($-5, -2, -1, +1, +2, +5$) on the control, which in one press can either increase or ...

import math from decimal import Decimal import heapq from collections import deque def na(): n = int(input()) b = [int(x) for x in input().split()] return n,b def nab(): n = int(input()) b = [int(x) for x in input().split()] c = [int(x) for x in input().split()] return n,b,c def dv(): n, m = list(map(in...

0.751085

#!/usr/bin/env python F = [1,1] def fibo(): for i in range(500): F.append(F[-2] + F[-1]) def main(): fibo() #print len(str(F[-1])) #print len(str(10**100)) while True: try: A, B = list(map(int, input().strip().split()[:2])) if A == 0 and B == 0: break print(len([x for x in F if x >= A and x <= B])) ...

0.713978

for _ in range(int(input())): a,b=map(int,input().split()) print((abs(a-b)+9)//10)

0.677229

for _ in range(int(input())): a, b = list(map(int, input().split())) d = abs(a - b) ans = 0 while d > 0 or (-d) % 2 or (-d) // 2 > ans: ans += 1 d = abs(d) - ans print(ans)

0.659314

T=int(input()) answer=[] for t in range(T): A,B=input().split() A=int(A) B=int(B) x=0 if(A>B): r=B B=A A=r while(A>0 and B>0): r=B//A x+=r r*=A B=B-r if(A>B): r=B B=A A=r answer.append(x) for...

0.644029

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline # this math tutorial is boring classy=set() for i in range(19): for j in range(i): for k in range(j): for a in range(10): # a=0 for good measure for b in range(10): for c in range(10): ...

0.62419

for _ in range(int(input())): a, b = list(map(int, input().split())) if a == b: print(0) else: if a < b: if (b - a) % 2: print(1) else: print(2) else: if (b - a) % 2 == 0: print(1) else: ...

0.617605

t=eval(input()) for _ in range(t): i,j=list(map(int,input().split())) bi=bin(i)[2:] bj=bin(j)[2:] k=0 while k<(min(len(bi),len(bj))): if bi[k]!=bj[k]: break else: k+=1 print(len(bi)-k+len(bj)-k)

0.608954

t = int(input()) while(t>0): t-=1; n,l,r = list(map(int,input().split())); a = bin(l)[2:]; b = bin(r)[2:]; # find matching z = 0; l = min(len(a),len(b)); for i in range(l): if a[i]==b[i]: z+=1; else: break; #find base string a = a[z:] b = b[z:] if(len(a)==0 and len(b)==0): print(n); else : m...

0.608838

#Note that it's python3 Code. Here, we are using input() instead of raw_input(). #You can check on your local machine the version of python by typing "python --version" in the terminal. #Read the number of test cases. T = int(input()) for tc in range(T): # Read integers a and b. (a, b) = list(map(int, input().split(...

0.603232

# cook your dish here t=int(input()) for i in range(t): v,w=list(map(int,input().strip().split(" "))) if v==w: print(v+1) elif v<w: print(v+1) else: print(w+1) #s="a" #s=s*v #l=list(s) #print(l) ct=0 #for i in range(w):

0.602342

# cook your dish here t=int(input()) while t>0: a=input().split(":") a1=int(a[0]) a2=int(a[1]) b1=a1%12 if a2%5!=0: b2=(a2//5)*5+5 else: b2=a2 c1=b1*30 extra=0.5*b2 c1+=extra c1%=360 d1=(b2//5)*30 d1%=360 if c1>d1: ans1=c1-d1 ans2=360-ans1 else: ans1=d1-c1 ans2=360-ans1 ans=min(a...

0.586942

q = int(input()) for _ in range(q): a, b = list(map(int, input().split())) print((b - a % b) % b)

0.577473

def gcd(a,b): if b==0:return a else:return gcd(b,a%b) def lcm(a,b): m=a*b g=gcd(a,b) return int(m/g) for _ in range(int(input())): x,y=[int(x) for x in input().split()] l=lcm(x,y) s=int(l/x) t=int(l/y) print(s+t-2)

0.576341

t = int(input()) for _ in range(t): a, b = list(map(int, input().split())) print(min((a+b)//3,a,b))

0.57563

t=int(input()) for i in range(t): ans=0 x,y=list(map(int,input().split())) if y>x: if (y-x)%4==0:ans=3 elif (y-x)%2==0: ans=2 else: ans=1 if y<x: if (y-x)%2==0:ans=1 else: ans=2 print(ans)

0.574971

def s(k): if k % 2 == 0: return k // 2 else: return - (k + 1) // 2 for i in range(int(input())): l, r = list(map(int, input().split())) print(s(r) - s(l - 1))

0.5604

# cook your dish here from sys import stdin from math import sqrt,ceil,log10 def get_sum(a,b,digits): sum=((b+a)*(b-a+1))//2 return sum*digits def solve(): mod=10**9+7 thehighlimiter={i: 10 ** i - 1 for i in range(12)} thelowlimiter={i: 10**i for i in range(12)} for _ in range(int(input())): ...

0.559482

c=0 for i in range (int(input ())): a, b=map(int, input().split()) c+=abs(a-b)+1 print(c%((10**9) +7))

0.559275

t=int(input()) for nt in range(t): a,b,c=map(int,input().split()) print (max(0,abs(a-b)+abs(b-c)+abs(a-c)-4))

0.556341

# cook your dish here t= int(input()) for i in range(t): cnt=0 n=int(input()) while(n>=100): n-=100 cnt+=1 while(n>=50): n-=50 cnt+=1 while(n>=10): n-=10 cnt+=1 while(n>=5): n-=5 cnt+=1 while(n>=2): n-=2 cnt+=1 ...

0.554752

def dlog(x, n): bigMod = 5 ** n ans = [None, 0, 1, 3, 2][x % 5] val = 2 ** ans % bigMod mod, phi = 5, 4 phiVal = 2 ** phi % bigMod for i in range(2, n + 1): nextMod = mod * 5 while val % nextMod != x % nextMod: val = val * phiVal % bigMod ans += phi phi *= 5 phiVal = (phiVal * ...

0.551878

for _ in range(int(input())): a,o,g=map(int,input().split()) while g>0: if a<o: a+=1 g-=1 elif o<a: o+=1 g-=1 else: break print(abs(a-o))

0.551772

from math import gcd def Fenjie(n): k = {} if (n == 1): return {} a = 2 while (n >= 2): if (a*a > n): if (n in k): k[n] += 1 else: k[n] = 1 break b = n%a if (b == 0): if (a in k): ...

0.551589

l= [] for i in range(62): l.append(2**i) T = int(input()) flag = 0 for t in range(T): L,R = [int(i) for i in input().split()] bL = bin(L) lL = len(bL)-2 index = 1 ans = 0 temp = 0 while(index<=lL): temp = L%l[index] if temp>=l[index-1]: if(l[index]-temp<=R-L+1): ans= (ans +(l[index-1])*(l[index]-t...

0.550369

for i in range(int(input())): n,b=map(int,input().split()) ans=n-((n-1)//b) print(ans)

0.547963

from math import * t=int(input()) for i in range(t): m,b=input().split() m=int(m) b=int(b) print(2*gcd(m,b))

0.547774

import sys from collections import defaultdict as dd from collections import deque from fractions import Fraction as f from copy import * from bisect import * from heapq import * from math import * from itertools import permutations def eprint(*args): print(*args, file=sys.stderr) zz=1 #sys.setrecursionlimit(10*...

0.545957

import numpy as np N=10**6+1 t=eval(input()) inp = () t1=ord('z') #bag=[[0 for _ in xrange(t1)] for _ in xrange(N+1)] bag=np.zeros((N+1,t1),dtype=np.int) #print bag while t: t-=1 inp=input().split() t2=ord(inp[3]) - ord('a') t3=int(inp[1]) t4=int(inp[2]) + 1 if inp[0]=="1": #print "enter" bag[t3][t2]+=int(...

0.542452

ct=0 a, b = list(map(int, input().split(' '))) x=[0]*5 for i in range(1, b+1): x[i%5]+=1 for i in range(1, a+1): ct+=x[(0-i)%5] print(ct)

0.541501

T = int(input()) for _ in range(T): x = input()[::-1] y = input()[::-1] start = y.index("1") offset = x[start:].index("1") print(offset)

0.541175

class Solution: def get_half(self,dividend,divisor): abs_dividend = abs(dividend) abs_divisor = abs(divisor) num = divisor num_temp=0 result=1 result_temp=0 while (num<=dividend): num_temp=num num+=num result_temp...

0.539676

t = int(input()) for _ in range(t): n = int(input()) k = int(input()) num = int(k/n) x = max(n*(1+num) - k, 0) diff = abs(x - (n-x)) if diff == 0: number = 2*x - 1 else: number = min(x, n-x)*2 print(number)

0.537251

# cook your dish here for t in range(int(input())): c=0 for i in range(int(input())): s,j=list(map(int,input().split())) if (j-s)>5: c+=1 print(c)

0.537004

def main(): v = { "1" : 2, "2" : 5, "3" : 5, "4" : 4, "5" : 5, "6" : 6, "7" : 3, "8" : 7, "9" : 6, "0" : 6 } a, b = map(int, input().split()) answer = 0 for i in range(a, b + 1): s = str(i) for e in s: ...

0.536643

# cook your dish here for test in range(0,int(input())): A,B = map(int,input().split()) diff = abs(A-B) count=0 if not(A^B): print(-1) else: for i in range(1,int(diff**(1/2))+1): if diff%i==0: if diff/i==i: count+=1 else: count+=2 print(count)

0.534975

a = int(input()) for i in range(a): b = input() if '5' in b or '0' in b: print(1) continue print(0)

0.534315

def gcd(a,b): return a if b==0 else gcd(b, a%b) for T in range(int(input())): de=int(input()) g=gcd(de, 180) if int(de/g)==int(180/g)-1: print(int(180/g)*2) else: print(int(180/g))

0.533981

import sys def read_int(): return int(sys.stdin.readline()) def read_ints(): return list(map(int, sys.stdin.readline().split(' '))) t = read_int() for case_num in range(t): n, s = read_ints() a = [0] + [int(i) for i in str(n)] ds = sum(a) cost = 0 idx = len(a) - 1 radix = 1 whi...

0.532613

import math t = int(input()) a = [-1, 0, 1] for i in range(58): temp = a[-1] + a[-2] temp = temp%10 a.append(temp) for _ in range(t): n = int(input()) temp = len(bin(n)) - 3 temp = 2**temp temp = temp%60 print(a[temp])

0.531975

def add(A, B): cnt = 0 while B > 0: U = A ^ B B = (A & B) * 2 A = U cnt += 1 return cnt for _ in range(int(input())): print(add(int(input(),2), int(input(), 2)))

0.527724

t = int(input()) for _ in range(t): A, B = list(map(int, input().split())) b = -1 B += 1 while B: b += 1 B //= 10 print(A*b)

0.527066

from sys import stdin input = stdin.readline q = int(input()) for _ in range(q): a,b,n = map(int,input().split()) kroki = 0 while max(a,b) <= n: if a > b: a,b = b,a a = a+b kroki += 1 print(kroki)

0.526565

t = int(input()) for case in range(t): a, b = list(map(int, input().split())) s = input() z = 10000 total = 0 act = False for i in range(len(s)): cur = s[i] if cur == '0': z += 1 act = False else: if not act: act = Tr...

0.524122

import math import sys input = sys.stdin.readline def main(): MAX_N = int(1e6) + 1 dp = [0 for i in range(MAX_N)] vals = [[] for i in range(10)] for i in range(10): dp[i] = i vals[i].append(i) for i in range(10, MAX_N): prod = 1 for j in str(i): i...

0.523393

# cook your dish here import math try: def prime(n): for i in range(2, int(math.sqrt(n)) + 1): if n % i == 0: return False return True for t in range(int(input())): x, y = list(map(int, input().split())) s = x + y i = s while(1): if prime(s + 1): ans = s + 1 break else: s +=...

0.52338

def l2i(s): return [int(i) for i in s.split()] a, b=l2i(input()) t=0 while (a<=b): a*=3 b*=2 t+=1 print(t)

0.521674

for _ in range(int(input())): x, y = map(int, input().split()) ans = 0 for i in range(y, x+1, y): if i%y == 0: ans += i%10 print(ans)

0.521389

import sys readline = sys.stdin.readline readall = sys.stdin.read ns = lambda: readline().rstrip() ni = lambda: int(readline().rstrip()) nm = lambda: map(int, readline().split()) nl = lambda: list(map(int, readline().split())) prn = lambda x: print(*x, sep='\n') def solve(): a, b, c, d = nm() m = 10**6 + 10 ...

0.519787

def dont_give_me_five(start, end): return sum('5' not in str(i) for i in range(start, end + 1))

0.518926

a = int(input()) for i in range(a): x, y = map(int, input().split()) t = x * 60 + y print(24*60 - t)

0.51794

import datetime cas = int(input()) for t in range(cas): timestamp1 = input().strip() timestamp2 = input().strip() time_format = "%a %d %b %Y %H:%M:%S %z" time_second1 = datetime.datetime.strptime(timestamp1,time_format) time_second2 = datetime.datetime.strptime(timestamp2,time_format) print((int...

0.517337

def find(a,b,n): strng = str(a) + str(b) #there are 10 and 4 long loops if (n > 20): n = n%20+20 while len(strng) <= n: next_ch = int(strng[-1]) + int(strng[-2]) strng = strng + str(next_ch) return int(strng[n])

0.515933

n = 500000 sieve, PRIMES = [0]*(n//2+1), [0,2] for i in range(3, n+1, 2): if not sieve[i//2]: PRIMES.append(i) for j in range(i**2, n+1, i*2): sieve[j//2] = 1 DOMINANTS = [] for p in PRIMES: if p >= len(PRIMES): break DOMINANTS.append(PRIMES[p]) def solve(a,b): return sum(p for p in DO...

0.515922

import sys def main(): #n = iinput() #k = iinput() #m = iinput() #n = int(sys.stdin.readline().strip()) #n, k = rinput() #n, m = rinput() #m, k = rinput() #n, k, m = rinput() #n, m, k = rinput() #k, n, m = rinput() #k, m, n = rinput() #m, k, n = rinput() #m,...

0.515108

for i in range(int(input())): a=int(input()) b=input().split() if '0' in b: print(100*(a-b.index('0'))+b.count('0')*1000) else: print(0)

0.514114

number = int(input()) for i in range(number): x = list(map(int, input().split(' '))) print(x[0]%x[1])

0.513356

# import all important libraries and inbuilt functions from fractions import Fraction import numpy as np import sys,bisect,copyreg,copy,statistics,os from math import * from collections import Counter,defaultdict,deque,OrderedDict from itertools import combinations,permutations,accumulate from numpy.linalg import ...

0.513188

from collections import * import sys try: inp = raw_input except: inp = input def err(s): sys.stderr.write('{}\n'.format(s)) def ni(): return int(inp()) def nl(): return [int(_) for _ in inp().split()] def solve(): n, L, R = nl() L -= 1 R -= 1 SM = 0 out = [] for i in range(1, n)...

0.512969

T=eval(input()) for i in range(T): a,b,c,d=list(map(int,input().split())) x=c-a n1=b-a+1 n2=d-c+1 s=0 if x<=0: t=n2-abs(x)-1 for j in range(t,max(0,d-b-1),-1): s=s+j if x>0: t=n2 for j in range(x,max(0,c-b-1),-1): s=s+t if (c-b)<=0: for j in range(t-1,max(0,d-b-1),-1): s=s+j print(s) ...

0.512508

for nt in range(int(input())): n,k = map(int,input().split()) if k<n: if n%2==0: if k%2: print (1) else: print (0) continue else: if k%2: print (0) else: print (1) continue print (k-n)

0.511663

# cook your dish here t=int(input()) for i in range(t): x=int(input()) if x%10==0: print(0) elif x%5==0: print(1) else: print(-1)

0.511147

t=int(input()) for i in range(t): l=list(map(int,input().split(' '))) a=l[0] b=l[1] l1=list(map(int,input().split(' '))) for i in range(b): l2=list(map(int,input().split(' '))) a1=l2[0] b1=l2[1] su=0 for j in range(a1-1,b1): su=(su+l1[j])%1000000000 print(su)

0.509665

for i in range(int(input())): yy=input() y=[int(e) for e in yy.split()] zz=input() z=[int(e) for e in zz.split()] count=0 for i in z: a=i+y[1] if a%7==0: count+=1 print(count)

0.508941

def mult_primefactor_sum(a, b): s=[] for i in range(a,b+1): r=factorize_add(i) if r!=i and i%r==0: s.append(i) return s def factorize_add(num): if num<4: return num d=2; p=0 while d<num**.5+1: while not num%d: p+=d; num/=d d+=1 if d==2 else 2 return p if n...

0.508647

def solve(L, R): res = 0 for i in range(32): for j in range(32): l = (L >> i) <> j) << j #print(l, r) if l>>i&1==0 or r>>j&1==0: continue l -= 1<<i r -= 1<<j if l & r: continue...

0.507456

m = 1000000007 (t, k) = [int(i) for i in input().split(' ')] n = 100000 dp=[0]*(n+1) dp[0] = 1 for i in range(1, n+1): dp[i] = (dp[i-1] + (0 if i-k < 0 else dp[i-k])) % m s = [0]*(n+1) s[1] = dp[1] s[0] = 0 for i in range(2, n+1): s[i] = (s[i-1] + dp[i]) % m for _ in range(t): (a, b) = [int(i) for i...

0.506997

class Solution: def brokenCalc(self, X: int, Y: int) -> int: res = 0 while X < Y: res += Y % 2 + 1 Y = int((Y + 1) / 2) return res + X - Y

0.506823

# cook your dish here # cook your dish here class Animal: def __init__(self): start, end, starting_time = map(int, input().split()) self.ending_time = starting_time + abs(start - end) self.velocity = 1 if end >= start else -1 self.eaten_by = -1, 10 ** 10 ...

0.506389

t,a,b=map(int,input().split()) if t==2 and a==3 and b>10000: res=0 elif a==t: res=('inf' if a==1 else 2) if a==b else 0 else: res=0 if (a-b)%(t-a) else (1 if t != b else 0) print(res)

0.50621

import math def cycle(n) : if n % 2 == 0 or n % 5 ==0: return -1 k = 1 while pow(10,k,n) != 1: k += 1 return k

0.505591

import sys readline = sys.stdin.readline read = sys.stdin.read ns = lambda: readline().rstrip() ni = lambda: int(readline().rstrip()) nm = lambda: map(int, readline().split()) nl = lambda: list(map(int, readline().split())) prn = lambda x: print(*x, sep='\n') def solve(): a, b, c, d = nm() if a <= b: ...

0.505427

w, r = open('output.txt', 'w'), open('input.txt', 'r') s, y = [0] * 466, [0, 100, 131, 159, 190, 220, 251, 281, 312, 343, 373, 404, 434] for i in range(int(r.readline())): m, d, p, t = map(int, r.readline().split()) x = y[m] + d s[x] -= p s[x - t] += p for i in range(465): s[i + 1] += s[i] w.write(s...

0.505108

from collections import deque T=int(input()) def break_down(num): count=0 while(len(num)!=1): temp=0 for i in range(0,len(num)): temp=temp+int(num[i]) num=str(temp) count=count+1 return (int(num),count) def digit_sum(num): temp=0 for i in ran...

0.503669

import math def GLR(x): summation_N = (x*(x+1))//2 initial = x power = 0 sum_A = 0 while x>=1: count = (x+1)//2 sum_A += count * 2**power x = x - count power += 1 sum_B = summation_N - sum_A ans = sum_B - (int(math.log(initial,2))+1) return ans for _ in range(int(input())): l,r = list(map(int,input()...

0.503222

s=input() t=int(input()) ans=[] n=len(s) clue=[0]*n for i in range(n-1): if(s[i]==s[i+1]): clue[i]+=1 L=[clue[0]] for i in range(1,n): L.append(L[i-1]+clue[i]) for i in range(t): A,B=input().split() A=int(A)-1 B=int(B)-1 r=0 x=L[B-1] y=L[A-1] if(A-1<0): y=0 ans....

0.50276

#! /usr/bin/env python from sys import stdin from functools import reduce def gcd(a,b): while b!=0: a,b=b,a%b return a def gcdl(l): return reduce(gcd, l[1:],l[0]) def __starting_point(): T=int(stdin.readline()) for case in range(T): numbers=list(map(int, stdin.readline().split()[1:])) g=gcdl(numbers) ...

0.502577

for _ in range(int(input())): f,d=list(map(int,input().split())) arr=list(map(int,input().split())) risk=0 days_risk=0 days_norm=0 if d==1: print(f) else: for a in arr: if a>=80 or a<=9: risk+=1 norm=f-risk if risk%d==0: days_risk=risk//d else: days_risk=(risk//d)+1 if norm%d==0: days...

0.502477

def number_of_carries(a, b): ans, carrie = 0, 0 while a > 0 or b > 0: carrie = (a%10 + b%10 + carrie) // 10 ans += [0,1][carrie > 0] a //= 10 b //= 10 return ans

0.502357

import sys import bisect input = sys.stdin.readline trips = int(input()) dyn = [int(input()) for i in range(trips)] cmap = [0,20] + [0 for i in range(trips-1)] for i in range(2,trips+1): cmap[i] = min(cmap[i-1] + 20, cmap[bisect.bisect_left(dyn,dyn[i-1]-89)] + 50, cmap[bisect....

0.502177

def base5(n): if n == 0: return for x in base5(n // 5): yield x yield n % 5 def seq(n): return int(''.join(str(2 * x) for x in base5(n)) or '0') for i in range(eval(input())): k=eval(input()) while(i<k): i=i+1 print(seq(i-1))

0.501954

# cook your dish here tc=int(input()) for j in range(tc): ip=list(map(int,input().rstrip().split())) x=ip[0] y=ip[1] n=ip[2] cnt=0 if(x==y): print('0') continue ln=bin(x).replace("0b", "") rn=bin(y).replace("0b", "") ll=len(ln) rl=len(rn) #print(ln) #print(rn) if(ll==len(rn)): for i in range(ll): ...

0.501667

T = int(input()) for t in range(T): N, R = list(map(int, input().split())) print(1 + (R - sum(map(int, input().split()))) % N)

0.501534

def solve(n): moves = [] for a, b in ["25", "75", "50", "00"]: s = str(n)[::-1] x = s.find(a) y = s.find(b, x+1 if a == "0" else 0) if x == -1 or y == -1: continue moves.append(x + y - (x > y) - (a == b)) s = s.replace(a, "", 1).replace(b, "", 1) ...

0.501413

# cook your dish here for _ in range (int(input())): x1,y1,x2,y2=map(int,input().split()) av1=(x1+y1)/2 av2=(x2+y2)/2 if(av1>av2): print(av1-av2," DEGREE(S) ABOVE NORMAL") else: print(av2-av1," DEGREE(S) BELOW NORMAL")

0.501003

# cook your dish here for i in range(int(input())): n,b=map(int,input().split()) ans=round(n/(2*b))*(n-b*round((n/(2*b)))); print(ans)

0.500974

def tiaosheng(a): j, t = 0, 0 for j in a: t += 3 if j + t > 60: return min(j, 60-t+3) return 60-t

0.500389

def getsum(N): if N==1: return 9 if N==2: return 99 s = "" for i in range(0,N): s = s+'5' s = int(s) if N%2==0: s = s*pow(9,N//2-1) else: s = s*pow(9,N//2) return s%(pow(10,9)+7) def main(): t = int(input()) for _ in range(0,t): N = int(input()) result = getsum(N) print(result) def __starting...

0.499798

def main(): t = int(input()) while (t): m, n = map(int, input().split()) a , b= bin(m)[2:],bin(n)[2:] #print(a,b) max = m^n if len(a)>len(b): diff =len(a)-len(b) b= ("0"*diff)+b #print(b) elif len(a)<len(b): diff =len(b)-len(a) a= ("0"*diff)+a #print(a) ll = len(b) count= 0 for i ...

0.499367

n, h, a, b, k = map(int, input().split()) for i in range(k): t1, f1, t2, f2 = map(int, input().split()) if t1 == t2: print(abs(f1 - f2)) elif f1 >= a and f1 <= b: print(abs(t2 - t1) + abs(f2 - f1)) elif f1 < a: print(abs(a - f1) + abs(t2 - t1) + abs(f2 - a)) elif f1 > b: ...

0.498674

# cook your dish here def getAns(num): if num<10:return 2 last=int(str(num)[0]);rem=int(str(num)[1:]);steps=2;p=len(str(num))-1 while True: steps+=rem//last+1;rem=rem%last if last>0:rem=rem+10**p-last last=last-1 if last==0: p=p-1;last=9 if(len(str(rem))==1):rem=0 els...

0.498595

import sys import string from math import gcd import getpass import math from decimal import Decimal import pprint def ria(): return [int(i) for i in input().split()] if getpass.getuser() != 'frohenk': filename = 'half' # sys.stdin = open('input.txt') # sys.stdout = open('output.txt', 'w') else: ...

0.498468

# Why do we fall ? So we can learn to pick ourselves up. t = int(input()) for _ in range(0,t): n = int(input()) abc = [int(i) for i in input().split()] i = 0 lst = [n] for _ in range(0,100): k = str(lst[-1]/abc[i%3]).split('.') if int(k[1][0]) > 0: ...

0.49731

for t in range(int(input())): n,b,m = list(map(int,input().split())) ans = 0 while n>0: ans+=b half = (n+1)/2 if n%2 else n/2 ans+=m*half m*=2 n=n-half print(ans-b)

0.495939

#include<stdio.h> int rev(int k) { int j,res=0; while(k) { res=res*10+k%10; k/=10; } return res; } int main() { int j,a,b,m,k; while(scanf("%d",&m)!=EOF) { for(j=1;j<=m;j++) { scanf("%d %d",&a,&b); k=rev(a)+rev(b); printf("%d\n",rev(k)); } } return 0; }

0.495801

from math import log2 def operation(a,b, n = 0): while log2(a) % 1: n += 1 a //= 2 return n + abs(log2(a/b))

0.495478

for TT in range(1, int(input()) + 1): a, b, c = map(int, input().split()) l = max(-1, (b + c - a) // 2) r = c print(r - l if r >= l else 0)

0.49531

t = int(input()) for tc in range(t): n,k=list(map(int, input().split())) tap = list(map(int, input().split())) sol=0 for i in range(1, n+1): d=1000000 for j in tap: d=min(d, abs(j-i)+1) sol=max(sol, d) print(sol)

0.495238

def tickets(people): till = {100.0:0, 50.0:0, 25.0:0} for paid in people: till[paid] += 1 change = paid-25.0 for bill in (50,25): while (bill <= change and till[bill] > 0): till[bill] -= 1 change -= bill if change != 0: return 'NO' return 'YES'

0.494112

mod = 10 ** 9 + 7 from collections import Counter choice = {'1' : ['11', '21', '22'], '2' : ['11', '12', '21']} def solve(a,b): n = len(a) if n == 1: return 2 dp = Counter([('11', '11')]) for i in range(n-1): new = Counter() for x,y in (a[i], b[i]), (b[i], a[i]): for p in choice[x]: for q in choice[y]:...

0.492677

t=int(input()) while(t): k=1 j=0 n=int(input()) while(n>0): if(n<=k): j+=1 n=0 elif n>2*k: j+=2 n=n-2*k k+=1 else: j+=2 n=0 print(j) t-=1

0.49254

You play a computer game. In this game, you lead a party of $m$ heroes, and you have to clear a dungeon with $n$ monsters. Each monster is characterized by its power $a_i$. Each hero is characterized by his power $p_i$ and endurance $s_i$. The heroes clear the dungeon day by day. In the beginning of each day, you choo...

import sys input = sys.stdin.readline import bisect t=int(input()) for testcases in range(t): n=int(input()) A=list(map(int,input().split())) m=int(input()) PS=[tuple(map(int,input().split())) for i in range(m)] PS.sort() K=[PS[-1]] for a,b in PS[::-1][1:]: if b<=K[-1][1]: ...

0.794576

from collections import defaultdict import copy #def dfs(l,r,dct): def dfs(l,r,dct): visit=[0 for i in range(n+1)] arr=[l] while(arr): node=arr.pop() if node==r:return True visit[node]=1 for lnk in dct[node]: if not visit[lnk]: arr.append(lnk) return False def ok(mid,cst): for i,j in edges: cst[...

0.692785

for _ in range(int(input())): n, x = list(map(int, input().split())) A = [] for _1 in range(n): d, h = list(map(int, input().split())) A.append([d, h]) A.sort(reverse=True) if A[0][0] >= x: print(1) else: x -= A[0][0] mz = 0 for d, h in A: ...

0.689311

import sys input = sys.stdin.readline N, M = list(map(int, input().split())) A = [] for _ in range(N): l, r = list(map(int, input().split())) A.append([l, r]) Z = [] for _ in range(M): l, r = list(map(int, input().split())) Z.append([l, r]) MA = 5*10**5+1 lg = 20 X = [[-1]*MA for i in range(lg)] for i...

0.687547

def merge(intervals,start,mid,end): al = mid-start+1 bl = end-mid A = intervals[start:mid+1] B = intervals[mid+1:end+1] p=0;q=0;k=start; while(p<al and q<bl): if(A[p]<B[q]): intervals[k] = A[p] k+=1;p+=1; else: intervals[k] = B[q] k+=1;q+=1; while(p<al): intervals[k] = A[p] k+=1;p+=1; ...

0.679793

t=eval(input()) a=[] b=[] top=-1 for __ in range(0,t): x=input().split() if(x[0]!="-1" and x[0]!="0"): add=int(x[0]) if top!=-1 and add>a[top][0] : b[top]+=1 else: a.append((add,x[1])) b.append(0) top+=1 elif (x[0]=="-1"): #print("%s %s" %(b[top],a[top]...

0.678841

from math import sqrt class pro(object): def __init__(self,dif,sc): self.dif=dif self.sc=sc def __lt__(self,other): return self.dif>other.dif T=int(input()) mul=[1] for i in range(100): mul.append(mul[i]*10/9) inf=1000000007 for t in range(T): n=int(input()) effi,tim=list(m...

0.666803

'''input 2 7 3 5 5 2 5 2 2 4 2 6 6 2 6 4 5 6 5 7 7 1 7 4 7 3 7 1 1 6 1 1 2 3 2 5 2 5 2 2 6 2 6 6 2 6 4 5 6 5 7 7 1 7 4 ''' for _ in range(int(input())): n, k, m = list(map(int, input().split())) row_s = [] col_s = [] for _ in range(m): h_x, h_y, t_x, t_y = list(map(int, input().split())) if h_x == t_x: if (...

0.661567

def ke(i): return b[i] n,m=map(int,input().split()) a=[0]*m b=[0]*m c=[0]*m e=[] ans=[0]*n for i in range(m): a[i],b[i],c[i]=map(int,input().split()) ans[b[i]-1]=m+1 e.append(i) e.sort(key=ke) for i in range(m): k=0 for j in range(a[e[i]]-1,b[e[i]]-1): if ans[j]==0: ans[j]=e[...

0.658422

import sys a,m,n=list(map(int,input().split())) aux=[0]*(a+1) inf=10**15 dp=[aux.copy() for i in range(n+1)] m1=10**12 m2=10**12 for i in range(m): l,r=list(map(int,input().split())) if l<m1: m1=l for j in range(l,r): dp[0][j+1]=inf s=[] for i in range(1,n+1): x,w=list(map(int,input().sp...

0.657316

t=eval(input()) for i in range(0,t): x=input() nm=x.split(' ') nm[0]=int(nm[0]) nm[1]=int(nm[1]) csoint=[] lsoint=[] csofloat=[] lsofloat=[] for j in range(0,nm[0]): a=input() b=a.split(' ') b[0]=int(b[0]) b[1]=int(b[1]) csoint.append(b[0]) ...

0.657302

t=int(input()) for i in range(t): x,y=0,0 n,m=list(map(int,input().split())) l=list(map(int,input().split())) if(max(l)>m): print(-1) else: for i in range(len(l)): y+=l[i] if(y>m): y=l[i] x+=1 if(y>0): x+=1 print(x)

0.656661

import sys def I(): return sys.stdin.readline().rstrip() class Heap: def __init__( self ): self.l = [ -1 ] self.n = 0 def n( self ): return self.n def top( self ): return self.l[ 1 ] def ins( self, x ): self.l.append( x ) n = len( self.l ) - 1 ...

0.652855

t = int(input()) for ti in range(t): n = int(input()) lri = [None for _ in range(n)] for _ in range(n): li, ri = list(map(int, input().split())) lri[_] = (li, ri, _) lri.sort() t = [None for _ in range(n)] ct, t[lri[0][2]], eg = 1, 1, lri[0][1] for i in range(1, n): if lri[i][0] <= eg: t[lri[i][2...

0.652215

from sys import stdin, stdout import os,sys,__pypy__ def main(): #t = int(stdin.readline()) n,m = list(map(int, stdin.readline().split())) tree = [list() for _ in range(n+1)] mn = [0] * (n+1) for _ in range(m): a,b = list(map(int, stdin.readline().split())) tree[a].append(b) ...

0.651979

import sys from sys import stdin import bisect def LIS(lis , end): seq = [] for c in lis: ind = bisect.bisect_right(seq,c) if ind == len(seq): seq.append(c) else: if ind != 0: seq[ind] = c return bisect.bisect_right(seq,end) tt = 1 for ...

0.650596

t = int(input()) for _ in range(t): n, m = map(int, input().split()) a = list(map(int, input().split())) if n <= 2: print(-1) continue if m < n: print(-1) continue cost = 0 edges = [] for i in range(n): edges.append((i+1, (i+1)%n + 1)) cost += 2 * a[i] s = sorted(range(n), key=lambda i: a[i]) ...

0.646151

import sys sys.setrecursionlimit(10000000) def mergeSortInversions(arr): if len(arr) == 1: return arr, 0 larr=len(arr) a = arr[:larr//2] b = arr[larr//2:] a, ai = mergeSortInversions(a) b, bi = mergeSortInversions(b) c = [] i = 0 j = 0 inversions = 0 + ai + bi la=len(a) while i < la and j < ...

0.645617

import sys input = sys.stdin.readline t = int(input()) for test in range(t): if test: input() n, m = list(map(int, input().split())) a = [-1] * m b = [-1] * m for i in range(m): a[i], b[i] = list(map(int, input().split())) l = [(a[i],0,i) for i in range(m)] + [(b[i],1,i) for i...

0.642997

'''Well I found the bug, but I don't understand why it was doing that. I mean, as far as I can tell, it shouldn't be a bug! Note to self: deleting from (supposedly) local lists through recursion is dangerous!''' class Group(object): def __init__(self,size,start,end,value): self.size = size self.sta...

0.64187

import sys import math a, b, n = list(map(int, str.split(sys.stdin.readline()))) s = lambda i: a + (i - 1) * b S = lambda i: a * i + b * i * (i - 1) // 2 for _ in range(n): l, t, m = list(map(int, str.split(sys.stdin.readline()))) # Si = a * r + b * r * (r - 1) / 2 # Si = b / 2 * r ^ 2 - (b / 2 - a) * r ...

0.641109

import sys from collections import defaultdict from copy import copy R = lambda t = int: t(eval(input())) RL = lambda t = int: [t(x) for x in input().split()] RLL = lambda n, t = int: [RL(t) for _ in range(n)] def solve(): N, Q = RL() P = RL() B = RL() phones = sorted(zip(P, B)) S = d...

0.640441

from collections import Counter tc=int(input()) for k in range(tc): n=int(input()) a=list(map(int, input().rstrip().split())) b= list(map(int, input().rstrip().split())) cc=sorted(a+b) #print('cc = ',cc) p=[] q=[] #print('len(cc) = ',len(cc)) #print('len = ',(2*n)) #rx=0 for i in range(0,(2*n),2): p.append...

0.638781

import sys class Fenwick(object): def __init__(self, n): self.n = n self.a = [10**9 for i in range(n)] self.w= 10**9 def zag(self, i, zn): self.w= min(self.w, zn) while i < self.n: self.a[i] = min(self.a[i], zn) i = (i | (i + 1)) def pol(self, r): ans= 10**9 while r >= 0...

0.634192

# input = raw_input # range = xrange import sys inp = [int(x) for x in sys.stdin.read().split()]; ii = 0 seg = [0]*200000 def offset(x): return x + 100000 def encode(x, y): return x*200002 + y def decode(x): return x//200002, x%200002 def upd(node, L, R, pos, val): while L < R: seg[node] += val seg[offset(no...

0.634188

for __ in range(int(input())): n,m=map(int,input().split()) arr=list(map(int,input().split())) s=set(arr) mex=-1 ele=1 for i in range(1,n+1): if i not in s: mex = i break if m>mex: print(-1) elif m==mex: print(n) els...

0.63388

# Question B. Road to Cinema import sys def roadToCinema(V, S, T, stations): # O(M) """ V : volume of fuel tank S : total distance T : time limit stations: fuel stations' locations rtype : boolean, whether this aircraft can travel within the time limit """ m = len(s...

0.6325

D=[0]*31 D[1]=2 D[2]=5 for i in range(3,31): best=10**10 for p in range(1,i+1): best=min(best,D[p-1]+D[i-p]+i+1) D[i]=best t=int(input()) for i in range(t): n,m=list(map(int,input().split())) maxi=(n+2)*(n+1)/2-1 mini=D[n] if mini<=m<=maxi: print(0) elif m<mini: print(-1) else: print(m-maxi)

0.629443

n, m = map(int, input().split()) valists = [10**9 for _ in range(1<<n)] valists[0] = 0 for i in range(m): values, b = map(int, input().split()) c = list(map(int, input().split())) cnt = 0 for j in range(b): cnt += 2**(c[j]-1) for j in range(len(valists)): x = j|cnt valists[x] = min(valists[x], valists[j]+val...

0.627354

dt, a = None, None def dfs(z): r = [{}, {}];ln = len(dt[z]) if ln == 0:r[0][0] = 0;r[1][1 << a[z]] = 1 elif ln == 1: l = dfs(dt[z][0]);r[0] = l[1] for m in l[0]: r[1][(1 << a[z]) | m] = min(r[1][(1 << a[z]) | m], l[0][m] + 1) if (1 << a[z]) | m in r[1] else l[0][m] + 1 for...

0.625828

t = [] l = [] r = [] for _ in range(int(input())): s, g = map(int, input().split()) t.append(s) l.append(s) r.append(g + s) for i in range(1, len(l)): if l[i] < l[i - 1]: l[i] = l[i - 1] - 1 if r[i] > r[i - 1]: r[i] = r[i - 1] + 1 for i in range(len(l) - 2, -1, -1): if l[i] < l[i + 1]: l[i] = l[i + 1]...

0.62076

class Dsu: def __init__(self, v, s): self.par = s self.v = v self.dr = [1] * v self.zero = [False] * v self.speed = [] for i in range(v): self.speed.append([]) self.speed[i].append(i) def find(self, i): # if parent[i] == -1: # ...

0.620691

def floo(num, k): return (num - 1) // k + 1 def main(): n, m = map(int, input().split()) low = 1 high = 10**9 if (m == 0): if (n == 1): print(1) else: print(-1) return for i in range(m): k, f = map(int, input().split()) low = max(low, (k + f - 1) // f) if (f > 1): high = min(high, (k - 1) ...

0.620373

n, q = list(map(int, input().split())) servers = [0] * n for _ in range(q): t, k, d = list(map(int, input().split())) # free = [i for i, x in enumerate(servers) if x < t] free = [] for sn in range(n): if servers[sn] < t: free.append(sn) if len(free) == k: break ...

0.618937

# -*- coding: utf-8 -*- import sys from operator import itemgetter from fractions import gcd from math import ceil, floor from copy import deepcopy from itertools import accumulate from collections import Counter import math from functools import reduce from bisect import bisect_right sys.setrecursionlimit(200000) inpu...

0.617553

t=int(input()) for i in range(t): n,m=list(map(int,input().split())) l=[0]+list(map(int,input().split())) s=0 c=1 m1=[] for i in range(n): d,f,b=list(map(int,input().split())) if(l[d]>0): m1.append(d) s+=f l[d]-=1 else: m1.append(0) s+=b for i in range(n): if(m1[i]==0): for j in range(c...

0.616982

# cook your dish here from bisect import bisect_left def BinarySearch(a, x): i = bisect_left(a, x) if i != len(a) and a[i] == x: return i else: return -1 for _t in range(int(input())): _n, q = list(map(int, input().split())) mounts = list(map(int, input().split())) for _q in range(q): query = list(...

0.615926

from itertools import permutations as p def disc(a,b): for ai in a: for bi in b: if ai==bi: return False return True for i in range(eval(input())): n = eval(input()) arr = list(map(int,input().split())) perms = list(p(arr)) m = eval(input()) offer = {} for i in range(m): dup = list(map(int,input().s...

0.613222

# cook your dish here from collections import deque primes = {2,3,5,7,11,13,17} 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)] x = [1,2,3,4,5,6,7,8,9] avail = {tuple(x):0} q = deque([x]) while q: curr = q.popleft(); for e in edges: if curr[e[0]]+curr[e[1]] in...

0.611231

import sys # sys.stdin = open('in.txt') s = sys.stdin.read().split() p = 0 def getSm(k, a, b, c, d): return (k + 1) * a - (k * (k + 1) >> 1) * b * d t = int(s[p]) p += 1 res = [] for _ in range(t): a = int(s[p]) p += 1 b = int(s[p]) p += 1 c = int(s[p]) p += 1 d = int(s[p]) p...

0.608694

t=int(input()) for nbt in range(t): n,k=[int(i) for i in input().split()] a=[int(i) for i in input().split()] nbc=len(set(a))-1 if k==1: if nbc: print(-1) else: print(1) else: print(1+max(0,(nbc-1)//(k-1)))

0.608039

import heapq for _ in range(int(input())): n = int(input()) voters = [] for i in range(n): m,p = list(map(int, input().split())) voters.append((m, -p)) voters.sort() for i in range(n): voters[i] = (voters[i][0], -voters[i][1]) ans = 0 costs = [] heapq.heapify(co...

0.605107

# cook your dish here for _ in range(int(input())): n,m = list(map(int,input().split())) colors = [0]*41; cost = [0]*41 color = 0 for i in range(n): cc,pp = list(map(int,input().split())) colors[cc] += 1 cost[cc] += pp for i in colors: if i>0: color += 1 dp2 = [[0...

0.604856

for _ in range(int(input())): n=int(input()) a=input() b=input() l=[] flag=0 for i in range(n): if b[i]!=a[i]: if b[i] in a and b[i]<a[i]: l.append(b[i]) else: flag=1 break if flag==1: print(-1) else: if l==[]: print(0) else: l = sorted(list(set(l)), reverse = True) print(len(...

0.604387

import sys input = lambda: sys.stdin.readline().rstrip() T = int(input()) for _ in range(T): N = int(input()) A = [ord(a) - 97 for a in input()] B = [ord(a) - 97 for a in input()] X = [[0] * 20 for _ in range(20)] for a, b in zip(A, B): X[a][b] = 1 if a > b: print(-1) ...

0.604308

import sys from operator import itemgetter def count(a, b, num_a, num_b, cur_time): current_result = 0 #print('count time = ', cur_time, "num_a =", num_a, 'num_b = ', num_b) if num_a * a + num_b * b <= cur_time and cur_time >= 0: cur_time -= num_a * a + num_b * b current_result = num_a + num_b if num_a < tota...

0.60251

from collections import defaultdict d = defaultdict(list) n,m=list(map(int,input().split())) for i in range(n): w = input() d[w].append(str(i+1)) for j in range(m): w = input() print((' '.join(d[w]) or -1))

0.601978

#!/usr/bin/env python3 # Copied solution import collections import sys import traceback class Input(object): def __init__(self): self.fh = sys.stdin def next_line(self): while True: line = sys.stdin.readline() if line == '\n': continue retur...

0.599662

__author__ = 'Pavel Mavrin' n, m = [int(x) for x in input().split()] a = [] for i in range(m): a.append([int(x) - 1 for x in input().split()]) a.sort(key=lambda x: x[0] * n + x[1]) a.append([n - 1, n]) d = [[0, 1]] r = 0 i = 0 while i < len(a): if a[i][0] == r: dd = [] j = 0 while i <...

0.599352

from math import ceil, floor Q = int(input()) for _ in range(Q): a, b, m = map(int, input().split()) if b - a == 0: print(1, a) continue if b - a <= m: print(2, a, b) continue x = max(0, ceil(b/(a+m)) - 1) y = max(0, floor(b/(a+1))) if x.bit_length() < y.bit_lengt...

0.59682

try: t=int(input()) for a in range(t): l=input().split() n=int(l[0]) m=int(l[1]) d={} s=0 for b in range(m): l1=input().split() i=int(l1[0]) j=int(l1[1]) k=int(l1[2]) for c in range(i,j+1): if c not in d: d[c]=10 for c in range(i,j+1): d[c]=d[c]*k for i in d: s=s+d[i] ...

0.595095

import sys import os import random import math #nonlocal defs n, m, p = list(map(int, input().split())) arr = [dict() for _ in range(n)] for _ in range(p): i,j = list(map(int,input().split())) i -= 1 j -= 1 if j not in arr[i]: arr[i][j] = j+1 else: arr[i][j] += 1 def chefbm(arr,i): for (e,f) in arr[i].items(...

0.594432

T = int(input()) for t in range(T): n, m = list(map(int, input().split())) c = list(map(int, input().split())) dp1 = [1e9]*((1 << n)+1) for i in range(n): dp1[1 << i] = c[i] dp1[1 << (n-1)] = min(dp1[1 << (n-1)], sum(c)) for i in range(m): l = list(map(int, input().split())) cost = l[0] s = l[1] it...

0.594399

def get(l,n): l1,l2 = [],[] i = 1 h1,m1 = l[0] while (i < len(l)): h2,m2 = l[i] if (h1>h2): if (m1 >= m2): l1 += [(0,10**20)] l2 += [(-1,-1)] else: d = (h1-h2)//(m2-m1) if (((h1-h2)%(m2-m1)) == 0): l1 += [(0,d-1)] l2 += [(d+1,10**20)] else: l1 += [(0,d)] l2 += [(d+1...

0.594351

t = int(input()) for _ in range(t): n = list(input().strip()) s = list(map(int, input().strip().split())) check = set(s) found = False for i in range(1, 1025): newset = set([e^i for e in s]) if check == newset: print(i) found = True break if ...

0.592732

import decimal; from decimal import *; def solve(a, b, min1, min2, min3, min4, x, y): if a > b: return []; solMin1 = (a/y+b)/(y-1/y); solMin2 = (b/y+a)/(y-1/y); solMin1 *= (x*y); solMin2 *= (x*y); if solMin1 >= min1 and solMin1 <= min2 and solMin2 >= min3 and solMin2 <= min4: # Solution found return [a, s...

0.588922

#!/usr/bin/env python3 import sys import bisect input = sys.stdin.readline sys.setrecursionlimit(10**6) n, m = map(int, input().split()) seen = set() ab = [] for _ in range(n): a, b = map(int, input().split()) ab.append((a, b)) seen.add(a) ab.sort() decomp = list(seen) decomp.sort() node_num = len(decomp)...

0.588164

# cook your dish here for _ in range(int(input())): N, M = [int(x) for x in input().split()] edges = [0]*M dir = {} nodes = [[] for j in range(N+1)] ind = [0]*(N+1) graph = {} final_edges = [] for i in range(M): u, v = [int(x) for x in input().split()] nodes[u].append(v) ...

0.587059

def f(a,y,index,sorted_pos): #print(a,y,index,sorted_pos) n=len(a) low=0 high=n-1 L,R=0,0 l,r=0,0 while(low<=high): mid=(low+high)//2 #print(low,high,mid) if(a[mid]== y): break elif(mid > index[y]): high=mid-1 L+=1 #print("L") if(a[mid] <y): l+=1 #print(" l ") else: low=mid+1 ...

0.586409

# cook your dish here for a in range(int(input())): N,M=map(int,input().split()) b=[] for o in range(N): b.append(input()) c=[] for d in b: f=[] for e in range(len(d)): if d[e]=='1': f.append(e) c.append(f) i=[] for g in range(len(c)): for h in range(len...

0.585401

def f(x, y, a, b, n): return a + (x - a) * cos[n] - (y - b) * sin[n], b + (x - a) * sin[n] + (y - b) * cos[n] def check(p): d = {} for i in range(len(p) - 1): for j in range(i + 1, len(p)): dist = (p[i][0] - p[j][0]) ** 2 + (p[i][1] - p[j][1]) ** 2 d[dist] = d.get(dist, 0) ...

0.584956

import math def dist(w,x,y,z): return math.hypot(y - w, z - x) t = int(input()) while (t>0): t = t -1 n, m = list(map(int,input().split())) a = [] for i in range(0,n): x,y = list(map(int,input().split())) a.append([x,y]) for j in range(0,m): p,q,r,s = list(map(int,input().split())) nearest = -1 distanc...

0.583749

import sys def spaces(a,n,m,k,visit1,visit2,dist,position): queue = [position] lastedit = [] dist[position[0]][position[1]] = 0 while queue!=[]: point = queue[0] i = point[0] j = point[1] #print 'point',i,j if visit1[i][j]==False: visit1[i][j] = True startx = max(i-k,0) endx = min(i+k,n-1) f...

0.583253

import sys sys.setrecursionlimit(100000) memo = {} def recurse(arr, T1, T2, k, i): if T1 >= k and T2 >= k: return i if i >= len(arr): return float('inf') if (T1, T2) in memo: return memo[(T1, T2)] t1 = recurse(arr, T1 + arr[i], T2, k, i+1) t2 = recurse(arr, T1, T2 + arr[i], k, i+1) memo[(T1, T2)] = mi...

0.582247

import sys sys.setrecursionlimit(10 ** 5) int1 = lambda x: int(x) - 1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def MI(): return map(int, sys.stdin.readline().split()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(ro...

0.582142

import sys n, m = list(map(int, sys.stdin.readline().strip().split())) L = [0 for i in range (0, n)] H = [[] for i in range (0, n)] for i in range (0, m): x, y = list(map(int, sys.stdin.readline().strip().split())) x = x - 1 y = y - 1 if x > y: x, y = y, x L[y] = L[y] + 1 H[x].append(y)...

0.582141

n = int(input()) a = list(map(int, input().split())) m = int(input()) b = list(map(int, input().split())) ptra = 1 ptrb = 1 sa = a[0] sb = b[0] ans = 0 while ptra != n and ptrb != m: if sa == sb: ans += 1 sa = a[ptra] sb = b[ptrb] ptra += 1 ptrb += 1 continue ...

0.582014

import sys reader = (s.rstrip() for s in sys.stdin) input = reader.__next__ class RAQ_RMQ(): def __init__(self, n, inf=2**31-1): self.n0 = 1<<(n-1).bit_length() self.INF = inf self.data = [0]*(2*self.n0) self.lazy = [0]*(2*self.n0) def getIndex(self, l, r): l += self.n0...

0.581915

# cook your dish here """ Input: The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. The first line of each test case contains three space-separated integers p, q and r. The second line contains three space-separated integers a, b and c. Ou...

0.581854

tc=int(input()) for case in range(tc): n,d=list(map(int,input().split())) a=list(map(int,input().split())) sm=sum(a) f=True if sm%n==0: avg=sm/n for i in range(d): tmp_sm=0 tmp_n=0 for j in range(i,n,d): tmp_sm=tmp_sm+a[j] tmp_n+=1 if tmp_sm%tmp_n==0: if avg!=tmp_sm/tmp_n: f=False ...

0.581812

for _ in range(int(input())): lasts = {} ans = n = int(input()) for i, a in enumerate(input().split()): if a in lasts: ans = min(ans, i - lasts[a]) lasts[a] = i ans += 1 if ans > n: ans = -1 print(ans)

0.581201

def magic(): def check(art,k,m): n=len(art) for i in range(n-k+1): maxi=0 maxi=max(art[i:i+k]) total=0 total=art[i:i+k].count(maxi) if total>=m: return False return True for _ in range(eval(input())): n,k,m=list(map(int,input().split())) arr=list(map(int,input().split())) dp=[] ...

0.580102

N = int(input()) T = [int(TN) for TN in input().split()] SumT = sum(T) M = int(input()) PX = [[] for TM in range(0,M)] for TM in range(0,M): PX[TM] = [int(TPX) for TPX in input().split()] for TM in range(0,M): print(SumT-T[PX[TM][0]-1]+PX[TM][1])

0.578031

#!/usr/bin/env python3 import sys input = sys.stdin.readline from collections import deque INF = 10**9 n, m = map(int, input().split()) pqc = [] seen = set() for i in range(n): seen.add((i, 0)) for _ in range(m): p, q, c = map(int, input().split()) p -= 1; q -= 1 pqc.append((p, q, c)) seen.add((p,...

0.576319

for __ in range(eval(input())): x = eval(input()) a = list(map(int,input().split())) key = eval(input()) query = eval(input()) maxvisited = x #maximum visted value j = x-1 ans = [] val = 0 while j>=0: if a[j]==key: ans.append(val+1) val = val +1 ...

0.576313

# cook your dish here t=int(input()) for _ in range(t): n,m=list(map(int,input().split())) r=list(map(int,input().split())) rating=[[r[i]]*(m) for i in range(n)] ranking=[[0]*m for i in range(n)] for i in range(n): diff=list(map(int,input().split())) for j in range(m): rating[i][j]+=diff[j] if j+1<m: ...

0.576049

def reachable(es, source): ret = {source} Q = [source] while Q: cur = Q.pop() for nxt in es[cur]: if nxt not in ret: Q.append(nxt) ret.add(nxt) return ret def BellmanFord(V:int, es:list, source=0): INF = float("inf") D = [INF]*V D[source] = 0 for _ in range(V): upd = False for f, t, c in es:...

0.575512

from collections import deque n, b = map(int, input().split()) q = deque() for _ in range(n): t, d = map(int, input().split()) while q and q[0] <= t: q.popleft() if len(q) == b + 1: print(-1, end = ' ') else: if q: t = q[-1] print(t + d, end = ' ') q...

0.575333

import sys input = sys.stdin.readline from itertools import permutations, accumulate import heapq import bisect from operator import itemgetter def dijkstra(start, edge): n = len(edge) dist = [0]*n que = [(0, start)] while que: d, v = heapq.heappop(que) if dist[v] < d: conti...

0.574781

t=int(input()) for _ in range(t): n=int(input()) grid=[] for _ in range(n): temp=[] temp=list(map(int,input().strip().split())) temp.sort() grid.append(temp) curr=max(grid[n-1]) total=curr for i in range(n-2,0-1,-1): flag=0 for j in range(n-1,0-1,-1): if grid[i][j]<curr: flag=1 curr=...

0.574345

t=int(input()) while(t): n=int(input()) l=[] for i in range(n): l.append(list(map(int,input().split()))); m=[] for i in l: m.append((i[1]//(i[0]+1))*i[2]) res=max(m) print(res) t=t-1

0.573947

3 import math import os import sys DEBUG = 'DEBUG' in os.environ def inp(): return sys.stdin.readline().rstrip() def dprint(*value, sep=' ', end='\n'): if DEBUG: print(*value, sep=sep, end=end) INF = 10 ** 20 def solve(N, A, B): dp = {A[0]: 0, A[0] + 1: B[0], A[0] + 2: B[0] * 2} for i...

0.573238

import sys input = sys.stdin.readline T = int(input()) for _ in range(T): n = int(input()) l = list(map(int, input().split())) stack = [] out = [-1] * n curr = 0 works = True for i in range(n): while stack and stack[-1][0] == i: _, j = stack.pop() curr +...

0.572688

from math import gcd def lcm(a, b): return a * b // gcd(a, b) for _ in range(int(input())): n = int(input()) P = list(map(int, input().split())) x, a = map(int, input().split()) y, b = map(int, input().split()) k = int(input()) P.sort(reverse=True) l = 0 r = n + 1 while r - l > 1...

0.570791

t = int(input()) for _ in range(t): n = int(input()) l = list([int(x)- 1 for x in input().split()]) out = [] ll = [(l[i], i) for i in range(n)] ll.sort() swap = (-1,-1) for i in range(n - 1): if ll[i][0] == ll[i + 1][0]: swap = (ll[i][1],ll[i+1][1]) newl = [0]*n ...

0.570487

import sys input = lambda: sys.stdin.readline().rstrip() from collections import deque N = int(input()) C, Y = [], [] for _ in range(N): a, b, c = list(map(int, input().split())) C.append(a) Y.append(c - b) if sum(Y): print(-1) return X = [[] for i in range(N)] for i in range(N-1): x, y = list...

0.569721

from math import sqrt import sys sys.setrecursionlimit(10**8) intMax = 10**18 def knapsack(rl,l,c,m): if m==0 and rl>0: return intMax if rl<=0: return 0 return min(c[m-1]+knapsack(rl-l[m-1],l,c,m),knapsack(rl,l,c,m-1)) for _ in range(int(input())): n= int(input()) cost=[] length=[] sides=[] for i in range(n...

0.569611

import sys readline = sys.stdin.readline read = sys.stdin.read ns = lambda: readline().rstrip() ni = lambda: int(readline().rstrip()) nm = lambda: map(int, readline().split()) nl = lambda: list(map(int, readline().split())) prn = lambda x: print(*x, sep='\n') def solve(): a, b, c, d = nm() if a <= b: ...

0.569559

def main(): n, m = list(map(int, input().split())) l = [[] for _ in range(n + 1)] for _ in range(m): u, v = list(map(int, input().split())) l[u].append(v) l[v].append(u) res = [0] * (n + 1) for u, x in enumerate(res): if not x: x, nxt = -1, [u] ...

0.568831

import sys n,m=list(map(int,sys.stdin.readline().split())) L=list(map(int,sys.stdin.readline().split())) c=0 Ans="" for i in range(m): x=list(map(int,sys.stdin.readline().split())) if(x[0]==1): L[x[1]-1]=x[2]-c elif(x[0]==2): c+=x[1] else: Ans+=str(L[x[1]-1]+c)+"\n" sys.stdout.w...

0.566811

# cook your dish here class TestCase: def __init__(self): [self.node_count, self.query_count] = read_line() def fill_nodes(self): self.nodes = {n+1: [] for n in range(self.node_count)} for i in range(self.node_count -1): new_node_1, new_node_2 = read_line() ...

0.566794

#~ # MAGIC CODEFORCES PYTHON FAST IO import atexit import io import sys _INPUT_LINES = sys.stdin.read().splitlines() input = iter(_INPUT_LINES).__next__ _OUTPUT_BUFFER = io.StringIO() sys.stdout = _OUTPUT_BUFFER @atexit.register def write(): sys.__stdout__.write(_OUTPUT_BUFFER.getvalue()) #~ # END OF MAGIC CODEFO...

0.566338

n,m=map(int,input().split()) l=[] leng=0 for i in range(n+m): w=int(input()) if w==-1: cm=0 mi=0 for j in range(leng): if l[j]>cm: cm=l[j] mi=j print(cm) l[mi]=-1 else: l.append(w) l...

0.565448

# cook your dish here # cook your dish here import numpy as np n, s, q = [int(j) for j in input().split()] edges = [int(j)-1 for j in input().split()] costs = [int(j) for j in input().split()] special = [int(j)-1 for j in input().split()] queries = [[0] * 3 for _ in range(q)] for i in range(q): queries[i] = [int(j)-...

0.565018

from collections import Counter n, q = map(int, input().split()) a = map(int, input().split()) b = [int(input()) for _ in range(q)] counts = 32 * [0] for value, count in Counter(a).items(): counts[value.bit_length() - 1] = count for bj in b: ans = 0 for i in reversed(range(32)): count = min...

0.564186

for __ in range(int(input())): n = int(input()) ar = [] for ________ in range(n): ar.append(list(map(int, input().split()))) ar.sort(key=lambda x: x[1]) num1 = ar[0][1] ar.sort(key=lambda x: -x[0]) num2 = ar[0][0] print(max(0, num2 - num1))

0.563912

for _ in range(int(input())): am = int(input()) arr = list(map(int,input().split())) if arr[0] + arr[1] > arr[-1]: print(-1) else: print(1,2,am)

0.563906

# cook your dish here T = int(input()) for i in range(T): N,data,D,People = int(input()),list(map(int,list(input()))),int(input()),list(map(int,input().split())) data.insert(0,"|"),data.append("|") infected = [] for i in range(1,N+1): if(data[i]==1): infected.append(i) ...

0.563541

from itertools import accumulate import sys def solve(f, g): n, m, k, s = [int(x) for x in f.readline().split()] a_price = [(int(x), i+1) for i, x in enumerate(f.readline().split())] b_price = [(int(x), i+1) for i, x in enumerate(f.readline().split())] a_gadgets = [] b_gadgets = [] for i, line...

0.563481

def solve(n, l, s, www, children): ans = 0 dp = [{} for _ in range(n)] for v in range(n - 1, -1, -1): cv = children[v] if not cv: dp[v][1] = www[v] continue ans += len(cv) - 1 wv = www[v] if wv > s: return -1 dv = dp[v] ...

0.562376

for _ in range(int(input())): n = int(input()) a = list(map(int, input().split())) s = set(a) if n == 1 or len(s) > 2: print(-1) continue if len(s) == 1: x = s.pop() if x == 0: print(n) elif x == n-1: print(0) else: print(-1) continue x, y = sorted(s) xc, yc = a.count(x), a.count(y) ...

0.562057

Polycarp plays a computer game (yet again). In this game, he fights monsters using magic spells. There are two types of spells: fire spell of power $x$ deals $x$ damage to the monster, and lightning spell of power $y$ deals $y$ damage to the monster and doubles the damage of the next spell Polycarp casts. Each spell c...

class BIT(): def __init__(self,n): self.BIT=[0]*(n+1) self.num=n def query(self,idx): res_sum = 0 while idx > 0: res_sum += self.BIT[idx] idx -= idx&(-idx) return res_sum #Ai += x O(logN) def update(self,idx,x): while idx <= self....

0.809501

class BIT(): """区間加算、一点取得クエリをそれぞれO(logN)で応えるデータ構造を構築する add: 区間[begin, end)にvalを加える get_val: i番目(0-indexed)の値を求める """ def __init__(self, n): self.n = n self.bit = [0] * (n + 1) def get_val(self, i): i = i + 1 s = 0 while i <= self.n: s += self....

0.687824

n = int(input()) a, b = [0] * (n + 2), [0] * (n + 2) s, l = 0, 1 p = [0] * n for i in range(n): t = list(map(int, input().split())) if t[0] == 1: b[t[1] - 1] += t[2] s += t[1] * t[2] elif t[0] == 2: a[l] = t[1] l += 1 s += t[1] else: l -= 1 s -= a[...

0.67886

import sys from array import array # noqa: F401 n = int(input()) matrix = [array('i', list(map(int, input().split()))) for _ in range(n)] aa = tuple([int(x) - 1 for x in input().split()]) ans = [''] * n for i in range(n-1, -1, -1): x = aa[i] for a in range(n): for b in range(n): if matri...

0.675981

import collections, re n = int(input()) item_od = collections.OrderedDict() for i in range(n): record_list = re.split(r'(\d+)$',input().strip()) item_name = record_list[0] item_price = int(record_list[1]) if item_name not in item_od: item_od[item_name]=item_price else: item_od[item_n...

0.674654

from itertools import permutations C = list(permutations(['A','B','C','D'])) V = list(permutations([3,6,9,12])) P = list(permutations([25,50,75,100])) R = [] def test(): d = {} n = int(input()) for i in C[0]: for j in V[0]: d[i+str(j)] = 0 for i in range(n): x,y = input().split() d[x+y] += 1 ans = -10000...

0.671406

# 10 # + 8 # + 9 # + 11 # + 6 # + 1 # ? 3 # - 8 # ? 3 # ? 8 # ? 11 MAX_BIT = 30 class Node: def __init__(self): self.left = None self.right = None self.leftCnt = 0 self.rightCnt = 0 def AddRight(self): if self.right == None: self.right = Node() ...

0.667687

t=int(input()) while t>0 : n=int(input()) a=list(map(int,input().split())) an=0 s=0 for i in a : if s+i>=0 : s+=i else : s+=i an-=s s=0 print(an) t-=1

0.665693

import sys input = sys.stdin.readline from bisect import bisect_right bin_s = [1] while bin_s[-1] <= 10 ** 9: bin_s.append(bin_s[-1] * 2) def main(): n, q = map(int, input().split()) alst = list(map(int, input().split())) dp = [[-1, -1] for _ in range(n)] dp[0] = [alst[0], 0] for i, a in enum...

0.662362

Q = int(input()) qs = [input().split() for i in range(Q)] import heapq class Heapq: def __init__(self, arr, desc=False): if desc: arr = [-a for a in arr] self.sign = -1 if desc else 1 self.hq = arr heapq.heapify(self.hq) def pop(self): return heapq.heappop(s...

0.660458

import sys def I(): return sys.stdin.readline().rstrip() class Heap: def __init__( self ): self.l = [ -1 ] self.n = 0 def n( self ): return self.n def top( self ): return self.l[ 1 ] def ins( self, x ): self.l.append( x ) n = len( self.l ) - 1 ...

0.651008

import heapq n = int(input()) buy = [] # negative sell = [] unknown = [] res = 1 for i in range(n): cmd, amount = input().strip().split() amount = int(amount) if cmd == 'ADD': if sell and sell[0] < amount: heapq.heappush(sell, amount) elif buy and -buy[0] > amount: ...

0.650086

import sys from sys import stdout import random from fractions import Fraction from math import * def input(): return sys.stdin.readline().strip() def iinput(): return int(input()) def finput(): return float(input()) def tinput(): return input().split() def linput(): return list(input()) de...

0.649243

n=int(input()) a=[];b=[];c=[];d=[] for i in range(n): opt,num=[int(x) for x in input().split()] if opt==0: a.append(num) if opt==10: b.append(num) if opt==1: c.append(num) if opt==11: d.append(num) ans=0 ans+=sum(d) b.sort(reverse=True) c.sort(reverse=True) if len(b)<...

0.648655

import sys import math import cProfile DEBUG = False def log(s): if DEBUG and False: print(s) def calc_dmg(num, arr): maximum = 0 if num - len(arr) < 0: maximum = max(arr) return sum(arr) + maximum if DEBUG: sys.stdin = open('input.txt') pr = cProfile.Profile() pr....

0.643835

""" 4 4 4 3 1 2 6 1 2 2 1 3 1 5 10 1 2 10 5 4 1 2 1 2 """ tests = int(input()) for _ in range(tests): n = int(input()) ls = list(map(int, input().split())) if ls[0] < ls[1]: ls[0] = -ls[0] if ls[-1] < ls[-2]: ls[-1] = -ls[-1] for i in range(1, n - 1): if ls[i] < ls[i - 1] and ls[i] < ls[i + 1]: ls[i]...

0.643448

for _ in range(int(input())): n=int(input()) l=list(map(int,input().split())) a=[] lis=[] prevsign=-1 if l[0]>0: prevsign=1 else: prevsign=0 i=0 for i in l: if (i>0 and prevsign==1) or (i<0 and prevsign==0): lis.append(i) else: ...

0.643142

t=eval(input()) a=[] b=[] top=-1 for __ in range(0,t): x=input().split() if(x[0]!="-1" and x[0]!="0"): add=int(x[0]) if top!=-1 and add>a[top][0] : b[top]+=1 else: a.append((add,x[1])) b.append(0) top+=1 elif (x[0]=="-1"): #print("%s %s" %(b[top],a[top]...

0.640892

j=n=1<<int(input()) a=[[0,int(s)]for s in input().split()] while j>1:j>>=1;a=[sorted(a[i]+a[i^j]*(i&j>0))[-2:]for i in range(n)] for s,f in a[1:]:j=max(j,s+f);print(j)

0.639398

import sys n,m = [int(x) for x in input().split()] inp = [] s = sys.stdin.read() i = 0 while True: while i<len(s) and s[i]<'-':i+=1 if i==len(s):break j = i while j<len(s) and not(s[j]<'-'):j+=1 inp.append(int(s[i:j])) i = j order = sorted(range(n),key=lambda i:inp[2*i]-inp[2*i+1]) score = [0...

0.638903

# cook your dish here from sys import stdin, stdout from collections import defaultdict for _ in range(int(stdin.readline())): n=int(stdin.readline()) lst=list(map(int, stdin.readline().split())) prefix_odd=[0]*n prefix_even=[0]*n odd_val=0 even_val=0 for i in range(n): if lst[i]%2==...

0.638711

# cook your dish here try: T = int(input()) for i in range(T): n = int(input()) s = input() arr = [int(i) for i in input().strip().split(" ")] res = 1 result = 0 for j in range(n-7): res = 1 res1= 0 s1 = s[j:j+8] for i in range(8): if s1[i] == 'D': res = res*2 res1 += arr[i] ...

0.637387

from itertools import permutations as p def disc(a,b): for ai in a: for bi in b: if ai==bi: return False return True for i in range(eval(input())): n = eval(input()) arr = list(map(int,input().split())) perms = list(p(arr)) m = eval(input()) offer = {} for i in range(m): dup = list(map(int,input().s...

0.635981

# cook your dish here p=int(input()) for z in range(p): n=int(input()) a=[] for i in range(8): a.append(0) for i in range(n): x,y=list(map(int,input().split())) if x<=8 and y>a[x-1]: a[x-1]=y print(sum(a))

0.635854

n = int(input()) t = [list(map(int, input().split())) for q in range(n)] t[0][0] = 0 n += 1 u = [-1e7] * n v = [0] * n for i, (j, a) in list(enumerate(t, 1))[::-1]: u[i] = max(u[i], v[i] + a) v[j], u[j] = max(v[j] + v[i], u[j] + u[i]), max(v[j] + u[i], u[j] + v[i]) print(u[1])

0.635389

import heapq for _ in range(int(input())): n = int(input()) voters = [] for i in range(n): m,p = list(map(int, input().split())) voters.append((m, -p)) voters.sort() for i in range(n): voters[i] = (voters[i][0], -voters[i][1]) ans = 0 costs = [] heapq.heapify(co...

0.633336

w, r = open('output.txt', 'w'), open('input.txt', 'r') s, y = [0] * 466, [0, 100, 131, 159, 190, 220, 251, 281, 312, 343, 373, 404, 434] for i in range(int(r.readline())): m, d, p, t = map(int, r.readline().split()) x = y[m] + d s[x] -= p s[x - t] += p for i in range(465): s[i + 1] += s[i] w.write(s...

0.633134

for _ in range(int(input())): n=int(input()) f=list(map(int,input().split())) sum1=f[0] d=0 i=1 while sum1!=0 and i<n: sum1=sum1-1+f[i] d+=1 i+=1 print(d+sum1)

0.631461

# -*- coding: utf-8 -*- import sys from operator import itemgetter from fractions import gcd from math import ceil, floor from copy import deepcopy from itertools import accumulate from collections import Counter import math from functools import reduce from bisect import bisect_right sys.setrecursionlimit(200000) inpu...

0.630372

counter = -1 def flattree(node): nonlocal counter if visited[node]==1: return else: visited[node]=1 counter += 1 i_c[node] = counter flat_tree[counter] = swt[node] for i in graph[node]: if visited[i]==0: flattree(i) ...

0.629374

# cook your dish here class node: def __init__(self,a,b=0,c=0): self.val=a self.a=b self.b=c arr=[] def finder(node,val): if(arr[node].val==0): return val else: a=finder(arr[node].a,val) b=finder(arr[node].b,val) if(arr[node].val==1): return a+b-a*b else: return a*b t=int(input()) while(t>0)...

0.629351

# cook your dish here for _ in range(int(input())): n,m = list(map(int,input().split())) colors = [0]*41; cost = [0]*41 color = 0 for i in range(n): cc,pp = list(map(int,input().split())) colors[cc] += 1 cost[cc] += pp for i in colors: if i>0: color += 1 dp2 = [[0...

0.629233

n = int(input()) vs = [int(x) for x in input().split()] ts = [int(x) for x in input().split()] sumt = 0 for i, t in enumerate(ts): vs[i]+=sumt sumt+=t vs.sort() tl, tr = 0, 0 il, ir = 0, 0 for ind, t in enumerate(ts): #check tl = tr tr += t while ir < n and vs[ir] <= tr: ir += 1 cur_sum = 0 ...

0.628312

from cmath import rect import sys import math from functools import reduce class SegmentTree(): def __init__(self, L, function = lambda x,y: x+y): self.function = function N = self.size = len(L) M = 1 << N.bit_length() self.margin = 2*M - N self.L = [None for i in range(self...

0.626454

'''Well I found the bug, but I don't understand why it was doing that. I mean, as far as I can tell, it shouldn't be a bug! Note to self: deleting from (supposedly) local lists through recursion is dangerous!''' class Group(object): def __init__(self,size,start,end,value): self.size = size self.sta...

0.62608

n = int(input()) + 1 a = list(map(int, input().split())) + [1 << 50] l, p, r = [0] * n, list(range(n)), [] for i in range(int(input())): t = list(map(int, input().split())) if t[0] == 2: r.append(l[t[1] - 1]) else: x = t[1] - 1 s, d = [x], t[2] while True: if p[x...

0.625218

import sys input = sys.stdin.readline def main(): x, y = list(map(int, input().split())) clst = list(map(int, input().split())) clst[0] = min(clst[0], clst[5] + clst[1]) clst[1] = min(clst[1], clst[0] + clst[2]) clst[2] = min(clst[2], clst[1] + clst[3]) clst[3] = min(clst[3], clst[2] + clst[4])...

0.621532

t=int(input()) while(t): n=int(input()) l=[] for i in range(n): l.append(list(map(int,input().split()))); m=[] for i in l: m.append((i[1]//(i[0]+1))*i[2]) res=max(m) print(res) t=t-1

0.619152

from queue import Queue import sys cost = [] def readarray(): return list(map(int, input().split(' '))) n = int(input()) graph = [[] for i in range(n)] for i in range(n - 1): u, v, c = readarray() u, v = u - 1, v - 1 cost.append(c) graph[u].append((v, i)) graph[v].append((u, i)) order = [] used = [0] * n q...

0.618634

import sys n = eval(input()) parents = [int(x)-1 for x in input().split(' ')] values = list(map(int , input().split(' '))) parents = [0]+parents # print(parents) # print(values) def single_node_cost(i): cost = 0 # print('started with ',i) min_value = sys.maxsize while i != 0: min_value = min(min_value,values[i]) ...

0.618005

def subsolve(a): c = 0 m = 0 for i in a: c += i if c < 0: c = 0 m = max(m, c) return m def solve(): n = int(input()) a = list(map(int, input().split())) s = 0 for i in range(0, n, 2): s += a[i] u = subsolve([a[i] - a[i - 1] for i in range(1...

0.616252

import sys sys.setrecursionlimit(10000000) def mergeSortInversions(arr): if len(arr) == 1: return arr, 0 larr=len(arr) a = arr[:larr//2] b = arr[larr//2:] a, ai = mergeSortInversions(a) b, bi = mergeSortInversions(b) c = [] i = 0 j = 0 inversions = 0 + ai + bi la=len(a) while i < la and j < ...

0.615521

# cook your dish here def __starting_point(): try: for _ in range (int(input())): element = int(input()) l = list(map(int,input().split())) a=min(l) l.remove(a) b=min(l) print(a+b) except EOFError : print('EOFError') __starting_point()

0.61492

from heapq import heappop, heappush n , q = map(int,input().split()) enzi = [[0,0] for i in range(n)] youti = [[] for i in range(2*10**5)] saikyo = [0 for i in range(2*10**5)] ans = [] for i in range(n): a , b = map(int,input().split()) enzi[i] = [a,b-1] heappush(youti[b-1],(-a,i)) for i in range(2*10**5)...

0.614314

3 import math import os import sys DEBUG = 'DEBUG' in os.environ def inp(): return sys.stdin.readline().rstrip() def dprint(*value, sep=' ', end='\n'): if DEBUG: print(*value, sep=sep, end=end) INF = 10 ** 20 def solve(N, A, B): dp = {A[0]: 0, A[0] + 1: B[0], A[0] + 2: B[0] * 2} for i...

0.614231

for i in range(int(input())): n=int(input()) chef=0 ans=[] for i in range(0,n): l=list(map(int,input().split())) c=l[0] if c%2==0: for i in range(1,len(l)//2+1): chef=chef+l[i] continue; for i in range(1,len(l)//2): chef=chef+l[i] ans.append(l[len(l)//2]) ans.sort(reverse=True) for i in ran...

0.614177

#!/usr/bin/env python3 try: while True: n = int(input()) b = list(map(int, input().split())) cur = 0 result = 0 for x in b: result += abs(cur - x) cur = x print(result) except EOFError: pass

0.613729

import sys input = sys.stdin.readline N, K = list(map(int, input().split())) nums = [] for i in range(N): t, d = list(map(int, input().split())) nums.append((d, t)) nums.sort(reverse=True) se = set() a1 = [] a2 = [] rest = [] for i, n in enumerate(nums): if i < K: if not n[1] in se: se....

0.613381

for i in range(int(input())): n=int(input()) c=[int(z) for z in input().split()] c.sort() c.reverse() b1,b2=0,0 for i in range(n): if b1<b2: b1+=c[i] elif b2<b1: b2+=c[i] else: b1+=c[i] print(max(b1,b2))

0.610574

import heapq data = int(input()) array = [int(_) for _ in input().split()] X = array[0:data] B = array[data:2*data] Y = [-_ for _ in array[2*data:3*data]] heapq.heapify(X) heapq.heapify(Y) x = [sum(X)] y = [sum(Y)] for i in range(data): x += [B[i] - heapq.heappushpop(X, B[i])] y += [-B[-1-i] - heapq.heappu...

0.609777

rd = lambda: list(map(int, input().split())) n, = rd() a = [0] + rd() + [0] for i in range(rd()[0]): x, y = rd() a[x-1] += y-1 a[x+1] += a[x]-y a[x ] = 0 print('\n'.join(map(str, a[1:1+n])))

0.608976

__author__ = 'Think' n=int(input()) aints=[int(i) for i in input().split()] permutes=[int(i)-1 for i in input().split()] results=[0] rebuilt={} m=0 for numby in range(n-1, 0, -1): p=permutes[numby] below=False above=False if p-1 in rebuilt: below=True if p+1 in rebuilt: above=True if above and below: bsum,...

0.608368

import sys from math import * def minp(): return sys.stdin.readline().strip() def mint(): return int(minp()) def mints(): return map(int, minp().split()) def add(a,b): return (a+b)%1000000007 def mul(a,b): return (a*b)%1000000007 def sub(a,b): return (a-b+1000000007)%1000000007 def qpow(a, b): r = 1 k = ...

0.60788

from sys import * from math import * mod = 1000000000 f = [0 for i in range(200)] f[0] = f[1] = 1 for i in range(2, 200): f[i] = f[i - 1] + f[i - 2] n, m = stdin.readline().split() n = int(n) m = int(m) a = list(map(int, stdin.readline().split())) for i in range(m): tp, x, y = stdin.readline().split() tp = int(t...

0.607745

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline mii=lambda:list(map(int,input().split())) for _ in range(int(input())): n,d=mii() a=list(mii()) ans=0 for i in range(n): while d>=i and a[i]: a[i]-=1 ans+=1 d-=i print(ans)

0.607721

for tcase in range(int(input())): n=int(input()) ls = list(map(int, input().split())) oneneed = 2*(n - ls.count(1)) ldct = {0:0} ctr = 0 eaten = 0 for i in range(n-1,-1,-1): eaten += 1 ctr += (1 if ls[i] == 2 else -1) if ctr not in ldct: ldct[ctr] = eaten ...

0.6075

from math import sqrt def get_distance(x1,y1,x2,y2): return sqrt((x1-x2)**2 + (y1-y2)**2) T = int(input()) ans = [] for _ in range(T): blank = input() N = int(input()) C = [[] for i in range(10**4+1)] for i in range(N): x,y = [int(i) for i in input().split()] C[x].append(y) ...

0.607383

def ans(l): s = "" i = 0 while (i < len(l)): temp = l[i] k = temp[1] if (k != 0): s += str(temp[0]) + "x^" + str(k) else: s += str(temp[0]) i += 1 if (i < len(l)): s += " + " if (len(s) > 0): return s else: return "0" test = int(input()) while (test != 0): test -= 1 N = int(input()) l...

0.607103

from math import sqrt class pro(object): def __init__(self,dif,sc): self.dif=dif self.sc=sc def __lt__(self,other): return self.dif>other.dif T=int(input()) mul=[1] for i in range(100): mul.append(mul[i]*10/9) inf=1000000007 for t in range(T): n=int(input()) effi,tim=list(m...

0.607038

n, m = map(int, input().split()) a = list(map(int, input().split())) c = list(map(int, input().split())) mc = sorted(((y, x) for x, y in enumerate(c)), reverse=True) for _ in range(m): t, d = map(int, input().split()) t -= 1 if a[t] >= d: print(c[t] * d) a[t] -= d else: x = a[t] ...

0.606094

from collections import deque def rollingmax(x, y, r, a): k = 2 * r + 1 d = deque() lx = len(x) for i in range(lx + r): if i < lx: while d and d[-1][1] <= x[i]: d.pop() d.append((i, x[i])) while d and d[0][0] <= i - k: d.popleft() ...

0.605502

# cook your dish here t=int(input()) while(t>0): n=int(input()) b=[int(x) for x in input().split()] p=[float(x) for x in input().split()] s=[0]*(10) yet=2 mx=0 for i in range(n): st=bin(b[i]) rng=len(st)-2 if(rng+2>yet): for ml in range(rng+2-yet): s.append(0) if(rng>mx): mx=rng for k in rang...

0.60516

from collections import defaultdict def __starting_point(): n, T = [int(_) for _ in input().split()] data = defaultdict(list) for i in range(n): t, q = [int(_) for _ in input().split()] data[T - t].append(q) prev_level = [] for level_id in range(1, T + 1): level = sorted(d...

0.60479

from sys import stdin def bitadd(a,w,bit): x = a while x <= (len(bit)-1): bit[x] += w x += x & (-1 * x) def bitsum(a,bit): ret = 0 x = a while x > 0: ret += bit[x] x -= x & (-1 * x) return ret class RangeBIT: def __init__(self,N,indexed): self...

0.604396

for _ in range(int(input())): a=list(map(int,input().split())) num=0 den=0 k=1 great=0 for i in a: if i==-1:break else: if i>30:great+=1 if i%2==0: num+=k*i den+=k k+=1 print(great,'%.2f'%(num/d...

0.603212

# returns answer to the subproblem with interval range [start, end], # but with a total of "extra" additional stuff on the end # that must be deleted last. memo = {} def f(dat, rewards, start, end, extra): curr = (start, end, extra) if curr in memo: return memo[curr] if start > end: re...

0.603199

# cook your dish here # cook your dish here for _ in range(int(input())): n=int(input()) l=list(map(int, input().split())) l.insert(0, 0) l1=[0]*(n+1) l1[1]=l[1] for i in range(2, n+1): l1[i]=max(l1[i-1]+l[i]*i, l1[i-2]+l[i-1]*i+l[i]*(i-1)) print(l1[-1])

0.603025

for __ in range(int(input())): n = int(input()) ar = [] for ________ in range(n): ar.append(list(map(int, input().split()))) ar.sort(key=lambda x: x[1]) num1 = ar[0][1] ar.sort(key=lambda x: -x[0]) num2 = ar[0][0] print(max(0, num2 - num1))

0.602652

import sys def input(): return sys.stdin.readline().strip() def iinput(): return int(input()) def rinput(): return list(map(int, sys.stdin.readline().strip().split())) def get_list(): return list(map(int, sys.stdin.readline().strip().split())) t=iinput() for _ in range(t): n=iinput() p=[] mi=[] for i in...

0.601755

from sys import * T = int(stdin.readline()) t = [int(s) for s in stdin.readline().split(' ')] a = [] for i in range(T - 1, -1, -1): if i % 2 == 0: a += [(e[0], -e[1]) for e in a] a = [(e[0] - t[i], e[1]) for e in a] a += [(- x - 1, 0) for x in range(t[i])] a = list(set(a)) if...

0.601133

n = int(input()) r = [[] for i in range(n + 1)] r[1] = [0] for i in range(n - 1): a, b = map(int, input().split()) r[a].append(b) r[b].append(a) t = list(map(int, input().split())) u, v = [0] * (n + 1), [0] * (n + 1) for i, j in enumerate(t, 1): if j < 0: u[i] = - j else: v[i] = j t, p = [1], [0] * ...

0.600687

# cook your dish here def isValid(mid): time = 0.0 for i in range(n): if time < c[i]: time = c[i] time += mid # cannon cooling elif time >= c[i] and time <= c[i] + d: time += mid # cannon cooling else: return False return True t = int(input()) while t != 0: n, d = list(map(int, input().split())) ...

0.600613

for _ in range(int(input())): n=int(input()) s=list(input()) coord=list(map(int,input().split())) p=0 i=0 h=[] for i in range(0,n): if s[i]=='1': h.append(i) if h[0]!=0: p=p+coord[h[0]]-coord[0] if h[len(h)-1]!=n-1: p=p+coord[n-1]-coord[h[len(h)-1]] for j in range(0,len(h)-1): if h[j]+1==h[j+1]: ...

0.600047

import sys n,m=list(map(int,sys.stdin.readline().split())) L=list(map(int,sys.stdin.readline().split())) c=0 Ans="" for i in range(m): x=list(map(int,sys.stdin.readline().split())) if(x[0]==1): L[x[1]-1]=x[2]-c elif(x[0]==2): c+=x[1] else: Ans+=str(L[x[1]-1]+c)+"\n" sys.stdout.w...

0.598729

n=int(input()) pos=[] neg=[] for _ in range(n): x,a=list(map(int,input().split())) if x > 0: pos.append((x, a)) else: neg.append((-x, a)) pos=[a for x,a in sorted(pos)] neg=[a for x,a in sorted(neg)] if len(pos)==len(neg): print(sum(pos)+sum(neg)) else: if len(pos)<len(neg): ...

0.598636

from math import * from collections import * import sys input=sys.stdin.readline t=int(input()) while(t): t-=1 n=int(input()) a=list(map(int,input().split())) p,q=map(int,input().split()) s=0 a.sort() for i in range(n//2): x=a[i] x1=a[n-i-1] if(x==p or ...

0.597587

a=eval(input()) while(a): x=eval(input()) b=list(map(int,input().split())) z=[0]*100 k=1 j=0 c=0 for i in b: if i==0: z.insert(i,k) else: if z[z.index(i)+1]==0: z.insert(j,k) else: m=z.index(i) n=m+1 p=(len(z)-z.count(0))-n c=c+min(n,p) z.insert(m+1,...

0.597436

# cook your dish here t = int(input()) for _ in range(t): n = int(input()) a = [] b = [] for i in range(n): x,y = list(map(int, input().split())) a.append(x) b.append(y) b.sort() xcor = [] xcor.append(a[1]-a[0]) xcor.append(a[n-1]-a[n-2]) for i in range(1,n-1): xcor.append(a[i+1]-a[i-1]) xcor.sort() ...

0.596608

f = lambda: map(int, input().split()) m = 1000000007 d, n = f() t = list(f()) p = [[] for i in range(n)] for j in range(n - 1): u, v = f() u -= 1 v -= 1 p[u].append(v) p[v].append(u) def g(u, x, a, b, q): k = 1 for v in p[u]: if a < t[v] <= b or t[v] == a and v > q: if ...

0.59554

p, n = [], int(input()) a = b = 0 for i in range(n): t = list(map(int, input().split())) k = t[0] // 2 + 1 a += sum(t[1: k]) if t[0] & 1: p.append(t[k]) b += sum(t[k + 1: ]) else: b += sum(t[k: ]) p.sort(reverse = True) print(a + sum(p[0 :: 2]), b + sum(p[1 :: 2]))

0.594271

import sys import threading from bisect import bisect_left n = int(input()) a = list(map(int, input().split())) e = {} g = [[] for i in range(n)] d = [0]*(n+5) ans = [0]*n p = [0]*(n+5) for i in range(n-1): c, w = map(int, input().split()) c-= 1 g[c].append(i+1) e[i+1] = w ...

0.593899

q=int(input()) s=input().split() a=[int(s[1])] sum1=a[0] pos=-1 mean=sum1 fin='' for i in range(q-1): n=len(a) s=input().split() if(s[0]=='1'): a.append(int(s[1])) sum1+=(a[-1]-a[-2]) mean=sum1/(pos+2) n=len(a) #print(sum1,pos,i+1) while(pos<n-2 and a[pos...

0.593865

def LIHW(h): return [list(map(int, input().split())) for _ in range(h)] N = int(input()) X = LIHW(N-1) for i in range(N-1): time = [0]*N time[i] = X[i][1]+X[i][0] for j in range(i+1, N-1): if time[j-1] <= X[j][1]: time[j] = X[j][1]+X[j][0] else: if (time[j-1]-X...

0.593252

N=int(input()) A=list(map(int,input().split())) SUM=abs(A[0]) for i in range(N): if i < N-1: SUM += abs(A[i+1]-A[i]) else: SUM += abs(0-A[i]) now=0 for i in range(N): if i != N-1: diff = abs(A[i+1]-now)-abs(A[i]-now)-abs(A[i+1]-A[i]) now = A[i] else: diff = abs(0-now)-abs(A[i]-now)-abs(0-A...

0.592789

import sys input=sys.stdin.readline for _ in range(int(input())): n = int(input()) t = sorted(map(int,input().split())) cur = [0]*(2*n) for i in range(n): low = high = t[i] while low and cur[low]: low -= 1 while cur[high]: high += 1 if low > 0 and ...

0.592501

def treeProduct(num, h, root, ch): if ch >= h: return num[root] left = (root * 2) + 1 right = (root * 2) + 2 ret1 = treeProduct(num, h, left, ch + 1) ret2 = treeProduct(num, h, right, ch + 1) return num[root] * max(ret1, ret2) def main(): n = int(input()) while n!=0: line = str(input()) s = line.split...

0.591028

class Solution: def deleteAndEarn(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums);#count is a dict [3,4,2]--> {2:1,3:1,4:1} prev = None; avoid = using = 0; for k in sorted(count): temp = ma...

0.590917

import sys t = int(sys.stdin.readline()) for _ in range(t): n = int(sys.stdin.readline()) intervals = [None]*n for i in range(n): intervals[i] = tuple([int(a) for a in sys.stdin.readline().split()]) intervals = list(zip(intervals, list(range(n)))) starts = sorted(intervals, key = lambda x:...

0.590439

import sys input = sys.stdin.readline t = int(input()) for test in range(t): if test: input() n, m = list(map(int, input().split())) a = [-1] * m b = [-1] * m for i in range(m): a[i], b[i] = list(map(int, input().split())) l = [(a[i],0,i) for i in range(m)] + [(b[i],1,i) for i...

0.589587

import sys input = sys.stdin.readline q=int(input()) for testcase in range(q): n=int(input()) A=sorted(set(map(int,input().split())),reverse=True) L=len(A) #print(A) ANS=A[0] for i in range(L): NOW0=A[i] NOW1=0 flag=0 for j in range(i+1,L): if NOW0%...

0.589562

for i in range(int(input())): n = int(input()) c = list(map(int, input().split())) d = {} d[0] = -1 parity = 0 ans = 0 for i in range(n): parity ^= 1 << (c[i]-1) for t in range(30): x = parity^(1<<t) if(x in d.keys()): ans = max(ans, i - d[x]) if parity not ...

0.589095

t=eval(input()) for i in range(0,t): x=input() nm=x.split(' ') nm[0]=int(nm[0]) nm[1]=int(nm[1]) csoint=[] lsoint=[] csofloat=[] lsofloat=[] for j in range(0,nm[0]): a=input() b=a.split(' ') b[0]=int(b[0]) b[1]=int(b[1]) csoint.append(b[0]) ...

0.588606

# cook your dish here T = int(input()) for i in range(T): N,data,D,People = int(input()),list(map(int,list(input()))),int(input()),list(map(int,input().split())) data.insert(0,"|"),data.append("|") infected = [] for i in range(1,N+1): if(data[i]==1): infected.append(i) ...

0.588539

from sys import setrecursionlimit setrecursionlimit(10 ** 9) def solve(i, j, c=0): if i > j: return 0 if (i, j) in dp: return dp[i, j] x0 = solve(i+1, j, c^1) x1 = solve(i, j-1, c^1) if c == 0: y = 1 << (j - i) x0 += a[i] * y x1 += a[j] * y dp[i, j] = x0 + x1 return dp[i, j] for _ in range(int(in...

0.588353

# cook your dish here number = int(input()) for i in range(number): a = list(input()) for k in range(len(a)): a[k] = eval(a[k]) print(sum(a))

0.588233

# cook your dish here #Moony and ICPC team T = int(input()) for i in range(T): N,data = int(input()),list(map(int,input().split())) if(N==3): print(sum(data)) else: best = data[0]+data[1]+data[2] overall = best k=len(data) for i in range(1,k-2): ...

0.587478

# cook your dish here mod = 10**9 + 7 from math import gcd def fac50(): f = [0]*51 f[0] ,f[1] = 1,1 for i in range(1,51):f[i] = (f[i-1]*i)%mod return f def gcd110(): gc = [[0]*111 for i in range(111)] for i in range(111): for j in range(111):gc[i][j] = gcd(i,j) return gc factorials,g...

0.585999

import sys input = sys.stdin.readline from bisect import bisect_right as br P = 10**9+7 N = int(input()) X = [] maxinn = 0 for _ in range(N): a, b = list(map(int, input().split())) maxinn = max(maxinn, b) X.append((a, b)) X = sorted(X) OUT = [0] VOL = [0] CNT = [1] for out, inn in X: i = br(OUT, inn) -...

0.584831

def f(a,n): l,r,s1,s2 = [0]*n, [0]*n, [], [] for i in range(n): count = 1 while(len(s1)>0 and a[i]<s1[-1][0]): count += s1[-1][1] s1.pop() s1.append((a[i],count)) l[i] = count for i in range(n-1,-1,-1): count = 1 while(len(s2)>0 and a[i]<=s2[-1][0]): count...

0.584483

n=int(input()) l=[] for i in range(n): l.append([int(x) for x in input().split()]) d=[10**9]*(n) q=set([int(x) for x in range(1,n)]) d[1]=0 #print(q) def extract(): mini=10**9 o=0 for i in range(1,len(d)): if d[i]<mini and i in q: mini=d[i] o=i q.remove(o) return o while len(q)!=0: x=ex...

0.584427

# cook your dish here t = int(input()) while t: t -= 1 n = int(input()) arr = list(map(int, input().split())) sumi = sum(arr) prev = 1 for i in range(n): arr[i] = min(arr[i], prev) prev = arr[i] + 1 prev = 1 for i in range(n - 1, -1, -1): arr[i] = min(arr[i], prev) prev = arr[i] + 1 temp = 0 for i in...

0.583962

Let's call an array $a_1, a_2, \dots, a_m$ of nonnegative integer numbers good if $a_1 + a_2 + \dots + a_m = 2\cdot(a_1 \oplus a_2 \oplus \dots \oplus a_m)$, where $\oplus$ denotes the bitwise XOR operation. For example, array $[1, 2, 3, 6]$ is good, as $1 + 2 + 3 + 6 = 12 = 2\cdot 6 = 2\cdot (1\oplus 2 \oplus 3 \oplu...

for nt in range(int(input())): n=int(input()) l=list(map(int,input().split())) s=sum(l) e=l[0] for i in range(1,n): e=e^l[i] if s==2*e: print(0) print () else: print(2) print(e,s+e)

0.750854

def solve(): n = int(input()) lst = list(map(int,input().split())) if sum(lst) <= n // 2: print(n//2) print("0 " * (n // 2)) else: print(n//2 + (n // 2) % 2) print("1 " * (n//2 + (n // 2) % 2)) for i in range(int(input())): solve()

0.741568

import sys input = lambda: sys.stdin.readline().rstrip() T = int(input()) for _ in range(T): N = int(input()) A = [int(a) for a in input().split()] if max(A) == min(A): print(1) print(*([1] * N)) elif N % 2 == 0: print(2) print(*([1, 2] * (N // 2))) else: ...

0.719758

import itertools from collections import defaultdict as dfd def sumPairs(arr, n): s = 0 for i in range(n-1,-1,-1): s += i*arr[i]-(n-1-i)*arr[i] return s def subarrayXor(arr, n, m): ans = 0 xorArr =[0 for _ in range(n)] mp = dfd(list) xorArr[0] = arr[0] for i in range(1, n): xorArr[i] = xorArr[i - 1] ^ ar...

0.709901

# cook your dish here import math; from math import gcd,sqrt,floor,factorial,ceil from bisect import bisect_left,bisect_right import bisect; import sys; from sys import stdin,stdout import os sys.setrecursionlimit(pow(10,7)) import collections from collections import defaultdict,Counter from statistics import median # ...

0.691987

for _ in range(int(input())): n = int(input()) a = list(map(int,input().split())) ans = 0 count = 0 for i in a: if i>0: ans+=i count+=1 res = [] for i in range(count): if a[i]<=0: res.append(i+1) for i in range(count,n): if a[i]>0: res.append(i+1) print(ans) print(len(res),*res)

0.684725

import sys input = sys.stdin.readline t=int(input()) for test in range(t): n=int(input()) A=list(map(int,input().split())) ANS=[] SET=set() NOW=1 while not (NOW in SET): ANS.append(NOW) SET.add(NOW) NOW=NOW-A[NOW-1] x=ANS.index(NOW) print(len(ANS[x:])) pr...

0.683785

T= int(input()); for i in range(T): n,k = list(map(int,input().split())); s=list(map(int,input())); if k==1: s_0 ={}; s_1={}; c0=0; c1=0; for j in range(n): if(j%2==0): s_1[j]=1; s_0[j]=0; else: s_1[j]=0; s_0[j]=1; for j in range(n): if(s_0[j]-s[j]!=0): c0+=1; if(s_1[j]-...

0.678204

import sys input = sys.stdin.readline from collections import Counter t=int(input()) for testcases in range(t): n=int(input()) P=list(map(int,input().split())) C=Counter(P) PLIST=sorted(set(P),reverse=True) g=C[PLIST[0]] s=0 b=0 sflag=1 for i in PLIST[1:]: if sflag: ...

0.678089

for i in range(int(input())): n = int(input()) c = list(map(int, input().split())) d = {} d[0] = -1 parity = 0 ans = 0 for i in range(n): parity ^= 1 << (c[i]-1) for t in range(30): x = parity^(1<<t) if(x in d.keys()): ans = max(ans, i - d[x]) if parity not ...

0.678041

buck = [[0, 0] for i in range(2201)] m = int(input()) for i in range(m): a = int(input()) ok = True br = 0 for j in range(2200, -1, -1): if a & (1 << j): if(buck[j][0]): a ^= buck[j][0] br ^= buck[j][1] else: ok = False ...

0.670294

# cook your dish here for _ in range(int(input())): n=int(input()) a=list(map(int,input().split())) even=[] odd=[] for i in a: if(i & 1): even.append(i) else: odd.append(i) print(len(even)*len(odd))

0.668698

from sys import setrecursionlimit setrecursionlimit(10 ** 9) def solve(i, j, c=0): if i > j: return 0 if (i, j) in dp: return dp[i, j] x0 = solve(i+1, j, c^1) x1 = solve(i, j-1, c^1) if c == 0: y = 1 << (j - i) x0 += a[i] * y x1 += a[j] * y dp[i, j] = x0 + x1 return dp[i, j] for _ in range(int(in...

0.666554

for tcase in range(int(input())): n=int(input()) ls = list(map(int, input().split())) oneneed = 2*(n - ls.count(1)) ldct = {0:0} ctr = 0 eaten = 0 for i in range(n-1,-1,-1): eaten += 1 ctr += (1 if ls[i] == 2 else -1) if ctr not in ldct: ldct[ctr] = eaten ...

0.665323

t = int(input()) for _ in range(t): n = int(input()) a = list(map(int, input().split())) counts = [0] * 32 for x in a: counts[len(bin(x))-2] += 1 total = 0 for count in counts: total += count * (count-1) // 2 print(total)

0.664804

# cook your dish here try: for i in range(int(input())): n=int(input()) l=[int(j) for j in input().split()][:n] d={} for j in l: d[j]=d.get(j,0)+1 a=len(d) c=0 for j in list(d.keys()): while(d[j]>=3): d[j]=(d[j]//3)+(d[j]%3) if(d[j]==2): c=c+1 if(c&1): s=0 for j in list(d.values(...

0.664453

# cook your dish here # cook your dish here test=int(input()) for _ in range(test): n=int(input()) a=[(bin(int(x))[2:][::-1]+("0")*32)for x in input().split()] res="" mysum=0 for i in range(32): mycount=0 for j in range(n): if(a[j][i]=="0"): mycount+=1 if(mycount==n): break if(mycount>(n//2)): ...

0.664331

def possible(a): ans = set() s = set() lmax = 0 for i in range(len(a)): lmax = max(lmax, a[i]) s.add(a[i]) if lmax == i + 1 and len(s) == i + 1: ans.add(i + 1) return ans t = int(input()) for case_num in range(t): n = int(input()) a = list(map(int, input...

0.659578

# cook your dish here from sys import stdin, stdout for _ in range(int(stdin.readline())): n, q = list(map(int, stdin.readline().split())) arr = list(map(int, stdin.readline().split()))[:n] od = ev = 0 for i in arr: if bin(i).count('1')%2==0: ev += 1 else: od += 1 for _ in range(q): p = int(stdin.read...

0.657219

from fractions import Fraction import bisect import os from collections import Counter import bisect from collections import defaultdict import math import random import heapq as hq from math import sqrt import sys from functools import reduce, cmp_to_key from collections import deque import threading from itertools im...

0.654366

import sys input=sys.stdin.readline #t=1 t=int(input()) for _ in range(t): n=int(input()) s=input().rstrip() s=[s[-i-1] for i in range(n)] ans=[] zero=[] one=[] res=[-1]*n pos=0 while s: b=s.pop() if b=="0": if not one: new=1 ...

0.65322

# cook your dish here a=int(input()) p=list(map(int,input().split())) for n in p: # n=int(input()) a=[1] b=[2] c=[4] d=[3] j=1 k=1 for i in range(n-1): a.append(a[i]+3*(j)) b.append(b[i]+3*(j)) c.append(c[i]+6*(j)) d.append(d[i]+3*(j)) j*=2 ...

0.651408

from sys import stdin def gt(num): if num: return num return 0 for __ in range(int(stdin.readline().split()[0])): n = int(stdin.readline().split()[0]) a = list(map(int, stdin.readline().split())) cnta = dict() cnta.setdefault(0) cntb = dict() cntb.setdefault(0) for i in a: cnta[i] = gt(cnta.get(i)) + 1 as...

0.644793

mod=10**9+7 def pow2(x): p,n=1,2 while(x): if(x & 1): p=((p%mod) * (n%mod))%mod n=((n%mod) * (n%mod))%mod x//=2 return p def count_bit(val): bit=0 while(val): bit+=1 val &=(val-1) return bit def answer(): val=b[0] po2=0 for i in range(1,len(b)): if(val > b[i]):return 0 po2+=count_bit(val ...

0.643943

# cook your dish here def index(n,val): while(val >= n): val = val//2 return n - val t = int(input()) for _ in range(t): n = int(input()) arr = list(map(int,input().split())) new = [0 for i in range(n)] for i in range(n): if arr[i]<=n : new[i] = arr[i] + arr[arr[i]-1...

0.643187

from sys import stdin,stderr def rl(): return [int(w) for w in stdin.readline().split()] def solve(n, b): f = [True for i in range(2*n+1)] for x in b: if not f[x]: return [-1] f[x] = False a = [] for x in b: a.append(x) for y in range(x+1, 2*n+1): ...

0.642036

import math def findnumber(l,n): l.sort() x = l[0] * l[-1] vec = [] i = 2 while (i*i)<=x: if x%i==0: vec.append(i) if x//i !=i: vec.append(x//i) i = i + 1 vec.sort() if len(vec)!=n: return -1 else: j = 0 ...

0.639229

for _ in range(int(input())): n = int(input()) wt = list(map(int, input().split())) count = {} for x in wt: if x not in count: count[x] = 0 count[x] += 1 k = 0 for s in range(101): temp = 0 temp2 = 0 for x in count: if (s - x) in c...

0.636697

""" 4 4 4 3 1 2 6 1 2 2 1 3 1 5 10 1 2 10 5 4 1 2 1 2 """ tests = int(input()) for _ in range(tests): n = int(input()) ls = list(map(int, input().split())) if ls[0] < ls[1]: ls[0] = -ls[0] if ls[-1] < ls[-2]: ls[-1] = -ls[-1] for i in range(1, n - 1): if ls[i] < ls[i - 1] and ls[i] < ls[i + 1]: ls[i]...

0.633404

# cook your dish here for _ in range(int(input())): n=int(input()) l1=[] l2=[] for i in range(n): s=input() a=s[ :n//2].count('1') b=s[n//2: ].count('1') if a>b: l1.append(a-b) elif a<b: l2.append(b-a) p=sum(l1) q=sum(l2) if p==q: print(0) elif p>q: diff=p-q flag=0 for i i...

0.632573

for __ in range(int(input())): a = list(map(int, input())) ar1 = [] ar2 = [] for elem in a: if elem % 2 == 0: ar1.append(elem) else: ar2.append(elem) ans = [] i = 0 j = 0 while i < len(ar1) and j < len(ar2): if ar1[i] < ar2[j]: ...

0.632256

# cook your dish here from sys import stdin, stdout from collections import defaultdict for _ in range(int(stdin.readline())): n=int(stdin.readline()) lst=list(map(int, stdin.readline().split())) prefix_odd=[0]*n prefix_even=[0]*n odd_val=0 even_val=0 for i in range(n): if lst[i]%2==...

0.631682

class BIT(): def __init__(self,n): self.BIT=[0]*(n+1) self.num=n def query(self,idx): res_sum = 0 while idx > 0: res_sum += self.BIT[idx] idx -= idx&(-idx) return res_sum #Ai += x O(logN) def update(self,idx,x): while idx <= self....

0.631614

for i in range(int(input())): print(2*(sum(list(map(int, input().split())))-1))

0.630189

# cook your dish here t = int(input()) res = [] for i in range(t): n = int(input()) arr = [int(i) for i in input().split()] num_2 = 0 num = 0 for j in range(len(arr)): if arr[j] == 2: num_2 += 1 if arr[j] > 2: num += 1 res.append(num_2 * num + (num * (num - 1)) // 2) for z in res: print(...

0.627993

t=int(input()) for q in range(t): n=int(input()) x=list(map(int,input().split())) dic={} dic2={} for i in range(n): dic2[x[i]]=1 #print dic2 if len(dic2)==n: n+=2 print((n*(n-1)*(n-2)*(n-3))/24) continue counter=0 for i in range(n-1): if x[i] in dic: dic[x[i]]+=1 else: dic[x[i]]=1 for j in...

0.6267

t=int(input()) for i in range(0,t): n=int(input()) lis=list(map(int,input().split())) lis2=[] for j in range(0,10): lis2.append(0) for j in range(0,len(lis)): lis2[lis[j]]+=1; s=sum(lis) while s%3!=0: if s%3==2: if lis2[2]>=1: lis2[2]-=1 s=s-2 elif lis2[5]>=1: lis2[5]-=1 s=s-5 elif...

0.626174

# cook your dish here for test in range(int(input())): n = int(input()) ar = list(map(int, input().split())) count = 0 for item in ar: if bin(item)[-1] == '0': count += item print(count)

0.625509

T = int(input()) for test in range(T): n,t = list(map(int,input().split())) a = list(map(int,input().split())) res = [] j=0 for i in a: if(i*2<t): res+=["0"] elif(i*2>t): res+=["1"] else: res.append(["0","1"][j]) j = 1-j pri...

0.625367

test=int(input()) for i in range(test): n=int(input()) a=list(map(int,input().split())) b=[0]*(n+2) b[n-1]=1 for i in range(n-2,-1,-1): if(a[i]*a[i+1]<0): b[i]=b[i+1]+1 else: b[i]=1 for i in range(n): print(b[i], end=' ') print()

0.624636

for test in range(int(input())): n = int(input()) a = list(map(int, input().split())) for i in range(0, n, 2): a1 = a[i] a2 = a[i + 1] print(-a2, a1, end=" ") print()

0.624339

def ugcd(n): ans = [[1]] if(n==1): return ans elif(n%2==1): ans = [[1, 2, n]] else: ans = [[1, 2]] for k in range(1, int(n//2)): ans.append([k*2+1, k*2+2]) return ans t = int(input()) for i in range(t): n = int(input()) s = (ugcd(n)) print(len(s)) for j in range(len(s...

0.62381

for i in range(int(input())): n=int(input()) l1=list(map(int,input().split())) type1=0 type2=0 ans=0 for item in l1: if item%3==0: ans+=1 elif item%3==1: type1+=1 else : type2+=1 x=min(type1,type2) ans+=x type1-=x type2-...

0.623248

import sys input=sys.stdin.readline for _ in range(int(input())): n = int(input()) t = sorted(map(int,input().split())) cur = [0]*(2*n) for i in range(n): low = high = t[i] while low and cur[low]: low -= 1 while cur[high]: high += 1 if low > 0 and ...

0.623042

# fast io import sys def fop(s): sys.stdout.write(str(s)+'\n') def fip(): return sys.stdin.readline() fintinp = lambda : int(fip()) def flistinp(func= int): return list(map(func,fip().split())) def fnsepline(n,func=str): return [func(fip()) for _ in range(n)] #-------------------code------------------------ def even(...

0.621748

for _ in range(int(input())): # n, x = map(int, input().split()) n = int(input()) arr = list(map(int, input().split())) ans = [arr[0]] for i in range(1, n - 1): if arr[i - 1] < arr[i] and arr[i] > arr[i + 1]: ans.append(arr[i]) elif arr[i - 1] > arr[i] and arr[i] < arr[i ...

0.620157

T = int(input()) for t in range(T): n = int(input()) s = 1 nxt = 2 x = [1] while n > s: diff = n-s if diff <= nxt: x.append(diff) break x.append(nxt) s += nxt nxt *= 2 x.sort() ans = '' for i in range(len(x)-1): v = x[i+1]-x[i] ans += str(v)+' ' print(len(x)-1)...

0.618953

import math as ma import sys from decimal import Decimal as dec from itertools import permutations def li(): return list(map(int , input().split())) def num(): return map(int , input().split()) def nu(): return int(input()) t=nu() for it in range(t): k=nu() a=li() s=sum(a) zz=[] for i in range(7): pp=...

0.618671

def check(l,n): m = 0 for i in range(n-1): x = l[i] c = 0 j = i while (j+2<n and l[j+2]==x) or (j+1<n and l[j+1] == x): if l[j+1] == x: j = j+1 else: j+=2 c+=1 if m<c: m = c return m t = ...

0.618447

# cook your dish here t=int(input()) for i in range(t): n=int(input()) if n<101: l1=[] l2=[] d=dict() for i in range(1,2*n+1): if i%2==0: l1.append(int(input())) else: l2.append(str(input())) r1=[] for i in l1: r1.append(i) l1.sort() ind=[] for i in l1: a=r1.index(i) ind.appen...

0.618054

# cook your dish here t=int(input()) j=0 while j<t: n=int(input()) lst=list(map(int,input().split())) s=set() d=list() for i in lst: if i in s: s.remove(i) d.append(i) else: s.add(i) x=len(d) if x%2==0: print(x//2) else: ...

0.616939

for _ in range(int(input())): n=int(input()) s=input() a="" b="" flag=1 for i in s: if flag: if i=="2": a+="1" b+="1" elif i=="1": a+="1" b+="0" flag=0 else: ...

0.616042

N = int( input() ) A = list( map( int, input().split() ) ) maxa = max( A ) def upd( ftree, x, v ): while x <= maxa: ftree[ x ] = max( ftree[ x ], v ) x += x & -x def qry( ftree, x ): res = 0 while x: res = max( res, ftree[ x ] ) x -= x & -x return res st_len = [ 0 for i in range( N ) ] ftree...

0.615649

import sys input = sys.stdin.readline t = int(input()) for _ in range(t): n = int(input()) a = list(map(int, input().split())) ans = 0 for i in range(n - 1): diff = a[i] - a[i + 1] if diff <= 0: continue else: ans = max(len(bin(diff)) - 2, ans) ...

0.615646

# cook your dish here # cook your dish here from math import log2; import sys; sys.setrecursionlimit(10 ** 7) from collections import defaultdict inf = float("inf") def find_height(node): nodes[node]=1 for i in graph[node]: nodes[node]+=find_height(i) return nodes[node] def find_sum(node): sum...

0.614468

from math import * t = int(input()) for _ in range(t): n = int(input()) a = [int(d) for d in input().split()] odd,even = 0,0 for i in range(n): if bin(a[i]).count("1")%2 == 1: odd += 1 else: even +=1 total = 0 if odd >= 3 and even >= 2: total += (odd*(odd-1)*(odd-2))//...

0.61435

for _ in range(int(input())): n = int(input()) arr = list(map(int,input().split())) a,b = 0,0 arr.sort() for i in arr: if a==i: a+=1 elif b==i: b+=1 print(a+b)

0.614184

# cook your dish here # cook your dish here import math test=int(input()) for _ in range(test): n=int(input()) l=list(map(int,input().split())) f=0 for i in range(math.ceil(n//2)): if n%2==1: f=1 break else: if l[i]!=l[i+n//2]: if min(l[i],l[i+n//2])==-1: l[i]=max(l[i],l[i+n//2]) l[i+n//2...

0.613841

# cook your dish here from math import sqrt for _ in range(int(input())): n=int(input()) sum=(n*(n+1))//2 #print(sum) if(sum%2!=0): print(0) continue m=(int((sqrt(1+4*(sum)))-1)//2) if(m*(m+1)//2==sum//2): print((((m-1)*m)//2)+n-m+((n-m-1)*(n-m))//2) else: print(n-m)

0.613658

import sys def input(): return sys.stdin.readline()[:-1] t = int(input()) for _ in range(t): n, k = map(int, input().split()) a = list(map(int, input().split())) cum = [0 for _ in range(2*k+2)] for i in range(n//2): x, y = a[i], a[n-i-1] cum[2] += 2 cum[min(x, y)+1] -= 1 cum[x+y] -= 1 cum[x+y+1] += 1 ...

0.613025

import bisect def pre(a): for p in range(n-1): if(a[p]>=a[p+1]): return p return n-1 def suf(a): for s in range(1,n): if(a[n-s]<=a[n-s-1]): return n-s return 0 t=int(input()) for _ in range(t): n=int(input()) a=list(map(int,input().split())) p=pre(a) s=suf(a) b=a[s:n] count=0 for i in ...

0.612472

# cook your dish here test_cases = int(input()) for i in range(test_cases): no_of_elements = int(input()) sequence = list(map(int, input().split())) d1 = sequence[1] - sequence[0] d2 = sequence[2] - sequence[1] d3 = (sequence[3] - sequence[0])/3 d4 = (sequence[3] - sequence[1])/2 d5 = (sequence[2] - sequence[0])...

0.612446

for _ in range(int(input())): n=int(input()) s=list(map(int,input().split())) l=s.index(1) r=n-s[::-1].index(1) ans=0 for i in range(l,r): ans+=1-s[i] print(ans)

0.612162

# cook your dish here class node: def __init__(self,a,b=0,c=0): self.val=a self.a=b self.b=c arr=[] def finder(node,val): if(arr[node].val==0): return val else: a=finder(arr[node].a,val) b=finder(arr[node].b,val) if(arr[node].val==1): return a+b-a*b else: return a*b t=int(input()) while(t>0)...

0.612065

# cook your dish here t = int(input()) while t: t -= 1 n = int(input()) arr = list(map(int, input().split())) sumi = sum(arr) prev = 1 for i in range(n): arr[i] = min(arr[i], prev) prev = arr[i] + 1 prev = 1 for i in range(n - 1, -1, -1): arr[i] = min(arr[i], prev) prev = arr[i] + 1 temp = 0 for i in...

0.611894

# cook your dish here for _ in range(int(input())): n=int(input()) ar=list(map(int,input().split())) odd=0 even=0 if n==1: print(0) continue for i in range(n): if ar[i]%2==1: odd+=1 else: even+=1 if odd>0: vo=(odd-1)*2+even else: vo=even if even>0: ve=(even-1)*2+odd else: ve=odd print(m...

0.611882

# cook your dish here import sys input=sys.stdin.readline for _ in range(int(input())): n,x=list(map(int,input().split())) l=[0] pre=[0]*(n+1) sum=0 i=1 for m in input().split(): l.append(int(m)) sum+=int(m) pre[i]=sum i+=1 dict={} k=[] i=1 while (i*i)<=x: if x%i==0: k.append(i) if (i*i)!=x: ...

0.610798

from operator import itemgetter import sys input = sys.stdin.readline MAX_A = 200 t = int(input()) for _ in range(t): n = int(input()) a = list(map(int, input().split())) ruiseki = [[0] * MAX_A for i in range(n + 1)] for i in range(n): for j in range(MAX_A): ruiseki[i + 1][j] ...

0.608869

# cook your dish here import sys def get_array(): return list(map(int , sys.stdin.readline().strip().split())) def get_ints(): return list(map(int, sys.stdin.readline().strip().split())) def input(): return sys.stdin.readline().strip() import math from collections import defaultdict from itertools import combinations_w...

0.608518

from collections import deque t=int(input()) for i in range(t): n=int(input()) N=[i for i in range(1, n+1)] w=list(map(int, input().split())) max_sweetness=max(w) sizes=[] cnt=0 for i in range(n): if w[i]!=max_sweetness: cnt+= 1 else: sizes.append(cnt) cnt=0 if cnt!=0: sizes[0]=(cnt+sizes[0])...

0.608438

def read_int(): return int(input()) def read_ints(): return list(map(int, input().split(' '))) t = read_int() for case_num in range(t): n, m = read_ints() a = [] for i in range(n): a.append(int(input(), 2)) a.sort() k = 2 ** m - n ans = (k - 1) // 2 for ai in a: i...

0.607639

from sys import stdin for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) id = list(zip(l,list(range(n)))) id.sort() val, pos = zip(*id) blok = [] cur = [pos[0]] for i in range(1,n): if val[i] == val[i-1]: cur.append(pos[i]) else:...

0.606916

def powerset(s): n = len(s) masks = [1 << j for j in range(n)] for i in range(2**n): yield [j + 1 for j in range(n) if (masks[j] & i)] def is_power2(num): return num != 0 and ((num & (num - 1)) == 0) def special(l): n = len(l) for i in range(n): lis = [i + 1] yield...

0.606452

from math import ceil t=int(input()) for i in range(t): p=int(input()) l=list(map(int,input().split())) maxx=1 for i in range(len(l)): maxx=max(maxx,l.count(l[i])) if(maxx*2>p): print(maxx) else: q=p-maxx*2 maxx+=ceil(q/2)...

0.604719

for _ in range(int(input())): n=int(input()) f=list(map(int,input().split())) sum1=f[0] d=0 i=1 while sum1!=0 and i<n: sum1=sum1-1+f[i] d+=1 i+=1 print(d+sum1)

0.604621

def treeProduct(num, h, root, ch): if ch >= h: return num[root] left = (root * 2) + 1 right = (root * 2) + 2 ret1 = treeProduct(num, h, left, ch + 1) ret2 = treeProduct(num, h, right, ch + 1) return num[root] * max(ret1, ret2) def main(): n = int(input()) while n!=0: line = str(input()) s = line.split...

0.6009

import sys rd = lambda : sys.stdin.readline().rstrip() t = int(rd()) for _ in range(t): n = int(rd()) a = list(map(int, rd().split())) b = [] res_a, res_b = 1, 1e18 a = sorted(a) i = 0 while i < n-1: if a[i] == a[i+1]: b.append(a[i]) i += 1 ...

0.600846

# cook your dish here t=int(input()) for i in range(t): n=int(input()) ar=list(map(int,input().split())) tot=0 st=0 for j in range(1,n): if(ar[j-1]>ar[j]): si=j-st c=(si*(si+1))//2 tot+=c st=j si=n-st c=(si*(si+1))//2 tot+=c print(tot)

0.599267

#=============================================================================================== #importing some useful libraries. from fractions import Fraction import sys import os from io import BytesIO, IOBase from functools import cmp_to_key # from itertools import * from heapq import * from math import gcd,...

0.598525

for _ in range(int(input())): n = int(input()) x1 = 0 x2 = 0 for i in range(1, n//2): x1 += 2**i for j in range(n//2, n): x2 += 2**j x1 += 2**n print(abs(x1 - x2))

0.598422

# import numpy as npy # idx=sorted(idx,key=functools.cmp_to_key(cmpx)) import bisect import array import functools import math n=int(input()) a=array.array('i',map(int,input().split())) s=0 q=[] q.append(0) for i in range(n): if a[i]==1: q.append(i+1) s=s+1 q.append(n+1) m=n*(n-1)//2 f=[[10000000 f...

0.598029

n=int(input()) a=list(map(int,input().split())) q=int(input()) while q>0: i=1 tot=a[0] b=list(map(int,input().split())) if b[0]==1: #p,f=map(int,raw_input().split()) a[b[1]-1]=b[2] else: #r=int(raw_input()) tot=a[0] while 1+i*b[1]<=n: tot=tot*a[i*b[1]] i=i+1 m=(str)(tot) tot=tot%1000000007 pr...

0.597394

# cook your dish here t = int(input()) while t>0: x = input().split() n = int(x[0]) k = int(x[1]) ans = 0 for i in range(n): if (k&(1<<i))!=0: ans += 2**(n-i-1) print(ans, end="\n") t -= 1

0.597319

T=int(input()) for i in range(T): N=int(input()) A=list(map(int,input().split()))[:N] l=[] for j in range(len(A)): for k in range(j+1,len(A)): l.append(A[j]+A[k]) print(l.count(max(l))/((N*(N-1))/2))

0.596976

import sys import math def main(arr,k): x=[] y=[] for e in arr: if e%2==0: x.append(e) y.append(0) else: x.append(0) y.append(e) a=[0]*n b=[0]*n a[0]=x[0] b[0]=y[0] for i in range(1,n): if i<k: a[i]=max(x[i],a[i-1]) b[i]=max(y[i],b[i-1]) else: a[i]=max(x[i]+a[i-k-1...

0.595936

# cook your dish here for u in range(int(input())): n=int(input()) l=list(map(int,input().split())) d=[] dd=[] s=1 for i in range(n-1): s=l[i] d.append(s) dd.append([i,i]) for j in range(i+1,n): s=s*l[j] d.append(s) dd.append([i,j]) d.append(l[n-1]) dd.append([n-1,n-1]) k=len(d) m=max(d) x,y...

0.595434

def dfs(node): nonlocal adj,leaf val=0 flag=0 for i in adj[node]: x= dfs(i) val+=x if x==0: flag=1 leaf+=val-val%3 if val%3==0 and flag==0: return 1 else: return 0 for _ in range(int(input())): n=int(input()) adj=[[] for i in range(n+2)] arr=[int(i) for i in input().split()] leaf=0 #print(adj) ...

0.594696

for i in range(int(input())): n=int(input()) m=list(map(int,input().split()))[:n] m.sort() t=0 for j in range(n//2): t+=abs(m[j]-m[n-j-1]) print(t)

0.593737

import sys input = sys.stdin.readline q=int(input()) for testcase in range(q): n=int(input()) A=sorted(set(map(int,input().split())),reverse=True) L=len(A) #print(A) ANS=A[0] for i in range(L): NOW0=A[i] NOW1=0 flag=0 for j in range(i+1,L): if NOW0%...

0.593478

def det(s, i, j): ans = 0 curr = i for a in s: if a == curr: ans += 1 if curr == i: curr = j else: curr = i if i == j: return ans return ans // 2 * 2 for t in range(int(input())): s = list(map(int, list(input()))) ans = 0 for i in range(...

0.592773

for i in range(int(input())): n=int(input()) chef=0 ans=[] for i in range(0,n): l=list(map(int,input().split())) c=l[0] if c%2==0: for i in range(1,len(l)//2+1): chef=chef+l[i] continue; for i in range(1,len(l)//2): chef=chef+l[i] ans.append(l[len(l)//2]) ans.sort(reverse=True) for i in ran...

0.592575

(lambda R:(lambda N:(lambda n:any((lambda z,r:all((lambda p:all(p==k for k in n[j:j+i]))(n[j])for j in range(0,N,i))and all(all((lambda q:q==z or q==r)(j[k:k+i])for k in range(0,N,i))for j in n)and[print(i)])('0'*i,'1'*i)for i in range(N,0,-1)if N%i==0))([bin(int(R(),16))[2:].zfill(N)for i in range(N)]))(int(R())))(__i...

0.592538

# cook your dish here from sys import stdin import functools def gcd(a, b): if (a == 0): return b return gcd(b % a, a) MAX=10001 def func(ind, g, dp, n, a): if (ind == n): if (g == 1): return 1 else: return 0 if (dp[ind][g] != -1): return dp[ind][g] ans = (func(ind + 1, g, dp, n, a) +...

0.592332

#!usr/bin/env python3 from collections import defaultdict, deque from heapq import heappush, heappop from itertools import permutations, accumulate import sys import math import bisect def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline()) def LS():return [list(x) for ...

0.592082

import sys input = sys.stdin.readline import bisect t=int(input()) for tests in range(t): n=int(input()) A=list(map(int,input().split())) compression_dict={a: ind for ind, a in enumerate(sorted(set(A)))} A=[compression_dict[a] for a in A] Q=[0]*n for i in range(n): Q[A[i]]=i ...

0.591745

t = int(input()) for i in range(t): n = int(input()) A = [] for i in range(0, n): A.append([int(i) for i in input().split()]) ones = sum([sum(i) for i in A]) compare = n ans = 0 for i in range(0, n): if ones <= compare: ans = i break ...

0.591166

def subCount(arr, n, k): mod = [] for i in range(k + 1): mod.append(0) cumSum = 0 for i in range(n): cumSum = cumSum + arr[i] # as the sum can be negative, # taking modulo twice mod[((cumSum % k) + k) % k] = mod[((cumSum % k) + k) % k] + 1 ...

0.590756

from sys import * T = int(stdin.readline()) t = [int(s) for s in stdin.readline().split(' ')] a = [] for i in range(T - 1, -1, -1): if i % 2 == 0: a += [(e[0], -e[1]) for e in a] a = [(e[0] - t[i], e[1]) for e in a] a += [(- x - 1, 0) for x in range(t[i])] a = list(set(a)) if...

0.589702

for _ in range(int(input())): n=int(input()) arr=list(map(int,input().split())) d=set() for i in arr: d.add(i) for i in range(n): if i in d: print(i,end=" ") else: print(0,end=" ") print()

0.589597

from math import gcd from itertools import groupby def gcd_split(seq): gcds= [int(gcd(a,b)==1) for a,b in zip(seq[1:],seq[:-1])] gcds.append(int(gcd(seq[0],seq[-1])==1)) # print(gcds) if max(gcds)==0: return -1 else: splits=[len(list(x))+1 for num,x in groupby(gcds) if num==0] # print(splits) if gcds[0]==...

0.589136

# cook your dish here t=int(input()) for i in range(t): D=int(input()) P=10**5-2 ans=[] if(D==0): ans.append(1) while(D>0): P=min(P,D) ans.append(P+2); ans.append(P+1); ans.append(1); D=D-P; print(len(ans)) print(*ans,sep=" ",end="\n")

0.588566

All techniques in the ninja world consist of hand seals. At the moment Naruto is learning a new technique, which consists of $n\cdot m$ different seals, denoted by distinct numbers. All of them were written in an $n\times m$ table. The table is lost now. Naruto managed to remember elements of each row from left to rig...

from sys import stdin input = stdin.readline tests = int(input()) for test in range(tests): n, m = list(map(int, input().split())) a = [[0] * m for _ in range(n)] r = [[int(i) for i in input().split()] for _ in range(n)] c = [[int(i) for i in input().split()] for _ in range(m)] z = [[-1, -1] for _ ...

0.795617

import random t=int(input()) for testCase in range(t): n=int(input()) array1=[] array2=[] array=[] for i in range(n) : array1.append(list(map(int,input().split()))) for i in range(n) : array2.append(list(map(int,input().split()))) for i in range(n) : array.append(i) # print array2," ",array1 for i in ...

0.743804

import sys input = sys.stdin.readline def main(): n, m = map(int, input().split()) alst = [list(map(int, input().split())) for _ in range(n)] blst = [[0 for _ in range(m)] for _ in range(n)] for i in range(n): for j in range(m): if (i + j) % 2 == alst[i][j] % 2: blst...

0.706203

try: t = int(input()) while(t > 0): t -= 1 n,m = list(map(int,input().split())) a = [list(map(int,input().split())) for _ in range(n)] dp = [[0 for _ in range(m)] for _ in range(n)] ans = [['0' for _ in range(m)] for _ in range(n)] for i in range(n): ...

0.69846

import heapq import sys from collections import defaultdict, Counter from functools import reduce n, m = list(map(int, input().split())) arr = [] for _ in range(n): arr.append(list(map(int, input().split()))) rows = [] for i in range(n): row = set() for j in range(m): row.add(arr[i][j]) rows....

0.662277

import numpy n,m,p=list(map(int,input().split())) ar1 = [] ar2 = [] for i in range(n): tmp = list(map(int,input().split())) ar1.append(tmp) for i in range(m): tmp = list(map(int,input().split())) ar2.append(tmp) np_ar1 = numpy.array(ar1) np_ar2 = numpy.array(ar2) print((numpy.concatenate((np_ar1,np...

0.658944

""" Codeforces Round 241 Div 1 Problem B Author : chaotic_iak Language: Python 3.3.4 """ class InputHandlerObject(object): inputs = [] def getInput(self, n = 0): res = "" inputs = self.inputs if not inputs: inputs.extend(input().split(" ")) if n == 0: res = inputs...

0.653791

import numpy n,m = list(map(int,input().split())) ar = [] for i in range(n): row = list(map(int,input().split())) ar.append(row) np_ar = numpy.array(ar) print((numpy.transpose(np_ar))) print((np_ar.flatten()))

0.648547

""" Codeforces Round 241 Div 1 Problem E Author : chaotic_iak Language: Python 3.3.4 """ class InputHandlerObject(object): inputs = [] def getInput(self, n = 0): res = "" inputs = self.inputs if not inputs: inputs.extend(input().split(" ")) if n == 0: res = inputs...

0.643646

t=int(input()) for _ in range(t): n,m=map(int,input().split()) d={} e={} l=[] for i in range(n): d[i]=0 for i in range(m): e[i]=0 for i in range(n): l.append(input()) for i in range(n): for j in range(m): if l[i][j]=='1': d[i]=1 e[j]=1 #ans=[] if sum(d.values())+sum(e.values())==0: k=[-1]...

0.623325

#list(map(int,input().split())) t=int(input()) for _ in range(t): n=int(input()) aa=list(map(int,input().split())) bb=list(map(int,input().split())) aa.sort() bb.sort() print(*aa) print(*bb)

0.622611

import numpy as np for _ in range(int(input())): ans = np.float('inf') n, m = (int(x) for x in input().split()) sig = np.zeros((n,m)) img = np.zeros((3*n,3*m)) for row in range(n): sig[row,:] = np.array([int(x) for x in input()]) for row in range(n): img[row+n,m:2*m] = np.array([int(x) for x in input()]) for...

0.608139

# cook your dish here for _ in range(int(input())): n = int(input()) m = n x= 1 for i in range(n): for j in range(m): print(x, end = '') x += 1 print() m -= 1

0.607552

import numpy n,m = list(map(int,input().split())) ar1 = [] ar2 = [] for i in range(n): tmp = list(map(int,input().split())) ar1.append(tmp) for i in range(n): tmp = list(map(int,input().split())) ar2.append(tmp) np_ar1 = numpy.array(ar1) np_ar2 = numpy.array(ar2) print((np_ar1 + np_ar2)) print((np_ar1 -...

0.607136

import sys input = sys.stdin.readline def search(i,j): L=[] c=0 while CHECK[i][j]==1<<30: L.append((i,j)) CHECK[i][j]=c if MAP2[i][j]=="U": i-=1 elif MAP2[i][j]=="D": i+=1 elif MAP2[i][j]=="R": j+=1 else: ...

0.60612

# cook your dish here t=int(input()) for _ in range(t): n,m=list(map(int,input().split())) r=list(map(int,input().split())) rating=[[r[i]]*(m) for i in range(n)] ranking=[[0]*m for i in range(n)] for i in range(n): diff=list(map(int,input().split())) for j in range(m): rating[i][j]+=diff[j] if j+1<m: ...

0.602004

rnd_mod = 1234567890133 rnd_x = 987654321098 def rnd(): nonlocal rnd_x rnd_x = rnd_x**2 % rnd_mod return (rnd_x>>5) % (1<<20) def randrange(a): return rnd() % a T = int(input()) for _ in range(T): N, M = list(map(int, input().split())) X = [] for __ in range(N): X.append([int(a) for...

0.599062

for _ in range(int(input())): n, k = map(int, input().split()) mat = [[0] * n for _ in range(n)] for i in range(n): b = False for j in range(n): if i*n+j == k: b = True break mat[(i+j)%n][j] = 1 if b: break if k%...

0.597709

import fractions import sys f = sys.stdin if len(sys.argv) > 1: f = open(sys.argv[1], "rt") def calc(N, M): if M != N: return [(-1, -1)] r = [(i+1, ((i+1) % N)+1) for i in range(N)] return r T = int(f.readline().strip()) for case_id in range(1, T+1): N, M = list(map(int, f.readline().strip().split())) ...

0.59413

for _ in range(int(input())): n, m = list(map(int, input().split())) arr = [list(map(int, input().split())) for _ in range(n)] res = 0 for i in range(n//2): for j in range(m//2): a = [arr[i][j], arr[n-i-1][j], arr[i][m-j-1], arr[n-i-1][m-j-1]] a.sort() res += ...

0.593149

import sys input = sys.stdin.readline n,m=list(map(int,input().split())) ANS=[] for i in range(1,n//2+1): for j in range(1,m+1): sys.stdout.write("".join((str(i)," ",str(j),"\n"))) sys.stdout.write("".join((str(n-i+1)," ",str(m-j+1),"\n"))) if n%2==1: for j in range(1,m//2+1): sys.s...

0.59182

# cook your dish here for a in range(int(input())): N,M=map(int,input().split()) b=[] for o in range(N): b.append(input()) c=[] for d in b: f=[] for e in range(len(d)): if d[e]=='1': f.append(e) c.append(f) i=[] for g in range(len(c)): for h in range(len...

0.590032

t = int(input()) for _ in range(t): n,m = list(map(int, input().split())) l = [] for _ in range(n): l.append(list(map(int,input().split()))) zeroes = [0] * (m + n - 1) ones = [0] * (m + n - 1) for i in range(n): for j in range(m): if l[i][j] == 0: zer...

0.589098

#!/usr/bin/env python3 OUT = (1, 0, 2, 3) try: while True: n, m = map(int, input().split()) bus = [[None] * 4 for i in range(n)] cur = 1 for row in range(n << 1): if row >= n: i = row - n k = b = 1 else: i = ro...

0.584463

T = int(input()) for _ in range(T): n,m = map(int,input().split()) completed = list(map(int,input().split())) jobs = [] for i in range(1,n+1): if i not in completed: jobs.append(i) jobs.sort() chef = [] ass = [] for i in range(len(jobs)): if i%2==0: chef.append(str(jobs[i])) else: ass.append(str(...

0.582487

t=eval(input()) for i in range(0,t): x=input() nm=x.split(' ') nm[0]=int(nm[0]) nm[1]=int(nm[1]) csoint=[] lsoint=[] csofloat=[] lsofloat=[] for j in range(0,nm[0]): a=input() b=a.split(' ') b[0]=int(b[0]) b[1]=int(b[1]) csoint.append(b[0]) ...

0.582028

""" Code chef problem DESTCELL, Destroy Cells """ def find_destroyed_cells(cell_advance, n, m, k): row = 1 col = 1 destroyed_cells = {(1, 1)} while True: row, col = cell_advance(row, col, n, m, k) if row <= n and col <= m: destroyed_cells.add((row, col)) else: break return destroyed_cells def cell_...

0.579806

# cook your dish here for t in range(int(input())): n,m=[int(x)for x in input().rstrip().split()] s=[] for p in range(n): s.append(10) for c in range(m): i,j,k=[int(x)for x in input().rstrip().split()] for q in range(i-1,j): s[q]=s[q]*k print(sum(s)//n)

0.575589

from sys import stdin for _ in range(int(stdin.readline())): m, n = list(map(int, stdin.readline().split())) final = [] arr = [] val = 0 extra = 0 for j in range(m): ans = list(map(str, stdin.readline().split())) if ans.count('N') == n: val += 1 else: if val%2 == 0: arr.append(ans) extra += v...

0.574937

nmq = input().split(' ') n, m, q = int(nmq[0]), int(nmq[1]), int(nmq[2]) mt = [] for i in range(0, n): mt.append([]) for j in range(0, m): mt[-1].append((i, j)) res = [] for i in range(0, n): res.append([]) for j in range(0, m): res[-1].append(0) for i in range(0, q): ins = input().s...

0.569804

n, m, k = map(int, input().split()) chats_ = [] for i in range(n): a = list(map(int, input().split())) chats_.append(a) sent = [0 for i in range(n)] chats = [0 for i in range(m)] for i in range(k): a, b = map(int, input().split()) sent[a - 1] += 1 chats[b - 1] += 1 for i in range(n): sum = 0 ...

0.568569

# cook your dish here t = int(input()) for _ in range(t): m,n = [int(d) for d in input().split()] if m == 1: arr = [] if n%4 == 0: print(2) arr = [[1,1,2,2]*(n//4)] elif n%4 == 1: if n == 1: print(1) arr = [[1]] else: print(2) arr = [[1,1,2,2]*(n//4) + [1]] elif n%4 == 2: if n ...

0.567968

import sys input = sys.stdin.readline t = int(input()) for test in range(t): if test: input() n, m = list(map(int, input().split())) a = [-1] * m b = [-1] * m for i in range(m): a[i], b[i] = list(map(int, input().split())) l = [(a[i],0,i) for i in range(m)] + [(b[i],1,i) for i...

0.564704

# cook your dish here for _ in range(int(input())): A,B=list(map(int,input().split())) l1=list(map(int,input().split())) l2=list(map(int,input().split())) for i in range(A*B): if l1[i]<l2[i]: l1[i]=0 else: l2[i]=0 l1.sort(reverse=True) l2.sort(reverse=True) w,d,c=0,0,...

0.56217

# Problem: http://www.codechef.com/JULY09/submit/CUBESUM/ # Author: Susam Pal def computeA(): X, Y, Z = [int(x) for x in input().split()] B = [] for x in range(X): B.append([]) for y in range(Y): B[-1].append([int(t) for t in input().split()]) for z in range(Z): result = B[x][y][z] if x: res...

0.558717

for _ in range(int(input())): n = int(input()) arr = [list(input()) for _ in range(n)] res = [] if arr[n-2][n-1] == arr[n-1][n-2]: if arr[0][1] == arr[n-2][n-1]: res.append((1, 2)) if arr[1][0] == arr[n-2][n-1]: res.append((2, 1)) elif arr[0][1] == arr[1][0]: ...

0.5548

# cook your dish here # cook your dish here n=0;m=0; A=[];B=[]; anscount=0;k=0; def generate(n,m,l): nonlocal anscount if(len(l)==n+m): X=l i,j = 0,0 C=[0 for t in range(n+m)] while((i+j)<(n+m)): if(X[i+j] == 0): C[i+j] = A[i] i = i+1 else: C[i+j] = B[j] j = j+1 ans = len(C) for i i...

0.554538

T=int(input()) for i in range(T): n,m=list(map(int,input().split())) if(m<=2): print("impossible") else: l=[0]*m if(m%2==0): a=m//2 else: a=(m//2)+1 for j in range(a): if(j%2==0): l[j]="a" l[m-j-1]="a" else: l[j]="b" l[m-j-1]="b...

0.553967

for _ in range(int(input())): x,y=map(int,input().split()) if(x==y): if(x==1): print(1) else: n=0 for i in range(x-1): n=i for _ in range(y): print(n,end=' ') n=(n+1)%x pri...

0.551249

# This is not my code, it's Snehasish Karmakar's. Refer to http://www.codechef .com/viewsolution/7153774 # for original version. # Submitting it to try and work out if it can be sped up. def compute_nCr(n,r) : C[0][0]=1 for i in range(1,n+1) : # print "i",i C[i][0]=1 for j in range(1,min(i,r)+1) : i...

0.55039

import sys input = sys.stdin.readline T = int(input()) for _ in range(T): N, M = list(map(int, input().split())) X = [[] for i in range(3*N)] for i in range(M): x, y = list(map(int, input().split())) x, y = min(x,y), max(x,y) X[x-1].append((y-1, i+1)) MAT = [] IND = [] ...

0.548064

t=int(input()) for i in range(t): n,m=list(map(int,input().split())) l=[0]+list(map(int,input().split())) s=0 c=1 m1=[] for i in range(n): d,f,b=list(map(int,input().split())) if(l[d]>0): m1.append(d) s+=f l[d]-=1 else: m1.append(0) s+=b for i in range(n): if(m1[i]==0): for j in range(c...

0.545064

import numpy n = int(input()) ar1 = [] ar2 = [] for i in range(n): tmp = list(map(int,input().split())) ar1.append(tmp) np_ar1 = numpy.array(ar1) for i in range(n): tmp = list(map(int,input().split())) ar2.append(tmp) np_ar2 = numpy.array(ar2) print((numpy.dot(np_ar1,np_ar2)))

0.542751

for _ in range(int(input())): n=int(input()) a=[] l=0 for i in range(n): a.append(list(map(int,input().split()))) for i in range(n-1,0,-1): r=a[i][i-1]+1 if a[i][i]!=r: l+=1 n=i+1 for j in range(n): for k in range(j,n): a[j][k],a[k][j]=a[k][j],a[j][k] print(l)

0.540816

import sys q = int(sys.stdin.readline().strip()) for t in range(0, q): n, m = list(map(int, sys.stdin.readline().strip().split())) L = [] R = [0] * n C = [0] * m for i in range (0, n): L.append(sys.stdin.readline().strip()) for j in range (0, m): if L[i][j] != "*": ...

0.539278

def main(): from sys import stdin, stdout def read(): return stdin.readline().rstrip('\n') def read_array(sep=None, maxsplit=-1): return read().split(sep, maxsplit) def read_int(): return int(read()) def read_int_array(sep=None, maxsplit=-1): return [int(a) for a ...

0.53921

for _ in range(int(input())): n=int(input()) a=[] b=[] for i in range(4*n-1): c,d=list(map(int,input().split())) a.append(c) b.append(d) c1=0 c2=0 for i in a: c1^=i for i in b: c2^=i print(c1,c2)

0.537517

import numpy n,m = list(map(int,input().split())) print((numpy.eye(n,m,k=0)))

0.536411

import sys input=sys.stdin.buffer.readline t=1 for __ in range(t): a=[] n=int(input()) for i in range(n): b=list(map(int,input().split())) a.append(b) dr={} di={} for i in range(n): for j in range(n): dr[i+j]=dr.get(i+j,0)+a[i][j] di[i+n-j+1]=d...

0.53489

def make_triangle(m,n): lns, sm = 0, 0 while sm < n - m + 1: lns += 1 sm += lns if sm > n - m + 1: return "" matrix = [[0] * (i + 1) for i in range(lns)] y, x, s = 0, 0, 0 ds = ((1, 1), (0, -1), (-1, 0)) dy, dx = ds[s] for i in range(m, n + 1): matrix[y][x] = str(...

0.534384

# cook your dish here import sys import math def main(grid): ans=0 for i in range(len(grid)): for j in range(len(grid[0])): first_point=grid[i][j] for k in range(j+1,len(grid[0])): second_point=grid[i][k] if first_point==second_point: ...

0.531152

n, m = list(map(int, input().split())) color_pairs = [list(map(int, input().split())) for i in range(m)] towers = [[(i, i)] for i in range(1, n + 1)] last_coord = n + 1 for c1, c2 in color_pairs: towers[c1 - 1].append((last_coord, c1)) towers[c2 - 1].append((last_coord, c2)) last_coord += 1 for i in range(l...

0.530118

import numpy as np def sort_it(array): new_list = [] for i in range(len(array)): start = 0 value = array[i][0] last = len(new_list) while start != last: mid = (start + last) // 2 if new_list[mid][0] > value: last = mid else: ...

0.527903

n, m = map(int,input().split()) ar = [] for i in range(n): ar.append(list(map(int,input().split()))) k = int(input()) ar = sorted(ar,key = lambda x:x[k]) for i in ar: [print(x,end=' ') for x in i] print('')

0.526214

from sys import stdin,stdout import math,bisect from collections import Counter,deque,defaultdict L=lambda:list(map(int, stdin.readline().strip().split())) M=lambda:list(map(int, stdin.readline().strip().split())) I=lambda:int(stdin.readline().strip()) S=lambda:stdin.readline().strip() C=lambda:stdin.readline().strip()...

0.525046

for t in range(int(input())): n = int(input()) l = [] m = [] x = list(map(int,input().split())) l.append(x) m.append(list(x)) for i in range(1,n): x = list(map(int,input().split())) l.append(x) temp = [] for i in range(4): temp.append (x[i]+min(m[-1][:i]+m[-1][i+1:])) m.append(temp) print(min(m[-1]...

0.523537

from sys import stdin, stdout from math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log from collections import defaultdict as dd, deque from heapq import merge, heapify, heappop, heappush, nsmallest from bisect import bisect_left as bl, bisect_right as br, bisect mod = pow(10, 9) + 7 mod2 = 998244353 def inp(...

0.521672

import sys input = sys.stdin.readline from collections import deque t=int(input()) for tests in range(t): n=int(input()) a=input().strip() b=input().strip() Q=deque(a) L=[] while Q: L.append(Q.popleft()) if Q: L.append(Q.pop()) ANS=[] for i in range(n):...

0.520744

n,m,k=map(int,input().split()) print(m*(m-1)//2) for i in range(n): a=list(map(int,input().split())) if k==0: for i in range(m): for j in range(i+1,m): print(i+1,j+1) else: for i in range(m): for j in range(i+1,m): print(j+1,i+1)

0.520306

import itertools def transpose_two_strings(arr): return '\n'.join( ' '.join(elt) for elt in itertools.zip_longest(arr[0],arr[1],fillvalue=' ') )

0.519837

# cook your dish here n,m=map(int,input().split()) L=[] for i in range(n): s=input() L.append(s) cost=[] h2=[0]*(m+1) cost.append(h2) for i in range(n): h=[0] for j in range(m): if(L[i][j]=='0' and (i+j)%2!=0): h.append(1) elif(L[i][j]=='1' and (i+j)%2==0): h.app...

0.519141

import sys input = sys.stdin.readline testcases=int(input()) for testcase in range(testcases): n,m=list(map(int,input().split())) MAP=[input().strip() for i in range(n)] #print(MAP) STR=[[] for i in range(26)] for i in range(n): for j in range(m): if MAP[i][j]!=".": ...

0.519066

input = __import__('sys').stdin.readline MIS = lambda: map(int,input().split()) n, m = MIS() A = input().split() B = input().split() for TEST in range(int(input())): y = int(input())-1 print(A[y%len(A)] + B[y%len(B)])

0.518755

# cook your dish here n,m = map(int, input().split()) arr1 = list(map(int, input().split())) arr2 = list(map(int, input().split())) max1 = arr1.index(max(arr1)) min2 = arr2.index(min(arr2)) arr = [] for i in range(m): arr.append([max1, i]) for i in range(n): if i!=max1: arr.append([i , min2]) for i in ...

0.518259

t = int(input()) for i in range(t): q = input().split() n = int(q[0]) m = int(q[1]) k = int(q[2]) sumax = 0 b = [] for j in range(n): a = [int(k) for k in input().split()] b = b + [a] for j in range(n): su = 0 for x in range(k): s...

0.517126

for _ in range(int(input())): n = int(input()) r1 = list(map(int, input().split())) m = int(input()) r2 = list(map(int, input().split())) o11 = sum(t % 2 for t in r1) # Counts odd number o12 = n - o11 o21 = sum(t % 2 for t in r2) # Counts odd number o22 = m - o21 print (o11 * o21 + o...

0.516506

import sys def spaces(a,n,m,k,visit1,visit2,dist,position): queue = [position] lastedit = [] dist[position[0]][position[1]] = 0 while queue!=[]: point = queue[0] i = point[0] j = point[1] #print 'point',i,j if visit1[i][j]==False: visit1[i][j] = True startx = max(i-k,0) endx = min(i+k,n-1) f...

0.511887

n, m = map(int, input().split()) sum = n ** 2 colx = n coly = n usedx = [False] * n usedy = [False] * n for i in range(m): x, y = map(int, input().split()) x -= 1 y -= 1 if not usedx[x]: sum -= coly usedx[x] = True colx -= 1 if not usedy[y]: sum -= colx usedy[...

0.511377

for _ in range(int(input())): n, m, a, b = list(map(int, input().split())) if a * n != b * m: print('NO') else: ar = [] for i in range(n): ar.append([0] * m) x, y = 0, a for i in range(n): if x < y: for j in range(x, y): ...

0.510867

# cook your dish here import math T=int(input()) for i in range(T): a=list(map(int,input().split())) n=a[0] m=a[1] print(m*n//math.gcd(m,n))

0.510838

from collections import Counter from math import factorial def count_perms(matrix): m, n = len(matrix), len(matrix[0]) c = Counter([x for row in matrix for x in row]) factors = [] for x, count in c.most_common(): if count > 1: factors.append(factorial(count)) return factorial(m ...

0.509156

def main(): n, m, h = map(int, input().split()) row = list(map(int, input().split())) col = list(map(int, input().split())) mat = [list(map(int, input().split())) for _ in range(n)] for i in range(n): for j in range(m): if mat[i][j]: mat[i][j] = min(col[i], row[j]...

0.508238

for _ in range(int(input())): n, m = map(int, input().split()) print('W' + 'B' * (m - 1)) print((('B' * (m) + '\n') * (n - 1))[:-1])

0.50555

n = int(input()) p = [list(map(int, input().split())) for i in range(n)] t = [[0] * n for i in range(n)] for i in range(n): t[i][i], p[i][i] = p[i][i], 0 for j in range(i + 1, n): t[j][i] = t[i][j] = d = (p[i][j] + p[j][i]) / 2 p[i][j] -= d p[j][i] -= d for i in t: print(' '.join(map(str...

0.505163

import itertools ar1 = list(map(int,input().split())) ar2 = list(map(int,input().split())) cross = list(itertools.product(ar1,ar2)) for i in cross: print(i,end=' ')

0.505126

try: t=int(input()) for a in range(t): l=input().split() n=int(l[0]) m=int(l[1]) d={} s=0 for b in range(m): l1=input().split() i=int(l1[0]) j=int(l1[1]) k=int(l1[2]) for c in range(i,j+1): if c not in d: d[c]=10 for c in range(i,j+1): d[c]=d[c]*k for i in d: s=s+d[i] ...

0.504974

for i in range(int(input())): n,k=map(int,input().split()) m=[] for j in range(n): l=list(input()) m.append(l) a=0 for k in range(k): b=0 for p in range(n): if m[p][k]=='1': b+=1 if b>1: a+=((b*(b-1))//2) print(a)

0.503629

# CHNGSS.py import sys from random import * n,m,c = list(map(int,input().split())) arr = [[1]*m for i in range(n)]; saved = 0; for i in range(n): for j in range(m): print(1,(i+1),(i+1),(j+1),(j+1),1,25) sys.stdout.flush() a = int(input()) if a == 1 : saved += 1; arr[i][j] = randint(1,25); else: ar...

0.503308

# cook your dish here T=int(input()) for k in range(0,T): N=int(input()) matrix=[] for i in range(0,N): a=list(map(int, input().split())) matrix.append(a) max_trace = [] for i in range(0,N): trace1=0 trace2=0 for j in range(0,i+1): trace1+=matrix[j][N+j-i-1] trace2+=matrix[N+j-i-1][j] max_trace....

0.503268

t=int(input()) for t in range(t): n=int(input()) for i in range(0,n): for j in range(0,n): if i%2==0: if j%2==0: print(0,end="") else: print(1,end="") else: if j%2==0: prin...

0.502902

import sys import collections rlines = sys.stdin.readlines() lines = (l.strip() for l in rlines) def eucycle(n,m,adj): diredges = [] us = list(adj.keys()) for u in us: while adj[u]: v0 = u v1 = adj[v0].pop() adj[v1].remove(v0) diredges.append((v0,v1))...

0.502653

def is_symmetric(a): return a[0][1]==a[1][0] for _ in range(int(input())): def two_ints(): return list(map(int,input().split())) n, m = map(int,input().split()) tiles = [[two_ints(),two_ints()] for i in range(n)] print("YES" if m%2==0 and any([is_symmetric(tile) for tile in tiles]) else "NO")

0.501468

w, h = map(int, input().split()) image = [input() for i in range(h)] for i in range(w): image2 = "" for j in range(h): temp = image[j][i] print(temp+temp,end="") image2 += temp + temp print() print(image2)

0.50011

class Solution: def generateMatrix(self, n): """ :type n: int :rtype: List[List[int]] """ if n<1: return [] left=0 right=n-1 up=0 bottom=n-1 self.matrix=[[0 for i in range(n)] for j in range(n)] count=1 ...

0.499958

n, m = [int(x) for x in input().split()] list1 = [] list2 = [] for i in range(n): list1.append(input()) for j in range(m): list2.append(input()) list3 = [] for i in range(n - m + 1): y = "" for j in range(m): y += list1[j + i] list3.append(y) list4 = [] for i in range(n - m + 1): y = ...

0.499009

T= int(input()); for i in range(T): n,k = list(map(int,input().split())); s=list(map(int,input())); if k==1: s_0 ={}; s_1={}; c0=0; c1=0; for j in range(n): if(j%2==0): s_1[j]=1; s_0[j]=0; else: s_1[j]=0; s_0[j]=1; for j in range(n): if(s_0[j]-s[j]!=0): c0+=1; if(s_1[j]-...

0.498685

h, w = map(int, input().split()) n = int(input()) A = tuple(map(int, input().split())) M = [[0] * w for _ in range(h)] ii = 0 ij = 0 for i, a in enumerate(A): i += 1 for _ in range(a): M[ij][ii] = i if ij%2 == 0: ii += 1 if ii == w: ij += 1 ...

0.498441

import sys input = sys.stdin.readline t=int(input()) def calc(x): return x*(x+1)//2 for test in range(t): n,m=list(map(int,input().split())) ANS=calc(n) k=n-m q,mod=divmod(k,m+1) ANS-=calc(q+1)*mod+calc(q)*(m+1-mod) print(ANS)

0.498352

# cook your dish here for _ in range(int(input())): n,m = list(map(int,input().split())) colors = [0]*41; cost = [0]*41 color = 0 for i in range(n): cc,pp = list(map(int,input().split())) colors[cc] += 1 cost[cc] += pp for i in colors: if i>0: color += 1 dp2 = [[0...

0.498344

from collections import defaultdict from itertools import product def solve(mouse,n,m): # shadow matrix will contains the count of mice which affect (i,j) position # if there is a mice at position (i,j) then in shadow matrix it will affect all four adjacent blocks shadow=[[0 for i in range(m)]for j in ra...

0.498288

def read_int(): return int(input()) def read_ints(): return list(map(int, input().split(' '))) t = read_int() for case_num in range(t): n, k = read_ints() p = [] for i in range(n): ai, bi = read_ints() p.append((bi, ai, i + 1)) p.sort() dp = [[0 for j in range(k + 1)] for...

0.498063

t = int(input()) for _ in range(t): n = int(input()) for i in range(n): for j in range(n): if i>=j: print(int((i+1)*(i+2)/2)-j,end='') print()

0.497981

from sys import stdin n,m=list(map(int,stdin.readline().strip().split())) s=[] for i in range(n): s.append(list(map(ord,list(stdin.readline().strip())))) for j in range(m): s[-1][j]=s[-1][j]-97 ct=[tuple(map(int,stdin.readline().strip().split())) for i in range(n)] mc=[[0 for i in range(22)] for j in ra...

0.4944

import sys def main(): s=sys.stdin.readline n, m = list(map(int, s().split())) nums={} for i in range(1, n+1): nums[i]=list(map(int, s().split())) cases=int(s()) for case in range(cases): px, py, qx, qy = list(map(int, s().split())) ans=[] for i in range(px, qx+1): for j in range(py-1, qy): ans.ap...

0.494243

import sys t = int(input()) # print(t) for _ in range(t): n,m = map(int,input().split()); s = []; for i in range(n): s.append(input()) ans = [] for i in range(n): ans.append([]) for j in range(m): ans[i].append([]) for i in range(n): for j in range(m): c = 0 if s[i][j] == 'U': ...

0.494181

t=int(input()) for _ in range(t): n,m=[int(x) for x in input().split()] mat=[] ans=[] for i in range(n+2): l=[] p=[] for j in range(m+2): l.append(0) p.append(1000000000) mat.append(l) ans.append(p) y=int(input()) for i in range(y): a,b=[int(x) for x in input().split()] mat[a][b]=1 ans[a][b]...

0.49344

n,m=map(int,input().split()) if n==1and m==1:print('YES\n1') elif n==3and m==3: print('YES') print(6, 1, 8) print(7,5,3) print(2,9,4) elif n<4and m<4:print('NO') elif n==1 or m==1: t=max(n,m) a=[i for i in range(2,t+1,2)] a+=[i for i in range(1,t+1,2)] print('YES') for i in a:print(i...

0.492711

t=int(input()) while(t): n=int(input()) cnt=1; for i in range(n): s="" for j in range(n): s=s+str(bin(cnt))[2:][: : -1]+" " cnt=cnt+1 print(s) t=t-1

0.491672

#!/usr/bin/env python3 n, m, k = [int(x) for x in input().split()] row = [(0, -1)] * n col = [(0, -1)] * m for i in range(0, k): t, num, color = [int(x) for x in input().split()] num -= 1 if t == 1: row[num] = (color, i) else: assert t == 2 col[num] = (color, i) for r in row: ...

0.490542

n, k = map(int, input().split()) ans = [[0 for i in range(n)]for j in range(n)] cur = 1 sum_k = 0 for i in range(n): for j in range(k-1): ans[i][j] = cur cur += 1 for i in range(n): for j in range(k-1, n): ans[i][j] = cur cur += 1 for i in range(n): sum_k += ans[i][k-1] print...

0.489704

def ans(l): s = "" i = 0 while (i < len(l)): temp = l[i] k = temp[1] if (k != 0): s += str(temp[0]) + "x^" + str(k) else: s += str(temp[0]) i += 1 if (i < len(l)): s += " + " if (len(s) > 0): return s else: return "0" test = int(input()) while (test != 0): test -= 1 N = int(input()) l...

0.488632

There are $n$ programmers that you want to split into several non-empty teams. The skill of the $i$-th programmer is $a_i$. You want to assemble the maximum number of teams from them. There is a restriction for each team: the number of programmers in the team multiplied by the minimum skill among all programmers in the...

__MULTITEST = True ## solve def solve(): n, x = map(int, input().split()) a = list(map(int, input().split())) a.sort() group = 0 ptr = n-1 members = 0 currentMin = int(1e10) while ptr > -1: currentMin = min(currentMin, a[ptr]) members += 1 if currentMin * memb...

0.722022

import sys from collections import defaultdict from copy import copy R = lambda t = int: t(input()) RL = lambda t = int: [t(x) for x in input().split()] RLL = lambda n, t = int: [RL(t) for _ in range(n)] def solve(): n, x = RL() A = RL() A.sort(reverse = True) s = c = m = 0 for a in A: s += a c += 1...

0.792999

# cook your dish here import sys input=sys.stdin.readline for _ in range(int(input())): n,x=list(map(int,input().split())) l=[0] pre=[0]*(n+1) sum=0 i=1 for m in input().split(): l.append(int(m)) sum+=int(m) pre[i]=sum i+=1 dict={} k=[] i=1 while (i*i)<=x: if x%i==0: k.append(i) if (i*i)!=x: ...

0.740735

import math for i in range(int(input())): n,x=list(map(int,input().split())) l=list(map(int,input().split())) l.sort() flag=0 d=0 for j in range(n): if l[j]>x: for k in range(j,n): if x<l[k]: d+=(math.ceil(math.log(l[k]/x)/math.log(2))+1) else: d+=1 x=l[...

0.698252

import sys # stdin = open("testdata.txt", "r") ip = sys.stdin def solve(C, n, x): if n==1: return (1, 0) b1, b2 = 1, 1 a , b = C[0], C[-1] while b1 + b2 < n: if a < b*x: a += C[b1] b1 += 1 elif a > b*x: b2 += 1 b += C[n-b2] else: if b1 >= b2: a += C[b1] b1 += 1 else: b2 +=...

0.692247

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline mii=lambda:list(map(int,input().split())) for _ in range(int(input())): n,x=mii() has=0 a=0 for i in mii(): if x==i: has=1 a=max(a,i) if has: print(1) else: print(max(2,(x-1)//a+1))

0.678203

t = int(input()) for loop in range(t): n,x = list(map(int,input().split())) a = list(map(int,input().split())) ss = sum(a) if ss % x != 0: print (n) else: ans = -1 for i in range(n): if a[i] % x != 0: ans = n-i-1 break ...

0.661121

import sys import math from collections import defaultdict from itertools import combinations from itertools import permutations input = lambda : sys.stdin.readline().rstrip() read = lambda : map(int, input().split()) def write(*args, sep="\n"): for i in args: sys.stdout.write("{}".format(i) + sep) INF = float('i...

0.633548

import sys def main(): #n = iinput() #k = iinput() #m = iinput() #n = int(sys.stdin.readline().strip()) #n, k = rinput() #n, m = rinput() #m, k = rinput() #n, k, m = rinput() #n, m, k = rinput() #k, n, m = rinput() #k, m, n = rinput() #m, k, n = rinput() #m,...

0.625586

import math t = int(input()) for test in range(t): n,k = map(int,input().split()) A = list(map(int,input().split())) A.sort() ans = 0 for i in range(1,n): if(A[i]>k): ans = 0 break rem = k-A[i] ans+=rem//A[0] print(ans)

0.625299

# cook your dish here from math import ceil for _ in range(int(input())): n=int(input()) a=list(map(int,input().split())) ans=ceil(n/min(a)) print(int(ans))

0.624419

t = int(input()) while(t): n = int(input()) ar = list(map(int,input().strip().split(" "))) print(len([x for x in ar[1:len(ar)] if ar[0]<x])) t-=1

0.620905

test=int(input()) for _ in range(test): n=int(input()) ls=list(map(int,input().split())) ls.sort() s=0 for i in range(n): if s>=ls[i]: s=s+1 else: break print(s)

0.601251

'''Author- Akshit Monga''' from sys import stdin, stdout input = stdin.readline t=int(input()) for _ in range(t): n=int(input()) a=[int(x) for x in input().split()] ans=0 dp=[-1 for i in range(0,n+1)] for i in a: var1=dp[i] var2=ans ans=max(ans,var1+1) dp[i]=max(dp[i],var2+1) print(n-ans)

0.593193

from sys import stdin tt = int(stdin.readline()) for loop in range(tt): n = int(stdin.readline()) a = list(map(int,stdin.readline().split())) lis = [ [1] ] now = [] tmp = 0 for i in range(1,n): if len(now) == 0: now.append(a[i]) tmp = 1 elif now[-1] ...

0.59133

import sys t = int(sys.stdin.readline()) for _ in range(t): n = int(sys.stdin.readline()) intervals = [None]*n for i in range(n): intervals[i] = tuple([int(a) for a in sys.stdin.readline().split()]) intervals = list(zip(intervals, list(range(n)))) starts = sorted(intervals, key = lambda x:...

0.588655

T = int(input()) for _ in range(T): W = list(map(int, input().strip().split())) S = W[0] W = W[1:] W = W[::-1] i = 0 c = 0 flag = 0 while (len(W) != 0 or flag != 1) and i<len(W): k = i su = 0 while su <= S and k<len(W)-1: su += W[k] k += 1 if su-W[k-1]<=S: c += 1 else: flag = 1 i += 1 p...

0.585355

from math import ceil t=int(input()) for i in range(t): p=int(input()) l=list(map(int,input().split())) maxx=1 for i in range(len(l)): maxx=max(maxx,l.count(l[i])) if(maxx*2>p): print(maxx) else: q=p-maxx*2 maxx+=ceil(q/2)...

0.585084

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline mii=lambda:list(map(int,input().split())) for _ in range(int(input())): n,d=mii() a=list(mii()) ans=0 for i in range(n): while d>=i and a[i]: a[i]-=1 ans+=1 d-=i print(ans)

0.579292

# cook your dish here import numpy as np def minstairs(n,k): stairsHeight=[] stairs=0 current = 0 stairsHeight=list(map(int, input().split())) stairsHeight=np.array(stairsHeight) curr=0 for i in range(n): if stairsHeight[i]-curr<=k: curr=stairsHeight[i] else: if (stairsHeight[i]-curr)%k==0: sta...

0.577556

T = int(input()) for _ in range(T): n = int(input()) arr = list(map(int, input().split())) a = [0 for _ in range(max(arr)+1)] star_val = [] for i in range(len(arr)): j = 1 val = 0 while j*arr[i] <= len(a): val += a[j*arr[i]-1] j += 1 star_val.append(val) a[arr[i]-1] += 1 print(max(star_val))

0.576995

# cook your dish here import math for t in range(int(input())): n=int(input()) a=[int(i) for i in input().split()] div=sum(a)/n div=math.ceil(div) count=div*n-sum(a) for i in a: if i>div: count+=i-div print(count)

0.57383

import sys input=sys.stdin.readline for _ in range(int(input())): N=int(input()) e=list(map(int,input().split())) e.sort() ans=0 val=0 g=0 for i in range(0,N): g+=1 val=e[i] if g>=val: ans+=1 g=0 val=0 print(ans)

0.569342

from bisect import * d = [{}, {}] i = [0, 0] for q in range(int(input())): a, t, x = map(int, input().split()) for k in [0, 1]: d[k][x] = d[k].get(x, []) i[k] = bisect(d[k][x], t) if a < 3: d[-a][x].insert(i[-a], t) else: print(i[1] - i[0])

0.566724

for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) ans = 1 l1 = l[0] for i in range(1,n): if l[i] <= l1: l1 = l[i] ans = ans + 1 print(ans)

0.564306

# cook your dish here from sys import stdin import functools def gcd(a, b): if (a == 0): return b return gcd(b % a, a) MAX=10001 def func(ind, g, dp, n, a): if (ind == n): if (g == 1): return 1 else: return 0 if (dp[ind][g] != -1): return dp[ind][g] ans = (func(ind + 1, g, dp, n, a) +...

0.564108

# cook your dish here t=int(input()) while(t): t=t-1 n,k=list(map(int,input().split())) q=list(map(int,input().split())) days,rem=0,0 for i in range(n): rem+=q[i] if(rem>=k): rem-=k else: days=i+1 break days+=1 if(rem>=k): days+=(rem//k)+1 print(days)

0.563422

# cook your dish here t=int(input()) for i in range(t): n=int(input()) nums=list(map(int,input().split())) k=int(input()) an=nums[k-1] cn=0 for i in range(n): if(nums[i]<an): cn+=1 print(cn+1)

0.563299

import sys from operator import itemgetter def count(a, b, num_a, num_b, cur_time): current_result = 0 #print('count time = ', cur_time, "num_a =", num_a, 'num_b = ', num_b) if num_a * a + num_b * b <= cur_time and cur_time >= 0: cur_time -= num_a * a + num_b * b current_result = num_a + num_b if num_a < tota...

0.561856

def main(): t= int(input()) while(t!=0): n,k = list(map(int , input().split())) arr = list(map(int, input().split())) freq = [0]*100001 k=k-1 st=0 end=0 currentCount=0 previousElement = 0 for i in range(n): freq[arr[i]]+=1 if(freq[arr[i]]==1): currentCount+=1 while(currentCount>k): ...

0.557873

import math as ma import sys from decimal import Decimal as dec from itertools import permutations def li(): return list(map(int , input().split())) def num(): return map(int , input().split()) def nu(): return int(input()) t=nu() for it in range(t): k=nu() a=li() s=sum(a) zz=[] for i in range(7): pp=...

0.556945

from sys import stdin,stdout from math import gcd for _ in range(int(stdin.readline())): # n=int(stdin.readline()) k-pieces n,k=list(map(int,stdin.readline().split())) a=list(map(int,stdin.readline().split())) gr=[[0 for _ in range(n)]for _ in range(n)];ans=0;k-=1 for sz in range(n): ...

0.555672

from bisect import insort from math import ceil for _ in range(int(input())): n,k=list(map(int,input().split( ))) array=list(map(int,input().split( ))) ans=0 index=[] for i in range(1,n+1): index.append(ceil(k/(ceil(k/i)))) for i in range(n): count=[0]*(2001) temp=[] for j in range(i,n): count[array[j]...

0.55251

for _ in range(int(input())): n = int(input()) A = list(map(int, input().split())) m = 10 ** 9 c = 0 for i in range(n - 1, -1, -1): if A[i] <= m: m = A[i] else: c += 1 print(c)

0.551057

import sys input = sys.stdin.readline for f in range(int(input())): n=int(input()) a=list(map(int,input().split())) patties=[0]*n mx=0 for p in a: patties[p-1]+=1 mx=max(patties[p-1],mx) mxs=0 for p in patties: if p==mx: mxs+=1 rest=n-mx rest-=mxs ...

0.550928

from math import sqrt T = int(input()) ans = [] for _ in range(T): X = int(input()) count = 0 x = 0 y = 0 while(x<=X): p = int(sqrt(y)) count += 1 if(p*p>y): x = p y += p**2 else: x = p+1 y += (p+1)**2 if(x<=X): ans.append(count) else: ans.append(count-1) for i in ans: print(i)

0.550621

t = int(input()) for _ in range(t): n, x = [int(x) for x in input().split()] a = set([int(x) for x in input().split()]) for i in range(1, 1000): if i in a: continue if x == 0: print(i - 1) break x -= 1

0.549484

import sys input = sys.stdin.readline import bisect t=int(input()) for tests in range(t): n=int(input()) A=list(map(int,input().split())) compression_dict={a: ind for ind, a in enumerate(sorted(set(A)))} A=[compression_dict[a] for a in A] Q=[0]*n for i in range(n): Q[A[i]]=i ...

0.54905

def count(a, t, x): return sum(not (t-v)%x if x else t==v for v in a)

0.548576

from sys import stdin,stdout import sys import math t=int(stdin.readline()) for i in range(t): a=list(map(int,stdin.readline().split())) print(sum(a)//2)

0.547512

def fact(n): if n<2: return 1 return n * fact(n-1) def ncr(n, r): return fact(n)// (fact(r)*fact(n-r)) t=int(input()) for _ in range(t): n, k = list(map(int, input().split())) a = list(map(int, input().split())) a.sort() count_z = a.count(a[k-1]) count_z_seq = a[:k].count(a[k-1]) print(ncr(count_z, co...

0.54663

import sys rl=sys.stdin.readline T=int(rl()) for t in range(T): P=int(rl()) T=(P+1)//2 F=list(map(int,rl().split()))[1:] numtorn=int(rl()) t=sum(range(1,P+1))-sum(F) K=T-numtorn print('%.4f' % (t*K/float(T)))

0.546223

#! /usr/bin/env python from sys import stdin from functools import reduce def gcd(a,b): while b!=0: a,b=b,a%b return a def gcdl(l): return reduce(gcd, l[1:],l[0]) def __starting_point(): T=int(stdin.readline()) for case in range(T): numbers=list(map(int, stdin.readline().split()[1:])) g=gcdl(numbers) ...

0.545376

# cook your dish here import math T = int(input()) for _ in range(T): N, H = map(int, input().split()) A = list(map(int, input().split())) low, high = 1, max(A) while low != high: time = 0 mid = (low + high) // 2 for i in range(N): time += math.ceil(A[i] / mid) if time <= H : high = mid else: ...

0.545256

import sys input = sys.stdin.readline Q = int(input()) for _ in range(Q): N = int(input()) A = [int(a) for a in input().split()] X = {} for a in A: if a in X: X[a] += 1 else: X[a] = 1 Y = [] for x in X: Y.append(X[x]) Y = sorted(Y)[::-1] p...

0.544843

t=eval(input()) for i in range(0,t): x=input() nm=x.split(' ') nm[0]=int(nm[0]) nm[1]=int(nm[1]) csoint=[] lsoint=[] csofloat=[] lsofloat=[] for j in range(0,nm[0]): a=input() b=a.split(' ') b[0]=int(b[0]) b[1]=int(b[1]) csoint.append(b[0]) ...

0.544574

t = int(input()) for _ in range(t): n, k = list(map(int, input().split())) l = list(map(int, input().split())) d = dict() d[0] = 0 for v in l: vv = (k - v) % k if vv: if vv not in d: d[vv] = vv + 1 else: d[vv] += k prin...

0.5401

from sys import stdin for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) id = list(zip(l,list(range(n)))) id.sort() val, pos = zip(*id) blok = [] cur = [pos[0]] for i in range(1,n): if val[i] == val[i-1]: cur.append(pos[i]) else:...

0.539427

# cook your dish here class node: def __init__(self,a,b=0,c=0): self.val=a self.a=b self.b=c arr=[] def finder(node,val): if(arr[node].val==0): return val else: a=finder(arr[node].a,val) b=finder(arr[node].b,val) if(arr[node].val==1): return a+b-a*b else: return a*b t=int(input()) while(t>0)...

0.538222

import math def findnumber(l,n): l.sort() x = l[0] * l[-1] vec = [] i = 2 while (i*i)<=x: if x%i==0: vec.append(i) if x//i !=i: vec.append(x//i) i = i + 1 vec.sort() if len(vec)!=n: return -1 else: j = 0 ...

0.536765

from math import log2; import bisect; from bisect import bisect_left,bisect_right import sys; from math import gcd,sqrt sys.setrecursionlimit(10**7) from collections import defaultdict inf=float("inf") # n=int(input()) # n,m=map(int,input().split()) # l=list(map(int,input().split())) def get_factors(x): if x==1: ret...

0.536518

# cook your dish here try: t = int(input()) for _ in range(t): n = int(input()) a = list(map(int, input().split())) gcd = max(a[0], a[-1]) print(gcd) except EOFError:pass

0.53469

import functools def gcd(x,y): if(y == 0): return x return gcd(y, x%y) for _ in range(int(input())): n, m= map(int, input().split()) p = list(map(int, input().split())) ans = functools.reduce(lambda x,y: gcd(x, y), p) if(ans <= n): print(n-ans) else: f = [1] for k in range(ans//2, 1, -1): if ans...

0.5345

from sys import stdin def gt(num): if num: return num return 0 for __ in range(int(stdin.readline().split()[0])): n = int(stdin.readline().split()[0]) a = list(map(int, stdin.readline().split())) cnta = dict() cnta.setdefault(0) cntb = dict() cntb.setdefault(0) for i in a: cnta[i] = gt(cnta.get(i)) + 1 as...

0.534279

from sys import stdin, stdout from math import sin, tan, cos, pi, atan2, sqrt, acos, atan, factorial from random import randint n, x, y = map(int, stdin.readline().split()) values = list(map(int, stdin.readline().split())) if x > y: stdout.write(str(n)) else: v = sum(map(lambda v: int(v <= x), values)) st...

0.532776

def CeilIndex(A, l, r, key): while (r - l > 1): m = l + (r - l)//2 if (A[m] >= key): r = m else: l = m return r def LongestIncreasingSubsequenceLength(A, size): # Add boundary case, # when array size is one tailTable = [0...

0.531821

import sys def I(): return sys.stdin.readline().rstrip() class Heap: def __init__( self ): self.l = [ -1 ] self.n = 0 def n( self ): return self.n def top( self ): return self.l[ 1 ] def ins( self, x ): self.l.append( x ) n = len( self.l ) - 1 ...

0.531641

t=int(input()) while(t): k=1 j=0 n=int(input()) while(n>0): if(n<=k): j+=1 n=0 elif n>2*k: j+=2 n=n-2*k k+=1 else: j+=2 n=0 print(j) t-=1

0.530877

from math import sqrt class pro(object): def __init__(self,dif,sc): self.dif=dif self.sc=sc def __lt__(self,other): return self.dif>other.dif T=int(input()) mul=[1] for i in range(100): mul.append(mul[i]*10/9) inf=1000000007 for t in range(T): n=int(input()) effi,tim=list(m...

0.530619

import sys input = sys.stdin.readline for f in range(int(input())): n=int(input()) a=list(map(int,input().split())) a.sort() mx=1 for i in range(n): if a[i]<=i+1: mx=i+2 print(mx)

0.52993

t=int(input()) for _ in range(t): size=int(input()) li=list(map(int,input().split())) c = 0 for i in li: if(i >=len(li)/2): c += 1 print(c)

0.528647

#list(map(int,input().split())) t=int(input()) for _ in range(t): n=int(input()) it=list(map(int,input().split())) print(len(set(it)))

0.528407

import sys def input(): return sys.stdin.readline()[:-1] t = int(input()) for _ in range(t): n, k = map(int, input().split()) a = list(map(int, input().split())) cum = [0 for _ in range(2*k+2)] for i in range(n//2): x, y = a[i], a[n-i-1] cum[2] += 2 cum[min(x, y)+1] -= 1 cum[x+y] -= 1 cum[x+y+1] += 1 ...

0.528288

def f(a,n): l,r,s1,s2 = [0]*n, [0]*n, [], [] for i in range(n): count = 1 while(len(s1)>0 and a[i]<s1[-1][0]): count += s1[-1][1] s1.pop() s1.append((a[i],count)) l[i] = count for i in range(n-1,-1,-1): count = 1 while(len(s2)>0 and a[i]<=s2[-1][0]): count...

0.525822

import sys input = sys.stdin.readline from math import gcd t = int(input()) for _ in range(t): n = int(input()) l = list(map(int, input().split())) g = max(l) out = [] while l: nex = max((gcd(g,l[i]), i) for i in range(len(l))) out.append(l.pop(nex[1])) g = nex[0] print...

0.523491

import sys n = 500001 sqrt = int(0.75 * n**0.5) data = [0]*(n) ans = [[]] out = [] for i in range(1, sqrt): ans.append([0]*i) j = int(sys.stdin.readline()) qus = sys.stdin.readlines() for qu in qus: q = [int(i) for i in qu.split()] if q[0] == 1: x = q[1] y = q[2] data[x] += y ...

0.523193

import sys input = sys.stdin.readline rInt = lambda: int(input()) mInt = lambda: list(map(int, input().split())) rLis = lambda: list(map(int, input().split())) t = int(input()) for _ in range(t): n, k = mInt() a = rLis() b = rLis() a.sort() b.sort(reverse = True) for i in range(k): if a...

0.521924

t = int(input()) for i in range(t): n = int(input()) arr = [int(x) for x in input().split()] arr.sort(reverse=True) print(min(arr[1] - 1, len(arr) - 2))

0.521347

from collections import deque t=int(input()) for i in range(t): n=int(input()) N=[i for i in range(1, n+1)] w=list(map(int, input().split())) max_sweetness=max(w) sizes=[] cnt=0 for i in range(n): if w[i]!=max_sweetness: cnt+= 1 else: sizes.append(cnt) cnt=0 if cnt!=0: sizes[0]=(cnt+sizes[0])...

0.520571

T=int(input()) answer=[] for t in range(T): A,B=input().split() A=int(A) B=int(B) x=0 if(A>B): r=B B=A A=r while(A>0 and B>0): r=B//A x+=r r*=A B=B-r if(A>B): r=B B=A A=r answer.append(x) for...

0.51934

try: t=int(input()) for a in range(t): l=input().split() n=int(l[0]) m=int(l[1]) d={} s=0 for b in range(m): l1=input().split() i=int(l1[0]) j=int(l1[1]) k=int(l1[2]) for c in range(i,j+1): if c not in d: d[c]=10 for c in range(i,j+1): d[c]=d[c]*k for i in d: s=s+d[i] ...

0.51882

t=int(input()) for i in range(t): x,y=0,0 n,m=list(map(int,input().split())) l=list(map(int,input().split())) if(max(l)>m): print(-1) else: for i in range(len(l)): y+=l[i] if(y>m): y=l[i] x+=1 if(y>0): x+=1 print(x)

0.517982

# cook your dish here #t = int(input()) for i in range(int(input())): n,k = map(int,input().split()) l = list(map(int,input().split())) l.sort(reverse = True) c = 0 for i in l: if i >= l[k-1]: c += 1 print(c)

0.517742

from operator import itemgetter import sys input = sys.stdin.readline MAX_A = 200 t = int(input()) for _ in range(t): n = int(input()) a = list(map(int, input().split())) ruiseki = [[0] * MAX_A for i in range(n + 1)] for i in range(n): for j in range(MAX_A): ruiseki[i + 1][j] ...

0.5177

for _ in range(int(input())): f,d=list(map(int,input().split())) arr=list(map(int,input().split())) risk=0 days_risk=0 days_norm=0 if d==1: print(f) else: for a in arr: if a>=80 or a<=9: risk+=1 norm=f-risk if risk%d==0: days_risk=risk//d else: days_risk=(risk//d)+1 if norm%d==0: days...

0.517231

for _ in range(int(input())): n = int(input()) wt = list(map(int, input().split())) count = {} for x in wt: if x not in count: count[x] = 0 count[x] += 1 k = 0 for s in range(101): temp = 0 temp2 = 0 for x in count: if (s - x) in c...

0.517179

from collections import defaultdict as dd for _ in range(int(input())): n=int(input()) a=list(map(int,input().split())) d=dd(int) for i in a: d[i]+=1 ma=0 r=len(d.keys()) for i in d.keys(): ma=max(ma,min(d[i]-1,r),min(d[i],r-1)) print(ma)

0.515894

t = int(input()) for i in range(t): n = int(input()) A = [] for i in range(0, n): A.append([int(i) for i in input().split()]) ones = sum([sum(i) for i in A]) compare = n ans = 0 for i in range(0, n): if ones <= compare: ans = i break ...

0.515881

# cook your dish here for u in range(int(input())): n,r=list(map(int,input().split())) l=list(map(int,input().split())) m=0 for i in range(n-1): d=[] d.append(l[i]) c=1 while(i+c<n): d.append(l[i+c]) d.sort(reverse=True) if(d[0]+d[1]<=r...

0.515293

T=int(input()) for i in range(T): N=int(input()) A=list(map(int,input().split()))[:N] l=[] for j in range(len(A)): for k in range(j+1,len(A)): l.append(A[j]+A[k]) print(l.count(max(l))/((N*(N-1))/2))

0.514179

t = eval(input()) def moneda(m): h = 1 triange = [] while m >= h: triange.append(h) m -= h h += 1 return len(triange) triangulo = [] for i in range(t): n = eval(input()) triangulo.append(n) for i in triangulo: print(moneda(i))

0.514061

t=int(input()) for i in range(t): x,n=[int(g) for g in input().split()] sal=0 day=x while day<n: sal=sal+day day+=x print(sal)

0.513874

for _ in range(int(input())): n, m = map(int, input().split()) l1 = list(map(int,input().split())) print(min(sum(l1),m))

0.51375

t=int(input()) for _ in range(t): n=int(input()) arr=list(map(int,input().split())) d={} for i in range(n): if arr[i] in d: d[arr[i]].append(i) else: d[arr[i]]=[i] q=int(input()) for i in range(q): m=int(input()) if len(d[m])==...

0.513282

import sys input = sys.stdin.readline t=int(input()) for test in range(t): n=int(input()) A=list(map(int,input().split())) ANS=[] SET=set() NOW=1 while not (NOW in SET): ANS.append(NOW) SET.add(NOW) NOW=NOW-A[NOW-1] x=ANS.index(NOW) print(len(ANS[x:])) pr...

0.512964

for _ in range(int(input())): n=int(input()) f=list(map(int,input().split())) sum1=f[0] d=0 i=1 while sum1!=0 and i<n: sum1=sum1-1+f[i] d+=1 i+=1 print(d+sum1)

0.511885

t = int(input()) for i in range(t): n, s = [int(x) for x in input().split()] a= [int(x) for x in input().split()] need = -1 if (sum(a)) <= s: print(0) else: for i in range(n): if a[i] > need: need= a[i] index = i if s - a[i] < 0...

0.510073

t = int(input()) for _ in range(t): n, x, m = list(map(int, input().split())) left = x right = x for i in range(m): l,r = list(map(int, input().split())) if l < left <= r: left = l if r > right >= l: right = r print(right - left + 1)

0.510046

# cook your dish here import math; from math import gcd,sqrt,floor,factorial,ceil from bisect import bisect_left,bisect_right import bisect; import sys; from sys import stdin,stdout import os sys.setrecursionlimit(pow(10,7)) import collections from collections import defaultdict,Counter from statistics import median # ...

0.509199

try: def countsubsetsum(S,arr,n): k=[[0 for i in range(S+1)] for i in range(n+1)] for i in range(n+1): for j in range(S+1): if(j==0): k[i][j]=1 elif(i==0): k[i][j]=0 elif(arr[i-1]<=j): ...

0.509093

def solve(l): m = l.index(max(l)) if m == 0 or m == len(l) - 1: return 1 return 1 + min(solve(l[0:m]), solve(l[m+1:])) tc = int(input()) for test in range(tc): n = int(input()) l = list(map(int, input().split())) print(solve(l))

0.508552

#!usr/bin/env python3 from collections import defaultdict, deque from heapq import heappush, heappop from itertools import permutations, accumulate import sys import math import bisect def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline()) def LS():return [list(x) for ...

0.507856

while(True): n, m, x = map(int, input().split()) if(n==0 and m==0 and x==0): break money=0 for i in range(n): money=money + (x+m*i)//n print(money)

0.507206

for t in range(int(input().strip())): n = int(input().strip()) x = int(input().strip()) arr = list(map(int, input().strip().split())) arr.sort() day = 1 acc = 0 isPossible = True for a in arr: acc += 1 if acc > x: day += 1 acc = 1 if day >= a: isPossible = False break print("Possible" if isP...

0.506694

t=int(input()) while(t): n=int(input()) l=[] for i in range(n): l.append(list(map(int,input().split()))); m=[] for i in l: m.append((i[1]//(i[0]+1))*i[2]) res=max(m) print(res) t=t-1

0.506553

# cook your dish here for _ in range(int(input())): A,B=list(map(int,input().split())) l1=list(map(int,input().split())) l2=list(map(int,input().split())) for i in range(A*B): if l1[i]<l2[i]: l1[i]=0 else: l2[i]=0 l1.sort(reverse=True) l2.sort(reverse=True) w,d,c=0,0,...

0.50612

from math import gcd from itertools import groupby def gcd_split(seq): gcds= [int(gcd(a,b)==1) for a,b in zip(seq[1:],seq[:-1])] gcds.append(int(gcd(seq[0],seq[-1])==1)) # print(gcds) if max(gcds)==0: return -1 else: splits=[len(list(x))+1 for num,x in groupby(gcds) if num==0] # print(splits) if gcds[0]==...

0.504475

import bisect def solve(n,x_coords,y_coords,k,ans): x_coords.sort() dp = [] for i in range(n): x = x_coords[i] index = bisect.bisect(x_coords,x+k)-1 dp.append(index-i+1) dp_max = [] for i in reversed(dp): if not dp_max: dp_max.append(i) else: ...

0.504258

import sys from collections import defaultdict from math import gcd, sqrt MAX = pow(10, 5) # stdin = open("testdata.txt", "r") ip = sys.stdin n = int(ip.readline()) a = list(map(int, ip.readline().split())) gcd_count = defaultdict(int) main_gcd = defaultdict(int) main_gcd[a[0]] = 1 gcd_count[a[0]] = 1 for i in ran...

0.504134

import sys input = sys.stdin.readline import bisect t=int(input()) for testcases in range(t): n=int(input()) A=list(map(int,input().split())) m=int(input()) PS=[tuple(map(int,input().split())) for i in range(m)] PS.sort() K=[PS[-1]] for a,b in PS[::-1][1:]: if b<=K[-1][1]: ...

0.502518

def count_number(n, x): return len([j for j in range(1,n+1) if x%j==0 and x/j <= n])

0.50158

Assume that you have $k$ one-dimensional segments $s_1, s_2, \dots s_k$ (each segment is denoted by two integers — its endpoints). Then you can build the following graph on these segments. The graph consists of $k$ vertexes, and there is an edge between the $i$-th and the $j$-th vertexes ($i \neq j$) if and only if the...

import sys input = sys.stdin.readline t = int(input()) for _ in range(t): n = int(input()) ab = [list(map(int,input().split())) for i in range(n-1)] graph = [[] for i in range(n+1)] deg = [0]*(n+1) for a,b in ab: graph[a].append(b) graph[b].append(a) deg[a] += 1 deg[b] += 1 pnt = [max(deg[i]...

0.794071

import sys from collections import deque def solve(): sys.setrecursionlimit(10**6) readline = sys.stdin.readline writelines = sys.stdout.writelines N = int(readline()) G = [[] for i in range(N)] for i in range(N-1): u, v = map(int, readline().split()) G[u-1].append(v-1) G...

0.783468

import sys from collections import deque input=sys.stdin.readline t=1 t=int(input()) for _ in range(t): n=int(input()) val=set([0,2*10**5+1]) seg=[(0,2*10**5+1)] for i in range(n): l,r=list(map(int,input().split())) val.add(l) val.add(r) seg.append((l,r)) val=list(v...

0.752425

# cook your dish here def solve(edges,ans): n = len(edges) visited = set() parents = [-1]*(n+1) dp = [0]*(n+1) stack = [1] w = float('inf') x = -1 while stack: node = stack[-1] if node not in visited: count = 0 for kid in edges[node]: if parents[kid] == -1: if kid != 1: parents[kid] = n...

0.745217

import sys import threading from collections import defaultdict def put(): return map(int, input().split()) def dfs(i, p, m): cnt = 1 z = 0 for j in tree[i]: if j==p: continue if cnt==m: cnt+=1 index = edge_index[(i,j)] ans[cnt].append(index) z = max(dfs(j,i,cnt...

0.741642

import sys # inf = open('input.txt', 'r') # reader = (map(int, line.split()) for line in inf) reader = (list(map(int, line.split())) for line in sys.stdin) def minmaxPairs(g, costDict, n): G = B = 0 s = 1 stack = [s] traversal = [] visited = [False] * (n + 1) subtreeSize = [1 for _ in range(n...

0.724846

from collections import defaultdict as dd,deque as dq def opbfs(u,vis,ll,parr): q=dq([(u,0)]) uu=u su=0 while q: u,lol=q.pop() par=parr[u] if(lol%2==0): vis[u]=1 su+=ll[u-1] ll[u-1]=0 for j in d[u]: if(j!=par): q.appendleft((j,lol+1)) ll[uu-1]=su def bfs(height,d,parr): q=dq([1]) while...

0.723561

'''input 1 3 1 2 1 3 1 2 3 ''' import sys sys.setrecursionlimit(1000000) for _ in range(eval(input())): C=[] n=eval(input()) for i in range(n): C.append([]) for i in range(n-1): a,b=[int(x)-1 for x in input().split()] C[a].append(b) C[b].append(a) cnt=0 Co=[bin(int(x)).count("1") for x in input().split()]...

0.720363

import sys input = sys.stdin.readline n=int(input()) P=[list(map(int,input().split())) for i in range(n-1)] Group=[i for i in range(n+1)] def find(x): while Group[x] != x: x=Group[x] return x def Union(x,y): if find(x) != find(y): Group[find(y)]=Group[find(x)]=min(find(y),find(x)) ANS=[[...

0.716962

# cook your dish here import numpy as np tests = int(input()) for _ in range(tests): n = int(input()) weights = [int(j) for j in input().split()] edges = [[0] for _ in range(n-1)] for i in range(n-1): edges[i] = [int(j)-1 for j in input().split()] vertex_set = [[] for _ in range(n)] for i in ran...

0.710671

# cook your dish here from collections import defaultdict class sol(): def __init__(self,n,edges): self.n = n self.edges = edges self.graph = self.create_graph() self.precompute() def create_graph(self): graph = defaultdict(list) for e in self.edges: ...

0.703471

from bisect import bisect_left as bl from bisect import bisect_right as br from heapq import heappush,heappop,heapify import math from collections import * from functools import reduce,cmp_to_key import sys input = sys.stdin.readline M = mod = 998244353 def factors(n):return sorted(set(reduce(list.__add__, ([i, n//i] f...

0.703275

for t in range(eval(input())): n = eval(input()) a = [ [] for i in range(n+1) ] for i in range(n-1): x,y = list(map( int, input().split() )) a[x].append(y) a[y].append(x) vis = [0] * (n+1) vis[1] = 1 ans = [1] t1 = [1] t2 = [] while len(t1) > 0 : for u in t1: for...

0.695679

import bisect import sys sys.setrecursionlimit(10**7) def dfs(v): pos=bisect.bisect_left(dp,arr[v]) changes.append((pos,dp[pos])) dp[pos]=arr[v] ans[v]=bisect.bisect_left(dp,10**18) for u in g[v]: if checked[u]==0: checked[u]=1 dfs(u) pos,val=changes.pop() dp...

0.69205

import sys, re from collections import deque, defaultdict, Counter from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians from itertools import accumulate, permutations, combinations, product from operator import itemgetter, mul from copy import deepcopy from string import ascii_lowercase, ascii_uppercase...

0.689554

import sys from collections import defaultdict # 再帰制限を緩和するおまじない sys.setrecursionlimit(10**6) def sum(n):return n*(n+1)//2 # 部分木のサイズと、「色iを封鎖したときに到達できない頂点の個数」を持つ辞書を返す def dfs(v,p): ret=defaultdict(int) size=1 for vv in g[v]: if vv==p: continue ss,d=dfs(vv,v) size+=ss ...

0.688168

maxn=50+10 g=[None]*maxn dp=[None]*maxn c=[None]*maxn size=[0]*maxn for i in range(0,maxn): c[i]=[0]*maxn c[i][0]=1 for j in range(1,i+1): c[i][j]=c[i-1][j-1]+c[i-1][j] n=int(input()) for i in range(1,n+1): g[i]=[] for i in range(1,n): u,v=input().split() u=int(u) v=int(v) g[u]...

0.687144

from sys import stdin,stdout input=stdin.readline n=int(input()) a=[[] for i in range(n)] for i in range(n-1): u,v=map(int,input().split()) a[u-1].append(v-1) a[v-1].append(u-1) b=[0]*n vis=[0]*n st=[(0,0)] vis[0]=1 pa=[0]*n while st: x,y=st.pop() b[x]=y for i in a[x]: i...

0.682114

counter = -1 def flattree(node): nonlocal counter if visited[node]==1: return else: visited[node]=1 counter += 1 i_c[node] = counter flat_tree[counter] = swt[node] for i in graph[node]: if visited[i]==0: flattree(i) ...

0.675926

from sys import stdin n = int(stdin.readline()) g = dict() for i in range(n-1): u,v = map(int,stdin.readline().split()) g.setdefault(u-1,[]).append(v-1) g.setdefault(v-1, []).append(u-1) st = [0] rank = [0]*n tree = [0]*n msk = [0]*n rd = dict() while len(st)>0: top = st.pop() msk[top] = 1 for c...

0.673836

from collections import deque import sys def input(): return sys.stdin.readline()[:-1] def main(): T = int(input()) for i in range(T): N = int(input()) e_list = [[] for i in range(N)] for i in range(N-1): a,b = list(map(int,input().split())) a,b = a-1,b-1 ...

0.672885

# cook your dish here try: X=list(map(int, input().split())) except: X=[0,0] ch=[] chnew=[] par={} par[1]=0 for i in range(X[0]+1): ch.append([]) chnew.append([]) for i in range(X[0]-1): Y=list(map(int, input().split())) #par[Y[1]]=[Y[0],Y[2]] ch[Y[0]].append([Y[1],Y[2]]) ch[Y[1]].append...

0.67259

def main(): def countchildren(graph,vert,memo,pard=None): dumi=0 for child in graph[vert]: if child!=pard: if len(graph[child])==1: memo[child]=0 else: memo[child]=countchildren(graph,child,memo,vert)[0] ...

0.672532

from sys import stdin from math import ceil, gcd # Input data #stdin = open("input", "r") def dfs(src, visit): visit[src] = 1 for nbr in d[src]: if visit[nbr] == 0: dfs(nbr, visit) for _ in range(int(stdin.readline())): n, m = list(map(int, stdin.readline().split())) ...

0.672294

# cook your dish here # cook your dish here from math import log2; import sys; sys.setrecursionlimit(10 ** 7) from collections import defaultdict inf = float("inf") def find_height(node): nodes[node]=1 for i in graph[node]: nodes[node]+=find_height(i) return nodes[node] def find_sum(node): sum...

0.671534

import sys sys.setrecursionlimit(10**8) MOD = 10**9+7 fac = [0]*(10**5+1) def pre() : fac[0] = 1 for i in range(1,10**5+1) : fac[i] = fac[i-1]*i fac[i] = fac[i]%MOD def dfs(gp , vertex , visited , deg , ans) : visited[vertex] = 1 stack = [] stack.append(vertex) while len(stack)>0 : vertex = stack.pop() ...

0.671351

#!usr/bin/env python3 from collections import defaultdict, deque from heapq import heappush, heappop from itertools import permutations, accumulate import sys import math import bisect def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline()) def LS():return [list(x) for ...

0.668671

import sys n, m = list(map(int, sys.stdin.readline().strip().split())) L = [0 for i in range (0, n)] H = [[] for i in range (0, n)] for i in range (0, m): x, y = list(map(int, sys.stdin.readline().strip().split())) x = x - 1 y = y - 1 if x > y: x, y = y, x L[y] = L[y] + 1 H[x].append(y)...

0.659241

import sys input = sys.stdin.readline sys.setrecursionlimit(10**5) N, Q = map(int, input().split()) path = [[] for _ in range(N)] for _ in range(N-1) : a, b, c, d = (int(i) for i in input().split()) path[a-1].append((b-1, c-1, d)) path[b-1].append((a-1, c-1, d)) # doublingに必要なKを求める for K in range(18) : ...

0.655283

import sys sys.setrecursionlimit(10**7) N, Q = list(map(int, input().split())) root = [[] for _ in range(N)] ans = [0]*N for _ in range(N-1): a,b=list(map(int, input().split())) a,b=a-1,b-1 root[a].append(b) root[b].append(a) for _ in range(Q): p,x=list(map(int, input().split())) ans[p-1]+=x visited...

0.654851

import sys def powc(x,n,m): res = 1 xx=x while n: if n&1: res = (res*xx)%m xx=xx*xx%m n >>= 1 return res def circles(u): r = 0 S = [(u,-1,0)] Visited[u] = 0 for s in S: for e in V[s[0]]: if e[0] != s[1]: if Visited[e[0]]==-1: Visited[e[0]] = s[2]^e[1] ...

0.653432

t=eval(input()) def func(k,n,x,dist,graph): if k==n: x+=[dist[n]] return for i in range(1,n+1): if graph[k][i]!=0 and dist[i]==-1: dist[i]=dist[k]+graph[k][i] func(i,n,x,dist,graph) dist[i]=-1 while t: graph=[[0 for i in range(11)]for j in range(11)] v,e=list(map(int,input().split())) for i in r...

0.652874

import sys fin = sys.stdin n = int(fin.readline()) ut = [-1] * n vc = [[] for i in range(0, n)] cvc = [[] for i in range(0, n)] nr = [0] * n for i in range(0, n - 1): a, b = [int(number) for number in fin.readline().split()] a -= 1 b -= 1 vc[a].append(b) cvc[b].append(a) nr[a] += 1 size = [0] * ...

0.651216

import sys import collections rlines = sys.stdin.readlines() lines = (l.strip() for l in rlines) def eucycle(n,m,adj): diredges = [] us = list(adj.keys()) for u in us: while adj[u]: v0 = u v1 = adj[v0].pop() adj[v1].remove(v0) diredges.append((v0,v1))...

0.650358

t=int(input()) for _ in range(t): n,m=map(int,input().split()) mat=[0 for i in range(n)] #mat=[[0 for i in range(n)] for j in range(n)] for i in range(m): u,v=map(int,input().split()) u,v=(u-1),(v-1) mat[u]|=(1<<v) mat[v]|=(1<<u) for i in range(n): mat[i]|=(1<<i) g...

0.649309

for tcase in range(int(input())): n=int(input()) ls = list(map(int, input().split())) oneneed = 2*(n - ls.count(1)) ldct = {0:0} ctr = 0 eaten = 0 for i in range(n-1,-1,-1): eaten += 1 ctr += (1 if ls[i] == 2 else -1) if ctr not in ldct: ldct[ctr] = eaten ...

0.647353

INT = lambda: int(input()) INTM = lambda: map(int,input().split()) STRM = lambda: map(str,input().split()) STR = lambda: str(input()) LIST = lambda: list(map(int,input().split())) LISTS = lambda: list(map(str,input().split())) from collections import deque class Graph(): def __init__(self, v): from heapq i...

0.646794

from sys import stdin from decimal import Decimal as D input = stdin.readline n = int(input()) adj = [[] for i in range(n+1)] tree = [[] for i in range(n+1)] visit = [-1]*(n+1) length = [-1]*(n+1) for i in range(n-1): a, b = map(int,input().split()) adj[a].append(b) adj[b].append(a) bfsord = [] from collec...

0.645912

import sys def I(): return sys.stdin.readline().rstrip() class Heap: def __init__( self ): self.l = [ -1 ] self.n = 0 def n( self ): return self.n def top( self ): return self.l[ 1 ] def ins( self, x ): self.l.append( x ) n = len( self.l ) - 1 ...

0.642049

def detect_triangle(adj): for x in range(len(adj)): for y in adj[x]: if not set(adj[x]).isdisjoint(adj[y]): return True for _ in range(int(input())): n,m=list(map(int,input().split())) graph=[[] for i in range(n)] for i in range(m): u,v=list(map(int,input().split())) grap...

0.64143

# cook your dish here from operator import itemgetter t=int(input()) for _ in range(t): n=int(input()) start=[] end=[] for i in range(n): first, last = map (int, input().split()) start.append((first, i)) end.append((last, i)) score=[0]*n start.sort(key=itemgetter(0)) ...

0.640788

class Solution: def sumOfDistancesInTree(self, N: int, edges: List[List[int]]) -> List[int]: tree = [[] for _ in range(N)] for i, j in edges: tree[i].append(j) tree[j].append(i) cnt = [1] * N res = [0] * N def post_order(node, parent)...

0.640594

class BIT(): """区間加算、一点取得クエリをそれぞれO(logN)で応えるデータ構造を構築する add: 区間[begin, end)にvalを加える get_val: i番目(0-indexed)の値を求める """ def __init__(self, n): self.n = n self.bit = [0] * (n + 1) def get_val(self, i): i = i + 1 s = 0 while i <= self.n: s += self....

0.638005

from sys import stdout n = int(input()) class Person: num = n - 1 def __init__(self, rel): self.relationship = int(rel, 2) def __getitem__(self, k): return (self.relationship >> Person.num - k) & 1 rel = [Person(input()) for _ in range(n)] dp = [[0] * n for _ in range(1 << n)] for ...

0.633661

from collections import defaultdict class SumDefaultdict(defaultdict): def __init__(self, *args, **kwargs) -> None: super().__init__(int, *args, **kwargs) self.mx = max(self.values()) self.mx_sum = sum(c for c, v in list(self.items()) if v == self.mx) def sumadd(self, map): f...

0.632579

from sys import stdin from collections import defaultdict import heapq n = int(stdin.readline()) a = [[] for _ in range(n)] for _ in range(n-1): e = stdin.readline().split(' ') u, v = int(e[0]), int(e[1]) a[u-1].append(v-1) a[v-1].append(u-1) leaves = [i for i in range(n) if len(a[i]) == 1] def dfs...

0.631026

import sys input = sys.stdin.readline T = int(input()) for _ in range(T): N, M = list(map(int, input().split())) E = [[] for aa in range(N)] for __ in range(M): a, b = list(map(int, input().split())) E[a-1].append(b-1) E[b-1].append(a-1) D = [-1] * N D[0] = 0 d = 0 ...

0.628783

n, m = list(map(int, input().split())) maxN = 2 * (10 ** 5) + 10 edges = [[] for i in range(0, maxN)] que = [[] for _ in range(0, maxN)] ans = [0] * m sz = [1 for _ in range(0, n)] p = [i for i in range(0, n)] total_sum = 0 def get(u): if p[u] == u: return u p[u] = get(p[u]) return p[u] def unite...

0.628629

def dfs(node): nonlocal adj,leaf val=0 flag=0 for i in adj[node]: x= dfs(i) val+=x if x==0: flag=1 leaf+=val-val%3 if val%3==0 and flag==0: return 1 else: return 0 for _ in range(int(input())): n=int(input()) adj=[[] for i in range(n+2)] arr=[int(i) for i in input().split()] leaf=0 #print(adj) ...

0.628474

T = int(input()) M = 10 ** 9 + 7 for _ in range(T): N = int(input()) A = list(map(int, input().split())) if N == 1: print(0) continue B = {} C = {} for i in range(N - 1): u, v = input().split() u = int(u) - 1 v = int(v) - 1 if u not in B: B[u] = [] if v not in B: B[v] = [] B[u].appe...

0.627996

from sys import stdin for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) id = list(zip(l,list(range(n)))) id.sort() val, pos = zip(*id) blok = [] cur = [pos[0]] for i in range(1,n): if val[i] == val[i-1]: cur.append(pos[i]) else:...

0.626074

import sys import heapq import re from itertools import permutations from bisect import bisect_left, bisect_right from collections import Counter, deque from fractions import gcd from math import factorial, sqrt, ceil from functools import lru_cache, reduce INF = 1 << 60 MOD = 1000000007 sys.setrecursionlimit(10 ** 7) ...

0.624684

from heapq import heappop, heappush n , q = map(int,input().split()) enzi = [[0,0] for i in range(n)] youti = [[] for i in range(2*10**5)] saikyo = [0 for i in range(2*10**5)] ans = [] for i in range(n): a , b = map(int,input().split()) enzi[i] = [a,b-1] heappush(youti[b-1],(-a,i)) for i in range(2*10**5)...

0.621752

import sys t = int(sys.stdin.readline()) for _ in range(t): n = int(sys.stdin.readline()) intervals = [None]*n for i in range(n): intervals[i] = tuple([int(a) for a in sys.stdin.readline().split()]) intervals = list(zip(intervals, list(range(n)))) starts = sorted(intervals, key = lambda x:...

0.62051

q = int(input()) def full_way(u): res = set() while u >= 1: res.add(u) u //= 2 return res def get_way(u, v): res1 = full_way(u) res2 = full_way(v) m = max(res1 & res2) res = set() for x in res1 | res2: if x > m: res.add(x) return res d ...

0.620021

t=int(input()) for q in range(t): n=int(input()) x=list(map(int,input().split())) dic={} dic2={} for i in range(n): dic2[x[i]]=1 #print dic2 if len(dic2)==n: n+=2 print((n*(n-1)*(n-2)*(n-3))/24) continue counter=0 for i in range(n-1): if x[i] in dic: dic[x[i]]+=1 else: dic[x[i]]=1 for j in...

0.619769

from queue import Queue import sys cost = [] def readarray(): return list(map(int, input().split(' '))) n = int(input()) graph = [[] for i in range(n)] for i in range(n - 1): u, v, c = readarray() u, v = u - 1, v - 1 cost.append(c) graph[u].append((v, i)) graph[v].append((u, i)) order = [] used = [0] * n q...

0.619694

import sys input = sys.stdin.readline for f in range(int(input())): n,m=list(map(int,input().split())) neig=[0]*n for i in range(n): neig[i]=[0] for i in range(m): a,b=list(map(int,input().split())) a-=1 b-=1 neig[a][0]+=1 neig[a].append(b) lev=[1...

0.619095

class Graph: def __init__(self, n_vertices, edges, directed=True, weighted=False): self.n_vertices = n_vertices self.edges = edges self.directed = directed self.weighted = weighted @property def adj(self): try: return self._adj except AttributeE...

0.618728

import sys from collections import deque def diameter(n, links): q = deque([(0, -1)]) v = 0 while q: v, p = q.popleft() q.extend((u, v) for u in links[v] if u != p) q = deque([(v, -1)]) w = 0 parents = [-1] * n while q: w, p = q.popleft() parents[w] = p ...

0.617561

import sys sys.setrecursionlimit(200000) n = int(input()) arr = [[] for i in range(n)] for i in range(n - 1): a, b = map(int, input().split()) arr[a - 1].append(b - 1) arr[b - 1].append(a - 1) s = max([len(p) for p in arr]) + 1 print(s) colored = [0] * n def dfs(v, c, d): colored[v] = p = c for u ...

0.616054

MAXX = 10**9+1 N = eval(input()) nodes = list(map(int, input().split(" "))) edges = [set() for _ in range(N)] for _ in range(N-1): a, b = list(map(int, input().split(" "))) edges[a-1].add(b-1) edges[b-1].add(a-1) path = [[] for _ in range(N)] visited, tovisit = set(), [(0, 0)] while tovisit: p, v = tovi...

0.614888

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline mii=lambda:list(map(int,input().split())) n,m=mii() a=[[] for _ in range(n)] c=[123456 for _ in range(n)] for _ in range(m): u,v=mii() u%=n v%=n if v<u: v+=n a[u].append(v) if c[u]>v: c[u]=v ans=[] for i in list(range(1,n))+[0]: ...

0.614698

import sys sys.setrecursionlimit(10**6) ans = 0 def solve(): n = int(input()) Adj = [[] for i in range(n)] for i in range(n - 1): ai, bi, ci = map(int, sys.stdin.readline().split()) Adj[ai].append((bi, ci)) Adj[bi].append((ai, ci)) dfs(n, Adj, -1, 0, 0) print(ans) def ...

0.613902

def CeilIndex(A, l, r, key): while (r - l > 1): m = l + (r - l)//2 if (A[m] >= key): r = m else: l = m return r def LongestIncreasingSubsequenceLength(A, size): # Add boundary case, # when array size is one tailTable = [0...

0.611849

class UnionFind: def __init__(self, N): self.par = [i for i in range(N)] self.rank = [1 for i in range(N)] self.rank[0] = 0 def union(self, x, y): if not self.is_same_set(x, y): par_x = self.find_par(x) par_y = self.find_par(y) if self.rank[pa...

0.611527

import sys from collections import deque as dq n = int(input()) ind = 0 inp = [int(x)-1 for line in sys.stdin.readlines() for x in line.split()] coupl = [[] for _ in range(n)] for _ in range(n-1): a,b = inp[ind],inp[ind+1] ind+=2 coupl[a].append(b) coupl[b].append(a) Q = dq() found = [False]*n master...

0.611265

from sys import stdin input = stdin.readline q = int(input()) for rwerew in range(q): n = int(input()) p = list(map(int,input().split())) c = list(map(int,input().split())) for i in range(n): p[i] -= 1 przyn = [0] * n grupa = [] i = 0 while i < n: if przyn[i] == 1: i += 1 else: nowa_grupa = [i] j...

0.610126

import sys input = sys.stdin.readline NEGINF = -1000000 n = int(input()) adj = [[] for i in range(n)] parent = [-1] * n visited = [False] * n for _ in range(n - 1): a, b = list(map(int, input().split())) adj[a - 1].append(b - 1) adj[b - 1].append(a - 1) tup = tuple() outs = [tup] * n q = [(0, 0)] while...

0.607363

import sys input = sys.stdin.readline n,m=list(map(int,input().split())) FR=[list(map(int,input().split())) for i in range(m)] #UnionFind Group=[[i,1] for i in range(n+1)] def find(x): while Group[x][0] != x: x=Group[x][0] return x def Union(x,y): if find(x) != find(y): SUM=Group[find(y...

0.607113

import sys answer = 1 z = True primes = [] for i in range (2, 5 * 10 ** 2): v = True for p in primes: if i % p == 0: v = False if v == True: primes.append(i) n = int(sys.stdin.readline().strip()) a = list(map(int, sys.stdin.readline().strip().split())) if sum(a) == n: z = F...

0.60412

import sys readline = sys.stdin.readline def parorder(Edge, p): N = len(Edge) par = [0]*N par[p] = -1 stack = [p] order = [] visited = set([p]) ast = stack.append apo = order.append while stack: vn = stack.pop() apo(vn) for vf in Edge[vn]: if vf i...

0.603744

n=int(input()) l=[] dp=[] d={} for i in range(n): l.append(int(input())) d[i]=[] dp.append([0,0]) for i in range(n-1): a,b=list(map(int,input().split())) d[a-1].append(b-1) d[b-1].append(a-1) #print(l) #print(d) def dfs(ch,pa,visited): dp[ch][1]=l[ch] #print(dp[ch],ch+1) for i in range(len...

0.602333

def main(): n, m = list(map(int, input().split())) l = [[] for _ in range(n + 1)] for _ in range(m): u, v = list(map(int, input().split())) l[u].append(v) l[v].append(u) res = [0] * (n + 1) for u, x in enumerate(res): if not x: x, nxt = -1, [u] ...

0.602282

for i in range(int(input())): n = int(input()) c = list(map(int, input().split())) d = {} d[0] = -1 parity = 0 ans = 0 for i in range(n): parity ^= 1 << (c[i]-1) for t in range(30): x = parity^(1<<t) if(x in d.keys()): ans = max(ans, i - d[x]) if parity not ...

0.600641

class BIT(): def __init__(self,n): self.BIT=[0]*(n+1) self.num=n def query(self,idx): res_sum = 0 while idx > 0: res_sum += self.BIT[idx] idx -= idx&(-idx) return res_sum #Ai += x O(logN) def update(self,idx,x): while idx <= self....

0.597898

def mForMaxSeq(arr, n): eim = dict() for i in range(n): if arr[i] in eim: eim[arr[i]].append(i) else: eim[arr[i]] = [i] keys = sorted(eim.keys()) # print(eim, keys) connected = False count = 0 pI = -1 nKeys = len(keys) ...

0.597895

n = int(input()) pos,tree,ans,sz = list(map(int,input().split())) if n > 1 else [],[],[],[] for i in range(n): tree.append([]) ans.append(0.0) sz.append(0) for i in range(n-1): tree[pos[i]-1].append(i+1) for i in range(n)[::-1]: sz[i] = 1 for to in tree[i]: sz[i] += sz[to] for i in range(n): for to...

0.597865

for _ in range(int(input())): n=int(input()) a=[] l=0 for i in range(n): a.append(list(map(int,input().split()))) for i in range(n-1,0,-1): r=a[i][i-1]+1 if a[i][i]!=r: l+=1 n=i+1 for j in range(n): for k in range(j,n): a[j][k],a[k][j]=a[k][j],a[j][k] print(l)

0.597439

t=int(input()) for _ in range(t): n=int(input()) arr=list(map(int,input().split())) d={} for i in range(n): if arr[i] in d: d[arr[i]].append(i) else: d[arr[i]]=[i] q=int(input()) for i in range(q): m=int(input()) if len(d[m])==...

0.596744

from collections import defaultdict def dfs(s, t): visited = 0 q = [(s, 0)] while q: v, used = q.pop() if v == t: return used visited |= used for lb, u in graph[v]: if lb & visited: continue q.append((u, used | lb)) n = ...

0.595888

from heapq import heappush, heappop queue = [] degree = [] s = [] ans = [] n = int(input()) used = [False for i in range(n)] for i in range(n): a, b = list(map(int, input().split())) degree.append(a) s.append(b) heappush(queue, (a, i)) while queue: el = heappop(queue) vert = el[1] if used[ve...

0.595216

from collections import defaultdict import sys sys.setrecursionlimit(10 ** 6) def main(): N = int(input()) V = 100005 to = defaultdict(list) for _ in range(N): X, Y = map(int, input().split()) Y += V to[X].append(Y) to[Y].append(X) visited = [0] * (2 * V) cnt ...

0.595068

test=int(input()) for t in range(test): n= int(input()) adj=[[] for i in range(n+1)] for _ in range(n-1): a,b=list(map(int,input().split())) adj[a].append(b) adj[b].append(a) #print(adj) root=1 q,s=[root],set([root]) for x in q: adj[x]= [p for p in adj[x] if p not in s] q.extend(adj[x]) s.upda...

0.59436

import sys def input(): return sys.stdin.readline()[:-1] t = int(input()) for _ in range(t): n, k = map(int, input().split()) a = list(map(int, input().split())) cum = [0 for _ in range(2*k+2)] for i in range(n//2): x, y = a[i], a[n-i-1] cum[2] += 2 cum[min(x, y)+1] -= 1 cum[x+y] -= 1 cum[x+y+1] += 1 ...

0.593784

from sys import stdin from fractions import gcd n = int(stdin.readline().strip()) v = list(map(int, stdin.readline().strip().split())) adj = [[] for _ in range(n)] for _ in range(n-1): x, y = list(map(int, stdin.readline().strip().split())) adj[x-1].append(y-1) adj[y-1].append(x-1) root_divisors = [] cnt...

0.592091

def check(l,n): m = 0 for i in range(n-1): x = l[i] c = 0 j = i while (j+2<n and l[j+2]==x) or (j+1<n and l[j+1] == x): if l[j+1] == x: j = j+1 else: j+=2 c+=1 if m<c: m = c return m t = ...

0.591669

from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement from collections import deque,defaultdict,Counter from bisect import bisect_left,bisect_right from operator impor...

0.589975

# cook your dish here t=int(input()) for _ in range(t): n=int(input()) array=list(map(int, input().split())) list_sub=[] idx=0 counter=0 for i in range(n-1): if counter%2==0 and array[i]<=array[i+1]: counter+=1 elif counter%2==1 and array[i]>=array[i+1]: ...

0.589123

3 import math import os import sys DEBUG = 'DEBUG' in os.environ def inp(): return sys.stdin.readline().rstrip() def dprint(*value, sep=' ', end='\n'): if DEBUG: print(*value, sep=sep, end=end) INF = 10 ** 20 def solve(N, A, B): dp = {A[0]: 0, A[0] + 1: B[0], A[0] + 2: B[0] * 2} for i...

0.588993

f = lambda: map(int, input().split()) m = 1000000007 d, n = f() t = list(f()) p = [[] for i in range(n)] for j in range(n - 1): u, v = f() u -= 1 v -= 1 p[u].append(v) p[v].append(u) def g(u, x, a, b, q): k = 1 for v in p[u]: if a < t[v] <= b or t[v] == a and v > q: if ...

0.588902

3 import array import math import os import sys DEBUG = 'DEBUG' in os.environ def inp(): return sys.stdin.readline().rstrip() def dprint(*value, sep=' ', end='\n'): if DEBUG: print(*value, sep=sep, end=end) def solve(N, M, G): if N == 2: return [0, 1] degv = [set() for _ in ran...

0.588463

n = int(input()) a = list(map(int, input().split())) g = [list() for _ in range(n)] for _ in range(n-1): u,v = list(map(int, input().split())) g[u-1].append(v-1) g[v-1].append(u-1) st = [x*2-1 for x in a] + [0] p = [-1]*n q = [0] while q: v = q.pop() for x in g[v]: if x == p[v]: continue p[x] = v ...

0.588296

from operator import itemgetter import sys input = sys.stdin.readline MAX_A = 200 t = int(input()) for _ in range(t): n = int(input()) a = list(map(int, input().split())) ruiseki = [[0] * MAX_A for i in range(n + 1)] for i in range(n): for j in range(MAX_A): ruiseki[i + 1][j] ...

0.588285

from collections import defaultdict n=int(input()) d=defaultdict(dict) for i in range(n): x=input() x=x.split() if i==0: P = x q=int(input()) Con=[] for j in range(q): Con.append(input().split()) if i!=n-1: input() d[x[0]][x[1]]=Con ver=[P] ans={} while ver: ...

0.587647

# fast io import sys def fop(s): sys.stdout.write(str(s)+'\n') def fip(): return sys.stdin.readline() fintinp = lambda : int(fip()) def flistinp(func= int): return list(map(func,fip().split())) def fnsepline(n,func=str): return [func(fip()) for _ in range(n)] #-------------------code------------------------ def even(...

0.587189

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): #print(*args, **kwargs, file=sys.stderr) # in python 3.4 **kwarg...

0.586777

from math import sqrt def get_distance(x1,y1,x2,y2): return sqrt((x1-x2)**2 + (y1-y2)**2) T = int(input()) ans = [] for _ in range(T): blank = input() N = int(input()) C = [[] for i in range(10**4+1)] for i in range(N): x,y = [int(i) for i in input().split()] C[x].append(y) ...

0.586292

# cook your dish here t=int(input()) j=0 while j<t: n=int(input()) lst=list(map(int,input().split())) s=set() d=list() for i in lst: if i in s: s.remove(i) d.append(i) else: s.add(i) x=len(d) if x%2==0: print(x//2) else: ...

0.586198

from math import * n, q = list(map(int, input().split())) after = min(15, n) before = n - after def calc(left, right): return right * (right + 1) // 2 - left * (left - 1) // 2 def perm(i): unused = [i + 1 for i in range(after)] arr = [] for j in reversed(list(range(after))): cur = i // fact...

0.585696

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline mii=lambda:list(map(int,input().split())) n,m=mii() a=[0 for _ in range(n)] c=[123456 for _ in range(n)] for _ in range(m): u,v=mii() u%=n v%=n if v<u: v+=n a[u]+=1 if c[u]>v: c[u]=v ans=[] for i in list(range(1,n))+[0]: out=...

0.585304

Ayoub thinks that he is a very smart person, so he created a function $f(s)$, where $s$ is a binary string (a string which contains only symbols "0" and "1"). The function $f(s)$ is equal to the number of substrings in the string $s$ that contains at least one symbol, that is equal to "1". More formally, $f(s)$ is equ...

import sys input = sys.stdin.readline t=int(input()) def calc(x): return x*(x+1)//2 for test in range(t): n,m=list(map(int,input().split())) ANS=calc(n) k=n-m q,mod=divmod(k,m+1) ANS-=calc(q+1)*mod+calc(q)*(m+1-mod) print(ANS)

0.81484

import sys input = sys.stdin.readline rInt = lambda: int(input()) mInt = lambda: list(map(int, input().split())) rLis = lambda: list(map(int, input().split())) t = int(input()) for _ in range(t): n, m = mInt() if n == 1: print(0) elif n == 2: print(m) else: print(2 * m)

0.790526

t = int(input()) for _ in range(t): n,m = map(int,input().split()) if n==1: print(m) else: if n%2==0: print((n//2)*m) else: print(((n//2)+1)*m)

0.788745

for _ in range(int(input())): n,m=map(int, input().split()) if n==1: print(0) elif n==2: print(m) else: print(m*2+n-3)

0.771924

from math import factorial for _ in range(int(input())): N,M=[int(a) for a in input().split()] print(float(N+M-1))

0.76895

# This is not my code, it's Snehasish Karmakar's. Refer to http://www.codechef .com/viewsolution/7153774 # for original version. # Submitting it to try and work out if it can be sped up. def compute_nCr(n,r) : C[0][0]=1 for i in range(1,n+1) : # print "i",i C[i][0]=1 for j in range(1,min(i,r)+1) : i...

0.739061

import sys def fin(): return sys.stdin.readline().strip() def fout(s, end="\n"): sys.stdout.write(str(s)+end) MOD = pow(10, 9)+7 t = int(input()) while t>0: t -= 1 n, m = list(map(int, fin().split())) if n == 1: print(m%MOD) continue dp1 = m*(m-1) dp2 = m for i in range(3, n+1): temp = dp2 dp2 = dp1 d...

0.727881

# cook your dish here import math T=int(input()) for i in range(T): a=list(map(int,input().split())) n=a[0] m=a[1] print(m*n//math.gcd(m,n))

0.72648

for _ in range(int(input())): n, m = list(map(int, input().split())) A = [] x = 1 while True: if (m * x) % 10 not in A: A.append((m * x) % 10) else: break x += 1 s = sum(A) n //= m print(s * (n // len(A)) + sum(A[:n % len(A)]))

0.705306

# cook your dish here from sys import stdin,stdout,setrecursionlimit from math import ceil mod = 1000000007 t = int(stdin.readline()) for _ in range(t): m,n = list(map(int,input().split())) if m < n: m,n = n,m y = n-1 s1 = ((y*(y+1)) //2)%mod s2 = ((y*(y+1)*(2*y+1)) //6)%mod s3 = ((y*y...

0.70025

""" Code chef problem DESTCELL, Destroy Cells """ def find_destroyed_cells(cell_advance, n, m, k): row = 1 col = 1 destroyed_cells = {(1, 1)} while True: row, col = cell_advance(row, col, n, m, k) if row <= n and col <= m: destroyed_cells.add((row, col)) else: break return destroyed_cells def cell_...

0.698041

# cook your dish here from math import pow t = int(input()) for _ in range(t): m,n = map(int,input().rstrip().split()) cnt = len(str(n)) x = pow(10,cnt) if n == x-1: print(m*cnt,m) else: print(m*(cnt-1),m)

0.686398

try: t=int(input()) while t>0: [a,b]=[int(x) for x in input().split()] if a==1 and b==1: print(1) continue if a%2==0: o1=a//2 e1=a//2 else: o1=a//2+1 e1=a//2 if b%2==0: o2=b//2 e2=b//2 else: o2=b//2+1 e2=b//2 print(e1*e2+o1*o2) t-=1 except: pass

0.685988

try: t=int(input()) for a in range(t): l=input().split() n=int(l[0]) m=int(l[1]) d={} s=0 for b in range(m): l1=input().split() i=int(l1[0]) j=int(l1[1]) k=int(l1[2]) for c in range(i,j+1): if c not in d: d[c]=10 for c in range(i,j+1): d[c]=d[c]*k for i in d: s=s+d[i] ...

0.685024

for _ in range(int(input())): N,M = list(map(int,input().split())) count,e,perm = 0,0,1 while(True): lim,start = N//(M**e),N//(M**(e + 1)) + 1 num = lim - start + 1 divs = num//M if((start + divs*M) <= lim): r = (start+divs*M)%M if(r == 0 or (r + (lim - (start + divs*M)) >= M)): divs += 1 cmon = ...

0.681124

# cook your dish here for t in range(int(input())): n,m=[int(x)for x in input().rstrip().split()] s=[] for p in range(n): s.append(10) for c in range(m): i,j,k=[int(x)for x in input().rstrip().split()] for q in range(i-1,j): s[q]=s[q]*k print(sum(s)//n)

0.680202

# cook your dish here # cook your dish here n=0;m=0; A=[];B=[]; anscount=0;k=0; def generate(n,m,l): nonlocal anscount if(len(l)==n+m): X=l i,j = 0,0 C=[0 for t in range(n+m)] while((i+j)<(n+m)): if(X[i+j] == 0): C[i+j] = A[i] i = i+1 else: C[i+j] = B[j] j = j+1 ans = len(C) for i i...

0.673737

# cook your dish here def count(k,n,m): sum1=(m*(m+1))//2 sum2=(m*(m-1))//2 ct=0 for i in range(n): for j in range(n): if i<j and k[i]>k[j]: ct+=sum1 elif jk[j]: ct+=sum2 return ct test=int(input()) for _ in range(test): ...

0.673505

# cook your dish here t = int(input()) for _ in range(t): m,n = [int(d) for d in input().split()] if m == 1: arr = [] if n%4 == 0: print(2) arr = [[1,1,2,2]*(n//4)] elif n%4 == 1: if n == 1: print(1) arr = [[1]] else: print(2) arr = [[1,1,2,2]*(n//4) + [1]] elif n%4 == 2: if n ...

0.671456

for _ in range(int(input())): n = int(input()) r1 = list(map(int, input().split())) m = int(input()) r2 = list(map(int, input().split())) o11 = sum(t % 2 for t in r1) # Counts odd number o12 = n - o11 o21 = sum(t % 2 for t in r2) # Counts odd number o22 = m - o21 print (o11 * o21 + o...

0.670785

for t in range(int(input())): n,b,m = list(map(int,input().split())) ans = 0 while n>0: ans+=b half = (n+1)/2 if n%2 else n/2 ans+=m*half m*=2 n=n-half print(ans-b)

0.664992

def main(): t = int(input()) while (t): m, n = map(int, input().split()) a , b= bin(m)[2:],bin(n)[2:] #print(a,b) max = m^n if len(a)>len(b): diff =len(a)-len(b) b= ("0"*diff)+b #print(b) elif len(a)<len(b): diff =len(b)-len(a) a= ("0"*diff)+a #print(a) ll = len(b) count= 0 for i ...

0.662934

""" Codeforces Contest 273 Div 2 Problem B Author : chaotic_iak Language: Python 3.3.4 """ def comb2(n): return n*(n-1)//2 def main(): n,m = read() k = n // m p = n % m mn = p * comb2(k+1) + (m-p) * comb2(k) mx = comb2(n-m+1) print(mn, mx) ################################### NON-SOLUTIO...

0.662388

t = int(input()) for _ in range(t): n,m = list(map(int, input().split())) l = [] for _ in range(n): l.append(list(map(int,input().split()))) zeroes = [0] * (m + n - 1) ones = [0] * (m + n - 1) for i in range(n): for j in range(m): if l[i][j] == 0: zer...

0.656684

def nCr(n,k): if(k>n):return 0 k=min(k,n-k) num,den=1,1 for i in range(k): num*=(n-i) den*=(i+1) return num/den def Main(): for cases in range(int(input())): a,b=[int(x) for x in input().split()] print(nCr(a,b)) Main()

0.656072

t = int(input()) from math import log, ceil, floor while t: t-=1 n,k = map(int ,input().split()) v = floor(log(k, 2)) block = 1 << v + 1 print(n / block * (1 + (k - 2 ** v) * 2 ))

0.650756

try: for j in range(1,int(input())+1): n,k = map(int,input().split()) if k>n: c=0 else: c = n-k+1 s = c*(c+1)//2 print('Case', str(j)+':',s) except: pass

0.646202

for _ in range(int(input())): n,m=input().split() n,m=int(n),int(m) x=y=c=0 l=list(map(int,input().split())) for i in range(n): for j in range(i,n): x=x+l[j] if (x%m)>y: y=x%m c=1 elif y==(x%m): c+=1 x = 0 print(y,c)

0.645891

for tc in range(int(input())): n,m = list(map(int, input().split())) al = list(map(int, input().split())) bl = list(map(int, input().split())) aidx = {} for i,e in enumerate(al): aidx[e]=i midx = -1 res = 0 for i,e in enumerate(bl): idx = aidx[e] if idx <= midx: ...

0.645246

""" Codeforces Round 241 Div 1 Problem E Author : chaotic_iak Language: Python 3.3.4 """ class InputHandlerObject(object): inputs = [] def getInput(self, n = 0): res = "" inputs = self.inputs if not inputs: inputs.extend(input().split(" ")) if n == 0: res = inputs...

0.645192

def f(n, m): re, c = divmod(n,m) return m*(m-1)/2*re + (c+1)*c/2

0.643665

# cook your dish here t = int(input()) while t>0: x = input().split() n = int(x[0]) k = int(x[1]) ans = 0 for i in range(n): if (k&(1<<i))!=0: ans += 2**(n-i-1) print(ans, end="\n") t -= 1

0.640079

from sys import stdin,stdout import math,bisect from collections import Counter,deque,defaultdict L=lambda:list(map(int, stdin.readline().strip().split())) M=lambda:list(map(int, stdin.readline().strip().split())) I=lambda:int(stdin.readline().strip()) S=lambda:stdin.readline().strip() C=lambda:stdin.readline().strip()...

0.639927

# cook your dish here # cook your dish here for i in range(int(input())): n,m,k=map(int,input().split()) l,ans = list(map(int,input().split())),0 for i in l: r=i//m + 1;c=i%m if(c==0):c=m;r-=1 ans+=r*(n+1-r)*c*(m+1-c) ans/=((n+1)*(m+1)*n*m)//4 print(ans)

0.638622

for _ in range(int(input())): n, m = map(int, input().split()) l1 = list(map(int,input().split())) print(min(sum(l1),m))

0.63851

# cook your dish here n,m=map(int,input().split()) L=[] for i in range(n): s=input() L.append(s) cost=[] h2=[0]*(m+1) cost.append(h2) for i in range(n): h=[0] for j in range(m): if(L[i][j]=='0' and (i+j)%2!=0): h.append(1) elif(L[i][j]=='1' and (i+j)%2==0): h.app...

0.637553

t = int(input()) while t != 0: M = 1000000007 n, m = list(map(int, input().split())) ans = 1 tt = n//2 tt = tt * (tt + 1) ans = pow(m, tt, M) print(ans) t -= 1

0.63676

import sys input = sys.stdin.readline from collections import deque t=int(input()) for testcaess in range(t): n,m,a,b=list(map(int,input().split())) E=[[] for i in range(n+1)] for i in range(m): x,y=list(map(int,input().split())) E[x].append(y) E[y].append(x) USE1=[0]*(n+1) ...

0.636235

import sys input = sys.stdin.readline t = int(input()) for test in range(t): if test: input() n, m = list(map(int, input().split())) a = [-1] * m b = [-1] * m for i in range(m): a[i], b[i] = list(map(int, input().split())) l = [(a[i],0,i) for i in range(m)] + [(b[i],1,i) for i...

0.634883

def multiple_input(): return map(int, input().split()) def list_input(): return list(map(int, input().split())) mod = int(1e9) + 7 for _ in range(int(input())): n, m = multiple_input() a = list_input() a.sort() max_level = a[-1] + 1 levels = [0] * max_level levels[0] = 1 for i in a: levels[i] += 1 ans = 1...

0.633978

T=int(input()) answer=[] for t in range(T): A,B=input().split() A=int(A) B=int(B) x=0 if(A>B): r=B B=A A=r while(A>0 and B>0): r=B//A x+=r r*=A B=B-r if(A>B): r=B B=A A=r answer.append(x) for...

0.631365

# cook your dish here T=int(input()) MOD=int(1e9+7) for t in range(T): N,K=[int(a) for a in input().split()] M=K//2 # ans= ((K%2)?( (N+M)*(N+M) + M ):( (N+M)*(N+M) - M) ) ans=(N+M)*(N+M) -M if(K%2): ans+=2*M if(N==0): ans=K*(K-1) print(ans%MOD)

0.630598

from collections import defaultdict from itertools import product def solve(mouse,n,m): # shadow matrix will contains the count of mice which affect (i,j) position # if there is a mice at position (i,j) then in shadow matrix it will affect all four adjacent blocks shadow=[[0 for i in range(m)]for j in ra...

0.628809

t=int(input()) for _ in range(t): n,m=map(int,input().split()) mat=[0 for i in range(n)] #mat=[[0 for i in range(n)] for j in range(n)] for i in range(m): u,v=map(int,input().split()) u,v=(u-1),(v-1) mat[u]|=(1<<v) mat[v]|=(1<<u) for i in range(n): mat[i]|=(1<<i) g...

0.62877

# cook your dish here # cook your dish here for _ in range(int(input())): n,m=list(map(int,input().split())) atomlist = ['']*n for k in range(m): s=[] s.extend(input().split()[1:]) #print(s) for w in range(n): if str(w) in s: atomlist[w]+="1" else: atomlist[w]+="0" #print(atomlist) print(len...

0.627948

# cook your dish here for h in range(int(input())): n,q=map(int,input().split()) print(q*(n+q+1)/(q+1))

0.626249

t = int(input()) for _ in range(t): d, m = list(map(int, input().split())) d += 1 out = 1 curr = 2 while curr < d: out *= (curr // 2) + 1 out %= m curr *= 2 out *= (d - curr // 2 + 1) print((out - 1) % m)

0.623622

# cook your dish here for _ in range(int(input())): n,k = [int(v) for v in input().split()] ans = (n//2)*(k+2) if n%2 == 0: ans = ans else: ans += 1 + 2*k print(ans)

0.623536

# cook your dish here t=int(input()) for _ in range(t): n,m=list(map(int,input().split())) r=list(map(int,input().split())) rating=[[r[i]]*(m) for i in range(n)] ranking=[[0]*m for i in range(n)] for i in range(n): diff=list(map(int,input().split())) for j in range(m): rating[i][j]+=diff[j] if j+1<m: ...

0.62051

tc=int(input()) for case in range(tc): m,r=list(map(int,input().split())) n=m**(r-1) a=[i**n for i in range(1,2*n+1)] tmp=2*n-1 for i in range(n): for j in range(tmp-i): a[j]=a[j+1]-a[j] print((a[n-1]/m)%1000000007)

0.619899

# cook your dish here def G(x, y): while(y): x, y = y, x % y return x # t=int(input()) # l=list(map(int,input().split())) for _ in range(int(input())): n,p=map(int,input().split()) c=0 for i in range(1,n+1): if G(i,p)==1: c+=1 ans=c*(c-1)//2 print(ans)

0.619753

for _ in range(int(input())): n,m=map(int,input().split()) print("Case "+str(_+1)+":") for i in range(m): s=input() ls=len(s) if ls>n: print("0") else: k=(n-ls+1) print((k*pow(26,n-ls,1000000007))%1000000007)

0.619606

import math def divisors(n): arr = [] for i in range(1,1+int(math.ceil(math.sqrt(n)))): if n%i == 0: arr.append(i) arr.append(n//i) arr = list(sorted(set(arr))) return arr try: t = int(input()) while t: t -= 1 a,m = map(int, input().split()) divs = divisors(m) ans = [] for d in divs: q = (m//...

0.619293

"""This code was written by Russell Emerine - linguist, mathematician, coder, musician, and metalhead.""" n = int(input()) for _ in range(n): c, s = list(map(int, input().split())) a = s // c r = s % c print((c - r) * a ** 2 + r * (a + 1) ** 2)

0.61759

import sys input = sys.stdin.readline def search(i,j): L=[] c=0 while CHECK[i][j]==1<<30: L.append((i,j)) CHECK[i][j]=c if MAP2[i][j]=="U": i-=1 elif MAP2[i][j]=="D": i+=1 elif MAP2[i][j]=="R": j+=1 else: ...

0.616748

import sys q = int(sys.stdin.readline().strip()) for t in range(0, q): n, m = list(map(int, sys.stdin.readline().strip().split())) L = [] R = [0] * n C = [0] * m for i in range (0, n): L.append(sys.stdin.readline().strip()) for j in range (0, m): if L[i][j] != "*": ...

0.615756

T=int(input()) for i in range(T): n=int(input()) if n==1: print("0") else: n=n-2 l=(n+1)*(2*n+3)*(n+2)/6 print(int(l))

0.613719

import fractions import sys f = sys.stdin if len(sys.argv) > 1: f = open(sys.argv[1], "rt") def calc(N, M): if M != N: return [(-1, -1)] r = [(i+1, ((i+1) % N)+1) for i in range(N)] return r T = int(f.readline().strip()) for case_id in range(1, T+1): N, M = list(map(int, f.readline().strip().split())) ...

0.613566

# cook your dish here for _ in range(int(input())): n,m = list(map(int,input().split())) colors = [0]*41; cost = [0]*41 color = 0 for i in range(n): cc,pp = list(map(int,input().split())) colors[cc] += 1 cost[cc] += pp for i in colors: if i>0: color += 1 dp2 = [[0...

0.610652

for _ in range(int(input())): n,k=map(int,input().split()) print(((2*n*(k-1))+2)/k)

0.609364

t=eval(input()) for i in range(0,t): x=input() nm=x.split(' ') nm[0]=int(nm[0]) nm[1]=int(nm[1]) csoint=[] lsoint=[] csofloat=[] lsofloat=[] for j in range(0,nm[0]): a=input() b=a.split(' ') b[0]=int(b[0]) b[1]=int(b[1]) csoint.append(b[0]) ...

0.608628

def interesting_nums(m): nums = [] for x in range(m + 1, 2 * m + 1): if x * m % (x - m) == 0: nums.append(x) return nums def main(): T = int(input()) for _ in range(T): num_list = interesting_nums(int(input())) print(len(num_list)) for num in num_list: print(num) main()

0.60721

import sys t = int(input()) # print(t) for _ in range(t): n,m = map(int,input().split()); s = []; for i in range(n): s.append(input()) ans = [] for i in range(n): ans.append([]) for j in range(m): ans[i].append([]) for i in range(n): for j in range(m): c = 0 if s[i][j] == 'U': ...

0.606918

T=int(input()) for i in range(T): n,m=list(map(int,input().split())) if(m<=2): print("impossible") else: l=[0]*m if(m%2==0): a=m//2 else: a=(m//2)+1 for j in range(a): if(j%2==0): l[j]="a" l[m-j-1]="a" else: l[j]="b" l[m-j-1]="b...

0.606812

n,k,m,t=list(map(int,input().split())) for i in range(t): a,b=list(map(int,input().split())) if a==1: if b<=k: k+=1 n+=1 print(n,k) else : if k>b: n=n-b k=k-b else : n=b print(n,k)

0.606618

def read_int(): return int(input()) def read_ints(): return list(map(int, input().split(' '))) t = read_int() for case_num in range(t): n, m = read_ints() a = [] for i in range(n): a.append(int(input(), 2)) a.sort() k = 2 ** m - n ans = (k - 1) // 2 for ai in a: i...

0.605883

from fractions import gcd for testCases in range(eval(input())): n = eval(input()) if n == 1: print('1') elif n == 2: print('2') elif n == 3: print('6') else: c = n*(n-1) k = n - 2 while True: if gcd(k,n-1) == 1 and gcd(k,n) == 1: break k -= 1 d = (n-1)*(n - 2) k1 = n - 3 while True: ...

0.604741

import sys from random import choice,randint inp=sys.stdin.readline out=sys.stdout.write flsh=sys.stdout.flush sys.setrecursionlimit(10**9) inf = 10**20 eps = 1.0 / 10**10 mod = 10**9+7 dd = [(-1,0),(0,1),(1,0),(0,-1)] ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)] def MI(): return map(int, inp().str...

0.603461

from string import ascii_lowercase t = int(input()) for _ in range(t): n, m = [int(x) for x in input().split()] s = input() count = {x : 0 for x in ascii_lowercase} errors = [int(x) for x in input().split()] errors = sorted(errors) e_idx = 0 for j, c in enumerate(s): while e_idx...

0.602123

testcase = int(input()) for case in range(testcase): n = int(input()) print(2**(n-2)+1) print('\n')

0.600942

q = int(input()) for i in range(q): a,b = map(int,input().split()) print((a*b+1)//2)

0.600935

T = int(input()) for _ in range(T): n,m = map(int,input().split()) completed = list(map(int,input().split())) jobs = [] for i in range(1,n+1): if i not in completed: jobs.append(i) jobs.sort() chef = [] ass = [] for i in range(len(jobs)): if i%2==0: chef.append(str(jobs[i])) else: ass.append(str(...

0.600903

# cook your dish here for _ in range(int(input())): A,B=list(map(int,input().split())) l1=list(map(int,input().split())) l2=list(map(int,input().split())) for i in range(A*B): if l1[i]<l2[i]: l1[i]=0 else: l2[i]=0 l1.sort(reverse=True) l2.sort(reverse=True) w,d,c=0,0,...

0.600572

# cook your dish here for i in range(int(input())): n,b=map(int,input().split()) ans=round(n/(2*b))*(n-b*round((n/(2*b)))); print(ans)

0.600166

import sys input = sys.stdin.readline n,m=list(map(int,input().split())) mod=998244353 FACT=[1] for i in range(1,2*10**5+1): FACT.append(FACT[-1]*i%mod) FACT_INV=[pow(FACT[-1],mod-2,mod)] for i in range(2*10**5,0,-1): FACT_INV.append(FACT_INV[-1]*i%mod) FACT_INV.reverse() def Combi(a,b): if 0<=b<=a: ...

0.599939

# cook your dish here for a in range(int(input())): N,M=map(int,input().split()) b=[] for o in range(N): b.append(input()) c=[] for d in b: f=[] for e in range(len(d)): if d[e]=='1': f.append(e) c.append(f) i=[] for g in range(len(c)): for h in range(len...

0.599752

# cook your dish here for _ in range(int(input())): n=list(map(int,input().split())) print(n[0]*n[1])

0.599226

testCases = int(input()) for c in range(testCases): n, k = list(map(int, input().split())) sum = 0 i = 0 power = 1 while i <= n: if k**power == i: power += 1 else: sum += i i +=1 answer = "Case #" + str(c + 1) + ": " + str(sum) print(answer)

0.59772

t=int(input()) while(t!=0): t=t-1 n=int(input()) ans=0 for i in range(1,n+1,1): sum=0; for j in range(1,i+1,1): sum=sum+j s=sum-i sum=sum+s if(i!=n): ans=ans+2*sum*i else: ans=ans+sum*i print(ans)

0.597211

def solve(): n, r = list(map(int, input().split())) k = min(r, n - 1) print(k * (k + 1) // 2 + (r >= n)) for i in range(int(input())): solve()

0.596334

t=int(input()) for i in range(t): x,n=[int(g) for g in input().split()] sal=0 day=x while day<n: sal=sal+day day+=x print(sal)

0.595373

t = int(input()) for _ in range(t): [n, x] = [int(v) for v in input().split()] print(2 * x)

0.59479

for _ in range(int(input())): n, m = list(map(int, input().split())) arr = [list(map(int, input().split())) for _ in range(n)] res = 0 for i in range(n//2): for j in range(m//2): a = [arr[i][j], arr[n-i-1][j], arr[i][m-j-1], arr[n-i-1][m-j-1]] a.sort() res += ...

0.594352

import sys def input(): return sys.stdin.readline()[:-1] t = int(input()) for _ in range(t): n, k = map(int, input().split()) a = list(map(int, input().split())) cum = [0 for _ in range(2*k+2)] for i in range(n//2): x, y = a[i], a[n-i-1] cum[2] += 2 cum[min(x, y)+1] -= 1 cum[x+y] -= 1 cum[x+y+1] += 1 ...

0.593731

t=int(input()) for i in range(t): n,m=list(map(int,input().split())) l=[0]+list(map(int,input().split())) s=0 c=1 m1=[] for i in range(n): d,f,b=list(map(int,input().split())) if(l[d]>0): m1.append(d) s+=f l[d]-=1 else: m1.append(0) s+=b for i in range(n): if(m1[i]==0): for j in range(c...

0.593561

t = int(input()) for case in range(t): a, b = list(map(int, input().split())) s = input() z = 10000 total = 0 act = False for i in range(len(s)): cur = s[i] if cur == '0': z += 1 act = False else: if not act: act = Tr...

0.591771

D=[0]*31 D[1]=2 D[2]=5 for i in range(3,31): best=10**10 for p in range(1,i+1): best=min(best,D[p-1]+D[i-p]+i+1) D[i]=best t=int(input()) for i in range(t): n,m=list(map(int,input().split())) maxi=(n+2)*(n+1)/2-1 mini=D[n] if mini<=m<=maxi: print(0) elif m<mini: print(-1) else: print(m-maxi)

0.59139

try: for _ in range(int(input())): s,s1=0,0 x,k=[int(i) for i in input().split()] for i in range(2,x+1): if(x%i==0): s=s+i**k for i in range(2,k+1): if(k%i==0): s1+=i*x print(s,s1) except EOFError as e: p...

0.590648

from collections import defaultdict as dd import math import sys #input=sys.stdin.readline def nn(): return int(input()) def li(): return list(input()) def mi(): return list(map(int, input().split())) def lm(): return list(map(int, input().split())) n,m=mi() quilt=[] for i in range(n): quilt.append(li()) def ...

0.588908

class Solution: def flipLights(self, n, m): """ :type n: int :type m: int :rtype: int """ states = set() for op_odd in [0, 1]: for op_even in [0, 1]: for op_third in [0, 1]: op_all = m - op_odd - op_ev...

0.588015

t=int(input()) while(t): s=input().split() m=int(s[0]) p=float(s[1]) if(m%2==0): r=(1-p**m)/(p+1) else: r=(1+p**m)/(p+1) print(1000000000*r,1000000000*(1-r)) t-=1

0.587366

for i in range(int(input())): n,k=map(int,input().split()) m=[] for j in range(n): l=list(input()) m.append(l) a=0 for k in range(k): b=0 for p in range(n): if m[p][k]=='1': b+=1 if b>1: a+=((b*(b-1))//2) print(a)

0.587344

import sys input = sys.stdin.readline def main(): n, m = map(int, input().split()) alst = [list(map(int, input().split())) for _ in range(n)] blst = [[0 for _ in range(m)] for _ in range(n)] for i in range(n): for j in range(m): if (i + j) % 2 == alst[i][j] % 2: blst...

0.586829

from sys import stdin for _ in range(int(stdin.readline())): m, n = list(map(int, stdin.readline().split())) final = [] arr = [] val = 0 extra = 0 for j in range(m): ans = list(map(str, stdin.readline().split())) if ans.count('N') == n: val += 1 else: if val%2 == 0: arr.append(ans) extra += v...

0.58635

def fact(n): if n<2: return 1 return n * fact(n-1) def ncr(n, r): return fact(n)// (fact(r)*fact(n-r)) t=int(input()) for _ in range(t): n, k = list(map(int, input().split())) a = list(map(int, input().split())) a.sort() count_z = a.count(a[k-1]) count_z_seq = a[:k].count(a[k-1]) print(ncr(count_z, co...

0.585951

import sys import collections rlines = sys.stdin.readlines() lines = (l.strip() for l in rlines) def eucycle(n,m,adj): diredges = [] us = list(adj.keys()) for u in us: while adj[u]: v0 = u v1 = adj[v0].pop() adj[v1].remove(v0) diredges.append((v0,v1))...

0.58456

T = int(input()) for _ in range(T): a, b = list(map(int, input().split())) print(max(max(a, b), min(a, b) * 2)**2)

0.584376

T = int(input()) ans = [] for _ in range(T): z = int(input()) for k in range(z): s = input() ans.append((z*(z+1))//2) for ele in ans: print(ele)

0.583823

mem = [[[0 for i in range(51)] for j in range(31)] for k in range(31)] def f(n, m, k): if mem[n][m][k]: return mem[n][m][k] if (n*m == k) or (k == 0): return 0 cost = 10**9 for x in range(1, n//2 + 1): for z in range(k+1): cost = min(cost, m*m + f(n-x, m, k-z) + f(x...

0.583106

# cook your dish here t=int(input()) for _ in range(t): n,m = map(int,input().split()) count=0 for i in range(n,m+1): p=str(i) if p[-1]=='2' or p[-1]=='3' or p[-1]=='9': count+=1 print(count)

0.581756

#!/usr/bin/env python3 OUT = (1, 0, 2, 3) try: while True: n, m = map(int, input().split()) bus = [[None] * 4 for i in range(n)] cur = 1 for row in range(n << 1): if row >= n: i = row - n k = b = 1 else: i = ro...

0.580554

Reminder: the median of the array $[a_1, a_2, \dots, a_{2k+1}]$ of odd number of elements is defined as follows: let $[b_1, b_2, \dots, b_{2k+1}]$ be the elements of the array in the sorted order. Then median of this array is equal to $b_{k+1}$. There are $2n$ students, the $i$-th student has skill level $a_i$. It's n...

for _ in range(int(input())): n = int(input()) ar = list(map(int, input().split())) ar.sort() print(abs(ar[n] - ar[n - 1]))

0.681053

import sys input=sys.stdin.readline for _ in range(int(input())): n = int(input()) t = sorted(map(int,input().split())) cur = [0]*(2*n) for i in range(n): low = high = t[i] while low and cur[low]: low -= 1 while cur[high]: high += 1 if low > 0 and ...

0.689536

# cook your dish here t=int(input()) for _ in range(t): n=int(input()) array=list(map(int, input().split())) list_sub=[] idx=0 counter=0 for i in range(n-1): if counter%2==0 and array[i]<=array[i+1]: counter+=1 elif counter%2==1 and array[i]>=array[i+1]: ...

0.680554

n = int(input()) for i in range(n) : t = int(input()) li = sorted(list(map(int , input().split()))) ans = 1 dp = [li[1]-li[0]] + [0] * (t-2) + [li[t-1] - li[t-2]] for i in range(1 , t-1) : dp[i] = min(li[i] - li[i-1] , li[i+1] - li[i]) print(max(dp))

0.671945

for i in range(int(input())): n=int(input()) m=list(map(int,input().split()))[:n] m.sort() t=0 for j in range(n//2): t+=abs(m[j]-m[n-j-1]) print(t)

0.662099

#!usr/bin/env python3 from collections import defaultdict, deque from heapq import heappush, heappop from itertools import permutations, accumulate import sys import math import bisect def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline()) def LS():return [list(x) for ...

0.655996

# cook your dish here from sys import stdin, stdout from collections import defaultdict for _ in range(int(stdin.readline())): n=int(stdin.readline()) lst=list(map(int, stdin.readline().split())) prefix_odd=[0]*n prefix_even=[0]*n odd_val=0 even_val=0 for i in range(n): if lst[i]%2==...

0.655834

import sys input = sys.stdin.readline t = int(input()) for _ in range(t): n = int(input()) a = list(map(int, input().split())) ans = 0 for i in range(n - 1): diff = a[i] - a[i + 1] if diff <= 0: continue else: ans = max(len(bin(diff)) - 2, ans) ...

0.650758

T = int(input()) for _ in range(T): a = int(input()) hh = sorted(map(int, input().split())) ans = 10**10 for h1, h2 in zip(hh[:-1], hh[1:]): ans = min(ans, h2 - h1) print(ans)

0.647591

from operator import itemgetter import sys input = sys.stdin.readline MAX_A = 200 t = int(input()) for _ in range(t): n = int(input()) a = list(map(int, input().split())) ruiseki = [[0] * MAX_A for i in range(n + 1)] for i in range(n): for j in range(MAX_A): ruiseki[i + 1][j] ...

0.646079

t=eval(input()) for q in range(t): l=eval(input()) a=input().split() a=[int(x) for x in a] a=sorted(a) for i in range(l-1): a[i]=(a[i+1]-a[i]) print(min(a[0:l-1]))

0.643283

import bisect def pre(a): for p in range(n-1): if(a[p]>=a[p+1]): return p return n-1 def suf(a): for s in range(1,n): if(a[n-s]<=a[n-s-1]): return n-s return 0 t=int(input()) for _ in range(t): n=int(input()) a=list(map(int,input().split())) p=pre(a) s=suf(a) b=a[s:n] count=0 for i in ...

0.640292

from sys import stdin def gt(num): if num: return num return 0 for __ in range(int(stdin.readline().split()[0])): n = int(stdin.readline().split()[0]) a = list(map(int, stdin.readline().split())) cnta = dict() cnta.setdefault(0) cntb = dict() cntb.setdefault(0) for i in a: cnta[i] = gt(cnta.get(i)) + 1 as...

0.637196

from sys import stdin for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) id = list(zip(l,list(range(n)))) id.sort() val, pos = zip(*id) blok = [] cur = [pos[0]] for i in range(1,n): if val[i] == val[i-1]: cur.append(pos[i]) else:...

0.62704

import sys input = sys.stdin.readline import bisect t=int(input()) for tests in range(t): n=int(input()) A=list(map(int,input().split())) compression_dict={a: ind for ind, a in enumerate(sorted(set(A)))} A=[compression_dict[a] for a in A] Q=[0]*n for i in range(n): Q[A[i]]=i ...

0.625463

for i in range(int(input())): n = int(input()) c = list(map(int, input().split())) d = {} d[0] = -1 parity = 0 ans = 0 for i in range(n): parity ^= 1 << (c[i]-1) for t in range(30): x = parity^(1<<t) if(x in d.keys()): ans = max(ans, i - d[x]) if parity not ...

0.621003

# cook your dish here for _ in range(int(input())): n=int(input());li=list(map(int,input().split()));dli=dict();modi=0 for i in li: if i not in dli:dli[i]=1 else:dli[i]+=1 op=sorted(list(dli)) if(len(dli)!=0): while 1: tmp=[] for i in op: if dli[i]==0:continue tm...

0.61829

def subsolve(a): c = 0 m = 0 for i in a: c += i if c < 0: c = 0 m = max(m, c) return m def solve(): n = int(input()) a = list(map(int, input().split())) s = 0 for i in range(0, n, 2): s += a[i] u = subsolve([a[i] - a[i - 1] for i in range(1...

0.614442

import sys def input(): return sys.stdin.readline().strip() def iinput(): return int(input()) def rinput(): return list(map(int, sys.stdin.readline().strip().split())) def get_list(): return list(map(int, sys.stdin.readline().strip().split())) t=iinput() for _ in range(t): n=iinput() p=[] mi=[] for i in...

0.611703

def check(l,n): m = 0 for i in range(n-1): x = l[i] c = 0 j = i while (j+2<n and l[j+2]==x) or (j+1<n and l[j+1] == x): if l[j+1] == x: j = j+1 else: j+=2 c+=1 if m<c: m = c return m t = ...

0.611195

for _ in range(int(input())): n = int(input()) wt = list(map(int, input().split())) count = {} for x in wt: if x not in count: count[x] = 0 count[x] += 1 k = 0 for s in range(101): temp = 0 temp2 = 0 for x in count: if (s - x) in c...

0.609826

# cook your dish here t=int(input()) j=0 while j<t: n=int(input()) lst=list(map(int,input().split())) s=set() d=list() for i in lst: if i in s: s.remove(i) d.append(i) else: s.add(i) x=len(d) if x%2==0: print(x//2) else: ...

0.607013

# cook your dish here t = int(input()) while t: t -= 1 n = int(input()) arr = list(map(int, input().split())) sumi = sum(arr) prev = 1 for i in range(n): arr[i] = min(arr[i], prev) prev = arr[i] + 1 prev = 1 for i in range(n - 1, -1, -1): arr[i] = min(arr[i], prev) prev = arr[i] + 1 temp = 0 for i in...

0.600075

# cook your dish here for _ in range(int(input())): n=int(input()) l1=[] l2=[] for i in range(n): s=input() a=s[ :n//2].count('1') b=s[n//2: ].count('1') if a>b: l1.append(a-b) elif a<b: l2.append(b-a) p=sum(l1) q=sum(l2) if p==q: print(0) elif p>q: diff=p-q flag=0 for i i...

0.596635

from collections import deque t=int(input()) for i in range(t): n=int(input()) N=[i for i in range(1, n+1)] w=list(map(int, input().split())) max_sweetness=max(w) sizes=[] cnt=0 for i in range(n): if w[i]!=max_sweetness: cnt+= 1 else: sizes.append(cnt) cnt=0 if cnt!=0: sizes[0]=(cnt+sizes[0])...

0.596377

# cook your dish here t=int(input()) for i in range(t): n=int(input()) ar=list(map(int,input().split())) tot=0 st=0 for j in range(1,n): if(ar[j-1]>ar[j]): si=j-st c=(si*(si+1))//2 tot+=c st=j si=n-st c=(si*(si+1))//2 tot+=c print(tot)

0.594895

# cook your dish here for _ in range(int(input())): n=int(input()) ar=list(map(int,input().split())) odd=0 even=0 if n==1: print(0) continue for i in range(n): if ar[i]%2==1: odd+=1 else: even+=1 if odd>0: vo=(odd-1)*2+even else: vo=even if even>0: ve=(even-1)*2+odd else: ve=odd print(m...

0.592862

class BIT(): def __init__(self,n): self.BIT=[0]*(n+1) self.num=n def query(self,idx): res_sum = 0 while idx > 0: res_sum += self.BIT[idx] idx -= idx&(-idx) return res_sum #Ai += x O(logN) def update(self,idx,x): while idx <= self....

0.591942

# cook your dish here # from queue import PriorityQueue # import bisect def insort(l, v): s = 0 e = len(l) while True: mid = (s+e)//2 if s == e or mid > len(l): break if l[mid][0] < v[0]: s = mid+1 elif l[mid][0] > v[0]: e = mid els...

0.590237

# cook your dish here T=int(input()) for _ in range(T): n=int(input()) arr=list(map(int,input().split())) left=[-1 for i in range(n)] right=[-1 for i in range(n)] min1=float("inf") for i in range(n): min1=min(arr[i],min1+1) left[i]=min1 min1=float("inf") for i in range(n-1,-1,-1): min1=min(arr[i],min1+1) ...

0.589969

import sys input = sys.stdin.readline T = int(input()) for _ in range(T): N, K = list(map(int, input().split())) A = [int(a) for a in input().split()] B = [A[i+K]-A[K] for i in range(N-K)] mi = 10**20 mx = -1 for i in range(N-K): if A[i+K]-A[i] < mi: mi = A[i+K]-A[i] ...

0.589295

# cook your dish here def mergeSort(arr, n): # A temp_arr is created to store # sorted array in merge function temp_arr = [0]*n return _mergeSort(arr, temp_arr, 0, n-1) # This Function will use MergeSort to count inversions def _mergeSort(arr, temp_arr, left, right): # A variable inv...

0.588203

from math import gcd __author__ = 'Prateek' def test(): n = int(input()) a = list(map(int, input().split())) a = list(set(a)) n = len(a) if len(a) == 1: print(2 * a[0]) return g1 = [0 for i in range(n)] g2 = [0 for i in range(n)] g1[0] = a[0] g2[n -...

0.58764

import sys input = sys.stdin.readline t = int(input()) for _ in range(t): n = int(input()) out = 0 l = list(map(int, input().split())) for i in range(n - 1): out += max(0, l[i] - l[i + 1]) print(out)

0.585428

for _ in range(int(input())): n = int(input()) arr = list(map(int,input().split())) a,b = 0,0 arr.sort() for i in arr: if a==i: a+=1 elif b==i: b+=1 print(a+b)

0.582478

for _ in range(int(input())): n=int(input()) a=list(map(int,input().split())) ans,small,big=0,2*10**9,-1 for i in range(len(a)-1): if a[i]==-1 and a[i+1]!=-1: small=min(small, a[i+1]) big=max(big, a[i+1]) if a[i]!=-1 and a[i+1]==-1: small = min(small, ...

0.581155

import sys t = int(sys.stdin.readline()) for _ in range(t): n = int(sys.stdin.readline()) intervals = [None]*n for i in range(n): intervals[i] = tuple([int(a) for a in sys.stdin.readline().split()]) intervals = list(zip(intervals, list(range(n)))) starts = sorted(intervals, key = lambda x:...

0.579185

import sys readline = sys.stdin.readline readlines = sys.stdin.readlines ns = lambda: readline().rstrip() ni = lambda: int(readline().rstrip()) nm = lambda: map(int, readline().split()) nl = lambda: list(map(int, readline().split())) prn = lambda x: print(*x, sep='\n') def solve(): n = ni() s = nl() dp =...

0.578369

import itertools from collections import defaultdict as dfd def sumPairs(arr, n): s = 0 for i in range(n-1,-1,-1): s += i*arr[i]-(n-1-i)*arr[i] return s def subarrayXor(arr, n, m): ans = 0 xorArr =[0 for _ in range(n)] mp = dfd(list) xorArr[0] = arr[0] for i in range(1, n): xorArr[i] = xorArr[i - 1] ^ ar...

0.577032

from sys import stdin,stdout import sys import math t=int(stdin.readline()) for i in range(t): a=list(map(int,stdin.readline().split())) print(sum(a)//2)

0.576643

'''Author- Akshit Monga''' from sys import stdin, stdout input = stdin.readline t=int(input()) for _ in range(t): n=int(input()) a=[int(x) for x in input().split()] ans=0 dp=[-1 for i in range(0,n+1)] for i in a: var1=dp[i] var2=ans ans=max(ans,var1+1) dp[i]=max(dp[i],var2+1) print(n-ans)

0.574159

class Solution: def minMoves2(self, nums): """ :type nums: List[int] :rtype: int """ aa = sorted(nums) median = aa[len(nums)//2] return sum([abs(i-median) for i in aa])

0.571524

t=int(input()) for i in range(t): n=int(input()) N=list(map(int,input().split())) N.sort() k=n-1 ave=N[k] for j in range(n-1): ave=(ave+N[k-1])/2 k=k-1 print(ave)

0.568727

for _ in range(int(input())): n = int(input()) arr = list(map(int, input().split())) hrs = arr[0] - arr[1] for i in range(1, n-1): if hrs > arr[i] - arr[i+1]: hrs = arr[i] - arr[i+1] print(hrs)

0.568291

t = int(input()) for i in range(t): n = int(input()) arr = [int(x) for x in input().split()] arr.sort(reverse=True) print(min(arr[1] - 1, len(arr) - 2))

0.563885

import sys def input(): return sys.stdin.readline()[:-1] t = int(input()) for _ in range(t): n, k = map(int, input().split()) a = list(map(int, input().split())) cum = [0 for _ in range(2*k+2)] for i in range(n//2): x, y = a[i], a[n-i-1] cum[2] += 2 cum[min(x, y)+1] -= 1 cum[x+y] -= 1 cum[x+y+1] += 1 ...

0.563548

def mForMaxSeq(arr, n): eim = dict() for i in range(n): if arr[i] in eim: eim[arr[i]].append(i) else: eim[arr[i]] = [i] keys = sorted(eim.keys()) # print(eim, keys) connected = False count = 0 pI = -1 nKeys = len(keys) ...

0.562077

for tcase in range(int(input())): n=int(input()) ls = list(map(int, input().split())) oneneed = 2*(n - ls.count(1)) ldct = {0:0} ctr = 0 eaten = 0 for i in range(n-1,-1,-1): eaten += 1 ctr += (1 if ls[i] == 2 else -1) if ctr not in ldct: ldct[ctr] = eaten ...

0.561707

from sys import stdin tt = int(stdin.readline()) for loop in range(tt): n = int(stdin.readline()) a = list(map(int,stdin.readline().split())) lis = [ [1] ] now = [] tmp = 0 for i in range(1,n): if len(now) == 0: now.append(a[i]) tmp = 1 elif now[-1] ...

0.560762

from collections import defaultdict as dd for _ in range(int(input())): n=int(input()) a=list(map(int,input().split())) d=dd(int) for i in a: d[i]+=1 ma=0 r=len(d.keys()) for i in d.keys(): ma=max(ma,min(d[i]-1,r),min(d[i],r-1)) print(ma)

0.558897

# cook your dish here def index(n,val): while(val >= n): val = val//2 return n - val t = int(input()) for _ in range(t): n = int(input()) arr = list(map(int,input().split())) new = [0 for i in range(n)] for i in range(n): if arr[i]<=n : new[i] = arr[i] + arr[arr[i]-1...

0.5585

def solve(l): m = l.index(max(l)) if m == 0 or m == len(l) - 1: return 1 return 1 + min(solve(l[0:m]), solve(l[m+1:])) tc = int(input()) for test in range(tc): n = int(input()) l = list(map(int, input().split())) print(solve(l))

0.557647

# cook your dish here for _ in range(int(input())): n=int(input()) a=list(map(int,input().split())) even=[] odd=[] for i in a: if(i & 1): even.append(i) else: odd.append(i) print(len(even)*len(odd))

0.556087

for _ in range(int(input())): # n, x = map(int, input().split()) n = int(input()) arr = list(map(int, input().split())) ans = [arr[0]] for i in range(1, n - 1): if arr[i - 1] < arr[i] and arr[i] > arr[i + 1]: ans.append(arr[i]) elif arr[i - 1] > arr[i] and arr[i] < arr[i ...

0.553344

import sys def myargsort(a): b = list(zip(a, list(range(0, len(a))))) b.sort() r = [pr[1] for pr in b] return r fin = sys.stdin n = int(fin.readline()) a = [int(number) for number in fin.readline().split()] p = myargsort(a) p.reverse() j = 0 aib = [0] * (n + 1) def ultb(x): return -(x ^ (-x)) // ...

0.552838

# cook your dish here t=int(input()) for i in range(t): n=int(input()) a=list(map(int,input().split())) print(min(a))

0.552568

T=int(input()) for i in range(T): N=int(input()) A=list(map(int,input().split()))[:N] l=[] for j in range(len(A)): for k in range(j+1,len(A)): l.append(A[j]+A[k]) print(l.count(max(l))/((N*(N-1))/2))

0.552054

for i in range(int(input())): n=int(input()) c=[int(z) for z in input().split()] c.sort() c.reverse() b1,b2=0,0 for i in range(n): if b1<b2: b1+=c[i] elif b2<b1: b2+=c[i] else: b1+=c[i] print(max(b1,b2))

0.549074

for _ in range(int(input())): n = int(input()) A = list(map(int, input().split())) m = 10 ** 9 c = 0 for i in range(n - 1, -1, -1): if A[i] <= m: m = A[i] else: c += 1 print(c)

0.547042

import sys input = sys.stdin.readline from bisect import bisect_right bin_s = [1] while bin_s[-1] <= 10 ** 9: bin_s.append(bin_s[-1] * 2) def main(): n, q = map(int, input().split()) alst = list(map(int, input().split())) dp = [[-1, -1] for _ in range(n)] dp[0] = [alst[0], 0] for i, a in enum...

0.546907

for _ in range(int(input())): n = int(input()) A = list(map(int, input().split())) A.sort() ans = 1 for i in range(n - 1): if A[i] + 1 == A[i + 1]: ans = 2 break print(ans)

0.546586

t=int(input()) for _ in range(t): size=int(input()) li=list(map(int,input().split())) c = 0 for i in li: if(i >=len(li)/2): c += 1 print(c)

0.546359

N=int(input()) A=list(map(int,input().split())) SUM=abs(A[0]) for i in range(N): if i < N-1: SUM += abs(A[i+1]-A[i]) else: SUM += abs(0-A[i]) now=0 for i in range(N): if i != N-1: diff = abs(A[i+1]-now)-abs(A[i]-now)-abs(A[i+1]-A[i]) now = A[i] else: diff = abs(0-now)-abs(A[i]-now)-abs(0-A...

0.543877

def solve(): n = int(input()) lst = list(map(int,input().split())) if sum(lst) <= n // 2: print(n//2) print("0 " * (n // 2)) else: print(n//2 + (n // 2) % 2) print("1 " * (n//2 + (n // 2) % 2)) for i in range(int(input())): solve()

0.54376

from collections import defaultdict N = int(input()) a = [int(i) for i in input().split()] b = defaultdict(lambda : [float('inf'), 0]) for i in range(N) : b[a[i]][0] = min(b[a[i]][0], i) b[a[i]][1] += 1 # [value, first_appearance, count] c = [(0, 0, 0)] for k, v in b.items() : c.append((k, v[0], v[1])) c...

0.542742

# cook your dish here import math; from math import gcd,sqrt,floor,factorial,ceil from bisect import bisect_left,bisect_right import bisect; import sys; from sys import stdin,stdout import os sys.setrecursionlimit(pow(10,7)) import collections from collections import defaultdict,Counter from statistics import median # ...

0.542624

t=int(input()) for _ in range(t): n=int(input()) arr=list(map(int,input().split())) d={} for i in range(n): if arr[i] in d: d[arr[i]].append(i) else: d[arr[i]]=[i] q=int(input()) for i in range(q): m=int(input()) if len(d[m])==...

0.54222

""" 4 4 4 3 1 2 6 1 2 2 1 3 1 5 10 1 2 10 5 4 1 2 1 2 """ tests = int(input()) for _ in range(tests): n = int(input()) ls = list(map(int, input().split())) if ls[0] < ls[1]: ls[0] = -ls[0] if ls[-1] < ls[-2]: ls[-1] = -ls[-1] for i in range(1, n - 1): if ls[i] < ls[i - 1] and ls[i] < ls[i + 1]: ls[i]...

0.541909

for __ in range(int(input())): n = int(input()) ar = [] for ________ in range(n): ar.append(list(map(int, input().split()))) ar.sort(key=lambda x: x[1]) num1 = ar[0][1] ar.sort(key=lambda x: -x[0]) num2 = ar[0][0] print(max(0, num2 - num1))

0.54128

t=int(input()) for q in range(t): n=int(input()) x=list(map(int,input().split())) dic={} dic2={} for i in range(n): dic2[x[i]]=1 #print dic2 if len(dic2)==n: n+=2 print((n*(n-1)*(n-2)*(n-3))/24) continue counter=0 for i in range(n-1): if x[i] in dic: dic[x[i]]+=1 else: dic[x[i]]=1 for j in...

0.54095

# cook your dish here # cook your dish here from math import log2; import sys; sys.setrecursionlimit(10 ** 7) from collections import defaultdict inf = float("inf") def find_height(node): nodes[node]=1 for i in graph[node]: nodes[node]+=find_height(i) return nodes[node] def find_sum(node): sum...

0.540935

from math import ceil t=int(input()) for i in range(t): p=int(input()) l=list(map(int,input().split())) maxx=1 for i in range(len(l)): maxx=max(maxx,l.count(l[i])) if(maxx*2>p): print(maxx) else: q=p-maxx*2 maxx+=ceil(q/2)...

0.54068

# cook your dish here from operator import itemgetter t=int(input()) for _ in range(t): n=int(input()) start=[] end=[] for i in range(n): first, last = map (int, input().split()) start.append((first, i)) end.append((last, i)) score=[0]*n start.sort(key=itemgetter(0)) ...

0.539721

for _ in range(int(input())): n = int(input()) a = list(map(int,input().split())) ans = 0 count = 0 for i in a: if i>0: ans+=i count+=1 res = [] for i in range(count): if a[i]<=0: res.append(i+1) for i in range(count,n): if a[i]>0: res.append(i+1) print(ans) print(len(res),*res)

0.539298

for _ in range(int(input())): n=int(input()) a=[int(z) for z in input().split()] m=0 a1=list(set(a)) for i in range(len(a1)): if a.count(a1[i])>m: m=a.count(a1[i]) print(n-m)

0.538981

for i in range(int(input())): n=int(input()) chef=0 ans=[] for i in range(0,n): l=list(map(int,input().split())) c=l[0] if c%2==0: for i in range(1,len(l)//2+1): chef=chef+l[i] continue; for i in range(1,len(l)//2): chef=chef+l[i] ans.append(l[len(l)//2]) ans.sort(reverse=True) for i in ran...

0.538709

import sys import random from fractions import Fraction from math import * def input(): return sys.stdin.readline().strip() def iinput(): return int(input()) def finput(): return float(input()) def tinput(): return input().split() def linput(): return list(input()) def rinput(): return ...

0.537855

for _ in range(int(input())): n=int(input()) l=list(map(int,input().split())) a=[] lis=[] prevsign=-1 if l[0]>0: prevsign=1 else: prevsign=0 i=0 for i in l: if (i>0 and prevsign==1) or (i<0 and prevsign==0): lis.append(i) else: ...

0.536088

import sys input = sys.stdin.readline Q = int(input()) for _ in range(Q): N = int(input()) A = [int(a) for a in input().split()] X = {} for a in A: if a in X: X[a] += 1 else: X[a] = 1 Y = [] for x in X: Y.append(X[x]) Y = sorted(Y)[::-1] p...

0.535362

n = int(input()) vs = [int(x) for x in input().split()] ts = [int(x) for x in input().split()] sumt = 0 for i, t in enumerate(ts): vs[i]+=sumt sumt+=t vs.sort() tl, tr = 0, 0 il, ir = 0, 0 for ind, t in enumerate(ts): #check tl = tr tr += t while ir < n and vs[ir] <= tr: ir += 1 cur_sum = 0 ...

0.534184

test = int(input()) for _ in range(test): n, m = map(int, input().split()) indexArray = list(map(int, input().split())) mini = min(indexArray) maxi = max(indexArray) result = n*[0] for i in range(n): result[i] = max(maxi - i, i - mini) print(result[i], end=" ") print()

0.533883

t=int(input()) for _ in range(t): n=int(input()) a=list(map(int,input().split())) a.sort() s=sum(a) if a[0]*(s-a[0])<=a[n-1]*(s-a[n-1]): print(a[0]*(s-a[0])) else: print(a[n-1]*(s-a[n-1]))

0.533322

def solve(): n = int(input()) a = list(map(int, input().split())) c = [0] * (n + 1) def inc(): for i in range(n - 1): if a[i] > a[i + 1]: return False return True def calc(): for i in range(n + 1): c[i] = 0 for i in a: ...

0.532932

import sys input = sys.stdin.readline t=int(input()) for test in range(t): n=int(input()) A=list(map(int,input().split())) ANS=[] SET=set() NOW=1 while not (NOW in SET): ANS.append(NOW) SET.add(NOW) NOW=NOW-A[NOW-1] x=ANS.index(NOW) print(len(ANS[x:])) pr...

0.532671

import sys input = lambda: sys.stdin.readline().rstrip() ANS = [] T = int(input()) for _ in range(T): N, Q = list(map(int, input().split())) A = [int(a) for a in input().split()] ans = sum(max(b - a, 0) for a, b in zip([0] + A, A)) ANS.append(ans) for _ in range(Q): l, r = list(map(int, inp...

0.53149

def f(a,n): l,r,s1,s2 = [0]*n, [0]*n, [], [] for i in range(n): count = 1 while(len(s1)>0 and a[i]<s1[-1][0]): count += s1[-1][1] s1.pop() s1.append((a[i],count)) l[i] = count for i in range(n-1,-1,-1): count = 1 while(len(s2)>0 and a[i]<=s2[-1][0]): count...

0.530239

def possible(a): ans = set() s = set() lmax = 0 for i in range(len(a)): lmax = max(lmax, a[i]) s.add(a[i]) if lmax == i + 1 and len(s) == i + 1: ans.add(i + 1) return ans t = int(input()) for case_num in range(t): n = int(input()) a = list(map(int, input...

0.529138

def main(): from sys import stdin, stdout for _ in range(int(stdin.readline())): n = int(stdin.readline()) inp1 = [-1] * (n + 1) inp2 = [-1] * (n + 1) for i, ai in enumerate(map(int, stdin.readline().split())): if inp1[ai] < 0: inp1[ai] = i ...

0.529112

import sys reader = (s.rstrip() for s in sys.stdin) input = reader.__next__ class Binary_Indexed_Tree(): def __init__(self, n): self.n = n self.data = [0]*(n+1) def add(self, i, x): while i <= self.n: self.data[i] += x i += i & -i def get(self, i): ...

0.528769

# cook your dish here testcases=int(input()) for _ in range(testcases): (N,K)=list(map(int,input().split())) array=list(map(int,input().split())) max=array[0] min=array[0] for i in array: if i>max: max=i if i<min: min=i max=max+K ...

0.528078

#list(map(int,input().split())) t=int(input()) for _ in range(t): n=int(input()) it=list(map(int,input().split())) print(len(set(it)))

0.527809

from sys import * T = int(stdin.readline()) t = [int(s) for s in stdin.readline().split(' ')] a = [] for i in range(T - 1, -1, -1): if i % 2 == 0: a += [(e[0], -e[1]) for e in a] a = [(e[0] - t[i], e[1]) for e in a] a += [(- x - 1, 0) for x in range(t[i])] a = list(set(a)) if...

0.527679

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ res = 0 temp = sorted(arr) sum1, sum2 = 0, 0 for i in range(0,len(arr)): sum1 += arr[i] sum2 += temp[i] if(sum1 =...

0.527144

n, m = map(int, input().split()) x = list(map(int, input().split())) foo = [0 for _ in range(2+n)] for i in range(1, m) : p, q = x[i-1], x[i] if p == q : continue r = min(p, q) s = max(p, q) foo[0] += abs(p-q) foo[r] -= abs(p-q) foo[r] += max(p, q) - 1 foo[r+1] -= max(p, q) - 1 ...

0.527107

import sys input = sys.stdin.readline rInt = lambda: int(input()) mInt = lambda: list(map(int, input().split())) rLis = lambda: list(map(int, input().split())) t = int(input()) for _ in range(t): n, k = mInt() a = rLis() b = rLis() a.sort() b.sort(reverse = True) for i in range(k): if a...

0.524998

#!/usr/bin/env python3 try: while True: n = int(input()) b = list(map(int, input().split())) cur = 0 result = 0 for x in b: result += abs(cur - x) cur = x print(result) except EOFError: pass

0.524947

def solve(): n = int(input()) A = [int(k) for k in input().split()] A.sort() ans = 0 for i in range(0,n,2): ans += (A[i+1] - A[i]) print (ans) solve()

0.524764

def CeilIndex(A, l, r, key): while (r - l > 1): m = l + (r - l)//2 if (A[m] >= key): r = m else: l = m return r def LongestIncreasingSubsequenceLength(A, size): # Add boundary case, # when array size is one tailTable = [0...

0.524499

for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) ans = 1 l1 = l[0] for i in range(1,n): if l[i] <= l1: l1 = l[i] ans = ans + 1 print(ans)

0.524236

# cook your dish here for i in range(int(input())): n = int(input()) l = list(map(int,input().split())) s = 0 l.sort(reverse = True) for i in range(0,n,2): s = s+l[i] print(s)

0.524231

def main(): T = int(input()) for t in range(T): N,K = map(int, input().split()) W = list(map(int, input().split())) W.sort() if 2*K > N: K = N - K kid = sum(W[:K]) dad = sum(W[K:]) diff = dad - kid print(diff) def __starting_point(): main() __starting_point()

0.5225

There are several cards arranged in a row, and each card has an associated number of points The points are given in the integer array cardPoints. In one step, you can take one card from the beginning or from the end of the row. You have to take exactly k cards. Your score is the sum of the points of the cards you have ...

class Solution: def maxScore(self, cardPoints: List[int], k: int) -> int: max_score = 0 curr_score= 0 init_hand = cardPoints[len(cardPoints)-k:] max_score = sum(init_hand) curr_score = max_score for i in range(k): curr_score -= init_hand[i] cur...

0.873603

class Solution: def maxSumAfterPartitioning(self, arr, k): res = [0] for idx, val in enumerate(arr): max_val, cur_val = 0, 0 for i in range(max(0, idx-k+1), idx+1)[::-1]: if arr[i] > max_val: max_val =...

0.735294

n, k = map(int, input().split()) a = list(map(int, input().split())) a = a[::-1] s = [a[0]] S = 0 for x in a[1:]: s.append(s[-1]+x) S += s[-1] s.pop() k -= 1 s = sorted(s) i=0 while i<=k-1: S += s.pop() i += 1 print(S)

0.721801

from collections import deque class Solution: def constrainedSubsetSum(self, nums, k): N, queue = len(nums), deque() dp = [val for val in nums] for i, val in enumerate(nums): if queue and (i - queue[0] > k): queue.popleft() if queue and dp[queue[0]] > ...

0.717449

try: n, k=map(int, input().split()) arr=list(map(int, input().split())) forward = [0]*(n+1) backward= [0]*(n+1) backward[0]=arr[0] backward[1]=arr[0]+arr[1] for i in range(k, n): forward[i]=arr[i] +max(forward[i-1],forward[i-2]) for i in range(2, n): backward[i]=arr[i]+max(bac...

0.69156

class Solution: def kConcatenationMaxSum(self, arr: List[int], k: int) -> int: oneArrSum = sum(arr) twoArr = arr + arr def findMaxSub(array): if len(array) == 1: return array[0] cur = 0 small = 0 ret = -999...

0.679774

import heapq def sum_sqaure(a, k): q, r = divmod(a, k) return q**2 * (k-r) + (q+1)**2 * r def diff(a, k): return sum_sqaure(a, k+1) - sum_sqaure(a, k) n, k = map(int, input().split()) nums = list(map(int, input().split())) curr = sum(sum_sqaure(a, 1) for a in nums) Q = [(diff(a, 1), a, 1) for a in nums]...

0.669553

n, k = map(int, input().split()) v = list(map(int, input().split())) reverse_v = v[::-1] lst = [0] * (k + 1) left = [[]] right = [[]] for i in range(1, n+1): left.append(v[:i]) right.append(reverse_v[:i]) for cnt in range(1, k+1): rest = k - cnt total = 0 if cnt <= n: for j in range(cnt+1): lst_j =...

0.659915

def solve(a,l,r,k): out = sorted(a[:l]+a[r:],reverse=True) inside = sorted(a[l:r]) cur = sum(a[l:r]) for i in range(min(k,len(inside),len(out))): if out[i] > inside[i]: cur += out[i]-inside[i] else: break return cur n,k = [int(x) for x in input().split()] a =...

0.647239

def max_sum(arr): # Finds the maximum sum of sub-arrays of arr max_till_now = -1000000 #minimum possible number current_sum = 0 for i in range(len(arr)): if current_sum < 0: # If sum of previous elements is negative, then ignore them. Start fresh # with `current_sum = 0`...

0.637749

N,K=map(int,input().split()) l=list(map(int,input().split())) l.sort(reverse=True) sum=0 for i in range(K) : sum+=l[i] print(sum)

0.634639

n, k = list(map(int,input().split())) L = list(map(int,input().split())) i = 0 p = 0 z = 1 R = [0 for _ in range(k)] while i<n: R[p] += L[n-1-i] p = p + z i+=1 if p == k or p == -1: z = z*(-1) if p == k: p = p - 1 else: p = p + 1 print(max(R))

0.632592

n, k = map(int, input().split()) H = list(map(int, input().split())) H.sort(reverse=True) print(sum(H[k:]))

0.629523

from itertools import accumulate def main(): n, m, k = list(map(int, input().split())) a = list(map(int, input().split())) km = k * m if m == 1: a.sort(reverse=True) print(sum(a[:k])) return a = list(accumulate(a)) a.append(0) if n == km: print(a...

0.628607

import sys n_k = [int(x) for x in sys.stdin.readline().split()] k = n_k[1] a = [int(x) for x in sys.stdin.readline().split()] # sum of k smallest numbers a = sorted(a) k_smallest = sum(a[:k]) print(k_smallest)

0.628395

#!usr/bin/env python3 from collections import defaultdict, deque from heapq import heappush, heappop from itertools import permutations, accumulate import sys import math import bisect def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline()) def LS():return [list(x) for ...

0.625274

try: n,k = map(int,input().split()) x = [int(input()) for _ in range(n)] k = k//2 dp = [0]*(k+1) for i in range(k+1): dp[i] = [0]*n #print(dp) for i in range(1,k+1): #print("*",dp[i-1][0]) diff = (-1)*x[0] for j in range(1,n): diff = max(dp[i-1][j]-x[j],diff) dp[i][j] = max(dp[i][j-1],diff+x[j]) ...

0.62359

def solve(a,n): max1=curr=a[0] for i in range(1,n): curr=max(a[i],curr+a[i]) max1=max(max1,curr) return max1 n,k = list(map(int,input().split())) a = list(map(int,input().split())) print(sum(a)-solve(a,n)+solve(a,n)/k)

0.623298

n, k = list(map(int, input().split())) a = list(map(int, input().split())) mask = list(map(int, input().split())) result = sum(a[i] if mask[i] == 1 else 0 for i in range(n)) h = [a[i] if mask[i] == 0 else 0 for i in range(len(a))] best_awake = sum(h[:k]) curr = best_awake for j in range(k, n): curr += h[j] cu...

0.622997

import sys input = sys.stdin.readline sys.setrecursionlimit(100000) def getN(): return int(input()) def getList(): return list(map(int, input().split())) import math n, k = getList() nums = getList() diff = [] for i, j in zip(nums, nums[1:]): diff.append(j - i) diff.sort() print(sum(diff[:(n-k)]))

0.62289

n, k = list(map(int, input().split())) t = list(map(int, input().split())) d = [0 for _ in range(n)] for _ in range(n): for i in range(n): if i % k != _ % k: d[_] += t[i] print(max(abs(d[_]) for _ in range(n)))

0.622136

line=input().split() n=int(line[0]) k=int(line[1]) nums=input().split() for i in range(n): nums[i]=int(nums[i]) firstsum = 0 for i in range(k): firstsum+=nums[i] totsum=firstsum for i in range(n-k): firstsum-=nums[i] firstsum+=nums[k+i] totsum+=firstsum print(totsum/(n-k+1))

0.621763

n = int(input()) k = int(input()) x = list(map(int,input().split())) ans = 0 for i in range(n): ans += 2*min(k-x[i],x[i]) print(ans)

0.621738

k, n = map(int, input().split()) points = list(map(int, input().split())) dist = [] for i in range(n): if i != n-1: distance = points[i+1] - points[i] else: distance = points[0]+k - points[i] dist.append(distance) max = dist[0] for j in range(1, len(dist), 1): if max < dist[j]: ...

0.621504

from sys import stdin n, k = list(map(int, input().split())) our = list(map(int, input().split())) cap = set(map(int, input().split())) res = 0 sum_b = sum(our) for elem in cap: sum_b -= our[elem - 1] res += sum_b * our[elem - 1] for i in range(len(our)): if (i + 1) not in cap and (i + 1) % n + 1 not in c...

0.621139

# cook your dish here import bisect n, k1, *l = map(int, input().split()) v_l, b_l = l[:n], l[n:] b_inv = {key:[] for key in range(2*k1)} for i in range(n): b_l[i] -= 1 b_inv[b_l[i]].append(i) dp = [[0 for _ in range(n)] for _ in range(n)] for k in range(1, n): for j in range(n-2, -1, -1): ...

0.615481

n,m,k=map(int,input().split()) b=list(map(int,input().split())) diffs=[] for i in range(n-1): diffs.append(b[i+1]-b[i]) diffs.sort() print(k+sum(diffs[:n-k]))

0.615417

R=lambda:list(map(int,input().split())) n,k,x=R() a=list(reversed(R())) print(sum(x if i < k else a[i] for i in range(n)))

0.61518

# for _ in range(int(input())): n,k = list(map(int,input().split())) arr = list(map(int,input().split())) s=set(arr) t1=len(s) max=-1 for i in range(n-k+1): temp=set(arr[i:i+k]) #print(temp,i,k+i+1) t=len(temp) if t1 == t: if max<sum(arr[i:k+i]): max=sum(arr[i:k+i]) print(max)

0.614681

""" Codeforces Contest 270 Problem B Author : chaotic_iak Language: Python 3.3.4 """ def main(): n,k = read() a = [i-1 for i in read()] a.sort() a.reverse() print(sum(a[::k])*2) ################################### NON-SOLUTION STUFF BELOW def read(mode=2): # 0: String # 1: List of strin...

0.611661

n, k = list(map(int, input().split())) A = list(map(int, input().split())) cumsum = [0] for a in A: cumsum.append(cumsum[-1] + a) #print(cumsum) pows = set([k**i for i in range(50)]) cum = dict({}) cum[0] = 1 res = 0 for x in cumsum[1:]: for pow in pows: if (x - pow) in cum: res += cum[x -...

0.610954

import sys input = sys.stdin.readline sys.setrecursionlimit(100000) def getN(): return int(input()) def getList(): return list(map(int, input().split())) import math from bisect import bisect_left n, k = getList() nums = getList() nums.sort() half = (n // 2) + 1 nums = nums[half-1:] sm = sum(nums) def check...

0.604607

class Solution: def getWinner(self, arr: List[int], k: int) -> int: win=0 curr = arr[0] mx=0 for i in range(1,len(arr)): if arr[i] > curr: curr=arr[i] win=0 win=win+1 ...

0.604097

# cook your dish here def func(arr, k): sumi = 0 for j in range(k): sumi += arr[j] maxi = sumi for i in range(k,len(arr)): sumi -= arr[i - k] sumi += arr[i] maxi = max(maxi,sumi) return maxi for _ in range(int(input())): n, k = map(int,input().split()) arr = [...

0.603396

class Solution: def maxProfit(self, k, prices): """ :type k: int :type prices: List[int] :rtype: int """ length = len(prices) v = p = 0 pairs, profits = [], [] while p < length: v = p ...

0.602989

import numpy as np INF = 10**15 def solve(n, k, h): dp = np.full((n+1, n+1), INF, dtype=int) dp[0, 0] = 0 h = np.array([0] + h, dtype=int) for i, h_i in enumerate(h[1:], 1): t = np.maximum(h_i - h[:i], 0) dp[i,1:] = np.min(dp[:i,:-1]+t[:,None], axis=0) return np.min(dp[:, n-k]) n, k...

0.602111

def solve(): n, k = map(int,input().split()) lst = list(map(int,input().split())) lst.sort() ans = 0 for i in range(n - k - 1, n): ans += lst[i] print(ans) for i in range(int(input())): solve()

0.597362

def solve(): n, k, z = map(int,input().split()) lst = list(map(int,input().split())) maxsum = 0 for zz in range(z+1): sum = lst[0] maxn = lst[0] + lst[1] if k-zz * 2 < 0: break for i in range(k-zz * 2): if i + 2 < n: maxn = max(maxn...

0.595479

class Solution: def mergeStones(self, stones: List[int], K: int) -> int: n = len(stones) if (n - 1) % (K - 1) != 0: return -1 prefix = [0] for s in stones: prefix.append(prefix[-1] + s) @lru_cache(None) def dp(i, j): if j - i + 1 < ...

0.593931

def solve(st, k): length = len(st) - k return max(int(st[i:i + length]) for i in range(k + 1))

0.593871

n,k=list(map(int,input().split())) a=list(map(int,input().split())) from collections import Counter dic=Counter(a) dic=sorted(list(dic.items()),key=lambda x:x[1]) ans=0 cnt=0 l=max(len(dic)-k,0) for i in dic: if cnt==l: break ans=ans+i[1] cnt=cnt+1 print(ans)

0.591013

import sys def solve(): n,k, = rv() a, = rl(1) res = 0 count = [0] * 10 for i in range(n): if a[i] < 100: count[10 - (a[i] % 10) - 1] += 1 res += a[i] // 10 for i in range(10): while count[i] > 0 and k >= i + 1: res += 1 count[i] -= 1 ...

0.59028

for _ in range(int(input())): n, k = map(int, input().split()) l = [*map(int, input())] count = [0] * (n + 1) for i in range(n - 1, -1, -1): if l[i] == 1: count[i] = count[i + 1] + 1 x,y = 0,0 for i in range(n): if l[i] == 1: x += 1 else: try: y = max(y, x + k + count[i + k]) except: ...

0.590262

INF = 10 ** 18 + 179 [n, k], a = [list(map(int, input().split())) for x in range(2)] a.sort() dp, l = [[0] * (k - n % k + 1) for x in range(n % k + 1)], n // k for i in range(n % k + 1): for j in range(k - n % k + 1): pos = i * (l + 1) + j * l dp[i][j] = min((dp[i - 1][j] + a[pos - 1] - a[pos - l - ...

0.589653

import sys import copy input = sys.stdin.readline n,m,k=list(map(int,input().split())) A=list(map(int,input().split())) SHOP=[list(map(int,input().split())) for i in range(m)] A=sorted(A)[:k] A=A[::-1] SHOP.sort(key=lambda x:x[0]) from itertools import accumulate DP=[0]+list(accumulate(A)) SUM=copy.deepcopy(DP) ...

0.589037

def f(m): nonlocal dp, sdp l = 0 for i in range(n): while l < n and v[l] < v[i] - m: l += 1 if l - 1 > i - k: dp[i] = False else: dp[i] = (sdp[i - k + 1] != sdp[l - 1]) sdp[i + 1] = sdp[i] + (1 if dp[i] else 0) return dp[n - 1] n, k = ...

0.587642

import sys from math import * def minp(): return sys.stdin.readline().strip() def mint(): return int(minp()) def mints(): return map(int, minp().split()) n, k, x = mints() a = list(mints()) d = [None]*(n+1) p = [None]*(n+1) for i in range(0,k): d[i] = a[i] for xx in range(2,x+1): d,p = p,d for nn in range(n):...

0.58724

import bisect N,K=list(map(int,input().split())) A=list(map(int,input().split())) S=[0 for i in range(N+1)] for i in range(N): S[i+1]=S[i]+A[i] S[i+1]%=K X=[(S[i]-i)%K for i in range(N+1)] D=dict() for i in range(N+1): if X[i] in D: D[X[i]].append(i) else: D[X[i]]=[i] ans=0 for k in D: ...

0.586709

n, k = map(int, input().split()) l, a = list(map(int, input().split())), list(map(int, input().split())) v, t, s = 0, 0, sum(l) for i in range(n): l[i] -= a[i] L, A = [l[0]], [a[0]] for i in range(1, n): if a[i] <= A[-1]: L[-1] += l[i] else: A.append(a[i]) L.append(l[i]) for i in range(len(A...

0.584354

n,m,k = map(int,input().split()) a = list(map(int,input().split())) a = sorted(a) b1 = a[-1] b2 = a[-2] k+=1 total = m//k score = 0 score += (m%k) * b1 score += b1 * (total*(k-1)) score += b2 * total print (score)

0.583533

n = int(input()) a = list(map(int, input().split())) k = input() pref = [a[0]] for i in range(1, n): pref.append(pref[-1] + a[i]) cur = 0 ans = 0 for i in range(n - 1, -1, -1): if k[i] == '0': continue if cur + (pref[i - 1] if i > 0 else 0) > ans: ans = cur + (pref[i - 1] if i > 0 else 0) ...

0.582082

import sys import math def main(arr,k): x=[] y=[] for e in arr: if e%2==0: x.append(e) y.append(0) else: x.append(0) y.append(e) a=[0]*n b=[0]*n a[0]=x[0] b[0]=y[0] for i in range(1,n): if i<k: a[i]=max(x[i],a[i-1]) b[i]=max(y[i],b[i-1]) else: a[i]=max(x[i]+a[i-k-1...

0.58163

n,k=list(map(int,input().split())) arr=list(map(int,input().split())) ans=arr[0]//k val=arr[0]%k for i in range(1,n): if(val==0): ans+=arr[i]//k val=arr[i]%k else: val+=arr[i] if(val<k): val=0 ans+=1 else: ans+=val//k val=va...

0.580594

n, k = [int(i) for i in input().split()] w = [int(i) for i in input().split()] tot = 0 for wi in w: tot += (wi+k-1)//k ans = (tot+1)//2 print(ans)

0.579571

import sys input = sys.stdin.readline def main(): n, m, k = map(int, input().split()) half = m // 2 se_s = [] for i in range(n): lst = list(map(int, input().split())) lst.sort(reverse = True) total_sub = sum(lst[:half]) dp = [[0 for _ in range(k)] for _ in range(half + 1...

0.576074

class Solution: def largestSumOfAverages(self, A: List[int], K: int) -> float: #if not A: return 0 #if len(A)==1: return A[0] # Real Run Time is a little bit UNSTABLE N = len(A) P = [0] * (N+1) for i in range(1,N+1): P[i] = P[i-1] + A[i-1] # Table[a] ...

0.575288

import numpy as np def __starting_point(): N,K = list(map(int,input().split())) P = [ int(p)-1 for p in input().split() ] C = list(map(int,input().split())) # print(P) # 一度計算したサイクル情報をキャッシュしておくための配列 cycleIDs = np.full( N, -1, np.int64 ) cycleInfs = [] cycleID = 0 procCnt = 0 for n in range(N): v = n i...

0.574663

rooms=int(input()) money=list(map(int,input().split())) keys=int(input()) rev=-1 a,b=0,-1 tot=[] #print(money[-3:-1]) x=0 for i in range(keys): #print(money[b:-1],money[0:a]) x=sum(money[b:])+sum(money[0:keys-abs(b)]) tot.append(x) b-=1 print(max(tot))

0.574238

n,k = map(int, input().split()) P = list(map(int, input().split())) e = [] for i in P: e.append((i+1)/2) cumsum = [0]*(n+1) for i in range(1,n+1): cumsum[i] = cumsum[i-1]+e[i-1] k_sum = cumsum.copy() for i in range(n+1): if i>=k: k_sum[i] -= cumsum[i-k] print(max(k_sum[k-1:]))

0.573089

n, k, x = list(map(int, input().split())) a = [None] + list(map(int, input().split())) lo, hi = 0, 10 ** 9 * 5000 q = [None] * (n + 1) def get(mid): f, r = 0, 0 q[0] = 0, 0, 0 for i in range(1, n + 1): if q[r][2] == i - k - 1: r += 1 cur = q[r][0] + a[i] - mid, q[r][1] + 1, i while...

0.571534

tmp = list(map(int,input().split())) n,k = tmp[0],tmp[1] a = list(map(int,input().split())) cur = a[0] w = 0 OK = False for i in range(1,10000): op = a[i] if cur > op: a.append(op) w += 1 else: cur = op a.append(cur) w = 1 if w >= k: OK = True bre...

0.570915

class Solution: def smallestRangeII(self, A: List[int], K: int) -> int: if not A: return 0 nums = sorted([num + K for num in set(A)], reverse=True) max_num = nums[0] min_num = nums[-1] changed_max = max_num - 2 * K res = max_num - min_num for i in ...

0.569798

class Solution: def largestSumAfterKNegations(self, A: List[int], K: int) -> int: A.sort() i = 0 while A[i] < 0 and K > 0: A[i] *= -1 i += 1 K -= 1 if K % 2 == 1 and 0 not in A: return sum(A) - 2*min(A) ret...

0.569084

(n, k) = map(int, input().split()) a = list(map(int, input().split())) a.sort() cur = 0 idx = 0 for i in range(k): ans = 0 while idx < n: ans = a[idx] - cur idx += 1 if ans != 0: break print(ans) cur += ans

0.567252

N,K=map(int,input().split()) A=list(map(int,input().split())) l=0 r=0 s=A[0] ans=0 while True: if s>=K: ans+=N-r s-=A[l] l+=1 else: if r<N-1: r+=1 s+=A[r] else: break print(ans)

0.562911

t=int(input()) for i in range(t): n,k=list(map(int,input().split(" "))) arr=list(map(int,input().strip().split(" ")))[:n] def maxCircularSum(arr, n, k): if (n < k): print("Invalid"); return; sum = 0; start = 0; end = k - 1; for i in range(k):...

0.562464

class CustomStack: def __init__(self, maxSize: int): self.stack = [] self.add = [] self.limit = maxSize def push(self, x: int) -> None: if len(self.stack) < self.limit: self.stack.append(x) self.add.append(0) def pop(self) -> int: if len(sel...

0.560102

import sys read = sys.stdin.read readline = sys.stdin.readline readlines = sys.stdin.readlines sys.setrecursionlimit(10 ** 9) INF = 1 << 60 MOD = 1000000007 def main(): N, K, *X = list(map(int, read().split())) A = [abs(x - X[0]) for x in X] ans = INF for i in range(N - K + 1): if ans > min...

0.558663

n, k = map(int,input().split()) lo = 0#Imposs hi = 10 ** 9#Poss l = list(map(int, input().split())) while hi - lo > 1: test = lo + (hi - lo)//2 odd = 0 skip = False for v in l: if skip: skip = False odd += 1 else: if v <= test: odd...

0.557265

inp = input().split() n = int(inp[0]) k = int(inp[1]) a = input().split() for i in range(n): a[i] = int(a[i]) # End of Input bank = {} # Preparation for i in range(n): arg = (len(str(a[i])),a[i]%k) #print("Detect:",arg) bank[arg] = bank.get(arg,0)+1 ans = 0 # Query for i in range(n): ten = 1 ...

0.557078

n, m, k = map(int, input().split()) a = list(map(int, input().split())) ans = 0 for i in range(n): orders = map(int, input().split()) for order in orders: ans += a.index(order) + 1 a.remove(order) a.insert(0, order) print(ans)

0.556738

class Solution: def longestOnes(self, A: List[int], K: int) -> int: hulu = [] cnt = 0 num = A[0] for x in A: if x == num: cnt += 1 else: hulu.append([num,cnt]) cnt = 1 num = x if cnt>0: ...

0.556397

import math n, k = map(int, input().split()) a = list(map(int, input().split())) now = [-1] * k t = [0] * k nxt = 0 m = 0 intr = [False for i in range(n)] while m < n: for i in range(k): if now[i] != 1005 and (now[i] == -1 or t[i] == a[now[i]]): if now[i] != -1: m += 1 ...

0.556061

def ii(): return int(input()) def mi(): return list(map(int, input().split())) def li(): return list(mi()) n, k = mi() a = li() s = input().strip() ans = 0 i = 0 while i < n: j = i + 1 while j < n and s[j] == s[i]: j += 1 b = sorted(a[i:j]) ans += sum(b[-k:]) i = j print(ans)

0.555228

# python3 def readline(): return tuple(map(int, input().split())) def main(): n, k = readline() a = readline() answer = list() for (i, link) in enumerate(a): bottom = max(0, i - k) top = min(n, i + k + 1) if link == 0: answer.append(top - bottom) else: ...

0.554263

import numpy as np n,k = map(int,input().split()) a = np.array(list(map(int,input().split()))) a.sort() posi = a[a>0] zero = a[a==0] nega = a[a<0] def cnt(x): c = 0 if x >= 0: c += len(zero)*n c += np.searchsorted(a, x // posi, side = 'right').sum() c += (n-np.searchsorted(a, (- x - 1) // (-neg...

0.553743

def convert_to_binary(coef): res = [] n = len(coef) carry = 0 i = 0 while i < n + 1000: if i >= n and not carry: break cur = carry if i < n: cur += coef[i] mod = cur % 2 div = cur // 2 # print(cur, div, mod) res.append(...

0.552527

import sys input = sys.stdin.readline n,k=list(map(int,input().split())) if k==0: print(0) return A=sorted(map(int,input().split())) # DP[UL][n][left] # [left*pow(2,n),left*pow(2,n)+pow(2,n))の間のチームで, # ファンのチームが # UL=0: upperでもlowerでも勝ち残っている # UL=1: upperでのみ勝ち残っている # UL=2: lowerでのみ勝ち残っている # ときの、そこまでのファンのチームの試...

0.552307

n, k = [int(c) for c in input().split()] a = [] for i in range(k): ak = [int(c) for c in input().split()] a.append(ak[1:]) total = k - 1 for ak in a: if ak[0] == 1: j = 1 while j <= len(ak) - 1: if ak[j] != ak[j-1] + 1: break j += 1 total += ...

0.5519

n,k = list(map(int, input().split())) L = list(map(int, input().split())) i = 1 while k > 0: k = k - i i += 1 k = k + i - 1 print(L[k-1])

0.551552

n,k=list(map(int,input().split())) a=list(map(int,input().split())) prefix=[a[0]] for i in range(1,n): prefix.append(prefix[-1]+a[i]) ans=[] for i in range(n): for j in range(i+k-1,n): if(i==0): ans.append(prefix[j]/(j-i+1)) else: ans.append((prefix[j]-prefix[i-1])/(j-i+1...

0.550077

n,k = list(map(int,input().split())); a = list(map(int,input().split())); if max(a) >= k: print(0) return lx = 0 while a[lx] == 0: lx+=1 lo,hi = 1,k def can(x): bc = 1 tot = 0 for i in range(n-lx): if(bc >= k): return True tot += bc*a[n-1-i] bc *= (x+i) ...

0.55005

import heapq n,k=list(map(int,input().split())) S=[list(map(int,input().split())) for i in range(n)] S.sort(key=lambda x:x[1],reverse=True) ANS=0 LENGTH=0 H=[] for x,y in S: heapq.heappush(H,x) LENGTH+=x if len(H)>k: z=heapq.heappop(H) LENGTH-=z if ANS<LENGTH*y: ANS=...

0.548871

# cook your dish here from sys import stdin,stdout a0=0 a1=1 n,k=stdin.readline().strip().split(' ') n,k=int(n),int(k) arr=list(map(int,stdin.readline().strip().split(' '))) def solve(n,k,arr): sol=[] l=0;u=k; while l!=u: sol.append(arr[l:min(len(arr),u)]) l=min(l+k,len(arr)) u=min(u+k,len(arr)) ...

0.548406

k = int(input()) room_number_list = list(map(int,input().split())) room_number_set = set(room_number_list) room_number_list_sum = sum(room_number_list) room_number_set_sum = sum(room_number_set) * k diff = room_number_set_sum - room_number_list_sum for i in room_number_set: if diff == ((k-1)*i): print(i) ...

0.548356

n, k = list(map(int, input().split())) a = list(map(int, input().split())) d = list(map(int, input().split())) if k == 0: best = 0 curr = sum(a) for i in range(n): best = max(best, curr - d[i]) curr -= a[i] print(best) elif k == 1: best = sum(a[:-1]) - min(d[:-1]) other = s...

0.548315

n, k = map(int, input().split()) s = sorted(list(map(int, input().split())), reverse = True) print(s[k - 1])

0.548081

import bisect n,k=list(map(int,input().split())) A=list(map(int,input().split())) A.sort() DP=[[0]*(k+1) for i in range(n)] for i in range(n): x=bisect.bisect_right(A,A[i]+5)-1 #print(i,x) for j in range(k-1,-1,-1): DP[i][j]=max(DP[i][j],DP[i-1][j]) DP[x][j+1]=max(DP[i-1][j]+x-i+1...

0.547928

n, k = map(int, input().split()) a = list(map(int, input().split())) cnt = {} for elem in a: if elem in cnt: cnt[elem] += 1 else: cnt[elem] = 1 cnt = sorted(list(cnt.items())) for i in range(len(cnt)): cnt[i] = list(cnt[i]) left = 0 right = len(cnt) - 1 while k > 0: if k < cnt[left][1] ...

0.547547

#!usr/bin/env python3 from collections import defaultdict,deque from heapq import heappush, heappop import sys import math import bisect import random def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline()) def LS():return [list(x) for x in sys.stdin.readline().split()]...

0.54716

import sys n, k = map(int, sys.stdin.readline().split()) nums = list(map(int, sys.stdin.readline().split())) total = sum(nums) avg = int(total / n) def check1(nums, target, K): for x in nums: if K < 0: return False if x < target: K -= target - x return K >= 0 def check...

0.54644

try: a=list(map(int,input().split())) n=a[0] k=a[1] hi=[] for i in range(n): hi.append(int(input())) hi.sort() diff=[] for i in range(n-k+1): diff.append(hi[i+k-1]-hi[i]) print(min(diff)) except: pass

0.54591

def check(num1, num2, p, k): v = num1 + num2 v *= num1 * num1 + num2 * num2 v %= p v += p v %= p return v == k % p def __starting_point(): n, p, k = (int(x) for x in input().split()) idx___number = [int(x) for x in input().split()] idx___precount = [((pow(x, 4, p) - k * x) % p + p...

0.544755

s = input().strip() k = int(input()) w = list(map(int, input().split())) f = 0 m = max(w) for i in range(len(s)): f += (i + 1) * w[ord(s[i]) - ord('a')] for i in range(len(s), len(s) + k): f += (i + 1) * m print(f)

0.544667

import math import bisect n, x, k = list(map(int, input().split())) a = sorted(list(map(int, input().split()))) ans = 0 for num in a: l = math.ceil(num/x)*x + (k-1)*x r = l + x - 1 l = num if l < num else l # print(l, r, bisect.bisect_left(a, l), bisect.bisect_right(a, r), bisect.bisect_right(a, r) -...

0.544582

R=lambda:list(map(int,input().split())) n,k=R() a=sorted(R()) b=0 for i in a: while i>k+k: k+=k b+=1 k=max(k,i) print(b)

0.544145

import sys input = sys.stdin.readline T = int(input()) for _ in range(T): N, K = list(map(int, input().split())) A = [int(a) for a in input().split()] B = [A[i+K]-A[K] for i in range(N-K)] mi = 10**20 mx = -1 for i in range(N-K): if A[i+K]-A[i] < mi: mi = A[i+K]-A[i] ...

0.541306

class Solution: def numberOfSubarrays(self, nums: List[int], k: int) -> int: # save all even subarray's length which between odds edge = [] res = 0 count = 0 for i in nums: # odd if i % 2: # +1 because range from 0 to count when doing c...

0.539339

def main(): import sys from collections import defaultdict tokens = [int(i) for i in sys.stdin.read().split()] tokens.reverse() n, k = tokens.pop(), tokens.pop() d1 = defaultdict(int) d2 = defaultdict(int) result = 0 for i in tokens: result += d2[i * k] ...

0.538786

def ii(): return int(input()) def mi(): return list(map(int, input().split())) def li(): return list(mi()) N, K, L = mi() A = li() A.sort() end = 1 while end < N * K and A[end] <= A[0] + L: end += 1 B = A[:end] if len(B) < N: ans = 0 else: cur = ans = 0 for i in range(N): ans += B[c...

0.53831

import sys import heapq from collections import namedtuple Record = namedtuple('Record', ['index', 'book_id']) l1 = sys.stdin.readline() l2 = sys.stdin.readline() n, k = list(map(int, l1.split(' '))) books = list(map(int, l2.split(' '))) cost = 0 cache = set() prev = dict() # book_id -> index next = [n+1] * n # ind...

0.538214

Your music player contains N different songs and she wants to listen to L (not necessarily different) songs during your trip. You create a playlist so that: Every song is played at least once A song can only be played again only if K other songs have been played Return the number of possible playlists. As the answe...

import math class Solution: def numMusicPlaylists(self, N: int, L: int, K: int) -> int: s=0 c=0 r=0 x=math.factorial(N) while(True): c=x*((N-r-K)**(L-K))*(-1)**(r)//(math.factorial(N-r-K)*math.factorial(r)) if(c!=0): s=(s+c)%(10**9+7) ...

0.876504

from scipy.special import comb mod = 10**9 + 7 N, K = list(map(int,input().split())) for i in range(1,K+1): a = K-i b = i-1 c = N-(i-1)-K d = i print((comb(a+b,b,exact=True)*comb(c+d,d,exact=True)%mod))

0.718444

mod = 1000000007 eps = 10**-9 def main(): import sys input = sys.stdin.readline N, K = list(map(int, input().split())) if K == 1: if N == 1: print((1)) else: print((pow(2, N - 2, mod))) return dp = [[0] * (N+1) for _ in range(K-1)] for j in ra...

0.716275

mod=10**9+7 n,k=list(map(int,input().split())) A=[0]*(n+1) B=[0]*(n+1) C=[0]*(n+1) F=[0]*(n+1) G=[0]*(n+1) F[0]=G[0]=1 for i in range(1,n+1): G[i]=F[i]=F[i-1]*i%mod G[i]=pow(F[i],(mod-2),mod) for i in range(0,n): if i*2>n: break B[i]=(F[n-i]*G[i]*G[n-i*2])%mod for i in range(0,n//2+1): for j in range(0,n//2+1...

0.693771

def two_by_n(n, k): vv, vh, hv, hh = k-1, (k-1)*(k-2), k-2, (k-1)*(k-2) + 1 va, ha, vb, hb = 0, 0, 1, 1 for i in range(n - 1): va, ha, vb, hb = vb, hb, vv*vb + vh*ha, hv*vb + hh*ha return (k * vb + k*(k-1) * ha) % 12345787

0.689916

n,k=map(int,input().split()) mod=998244353 dp=[0]*(n+1) dp[0]=1 for i in range(1,n+1): for j in range(i,-1,-1): dp[j]=dp[j-1] if 2*j<=i: dp[j]+=dp[2*j] dp[j]%=mod print(dp[k])

0.677601

fa = [1] m = 251 P = 10**9+7 for i in range(1, m+1): fa.append(fa[-1] * i % P) fainv = [pow(fa[m], P-2, P)] for i in range(1, m+1)[::-1]: fainv.append(fainv[-1] * i % P) fainv = fainv[::-1] def C(a, b): return fa[a] * fainv[a-b] * fainv[b] % P N, K = list(map(int, input().split())) poK = [1] for i in range(251): poK.a...

0.676704

import math n,m,k=map(int,input().split()) out=1 for i in range(k): out*=(m-1) out%=998244353 out*=m out%=998244353 out*=(math.factorial(n-1)//math.factorial(k)//math.factorial(n-1-k)) out%=998244353 print(out)

0.674118

def vasya_and_array(): n,k,leng = [int(x) for x in input().split()] if(leng==1): return 0 a = [int(x) for x in input().split()] mod = 998244353 a.insert(0,0) dp = [[0 for x in range((k+1))] for y in range(n+1)] sumdp = [0 for _ in range(n+1)] sumdp[0]=1 count = [0 for _ in ra...

0.670958

from collections import defaultdict,deque import sys,heapq,bisect,math,itertools,string,queue,datetime sys.setrecursionlimit(10**8) INF = float('inf') mod = 998244353 eps = 10**-7 def inp(): return int(input()) def inpl(): return list(map(int, input().split())) def inpls(): return list(input().split()) K,N = inpl() MA...

0.667883

n,k=[int(i) for i in input().split()] l=[int(i) for i in input().split()] cons=int(5e5+1) mod=10**9+7 tpa=[1 for i in range(cons)] tpa[0]=1 for i in range(1,cons): tpa[i]=(tpa[i-1]*2)%mod if k>n: print(tpa[n-1]) else: il=[[]for i in range(k+1)] for i in range(n): if l[i]<=k: il[l[i]]...

0.658758

rr = lambda: input().strip() rri = lambda: int(rr()) rrm = lambda: list(map(int, rr().split())) MOD = 10**9 + 7 class DSU: def __init__(self, N): #R * C is the source, and isn't a grid square self.par = list(range(N+1)) self.rnk = [0] * (N+1) self.sz = [1] * (N+1) def find(self...

0.656154

def norm(x): return (x % 998244353 + 998244353) % 998244353 n, k = map(int, input().split()) dp1 = [0] dp2 = [0] for i in range(n): l = [1] cur = 0 for j in range(n + 1): cur += l[j] if(j > i): cur -= l[j - i - 1] cur = norm(cur) l.append(cur) dp1.appen...

0.656041

n, m, k = map(int, input().split()) mod = 998244353 def powerDX(n, r, mod): if r == 0: return 1 if r%2 == 0: return powerDX(n*n % mod, r//2, mod) % mod if r%2 == 1: return n * powerDX(n, r-1, mod) % mod def cmb(n, r, mod): if ( r<0 or r>n ): return 0 r = min(r, n-r) return g1[n] * g2...

0.655465

import sys n, k = (int(i) for i in input().split()) ff = [1] * (n + 1) for i in range(1, n + 1) : ff[i] = ff[i - 1] * i dd = [0] * (n + 1) dd[1] = 0 dd[2] = 1 for i in range(3, n + 1) : dd[i] = (i - 1) * (dd[i - 1] + dd[i - 2]) ans = ff[n] for i in range(n - k) : c = ff[n] // ff[n - i] c = c // ff[i] c = ...

0.65383

n,k=list(map(int,input().split())) mod=998244353 NEXT={(0,1):2,(1,2):2}#ww or wh,point k,場合の数 for i in range(1,n): NOW=NEXT NEXT=dict() for key in NOW: if key[0]==0: if k-(n-i)*2<=key[1]<=k: NEXT[key]=NEXT.get(key,0)+NOW[key] if k-(n-i)*2<...

0.651931

n,k=map(int,input().split()) L=list(map(int,input().split())) ind=[] for i in range(n): if L[i]>n-k:ind.append(i) m=1 for i in range(len(ind)-1): m*=(ind[i+1]-ind[i]) m%=998244353 print(((n*(n+1)//2)-((n-k)*((n-k)+1))//2),m)

0.65188

n, k = list(map(int, input().split())) m = 0x3b9aca07 v = 500000004 r = 0 p = pow(2, n, m) a = [1] + [0] * k for i in range(k): for j in range(i, -1, -1): a[j + 1] += a[j] a[j] = a[j] * j % m for i in range(k + 1): r = (r + p * a[i]) % m p = p * v * (n - i) % m print(r)

0.651779

import sys import numpy as np sr = lambda: sys.stdin.readline().rstrip() ir = lambda: int(sr()) lr = lambda: list(map(int, sr().split())) MOD = 10 ** 9 + 7 N, K = lr() M = int(N**.5) # M+1以上で、Nを割るとxになるもの upper_cnt = np.zeros(M+1, dtype=np.int64) # 1-indexed A = np.arange(M+1, dtype=np.int64) upper_cnt[1:] = N // A[1...

0.650285

mod = int(1e9) + 7 # <-- input modulo maxf = 500000 # <-- input factional limitation def make_fact(n, k): tmp = n perm = [i for i in range(k)] L = [0 for _ in range(k)] for i in range(k): L[i] = tmp % (i + 1) tmp //= i + 1 LL = [0 for _ in range(k)] for i in range(k): ...

0.647984

import sys from random import choice,randint inp=sys.stdin.readline out=sys.stdout.write flsh=sys.stdout.flush sys.setrecursionlimit(10**9) inf = 10**20 eps = 1.0 / 10**10 mod = 10**9+7 dd = [(-1,0),(0,1),(1,0),(0,-1)] ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)] def MI(): return map(int, inp().str...

0.646491

MOD = 998244353 def inv(x): return pow(x,MOD - 2, MOD) n, k = list(map(int, input().split())) if k >= n: print(0) else: out = 0 col = n - k binom = 1 mult = 1 for i in range(n, col, -1): mult *= i mult *= inv(n + 1 - i) mult %= MOD for i in range(col, ...

0.643002

__author__ = 'Prateek' MOD = int(10**9+7) def test(): n,k=list(map(int,input().split())) l = k d =n-1 ans = l-1 ans = ans%MOD a = k-n term = (d+a)//d ll = (a%MOD - (((term-1)%MOD)*(d%MOD))%MOD)%MOD if ll < 0: ll = (ll +MOD)%MOD m = ((term%MOD)*((a%MOD+ll%MOD)%MOD))%MOD m = (m*pow(2,MOD-2,MOD))%MOD ans +...

0.641707

MOD = 10**9 + 7 n, l, r = list(map(int, input().split())) lr_counts = [(r-l+1)//3]*3 for i in range(l + sum(lr_counts), r + 1): lr_counts[i % 3] += 1 cur_counts = [1, 0, 0] for _ in range(n): new_counts = [0, 0, 0] for j in range(3): for k in range(3): new_counts[(j + k) % 3] += cur_c...

0.639427

import sys input = sys.stdin.readline import numpy as np MOD = 10**9 + 7 N,M,K = map(int,input().split()) def cumprod(arr): L = len(arr); Lsq = int(L**.5+1) arr = np.resize(arr,Lsq**2).reshape(Lsq,Lsq) for n in range(1,Lsq): arr[:,n] *= arr[:,n-1]; arr[:,n] %= MOD for n in range(1,Lsq): ...

0.63714

n,k=list(map(int,input().split())) M=10**9+7 print(k**~-k*pow(n-k,n-k,M)%M)

0.636203

mod=10**9+7 def fibonacci(n): if n < 0: raise ValueError("Negative arguments not implemented") return (_fib(n)[0]%mod + mod)%mod; def _fib(n): if n == 0: return (0, 1) else: a, b = _fib(n // 2) c = (a * (b * 2 - a))%mod d = (a * a + b * b)%mod if n % 2 == 0: return (c, d) else: return (d, c + d)...

0.635033

import numpy as np def solve(n, k): if k % 2 == 1: return 0 k //= 2 MOD = 10 ** 9 + 7 dp = np.zeros((1, k + 1), dtype=np.int64) dp[0, 0] = 1 for i in range(1, n + 1): max_d = min(i + 1, n - i + 1, k + 1) ndp = np.zeros((max_d, k + 1), dtype=np.int64) for d, ks...

0.634696

import math p=7+10**9 n,k=list(map(int,input().split())) c=math.factorial(n+k-1)//((math.factorial(k))*(math.factorial(n-1))) print(c%p)

0.633974

f = 5003*[0] modn = 1000000007 def qPow(a, b): nonlocal modn res = 1 while b > 0: if (b & 1) == 1: res = res * a % modn a = a * a % modn b = b >> 1 return res def getF(): nonlocal f f[0] = 1 for i in range(1, 5001): f[i] = f[i-1] * i def __starting_point(): getF() T = int(input()) while T > 0...

0.633547

def ii(): return int(input()) def mi(): return list(map(int, input().split())) def li(): return list(mi()) N, K, L = mi() A = li() A.sort() end = 1 while end < N * K and A[end] <= A[0] + L: end += 1 B = A[:end] if len(B) < N: ans = 0 else: cur = ans = 0 for i in range(N): ans += B[c...

0.633134

from functools import reduce def comb(n, max_k, mod): """ (n,k) := n個からk個選ぶ組み合わせ k = 0~max_Kまでを計算して返す """ res = [1]*(max_k+1) t = 1 for i in range(max_k+1): res[i] *= t t *= n-i t %= mod n = reduce(lambda x,y: (x*y)%mod, range(1,max_k+1), 1) n = pow(n,-1, mod...

0.629455

n, m, k = map(int, input().split()) if k == -1 and n % 2 != m % 2: print(0) else: print(pow(2, (n - 1) * (m - 1), 10**9 + 7))

0.629151

n, k = list(map(int, input().split())) MOD = 10**9+7 def fast_modinv(up_to, M): ''' Fast modular inverses of 1..up_to modulo M. ''' modinv = [-1 for _ in range(up_to + 1)] modinv[1] = 1 for x in range(2, up_to + 1): modinv[x] = (-(M//x) * modinv[M%x])%M return modinv maxn = 2*10**5 + 1...

0.62834

from scipy.special import comb def multiply(n, k): r, d = 1, 2 while d * d <= n: i = 0 while n % d == 0: i += 1 n //= d r *= comb(i + k - 1, k - 1, exact=True) d += 1 if n > 1: r *= k return r

0.627051

n,k=list(map(int, input().split())) s=0 for i in range(k,n+2): s+=i*(n-i+1)+1 print((s%(10**9+7)))

0.624689

mod = 10 ** 9 + 7 MAX = 2 * 10 ** 5 fact = [1] * (MAX + 1) for i in range(1, MAX + 1): fact[i] = (fact[i-1] * i) % mod inv = [1] * (MAX + 1) for i in range(2, MAX + 1): inv[i] = inv[mod % i] * (mod - mod // i) % mod fact_inv = [1] * (MAX + 1) for i in range(1, MAX + 1): fact_inv[i] = fact_inv[i-1] * inv[...

0.624522

A = [0] * 100001 M = 1000000007 def nCk(n, k): if k ==0 or k ==n: return 1 r = (A[n-k]*A[k])%M x = (A[n]*pow(r, M-2, M))%M return x for _ in range(int(input())): n, k = list(map(int, input().split())) for i in range(n-1): u,v = input().split() summ = 0 A[0] = 1 for i in range(1, len(A)): A[i] = (i*A[i-...

0.624418

def modfac(n, MOD): f = 1 factorials = [1] for m in range(1, n + 1): f *= m f %= MOD factorials.append(f) inv = pow(f, MOD - 2, MOD) invs = [1] * (n + 1) invs[n] = inv for m in range(n, 1, -1): inv *= m inv %= MOD invs[m - 1] = inv retur...

0.621879

k, pa, pb = list(map(int, input().split())) MOD = 10**9 + 7 INF = ((pa + pb) * pow(pb, MOD-2, MOD)) % MOD rAB = pow(pa+pb, MOD-2, MOD) rB = pow(pb, MOD-2, MOD) memo = {} def dfs(a, ab): if ab >= k: return ab if a + ab >= k: #return INF #return (pa + pb) / pb return ((a + MOD-1...

0.615746

import numpy as np N,K = list(map(int,input().split())) A=np.array(list(map(int,input().split()))) mod = 998244353 fact = [1]*(K+1) for i in range(1,K+1): fact[i]=i*fact[i-1]%mod inv_fact = [pow(f,mod-2,mod) for f in fact] # r = [sum(pow(aa,t,mod) for aa in A)%mod for t in range(K+1)]##遅い r = [0]*(K+1) r[0] = N ...

0.61289

N,K,M=map(int,input().split());R=range;T=[[1]] for i in R(1,N): q=K*i if i>~i+N:T+=[y:=T[-1][:len(T[~i+N])]] else:T+=[y:=T[-1][:]+[0]*q] p=len(y)-i for j in R(p):y[j+i]+=y[j]%M for j in R(p-q):y[~j]-=y[~j-i-q]%M for i in R(N):print(sum(T[i][j]*T[~i+N][j]for j in R(len(T[i])))*-~K%M-1)

0.6124

''' // There are n! / (i+1)! * i permutations with decreasing seq length i (i+1 changes) for i <= n! // There are n! / (i+1)! permutations for each 1 <= j <= i of position of moved one // All nonempty things + n*n! * (n*n! + 1) / 2 // Subtract off everything inside one of them - n! * n * (n+1) / 2 // Subtract off ev...

0.611449

mod = 12345787 mat = [([1,1],[0,1,3]), ([2,1,-1],[0,2,6,11]), ([2,3,-1,-1],[0,2,10,23,70]), ([3,3,-4,-1,1],[0,3,15,42,155,533]), ([3,6,-4,-5,1,1],[0,3,21,69,301,1223,5103])] for i in range(100): [m.append(sum(k*m[-1-i] for i,k in enumerate(c))%mod) for c,m in mat] def circular_limited_sums...

0.608781

l, r, k =list(map(int,input().split())) d = {i:2**i for i in range(10)} cache = {} def can(i, m): return d[i] & m def calc(m): b = 1 c = 0 for i in range(10): if b & m: c += 1 b *= 2 return c def sm(ln, k, m, s='', first=False): if ln < 1: return 0, 1...

0.607829

M=998244353 class Factorial: def __init__(self,n): self.f=f=[0]*(n+1) f[0]=b=1 for i in range(1,n+1):f[i]=b=b*i%M self.inv=inv=[0]*(n+1) inv[n]=b=pow(self.f[n],M-2,M) for i in range(n,0,-1):inv[i-1]=b=b*i%M def factorial(self,i): return self.f[i] def i...

0.605731

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools import time,random sys.setrecursionlimit(10**7) inf = 10**20 eps = 1.0 / 10**10 mod = 10**9+7 mod2 = 998244353 dd = [(-1,0),(0,1),(1,0),(0,-1)] ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)] def LI(): return lis...

0.604576

MOD = 1000000007 def f(n, cnt): """ n! / (n - cnt)! """ ans = 1 for _ in range(cnt): ans = (ans * n) % MOD n -= 1 return ans def main(): n, x, pos = list(map(int, input().split())) chk1 = 0 chk_r = 0 left = 0 right = n while left < right: middl...

0.604104

import sys sys.setrecursionlimit(4100000) mod = 10 ** 9 + 7 N, K = map(int,input().split()) graph = [[] for _ in range(N)] for _ in range(N-1): a, b = map(int,input().split()) graph[a-1].append(b-1) graph[b-1].append(a-1) ans = K def factorial(n, k, mod): fact = 1 for integer in range(n, n-k, -1...

0.603732

N, K = map(int, input().split()) S = []; T = [] for x in range(1, int(N**.5)+1): if N % x == 0: S.append(x) if x*x < N: T.append(N//x) T.reverse() S += T M = len(S) U = [] MOD = 10**9 + 7 ans = 0 v = 0 for i in range(M): x = S[i] v = pow(K, (x+1)//2, MOD) for j in range(i): ...

0.602043

# cook your dish here for _ in range(int(input())): n,k = list(map(int,input().split())) mod = 10**9+7 s=0 for i in range(1,n+1): p = pow(k,(2*i)-1,mod) # print(p) s=(s+p)%mod # print(k) k = (p*k)%mod print(s)

0.601062

import sys readline = sys.stdin.readline T = int(readline()) MOD = 998244353 Ans = [None]*T for qu in range(T): N, K = map(int, readline().split()) A = [0] + list(map(int, readline().split())) + [0] B = list(map(int, readline().split())) C = [None]*(N+1) for i in range(1, N+1): C[A[i]] = i...

0.600311

def for1(M,k): ret = 0.0 x = k*k+0.0 z=x for m in range(1,M): ret+=(M-m)/x x*=z return ret def for2(M,k): ret = 0.0 x = k+0.0 for m in range(1,M): ret+=(M-m)/x x*=k return ret def ans(M,N,K): return int(round(M*N+M*for2(N,K)+N*for2(M,K)+K*for1(M,K)*for1(N,K),0)) M,N,K = list(map(int,input(...

0.600077

import sys sys.setrecursionlimit(10**8) MOD = 10**9+7 fac = [0]*(10**5+1) def pre() : fac[0] = 1 for i in range(1,10**5+1) : fac[i] = fac[i-1]*i fac[i] = fac[i]%MOD def dfs(gp , vertex , visited , deg , ans) : visited[vertex] = 1 stack = [] stack.append(vertex) while len(stack)>0 : vertex = stack.pop() ...

0.599057

def p(t,k,n,l=1): if t<l: pass elif k==1 and t!=n: yield [t] else: yield from ([m]+s for m in range(l,t-l+1) for s in p(t-m,k-1,n,m) if m!=n) def part_const(t,k,n): return sum(1 for _ in p(t,k,n))

0.598885

# cook your dish here mod = 1000000009 import math K = int(input()) N = 2 ** K temp1 = N//2 fact = math.factorial((N/2-1))%mod div = ((fact **2) * temp1)*N%mod temp2 = 1 for i in range(1,N+1): if i < N/2: print("0") else: print(div) div = (((div * pow(temp2,mod-2,mod))%mod)*temp1)%mod ...

0.596018

class Solution: def countOrders(self, n: int) -> int: if n == 1: return 1 p = (n-1)*2+1 dp = [0 for i in range(n+1)] dp[1] = 1 M= 10**9+7 for i in range(2,n+1): p = (i-1)*2+1 ...

0.593915

n,m,L,R = list(map(int,input().split())) p = 998244353*2 pp = p//2 #liczba pokryc n x m ze jest parzyscie wiele zer albo parzyscie wiele jedynek def pow(a,w): wyn = 1 mn = a while w > 0: if w%2 == 1: wyn = (wyn * mn)%p mn = (mn*mn)%p w //= 2 return wyn dupsko = pow((R-L+1), m*n) if L == R: print(1) else...

0.593854

def f(n, mod): res = 0 n1 = 1 n2 = 2 k = 1 now = 0 while n >= k: if now == 0: now = 1 res = (res + n1 * k + (k * (k - 1))) % mod n -= k k *= 2 n1 = n1 + k else: now = 0 res = (res + n2 * k + (k * ...

0.593458

MOD = 998244353 list_size = 1000001 f_list = [1] * list_size f_r_list = [1] * list_size for i in range(list_size - 1): f_list[i + 1] = int((f_list[i] * (i + 2)) % MOD) def power(n, x): if x == 1: return n elif x % 2 == 0: return power(int((n * n) % MOD), int(x / 2)) else: return int((n * power(n, x - 1)) ...

0.59253

from collections import deque def count_ways(n, k): s,d = 1,deque([0]*k) for i in range(n): d.append(s) s = 2*s-d.popleft() return s-d.pop()

0.591531

import bisect,collections,copy,heapq,itertools,math,numpy as np,string,sys def I(): return int(sys.stdin.readline().rstrip()) def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) def S(): return sys.stdin.readline().rstrip() def LS(): return list(sys.stdin.readline().rstrip().split()) class UnionFind(...

0.59145

import math import operator as op from functools import reduce from operator import mul # or mul=lambda x,y:x*y from fractions import Fraction def nCk(n,k): return int( reduce(mul, (Fraction(n-i, i+1) for i in range(k)), 1) ) def ncr(n, r): r = min(r, n-r) if r == 0: return 1 numer = reduce(op.mu...

0.591223

from math import factorial cat = [1, 1] p = 10**9 + 7 n = int(input()) ans = 0 fac = [1] mat = [[0 for i in range(n + 1)] for j in range(n + 1)] mat[0][0] = 1 for i in range(1, n + 1): mat[i][0] = mat[i - 1][i - 1] for j in range(i): mat[i][j + 1] = (mat[i][j] + mat[i - 1][j]) % p print(mat[n][n - 1]...

0.590933

p=10**9+7 import math def inv(k,p): prod=1 while k>1: prod*=(p//k+1) k=(k*(p//k+1))%p return prod%p n=int(input()) a=[] k=int(math.log2(n)) x=n while x>0: y=x//2 a.append(x-y) x=y c=[sum(a[i:]) for i in range(k+1)] b=[n//(3*2**i)-n//(6*2**i) for i in range(k+1)] d=[n//2**i-n//(3*...

0.59016

def check(amidakuji,w): before=0 flag=True for _ in range(w-1): if amidakuji&1==1 and before==1: flag=False break elif amidakuji&1==1: before=1 amidakuji>>=1 else: before=0 amidakuji>>=1 return flag from sys...

0.589474

MOD = 1000000009 n,m,k = [int(x) for x in input().split()] num0 = n-m num1fin = num0*(k-1) if num1fin >= m: print(m) else: num1open = m-num1fin sets = num1open//k rem = num1open%k print(((pow(2,sets,MOD)-1)*2*k+rem+num1fin)%MOD)

0.586727

MOD = 10 ** 9 + 7 out = 1 n = int(input()) for i in range(n): out *= (i + 1) out %= MOD out -= pow(2, n - 1, MOD) print(out % MOD)

0.586637

P = 10**9 + 7 n, k = list(map(int, input().split())) print(n + 1 if k == 1 else (k * pow(2 * k - 1, n, P) - pow(k, n, P)) * pow(k - 1, P - 2, P) % P)

0.586364

from math import sqrt, ceil MAX_N = 10 ** 6 * 2 prime = [] isPrime = [True for i in range(MAX_N)] for i in range(2, MAX_N): if isPrime[i]: prime.append(i) for j in range(i * i, MAX_N, i): isPrime[j] = False def factor(a): divs = [] for i in prime: cnt = 0 w...

0.586349

from collections import Counter class Unionfind(): def __init__(self, n): self.n = n self.parents = [-1] * (n+1) def find(self, x): if(self.parents[x] < 0): return x else: self.parents[x] = self.find(self.parents[x]) return self.paren...

0.585049

import sys input = sys.stdin.readline MOD = 10 ** 9 + 7 t = int(input()) for _ in range(t): n, p = list(map(int, input().split())) l = list(map(int, input().split())) if p == 1: print(n % 2) else: l.sort(reverse = True) curr = l[0] out = 0 real = True f...

0.58452

fact = [] fact.append(1) for i in range(1,100001): fact.append((i*fact[i-1])%1000000007) def power(a,b,p): x=1 y=a while(b>0): if(b%2 == 1): x=(x*y) if(x>p): x=x%p y=(y*y) if(y>p): y=y%p b=b/2 return x def inverse(N,p): return power(N,p-2,p) def combination(N,R,p): return (fact[N]*((...

0.584079

import itertools import functools import operator N = 100001 P = 10**9 + 7 fact = [1] for i in range(1, N): fact.append(fact[-1] * i % P) inv = [0, 1] for i in range(2, N): inv.append(P - P // i * inv[P % i] % P) inv_fact = [1] for i in range(1, N): inv_fact.append(inv_fact[-1] * inv[i] % P) least_div = [-1] * N...

0.582845

def three_by_n(n): A = [1, 2] + [0]*(n-1) B = [0, 1] + [0]*(n-1) C = [1, 0] + [0]*(n-1) D = [0, 1] + [0]*(n-1) for i in range(2, n+1): A[i] = A[i-2] + 2*B[i-1] + 2*C[i-1] + 2*D[i] + 2*D[i-2] B[i] = A[i-1] + B[i-2] + C[i-2] + D[i-1] C[i] = C[i-2] + 2*D[i-1] D[i] = C[i-...

0.582682

def fixed_points_perms(n, k): if k > n: return 0 if k == n: return 1 if k == 0: subf = lambda n: 1 if n == 0 else n * subf(n - 1) + (-1)**n return subf(n) return fixed_points_perms(n-1, k-1) * n // k

0.582008

import copy import sys stdin = sys.stdin ni = lambda: int(ns()) na = lambda: list(map(int, stdin.readline().split())) ns = lambda: stdin.readline().rstrip() # ignore trailing spaces L,A,B,mod = na() low = 1 high = 10 def matpow(M, v, e, mod): A = copy.deepcopy(M) w = copy.deepcopy(v) while e > 0: ...

0.580023

def main(): n, k = list(map(int, input().split())) cnt = [[[0] * 21 for _ in (0, 1)] for _ in range(n + 1)] edges, mod = [[] for _ in range(n + 1)], 1000000007 for _ in range(n - 1): u, v = list(map(int, input().split())) edges[u].append(v) edges[v].append(u) def dfs(u, f): ...

0.579555

mod = 10**9 + 7 n = int(input()) fiveFac = 120 def solve(a) : ab2 = a/2 return nC5(ab2 - 1) def nC5(k) : res = (k-4)*(k)*(k-1)*(k-2)*(k-3) res = res/120 return res if n < 13 : print(0) elif n == 13 : print(1) else : a7Max = n-12 + 1 if n%2 == 1 : ans = 0 for a7 in range(1,a7Max,2) : rest = n ...

0.576942

ans = {} def gen(n, k, d, used = False): if not ans.get((n, k, d, used)): if not n and used: ans[(n, k, d, used)] = 1 else: ans[(n, k, d, used)] = sum(gen(n - x, k, d, used or x >= d) for x in range(1, min(n, k) + 1) if max(x, n - x) >= d or used) return ans[(n, k, d, us...

0.575055

from bisect import bisect memo = {3: [3105, 7425, 30105, 31050, 37125, 42741, 44172, 71253, 72441, 74142, 74250, 74628, 74925, 82755, 85725], 4: [7128, 8712, 67128, 70416, 71208, 71280, 71328, 71928, 72108, 78912, 79128, 80712, 86712, 87120, 87132, 87192, 87912, 95832], 5: [], 6: [8316, 83160, ...

0.574927

""" #If FastIO not needed, used this and don't forget to strip #import sys, math #input = sys.stdin.readline """ import os import sys from io import BytesIO, IOBase import heapq as h from bisect import bisect_left, bisect_right from types import GeneratorType BUFSIZE = 8192 class FastIO(IOBase): newlines = 0 ...

0.574885

# cook your dish here MOD=10**9+7 for _ in range(int(input())): s=input() ind=1 level=1 for i in range(len(s)): if s[i]=='l': if level%2==1: ind=ind*2 else: ind=ind*2-1 if s[i]=='r': if level%2==1: ind=in...

0.57065

# https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/discuss/569521/7-python-approaches-with-Time-and-Space-analysis class Solution: def numWays(self, steps: int, arrLen: int) -> int: r = min(arrLen, steps // 2 + 1) dp = [0, 1] for t in range(steps): ...

0.570455

n = int(input()) u, v, f, B = 1, 1 , 1, 10**9+7 for i in range(2,n+2): u = u * i % B for i in range(2,n+n+3): f = f * i % B def inv(u): if u < 2: return 1 return (-(B // u) * inv(B % u)) % B print((f * inv(u) * inv(u) + B - 1) % B)

0.570118

# cook your dish here for _ in range(int(input())): l,n,x=map(int,input().split()) m=[] pw1 = (1 << 17); pw2 = (1 << 18); if (n == 1) : m.append(x) elif (n == 2 and x == 0) : m.append(-1) elif (n == 2) : m.append(x) m.append(0) else : ans ...

0.567746

3 import sys from functools import lru_cache MOD = 1000000007 cnk = [[1 for i in range(1001)] for j in range(1001)] for i in range(1, 1001): for j in range(1, i): cnk[i][j] = cnk[i - 1][j - 1] + cnk[i - 1][j] k = int(input()) cs = [int(input()) for i in range(k)] ans = 1 sm = 0 for c in cs: sm += ...

0.566498

mod = int(1e9 + 7) n, m = map(int, input().split()) f = [ [0 for i in range(60)] for j in range(60) ] g = [ [0 for i in range(60)] for j in range(60) ] s = [ [0 for i in range(60)] for j in range(60) ] inv = [ 1 ] f[0][0] = s[0][0] = 1 def pow(x, exp) : res = 1 for i in range(0, 31) : if exp & 1 : res ...

0.565551

import math f = math.factorial for u in range(eval(input())): n, q = list(map(int, input().split())) for j in range(q): i,k = list(map(int, input().split())) if k>i: c=0 print(c) else: a=2**(n-i) b=1 d=int(i-1) e=1 h=1 g=1 #b=f(i-1)/f(k-1)/f(i-k) if(k-1>i-k): for z in range(i-k...

0.564947

n,k, q = list(map(int, input().split())) mod = 10 ** 9 + 7 A = [0] * n a, b, c, d, e, f, r, s, t, m, x = list(map(int, input().split())) A[0] = x for x in range(1, n): if pow(t, x+1, s) <= r: A[x] = (a*pow(A[x-1], 2, m) + b*A[x-1] + c) % m else: A[x] = (d*pow(A[x-1], 2, m) + e*A[x-1] + f) % m def SRMQ(arr, ...

0.564484

for _ in range(eval(input())): n=eval(input()) mod=1000000007 f1,f2=[0]*101000,[0]*101000 f1[1]=0 f1[2]=2 f1[3]=3 f2[1]=1 f2[2]=1 f2[3]=2; for i in range(4,100001): f1[i]=f1[i-1]%mod+f1[i-2]%mod+f1[i-3]%mod f2[i]=f2[i-1]%mod+f2[i-2]%mod+f2[i-3]%mod print(f1[n]%mod,f2[n]%mod)

0.564119

# coding: utf-8 # Your code here! import sys read = sys.stdin.read readline = sys.stdin.readline n,X,Y,Z = list(map(int,read().split())) N = 1<<(X+Y+Z) NX = 1<<X NY = 1<<(X+Y) NZ = 1<<(X+Y+Z) MX = (1<<X) - 1 MY = (1<<(Y+X)) - (1<<X) MZ = (1<<(X+Y+Z)) - (1<<(Y+X)) MMX = MX<<1 MMY = MY<<1 MMZ = MZ<<1 dp = [0]*N dp[1...

0.561015

n,k=map(int,input().split()) print(k*(k-1)**(n-1))

0.559567

x, k = map(int, input().split()) if x == 0: print(0) else: mod = 10 ** 9 + 7 p = pow(2, k, mod) ans = (x * (p * 2) - (p - 1)) % mod print(ans)

0.558553

def main(): p, k = list(map(int, input().split())) s = 1 m = pow(10,9)+7 if k == 0: s = pow(p,p-1,m) elif k == 1: s = pow(p,p,m) else: o = 1 n = k while n != 1: n = k*n %p o += 1 c = (p-1)//o s = pow(p,c,m) print(s%m) main()

0.557878

# cook your dish here T=int(input()) MOD=int(1e9+7) for t in range(T): N,K=[int(a) for a in input().split()] M=K//2 # ans= ((K%2)?( (N+M)*(N+M) + M ):( (N+M)*(N+M) - M) ) ans=(N+M)*(N+M) -M if(K%2): ans+=2*M if(N==0): ans=K*(K-1) print(ans%MOD)

0.557708

d=1000000007 for _ in range(int(input())): l=sorted(list(map(int,input().split()))) ans=(l[0]%d)*((l[1]-1)%d)*((l[2]-2)%d) print(ans%d)

0.555949

def fastpow(base, power): result = 1 while power > 0: if power % 2 == 0: power = power // 2 base = base * base else: power = power - 1 result = result * base power = power // 2 base = base * base return result t=int(input()) for i in range(t): a=list(map(int,input().split())) n,r=a[0],a[1] ...

0.555495

class Solution: dp = [[1] * 10] def knightDialer(self, n: int) -> int: MOD = 10 ** 9 + 7 jump = [[4, 6], [6, 8], [7, 9], [4, 8], [3, 9, 0], [], [0, 1, 7], [2, 6], [1, 3], [2, 4]] for i in range(len(self.dp), n): new = [0] * 10 for j in range(10): n...

0.554909

import sys def fin(): return sys.stdin.readline().strip() def fout(s, end="\n"): sys.stdout.write(str(s)+end) MOD = pow(10, 9)+7 t = int(input()) while t>0: t -= 1 n, m = list(map(int, fin().split())) if n == 1: print(m%MOD) continue dp1 = m*(m-1) dp2 = m for i in range(3, n+1): temp = dp2 dp2 = dp1 d...

0.552906

def f(k,n): a = [] for i in range(0,n+1): if i < k: a += [i+1] else: a += [a[-1] + a[i//k]] return a[-1]

0.552346

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,0,1,2,2,5,6] might become [2,5,6,0,0,1,2]). You are given a target value to search. If found in the array return true, otherwise return false. Example 1: Input: nums = [2,5,6,0,0,1,2], target = 0 Output: true ...

class Solution: def search(self, nums, target): """ :type nums: List[int] :type target: int :rtype: bool """ return target in nums

0.574153

class Solution: def search(self, nums, target): """ :type nums: List[int] :type target: int :rtype: int """ # left = 0 # right = len(nums) - 1 # while left <= right: # mid = int((left + right)/2) # if nums[mid] == ta...

0.616395

class Solution: def searchInsert(self, nums, target): """ :type nums: List[int] :type target: int :rtype: int """ num=[i for i in nums if i<target] return len(num)

0.558524

class Solution: def __init__(self, nums): """ :type nums: List[int] """ self.nums = nums self.length = len(self.nums) def pick(self, target): """ :type target: int :rtype: int """ first_idx = None ...

0.518204

class Solution: def searchMatrix(self, matrix, target): """ :type matrix: List[List[int]] :type target: int :rtype: bool """ m = len(matrix) if m == 0: return False n = len(matrix[0]) if n == 0: return False ...

0.514424

class Solution: def searchMatrix(self, matrix, target): """ :type matrix: List[List[int]] :type target: int :rtype: bool """ if not matrix or target is None: return False rows, cols = len(matrix), len(matrix[0]) low, high = 0, r...

0.50955

class Solution: def searchRange(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] """ start = self.firstGreaterEqaul(nums, target) if start==len(nums) or nums[start]!=target: return [-1, -1] return...

0.509334

def rank_of_element(arr,i): return sum(x <= arr[i] if n < i else x < arr[i] for n,x in enumerate(arr))

0.499456

class Solution: def findDuplicate(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 0: return None slow = fast = nums[0] while True: slow = nums[slow] fast = nums[nums[fast]] if s...

0.488195

from bisect import bisect_left as keep_order

0.481818

from collections import defaultdict from bisect import bisect_left, bisect_right class MajorityChecker: def __init__(self, arr: List[int]): self.num_idx_dict = defaultdict(list) for idx, number in enumerate(arr): self.num_idx_dict[number].append(idx) self.candidates = sorted(se...

0.47685

class Solution: def findMin(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) <= 3: return min(nums) lo = 0 hi = len(nums) - 1 mid = (hi + lo) // 2 if nums[mid] < nums[mid-1] and nums[mid] < nums[mid+1]:...

0.474956

# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right class FindElements: def __init__(self, root: TreeNode): self.dicts = {} if root: root.val = 0 s...

0.473113

def gimme(inputArray): # Implement this function return inputArray.index(sorted(inputArray)[1])

0.470242

class Skiplist: def __init__(self): self.skip_list={} def search(self, target: int) -> bool: if(target in self.skip_list): if(self.skip_list[target]>0): return True return False def add(self, num: int) -> None: if(num in self.sk...

0.469954

class Solution: def singleNonDuplicate(self, nums): """ :type nums: List[int] :rtype: int """ return self.singleNonDuplicateUtil(nums, 0, len(nums)-1) def singleNonDuplicateUtil(self, nums, l, r): if l < r: mid = int((l + r) * 0.5) ...

0.467376

def circularly_sorted(arr): m=arr.index(min(arr)) return sorted(arr) == ( arr[m:]+arr[:m] )

0.466913

class Solution: def twoSum(self, nums, target): tmp = {} for i in range(len(nums)): if target - nums[i] in tmp: return(tmp[target - nums[i]], i) else: tmp[nums[i]] = i; """ :type nums: List[int] :type...

0.451157

class Solution: def findMin(self, nums): """ :type nums: List[int] :rtype: int """ min = nums[0] start, end = 0, len(nums) - 1 while start<end: mid = (start+end)//2 if nums[mid]>nums[end]: start = mid+1 ...

0.445674

class Solution: def canBeEqual(self, target: List[int], arr: List[int]) -> bool: return sorted(target) == sorted(arr)

0.443214

from bisect import bisect_left a = [12, 15, 35, 42, 60, 63, 66, 68, 84, 90, 95, 110, 114, 119, 140, 143, 152, 168, 189, 195, 204, 209, 216, 234, 245, 258, 264, 270, 280, 287, 290, 294, 297, 319, 322, 323, 352, 368, 377, 380, 384, 396, 470, 476, 480, 506, 510, 527, 531, 544, 552, 558, 559, 572, 588, 616, 621, 693, 702,...

0.440963

class Solution: def countSmaller(self, nums): """ :type nums: List[int] :rtype: List[int] """ s = sorted(nums) c = [] for n in nums: p = bisect.bisect_left(s, n) c.append(p) s.pop(p) return c

0.438672

class Solution: def dominantIndex(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) <= 1: return 0 m = max(nums) ind = nums.index(m) del nums[ind] m_2 = max(nums) return ind if m >= 2*m_2 else -...

0.437314

def find_the_ball(start, swaps): pos = start for (a, b) in swaps: if a == pos: pos = b elif b == pos: pos = a return pos

0.436762

class Solution: def majorityElement(self, nums): """ :type nums: List[int] :rtype: int """ n=len(nums) if n==1 : return nums[0] if n%2 : find = set(nums[0:(n//2)+1]) & set(nums[n//2:]) else: find = set(nu...

0.436182

def find_in_array(seq, predicate): for index, value in enumerate(seq): if predicate(value, index): return index return -1

0.434118

class Solution: def peakIndexInMountainArray(self, arr: List[int]) -> int: l,r = 0,len(arr)-1 while l<=r: m = (l+r)//2 if (arr[m]>=arr[m-1])and (arr[m]>=arr[m+1]): return m else: if arr[m-1]>arr[m]: r = m-1 ...

0.432922

class Solution: def findPeakElement(self, nums): """ :type nums: List[int] :rtype: int """ if not nums: return -1 start = 0 end = len(nums) -1 while start + 1 < end: mid = (start + end) // 2 if ...

0.429481

class Solution: def checkIfExist(self, arr: List[int]) -> bool: found = {} for num in arr: if num * 2 in found: return True if num % 2 == 0 and num / 2 in found: return True found[num] = True return False

0.420615

# class Solution: # def specialArray(self, nums: List[int]) -> int: # nums.sort(reverse=True) # left, right = 0, len(nums) # while left < right: # mid = left + (right - left) // 2 # if mid < nums[mid]: # left = mid + 1 # else: # ...

0.418308

class Solution: def findSpecialInteger(self, arr: List[int]) -> int: count = 0 num = arr[0] for x in arr: if x == num: count = count+ 1 elif x != num and ((count / len(arr))>0.25): return num else: num = x ...

0.415189

def solve(count, ball_number): """ Return the position of the `ball_number` after the game with `count` balls :param count: Number of balls :type count: int :param ball_number: Number of ball to be found in the end :type ball_number: int :return: Return the index of the ball `ball_number` a...

0.414786

class Solution: def pivotIndex(self, nums): """ :type nums: List[int] :rtype: int """ left, right = 0, sum(nums) for index, num in enumerate(nums): right -= num if left == right: return index left += num ...

0.413448

def find_dup(arr): return sum(arr) - sum(range(1, max(arr)+1))

0.411117

class Solution: def containsNearbyDuplicate(self, nums, k): """ :type nums: List[int] :type k: int :rtype: bool """ s=set(nums) if len(s)==len(nums):return False d=dict() for num in nums: d[num]=d.get(num,0)+1 fo...

0.410436

def length_of_sequence(arr, n): if arr.count(n) != 2: return 0 a = arr.index(n) b = arr.index(n, a + 1) return b - a + 1

0.410164

class Solution: def isIdealPermutation(self, A): """ :type A: List[int] :rtype: bool """ # tle # for i in range(len(A)-2): # if A[i] > min(A[i+2:]): # return False # return True # ac for...

0.410031

def robot_walk(a): i=3 while(i<len(a) and a[i] < a[i-2]): i+=1 return i<len(a)

0.408217

def elevator(left, right, call): return "left" if abs(call - left) < abs(call - right) else "right"

0.407452

def find_dup(arr): return sum(arr) - len(arr)*(len(arr)-1)/2 #your code here

0.407294

class Solution: def maxNonOverlapping(self, nums: List[int], target: int) -> int: sum_set = set() sum_set.add(0) temp = 0 count = 0 for num in nums: temp += num if temp - target in sum_set: count += 1 sum_set.clear() ...

0.405826

def sort_by_bit(arr): return sorted(arr, key=lambda x: (bin(x).count("1"), x))

0.405575

class Solution: def findUnsortedSubarray(self, nums): """ :type nums: List[int] :rtype: int """ left = 1 size = len(nums) if size == 0: return 0 while left < size and nums[left - 1] <= nums[left]: left += 1 i...

0.403582

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def splitBST(self, root,target): """ :type root: TreeNode :type V: int :rtype: List[TreeNode]...

0.403352

class Solution: def getKth(self, lo: int, hi: int, k: int) -> int: return sorted(range(lo, hi + 1), key='寒寒寓寙寔寗寚寢寕寥寘寠寛寛寣寣寖寞實實寙寙寡寡寜審寜屁寤寤寤尼寗寬察察寧寧寧寴寚尿寚寯寢寢寢尺寝寪寪寪寝寝层层寥寲寥寲寥寥尽尽寘寭寭寭寠寠寠尸寨居寨寠寨寨寵寵寛寨局局寛寛寰寰寣寰寣尮寣寣尻尻寞屈寫寫寫寫寫尩寞寸寞尶屃屃屃尗實寞寳寳實實寳寳實就實尀尾尾尾尀寙屋寮寮寮寮寮寻寡尬寡寻寡寡尹尹審屆屆屆審審寡寡審寶審尧寶寶寶專寜尴審審屁屁屁尕寜尃寜屎寱寱寱尢寤寱寱寱寤寤尯尯寤対寤対尼尼尼対察屉屉屉寬寬寬屉寬寤寬...

0.402183

def count_targets(n, sequence): return sum(a == b for a, b in zip(sequence, sequence[n:]))

0.401107

def is_centered(arr,n): l = int(len(arr)/2) if len(arr)%2==0 else int((len(arr)-1)/2) return any(sum(arr[i:-i])==n for i in range(1, l+1)) or sum(arr)==n

0.400942

def duplicates(arr): return sum(arr.count(i)//2 for i in set(arr))

0.399783

import random class RandomizedCollection: def __init__(self): """ Initialize your data structure here. """ self.val = [] self.idx = {} def insert(self, val): """ Inserts a value to the collection. Returns true if the collection did not alread...

0.399429

def find_array(arr1, arr2): return [ arr1[i] for i in arr2 if i< len(arr1) ]

0.398677

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ res = 0 temp = sorted(arr) sum1, sum2 = 0, 0 for i in range(0,len(arr)): sum1 += arr[i] sum2 += temp[i] if(sum1 =...

0.396678

def is_inertial(arr): mx = max(arr, default=1) miO = min((x for x in arr if x%2==1), default=float("-inf")) miE2 = max((x for x in arr if x%2==0 and x!=mx), default=float("-inf")) return mx%2 == 0 and miE2 < miO

0.39627

def find_all(array, n): return [index for index, item in enumerate(array) if item == n]

0.396082

class Solution: def missingNumber(self, nums): """ :type nums: List[int] :rtype: int """ if 0 not in nums: return 0 array=sorted(nums) for i in range(len(array)): try: dif=array[i+1]-array[i] ...

0.394991

def can_jump(arr): if arr[0] == 0 or len(arr) == 1: return False if arr[0] >= len(arr): return True for jump in range(1, arr[0] +1): if can_jump(arr[jump:]): return True return False

0.393404

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def getTargetCopy(self, original: TreeNode, cloned: TreeNode, target: TreeNode) -> TreeNode: def getnode(root): if no...

0.392715

class Solution: def minMoves2(self, nums): """ :type nums: List[int] :rtype: int """ aa = sorted(nums) median = aa[len(nums)//2] return sum([abs(i-median) for i in aa])

0.390111

def array_previous_less(arr): return [next((y for y in arr[:i][::-1] if y < x),-1) for i,x in enumerate(arr)]

0.388962

class Solution: def containsNearbyAlmostDuplicate(self, nums, k, t): """ :type nums: List[int] :type k: int :type t: int :rtype: bool """ if len(nums) < 2 or k <= 0 or t < 0: return False if t == 0: visited = set() fo...

0.388483

def two_sum(nums, t): for i, x in enumerate(nums): for j, y in enumerate(nums): if i != j and x + y == t: return [i, j]

0.388099

def count_inversions(array): inv_count = 0 for i in range(len(array)): for j in range(i, len(array)): if array[i] > array[j]: inv_count += 1 return inv_count

0.387275

class Solution: def containsDuplicate(self, nums): """ :type nums: List[int] :rtype: bool """ num_set = set(nums) if len(nums) == len(num_set): return False return True

0.387059

class Solution: def majorityElement(self, nums): """ :type nums: List[int] :rtype: int """ if nums == []: return [] dct = {} for el in nums: if el in dct: dct[el] += 1 else: ...

0.386255

class Solution: def singleNumber(self, nums): """ :type nums: List[int] :rtype: int """ l = len(nums) if l == 1: return nums[0] # Attempt 1 - 80% # nums.sort() # i = 0 # while i < l: # if i...

0.385809

def find_it(seq): for i in seq: if seq.count(i)%2!=0: return i

0.385662

import random class RandomizedSet: def __init__(self): """ Initialize your data structure here. """ self.dict = {} self.list = [] def insert(self, val): """ Inserts a value to the set. Returns true if the set did not alrea...

0.38512

class Solution: def canReorderDoubled(self, A: List[int]) -> bool: cache=Counter(A) c_list=sorted(list(cache),key=abs) for x in c_list: if cache[x]>cache[2*x]: return False cache[2*x]-=cache[x] return True

0.384958

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ cnt, sm, ism = 0, 0, 0 for i, num in enumerate(arr): sm += num ism += i if sm == ism: cnt += 1 return cnt

0.382264

def comp(array1, array2): try: return sorted([i ** 2 for i in array1]) == sorted(array2) except: return False

0.382133

def dominator(arr): for x in set(arr): if arr.count(x) > len(arr)/2.0: return x return -1

0.381876

class Solution: def repeatedNTimes(self, A: List[int]) -> int: dict_ = dict() for a in A: if a in dict_: return a else: dict_[a] = 1

0.381548

def locate(seq, value): for s in seq: if s == value or (isinstance(s,list) and locate(s, value)): return True return False

0.380979

from functools import reduce def cup_and_balls(b, arr): return reduce(lambda x, y: y[1] if x == y[0] else y[0] if x == y[1] else x, arr, b)

0.380837

def bs(arr, val, key=lambda x:x): l, r = 0, len(arr)-1 if key(arr[l])>val: return l if key(arr[r])<=val: return r+1 while l+1<r: m = (l+r)>>1 v = key(arr[m]) if v<=val: l = m else: r = m return r def bs_left(arr,...

0.379875

def sort_array(xs): es = sorted(x for x in xs if x % 2 == 0) os = sorted((x for x in xs if x % 2 != 0), reverse=True) return [(es if x % 2 == 0 else os).pop() for x in xs]

0.379522

def example_sort(arr, example_arr): return sorted(arr, key=example_arr.index)

0.378678

class Solution: def find132pattern(self, nums): """ :type nums: List[int] :rtype: bool if len(nums) < 3: return False stack = [[nums[0], nums[0]]] minimum = nums[0] for num in nums[1:]: if num <= minimum: ...

0.378113

class Solution: def checkPossibility(self, nums): """ :type nums: List[int] :rtype: bool """ possibility_flag = False for i in range(1, len(nums)): if nums[i] < nums[i-1]: if possibility_flag: return False ...

0.377793

class Solution: def findLengthOfShortestSubarray(self, arr: List[int]) -> int: n = len(arr) if n<=1: return 0 l,r = n,-1 for i in range(1,n): if arr[i]<arr[i-1]: l = i break # monotonicially increasing ...

0.376249

def artificial_rain(garden): left,area,record = 0,0,1 for i in range(1,len(garden)): if garden[i] < garden[i-1]: left = i elif garden[i] > garden[i-1]: area = max(area,record) record = i - left record += 1 return max(area,record)

0.375964

def find_even_index(arr): for i in range(len(arr)): if sum(arr[:i]) == sum(arr[i+1:]): return i return -1

0.375638

class Solution: MODS = 10 ** 9 + 7 def numSubseq(self, nums: List[int], target: int) -> int: N = len(nums) cal_map = [1] for ii in range(1, N): cal_map.append(cal_map[-1] * 2 % self.MODS) left, right, res = 0, N - 1, 0 nums.sort() while left < N: ...

0.375628

def smaller(arr): # Good Luck! return [len([a for a in arr[i:] if a < arr[i]]) for i in range(0, len(arr))]

0.375342

def array_manip(array): return [min([a for a in array[i+1:] if a > array[i]], default=-1) for i in range(len(array))]

0.374921

def peak(arr): for i, val in enumerate(arr): if sum(arr[:i]) == sum(arr[i+1:]): return i return -1

0.37461

def match_arrays(v, r): return sum(x in r for x in v) # DON'T remove verbose = False # set to True to diplay arrays being tested in the random tests

0.37413

class Solution(object): def hIndex(self, citations): """ :type citations: List[int] :rtype: int """ n = len(citations) l = 0 r = n-1 while l <= r: m = (l + r) // 2 if m == 0 and citations[m] >= n - m or citations[m-1...

0.37225

def almost_increasing_sequence(sequence): save, first = -float('inf'), True for i,x in enumerate(sequence): if x > save: save = x elif first: if i == 1 or x > sequence[i-2]: save = x first = False else: return False return True

0.371431

class Solution: def findLatestStep(self, arr: List[int], m: int) -> int: A = arr if m == len(A): return m length = [0] * (len(A) + 2) res = -1 for i, a in enumerate(A): left, right = length[a - 1], length[a + 1] if left == m or right == m:...

0.370958

def count_inversion(nums): return sum(a > b for i, a in enumerate(nums) for b in nums[i + 1:])

0.370672

def shifted_diff(first, second): return (second + second).find(first) if len(first) == len(second) else - 1;

0.370636

class Solution: def nextGreatestLetter(self, letters, target): """ :type letters: List[str] :type target: str :rtype: str """ if ord(letters[-1]) <= ord(target): return letters[0] li = 0 ri = len(letters) - 1 ...

0.370327

def nth_smallest(arr, pos): return sorted(arr)[pos-1] # Gotta love Python

0.370197

def find_outlier(int): odds = [x for x in int if x%2!=0] evens= [x for x in int if x%2==0] return odds[0] if len(odds)<len(evens) else evens[0]

0.369094

def solution(nums): return sorted(nums) if nums else []

0.368689

class Node(object): def __init__(self, data, nxt = None): self.data = data self.next = nxt def sorted_insert(head, data): if not head or data < head.data: return Node(data, head) else: head.next = sorted_insert(head.next, data) return head

0.368224

class Solution: def lengthOfLIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 0: return 0 res = [nums[0]] def binarySearch(l,target): left , right = 0 , len(l)-1 while left < right: ...

0.367798

def amidakuji(ar): numbers = list(range(len(ar[0])+1)) for line in ar: for i, swap in enumerate(line): if swap == '1': numbers[i], numbers[i+1] = numbers[i+1], numbers[i] return numbers

0.367369

from collections import Counter def majority(arr): mc = Counter(arr).most_common(2) if arr and (len(mc) == 1 or mc[0][1] != mc[1][1]): return mc[0][0]

0.367194

def find_uniq(arr): a, b = set(arr) return a if arr.count(a) == 1 else b

0.366931

def count(a, t, x): return sum(not (t-v)%x if x else t==v for v in a)

0.366895

Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array. Example1: a = 2 b = [3] Result: 8 Example2: a = 2 b = [1,0] Result: 1024 Credits:Special thanks to @Stomach_ache for adding this problem and creating all test cases...

class Solution: def superPow(self, a, b): result = 1 fermatb = (int(''.join(map(str, b)))) % 570 while fermatb: if fermatb & 1: result = (result * a) % 1337 a = (a * a) % 1337 fermatb >>= 1 return result

0.713453

mod = 12345787 mat = [([1,1],[0,1,3]), ([2,1,-1],[0,2,6,11]), ([2,3,-1,-1],[0,2,10,23,70]), ([3,3,-4,-1,1],[0,3,15,42,155,533]), ([3,6,-4,-5,1,1],[0,3,21,69,301,1223,5103])] for i in range(100): [m.append(sum(k*m[-1-i] for i,k in enumerate(c))%mod) for c,m in mat] def circular_limited_sums...

0.656099

import copy import sys stdin = sys.stdin ni = lambda: int(ns()) na = lambda: list(map(int, stdin.readline().split())) ns = lambda: stdin.readline().rstrip() # ignore trailing spaces L,A,B,mod = na() low = 1 high = 10 def matpow(M, v, e, mod): A = copy.deepcopy(M) w = copy.deepcopy(v) while e > 0: ...

0.643671

from functools import reduce from gmpy2 import comb from operator import xor def transform(a, x): return reduce(xor, (comb(n + 1, x + 1) for n in a))

0.595522

def power_mod(b, e, m): res, b = 1, b % m while e > 0: if e & 1: res = res * b % m e >>= 1 b = b * b % m return res

0.591207

def find(a,b,n): strng = str(a) + str(b) #there are 10 and 4 long loops if (n > 20): n = n%20+20 while len(strng) <= n: next_ch = int(strng[-1]) + int(strng[-2]) strng = strng + str(next_ch) return int(strng[n])

0.588116

(N), *D = [list(map(int, s.split())) for s in open(0)] V = D[0] A = V.pop(N[0]-1) M = 1000000000 + 7 R=0 for value in reversed(V): R = R + ((A) * value) % M A = A + value print(R % M)

0.586902

p = 10 ** 9 + 7 n, b, k, x = [int(s) for s in input().split()] block = [int(s) for s in input().split()] D = [0 for i in range(10)] for s in block: D[s] += 1 A = [[0 for t in range(x)]] pows = [pow(10, 1<<j, x) for j in range(b.bit_length())] for i in range(10): A[0][i%x] += D[i] for j in range(b.bit_length()-1...

0.5765

def treeProduct(num, h, root, ch): if ch >= h: return num[root] left = (root * 2) + 1 right = (root * 2) + 2 ret1 = treeProduct(num, h, left, ch + 1) ret2 = treeProduct(num, h, right, ch + 1) return num[root] * max(ret1, ret2) def main(): n = int(input()) while n!=0: line = str(input()) s = line.split...

0.576068

# https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/discuss/569521/7-python-approaches-with-Time-and-Space-analysis class Solution: def numWays(self, steps: int, arrLen: int) -> int: r = min(arrLen, steps // 2 + 1) dp = [0, 1] for t in range(steps): ...

0.574515

s=input() n=len(s) a=[] curr=0 for i in range(n): if s[i]=="a": curr+=1 elif s[i]=="b": a.append(curr) curr=0 if curr>0: a.append(curr) prod=1 for i in range(len(a)): prod*=(a[i]+1) prod=prod%1000000007 print(prod-1)

0.573078

def slide_min(tl,ql,val): res=[0]*(tl-ql+1) q=[0]*tl s=0 t=0 for i in range(0,tl): while s<t and val[q[t-1]]>=val[i]: t-=1 q[t]=i t+=1 if (i-ql+1)>=0: res[i-ql+1]=val[q[s]] if q[s]==(i-ql+1): s+=1 return res def slide_min2(tl,ql,val): res=0 q=[0]*tl s=0 t...

0.570652

0.565067

import sys mod = 10**9 + 7 for _ in range(int(input())): x = int(input()) s = list(map(int, input())) ans = len(s) for i in range(1, x+1): ans = (i + (ans-i) * s[i-1]) % mod r = len(s) for _ in range(s[i-1]-1): if len(s) < x: s += s[i:r] e...

0.562913

def __starting_point(): a=[int(x) for x in input().split()] N=a[0] A=a[1] B=a[2] K=a[3] s=input() mod = 1000000009 Q = pow(B*pow(A,mod-2,mod)%mod,K,mod) if Q!=1: D = (pow(Q,(N+1)//K,mod)-1)*pow(Q-1,mod-2,mod)%mod else: D = (N+1)//K ans=0 C = pow(A,N,mod) A=pow(A,mod-2,mod) for i in range(K): if s[i]...

0.562591

N=int(input()) M=len(input()) O=10**9+7 D=[pow(-~O//2,M,O)]+[0]*N for _ in'_'*N:D=[D[0]+D[1]]+[(i+2*j)%O for i,j in zip(D[2:]+[0],D[:-1])] print(D[M])

0.556527

a,b,mod = list(map(int, input().split())) g = [2] * a for i in range(b): t = input() for x, y in enumerate(t): if y == '1': g[x] -= 1 one = two = 0 for q in g: if q < 0: print(0) return if q == 1: one+=1 if q == 2: two+=1 mat = [[0]*600 for...

0.55493

a, b, n, x = list(map(int, input().split(' '))) fir = pow(a, n, 10**9+7)*x%(10**9+7) sec = b*(pow(a, n, 10**9+7)-1)*(pow(a-1, 10**9+5, 10**9+7))%(10**9+7) if (a == 1): sec = n * b print((fir+sec)%(10**9+7))

0.554766

n=int(input()) a=list(map(int,input().split())) q=int(input()) while q>0: i=1 tot=a[0] b=list(map(int,input().split())) if b[0]==1: #p,f=map(int,raw_input().split()) a[b[1]-1]=b[2] else: #r=int(raw_input()) tot=a[0] while 1+i*b[1]<=n: tot=tot*a[i*b[1]] i=i+1 m=(str)(tot) tot=tot%1000000007 pr...

0.552078

a = int(input()) c = list(map(int,input().split())) summ = 0 for i in range(a): k = 0 k1 = 0 s = str(c[i]) for x in s: k = k * 100 + int(x) k1 = k * 10 summ += (k + k1) * a summ %= 998244353 print(summ)

0.551419

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline # so the ending sequence is b...ba...a # find length of ending sequence extra=0 need=0 for ch in input().strip(): if ch=='a': need=(need*2+1)%1000000007 else: extra=(extra+need)%1000000007 print(extra)

0.551338

# Enter your code here. Read input from STDIN. Print output to STDOUT a=int(input()) b=int(input()) c=int(input()) print((pow(a,b))) print((pow(a,b,c)))

0.547966

#!/usr/bin/env python3 def addmod(left, right, modulo=1000000007): res = left + right if res >= modulo: res -= modulo return res def counter(a, m, d): res = [0, ] * (2*m) res[0] = 1 shift = 1 for pos in range(len(a), 0, -1): ptype = pos & 1 cur = int(a[pos-1]) ...

0.547466

from functools import reduce from operator import mul def insane_inc_or_dec(x): return (reduce(mul,[x + i + i * (i == 10) for i in range(1, 11)]) // 3628800 - 10 * x - 2) % 12345787

0.546503

def three_by_n(n): A = [1, 2] + [0]*(n-1) B = [0, 1] + [0]*(n-1) C = [1, 0] + [0]*(n-1) D = [0, 1] + [0]*(n-1) for i in range(2, n+1): A[i] = A[i-2] + 2*B[i-1] + 2*C[i-1] + 2*D[i] + 2*D[i-2] B[i] = A[i-1] + B[i-2] + C[i-2] + D[i-1] C[i] = C[i-2] + 2*D[i-1] D[i] = C[i-...

0.545942

class Solution: def getSum(self, a, b): max = 0x7FFFFFFF mask = 0xFFFFFFFF while b != 0: a, b = (a ^ b) & mask, ((a & b) << 1) & mask return a if a <= max else ~(a ^ mask)

0.545776

n,m,a=map(int,input().split()) b=list(map(int,input().split())) for i in range(m): if i==0: diffs=[b[0]] else: diffs.append(b[i]-b[i-1]) powers=[a%998244353] for i in range(30): powers.append(powers[-1]**2%998244353) def power(x,y,binpowers): prod=1 bits=bin(y)[2:] bits=bits[::-1...

0.545482

from math import log2, ceil MOD = int(1e9 + 7) srt = lambda s: ''.join(sorted(s)) for _ in range(int(input())): s = srt(input()) res = -1 for p in range(ceil(log2(int(s))), int(log2(int(s[::-1]))) + 1): if int(srt(str(pow(2, p)))) == int(s): if res == -1: res = 0 res...

0.545018

def main(): n, m, b, mod = list(map(int, input().split())) row_zero = [1] + [0] * b b += 1 dp = [[0] * b for _ in range(m)] for a in list(map(int, input().split())): cur = row_zero for nxt in dp: for i, u in zip(list(range(a, b)), cur): nxt[i] = (nxt[i] + ...

0.543542

from sys import stdin, stdout, exit mod = 998244353 n = int(stdin.readline()) a = list(map(int, stdin.readline().split())) ans = 0 def l(x): if x == 0: return 0 return 1 + l(x//10) lens = [0]*15 for x in a: lens[l(x)] += 1 def space_out(x, l): ans = [] for i,c in enumerate(reversed(str...

0.543206

n = int(input()) print(pow(1378, n, 10))

0.54205

def last_digit(n1, n2): return pow( n1, n2, 10 )

0.539833

def array_conversion(arr): sign = 0 while len(arr) > 1: sign = 1^sign arr = list(map(lambda x, y: x+y, arr[0::2],arr[1::2]) if sign else map(lambda x, y: x*y, arr[0::2],arr[1::2])) return arr[0]

0.537851

M = 0x3b800001 wa = 0; n = int(input()) a = list(map(int, input().split())) now = 1 wa += a[-1] for i in range(n - 1)[::-1]: wa += (now * (n - i - 1) + now * 2) * a[i] wa %= M now *= 2 now %= M print(wa % M)

0.53674

t=int(input()) while t>0 : a=int(input()) b=int(input()) l=int(input()) x=0 y=0 z=0 a1=0 b1=0 c1=0 while(a//10!=0 or a%10!=0): a1+=(a%10+((a//10)%10)*7+((a//100)%10)*49+((a//1000)%10)*343+((a//10000)%10)*2401+((a//100000)%10)*16807+((a//1000000)%10)*117649+((a//10000000)%10)*823543+((a//100000000)%10)*57648...

0.535278

import math def egcd(a, b): if a == 0: return (b, 0, 1) else: g, y, x = egcd(b % a, a) return (g, x - (b // a) * y, y) def modin(a, m): g, x, y = egcd(a, m) return x % m # def gcdexten(a,b,x,y): # if a == 0: # x = 0 # y = 1 # return b # x1 = y1 = 0 # gcd = gcdexten(b%a,...

0.534714

mod=10**9+7 def pow2(x): p,n=1,2 while(x): if(x & 1): p=((p%mod) * (n%mod))%mod n=((n%mod) * (n%mod))%mod x//=2 return p def count_bit(val): bit=0 while(val): bit+=1 val &=(val-1) return bit def answer(): val=b[0] po2=0 for i in range(1,len(b)): if(val > b[i]):return 0 po2+=count_bit(val ...

0.533828

M = 10 ** 9 + 7 for _ in range(int(input())): s,p,m,r = list(map(int, input())),0,1,0 for d in reversed(s): p += d * m m = m * 10 % M for d in s: r = (r * m + p) % M p = (p * 10 - (m - 1) * d) % M print(r)

0.531565

a = [1] M = 10**6 + 3 for ii in range(1, 1000005): a.append((a[-1]*ii)%M) for __ in range(eval(input())): n, x = list(map(int, input().split())) if n>=M: print(0) else: print((a[n]*x)%M)

0.531047

# coding: utf-8 # Your code here! import sys read = sys.stdin.read readline = sys.stdin.readline n,X,Y,Z = list(map(int,read().split())) N = 1<<(X+Y+Z) NX = 1<<X NY = 1<<(X+Y) NZ = 1<<(X+Y+Z) MX = (1<<X) - 1 MY = (1<<(Y+X)) - (1<<X) MZ = (1<<(X+Y+Z)) - (1<<(Y+X)) MMX = MX<<1 MMY = MY<<1 MMZ = MZ<<1 dp = [0]*N dp[1...

0.530183

MOD = int(1e9+7) def mult(a, b): rsp = [[0, 0, 0], [0, 0, 0], [0, 0, 0]] for i in range(3): for j in range(3): for k in range(3): rsp[i][j] += a[i][k] * b[k][j] rsp[i][j] %= MOD return rsp ident = [[1, 0, 0], [0, 1, 0], [0, 0, 1]] m = [[1, 1, 0], [1, 0, 1], [1, 0, 0]] powers = [m] f...

0.529521

P,a,I=998244353,1,input n=int(I()) d=list(map(int,I().split())) s=sum(d)%P for i in d:a=a*i%P for i in range(n,2*n-2):a=a*(s-i)%P print(a)

0.527679

from operator import mul from functools import reduce def cmb(n, r, p): if (r < 0) or (n < r): return 0 r = min(r, n - r) return fact[n] * factinv[r] * factinv[n-r] % p p = 10 ** 9 + 7 N = 10 ** 6 fact = [1, 1] # fact[n] = (n! mod p) factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p) inv ...

0.527311

def abacaba(k): return next(chr(97+i) for i,d in enumerate(f'{k:b}'[::-1]) if d=='1')

0.526902

class Solution: def NOD(self, a, b): if a == b: return a c = max(a,b) d = a + b - c c = c%d c = c if c>0 else d return self.NOD(c,d) def nthMagicalNumber(self, N: int, A: int, B: int) -> int: const = 10**9 + 7 nod = self.NOD(A, B) ...

0.52509

vow = ['a', 'e', 'i','o', 'u'] for _ in range(int(input())): name = str(input()) tmp = '' for i in range(len(name)): if name[i] not in vow and name[i].isalpha(): tmp+='1' elif name[i] in vow and name[i].isalpha(): tmp+='0' print( int(tmp, 2)% (10**9 + 7))

0.524907

from math import factorial from string import digits, ascii_uppercase DIGITS = digits + ascii_uppercase FACTORIALS = [1, 1] f = 1 for i in range(2, 36): f *= i FACTORIALS.append(f) def dec2FactString(nb): ret = [] for f in reversed(FACTORIALS): (d, nb) = divmod(nb, f) if d or ret: ...

0.524645

# cook your dish here try: X=int(input()) m=1000000007 a=X+X**(2)+X**(3) a=a%m print(a) except: pass

0.524321

for _ in range(int(input())): string = input().rstrip() start=(ord(string[0])-96)*100 sum=0 #print(start) for i in range(len(string)): sum+=start+(ord(string[i])-97) print(sum%1000000007)

0.524103

class Solution: def sumSubseqWidths(self, A: List[int]) -> int: A.sort() ret, mod, p = 0, 10 ** 9 + 7, 1 for i in range(len(A)): ret += (A[i] - A[len(A) - i - 1]) * p % mod p = (p << 1) % mod return ret % mod

0.523491

def russian_peasant_multiplication(x, y): product = 0 while y != 0: if y % 2 == 1: product += x x += x y //= 2 return product

0.523395

for _ in range(int(input())): num=int(input()) arr=list(map(int,input().split())) dp=[0]*num dp[0]=1 ans=1 j=0 for i in range(1,num): j=i+1 count=1 dp[i]=dp[i-1]%1000000007 if i-2>=0 and arr[i-2]==2: dp[i]+=dp[i-2]%1000000007 if i-3>=0 and arr[i-3]==2: dp[i]+=dp[i-3] ans+=dp[i]...

0.523264

P = 998244353 N, M = list(map(int, input().split())) A = [int(a) for a in input().split()] B = [int(a) for a in input().split()] li = sum([A[i]*B[i] for i in range(N)]) di = sum([(A[i]^1)*B[i] for i in range(N)]) X = [[] for _ in range(M+1)] X[0] = [1] def calc(L): su = sum(L) pl = 0 pd = 0 RE = [] ...

0.522702

def main(): f= [1] for i in range(1,1000002): f.append((f[-1] * i)%1000000007) n = int(input()) a = sorted(int(x) for x in input().split()) sol = 0 j = 0 s = 1 sq = 1 for i in range(n - 1): sq = sq * (n - i) % 1000000007 if a[i] != a[i + 1]: ...

0.521105

for _ in range(int(input())): n=int(input()) n1=0 ans=1 while(n>0): d=int(n % 10) if(d!=0): if(d!=9 and d!=7 and d!=1): n1=3 elif(d==1): n1=1 else: n1=4 ans=(int(ans)*int(n1))% (1000000007) n/=10 else: n/=10 if(ans==1): print("0") else: print(ans %(1000000007))

0.520231

class Solution: def numFactoredBinaryTrees(self, A: List[int]) -> int: mod = 10**9 + 7 nums_set = set(A) nums = A.copy() nums.sort() counts = {} total = 0 for n in nums: n_count = 1 for d in nums: if d * d > n...

0.518989

l = {j:i for i,j in enumerate('0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz')} l_ = dict(enumerate('0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz')) is_polydivisible = lambda n, base:next((0 for i in range(1, len(n) + 1) if get_base(n[:i], base) % i),1) get_base = lambda n, base:sum(...

0.518834

mod = 998244353 f0 = [ [0 for i in range(11)] for j in range(2010) ] f1 = [ [0 for i in range(11)] for j in range(2010) ] fac = [0 for i in range(2010)] tab = [0 for i in range(11)] C = [ [0 for i in range(2010)] for j in range(2010) ] def Init() : fac[0] = 1 for i in range(2010) : if i > 0 : fac[i] = ...

0.518517

import sys input = sys.stdin.readline sys.setrecursionlimit(10 ** 7) import numpy as np import itertools P = int(input()) A = [int(x) for x in input().split()] # k,i -> i^k power = np.ones((P,P),dtype = np.int64) for k in range(1,P): power[k] = power[k-1] * np.arange(P,dtype=np.int64) % P f = np.zeros(P,dtype=n...

0.51815

import math n, k = [int(x) for x in input().split()] a = [int(x) for x in input().split()] b = [int(x) for x in input().split()] c = 1 for i in range(n // k): count = (10 ** k - 1) // a[i] + 1 mmin = b[i] * (10 ** (k-1)) mmax = (b[i] + 1) * (10 ** (k-1)) - 1 mcount = mmax // a[i] - math.ceil(mmin / a...

0.517908

def dig_pow(n, p): s = 0 for i,c in enumerate(str(n)): s += pow(int(c),p+i) return s/n if s%n==0 else -1

0.517589

# -*- coding: utf-8 -*- def solve(): mod = 10**9 + 7 n, m = map(int, input().split()) p = input() if m == 0: return powmod(n) delta = len(p) - 1 ys = map(int, input().split()) answer = 1 tail = 0 for y in ys: if y > tail: answer *= powmod(y - tail - 1) ...

0.517259

T=int(input()) t=[] for _ in range(T): N=int(input()) t.append(N) N=max(t)+1 l=[0 for i in range(N)] p=1 a=1 for i in range(1,N): a=(a*i)%1000000007 p=p*a%1000000007 l[i]=p for i in t: print(l[i])

0.516922

import fractions import sys f = sys.stdin if len(sys.argv) > 1: f = open(sys.argv[1], "rt") sum_cache = {} def sum_func(x): if x < 10: return x r = sum_cache.get(x) if r is not None: return r xx = 0 while x > 0: xx += x % 10 x /= 10 r = sum_func(xx) ...

0.516744

P = 998244353 N, M = list(map(int, input().split())) A = [int(a) for a in input().split()] B = [int(a) for a in input().split()] li = sum([A[i]*B[i] for i in range(N)]) di = sum([(A[i]^1)*B[i] for i in range(N)]) X = [1] SU = li+di PO = [0] * (5*M+10) for i in range(-M-5, 2*M+5): PO[i] = pow((SU+i)%P, P-2, P) def ...

0.516661

t=[[1]] def bell_numbers(start, stop): ## Swap start and stop if start > stop if stop < start: start, stop = stop, start if start < 1: start = 1 if stop < 1: stop = 1 c = 1 ## Bell numbers count while c <= stop: if c >= start: yield t[-1][0] ## Yield the Bell number of the previous row row ...

0.516584

def binary_string_to_int(string): return sum((d == '1') * 2**i for i, d in enumerate(string[::-1])) def add(a, b): return '{:b}'.format(binary_string_to_int(a) + binary_string_to_int(b))

0.516056

class Solution: def dieSimulator(self, n: int, rollMax: List[int]) -> int: a,b,m=[deque([0]*x) for x in rollMax],[1]*6,1000000007 for x in a: x[-1]=1 for _ in range(n-1): s=sum(b)%m for i,x in enumerate(a): x.append((s-b[i])%m) b[i]=(b[...

0.515972

import numpy as np def five_by_2n(n): x=np.array([[1,1,1,1,1,1,1,1],[1,2,1,1,1,2,2,1],[1,1,2,1,1,1,2,1],[1,1,1,2,1,1,2,1],[1,1,1,1,2,1,2,2],[1,2,1,1,2,1,6,1],[1,2,1,1,2,1,6,1],[1,2,1,1,2,1,6,1]]) y=np.array([1,1,1,1,1,1,1,1]) z=y for i in range(n-1): z=np.mod(x@z,12345787*y) return z.T@y%123...

0.514692

# from math import copysign def sequence_sum(a, b, step): n = (b-a)//step return 0 if n<0 else (n+1)*(n*step+a+a)//2

0.514538

import sys from collections import defaultdict from copy import copy MOD = 10**9 + 7 R = lambda t = int: t(input()) RL = lambda t = int: [t(x) for x in input().split()] RLL = lambda n, t = int: [RL(t) for _ in range(n)] # primes up to n def primes(n): P = [] n = int(n) U = [1] * (n+1) p = 2 ...

0.514483

from collections import defaultdict, deque, Counter from heapq import heappush, heappop, heapify import math import bisect import random from itertools import permutations, accumulate, combinations, product import sys import string from bisect import bisect_left, bisect_right from math import factorial, ceil, floor fro...

0.513009

def two_by_n(n, k): vv, vh, hv, hh = k-1, (k-1)*(k-2), k-2, (k-1)*(k-2) + 1 va, ha, vb, hb = 0, 0, 1, 1 for i in range(n - 1): va, ha, vb, hb = vb, hb, vv*vb + vh*ha, hv*vb + hh*ha return (k * vb + k*(k-1) * ha) % 12345787

0.512676

from heapq import * def n_linear(ms, n): lst = [1] * (n+1) q = [(1+v,v,1) for v in ms] heapify(q) for i in range(1,n+1): v,x,j = heappop(q) lst[i] = v heappush(q, (lst[j]*x+1, x, j+1) ) while q[0][0]==lst[i]: v,x,j = heappop(q) heappush(q, (lst...

0.511574

def solve(nums,div): return [x + x % div for x in nums]

0.511494

def find_unknown_number(x,y,z): return (x*70 + y*21 + z*15) % 105 or 105

0.511468

ans = 0 mod = 1000000007 a, b, n = list(map(int, input().split())) s = set() for x in range(2, 1 << 8): z = 0 while x > 1: z = z * 10 + (a, b)[x & 1] x >>= 1 s.add(z) f = [1] * (n + 1) for i in range(1, n + 1): f[i] = f[i - 1] * i % mod for x in range(n + 1): if x * a + (n - x) * b i...

0.511376

#q = int(input()) #x, y = map(int,input().split(' ')) #print (' '.join(list(map(str, s)))) def extended_gcd(aa, bb): lastremainder, remainder = abs(aa), abs(bb) x, lastx, y, lasty = 0, 1, 1, 0 while remainder: lastremainder, (quotient, remainder) = remainder, divmod(lastremainder, remainder) ...

0.509172

array = [1, 10, 9, 12, 3, 4] def thirt(n): total = sum([int(c) * array[i % 6] for i, c in enumerate(reversed(str(n)))]) if n == total: return total return thirt(total)

0.508976

class Solution: def multiply(self,num1, num2): """ :type num1: str :type num2: str :rtype: str """ a=['0','1','2','3','4','5','6','7','8','9'] z=0 x=0 for i,element in enumerate(num1): for j in range(10): ...

0.508558

t=int(input()) for i in range(t): l=list(map(int,input().split(' '))) a=l[0] b=l[1] l1=list(map(int,input().split(' '))) for i in range(b): l2=list(map(int,input().split(' '))) a1=l2[0] b1=l2[1] su=0 for j in range(a1-1,b1): su=(su+l1[j])%1000000000 print(su)

0.508067

from sys import * from math import * mod = 1000000000 f = [0 for i in range(200)] f[0] = f[1] = 1 for i in range(2, 200): f[i] = f[i - 1] + f[i - 2] n, m = stdin.readline().split() n = int(n) m = int(m) a = list(map(int, stdin.readline().split())) for i in range(m): tp, x, y = stdin.readline().split() tp = int(t...

0.507976

r = 1000000007 t = int(input()) for i in range(t): n = int(input()) print(pow(3,n,r) + pow(-1,n)*3)

0.507954

d = 10**9 + 7 t = int(input()) while t: t-=1 n =int(input()) p =list(map(int, input().strip().split())) a =list(map(int, input().strip().split())) b =list(map(int, input().strip().split())) ans = 1 for i in range(n): c = a[i] - b[i] + 1 tmp = (( pow(p[i],b[i]...

0.50795

def count(a, t, x): return sum(not (t-v)%x if x else t==v for v in a)

0.50781

TABLE = str.maketrans('0123456789','9876543210') def code(*args): return sum(map(lambda n:int(str(n).translate(TABLE)), args))

0.507806

N=int(input()) mod=998244353 inv4=249561088 A=[inv4,0,3] for i in range(N): A.append(9*A[-1]-24*A[-2]+16*A[-3]) A[-1]%=mod A[0]-=inv4 B=[0 for i in range(N)] for i in range(N): x=i y=N-i-1 if x<=y: B[x]=A[i] B[y]=A[i] P=N*pow(2,N-2+mod-1,mod) for i in range(N): B[i]+=P B[i]%...

0.507742

s=input();M=10**9+7;o=u=v=0;n=len(s) for i in range(n):c=int(s[i]);u+=v;v=(10*v+c)%M;o+=pow(10,n-i-1,M)*((i*i+i)//2*c+u) print(o%M)

0.507431

ANSWERS = { 0: 1, 1: 1, 2: 2, 3: 3, 4: 5, 5: 7, 6: 11, 7: 15, 8: 22, 9: 30, 10: 42, 11: 56, 12: 77, 13: 101, 14: 135, 15: 176, 16: 231, 17: 297, 18: 385, 19: 490, 20: 627, 21: 792, 22: 1002, 23: 1255, 24: 1575, 25: 1...

0.507156

def main(): N=int(input()) A=list(map(int,input().split())) mod=10**9+7 ans=0 for i in range(60): a=0 for x in A: if x>>i&1: a+=1 ans+=a*(N-a)*pow(2,i,mod) ans%=mod print(ans) def __starting_point(): main() __starting_point()

0.507039

def bin_mul(m,n): if m < n: return bin_mul(n,m) if n == 0: return [] res = [] while m > 0: if m % 2 == 1: res.append(n) m = m//2; n *=2 return res[::-1]

0.506953

from sys import stdin, stdout, exit mod = 10**9 + 7 def modinv(x): return pow(x, mod-2, mod) N = 2*10**5 + 10 facts = [1]*N for i in range(1,N): facts[i] = facts[i-1] * i facts[i] %= mod def binom(n, k): ans = modinv(facts[k]) * modinv(facts[n-k]) ans %= mod ans *= facts[n] ans %= mod ...

0.505895

from functools import reduce from math import gcd def survivor(a): """Round Robin by Bocker & Liptak""" def __residue_table(a): n = [0] + [None] * (a[0] - 1) for i in range(1, len(a)): d = gcd(a[0], a[i]) for r in range(d): try: nn = m...

0.50556

class Solution: def numOfSubarrays(self, arr: List[int]) -> int: mod = 10**9+7 odd_presum_cnt = 0 par = 0 for a in arr: par ^= a & 1 if par: odd_presum_cnt += 1 return odd_presum_cnt * (len(arr)+1 - odd_presum_cnt)%mod

0.505547

def comb_mod(n,r): mod = 10**9+7 ans = 1 for i in range(r): ans *= n-i ans %= mod for i in range(1,r+1): ans *= pow(i,mod-2,mod) ans %= mod return ans def solve(): n, a, b = list(map(int, input().split())) mod = 10**9+7 ans = pow(2,n,mod)-comb_mod(n,a)-co...

0.505528

DIGITS = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/" def base64_to_base10(string): return sum(DIGITS.index(digit) * 64**i for i, digit in enumerate(string[::-1]))

0.505111

p = 1000000007 n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) m = int(input()) d = [1] * 300001 td = [0] * 300001 L = b[0] for i in range(1, n): if a[i - 1] != 1: t = m % a[i - 1] if L < t: print(0) return m //= a[i - 1] for j in range((L - t) // a[i - 1] + 1):...

0.504808

a, b, p, x = [int(x) for x in input().split()] powers = [a] while powers[-1] != 1: powers.append(powers[-1] * a % p) order = len(powers) powers = [powers[-1]] + powers inverse = pow(order, p-2, p) def f(sol): return (x // (p * order)) + (1 if sol <= x % (p * order) else 0) def chinese(a, n, b, m): ...

0.504492

class Solution: def threeSumMulti(self, A: List[int], target: int) -> int: counter = collections.Counter(A) i, res, l, ckey = 0, 0, len(counter), sorted(list(counter.keys())) if target % 3 == 0: res += math.comb(counter[target // 3], 3) for i in range(l): ni =...

0.504046

def digits_product(product): if product < 10: return 10 + product n = '' for d in range(9, 1, -1): while not product % d: n += str(d) product //= d return int(n[::-1]) if product == 1 else -1

0.503981

def calc(a): return sum( x**(1 + (x>=0)) * (1 + 2*(not i%3)) * (-1)**(not i%5) for i,x in enumerate(a,1))

0.503959

Given a string s, return the maximum number of ocurrences of any substring under the following rules: The number of unique characters in the substring must be less than or equal to maxLetters. The substring size must be between minSize and maxSize inclusive. Example 1: Input: s = "aababcaab", maxLetters = 2, minSiz...

class Solution: def maxFreq(self, s: str, maxLetters: int, minSize: int, maxSize: int) -> int: n = len(s) count = collections.Counter(s[i : i + minSize] for i in range(0, n - minSize + 1)) res = 0 for k, v in count.items(): if len(set(k)) <= maxLetters: ...

0.851683

class Solution: def characterReplacement(self, s, k): """ :type s: str :type k: int :rtype: int """ if s == "": return 0 count = {} lo = 0 hi = 0 max_letter = 0 for hi in range(len(s)): try:...

0.569289

class Solution: def maxRepOpt1(self, text: str) -> int: letters = {} for i, char in enumerate(text): if char in letters: letters[char].append(i) else: letters[char] = [i] if len(letters) == 1: return len(text) ...

0.558173

from collections import * c=Counter() ans=n=int(input()) s=input() k=len(set(s)) i=j=t=0 while j<n: while len(c)<k and j<n: c[s[j]]+=1; j+=1 while len(c)==k: if j-i<ans: ans=j-i c[s[i]]-=1 if c[s[i]]==0: del c[s[i]] i+=1 print(ans)

0.544683

class Solution: def minDeletionSize(self, A: List[str]) -> int: dp = [(1, 1)] * len(A[0]) for i in range(len(dp)): if i > 0: max_pre = None for pre in range(i - 1, -1, -1): for word in A: if word[pre] > word[i]: ...

0.544222

class Solution: def maxPower(self, s: str) -> int: n = len(s) count = 0 res = s[0] cur_count = 1 # Traverse string except # last character for i in range(n): # If current character # matches with next ...

0.543378

class Solution: def lengthOfLongestSubstring(self, s): """ :type s: str :rtype: int """ L, res, last = -1, 0, {} for R, char in enumerate(s): if char in last and last[char] > L: L = last[char] elif R-L > res: ...

0.538137

class Solution: def longestSubstring(self, s, k): """ :type s: str :type k: int :rtype: int """ for c in set(s): if s.count(c) < k: return max(self.longestSubstring(sp, k) for sp in s.split(c)) return len(s)

0.537554

class Solution: def maxUniqueSplit(self, s: str) -> int: self.x, n = 0, len(s) def maxUniqueSplit_(i=0, S=set()): if s[i:] not in S: self.x = max(self.x, len(S) + 1) for j in range(i + 1, n): if s[i : j] not in S and len(S) + 1 + n...

0.53566

def longest_word(letters): try: word_list = [w for w in words if all(w.count(c) <= letters.count(c) for c in w)] largest = sorted([w for w in word_list if len(w) == len(max(word_list, key=len))]) return largest if largest else None except: return None

0.527899

class Solution: def maxScoreWords(self, words: List[str], letters: List[str], score: List[int]) -> int: let=Counter(letters) sc={} for i in range(26): sc[chr(i+ord('a'))]=score[i] word={} for w in words: word[w]=Counter(w) self.ans=0 us...

0.521071

import sys from math import * def minp(): return sys.stdin.readline().strip() def mint(): return int(minp()) def mints(): return map(int, minp().split()) def add(a,b): return (a+b)%1000000007 def sub(a,b): return (a+1000000007-b)%1000000007 def mul(a,b): return (a*b)%1000000007 p = 102367 s = list(map(int,...

0.520977

'''input abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxy...

0.517438

t = [0] * 26 def get_k(c): return ord(c) - ord('a') def analyze(s): length_of_str = len(s) pos = 0 beauty_table = [0] * 26 for i in range(1, length_of_str): if s[i] != s[pos]: k = get_k(s[pos]) beauty_table[k] = max(beauty_table[k], i - pos) pos = i ...

0.516478

n, k = [int(i) for i in input().split()] dic = dict() s = list(input()) i = 0 while i<n: j = 1 while i+j < n and s[i] == s[i+j]: j+=1 if s[i] not in dic: dic[s[i]] = [] dic[s[i]].append(j) i += j ans = 0 for i in list(dic.keys()): ct = 0 for j in dic[i]: ct+=(j//k...

0.515239

class Solution: def equalSubstring(self, s: str, t: str, maxCost: int) -> int: dist = [ abs( ord(s[i]) - ord(t[i]) ) for i in range(len(s))] # i = 0 # cur = 0 # res = 0 # for j in range(len(s)): # cur += dist[j] # while cur>maxCost: # ...

0.512419

class Solution: def longestDupSubstring(self, S): nums, N = [ord(c) - ord('a') for c in S], len(S) BASE, MOD = 26, 2**32 def check(L): cur_hash, seen = 0, set() for val in nums[:L]: cur_hash = (cur_hash * BASE + val) % MOD seen.add(cur_hash...

0.511677

def main(): n = int(input()) a = [input() for i in range(n)] result = 0 for i in range(26): for j in range(i + 1, 26): t = 0 ci = chr(i + ord('a')) cj = chr(j + ord('a')) for s in a: if s.count(ci) + s.count(cj) == len(s): ...

0.506081

# # abc096 b # import sys from io import StringIO import unittest from collections import Counter class TestClass(unittest.TestCase): def assertIO(self, input, output): stdout, stdin = sys.stdout, sys.stdin sys.stdout, sys.stdin = StringIO(), StringIO(input) resolve() sys.stdout.se...

0.504431

class Solution: def maxLength(self, arr: List[str]) -> int: def digit_representation(s): ans = 0 for c in s: ans |= 1<<(ord(c)-ord('a')) return ans A = sorted([(len(s), digit_representation(s)) for s in set(arr) if len(set(s))==len(s)], re...

0.502696

import sys n = int(sys.stdin.readline().strip()) s = sys.stdin.readline().strip() dp = [[-1] * (n + 1) for i in range(26)] for c in range(26): for j in range(n): tst = 1 if s[j] == chr(c + 97) else 0 dp[c][1 - tst] = max(dp[c][1 - tst], 1) for k in range(j + 1, n): if s[k] ...

0.501408

class Solution: def findTheLongestSubstring(self, s: str) -> int: s = s + 'a' bits, dp = {'a':0,'e':1,'i':2,'o':3,'u':4}, {0:-1} res = 0 key = 0 for i, char in enumerate(s): if char in bits: if key in dp: res = m...

0.500219

class Solution: def numSplits(self, s: str) -> int: left = [0]*len(s) unique = set() n_distinct = 0 for i, l in enumerate(s): if l not in unique: unique.add(l) n_distinct += 1 left[i] = n_distinct count...

0.499629

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline mii=lambda:list(map(int,input().split())) s=input().strip() d=[0]*1000 e=[0]*1000 hist=[0]*26 for i in s: j=ord(i)-ord('a') for k in range(26): e[k*26+j]+=hist[k] hist[j]+=1 d[j]+=1 print(max(d+e))

0.499055

class Solution: def longestAwesome(self, s: str) -> int: cum = [0] firsts = {0: -1} lasts = {0: -1} for i, c in enumerate(s): cum.append(cum[-1] ^ (1 << (ord(c) - 48))) if cum[-1] not in firsts: firsts[cum[-1]] = i lasts[cum[-1]] = ...

0.498188

def list_input(): return list(map(int,input().split())) def map_input(): return map(int,input().split()) def map_string(): return input().split() n = int(input()) a = list(input()) ans = 0 for i in range(n): for j in range(i,n): b = a[i:j+1] for k in b: if k.lower() != k: break else: ...

0.496306

class Solution: def uniqueLetterString(self, s: str) -> int: chrLoc = defaultdict(list) ct = 0 md = 1000000007 l = len(s) for i, c in enumerate(s): chrLoc[c].append(i) for c in chrLoc: locs = [-1] + chrLoc[c] + [l] loc_ct =...

0.495887

class Solution: def findSubstringInWraproundString(self, p): """ :type p: str :rtype: int """ pc = None sl = 0 ll = {} for c in p: if pc and (ord(pc) + 1 == ord(c) or (pc == 'z' and c == 'a')): sl += 1 ...

0.495513

from sys import stdin from collections import Counter def func(arr,n,l): count=0 k=l//n if n<len(arr): for ele in arr[0:n]: count+=max(0,k-ele) else: for ele in arr: count+=max(0,ele-k) return count for _ in range(int(stdin.readline())): s=stdin.readline().strip() d=Counter(s) arr=sorted(list(d.val...

0.495231

t = int(input()) for j in range(0, t): n = int(input()) m = 100 for i in range(0, n): str = input() p = min(str.count("a",0,len(str)),str.count("b",0,len(str))) if (m > p): m = p print(m) t = t-1

0.494151

s=input() dp=[[0,0,0] for i in range(len(s))] for i in range(len(s)): if s[i]=='a': dp[i][0]=dp[i-1][0]+1 dp[i][1]=dp[i-1][1] dp[i][2]=max(dp[i-1][1]+1,dp[i-1][2]+1) else: dp[i][0]=dp[i-1][0] dp[i][1]=max(dp[i-1][0]+1,dp[i-1][1]+1) dp[i][2]=dp[i-1][2] e=len(s)-1 p...

0.492991

class Solution: def maxVowels(self, s: str, k: int) -> int: n = len(s) vowel = set(['a','e','i','o','u']) i=0 res = 0 while i<k: if s[i] in vowel: res+=1 i+=1 j=k i=0 maxV = res while j<n: if ...

0.492688

class Solution: def getLengthOfOptimalCompression(self, s: str, k: int) -> int: n = len(s) def compLen(c): return 1 + len(str(c)) if c > 1 else 1 @lru_cache(None) def dp(i, k): # return {head: (len, -head_count)} if (n - i) <= k: return {} # ...

0.491928

class Solution: def minDeletionSize(self, A: List[str]) -> int: def isSorted(arr, i, j): return all(arr[k] <= arr[k+1] for k in range(i, j)) ans = 0 ranges = [[0, len(A)-1]] for col in zip(*A): if not ranges: break if all(isSorted(c...

0.491675

from string import ascii_lowercase t = int(input()) for _ in range(t): n, m = [int(x) for x in input().split()] s = input() count = {x : 0 for x in ascii_lowercase} errors = [int(x) for x in input().split()] errors = sorted(errors) e_idx = 0 for j, c in enumerate(s): while e_idx...

0.490838

import re def timed_reading(max_length, text): return sum(len(i) <= max_length for i in re.findall('\w+', text))

0.489707

str = input() l = len(str) a = [0] * (2 * l) pos = [[] for i in range(26)] for i, c in enumerate(str): t = ord(c) - ord('a') a[i] = t a[i + l] = t pos[t].append(i) ans = 0 for c in range(26): cur = 0 for k in range(1, l): cnt = [0] * 26 for i in pos[c]: cnt[a[i + k]] ...

0.481929

class Solution: def isvalid(self,C): if len(C)>2: return False if len(C)==1: a = min(C) if a==1 or C[a]==1: # EXPLANATION: # a==1 : All lengths are unitary like A=[1,2,3,4,...], so poping anything is fine # C[a...

0.481741

for t in range(int(input())): s = input() r = input() diff = list() index = list() cnt = 0 for i in range(len(s)): if s[i] != r[i]: cnt += 1 index.append(i) for i in range(1, len(index)): diff.append(index[i] - index[i - 1] - 1) diff.sort() fmin = cnt ** 2 oper = cnt ; moves = cnt for i in diff: ...

0.479892

class Solution: def getMaxRepetitions(self, s1, n1, s2, n2): """ :type s1: str :type n1: int :type s2: str :type n2: int :rtype: int """ if s2=='aac' and n2==100: return 29999 i,j=0,0 l1=len(s1) l2=len(s...

0.479654

class Solution: def longestStrChain(self, words: List[str]) -> int: by_length = collections.defaultdict(set) for word in words: by_length[len(word)].add(word) longest = 1 seen = {*()} mx = len(by_length) mn = min(by_length) for length in sorted(b...

0.477881

class Solution: def findLength(self, A, B): def check(length): seen = {A[i:i+length] for i in range(len(A) - length + 1)} return any(B[j:j+length] in seen for j in range(len(B) - length + 1)) A = ''.join(map(chr, A)) ...

0.474807

class Solution: def countCharacters(self, words: List[str], chars: str) -> int: d={} for i in chars: if i in d: d[i]+=1 else: d[i]=1 l=0 for i in words: flag = True for j in i: if j in d: ...

0.474719

import sys, logging logging.basicConfig(level=logging.INFO) logging.disable(logging.INFO) def build(S, n): Z = [0 for i in range(3 * n + 3)] #logging.info(S) n = len(S) L = 0 R = 0 Z[0] = n for i in range(1, n): if(i > R): L = R = i while(R < n and S[R] == S[...

0.474561

# class Solution: # def distinctEchoSubstrings(self, text: str) -> int: # ans = set() # for i in range(len(text)-1): # for j in range(i+1, (i+len(text))//2+1): # if text[i:j] == text[j:2*j-i]: ans.add(text[i:j]) # return len(ans) from collectio...

0.474273

def maxlen(s1, s2): sm, lg = sorted((s1, s2)) return min(max(lg / 3, sm), lg / 2)

0.47377

n, m, k = map(int, input().split()) s, t = input(), input() n += 1 m += 1 p = [i for i in range(n * m - n) if (i + 1) % n] r = p[::-1] d = [0] * n * m for i in p: if s[i % n] == t[i // n]: d[i] = d[i - n - 1] + 1 f = d[:] for y in range(k - 1): for i in p: f[i] = max(f[i], f[i - 1], f[i - n]) for i in...

0.473572

from collections import deque class Solution: def longestSubarray(self, nums, limit): maxQ, minQ = deque(), deque() i = 0 res = 0 for j, val in enumerate(nums): while maxQ and val > maxQ[-1]: maxQ.pop() while minQ and val < minQ[-1]: minQ.pop() max...

0.473182

class Solution: def balancedString(self, s: str) -> int: # minimum window so that outside is possible if len(s) //4 != len(s) / 4: return -1 ans, lb, n_cnt = len(s), 0, collections.Counter(s) i = 0 while i < len(s): n_cnt[s[i]] -= 1 while lb < ...

0.472144

def solve(s): return max(map(len, ''.join(c if c in 'aeiou' else ' ' for c in s).split()))

0.47087

class Solution: def minWindow(self, s, t): """ :type s: str :type t: str :rtype: str """ left=-1 right = 0 result = "" totalMatch = 0 d = {} for c in t: d[c] = d.get(c, 0) + 1 for right in ran...

0.47049

read = lambda: map(int, input().split()) n = int(input()) s = input() a = list(read()) dp = [0] * (n + 2) mn = [10 ** 4] * (n + 2) dp[0] = dp[n + 1] = 1 mn[n + 1] = 0 mn[0] = 1 Max = 1 mod = 10 ** 9 + 7 for i in range(1, n): res = 0 cur = 10 ** 4 for j in range(i, -1, -1): c = ord(s[j]) - ord('a') ...

0.470043

for _ in range(int(input())): n,s = int(input()),input().strip() previ,num,_s,dic = s[0],0,[],{} for i in s: if previ == i: num+=1 continue _s.append((previ, num)) if previ not in dic or dic[previ]<num:dic[previ] = num previ,num = i,1 _s.append((previ, num)) if previ ...

0.468001

class Solution: def longestDecomposition(self, text: str) -> int: n = len(text) splits = 0 leftstart, leftend = 0, 0 rightstart, rightend = n-1, n-1 while leftend<rightstart: if text[leftstart:leftend+1] == text[rightstart:rightend+1]: leftstart = ...

0.467543

# cook your dish here n=int(input()) l=[] for i in range(n): l.append(input()) m=int(input()) s=input() c=0 res=[s[i:j] for i in range(len(s)) for j in range(i+1,len(s)+1)] res=list(dict.fromkeys(res)) for i in res: if i in l: c=c+1 print(c)

0.467022

import sys n = int(sys.stdin.readline().strip()) s = sys.stdin.readline().strip() alph = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" arr = [0]*26 pref = [] for i in range(len(s)): for j in range(26): if alph[j] == s[i]: arr[j] += 1 break pref += [arr[:]] # for x in pref: # print(x) q = int(sys.std...

0.466538

from sys import stdin,stdout import math,bisect from datetime import date from collections import Counter,deque,defaultdict L=lambda:list(map(int, stdin.readline().strip().split())) M=lambda:list(map(int, stdin.readline().strip().split())) I=lambda:int(stdin.readline().strip()) S=lambda:stdin.readline().strip() C=lambd...

0.466464

def solve(a, b): if len(a) is 1: return b.count(a) index = [x for x in range(len(b)-1) if b[x] is a[0]] return sum(solve(a[1:], b[x+1:]) for x in index)

0.466257

from collections import defaultdict l = list(map(int, input().split())) st = input() s = [(ord(i) - ord('a')) for i in st] track = [defaultdict(lambda: 0) for i in range(26)] res = 0 s = [0] + s pre = [0 for i in range(len(s))] for i in range(1, len(s)): pre[i] = pre[i-1] + l[s[i]] for i in range(1, len(s)): res += ...

0.465955

class Solution: def longestCommonSubsequence(self, a: str, b: str) -> int: last, current = [0] * (len(b) + 1), [0] * (len(b) + 1) for i in range(len(a) - 1, -1, -1): for j in range(len(b) - 1, -1, -1): if a[i] == b[j]: current[j] = 1 + last[j ...

0.465097

class Solution: def strongPasswordChecker(self, s): """ :type s: str :rtype: int """ def length_requirement(password): length = len(password) # positive means addition, negative means deletion if length < 6: return...

0.464269

match = 0 nonmatch = 0 count = 0 def calc_match(s, t, p): nonlocal match nonlocal nonmatch nonlocal count if p == len(s)-len(t): return if p+len(t) < len(s): if s[p+len(t)] == '?': count -= 1 elif s[p+len(t)] == t[-1]: match -= 1 else: nonmatch -= 1 match, nonmatch = nonma...

0.463988

g = "ACTG" def dist(a, b): p = abs(ord(a) - ord(b)) return min(p, 26 - p) def price(s): return sum(dist(x, y) for x, y in zip(g, s)) n = int(input()) s = input() ans = 100000 for i in range(len(s) - 3): ans = min(ans, price(s[i:i+4])) print(ans)

0.46379

def string_constructing(a, s): if len(s) == 0: return 0 i = -1 for j, c in enumerate(s): i = a.find(c, i+1) if i < 0 or i == len(a) - 1: break return len(a) - j + (i < 0) + string_constructing(a, s[j + (i >= 0):])

0.463628

class Solution: def minDeletionSize(self, A: List[str]) -> int: return sum([list(col) != sorted(col) for col in zip(*A)])

0.462568

from functools import lru_cache def failure(pat): i, target, n = 1, 0, len(pat) res = [0] while i < n: if pat[i] == pat[target]: target += 1 res.append(target) i+=1 elif target: target = res[target-1] else: res.append(0) ...

0.462426

def get_char_count(s): counts = {} for c in (c.lower() for c in s if c.isalnum()): counts[c] = counts[c] + 1 if c in counts else 1 m = {} for k, v in counts.items(): m[v] = sorted(m[v] + [k]) if v in m else [k] return m

0.46212

alp = "abcdefghijklmnopqrstuvwxyz" dic = {} for i,s in enumerate(alp): dic[s] = i lis = [0] * 27 n = int(input()) S = input() ans = [] for i,s in enumerate(S): ind = dic[s] ans.append(max(lis[ind+1:]) + 1) lis[ind] = ans[-1] print(max(ans)) print(" ".join(map(str,ans)))

0.461479

from collections import Counter def string_letter_count(s): cnt = Counter(c for c in s.lower() if c.isalpha()) return ''.join(str(n)+c for c,n in sorted(cnt.items()))

0.460387

t=int(input()) no_of_chars = 256 # Function to find smallest window # containing all characters of 'pat' def findSubString(string, pat): len1 = len(string) len2 = len(pat) if len1 < len2: return 0 hash_pat = [0] * no_of_chars hash_str = [0] * no_of_chars for i in...

0.460191

import sys def input(): return sys.stdin.readline()[:-1] H, W = map(int, input().split()) s = [input() for _ in range(H)] ans = max(H, W) def max_rect(a): res = 0 stack = [a[0]] for i in range(1, W-1): new_pos = i while stack and stack[-1] % 10000 >= a[i]: pos, hght = stack[-1] // 10000, stack[-1] % 10000 ...

0.460131

t = int(input()) def gcd(a,b): if b == 0: return a return gcd(b,a%b) for _ in range(t): n,k = map(int,input().split()) s = input() occ = [0] * 26 for i in s: occ[ord(i)-97] += 1 occ.sort() occ.reverse() for l in range(1,n+1): cycle = gcd(l,k) need = l/...

0.459384

def upc(c): if c >= 'a' and c <= 'z': c = chr(ord(c) - ord('a') + ord('A')) return c a1, a2 = {}, {} for i in input(): if i in a1: a1[i] += 1 else: a1[i] = 1 for i in input(): if i in a2: a2[i] += 1 else: a2[i] = 1 r1, r2 = 0, 0 a3, a4 = {}, {} for k in a1...

0.458322

n, k = list(map(int, input().split())) a = [] for i in range(n): a.append(input()) s = input() kmn = 1 kmx = 0 for i in range(n): if (len(a[i]) < len(s)): kmn += 1 kmx += 1 elif (len(a[i]) == len(s)): kmx += 1 print((kmn - 1) // k * 5 + kmn, (kmx - 1) // k * 5 + kmx)

0.457642

def max_match(s): result = [] while s: for size in range(len(s), 0, -1): word = s[:size] if word in VALID_WORDS: break result.append(word) s = s[size:] return result

0.45745

class Solution: def removeDuplicateLetters(self, s): """ :type s: str :rtype: str """ rindex = {c: i for i, c in enumerate(s)} result = '' for i, c in enumerate(s): if c not in result: while c < result[-1:] and i < rindex[...

0.456754

from math import ceil n = int(input()) word1 = input() word2 = input() combined = [] for i in range(ceil(n / 2)): if i > n / 2 - 1: combined.append([word1[i], word2[i]]) else: combined.append([word1[i], word1[- i - 1], word2[i], word2[- i - 1]]) count = 0 for l in combined: s = set(l) ...

0.456663

class Solution: def distinctSubseqII(self, s: str) -> int: n = len(s) MOD = 10**9 + 7 seen = dict() a = 1 for i in range(n): char = s[i] b = 2 * a if char in seen: b -= seen[char] b %= MOD ...

0.454452

def f(x): z=[0 for i in range(len(x))] l=0 r=0 for i in range(1,len(x)): if i<=r: z[i]=min(z[i-l],r-i+1) while i+z[i]<len(x) and x[z[i]]==x[i+z[i]]: z[i]+=1 if i+z[i]-1>r: l,r=i,i+z[i]-1 return z a=list(map(int,input('').split())) n,a,b=a[0...

0.454445

n = int(input()) arr = input() final = len(arr) arr = arr.split() lens = [0 for x in range(n)] visit = [0 for x in range(n)] cnt = 0 ans = 0 for i in range(n): if visit[i]: continue lens[cnt] = len(arr[i]) for j in range(i+1,n): if arr[j]==arr[i]: arr[j] = cnt visit[j] = 1 arr[i] = cnt cnt...

0.453114

def segment_cover(A, L): n=1 s=min(A) for i in sorted(A): if s+L<i: s=i n+=1 return n

0.452435

line = input().split() n = int(line[0]) m = int(line[1]) lst = [input()] sml = [] for i in range(n - 1): lst.append(input()) sml.append(False) ans = 0 for i in range(m): flag = True for j in range(n - 1): flag = flag and ((lst[j][i] <= lst[j + 1][i]) or sml[j]) if flag: for j in ra...

0.451434

from collections import * def go(): n,s,t=int(input()),input(),input() if Counter(s)!=Counter(t): return -1 ans=0 for i in range(n): k=0 for j in range(i,n): while k<n and s[k] != t[j]: k += 1 if k == n: break k += 1 ans = max(ans, j-i+1) return n-ans for _ in range(int(input())): print(go())

0.451185

N=int(input()) S=input() ans=S[0] for s in S: if ans[-1]!=s: ans+=s print(len(ans))

0.450295

from collections import Counter def main(): s = input() c = Counter(s) w = Counter("Bulbasaur") ans = 1e9 for char in w: ans = min(ans, c[char] // w[char]) print(ans) main()

0.450178

class Solution(object): def findSubstring(self, s, words): """ :type s: str :type words: List[str] :rtype: List[int] """ if not s or words==[]: return [] lenstr=len(s) lenword=len(words[0]) lensubstr=len(words)*lenword ...

0.44983

from collections import Counter from functools import reduce from fractions import gcd def has_subpattern(s): c = Counter(s) m = reduce(gcd, c.values()) return ''.join(sorted(k*(v//m) for k,v in c.items()))

0.449687

def str_count(strng, letter): counter = 0 for chr in strng: if chr == letter: counter += 1 return counter

0.448605

class Solution: def getMax(self, arr, m, n): res = 0 for e in arr: if m >= e[0] and n >= e[1]: res += 1 m -= e[0] n -= e[1] return res def findMaxForm(self, strs, m, n): """ :type strs: List[str]...

0.448523

def duplicate_count(s): return len([c for c in set(s.lower()) if s.lower().count(c)>1])

0.448484

def ii(): return int(input()) def mi(): return list(map(int, input().split())) def li(): return list(mi()) n, k = mi() a = li() s = input().strip() ans = 0 i = 0 while i < n: j = i + 1 while j < n and s[j] == s[i]: j += 1 b = sorted(a[i:j]) ans += sum(b[-k:]) i = j print(ans)

0.448465

n,m=map(int,input().split()) L=[] for i in ' '*n:L.append(input()) dp=[[0]*m for i in range(n)] for i in range(n+m-1): rightmin=max(0,i-(n-1)) leftmin=max(0,i-(m-1)) left=i-rightmin jstart = max(0, i - (n - 1)) for j in range(abs(left-leftmin)+1): jj=jstart+j ii=i-jj if jj<2 ...

0.448223

for _ in range(eval(input())): S1=input() m1=len(S1)/2 S2=input() m2=len(S2)/2 d1={} d2={} for i in range(len(S1)): c=S1[i] v=abs(m1-i) if c in d1: if v<d1[c][0]: d1[c]=[v,i] else: d1[c]=[v,i] for i in range(len(S2)...

0.447906

class Solution: def findShortestSubArray(self, nums): diction = {} for i in nums: if i not in diction: diction[i] = 1 else: diction[i] += 1 degree = max(list(diction.values())) ...

0.447516

class Solution: def countSubstrings(self, s): """ :type s: str :rtype: int """ ret = 0 left, right = 0, 0 while left < len(s): while right < len(s) and s[right] == s[left]: right += 1 ret += self.sum(right - l...

0.447308

class Edge: def __init__(self, to, cost, capacity, next_edge): self.to = to self.cost = cost self.origin_cost = cost self.capacity = capacity self.next_edge = next_edge self.pair = None class MinCostMaxFlow: def __init__(self, max_node): self.null = Edge...

0.447149

def count_subsequences(needle, haystack): count = [1] + [0] * len(needle) for a in haystack: count = [1] + [count[i] + count[i-1] * (a == b) for i, b in enumerate(needle, 1)] return count[-1] % 10 ** 8

0.446467

def solve(st): return next((n for n in range(len(st)//2, 0, -1) if st[:n] == st[-n:]), 0)

0.44627

t = eval(input()) for _ in range(t): n = eval(input()) a = input().strip().split() cb, cs = 0, "" for i in range(len(a[0])): for j in range(i+1,len(a[0])+1): al = True s = a[0][i:j] for k in a[1:]: if s not in k: al = False break if al: if j-i>=cb: cb = max(cb, j-i) if len(...

0.445832

s = input() cur_len = 1 a = [] char = [] for i in range(1, len(s)): if s[i] == s[i-1]: cur_len += 1 else: a.append(cur_len) char.append(s[i-1]) cur_len = 1 a.append(cur_len) char.append(s[len(s)-1]) ans = 0 while len(a) > 1: n = len(a) inner_min = 100000000 for i in range(...

0.445705

from heapq import * from collections import Counter class Solution: def minSetSize(self, arr: List[int]) -> int: counter = Counter(arr) size = len(arr) # unique elements (remove half of them) if len(counter) == size: return (size - 1) // 2 + 1 ...

0.444722

There is a group of G members, and a list of various crimes they could commit. The ith crime generates a profit[i] and requires group[i] members to participate in it. If a member participates in one crime, that member can't participate in another crime. Let's call a profitable scheme any subset of these crimes that gen...

class Solution: def profitableSchemes(self, G: int, P: int, group: List[int], profit: List[int]) -> int: MOD = 10**9 + 7 group_len, profit_len = len(group),len(profit) dp = [[0]*(G+1) for _ in range(P+1)] dp[0][0] = 1 for pro, gro in zip(profit,group): dp2 = [x[:]...

0.902664

import sys input = sys.stdin.readline MOD = 10 ** 9 + 7 t = int(input()) for _ in range(t): n, p = list(map(int, input().split())) l = list(map(int, input().split())) if p == 1: print(n % 2) else: l.sort(reverse = True) curr = l[0] out = 0 real = True f...

0.716911

k, pa, pb = list(map(int, input().split())) MOD = 10**9 + 7 INF = ((pa + pb) * pow(pb, MOD-2, MOD)) % MOD rAB = pow(pa+pb, MOD-2, MOD) rB = pow(pb, MOD-2, MOD) memo = {} def dfs(a, ab): if ab >= k: return ab if a + ab >= k: #return INF #return (pa + pb) / pb return ((a + MOD-1...

0.66782

import sys from collections import defaultdict, Counter P = 10 ** 9 + 7 def factmod(n): res = 1 for i in range(2, n+1): res *= i res %= P return res def solve(): n, m = list(map(int, input().split())) colour = {i:0 for i in range(1, m+1)} colour_map = {} for i, line in en...

0.649713

n,p=list(map(int,input().split())) nums=[0]+list(map(int,input().split())) mod=10**9+7 f=[[[[0]*2 for _ in range(2)] for _ in range(2)] for _ in range(n+1)] _2=[0]*(n+1) _2[0]=1 for i in range(1,n+1): _2[i]=(_2[i-1]<<1)%mod f[0][0][0][0]=1 if nums[1]!=0: f[1][1][0][1]+=1 if nums[1]!=1: f[1][1][1][0]+...

0.645717

from random import randint import sys n, m, p = list(map(int, input().strip().split())) f = list(map(int, input().strip().split())) g = list(map(int, input().strip().split())) for i in range(len(f)): if f[i] % p != 0: break j = 0 while g[j] % p == 0: j += 1 print(i+j)

0.645595

MOD = 1000000007 n = int(input()) p = [int(x) for x in input().split()] x = [int(x) for x in input().split()] children = [[] for x in range(n)] for i in range(1,n): children[p[i-1]].append(i) #print(children) count = [(0,0) for i in range(n)] for i in reversed(list(range(n))): prod = 1 for ch in childr...

0.638636

import sys from collections import deque input=sys.stdin.readline for _ in range(int(input())): n=int(input()) edge=[[] for i in range(n)] for i in range(n-1): u,v=list(map(int,input().split())) edge[u-1].append(v-1) edge[v-1].append(u-1) m=int(input()) p=list(map(int,input...

0.635888

# -*- coding: utf-8 -*- def solve(): mod = 10**9 + 7 n, m = map(int, input().split()) p = input() if m == 0: return powmod(n) delta = len(p) - 1 ys = map(int, input().split()) answer = 1 tail = 0 for y in ys: if y > tail: answer *= powmod(y - tail - 1) ...

0.633291

n,N,MOD,ans=int(input()),int(1e6+5),int(1e9+7),0 cnt,pw,f=[0]*int(N),[1]*(n+1),[0]*int(N) for i in range(n): pw[i+1]=pw[i]*2%MOD for i in input().split(): cnt[int(i)]+=1 for i in reversed(range(2,N)): t=sum([cnt[j] for j in range(i,N,i)]) if t: f[i]=t*pw[t-1]%MOD for j in range(i*2,N,i): f[i]=(f[i]-f[j])%MOD...

0.630385

import math n = int(input()) a = [int(x) for x in input().split()] p = int(input()) sum=0; for x in range(n): sum+=a[x] if(sum<=p): print(n) else: ans=0 for i in range(n): dp = [[[0 for z in range(55)] for y in range(55)] for x in range(55)] dp[-1][0][0]=1 for j in range(n): if(j==i): for k in range...

0.628705

import sys sys.setrecursionlimit(10 ** 6) D,G=map(int,input().split()) p=[] c=[] for i in range(D): a,b=map(int,input().split()) p += [a] c += [b] def solve(bit): if bit >= (1<<D): return 1000 p_sum=0 num=0 for i in range(D): if bit & (1<<i): p_sum += c[i] + p[i] * 100*(i+1) num += p...

0.628191

import functools, operator m = int(input()) p = [int(x) for x in input().split()] P = {} n = 1 for i in p: P[i] = P.get(i, 0) + 1 n = n * i % 1000000007 dv = functools.reduce(operator.mul, (l + 1 for l in list(P.values()))) prod = 0; #n = functools.reduce(operator.mul, (pow(p,i,1000000007) for p,i in P.items())...

0.627136

MOD=10**9+7 N,C=map(int, input().split()) A=list(map(int, input().split())) B=list(map(int, input().split())) P=[[1] for _ in range(401)] for _ in range(1,401): for i in range(1,401): P[i].append(P[i][-1]*i%MOD) R=[[] for _ in range(N)] for i,AB in enumerate(zip(A, B)): AA,BB=AB for a in range(401):...

0.625243

d = 10**9 + 7 t = int(input()) while t: t-=1 n =int(input()) p =list(map(int, input().strip().split())) a =list(map(int, input().strip().split())) b =list(map(int, input().strip().split())) ans = 1 for i in range(n): c = a[i] - b[i] + 1 tmp = (( pow(p[i],b[i]...

0.624427

# coding: utf-8 # Your code here! import sys read = sys.stdin.read readline = sys.stdin.readline n, = list(map(int, readline().split())) p = [-1] + [*list(map(int, readline().split()))] MOD = 10**9+7 child = [[] for i in range(n+1)] tot = [None for i in range(n+1)] one = [None for i in range(n+1)] dep = [0]*(n+1) p2 ...

0.621479

P,a,I=998244353,1,input n=int(I()) d=list(map(int,I().split())) s=sum(d)%P for i in d:a=a*i%P for i in range(n,2*n-2):a=a*(s-i)%P print(a)

0.618542

def main(): p, k = list(map(int, input().split())) s = 1 m = pow(10,9)+7 if k == 0: s = pow(p,p-1,m) elif k == 1: s = pow(p,p,m) else: o = 1 n = k while n != 1: n = k*n %p o += 1 c = (p-1)//o s = pow(p,c,m) print(s%m) main()

0.614634

def diagonal(n, p): # your code res = 0 for base in range(p, max(n,p) + 1): value = 1 for i in range(base-p+1,base+1): value *= i for i in range(1,p+1): value //= i res += int(value) return res

0.613416

# cook your dish here def G(x, y): while(y): x, y = y, x % y return x # t=int(input()) # l=list(map(int,input().split())) for _ in range(int(input())): n,p=map(int,input().split()) c=0 for i in range(1,n+1): if G(i,p)==1: c+=1 ans=c*(c-1)//2 print(ans)

0.611833

p = 1000000007 n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) m = int(input()) d = [1] * 300001 td = [0] * 300001 L = b[0] for i in range(1, n): if a[i - 1] != 1: t = m % a[i - 1] if L < t: print(0) return m //= a[i - 1] for j in range((L - t) // a[i - 1] + 1):...

0.610389

from sys import stdin, stdout, exit mod = 10**9 + 7 def modinv(x): return pow(x, mod-2, mod) N = 2*10**5 + 10 facts = [1]*N for i in range(1,N): facts[i] = facts[i-1] * i facts[i] %= mod def binom(n, k): ans = modinv(facts[k]) * modinv(facts[n-k]) ans %= mod ans *= facts[n] ans %= mod ...

0.608171

base=998244353; def power(x, y): if(y==0): return 1 t=power(x, y//2) t=(t*t)%base if(y%2): t=(t*x)%base return t; def inverse(x): return power(x, base-2) f=[1] iv=[1] for i in range(1, 5555): f.append((f[i-1]*i)%base) iv.append(inverse(f[i])) def C(n, k): return (f[n]...

0.606836

from operator import mul from functools import reduce def cmb(n, r, p): if (r < 0) or (n < r): return 0 r = min(r, n - r) return fact[n] * factinv[r] * factinv[n-r] % p p = 10 ** 9 + 7 N = 10 ** 6 fact = [1, 1] # fact[n] = (n! mod p) factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p) inv ...

0.60651

T = int(input()) for _ in range(T): p,n=map(int,input().split()) mod = 1000000007 if p == 2: print(n) else: f=n t=n for i in range(p-2): f=(f%mod*n)%mod a=(f-t+mod)%mod t=a print(a)

0.604399

from math import ceil from bisect import bisect_right as b_r from bisect import bisect_left as b_l ar = list(map(int , input().split())) a = [int(ceil((ar[1]-int(x)+1)/ar[2])) for x in input().split()] s = sum(a) ar[1] = max(a) m = ar[1] - (s-ar[1])%2 mi = s%2 print(int( (m-mi)//2 +1)%(10**9+7))

0.603749

#q = int(input()) #x, y = map(int,input().split(' ')) #print (' '.join(list(map(str, s)))) def extended_gcd(aa, bb): lastremainder, remainder = abs(aa), abs(bb) x, lastx, y, lasty = 0, 1, 1, 0 while remainder: lastremainder, (quotient, remainder) = remainder, divmod(lastremainder, remainder) ...

0.602566

def multiple_input(): return map(int, input().split()) def list_input(): return list(map(int, input().split())) mod = int(1e9) + 7 for _ in range(int(input())): n, m = multiple_input() a = list_input() a.sort() max_level = a[-1] + 1 levels = [0] * max_level levels[0] = 1 for i in a: levels[i] += 1 ans = 1...

0.599174

p=10**9+7 import math def inv(k,p): prod=1 while k>1: prod*=(p//k+1) k=(k*(p//k+1))%p return prod%p n=int(input()) a=[] k=int(math.log2(n)) x=n while x>0: y=x//2 a.append(x-y) x=y c=[sum(a[i:]) for i in range(k+1)] b=[n//(3*2**i)-n//(6*2**i) for i in range(k+1)] d=[n//2**i-n//(3*...

0.598336

n, p, m = input().split() n = int(n) p = int(p) m = int(m) ans = 0 curb = 0 curd = 1 for i in range(0, n): #print(curb) tday, tplus = input().split() tday = int(tday) tplus = int(tplus) if curb < 0: ans += (tday - curd) curb -= p * (tday - curd) elif curb - p * (tday - curd) < 0...

0.597206

A = [0] * 100001 M = 1000000007 def nCk(n, k): if k ==0 or k ==n: return 1 r = (A[n-k]*A[k])%M x = (A[n]*pow(r, M-2, M))%M return x for _ in range(int(input())): n, k = list(map(int, input().split())) for i in range(n-1): u,v = input().split() summ = 0 A[0] = 1 for i in range(1, len(A)): A[i] = (i*A[i-...

0.59588

n, m = map(int, input().split()) t = sorted(map(int, input().split())) f, d = [1] * (n + 1), 1000000007 for i in range(2, n + 1): f[i] = (f[i - 1] * i) % d p, q = 0, (f[t[0] - 1] * f[n - t[-1]]) % d for i in range(m - 1): l = t[i + 1] - t[i] - 1 q = (q * f[l]) % d if l > 1: p += l - 1 print(pow(2, p, d) * f...

0.593971

#写経 #https://atcoder.jp/contests/abc168/submissions/13414936 from math import gcd from collections import Counter mod = 10**9 + 7 N,*AB = map(int,open(0).read().split()) def std(a,b): """ a,bを既約にする """ if a == 0: return(0,int(b!=0)) g = gcd(a,b) a,b = a// g, b//g return(a,b) if a > ...

0.593251

import math f = math.factorial for u in range(eval(input())): n, q = list(map(int, input().split())) for j in range(q): i,k = list(map(int, input().split())) if k>i: c=0 print(c) else: a=2**(n-i) b=1 d=int(i-1) e=1 h=1 g=1 #b=f(i-1)/f(k-1)/f(i-k) if(k-1>i-k): for z in range(i-k...

0.592251

mod = 10**9 + 7 n, h = map(int, input().split()) a = list(map(int, input().split())) dp = [[0 for j in range(h + 1)] for i in range (n + 1)] dp[0][0] = 1 for i in range(1, n + 1): need = h - a[i - 1] if need < 0: break if need == 0: dp[i][0] = dp[i - 1][0] else: dp[i][need] = (dp[i - 1][need] + dp[i - 1][need...

0.591472

import sys input = sys.stdin.readline n,m=map(int,input().split()) a=list(map(int,input().split())) b=list(map(int,input().split())) mod=998244353 sol=1 i=n-1 j=m-1 while sol>0 and j>=0: goal=b[j] s=0 r=False while i>=0 and a[i]>=goal: if r: s+=1 else: if a[i]==go...

0.591417

def main(): import sys input=sys.stdin.readline mod=998244353 N=10**5+3 fac=[1]*(N+1) for i in range(1,N+1): fac[i]=fac[i-1]*i%mod inv_fac=[1]*(N+1) inv_fac[N]=pow(fac[N],mod-2,mod) for i in range(N-1,0,-1): inv_fac[i]=inv_fac[i+1]*(i+1)%mod D=int(input()) A=[...

0.591258

x,y=map(int, input().split()) A=list(map(int, input().split())) B=list(map(int, input().split())) A,B=sorted(A)[::-1],sorted(B)[::-1] mod=10**9+7 X,Y=0,0 for i in range(x): d=A[i]*(x-i)-A[i]*(i)-A[i] X+=d X%=mod for i in range(y): d=B[i]*(y-i)-B[i]*(i)-B[i] Y+=d Y%=mod print(X*Y%mod)

0.589537

MOD = 1000000007 def f(n, cnt): """ n! / (n - cnt)! """ ans = 1 for _ in range(cnt): ans = (ans * n) % MOD n -= 1 return ans def main(): n, x, pos = list(map(int, input().split())) chk1 = 0 chk_r = 0 left = 0 right = n while left < right: middl...

0.586563

import math import operator as op from functools import reduce from operator import mul # or mul=lambda x,y:x*y from fractions import Fraction def nCk(n,k): return int( reduce(mul, (Fraction(n-i, i+1) for i in range(k)), 1) ) def ncr(n, r): r = min(r, n-r) if r == 0: return 1 numer = reduce(op.mu...

0.586481

from math import factorial def lol(n): if n == 1: yield [0] yield [1] else: for p in lol(n - 1): p.append(0) yield p p[-1] = 1 yield p p.pop() def sp(g1, g2, g3, f): if g1 == 0: if g2 == g3: return 2 ...

0.585356

n, k = [int(x) for x in input().strip().split(" ")] p = 10**9 + 7 num_list = [int(x) for x in input().strip().split(" ")] num_list = sorted(num_list, reverse = True) ans = 1 l_idx = 0 r_idx = -1 if num_list[0] < 0 and k % 2 == 1: for i in range(k): ans = (ans * num_list[i]) % p else: while True: if k >= ...

0.585289

f = 5003*[0] modn = 1000000007 def qPow(a, b): nonlocal modn res = 1 while b > 0: if (b & 1) == 1: res = res * a % modn a = a * a % modn b = b >> 1 return res def getF(): nonlocal f f[0] = 1 for i in range(1, 5001): f[i] = f[i-1] * i def __starting_point(): getF() T = int(input()) while T > 0...

0.584076

MOD = 1000000007 def isSubset(a, b): return (a & b) == a def isIntersect(a, b): return (a & b) != 0 # Solve for each weakly connected component (WCC) def cntOrder(s, t): p = len(s) m = len(t) inMask = [0 for i in range(m)] for x in range(p): for i in range(m): if t[i] % s[x] == 0: inMask[i] |= 1 ...

0.582384

fa = [1] m = 251 P = 10**9+7 for i in range(1, m+1): fa.append(fa[-1] * i % P) fainv = [pow(fa[m], P-2, P)] for i in range(1, m+1)[::-1]: fainv.append(fainv[-1] * i % P) fainv = fainv[::-1] def C(a, b): return fa[a] * fainv[a-b] * fainv[b] % P N, K = list(map(int, input().split())) poK = [1] for i in range(251): poK.a...

0.581844

import sys readline = sys.stdin.readline MOD = 998244353 N = int(readline()) wants = [tuple(map(int, readline().split()))[1:] for _ in range(N)] Q = [0]*(10**6+1) P = [0]*(10**6+1) for i in range(N): k = len(wants[i]) kinv = pow(k, MOD-2, MOD) for w in wants[i]: P[w] += 1 Q[w] = (Q[w] + k...

0.581814

class Solution: def maxArea(self, h: int, w: int, horizontalCuts: List[int], verticalCuts: List[int]) -> int: mod = int(1e9)+7 return ( ( self.getMax(horizontalCuts, h) % mod ) * ( self.getMax(verticalCuts, w) % mod ) ) % mod def getMax(self, cuts, size): if len(cuts) == 1: ...

0.580332

#http://codeforces.com/contest/958/problem/C1 N,p=list(map(int,input().split())) A=list(map(int,input().split())) sum1=A[0] sum2=sum(A[1:]) ans=(sum1%p)+(sum2%p) for i in range(1,N-1): sum1+=A[i] sum2-=A[i] ans1=sum1%p ans2=sum2%p ans=max(ans1+ans2,ans) print(ans)

0.580115

n, x = map(int, input().split()) a = [int(x) for x in input().split()] def solve(a, s): #print (a) a.append((-1, 0)) a.sort() b = [] for i in range(1, len(a)): if a[i][0] != a[i-1][0]: b.append(a[i]) else: b[-1] = (a[i][0], b[-1][1] + a[i][1]) for i in range(len(b)): t = b[i][1] ...

0.579919

n=int(input()) a = [0]*(n+1) for i in range(n-1): for i in input().split(): a[int(i)]+=1 l = a.count(1) print ((l*2**(n-l+1)+(n-l)*(2**(n-l)))%(10**9+7))

0.579828

import itertools import functools import operator N = 100001 P = 10**9 + 7 fact = [1] for i in range(1, N): fact.append(fact[-1] * i % P) inv = [0, 1] for i in range(2, N): inv.append(P - P // i * inv[P % i] % P) inv_fact = [1] for i in range(1, N): inv_fact.append(inv_fact[-1] * inv[i] % P) least_div = [-1] * N...

0.578771

def check(num1, num2, p, k): v = num1 + num2 v *= num1 * num1 + num2 * num2 v %= p v += p v %= p return v == k % p def __starting_point(): n, p, k = (int(x) for x in input().split()) idx___number = [int(x) for x in input().split()] idx___precount = [((pow(x, 4, p) - k * x) % p + p...

0.578487

p,q=list(map(int,input().split())) if(p!=0): a=list(map(int,input().split())) if(q!=0): b=list(map(int,input().split())) d=list(map(int,input().split())) s=list(map(int,input().split())) for i in range(10): c=0 for j in range(1,p+1): c+=s[len(s)-j]*a[j-1] for k in range(0,q): c+=b[k]*d[k]**(i+10) s.append(c%...

0.57819

import math n, k = [int(x) for x in input().split()] a = [int(x) for x in input().split()] b = [int(x) for x in input().split()] c = 1 for i in range(n // k): count = (10 ** k - 1) // a[i] + 1 mmin = b[i] * (10 ** (k-1)) mmax = (b[i] + 1) * (10 ** (k-1)) - 1 mcount = mmax // a[i] - math.ceil(mmin / a...

0.578113

n = int(input()) beauty = list(map(int, input().strip().split())) tree = [[] for i in range(n)] mod = 1000000007 used = [False for i in range(n)] def gcd(a,b): mn = min(a,b) mx = max(a,b) if mn == 0: return mx md = mx%mn if md == 0: return mn else: return gcd(mn, md) for ...

0.577916

3 import sys from functools import lru_cache MOD = 1000000007 cnk = [[1 for i in range(1001)] for j in range(1001)] for i in range(1, 1001): for j in range(1, i): cnk[i][j] = cnk[i - 1][j - 1] + cnk[i - 1][j] k = int(input()) cs = [int(input()) for i in range(k)] ans = 1 sm = 0 for c in cs: sm += ...

0.576914

a, b, p, x = [int(x) for x in input().split()] powers = [a] while powers[-1] != 1: powers.append(powers[-1] * a % p) order = len(powers) powers = [powers[-1]] + powers inverse = pow(order, p-2, p) def f(sol): return (x // (p * order)) + (1 if sol <= x % (p * order) else 0) def chinese(a, n, b, m): ...

0.576815

# cook your dish here import sys mod_val = 1000000007 rang = [0]*101 pow_cache = [0]*102 multisets = {} def mod_pow(base, pow): result = 1 while pow: if pow&1: result = (result*base) % mod_val base = (base*base) % mod_val pow = pow>>1 return result def precalculate(): for i in range(1, 102): pow_ca...

0.576377

import numpy as np n,s=map(int,input().split()) a=list(map(int,input().split())) mod=998244353 dp=np.zeros([n+1,s+1],int) dp[0][0]=1 for i in range(1,n+1): dp[i][:]=dp[i-1][:]*2 dp[i][a[i-1]:]+=dp[i-1][:-a[i-1]] dp[i][:]%=mod print(dp[n][s])

0.575511

import sys readline = sys.stdin.readline T = int(readline()) MOD = 998244353 Ans = [None]*T for qu in range(T): N, K = map(int, readline().split()) A = [0] + list(map(int, readline().split())) + [0] B = list(map(int, readline().split())) C = [None]*(N+1) for i in range(1, N+1): C[A[i]] = i...

0.574617

n, k = list(map(int, input().split())) MOD = 10**9+7 def fast_modinv(up_to, M): ''' Fast modular inverses of 1..up_to modulo M. ''' modinv = [-1 for _ in range(up_to + 1)] modinv[1] = 1 for x in range(2, up_to + 1): modinv[x] = (-(M//x) * modinv[M%x])%M return modinv maxn = 2*10**5 + 1...

0.574608

# fast io from sys import stdin _data = iter(stdin.read().split('\n')) input = lambda: next(_data) N = 101 MOD = 1000000007 def mul_vec_mat(v, a): c = [0] * N for i in range(N): c[i] = sum(a[j][i] * v[j] % MOD for j in range(N)) % MOD return c def mul_vec_sparse_mat(v, a): c = [0] * N for...

0.574475

from math import comb from math import pow class Solution: def numRollsToTarget(self, d: int, f: int, target: int) -> int: if(target < d*1 or target > d*f ): return 0 target = target - d sum = 0 i = 0 j=0 while(i <= target): y = ...

0.573988

def main(): f= [1] for i in range(1,1000002): f.append((f[-1] * i)%1000000007) n = int(input()) a = sorted(int(x) for x in input().split()) sol = 0 j = 0 s = 1 sq = 1 for i in range(n - 1): sq = sq * (n - i) % 1000000007 if a[i] != a[i + 1]: ...

0.573068

# https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/discuss/569521/7-python-approaches-with-Time-and-Space-analysis class Solution: def numWays(self, steps: int, arrLen: int) -> int: r = min(arrLen, steps // 2 + 1) dp = [0, 1] for t in range(steps): ...

0.572998

import sys from bisect import bisect_right as br input = sys.stdin.readline n, p = map(int, input().split()) a = list(map(int, input().split())) a.sort() table = [0] * (10 ** 5 + 1) for x in range(10 ** 5 + 1): r = br(a, x) table[x] = r res = [] #print(table[: 100]) for x in range(1, 2001): t = 1 q = x + 0 fo...

0.572957

mod = int(1e9 + 7) n, m = map(int, input().split()) f = [ [0 for i in range(60)] for j in range(60) ] g = [ [0 for i in range(60)] for j in range(60) ] s = [ [0 for i in range(60)] for j in range(60) ] inv = [ 1 ] f[0][0] = s[0][0] = 1 def pow(x, exp) : res = 1 for i in range(0, 31) : if exp & 1 : res ...

0.571205

fact = [] fact.append(1) for i in range(1,100001): fact.append((i*fact[i-1])%1000000007) def power(a,b,p): x=1 y=a while(b>0): if(b%2 == 1): x=(x*y) if(x>p): x=x%p y=(y*y) if(y>p): y=y%p b=b/2 return x def inverse(N,p): return power(N,p-2,p) def combination(N,R,p): return (fact[N]*((...

0.571008

P = 998244353 N, M = list(map(int, input().split())) A = [int(a) for a in input().split()] B = [int(a) for a in input().split()] li = sum([A[i]*B[i] for i in range(N)]) di = sum([(A[i]^1)*B[i] for i in range(N)]) X = [[] for _ in range(M+1)] X[0] = [1] def calc(L): su = sum(L) pl = 0 pd = 0 RE = [] ...

0.57097

import sys input = sys.stdin.readline n,m=list(map(int,input().split())) A=list(map(int,input().split())) C=list(map(int,input().split())) P=list(map(int,input().split())) DP=[[-1<<30]*(n+1) for i in range(5001)] # DP[k][cnt] = Aのmaxがkで, そういう人間がcnt人いるときのprofitの最大値 for i in range(5001): DP[i][0]=0 for i in range...

0.569836

m = 998244353 n = 5050 mi = [1] * n for i in range(2, n): mi[i] = (-(m//i) * mi[m%i]) % m; f = [1] * n g = [1] * n for i in range(2, n): f[i] = (f[i-1] * i) % m g[i] = (g[i-1] * mi[i]) % m def calc(x, y): s = 1 p = f[x] * f[y] for i in range(1, min(x, y)+1): den = g[i] * g[x-i] * g[y-i] s += p * den % m re...

0.568384

def slide_min(tl,ql,val): res=[0]*(tl-ql+1) q=[0]*tl s=0 t=0 for i in range(0,tl): while s<t and val[q[t-1]]>=val[i]: t-=1 q[t]=i t+=1 if (i-ql+1)>=0: res[i-ql+1]=val[q[s]] if q[s]==(i-ql+1): s+=1 return res def slide_min2(tl,ql,val): res=0 q=[0]*tl s=0 t...

0.567931

n,k=map(int,input().split()) L=list(map(int,input().split())) ind=[] for i in range(n): if L[i]>n-k:ind.append(i) m=1 for i in range(len(ind)-1): m*=(ind[i+1]-ind[i]) m%=998244353 print(((n*(n+1)//2)-((n-k)*((n-k)+1))//2),m)

0.567285

M=998244353 class Factorial: def __init__(self,n): self.f=f=[0]*(n+1) f[0]=b=1 for i in range(1,n+1):f[i]=b=b*i%M self.inv=inv=[0]*(n+1) inv[n]=b=pow(self.f[n],M-2,M) for i in range(n,0,-1):inv[i-1]=b=b*i%M def factorial(self,i): return self.f[i] def i...

0.567162

from sys import * from math import * mod = 1000000000 f = [0 for i in range(200)] f[0] = f[1] = 1 for i in range(2, 200): f[i] = f[i - 1] + f[i - 2] n, m = stdin.readline().split() n = int(n) m = int(m) a = list(map(int, stdin.readline().split())) for i in range(m): tp, x, y = stdin.readline().split() tp = int(t...

0.567155

class Solution: def countRoutes(self, locations: List[int], start: int, finish: int, fuel: int) -> int: n = len(locations) sloc = sorted([(x,i) for i,x in enumerate(locations)]) froutes = [[0]*n for _ in range(fuel+1) ] st,fn = -1,-1 for i in range(n): if sloc[i][...

0.567083

k = int(input()) MOD = 10 ** 9 + 7 antithree = pow(3, MOD - 2, MOD) antitwo = pow(2, MOD - 2, MOD) power = 1 parity = False for t in map(int, input().split()): power *= t power %= MOD - 1 if t % 2 == 0: parity = True q = pow(2, power, MOD) * antitwo q %= MOD if parity: p = (q + 1) * antithree ...

0.566342

a = input().split() n = int(a[0]) p = float(a[1]) t = int(a[2]) den = 100 ** t p = round(p * 100 + 1e-9) q = 100 - p ncr = [1 for i in range(2001)] for i in range(1, t + 1): ncr[i] = ncr[i - 1] * (t - i + 1) // i ans = 0 for i in range(2001): ans += min(i, n) * ncr[i] * (p ** i) * (q ** (t - i)) if t >=...

0.565902

from itertools import * k, p = list(map(int, input().split())) ss = 0 for i in range(1, k + 1): s = str(i) num = int(s + ''.join(reversed(s))) ss += num ss %= p print(ss)

0.56572

import sys x,y = list(map(int, input().strip().split())) if y % x != 0: print(0) return MOD = 10**9 + 7 K = y//x def multiply(A,b, MOD): n, m = len(A), len(b[0]) matrika = [[0 for _ in range(m)] for _ in range(n)] for i in range(n): for j in range(m): vsota = 0 f...

0.56547

from collections import defaultdict import sys input = sys.stdin.readline ''' for CASES in range(int(input())): n, m = map(int, input().split()) n = int(input()) A = list(map(int, input().split())) S = input().strip() sys.stdout.write(" ".join(map(str,ans))+"\n") ''' inf = 100000000000000000 # 1e17 mod = 998244353 n,...

0.564149

class Solution: def threeSumMulti(self, A: List[int], target: int) -> int: counter = collections.Counter(A) i, res, l, ckey = 0, 0, len(counter), sorted(list(counter.keys())) if target % 3 == 0: res += math.comb(counter[target // 3], 3) for i in range(l): ni =...

0.564099

# cook your dish here def permutation(n,p): r=26 if n==1: return 26 elif n==2: return 52 elif n==3: return 728 else: if n%2==0: return ((2*(bin_expo(r,((n//2)+1),p)-r)*bin_expo(25,1000000005,p)))%p else: n=n+1 return ((2*((b...

0.563976

from collections import defaultdict m = 1000000007 f = [0] * 15001 f[0] = 1 for i in range(1, 15001): f[i] = (f[i - 1] * i) % m def c(n, k): return (f[n] * pow((f[k] * f[n - k]) % m, m - 2, m)) % m def prime(n): m = int(n ** 0.5) + 1 t = [1] * (n + 1) for i in range(3, m): if t[i]: t[i * i :: 2 * ...

0.562211

mod=998244353 import sys input = sys.stdin.readline from collections import deque from collections import Counter def calc(s,a): return (pow(2,s,mod)+pow(2,a-s,mod))%mod def find(x): while Group[x] != x: x=Group[x] return x def Union(x,y): if find(x) != find(y): Group[find(y)]=Grou...

0.561185

def main(): import collections N, P = map(int, input().split()) S = input()[::-1] ans = 0 if P == 2 or P == 5: for i, s in enumerate(S): if int(s) % P == 0: ans += N - i else: mod = [0] * P mod[0] = 1 current = 0 X = 1 f...

0.560953

n, b, p = map(int, input().split()) answer1 = 0 answer2 = n while n > 1: k = 1 while k < n: k *= 2 answer1 += k * b + (k // 2) n = k // 2 + n - k print(answer1, answer2 * p)

0.560868

#dt = {} for i in x: dt[i] = dt.get(i,0)+1 import sys;input = sys.stdin.readline inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()] N = 100001 p = 998244353 factorialNumInverse = [0]*(N+1) naturalNumInverse = [0]*(N+1) fact = [0]*(N+1) def InverseofNumber(p): naturalNumInverse[...

0.560138

class Solution: def maxPerformance(self, n: int, speed: List[int], efficiency: List[int], k: int) -> int: mod = 10**9+7 order = sorted(range(n), key=lambda i: efficiency[i], reverse=True) heap = [] filled = 0 rec = 0 speed_sum = 0 for i in order: ...

0.558175

class Solution: def maxSumRangeQuery(self, nums: List[int], requests: List[List[int]]) -> int: count = [0] * (len(nums) + 1) for start, end in requests: count[start] += 1 count[end + 1] -= 1 for i in range(1, len(nums) + 1): count[i] += count[i - 1] count.pop() res = 0 for n...

0.557836

def main(): mod = 10**9+7 inv_n = [0]*1001 nCr = [[1]*(i+1) for i in range(1001)] for i in range(1001): inv_n[i] = pow(i, mod-2, mod) for i in range(2, 1001): for j in range(1, i): nCr[i][j] = (nCr[i-1][j-1]+nCr[i-1][j]) % mod n, a, b, c, d = list(map(int, input().spl...

0.557674

n,m,a=map(int,input().split()) b=list(map(int,input().split())) for i in range(m): if i==0: diffs=[b[0]] else: diffs.append(b[i]-b[i-1]) powers=[a%998244353] for i in range(30): powers.append(powers[-1]**2%998244353) def power(x,y,binpowers): prod=1 bits=bin(y)[2:] bits=bits[::-1...

0.557419

import sys def solve(): readline = sys.stdin.readline write = sys.stdout.write MOD = 998244353 N = int(readline()) P = [list(map(int, readline().split())) for i in range(N)] P.sort() Y = [y for x, y in P] def compress(X): *XS, = set(X) XS.sort() return list(ma...

0.557283

import math def egcd(a, b): if a == 0: return (b, 0, 1) else: g, y, x = egcd(b % a, a) return (g, x - (b // a) * y, y) def modin(a, m): g, x, y = egcd(a, m) return x % m # def gcdexten(a,b,x,y): # if a == 0: # x = 0 # y = 1 # return b # x1 = y1 = 0 # gcd = gcdexten(b%a,...

0.557095

import sys sys.setrecursionlimit(10 ** 7) input = sys.stdin.readline f_inf = float('inf') mod = 10 ** 9 + 7 class CmbMod: def __init__(self, n, p): """ 二項係数nCr(n個の区別できるものからr個のものを選ぶ組み合わせの数)をpで割った余りを求める """ self.n = n self.p = p self.fact = [1, 1] self.factin...

0.556981

import math p=7+10**9 n,k=list(map(int,input().split())) c=math.factorial(n+k-1)//((math.factorial(k))*(math.factorial(n-1))) print(c%p)

0.556524

class Solution: def minSubarray(self, nums: List[int], p: int) -> int: need = sum(nums) % p if need == 0: return 0 pos = {0: -1} total = 0 ans = float('inf') for i, num in enumerate(nums): total = (total + num) % p target = (total -...

0.556169

import os,sys from io import BytesIO, IOBase def ii(): return int(input()) def si(): return input() def mi(): return list(map(int,input().split())) def li(): return list(mi()) import math import collections def CountFrequency(arr): return collections.Counter(arr) for i in range(1): n,q=mi() p=pow(2,n+1)-2 ...

0.555785

from collections import defaultdict,deque import sys,heapq,bisect,math,itertools,string,queue,copy,time sys.setrecursionlimit(10**8) INF = float('inf') mod = 10**9+7 eps = 10**-7 def inp(): return int(sys.stdin.readline()) def inpl(): return list(map(int, sys.stdin.readline().split())) def inpl_str(): return list(sys.s...

0.555201

import sys import numpy as np sr = lambda: sys.stdin.readline().rstrip() ir = lambda: int(sr()) lr = lambda: list(map(int, sr().split())) MOD = 10 ** 9 + 7 N, K = lr() M = int(N**.5) # M+1以上で、Nを割るとxになるもの upper_cnt = np.zeros(M+1, dtype=np.int64) # 1-indexed A = np.arange(M+1, dtype=np.int64) upper_cnt[1:] = N // A[1...

0.554459

for _ in range(int(input())): N,M = list(map(int,input().split())) count,e,perm = 0,0,1 while(True): lim,start = N//(M**e),N//(M**(e + 1)) + 1 num = lim - start + 1 divs = num//M if((start + divs*M) <= lim): r = (start+divs*M)%M if(r == 0 or (r + (lim - (start + divs*M)) >= M)): divs += 1 cmon = ...

0.552479

Implement a basic calculator to evaluate a simple expression string. The expression string may contain open ( and closing parentheses ), the plus + or minus sign -, non-negative integers and empty spaces . Example 1: Input: "1 + 1" Output: 2 Example 2: Input: " 2-1 + 2 " Output: 3 Example 3: Input: "(1+(4+5...

class Solution: def calculate(self, s): """ :type s: str :rtype: int """ res = 0 num = 0 sign = 1 stk = [] for c in s: if c.isdigit(): num = 10 * num + (ord(c) - ord('0')) elif c == '+': ...

0.740655

class Solution: def calculate(self, s): """ :type s: str :rtype: int """ if not s: return 0 pre_op = '+' stack = [0] cur_num = 0 digits = '0123456789' s += '#' for c in s: ...

0.684016

import operator def calc(expr): OPERATORS = {'+': operator.add, '-': operator.sub, '*': operator.mul, '/': operator.truediv} stack = [0] for token in expr.split(" "): if token in OPERATORS: op2, op1 = stack.pop(), stack.pop() stack.append(OPERATORS[token](op1,op2)) e...

0.678164

def calculate(s): return str(sum(int(n) for n in s.replace("minus", "plus-").split("plus"))) # I heard here and there that using eval is a very bad practice… #return str(eval(s.replace("plus", "+").replace("minus", "-")))

0.678087

class Solution(object): def parse(self,expression,d,i): count = 0 start = i if expression[i] == "(": count += 1 i += 1 while count != 0: if expression[i] == "(": count += 1 elif expression[i] == ")": count -= 1 i += 1 val = self.evaluate(expression[start:i],d) el...

0.662113

import re ADDSUB, MULDIV = '+-', '*$' def calculate(expression): return "400: Bad request" if re.search(r'[^+*$\d.-]', expression) else parseAndEval(expression, ADDSUB) def parseAndEval(expression, ops): v = 0 for op,part in re.findall(r'([{0}])?([^{0}]+)'.format(ops), expression): if not op: ...

0.645516

def e(s):return f([*s,'+']) def f(s,r=0,o=0,x='',c=0): while s and')'!=c: c=s.pop(0);i='+-*/)('.find(c) if c=='-'>x or i<0:x+=c elif c=='(':x=str(f(s)) elif i>-1:a=float(x);r=[r+a,r-a,r*a,r/a][o];o=i;x='' return r

0.627434

import re class Solution: def calc(self, a, b, op): if op == '+': for k, v in b.items(): a[k] = a.get(k, 0) + v return a elif op == '-': for k, v in b.items(): a[k] = a.get(k, 0) - v return a eli...

0.609276

from math import inf class Node: def __init__(self, parent = None, leftExp = None, rightExp = None, signQ = 0): self.parent, self.leftExp, self.rightExp, self.signQ = parent, leftExp, rightExp, signQ def __str__(self): return "Node" memo = {} def Memoize(node, p, maxValue, minValue): if n...

0.607788

class Solution: def calPoints(self, ops): """ :type ops: List[str] :rtype: int """ sum = 0 for i in range (len(ops)): op = ops[i] if self.isInt(op): sum = sum + int(op) elif op == 'C': for ...

0.607228

def no_order(equation): equation = equation.replace(' ', '') equation = equation.replace('+', ')+') equation = equation.replace('-', ')-') equation = equation.replace('*', ')*') equation = equation.replace('/', ')//') equation = equation.replace('%', ')%') equation = equation.replace('^', ')...

0.604247

from functools import reduce from itertools import cycle from operator import add, truediv, mul, sub def do_math(s): xs = sorted(s.split(), key=lambda x: next(c for c in x if c.isalpha())) xs = [int(''.join(filter(str.isdigit, x))) for x in xs] ops = cycle([add, sub, mul, truediv]) return round(reduce...

0.59992

from functools import reduce def solve(st): res, s, k = [], "", 1 for ch in st: if ch == '(': res.append(k); k = 1 elif ch == ')': res.pop(); k = 1 elif ch == '-': k = -1 elif ch == '+': k = 1 else: s+= '-'+ch if (reduce(lambda a,b: a * b,res,1) * (1 if k == 1 else -1) <...

0.590576

import re def calculate_string(st): st = re.sub(r'[^-+*/\d.]', '', st) result = eval(st) return str(int(round(result)))

0.584435

op = {'+': 'Plus ','-': 'Minus ','*': 'Times ', '/': 'Divided By ', '**': 'To The Power Of ', '=': 'Equals ', '!=': 'Does Not Equal '} num = {'1': 'One', '2': 'Two', '3': 'Three', '4': 'Four', '5': 'Five', '6': 'Six', '7':'Seven', '8': 'Eight', '9': 'Nine', '10': 'Ten'} def expression_out(e): a, b, c = e.split...

0.57018

class Solution: def myAtoi(self, str): """ :type str: str :rtype: int """ base = "0123456789" plus = "+" minus = "-" sum = 0 flag = 1 bit = 0 INT_MAX = 2147483647 INT_MIN = -2147483648 if ...

0.567959

class Solution(object): loc=0 lastloc=-1 f='' def getNext(self,formular,locked=False): stype=0 # 0:null, 1:numeric, 2/20: Elem, 3: parenthesis ret=0 if self.loc==self.lastloc: return (0,0) i=self.loc while i <len(formular): if stype in (0,1) ...

0.560017

import copy s=input() l=len(s) ans=0 if l==1: ans+=int(s) print(ans) else: for i in range(2**(l-1)): t=copy.deepcopy(s) f=[] ch=0 for j in range(l-1): if ((i>>j)&1): t=t[:j+1+ch]+'+'+t[j+1+ch:] ch+=1 if '+' in t: y=list(map(int,t.split('+'))) ...

0.557709

def calculator(x, y, op): return eval(f'{x}{op}{y}') if type(x) == type(y) == int and str(op) in '+-*/' else 'unknown value'

0.55123

def calculate(s): x=[int(i) for i in s.split() if i.isdigit()] return sum(x) if 'gains' in s.split() else x[0]-x[1]

0.54559

res = 0 val = 0 sub = False for c in input()+'+': if c == '+' or c == '-': if sub: val *= -1 res += val val = 0 sub = (c == '-') val *= 10 val += ord(c) - ord('0') print(res)

0.544561

class Solution: def evalRPN(self, tokens): """ :type tokens: List[str] :rtype: int """ s = [] for token in tokens: if token == "+": a = int(s.pop()) b = int(s.pop()) s.append(a+b) elif token == "/": a = int(s.pop()) b = int(s.po...

0.543082

# """ # This is the interface that allows for creating nested lists. # You should not implement it, or speculate about its implementation # """ #class NestedInteger: # def __init__(self, value=None): # """ # If value is not specified, initializes an empty list. # Otherwise initializes a ...

0.538591

for _ in range(int(input())): s = list(input().strip()) i = 0 while i < len(s) - 1: if s[i].isalpha() or s[i] == ')': if s[i + 1].isdigit(): if i + 2 >= len(s) or s[i + 2] == ')': s = s[:i+1] + ['*', s[i+1]] + s[i+2:] else: s = s[:i+1] + ['*', s[i+1], '+'] + s[i+2:] i += 1 elif s[i + ...

0.534867

import re def sum_from_string(string): d = re.findall("\d+",string) return sum(int(i) for i in d)

0.534217

class Solution: def calc(self, part): part += "+" ## added tmp symbol in the end to sum last item within the loop start = x = n = 0 coeff = 1 for end, char in enumerate(part): # print("charIdx:", equation[end], "char: ", char, char == "+" or char == "-", "slice: ", ...

0.526968

from operator import add, sub, mul, truediv D = {'+':add, '-':sub, '*':mul, '/':truediv} def calculate(a, o, b): try: return D[o](a, b) except: pass

0.521519

from random import choice def interpret(code): code = [list(l) for l in code.split('\n')] x, y = 0, 0 dx, dy = 1, 0 output = '' stack = [] string_mode = False while True: move = 1 i = code[y][x] if string_mode: if i == '"': s...

0.518921

def to_postfix (infix): prec = {'+': 1, '-': 1, '*': 2, '/': 2, '^': 3, '(': 0} postfix = [] stack = [] for ch in infix: if ch in '0123456789': postfix.append(ch) elif ch in '(': stack.append(ch) elif ch in ')': while stack and stack[-1] != '('...

0.516229

# 10 # + 8 # + 9 # + 11 # + 6 # + 1 # ? 3 # - 8 # ? 3 # ? 8 # ? 11 MAX_BIT = 30 class Node: def __init__(self): self.left = None self.right = None self.leftCnt = 0 self.rightCnt = 0 def AddRight(self): if self.right == None: self.right = Node() ...

0.502034

class Solution: def scoreOfParentheses(self, S: str) -> int: ans, val = 0, 1 for i in range(len(S) - 1): if S[i: i+2] == '((': val *= 2 if S[i: i+2] == '()': ans += val if S[i: i+2] == '))': val //= 2 return ans

0.495981

import re def calculate(input): try: return eval(re.sub(r'(\d+)', lambda m: str(int(m.group(1))), input)) except: return False

0.495902

def sum_prod(strexpression): return "%.5e" %(eval(strexpression))

0.493143

def basic_op(operator, value1, value2): if operator=='+': return value1+value2 if operator=='-': return value1-value2 if operator=='/': return value1/value2 if operator=='*': return value1*value2

0.484302

def solve(s, idx): stack = [] for i, c in enumerate(s): if c == '(': stack += [i] if c == ')': if not stack: break if stack.pop() == idx: return i return -1

0.484147

import re s = input() ops = re.split('([+-])', s) assert len(ops) % 2 == 1 ops = ['+'] + ops total = 0 for i in range(0, len(ops), 2): if ops[i] == '+': total += int(ops[i+1]) elif ops[i] == '-': total -= int(ops[i+1]) else: assert False for b in bytes(str(total), 'ascii'): pr...

0.482848

# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right import re class Solution: def recoverFromPreorder(self, S: str) -> TreeNode: itera = re.finditer(r'(-*)(\\d+)', S) ...

0.48222

import re def sum_of_integers_in_string(s): return sum(int(x) for x in re.findall(r"(\d+)", s))

0.481762

def summy(string_of_ints): return sum(map(int,string_of_ints.split()))

0.480162

s = input() res = eval(s) n = len(s) for i in range(-1, n): if i == -1 or s[i] == '*': for j in range(i + 1, n + 1): if j == n or s[j] == '*': new_s = s[0:i + 1] + "(" + s[i + 1:j] + ")" + s[j:n] res = max(res, eval(new_s)) print(res)

0.47716

def solve(): s = input() pm = 0 cur = 0 ans = len(s) for i in range(len(s)): if s[i] == '+': cur += 1 else: cur -= 1 if cur < pm: pm = cur ans += i + 1 print(ans) t = int(input()) for _ in range(t): solve()

0.476038

def remove_parentheses(s): lvl,out = 0,[] for c in s: lvl += c=='(' if not lvl: out.append(c) lvl -= c==')' return ''.join(out)

0.4754

def solve(s): t = None while t != s: t, s = s, s.replace('()', '') return -1 if len(s) % 2 else sum(1 + (a == tuple(')(')) for a in zip(*[iter(s)] * 2))

0.471479

from collections import defaultdict import re P = re.compile(r'\+?(-?\d*)(x\^?)?(\d*)') def differentiate(eq, x): derivate = defaultdict(int) for coef,var,exp in P.findall(eq): exp = int(exp or var and '1' or '0') coef = int(coef!='-' and coef or coef and '-1' or '1') if...

0.470971

from operator import add, sub, mul, floordiv as div, and_, or_, xor OP = {'add':add, 'sub':sub, 'mul':mul, 'div':div, 'and':and_, 'or':or_, 'xor':xor} class Machine(object): def __init__(self, cpu): self.cpu = cpu def execute(self, instruction): cmd, a, b = (instruction.rep...

0.469805

def parse(data): value = 0 res=[] for c in data: if c=="i": value+=1 elif c=="d": value-=1 elif c=="s": value*=value elif c=="o": res.append(value) return res

0.468099

s = input() l = [int(x) for x in s.split('+')] l.sort() print('+'.join([str(x) for x in l]))

0.466538

def calculate(num1, operation, num2): # your code here try : return eval("{} {} {}".format(num1, operation, num2)) except (ZeroDivisionError, SyntaxError): return None

0.461062

def sum_it_up(a): return sum(int(*x) for x in a)

0.458425

def simplify(p): new_p=[(0,0)] new_str='' x=0 y=0 for i in p: if i == '<': x-=1 elif i == '>': x+=1 elif i == '^': y+=1 elif i == 'v': y-=1 if (x,y) not in new_p: new_p.append((x,y)) new_s...

0.458399

def find_longest(st): res,pos=0,[0] for i,b in enumerate(st,1): if b=="(": pos.append(i) else: try:pos.pop();res=max(res,i-pos[-1]) except:pos.append(i) return res

0.457783

def sum_str(a, b): return str(int(a or 0) + int(b or 0))

0.45649

TABLE = str.maketrans('0123456789','9876543210') def code(*args): return sum(map(lambda n:int(str(n).translate(TABLE)), args))

0.455359

# cook your dish here def value(a, b, c): if(c == '&'): return a&b elif(c == '^'): return a^b elif(c == '|'): return a|b def break_rules(n, operator): if(len(n) == 1): return n elif(len(n) == 2): return [value(n[0], n[1], operator[0])] else: cont_...

0.453052

def calculate(n1, n2, o): operators = { "add": (lambda x, y: x + y), "subtract": (lambda x, y: x - y), "multiply": (lambda x, y: x * y), } return "{:b}".format( operators[o]( int(n1, 2), int(n2, 2) ) )

0.449633

def countzero(s): return sum(1 if c in 'abdegopq069DOPQR' else 2 if c in '%&B8' else 0 for c in s.replace('()', '0'))

0.448644

class Solution: def isNumber(self, s): """ :type s: str :rtype: bool """ dot = False exp = False try: while s.startswith(' '): s = s[1:] while s.endswith(' '): s = s[:-1] ...

0.446649

def string_expansion(s): m,n = '',1 for j in s: if j.isdigit(): n = int(j) else: m += j*n return m

0.446204

class Solution: def minAddToMakeValid(self, S: str) -> int: if not S: return 0 stack = [] add = 0 for c in S: if c == '(': stack.append(c) elif c == ')': if stack: stack.pop() ...

0.445637

from itertools import product def operator_insertor(n): result = [] for ops in product(["+", "-", ""], repeat=8): expression = "".join(a+b for a, b in zip("123456789", list(ops) + [""])) res = eval(expression) if res == n: result.append(len(expression) - 9) ret...

0.445477

# cook your dish here s=input() i=0 l=len(s) orig='' st=[] flag=False while(i<l): if(s[i].isdigit()): num=int(s[i]) elif(s[i].isalpha()): if(flag==False): orig+=s[i] else:st.append(s[i]) elif(s[i]=='+'): flag=True st.clear() elif(s[i]==...

0.44456

words = {w: n for n, w in enumerate('zero one two three four five six seven eight nine ten eleven twelve thirteen fourteen fifteen sixteen seventeen eighteen nineteen'.split())} words.update({w: 10 * n for n, w in enumerate('twenty thirty forty fifty sixty seventy eighty ninety hundred'.split(), 2)}) thousands = {w: 10...

0.444429

one = int(input()) two = int(input()) element = input() if element == '/': print(one / two) elif element == '*': print(one * two) elif element == '-': print(one - two) elif element == '+': print(one + two)

0.442971

def arithmetic(a, b, operator): return { 'add': a + b, 'subtract': a - b, 'multiply': a * b, 'divide': a / b, }[operator]

0.43905

def sum_digits(number): return sum(map(int, str(abs(number))))

0.437564

import operator as o class v: def __init__(s,a,b): s.a,s.b=a,b def compute(s): return getattr(o,type(s).__name__)(s.a,s.b) class value(int): pass class add(v): pass class sub(v): pass class mul(v): pass class truediv(v): pass class mod(v): pass class pow(v): pass

0.436587

str = input() inpt = "" n = int(str) x = 0 for i in range(n): inpt = input() #print(inpt[0:2]+" - "+inpt[1:3]) if(inpt[0:2] == "++" or inpt[1:3] == "++"): x += 1 #print("x = {} plus 1".format(x)) elif(inpt[0:2] == "--" or inpt[1:3] == "--"): x -= 1 #print("x = {} minus 1".format(x)) print(x)

0.436048

a, o, b = input().split() if o == '+': print((int(a) + int(b))) else: print((int(a) - int(b)))

0.434908

def house_numbers_sum(inp): return sum(inp[:inp.index(0)])

0.433964

def golf_score_calculator(par, score): return sum(int(b) - int(a) for a, b in zip(par, score))

0.432493

#!/usr/bin/env python3 def ri(): return list(map(int, input().split())) m = 10**9+7 s = input() n = len(s) o = [0 for i in range(len(s))] c = [0 for i in range(len(s))] fac = [0 for i in range(n)] fac[0] = 1 for i in range(1,n): fac[i] = fac[i-1]*i%m invfac = [pow(fac[i], m-2, m) for i in range(n)] if s[0] ...

0.431576

s = input() suc = 0 p = 0 kde = 0 for i in range(len(s)): c = s[i] if c == '^': kde = i for i in range(len(s)): c = s[i] if '1' <= c <= '9': suc+=((kde-i)*int(c)) p+=1 if suc < 0: print("right") elif suc > 0: print("left") else: print("balance")

0.43144

def calc_type(a, b, res): return {a + b: "addition", a - b: "subtraction", a * b: "multiplication", a / b: "division"}[res]

0.430204

S=input() print((S.count('+')-S.count('-')))

0.430136

import re my_regexp = (r'(?P<sign>[+\-]?)' r'(?P<coeff>\d*)' r'x' r'(?:\^(?P<exp>\d+))?') as_int = lambda s: int(s) if s else 1 def derivative(eq): result = '' for monom in re.finditer(my_regexp, eq): sign, coeff, exp = monom.groups() coeff,exp = list(ma...

0.428709

def eval_object(v): return {"+": v['a']+v['b'], "-": v['a']-v['b'], "/": v['a']/v['b'], "*": v['a']*v['b'], "%": v['a']%v['b'], "**": v['a']**v['b'], }.get(v['operation'])

0.428095

n = int(input()) s = input() b = 0 for i in s: if i == '+': b += 1 else: b -= 1 b = max(b, 0) print(b)

0.427312

class Solution: def longestValidParentheses(self, s: str) -> int: memo ={} n =len(s) def dp(i): if i<=0: return 0 if i in memo: return memo[i] if (s[i-1],s[i])==('(',')'): memo[i]=dp(i-2)+2 elif (...

0.423866

from operator import mul from functools import reduce def find_middle(s): if not s or not isinstance(s,str): return -1 lstDig = [int(c) for c in s if c.isnumeric()] if not lstDig: return -1 prod = str( reduce(mul,lstDig) ) i = (len(prod) - 1) // 2 return int(prod[i:-i or len(prod)]...

0.42379

import sys def f(p): votes = {} for x in range(p): str = sys.stdin.readline() t = str.split() votes[t[0]] = t[1] ans = 0 for per in votes: if votes[per] == "+": ans= ans+1 else: ans = ans-1 return ans x = sys.stdin.readline() for t in range(int(x)): p = sys.stdin.readline...

0.423722

class Solution: def checkValidString(self, s): """ :type s: str :rtype: bool """ low, high = 0, 0 for c in s: if c == "(": low += 1 high += 1 elif c == ")": if low > 0: ...

0.423499

from sys import stdin def main(): cnt = [0] * 2 ** 18 t = str.maketrans("0123456789", "0101010101") _, *l = stdin.read().splitlines() for sign, s in map(str.split, l): if sign == '?': print(cnt[int(s, 2)]) else: cnt[int(s.translate(t), 2)] += 1 if sign == '+' el...

0.423492

def noonerize(numbers): try: num1 = int(str(numbers[1])[0] + str(numbers[0])[1:]) num2 = int(str(numbers[0])[0] + str(numbers[1])[1:]) except ValueError: return "invalid array" return abs(num1 - num2)

0.423394

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def sumNumbers(self, root): """ :type root: TreeNode :rtype: int """ def dfs(node, c...

0.423126

class Solution: def minRemoveToMakeValid(self, s: str) -> str: if not s: return s l=0 r=0 res='' for i,c in enumerate(s): if c=='(': l+=1 if c==')': if l==r: continue else: ...

0.421777

def valid_parentheses(string): cnt = 0 for char in string: if char == '(': cnt += 1 if char == ')': cnt -= 1 if cnt < 0: return False return True if cnt == 0 else False

0.420054

s = input() last = s.rfind('#') dif = s.count('(')-s.count(')')-s.count('#') try: assert dif >= 0 lev = 0 out = [] for i in range(len(s)): c = s[i] if c == '(': lev += 1 elif c == ')': lev -= 1 assert lev >= 0 elif c == '#': lev -= 1 ...

0.417046

def bowling_score(frames): rolls = list(frames.replace(' ','')) for i, hit in enumerate(rolls): if hit == 'X': rolls[i] = 10 elif hit == '/': rolls[i] = 10 - rolls[i - 1] else: rolls[i] = int(hit) score = 0 for i in range(10): frame = r...

0.416647

def my_parse_int(s): try: return int(s) except ValueError: return 'NaN'

0.415819

def palindrome(num): if not isinstance(num, int) or num < 0: return 'Not valid' s = str(num) return sum(sum(s[i:i+n] == s[i:i+n][::-1] for i in range(len(s)-n+1)) for n in range(2, len(s)+1))

0.414567

__, s = input(), input() a, n = 0, 0 pt = {'(': 1, ')': -1} for c in s: da = pt.get(c, 0) if a < 0 or a + da < 0: n += 1 a += da if a != 0: print(-1) else: print(n)

0.413716

class Solution: def decodeString(self, s): """ :type s: str :rtype: str """ stack = [] stack.append(["", 1]) num = "" for ch in s: if ch.isdigit(): num += ch elif ch == '[': stack.appen...

0.413715

def balanced_parens(n): return list(dfs([],0,0,n)) def dfs(s, open, close, maxP): if close==maxP: yield "".join(s) return if open > close: s.append(')') yield from dfs(s,open,close+1,maxP) s.pop() if open < maxP: s.append('(') yield from dfs...

0.413613

def reverse_in_parentheses(s): stack = [] for i in s: stack.append(i) if i == ')': opening = len(stack) - stack[::-1].index('(') - 1 stack.append(''.join([i[::-1].translate(str.maketrans('()',')(')) for i in stack[opening:][::-1]])) del stack[openin...

0.413415

from operator import add, mul, floordiv as fdiv, pow def poohbear(s): def updateMem(func, v): mem[p] = func(mem.get(p, 0), v) % 256 braces, stack = {}, [] for i,c in enumerate(s): if c == 'W': stack.append(i) if c == 'E': braces[i] = stack[-1] braces[stack.pop(...

0.412415

def largest_sum(s): return max(sum(map(int,x)) for x in s.split('0'))

0.412309

def get_derivative(s): if '^' in s: f,t = map(int, s.split('x^')) return '{}x'.format(f*t) if t==2 else '{}x^{}'.format(f*t, t-1) elif 'x' in s: return s[:-1] else: return '0'

0.411628

def simplify(n): output = [] exp = 0 while n: n, r = divmod(n, 10) if r: output.append(f"{r}*{10**exp}" if exp else f"{r}") exp += 1 return "+".join(output[::-1])

0.409413

n = int(input()) ls = [input() for _ in range(n)] balance = [[0, 0] for _ in range(n)] for i in range(n): for j in range(len(ls[i])): balance[i][0] = balance[i][0] + (1 if ls[i][j] == '(' else -1) balance[i][1] = min(balance[i][1], balance[i][0]) balance2 = [] for i in range(n): if balance[i][0] < 0: if ba...

0.408847

class Solution: def parseBoolExpr(self, expression: str) -> bool: if expression == 'f': return False if expression == 't': return True if expression[0] == '!': return not self.parseBoolExpr(expression[2:-1]) if expression[0] == '|': cur...

0.407644

import re def to_integer(s): if re.match("\A[+-]?(\d+|0b[01]+|0o[0-7]+|0x[0-9a-fA-F]+)\Z", s): return int(s, 10 if s[1:].isdigit() else 0)

0.40752

Given an array A of positive integers, A[i] represents the value of the i-th sightseeing spot, and two sightseeing spots i and j have distance j - i between them. The score of a pair (i < j) of sightseeing spots is (A[i] + A[j] + i - j) : the sum of the values of the sightseeing spots, minus the distance between them. ...

class Solution: def maxScoreSightseeingPair(self, A: List[int]) -> int: curmaxsight = A[0] - 1 curmaxpair = 0 for sight in A[1:]: if sight + curmaxsight > curmaxpair: curmaxpair = sight + curmaxsight if sight > curmaxsight: curmaxsight ...

0.697276

def calc(a): res = [0] * (len(a) + 1) for k in range(len(a)): res = [2 * max(a[i] + res[i+1], a[i+k] + res[i]) for i in range(len(a) - k)] return res[0]

0.746543

class Solution: def maxValueAfterReverse(self, nums: List[int]) -> int: n = len(nums) base = sum([abs(nums[i] - nums[i+1]) for i in range(n - 1)]) if (n <= 2): return base #best = base #for i in range(n-1): # for j in range(i+1, n): # ...

0.715187

import sys n = int(sys.stdin.readline()) a = [int(x) for x in sys.stdin.readline().split()] eps = 1e-12 def f(x): mx = a[0] - x tsmx = 0.0 mn = a[0] - x tsmn = 0.0 for ai in a: tsmx = max(tsmx + ai - x, ai - x) mx = max(tsmx, mx) tsmn = min(tsmn + ai - x, ai - x) mn...

0.70628

from sys import stdin, stdout INF = int(1e9) class Point: def __init__(self, x=0, y=0): self.x = x self.y = y def distance(p1, p2): x = p1.x - p2.x y = p1.y - p2.y return x*x + y*y def bruteForce(point_set, left, right): min_dist = INF for i in range(left, right): ...

0.699866

n = input() s = [] a = 0 for i in map(int, input().split()): while len(s) > 1 and min(s[-2], i)>=s[-1]: a += min(i, s[-2]) del(s[-1]) s.append(i) s.sort() print(a + sum(s[0: -2])) # Made By Mostafa_Khaled

0.699317

class Solution: def largestPerimeter(self, A: List[int]) -> int: A.sort(reverse=True) la=len(A) for i in range(la-2): if A[i]<A[i+1]+A[i+2]: return A[i]+A[i+1]+A[i+2] return 0

0.690152

from heapq import * def add_all(lst): heapify(lst) total = 0 while len(lst) > 1: s = heappop(lst) + heappop(lst) total += s heappush(lst, s) return total

0.688293

def maxval(arr): fn = [float('-inf')]*(len(arr)+1) sn = [float('-inf')]*len(arr) tn = [float('-inf')]*(len(arr)-1) fon = [float('-inf')]*(len(arr)-2) for i in reversed(list(range(len(arr)))): fn[i] = max(fn[i + 1], arr[i]) for i in reversed(list(range(len(arr) - 1))): sn[i] = max...

0.68503

from sys import stdin n = int(stdin.readline()) a = list(map(int,stdin.readline().split())) a = [0] + a ans = n dp = [float("inf")] * (n+1) dp[0] = 0 for i in range(1,n+1): nmin = float("inf") for j in range(i-1,-1,-1): if a[j] <= nmin: dp[i] = min(dp[i] , dp[j] + max(0,a[i]-a[j]) + (i-...

0.683274

import sys import itertools sys.setrecursionlimit(10 ** 8) ini = lambda: int(sys.stdin.readline()) inl = lambda: [int(x) for x in sys.stdin.readline().split()] ins = lambda: sys.stdin.readline().rstrip() debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw)) N = ini() A = inl() def...

0.682889

from heapq import heappop, heappush def comb(fruits): total, heap = 0, sorted(fruits) while len(heap) > 1: cost = heappop(heap) + heappop(heap) heappush(heap, cost) total += cost return total

0.680321

N = int(input()) A = list(map(int,input().split())) T = 0 for i in range(len(A)-1): if (A[i] > A[i + 1]): T += A[i] - A[i +1] A[i+1] = A[i] print(T)

0.680312

def solve(xs): m = 0 for x in sorted(xs): if x > m + 1: break m += x return m + 1

0.677493

n=int(input()) a=list(map(int,input().split())) tmp=0 ca=[0] for ai in a: tmp+=ai ca.append(tmp) from bisect import bisect_right,bisect_left ans=float('inf') # 数列をまず半分に区切る。左i個と右n-i個 2<=i,n-i f,g=1,3 for i in range(2,n-1): while abs(ca[i]-ca[f]-ca[f])>abs(ca[i]-ca[f+1]-ca[f+1]): f+=1 while abs((ca[-1]-ca[g]...

0.676333

class Solution: def deleteAndEarn(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums);#count is a dict [3,4,2]--> {2:1,3:1,4:1} prev = None; avoid = using = 0; for k in sorted(count): temp = ma...

0.674199

input() num = list(map(int, input().split())) maxn = 0 l, r = 0, len(num)-1 j1, j2 = num[l], num[r] while l < r: if j1 == j2: maxn = max(j1, maxn) l += 1 j1 += num[l] elif j1 < j2: l += 1 j1 += num[l] else: r -= 1 j2 += num[r] print(maxn)

0.673503

def dfs(i): if i >= 2 ** n: return 0, 0 x1, m1 = dfs(i * 2) x2, m2 = dfs(i * 2 + 1) if m1 + a[i * 2] < m2 + a[i * 2 + 1]: return x1 + x2 + m2 + a[i * 2 + 1] - m1 - a[i * 2], m2 + a[i * 2 + 1] return x1 + x2 + m1 + a[i * 2] - m2 - a[i * 2 + 1], m1 + a[i * 2] n = int(input()) a = [0, 0...

0.670364

import math n = int(input()) a=list(map(int,input().split())) dp = [0 for x in range(n)] dp[0] = a[0] dp[1] = a[1] dp[2] = a[2] for x in range(3,n): dp[x] = a[x] + min(dp[x-1],dp[x-2],dp[x-3]) print(min(dp[-3:]))

0.664672

N = int(input()) A = [int(s) for s in input().split(" ")] ABI = sorted(((a, i) for i, a in enumerate(A, 1)), reverse=True) prev = [0] for k, (a,i) in enumerate(ABI): curr = [0]*(k+2) for l in range(k+1): curr[l] = max(curr[l], prev[l]+abs(N-i-k+l)*a) curr[l+1] = prev[l]+abs(i-l-1)*a prev = curr pri...

0.660136

def sum_array(arr): if arr == None or len(arr) < 3: return 0 return sum(arr) - max(arr) - min(arr)

0.659682

n = int(input()) a = list(map(int, input().split())) lp,rp = [0 for i in range(n)],[0 for i in range(n)] lnr, rnr = [a[i] for i in range(n)],[a[i] for i in range(n)] mx = a[0] for i in range(1,n): if a[i] > mx: mx = a[i] lp[i] = lp[i-1] else: mx += 1 lp[i] = lp[i-1] + mx - a[i]...

0.659025

def solve(arr): p, q = 1, 1 for k in arr: x, y = max(k), min(k) a = p * x b = q * x c = p * y d = q * y p = max(a, b, c, d) q = min(a, b, c, d) return max(p, q)

0.655903

def calcdiff(listx): maxim = -1 for i in range(1, len(listx)): maxim = max(maxim, listx[i] - listx[i-1]) return maxim x = int(input()) t = list(map(int, input().split(' '))) maximx = 90000001 for i in range(1, x-1): maximx = min(maximx, calcdiff(t[:i] + t[i+1:])) print(maximx)

0.654477

n=int(input()) a=list(map(int,input().split())) print(n*max(a)-sum(a))

0.653992

n = int(input()) l = list(map(int,input().split())) curr = 0 best = 0 prevs = [0] * 31 for v in l: curr += v if v >= 0: for i in range(0, v): prevs[i] = curr for i in range(v, 31): best = max(curr - prevs[i] - i, best) else: for i in range(31): pr...

0.650322

import os import random import sys from typing import List, Dict class Int: def __init__(self, val): self.val = val def get(self): return self.val + 111 class Unique: def __init__(self): self.s = set() def add(self, val : int): self.s.add(val) def __contains__(s...

0.649326

from itertools import combinations def closest_sum(ints, num): return sum(min(combinations(ints, 3), key=lambda a: abs(num - sum(a))))

0.647893

n = int(input()) B = list(map(int, input().split())) pp = {} for i in range(n): if B[i] - (i + 1) not in pp: pp[B[i] - (i + 1)] = 0 pp[B[i] - (i + 1)] += B[i] ans = 0 for c in pp: ans = max(ans, pp[c]) print(ans)

0.64734

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.646488

def solve(xs): x, y, z = sorted(xs) return min(x + y, (x + y + z) // 2)

0.645589

def target_game(values): a = b = 0 for n in values: a, b = b, max(a + n, b) return max(a, b)

0.644464

from functools import * class Solution: def stoneGameII(self, arr): a =[] s=0 n = len(arr) for i in arr[::-1]: s+=i a.append(s) a=a[::-1] @lru_cache(None) def fun(i,m): if i+2*m>=n:return a[i] mn = inf ...

0.644283

class Solution: def minNumberOperations(self, target: List[int]) -> int: prev = -1 ans = 0 for num in target: if prev == -1: prev = num ans += num continue if num > prev: ans += (num - prev) #...

0.642723

def least_bribes(bribes): mem = {} def s(n1, n2): if n1 >= n2: return 0 if (n1, n2) in mem: return mem[n1, n2] r = min(bribes[i] + max(s(n1, i), s(i + 1, n2)) for i in range(n1, n2)) mem[n1, n2] = r return r return s(0, len(bribes))

0.64225

n = int(input()) a = [0] * n a = list(map(int, input().split())) for i in range(1, len(a)): a[i] += a[i - 1] ans = a[-1] for i in range(n - 2, 0, -1): ans = max(ans, a[i] - ans) print(ans)

0.641165

#taken from https://stackoverflow.com/questions/30698441/optimal-way-to-find-sums-of-all-contiguous-sub-arrays-max-difference def max_sums(d): stack = [(-1, float('inf'))] sum_ = 0 for i, x in enumerate(d): while x > stack[-1][1]: prev_i, prev_x = stack.pop() prev_prev_i, pr...

0.639681

class Solution: def minScoreTriangulation(self, A: List[int]) -> int: N = len(A) dp = [[0]*N for _ in range(N)] for i in range(N-2, -1, -1): for j in range(i+2, N): dp[i][j] = min(dp[i][k]+dp[k][j]+A[i]*A[j]*A[k] for k in range(i+1, j)) ...

0.638228

rr = lambda: input().strip() rri = lambda: int(rr()) rrm = lambda: list(map(int, rr().split())) def solve(N, A): ans = 0 prev = float('inf') for x in reversed(A): x = min(x, prev - 1) ans += max(x, 0) prev = x return ans for tc in range(1):#rri()): N = rri() A = rrm() ...

0.634116

# returns answer to the subproblem with interval range [start, end], # but with a total of "extra" additional stuff on the end # that must be deleted last. memo = {} def f(dat, rewards, start, end, extra): curr = (start, end, extra) if curr in memo: return memo[curr] if start > end: re...

0.63348

n=int(input()) l=list(map(int,input().split())) ans=l[0]+l[n-2] for i in range(n-2): ans+=min(l[i],l[i+1]) print(ans)

0.632957

class Solution: def maxSizeSlices(self, slices: List[int]) -> int: a,b,n=[slices[0]],[0],len(slices) for i in range(1,n): a.append(max(a[-1],slices[i])) b.append(max(b[-1],slices[i])) for i in range(2,2*n//3,2): aa,bb=[0]*(n-1),[0]*n for j in r...

0.632182

n = int(input()) a = list(map(int,input().split())) s = sum(a) for k in range(max(a), 999999): vote = sum(k-x for x in a) if vote > s: print(k); break

0.631739

#dt = {} for i in x: dt[i] = dt.get(i,0)+1 import sys;input = sys.stdin.readline #import io,os; input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline #for pypy inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()] from collections import deque def getmax(x,n,k): mx = [] dq = deq...

0.631222

# cook your dish here n=int(input()) l=list(map(int,input().split())) temp=[] for item in l: temp.append(item) if(n<=3): print(sum(temp)) else: for i in range(3,n): temp[i]=l[i]+min(temp[i-1],temp[i-2],temp[i-3]) res=sum(l)-min(temp[n-1],temp[n-2],temp[n-3]) print(res)

0.62954

def greatest_distance(arr): return max(i - arr.index(x) for i,x in enumerate(arr))

0.629104

# import collections, atexit, math, sys from functools import cmp_to_key #key=cmp_to_key(lambda x,y: 1 if x not in y else -1 ) sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) import bisect try : #raise ModuleNotFoundError import numpy def dprint(*args...

0.627699

#5:09 ''' nums = [3,6,5,1,8] sum_nums = 23 mod3_sum_nums = 2 mod3_dict = {0:[3,6], 1:[1], 2:[5,8]} helper([5,8], [1]) -> 5 ''' from collections import defaultdict class Solution: def helper(self, l1, l2): if len(l1) < 1 and len(l2) <2: sum_remove = 0 elif len(l1) < 1: s...

0.627339

n = int(input()) a = list(map(int, input().split())) a.sort() print(min(a[-1] - a[1], a[-2] - a[0]))

0.626109

class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ tmax_profit = 0 rmax_profits = [0] * len(prices) rmax = -1 for ii in range(len(prices)-2, -1, -1): if (prices[rmax] - prices[ii] > rmax_profi...

0.625826

import sys n=0; inp=[]; tree=[];#stores the index of min in range(i,j) def build(node,i,j): if(i>j): return; if(i==j): tree[node]=int(i); return; mid=int( (i+j)/2 ); build(2*node,i,mid) build(2*node+1,mid+1,j) if( inp[ tree[2*node] ] < inp[ tree[2*node+1] ] ): t...

0.625348

count = int(input()) array = list(map(int, input().split())) diff = array[0] - array[1] holds = True for index in range(1, len(array)-1): if array[index] - array[index+1] != diff: holds = False if holds: print(array[-1] - (array[-2] - array[-1])) else: print(array[-1])

0.624907

class Solution: def minMoves(self, nums): """ :type nums: List[int] :rtype: int """ minx=min(nums) sums=sum(nums) return sums-len(nums)*minx

0.623068

class Solution: def maxSubArray(self, nums): """ :type nums: List[int] :rtype: int """ # i = 0 # i_keep = 0 # j = 1 # j_keep = 1 # max_sum = nums[0]-1 # while j < len(nums) and i < j: # temp_sum = sum(nums[i:j]) ...

0.622777

n = int(input()) A = list(map(int, input().split())) A.sort(reverse=True) A2 = [A[0]] for a in A[1:]: A2.extend([a, a]) ans = 0 for a in A2[:n-1]: ans += a print(ans)

0.622494

class Solution: def minimumTotal(self, triangle): """ :type triangle: List[List[int]] :rtype: int """ length = len(triangle) for i in range(length - 1, 0, -1): for j in range(1, len(triangle[i])): if triangle[i][j] < triangle[i][j-...

0.621263

n = int(input()) *A, = list(map(int, input().split())) seq = [] cur = 1; cnt = 0 for a in A: if cur == a: cnt += 1 else: seq.append(cnt) cur = a; cnt = 1 if cnt > 0: seq.append(cnt) ans = max(seq) l = len(seq) dp = [[0]*4 for i in range(l+1)] for i in range(l): one = i % 2 #12 ...

0.621219

class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ n = len(prices) if n <=1: return 0 else: minprice = prices[0] res = 0 for i in range(1,n): if ...

0.620398

def largest_sum(arr): sum = max_sum = 0 for n in arr: sum = max(sum + n, 0) max_sum = max(sum, max_sum) return max_sum

0.62023

import sys from collections import defaultdict input = sys.stdin.readline sys.setrecursionlimit(1000000) arr=[int(x) for x in input().split()] if arr[0]==1: print(0) return p=[None] for i in range(1,arr[0]+1): p.append(arr[i]) a=[None] for i in range(arr[0]+1,2*arr[0]+1): a.appe...

0.619758

from operator import attrgetter, itemgetter n = int(input()); arr = [[int(x) for x in input().split(' ')] for y in range(n)]; arr = sorted(arr, key=itemgetter(1,0,2), reverse=True); dp = [0 for x in range(n)]; s = []; for i in range(n): while (s != [] and arr[s[-1]][0] >= arr[i][1]): s.pop(); if (s != []): dp[i] ...

0.619732

n = int(input()) w = list(map(int,input().split())) # s1とs2の差の絶対値をリスト化 difference_list = [] # １からｎまでリストに入れて、i番目までとi番目からの合計の差をscoreに代入 for i in range(n): score = abs(sum(w[:i])-sum(w[i:])) # scoreの値をdifference_listに追加 difference_list.append(score) # difference_listの最小値を出力 print(min(difference_list))

0.619731

import sys stdin=sys.stdin ip=lambda: int(sp()) fp=lambda: float(sp()) lp=lambda:list(map(int,stdin.readline().split())) sp=lambda:stdin.readline().rstrip() yp=lambda:print('Yes') np=lambda:print('No') n,a,b=lp() x=lp() ans=0 for i in range(n-1): ans+=min(b,a*(x[i+1]-x[i])) print(ans)

0.619578

from collections import defaultdict def fix_progression(arr): res = 0 for i in range(len(arr)): D = defaultdict(int) for j in range(i): q, r = divmod(arr[i]-arr[j], i-j) if not r: D[q] += 1 res = max(res, D[q]) return len(arr)-res-1

0.619075

from sys import maxsize # Function to find the maximum contiguous subarray # and print its starting and end index def maxSubArraySum(a,size): max_so_far = -maxsize - 1 max_ending_here = 0 start = 0 end = 0 s = 0 for i in range(0,size): max_ending_here += a[i] if max_so_far < max_ending_here: ma...

0.61772

#解説参照 a = list(map(int, input().split( ))) a.sort(reverse = True) ans = 0 ans += a[0]-a[1] a[1]+=ans a[2] += ans ans += (a[0]-a[2])//2 ans += ((a[0]-a[2])%2)*2###これ print(ans)

0.617286

n=int(input()) a=list(map(int,input().split())) a=sorted(a) if(n>65): print(sum(a)-n) elif(n==1 or n==2): print(a[0]-1) else: ans=10**20 for i in range(1,50000): now=1 ta=0 for j in a: ta+=abs(now-j) now*=i ans=min(ans,ta) print(ans)

0.617254

n = int(input()) a = list(map(int, input().split())) r = n-2 for d in a: r += d print(max(max(a), r//(n-1)))

0.615966

def max_tri_sum(numbers): return sum(sorted(set(numbers))[-3:])

0.614118

n = int(input()) A = list(map(int, input().split())) A.sort() prev = -1 res = 0 for x in A: if x > prev: prev = x else: prev = prev + 1 res += prev - x print(res)

0.613739

n = int(input()) l = list(map(int, input().split())) total = sum(l) gap = 0 for rod in l: gap = max(gap, rod - (total - rod)) print(gap + 1)

0.61372

def sum_of_regular_numbers(arr): res, value, save = 0, arr[1] - arr[0], arr[:2] for x,y in zip(arr[1:], arr[2:]): if y-x == value: save.append(y) else: if len(save) >= 3: res += sum(save) value, save = y-x, [x, y] if len(save) >= 3: res+= sum(save) ret...

0.612448

import sys read = sys.stdin.read readline = sys.stdin.readline readlines = sys.stdin.readlines sys.setrecursionlimit(10 ** 9) INF = 1 << 60 MOD = 1000000007 def main(): N, K, *X = list(map(int, read().split())) A = [abs(x - X[0]) for x in X] ans = INF for i in range(N - K + 1): if ans > min...

0.61244

def solve(arr): res = [] for first in (arr[0]-1, arr[0], arr[0]+1): for second in (arr[1]-1, arr[1], arr[1]+1): val, step, count = second, second-first, abs(arr[0]-first) + abs(arr[1]-second) for current in arr[2:]: val += step if abs(val-current) ...

0.612065

import sys num=int(sys.stdin.readline()) s=sys.stdin.readline().split() sky=list(map(int,s)) sky.reverse() cuts=0 change=0 t=False i=1 while i<len(sky): if sky[i]<=sky[i-1]: for j in range(i-1,-1,-1): if sky[j]<=sky[i]-(i-j): break else: change+=sky[j]-(sky[i]-(i-j)) if change>=sky[i]: ...

0.610942

import copy def solve(): n = int(input()) a = [int(c)-1 for c in input().split(' ')] nextcard = [[-1 for i in range(8)] for j in range(n)] for i in range(n-2, -1, -1): nextcard[i] = copy.copy(nextcard[i+1]) nextcard[i][a[i+1]] = i+1 jump = [[-1 for i in range(n+1)] for j in range(...

0.61066

import sys import math def solve(): k, n = list(map(int, input().split())) D = {} for line in sys.stdin: s, a = line.split() if s in D: D[s].append(int(a)) else: D[s] = [int(a)] res = 0 center = 0 for s in D: revs = s[::-1] if not...

0.610215

#python33 def program(): a=[] t=0 n=int(input()) for i in range(n): a.append(int(input())) t=a[0]+1 for j in range(1,len(a)): t+=abs(a[j]-a[j-1])+2 print (t) program()

0.610034

def main(): input() l = list(map(int, input().split())) n = max(l) aa = [0] * (n + 1) for x in l: aa[x] += 1 f, x = [0] * n, 0 for a in reversed(aa): x += a f.append(x) f.reverse() res = [] for i, a in enumerate(aa): if a: tot, a = 0, f...

0.609359

import heapq n = int(input()) d = list(map(int,input().split())) pq = [-d[0]] heapq.heapify(pq) ans = 0 for i in range(1,n): temp = i - d[i] heapq.heappush(pq,temp) if heapq.nsmallest(1,pq)[0] < temp: ans += temp - heapq.nsmallest(1,pq)[0] heapq.heappushpop(pq,temp) print(ans)

0.608162

n = int(input()) a = [[], []] a[0] = list(map(int, input().split())) a[1] = list(map(int, input().split())) b = list(map(int, input().split())) ans = float('+inf') for i in range(n): for j in range(n): if i == j: continue cur = sum(a[1][i:]) + sum(a[0][:i]) + sum(a[0][:j]) + sum(a[1][j:]) + b[i] + b[j] ans =...

0.607587

class Solution: def maxWidthRamp(self, A: List[int]) -> int: width = 0 icandidate = [0] for i in range(len(A)): if A[i] < A[icandidate[-1]]: icandidate.append(i) for j in range(len(A) - 1, -1, -1): while icandidate and A[icandidate[-1]] <= A[j]...

0.607577

class Solution: def maxProfit(self, prices): profits = 0 ln = len(prices) if not ln: return 0 elif ln == 2: return (prices[1]-prices[0]) if prices[1] > prices[0] else 0 lastPrice = prices[0] for price in prices: if lastPr...

0.605534

n=int(input()) ar=list(map(int,input().split())) dp=[0]*n dp[0]=ar[0] dp[1]=ar[1] for i in range(2,n): dp[i]=min(dp[i-2],dp[i-1])+ar[i] ar.reverse() #print(ar) dp1=[0]*n dp1[0]=ar[0] dp1[1]=ar[1] for i in range(2,n): dp1[i]=min(dp1[i-2],dp1[i-1])+ar[i] print(min(dp[-1],dp1[-1]))

0.605294

from collections import Counter class Solution: def longestArithSeqLength(self, A: List[int]) -> int: c = dict(Counter(A).most_common()) # print(c) m1 = max(c.values()) # A = list(set(A)) # A.sort() index = {} # for i in range(len(A)): # index[A[i]...

0.605008

# https://leetcode.com/problems/maximum-of-absolute-value-expression/discuss/340075/c%2B%2B-beats-100-(both-time-and-memory)-with-algorithm-and-image class Solution: def maxAbsValExpr(self, arr1: List[int], arr2: List[int]) -> int: N = len(arr1) a = [arr1[i] + arr2[i] + i for i in range(N)] ...

0.604999

from functools import lru_cache class Solution: def tallestBillboard(self, rods: List[int]) -> int: rods = sorted(rods)[::-1] n = len(rods) psum = rods.copy() for i in range(n-1)[::-1]: psum[i] += psum[i+1] @lru_cache(None) def dfs(idx, diff): ...

0.604426

A=list(map(int,input().split())) A.sort(reverse=True) print((A[0]-A[2]))

0.602221

n = int(input()) t = [list(map(int, input().split())) for q in range(n)] t[0][0] = 0 n += 1 u = [-1e7] * n v = [0] * n for i, (j, a) in list(enumerate(t, 1))[::-1]: u[i] = max(u[i], v[i] + a) v[j], u[j] = max(v[j] + v[i], u[j] + u[i]), max(v[j] + u[i], u[j] + v[i]) print(u[1])

0.601838

def main(): import sys import numpy as np def input(): return sys.stdin.readline().rstrip() n = int(input()) a = list(map(int, input().split())) inf = 1e18 k = n%2 + 1 dp = np.full((n+1, k+2), -inf, dtype=int) dp[0,0] = 0 for i in range(n): for j in range(k+1): ...

0.600145

class Solution: def rob(self, nums): """ :type nums: List[int] :rtype: int """ if not nums: return 0 if len(nums)==1: return nums[0] return max(self.helper(nums[1:]), self.helper(nums[:-1])) def helper(self,nums...

0.599702

3 # Copyright (C) 2017 Sayutin Dmitry. # # This program is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License as # published by the Free Software Foundation; version 3 # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY;...

0.599594

class Solution: def lastStoneWeight(self, stones: List[int]) -> int: while True: if len(stones) == 1: return stones[0] if len(stones) == 0: return 0 stones.sort() x = stones.pop() y = stones.pop() if y !=...

0.598032

q=list(map(int,input().split())) a=[] s=[] for i in range(0,q[0]): s+=[min(list(map(int,input().split())))] print(max(s))

0.59729

class Solution: def minDifference(self, nums: List[int]) -> int: if len(nums) <= 4: return 0 else: # nums = sorted(nums) nums.sort() threeZero = nums[-1] - nums[3] twoOne = nums[-2] - nums[2] oneTwo = nums[-3] - nums[1] ...

0.597282

class Solution: def minStartValue(self, nums: List[int]) -> int: res = 1 for ind,n in enumerate(nums): temp = 1-sum(nums[:ind+1]) if(temp > res): res = temp return res

0.596768

def sum_of_intervals(intervals): s, top = 0, float("-inf") for a,b in sorted(intervals): if top < a: top = a if top < b: s, top = s+b-top, b return s

0.596558

class Solution: def maxSatisfaction(self, satisfaction: List[int]) -> int: satisfaction.sort() total, res = 0,0 while satisfaction and satisfaction[-1]+total > 0: total += satisfaction.pop() res += total return res

0.596437

from math import * n, a = map(int, input().split()) A = list(map(int, input().split())) A.sort() if n == 1: print(0) else: if a > A[-1]: print(abs(a - A[1])) elif a < A[0]: print(abs(a - A[-2])) else: per1 = abs(A[0] - A[-2]) per2 = abs(A[1] - A[-1]) ans1 = a...

0.596142

class Solution: def findLHS(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums) ret = 0 for i in count: if i+1 in count: ret = max(ret, count[i]+count[i+1]) return ret...

0.595715

class Solution: def lastStoneWeightII(self, stones: List[int]) -> int: dp = {0} total = sum(stones) for stone in stones: dp |= {_sum + stone for _sum in dp} return min(abs(total - _sum - _sum) for _sum in dp)

0.593369

A program was supposed to print an array of integers. The program forgot to print whitespaces and the array is printed as a string of digits and all we know is that all integers in the array were in the range [1, k] and there are no leading zeros in the array. Given the string s and the integer k. There can be multiple...

class Solution: def numberOfArrays(self, s: str, k: int) -> int: dp = [-1] * len(s) return self.dfs(s, k, 0, dp) def dfs(self, s: str, k: int, start: int, dp: List[int]) -> int: if start == len(s): return 1 if s[start] == '0': return 0 if dp[s...

0.84229

mas = [[] for i in range(1001)] mas[0].append(1) mas[0].append(1) for i in range(1, 1000): mas[i].append(1) for j in range(1, i): mas[i].append((mas[i - 1][j] + mas[i - 1][j - 1]) % (10 ** 9 + 7)) mas[i].append(1) def c(k, n): if k > n: return 0 if k < 0: return 0 nonlo...

0.746092

import sys sys.setrecursionlimit(10000) n = input() k = int(input()) m = {} def doit(n, k): if len(n) == 0: return k == 0 d = int(n[0]) if (n, k) not in m: ret = 0 for i in range(d + 1): if i == d: ret += doit(n[1:], k - 1 if i > 0 else k) e...

0.693622

from itertools import permutations def solve(s,k): return sum(not v%k for v in map(int, map(''.join, permutations(s.split(),2))))

0.693256

a = input() k = int(input()) n = len(a) ans = 0 MOD = 10 ** 9 + 7 m = 1 - pow(2, n * k, MOD) m *= pow(1 - pow(2, n, MOD), MOD - 2, MOD) m %= MOD for i in range(n - 1, -1, -1): if a[i] == '0' or a[i] == '5': ans += (m * pow(2, i, MOD)) % MOD ans = ans % MOD if ans < 0: ans += MOD print(ans)

0.676274

n, k = map(int, input().split()) t = list(map(int, input())) p, d = 1, 10 ** 9 + 7 s, f = 0, [1] * n for i in range(2, n): f[i] = (i * f[i - 1]) % d c = lambda a, b: 0 if a > b else (f[b] * pow(f[a] * f[b - a], d - 2, d)) % d if k: u = [0] * (n + 1) p = [1] * (n + 1) for i in range(n): u[i] = (p[i] ...

0.672136

MOD = 1000000007 def main(): opts = [0] * 64 for i in range(64): for j in range(64): opts[i & j] += 1 s = input() n = len(s) ans = 1 for c in s: if '0' <= c <= '9': ans *= opts[ord(c) - ord('0')] ans %= MOD elif 'A' <= c <= 'Z': ...

0.662456

inp = input().split() n = int(inp[0]) k = int(inp[1]) a = input().split() for i in range(n): a[i] = int(a[i]) # End of Input bank = {} # Preparation for i in range(n): arg = (len(str(a[i])),a[i]%k) #print("Detect:",arg) bank[arg] = bank.get(arg,0)+1 ans = 0 # Query for i in range(n): ten = 1 ...

0.657894

# cook your dish here # cook your dish here def numDec(s): if not s: return 0 dp = [0 for _ in range(len(s) + 1)] dp[0] = 1 dp[1] = 0 if s[0] == '0' else 1 for i in range(2, len(dp)): if s[i-1] != '0': dp[i] += dp[i-1] two_digit = int(s[i-2 : i]) if two_digit >= 10 and two_digit <= 26: ...

0.655486

class Solution: def numWays(self, s: str) -> int: n = s.count('1') if n % 3 != 0: return 0 if n == 0: return (((len(s) - 1) * (len(s) - 2)) // 2) % (10**9 + 7) m = n // 3 L = s.split('1') return ((len(L[m]) + 1) * (len(L[2*m]) + 1)) % (10**9 + 7)

0.654392

MOD = 10**9 + 7 s = str(input()) dp0 = [0] * (len(s)+1) dp1 = [0] * (len(s)+1) dp0[0] = 1 for i in range(1,len(s)+1): if s[i-1] == "0": dp0[i] = dp0[i-1] dp1[i] = dp1[i-1] * 3 else: dp0[i] = dp0[i-1] * 2 dp1[i] = dp0[i-1] + dp1[i-1] * 3 dp0[i] %= MOD dp1[i] %= MOD ans...

0.649678

from math import log2, ceil MOD = int(1e9 + 7) srt = lambda s: ''.join(sorted(s)) for _ in range(int(input())): s = srt(input()) res = -1 for p in range(ceil(log2(int(s))), int(log2(int(s[::-1]))) + 1): if int(srt(str(pow(2, p)))) == int(s): if res == -1: res = 0 res...

0.645954

class Solution: def numSub(self, s: str) -> int: # 10/6/20 dic = collections.defaultdict(int) n = len(s) left, right = 0, 0 while left < n: if s[left] == '1': right = left while right < n and s[right] == '1': ...

0.6443

import sys from collections import defaultdict from copy import copy MOD = 10**9 + 7 R = lambda t = int: t(input()) RL = lambda t = int: [t(x) for x in input().split()] RLL = lambda n, t = int: [RL(t) for _ in range(n)] # primes up to n def primes(n): P = [] n = int(n) U = [1] * (n+1) p = 2 ...

0.637882

from math import factorial MOD = 10**9+7 k = int(input()) bink = list(map(int, bin(k)[2:])) N = len(bink) # dp[i][j][k] = first i bits, j bases, # k = 1 if maxor matches k, 0 else dp = [[[0,0] for j in range(i+2)] for i in range(N+1)] dp[0][0][1] = 1 for i in range(1, N+1): for j in range(i+1): # k = 0 ...

0.632219

import math def egcd(a, b): if a == 0: return (b, 0, 1) else: g, y, x = egcd(b % a, a) return (g, x - (b // a) * y, y) def modin(a, m): g, x, y = egcd(a, m) return x % m # def gcdexten(a,b,x,y): # if a == 0: # x = 0 # y = 1 # return b # x1 = y1 = 0 # gcd = gcdexten(b%a,...

0.631796

n=input() rg=[0]*10 for i in n: rg[int(i)]+=1 rl=[] ff=0 for i in range(len(rg)): if rg[i]!=0: rl.append(rg[i]) if i==0: ff=1 fact=[1] fc=1 for i in range(1,20): fc*=i fact.append(fc) rt=[] t=0 def cfs(d): if d==len(rl): nonlocal t,ff jj=fact[sum(rt)] for i in rt:...

0.627406

l, r, k =list(map(int,input().split())) d = {i:2**i for i in range(10)} cache = {} def can(i, m): return d[i] & m def calc(m): b = 1 c = 0 for i in range(10): if b & m: c += 1 b *= 2 return c def sm(ln, k, m, s='', first=False): if ln < 1: return 0, 1...

0.62633

import sys input = sys.stdin.readline from fractions import gcd import numpy as np MOD = 10 ** 9 + 7 S = int(input()) M = 10**4 def type_1(S): cnt = 0 # S 2種の桁数k,k+1からなる。さらにk>=9を仮定する。 # 項数nとすると、kn < S < (k+1)n となる(k,n)の個数を数える # まずk > Mとなるものを数える。このとき1<=n<=Mである。 n = np.arange(1,M+1) k_max = (...

0.622826

mod = 998244353 f0 = [ [0 for i in range(11)] for j in range(2010) ] f1 = [ [0 for i in range(11)] for j in range(2010) ] fac = [0 for i in range(2010)] tab = [0 for i in range(11)] C = [ [0 for i in range(2010)] for j in range(2010) ] def Init() : fac[0] = 1 for i in range(2010) : if i > 0 : fac[i] = ...

0.621551

s=input();M=10**9+7;o=u=v=0;n=len(s) for i in range(n):c=int(s[i]);u+=v;v=(10*v+c)%M;o+=pow(10,n-i-1,M)*((i*i+i)//2*c+u) print(o%M)

0.618673

class Solution: dp = [[1] * 10] def knightDialer(self, n: int) -> int: MOD = 10 ** 9 + 7 jump = [[4, 6], [6, 8], [7, 9], [4, 8], [3, 9, 0], [], [0, 1, 7], [2, 6], [1, 3], [2, 4]] for i in range(len(self.dp), n): new = [0] * 10 for j in range(10): n...

0.617942

p = 10 ** 9 + 7 n, b, k, x = [int(s) for s in input().split()] block = [int(s) for s in input().split()] D = [0 for i in range(10)] for s in block: D[s] += 1 A = [[0 for t in range(x)]] pows = [pow(10, 1<<j, x) for j in range(b.bit_length())] for i in range(10): A[0][i%x] += D[i] for j in range(b.bit_length()-1...

0.614579

# cook your dish here from collections import Counter from math import factorial for _ in range(int(input())): s=input() c=Counter(s) k=factorial(len(s)) for value in c.values(): if value>1: k=k//factorial(value) print(k%(10**9+7))

0.613617

def main(): N, K = list(map(int, input().split())) S = list(input()) base = S[0] flag = False for i in range(0, N): if K == 0: break if S[i] != base and (not flag): flag = True S[i] = base elif S[i] != base and flag: S[i] = base...

0.612207

def check(s,k): for i in range(k+1): if chr(ord('0')+i) not in s: return False return True n, k = map(int,input().split()) ans = 0 for i in range(n): ss = input() if check(ss,k): ans +=1 print(ans)

0.610741

s = input() L = input() k = int(input()) '''from datetime import * time1 = datetime.now()''' good = set() string = set() LIST = [chr(i) for i in range(97,123)] for i in range(26): if L[i]=='1': good.add(LIST[i]) t = [s[i] not in good for i in range(len(s))] end = [0]*len(s) badchars = 0 front=0; rear=0 w...

0.610534

from scipy.special import comb def almost_everywhere_zero(n, k): if k == 0: return 1 first, *rest = str(n) l = len(rest) return 9**k*comb(l, k, exact=True) +\ (int(first)-1)*9**(k-1)*comb(l, k-1, exact=True) +\ almost_everywhere_zero(int("".join(rest) or 0), k-1)

0.610284

def __starting_point(): a=[int(x) for x in input().split()] N=a[0] A=a[1] B=a[2] K=a[3] s=input() mod = 1000000009 Q = pow(B*pow(A,mod-2,mod)%mod,K,mod) if Q!=1: D = (pow(Q,(N+1)//K,mod)-1)*pow(Q-1,mod-2,mod)%mod else: D = (N+1)//K ans=0 C = pow(A,N,mod) A=pow(A,mod-2,mod) for i in range(K): if s[i]...

0.610233

Mod=1000000007 s=input() n=len(s) a,b,c,d=1,0,0,0 for i in range(0,n): if s[i]=='*': a,b,c,d=0,(a+b+d)%Mod,0,0 elif s[i]=='?': a,b,c,d=(a+b+c)%Mod,(a+b+d)%Mod,0,0 elif s[i]=='0': a,b,c,d=0,0,(a+c)%Mod,0 elif s[i]=='1': a,b,c,d=0,0,b,(a+c)%Mod else: a,b,c,d=0,0...

0.60989

MOD = 10**9+7 s = input() n = int(input()) qs = [['',s]]+[input().split('->') for i in range(n)] ds = {} for i in range(10): ds[str(i)] = (10,i) for i in range(n,-1,-1): out = 0 mul = 1 for d in qs[i][1]: out = (out * ds[d][0] + ds[d][1]) % MOD mul = (mul * ds[d][0]) % MOD ds[qs[i...

0.609521

3 import sys from functools import lru_cache MOD = 1000000007 cnk = [[1 for i in range(1001)] for j in range(1001)] for i in range(1, 1001): for j in range(1, i): cnk[i][j] = cnk[i - 1][j - 1] + cnk[i - 1][j] k = int(input()) cs = [int(input()) for i in range(k)] ans = 1 sm = 0 for c in cs: sm += ...

0.602282

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools import time,random sys.setrecursionlimit(10**7) inf = 10**20 eps = 1.0 / 10**10 mod = 10**9+7 mod2 = 998244353 dd = [(-1,0),(0,1),(1,0),(0,-1)] ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)] def LI(): return lis...

0.601841

from functools import reduce def comb(n, max_k, mod): """ (n,k) := n個からk個選ぶ組み合わせ k = 0~max_Kまでを計算して返す """ res = [1]*(max_k+1) t = 1 for i in range(max_k+1): res[i] *= t t *= n-i t %= mod n = reduce(lambda x,y: (x*y)%mod, range(1,max_k+1), 1) n = pow(n,-1, mod...

0.599383

class Solution: def distinctSubseqII(self, s: str) -> int: n = len(s) MOD = 10**9 + 7 seen = dict() a = 1 for i in range(n): char = s[i] b = 2 * a if char in seen: b -= seen[char] b %= MOD ...

0.59845

import math class ProductOfNumbers: def __init__(self): self.numbers = [1] self.lastZero = 0 def add(self, num: int) -> None: if num != 0: self.numbers.append(self.numbers[-1] * num) else: self.numbers = [1] def getProduct(self, k: int)...

0.59813

from sys import stdin, stdout, exit mod = 998244353 n = int(stdin.readline()) a = list(map(int, stdin.readline().split())) ans = 0 def l(x): if x == 0: return 0 return 1 + l(x//10) lens = [0]*15 for x in a: lens[l(x)] += 1 def space_out(x, l): ans = [] for i,c in enumerate(reversed(str...

0.597501

x, k = map(int, input().split()) if x == 0: print(0) else: mod = 10 ** 9 + 7 p = pow(2, k, mod) ans = (x * (p * 2) - (p - 1)) % mod print(ans)

0.596873

def dlog(x, n): bigMod = 5 ** n ans = [None, 0, 1, 3, 2][x % 5] val = 2 ** ans % bigMod mod, phi = 5, 4 phiVal = 2 ** phi % bigMod for i in range(2, n + 1): nextMod = mod * 5 while val % nextMod != x % nextMod: val = val * phiVal % bigMod ans += phi phi *= 5 phiVal = (phiVal * ...

0.594385

import sys readline = sys.stdin.readline MOD = 10**9+7 S = readline().strip().split('1') if len(S) == 1: print(len(S[0])) else: S = [len(s)+1 for s in S] ans = S[0]*S[-1] S = S[1:-1] dp = [0]*(max(S)+2) dp[0] = 1 for ai in S: res = 0 rz = 0 for i in range(ai+1):...

0.593216

fact = [] fact.append(1) for i in range(1,100001): fact.append((i*fact[i-1])%1000000007) def power(a,b,p): x=1 y=a while(b>0): if(b%2 == 1): x=(x*y) if(x>p): x=x%p y=(y*y) if(y>p): y=y%p b=b/2 return x def inverse(N,p): return power(N,p-2,p) def combination(N,R,p): return (fact[N]*((...

0.592807

import sys def solve(): n,k, = rv() a, = rl(1) res = 0 count = [0] * 10 for i in range(n): if a[i] < 100: count[10 - (a[i] % 10) - 1] += 1 res += a[i] // 10 for i in range(10): while count[i] > 0 and k >= i + 1: res += 1 count[i] -= 1 ...

0.592429

n = int(input()) t = input() if n == 1: if t == "0": print((10 ** 10)) else: print((2 * 10 ** 10)) elif n == 2: if t == "00": print((0)) elif t == "01": print((10 ** 10 - 1)) elif t == "10": print((10 ** 10)) else: # 11 print((10 ** 10)) else: ...

0.592374

k = int(input()) n = input() digit = [0]*10 for c in n: digit[int(c)]+= 1 dsum = sum(i*digit[i] for i in range(10)) i = 0 change = 0 while dsum < k: if digit[i] == 0: i+= 1 continue digit[i]-= 1 digit[9]+= 1 change+= 1 dsum+= 9-i print(change)

0.592245

s=input()[::-1] alist=[0]*2019 num1=0 num2=1/10 lens=len(s) for i in range(lens): num2=int(((num2)*10)%2019) num1=(num1+int(s[i])*(num2))%2019 alist[num1]+=1 alist[0]+=1 ans=0 for i in range(2019): ans+=alist[i]*(alist[i]-1)//2 print(ans)

0.59092

n = int(input()) mod = 10**9 + 7 all09 = ((2 * 10**n) % mod - (2 * 9**n) % mod) % mod of09 = ((10**n) % mod - 8**n % mod) % mod print((all09-of09)%mod)

0.590641

s=input() ans=0 i=1 past=int(s[0]) c=1 ans=1 while(i<len(s)): if(int(s[i])+past==9): c+=1 past=int(s[i]) else: if(c%2==1 and c!=1): ans*=(c//2+1) c=1 past=int(s[i]) i+=1 if(c!=1 and c%2==1): ans*=(c//2+1) print(ans)

0.590135

#!/usr/bin/env python3 def addmod(left, right, modulo=1000000007): res = left + right if res >= modulo: res -= modulo return res def counter(a, m, d): res = [0, ] * (2*m) res[0] = 1 shift = 1 for pos in range(len(a), 0, -1): ptype = pos & 1 cur = int(a[pos-1]) ...

0.590051

for _ in range(int(input())): n=int(input()) n1=0 ans=1 while(n>0): d=int(n % 10) if(d!=0): if(d!=9 and d!=7 and d!=1): n1=3 elif(d==1): n1=1 else: n1=4 ans=(int(ans)*int(n1))% (1000000007) n/=10 else: n/=10 if(ans==1): print("0") else: print(ans %(1000000007))

0.589513

# cook your dish here from collections import deque, defaultdict from math import sqrt, ceil,factorial import sys import copy def get_array(): return list(map(int, sys.stdin.readline().strip().split())) def get_ints(): return map(int, sys.stdin.readline().strip().split()) def input(): return sys.stdin.readline()...

0.588822

for _ in range(int(input())): string = input().rstrip() start=(ord(string[0])-96)*100 sum=0 #print(start) for i in range(len(string)): sum+=start+(ord(string[i])-97) print(sum%1000000007)

0.586347

# cook your dish here from collections import Counter def solve(arr, n, k): ans = 0 dict1 = {} mod = 1000000007 for i in range(n): if arr[i] in dict1: dict1[arr[i]] += 1 else: dict1[arr[i]] = 1 l1 = [0]+list(dict1.keys()) v = min(k, len(l1)) dp = [[0 for _ in range(v+1)]for _ in range(len(l1))] dp[...

0.585795

import sys mod = 10**9 + 7 for _ in range(int(input())): x = int(input()) s = list(map(int, input())) ans = len(s) for i in range(1, x+1): ans = (i + (ans-i) * s[i-1]) % mod r = len(s) for _ in range(s[i-1]-1): if len(s) < x: s += s[i:r] e...

0.585252

#cook your recipe from math import factorial test_cases = int(input()) for _ in range(test_cases): n = int(input()) sum1 = 0 final_sum = 0 num = list(map(int, input().split())) rep_time = factorial(n - 1) rep_count = dict() for i in num: if i in rep_count: rep_count[i] +=1 else...

0.585053

class Solution: def kConcatenationMaxSum(self, arr: List[int], k: int) -> int: oneArrSum = sum(arr) twoArr = arr + arr def findMaxSub(array): if len(array) == 1: return array[0] cur = 0 small = 0 ret = -999...

0.584629

#include<sdg.h> for _ in range(int(input())): s=input() n=len(s) if n==1: if s[0].isalpha(): print("-32") else: print(0) else: num,ch=0,0 p,q=0,0 c=1 x=s[0] ans="" for i in range(1,n): if s[i-1]==s[i]: c+=1 ...

0.584603

class Solution: def getLengthOfOptimalCompression(self, s: str, k: int) -> int: n = len(s) def compLen(c): return 1 + len(str(c)) if c > 1 else 1 @lru_cache(None) def dp(i, k): # return {head: (len, -head_count)} if (n - i) <= k: return {} # ...

0.584396

from operator import mul from math import factorial from functools import reduce from collections import Counter def perms(inp): return factorial(len(str(inp))) // reduce(mul, map(factorial, Counter(str(inp)).values()), 1)

0.58398

def main(): import collections N, P = map(int, input().split()) S = input()[::-1] ans = 0 if P == 2 or P == 5: for i, s in enumerate(S): if int(s) % P == 0: ans += N - i else: mod = [0] * P mod[0] = 1 current = 0 X = 1 f...

0.580797

class Solution: def minInteger(self, num: str, k: int) -> str: n=len(num) if k<=0: return num if k>n*(n-1)//2: return ''.join(sorted(list(num))) for i in range(10): idx = num.find(str(i)) if idx>=0 and idx<=k: ...

0.58051

M = 10 ** 9 + 7 for _ in range(int(input())): s,p,m,r = list(map(int, input())),0,1,0 for d in reversed(s): p += d * m m = m * 10 % M for d in s: r = (r * m + p) % M p = (p * 10 - (m - 1) * d) % M print(r)

0.579304

from collections import defaultdict k = int(input()) d = defaultdict(list) for i in range(10): d[(1, i)].append(i) mx = 10 pw = 1 for digs in range(2, mx): pw *= 10 for sm in range(11): for curr in range(10): for num in d[(digs-1, sm-curr)]: d[(digs, sm)].append( curr*...

0.579215

import fractions import sys f = sys.stdin if len(sys.argv) > 1: f = open(sys.argv[1], "rt") sum_cache = {} def sum_func(x): if x < 10: return x r = sum_cache.get(x) if r is not None: return r xx = 0 while x > 0: xx += x % 10 x /= 10 r = sum_func(xx) ...

0.578925

vow = ['a', 'e', 'i','o', 'u'] for _ in range(int(input())): name = str(input()) tmp = '' for i in range(len(name)): if name[i] not in vow and name[i].isalpha(): tmp+='1' elif name[i] in vow and name[i].isalpha(): tmp+='0' print( int(tmp, 2)% (10**9 + 7))

0.577029

s = input().split() k = int(s[1]) s = s[0] if s.count('0') < k: if s.count('0') > 0: print(len(s) - 1) else: print(len(s)) return have = 0 its = 0 for i in range(len(s) - 1, -1, -1): its += 1 if s[i] == '0': have += 1 if have == k: print(its - have) return

0.576689

__author__ = 'Prateek' MOD = int(10**9+7) def test(): n,k=list(map(int,input().split())) l = k d =n-1 ans = l-1 ans = ans%MOD a = k-n term = (d+a)//d ll = (a%MOD - (((term-1)%MOD)*(d%MOD))%MOD)%MOD if ll < 0: ll = (ll +MOD)%MOD m = ((term%MOD)*((a%MOD+ll%MOD)%MOD))%MOD m = (m*pow(2,MOD-2,MOD))%MOD ans +...

0.576656

T = 1 for test_no in range(T): MAXK = 5000 n = int(input()) cnt = [0] * (MAXK + 1) primeExponential = [[0 for j in range(MAXK + 1)] for i in range(MAXK + 1)] line, num = (input() + ' '), 0 for c in line: if c != ' ': num = num * 10 + (ord(c) - 48) else: cnt[num] += 1 num = 0 for i in range(2, MAXK + ...

0.575414

import sys import numpy as np sr = lambda: sys.stdin.readline().rstrip() ir = lambda: int(sr()) lr = lambda: list(map(int, sr().split())) MOD = 10 ** 9 + 7 N, K = lr() M = int(N**.5) # M+1以上で、Nを割るとxになるもの upper_cnt = np.zeros(M+1, dtype=np.int64) # 1-indexed A = np.arange(M+1, dtype=np.int64) upper_cnt[1:] = N // A[1...

0.574625

class Solution: def numPermsDISequence(self, S): dp = [1] * (len(S) + 1) for a, b in zip('I' + S, S): dp = list(itertools.accumulate(dp[:-1] if a == b else dp[-1:0:-1])) return dp[0] % (10**9 + 7)

0.574403

def check(num1, num2, p, k): v = num1 + num2 v *= num1 * num1 + num2 * num2 v %= p v += p v %= p return v == k % p def __starting_point(): n, p, k = (int(x) for x in input().split()) idx___number = [int(x) for x in input().split()] idx___precount = [((pow(x, 4, p) - k * x) % p + p...

0.574023

import sys INF = 10**20 MOD = 10**9 + 7 I = lambda:list(map(int,input().split())) from math import gcd from math import ceil from collections import defaultdict as dd, Counter from bisect import bisect_left as bl, bisect_right as br def solve(): n, k = I() s = input() ans = 0 last = -INF for i in range(n): ...

0.573451

def solve(st, k): length = len(st) - k return max(int(st[i:i + length]) for i in range(k + 1))

0.572437

n, k = list(map(int, input().split())) m = 0x3b9aca07 v = 500000004 r = 0 p = pow(2, n, m) a = [1] + [0] * k for i in range(k): for j in range(i, -1, -1): a[j + 1] += a[j] a[j] = a[j] * j % m for i in range(k + 1): r = (r + p * a[i]) % m p = p * v * (n - i) % m print(r)

0.572159

n = int(input()) k = input() amount = 0 for elem in k: amount += 1 if elem == '0': break print(amount)

0.571181

# cook your dish here mod = 1000000009 import math K = int(input()) N = 2 ** K temp1 = N//2 fact = math.factorial((N/2-1))%mod div = ((fact **2) * temp1)*N%mod temp2 = 1 for i in range(1,N+1): if i < N/2: print("0") else: print(div) div = (((div * pow(temp2,mod-2,mod))%mod)*temp1)%mod ...

0.571118

f = 5003*[0] modn = 1000000007 def qPow(a, b): nonlocal modn res = 1 while b > 0: if (b & 1) == 1: res = res * a % modn a = a * a % modn b = b >> 1 return res def getF(): nonlocal f f[0] = 1 for i in range(1, 5001): f[i] = f[i-1] * i def __starting_point(): getF() T = int(input()) while T > 0...

0.571098

s=input() n=len(s) a=[] curr=0 for i in range(n): if s[i]=="a": curr+=1 elif s[i]=="b": a.append(curr) curr=0 if curr>0: a.append(curr) prod=1 for i in range(len(a)): prod*=(a[i]+1) prod=prod%1000000007 print(prod-1)

0.56983

from math import sqrt, ceil MAX_N = 10 ** 6 * 2 prime = [] isPrime = [True for i in range(MAX_N)] for i in range(2, MAX_N): if isPrime[i]: prime.append(i) for j in range(i * i, MAX_N, i): isPrime[j] = False def factor(a): divs = [] for i in prime: cnt = 0 w...

0.568952

class Solution: def removeKdigits(self, num, k): """ :type num: str :type k: int :rtype: str """ out=[] for digit in num: while k and out and out[-1] > digit: out.pop() k-=1 out.append(digit) ...

0.567861

from functools import lru_cache N, K = list(map(int, input().split())) P = 998244353 A = [K+100] + [int(a) for a in input().split()] + [K+j for j in range(1, 10)] # A = [K+100] + [1, 2] + [-1 for a in range(N-4)] + [3,4]+ [K+j for j in range(1, 10)] X = [[0,0] for _ in range(N//2+5)] X[0][0] = 1 for i in range(1, N//2...

0.567523

n=int(input()) s=input() pw=[1] last=1 for i in range(70): if (last>1e19): break pw.append(last*n) last=last*n dp=[1e19]*100 for i in range(100): dp[i]=[1e19]*100 dp[len(s)][0]=0 for i in range(len(s),-1,-1): for power in range(0,len(pw)): cur='' for j in range(i-1,-1,-1): ...

0.567412

import math import sys input = sys.stdin.readline def main(): MAX_N = int(1e6) + 1 dp = [0 for i in range(MAX_N)] vals = [[] for i in range(10)] for i in range(10): dp[i] = i vals[i].append(i) for i in range(10, MAX_N): prod = 1 for j in str(i): i...

0.566907

M = 10 ** 9 + 7 def solve1(x): n = len(x) x = int(x, 2) ans = 0 for a in range(2 ** n): for c in range(2 ** n): b = a ^ x d = c ^ x if a < c and b > d: ans += 1 return ans % M def solve2(x): return int(x, 2) * pow(2, (len(x) - 1), M) %...

0.566492

# cook your dish here def getAns(num): if num<10:return 2 last=int(str(num)[0]);rem=int(str(num)[1:]);steps=2;p=len(str(num))-1 while True: steps+=rem//last+1;rem=rem%last if last>0:rem=rem+10**p-last last=last-1 if last==0: p=p-1;last=9 if(len(str(rem))==1):rem=0 els...

0.565296

class Solution: def hasAllCodes(self, s: str, k: int) -> bool: if len(s) < 2 ** k + k - 1: return False # Cannot be a string, as this is the de brujin length target = 2 ** k seen = set() cur_len = 0 for end in range(k, len(s) + 1): chunk = s[end - k: e...

0.564037

from collections import deque K=int(input()) INF=10**9 res=[INF]*(K) res[1]=1 q=deque() q.append(1) while q: r=q.popleft() if r==0: break nr=(r+1)%K if res[r]<res[nr]: res[nr]=res[r]+1 q.append(nr) nr=(10*r)%K if res[r]<res[nr]: res[nr]=res[r] q.appendle...

0.563559

import sys input = sys.stdin.readline for _ in range(int(input())): a, k = list(map(int, input().split())) for _ in range(k - 1): if '0' in str(a): break a += int(min(list(str(a)))) * int(max(list(str(a)))) print(a)

0.563145

from math import factorial from string import digits, ascii_uppercase DIGITS = digits + ascii_uppercase FACTORIALS = [1, 1] f = 1 for i in range(2, 36): f *= i FACTORIALS.append(f) def dec2FactString(nb): ret = [] for f in reversed(FACTORIALS): (d, nb) = divmod(nb, f) if d or ret: ...

0.562413

import itertools def cal(N, target_num, keta): answer = float('inf') for p in itertools.product(target_num, repeat=keta): temp = 0 for i, num in enumerate(p): temp += num * 10**i if temp >= N: answer = min(answer, temp) return answer def __star...

0.562171

s = input() m = int(input()) mn = m ttt = 0 t = 0 ttt = 1 for i in range(1,len(s)): ttt = (ttt * 10) % m for i in range(0,len(s)): t = (t * 10 + ord(s[i]) - ord('0')) % m for i in range(0,len(s)): if s[i] != '0': mn = min(mn,t) t = t - (((ord(s[i])- ord('0')) * ttt) % m) if t < 0: t ...

0.562101

import math n, k = [int(x) for x in input().split()] a = [int(x) for x in input().split()] b = [int(x) for x in input().split()] c = 1 for i in range(n // k): count = (10 ** k - 1) // a[i] + 1 mmin = b[i] * (10 ** (k-1)) mmax = (b[i] + 1) * (10 ** (k-1)) - 1 mcount = mmax // a[i] - math.ceil(mmin / a...

0.561669

class Solution: def smallestRepunitDivByK(self, K: int) -> int: if K % 2 == 0 or K % 5 == 0: return -1 r = 0 for N in range(1, K + 1): r = (r * 10 + 1) % K if not r: return N

0.560685

class Solution: def numDecodings(self, s): """ :type s: str :rtype: int """ if not s: return 0 def num_decode(i): # Number of ways to decode s[i:] if i == len(s): return 1 ...

0.560501

def main(): s = input() n = len(s) t = int(str(int(s[0]) + 1) + '0' * (n - 1)) print(t - int(s)) main()

0.560009

def norm(x): return (x % 998244353 + 998244353) % 998244353 n, k = map(int, input().split()) dp1 = [0] dp2 = [0] for i in range(n): l = [1] cur = 0 for j in range(n + 1): cur += l[j] if(j > i): cur -= l[j - i - 1] cur = norm(cur) l.append(cur) dp1.appen...

0.559855

class Solution: def decodeAtIndex(self, S: str, K: int) -> str: size = 0 # Find size = length of decoded string for c in S: if c.isdigit(): size *= int(c) else: size += 1 for c in reversed(S): K %= size i...

0.558829

lucky = {4, 774, 7, 744, 777, 74, 747, 44, 77, 47, 474, 444, 477, 447} from functools import lru_cache import sys sys.setrecursionlimit(10 ** 6) mod = 10 ** 9 + 7 fact = [1] for i in range(1, 1001): fact.append(fact[-1] * i % mod) inv = [pow(i, mod-2, mod) for i in fact] C = lambda k, n: fact[n] * inv[n-k] * inv[k...

0.558642

t=int(input()) MOD=(10**9)+7 l=['a','e','i','o','u'] for i in range(t): s=input() k=[] for j in s: if j in l: k.append(1) else: k.append(0) r=bin(int(''.join(map(str, k)), 2) << 1) print((int(r,2)//2)%MOD)

0.558566

n, k = map(int, input().split()) t = list(map(int, input().split())) if k == 1: print(len(set(t))) else: p = [set() for i in range(30)] for i in t: j = 0 while i % k == 0: i //= k j += 1 p[j].add(i) for j in range(1, 30): p[j] -= p[j - 1] print(sum...

0.558303

tb=str(input()) tb=list(tb) if("c" in tb or "k" in tb): print(0) else: ans=1 i=0 while(i<len(tb)): if(tb[i]=="g" or tb[i]=="f"): my=tb[i] i+=1 ct=1 while(i<len(tb) and tb[i]==my): ct+=1 i+=1 if(ct>3): ct+=1 ans*=ct else: i+=1 print(ans)

0.557195

try: n , k = list(map(int,input().split())) for i in range(k): if n % 10 == 0: n = n/10 else: n -= 1 print(int(n)) except: pass

0.556708

You are given a string expression representing a Lisp-like expression to return the integer value of. The syntax for these expressions is given as follows. An expression is either an integer, a let-expression, an add-expression, a mult-expression, or an assigned variable. Expressions always evaluate to a single inte...

class Solution(object): def parse(self,expression,d,i): count = 0 start = i if expression[i] == "(": count += 1 i += 1 while count != 0: if expression[i] == "(": count += 1 elif expression[i] == ")": count -= 1 i += 1 val = self.evaluate(expression[start:i],d) el...

0.752108

class Solution: def calculate(self, s): """ :type s: str :rtype: int """ res = 0 num = 0 sign = 1 stk = [] for c in s: if c.isdigit(): num = 10 * num + (ord(c) - ord('0')) elif c == '+': ...

0.604179

from functools import reduce from itertools import cycle from operator import add, truediv, mul, sub def do_math(s): xs = sorted(s.split(), key=lambda x: next(c for c in x if c.isalpha())) xs = [int(''.join(filter(str.isdigit, x))) for x in xs] ops = cycle([add, sub, mul, truediv]) return round(reduce...

0.602424

class Solution: def calculate(self, s): """ :type s: str :rtype: int """ if not s: return 0 pre_op = '+' stack = [0] cur_num = 0 digits = '0123456789' s += '#' for c in s: ...

0.594948

import operator def calc(expr): OPERATORS = {'+': operator.add, '-': operator.sub, '*': operator.mul, '/': operator.truediv} stack = [0] for token in expr.split(" "): if token in OPERATORS: op2, op1 = stack.pop(), stack.pop() stack.append(OPERATORS[token](op1,op2)) e...

0.594088

import re ADDSUB, MULDIV = '+-', '*$' def calculate(expression): return "400: Bad request" if re.search(r'[^+*$\d.-]', expression) else parseAndEval(expression, ADDSUB) def parseAndEval(expression, ops): v = 0 for op,part in re.findall(r'([{0}])?([^{0}]+)'.format(ops), expression): if not op: ...

0.593921

import re class Solution: def calc(self, a, b, op): if op == '+': for k, v in b.items(): a[k] = a.get(k, 0) + v return a elif op == '-': for k, v in b.items(): a[k] = a.get(k, 0) - v return a eli...

0.587389

def calculate(s): return str(sum(int(n) for n in s.replace("minus", "plus-").split("plus"))) # I heard here and there that using eval is a very bad practice… #return str(eval(s.replace("plus", "+").replace("minus", "-")))

0.576568

def e(s):return f([*s,'+']) def f(s,r=0,o=0,x='',c=0): while s and')'!=c: c=s.pop(0);i='+-*/)('.find(c) if c=='-'>x or i<0:x+=c elif c=='(':x=str(f(s)) elif i>-1:a=float(x);r=[r+a,r-a,r*a,r/a][o];o=i;x='' return r

0.562432

class Solution: def calPoints(self, ops): """ :type ops: List[str] :rtype: int """ sum = 0 for i in range (len(ops)): op = ops[i] if self.isInt(op): sum = sum + int(op) elif op == 'C': for ...

0.558692

for _ in range(int(input())): s = list(input().strip()) i = 0 while i < len(s) - 1: if s[i].isalpha() or s[i] == ')': if s[i + 1].isdigit(): if i + 2 >= len(s) or s[i + 2] == ')': s = s[:i+1] + ['*', s[i+1]] + s[i+2:] else: s = s[:i+1] + ['*', s[i+1], '+'] + s[i+2:] i += 1 elif s[i + ...

0.535982

from math import inf class Node: def __init__(self, parent = None, leftExp = None, rightExp = None, signQ = 0): self.parent, self.leftExp, self.rightExp, self.signQ = parent, leftExp, rightExp, signQ def __str__(self): return "Node" memo = {} def Memoize(node, p, maxValue, minValue): if n...

0.534757

import copy s=input() l=len(s) ans=0 if l==1: ans+=int(s) print(ans) else: for i in range(2**(l-1)): t=copy.deepcopy(s) f=[] ch=0 for j in range(l-1): if ((i>>j)&1): t=t[:j+1+ch]+'+'+t[j+1+ch:] ch+=1 if '+' in t: y=list(map(int,t.split('+'))) ...

0.532888

def calculate(s): x=[int(i) for i in s.split() if i.isdigit()] return sum(x) if 'gains' in s.split() else x[0]-x[1]

0.529685

class Solution: def evalRPN(self, tokens): """ :type tokens: List[str] :rtype: int """ s = [] for token in tokens: if token == "+": a = int(s.pop()) b = int(s.pop()) s.append(a+b) elif token == "/": a = int(s.pop()) b = int(s.po...

0.528536

def sum_prod(strexpression): return "%.5e" %(eval(strexpression))

0.525807

# """ # This is the interface that allows for creating nested lists. # You should not implement it, or speculate about its implementation # """ #class NestedInteger: # def __init__(self, value=None): # """ # If value is not specified, initializes an empty list. # Otherwise initializes a ...

0.523711

class Solution(object): loc=0 lastloc=-1 f='' def getNext(self,formular,locked=False): stype=0 # 0:null, 1:numeric, 2/20: Elem, 3: parenthesis ret=0 if self.loc==self.lastloc: return (0,0) i=self.loc while i <len(formular): if stype in (0,1) ...

0.522115

s = input() res = eval(s) n = len(s) for i in range(-1, n): if i == -1 or s[i] == '*': for j in range(i + 1, n + 1): if j == n or s[j] == '*': new_s = s[0:i + 1] + "(" + s[i + 1:j] + ")" + s[j:n] res = max(res, eval(new_s)) print(res)

0.522063

def no_order(equation): equation = equation.replace(' ', '') equation = equation.replace('+', ')+') equation = equation.replace('-', ')-') equation = equation.replace('*', ')*') equation = equation.replace('/', ')//') equation = equation.replace('%', ')%') equation = equation.replace('^', ')...

0.517932

def sum_it_up(a): return sum(int(*x) for x in a)

0.517519

import re def calculate_string(st): st = re.sub(r'[^-+*/\d.]', '', st) result = eval(st) return str(int(round(result)))

0.516747

import re def sum_from_string(string): d = re.findall("\d+",string) return sum(int(i) for i in d)

0.516099

from functools import reduce from operator import mul def multi(l_st): return reduce(mul,l_st) def add(l_st): return sum(l_st) def reverse(s): return s[::-1]

0.512123

from operator import add, sub, mul, floordiv as div, and_, or_, xor OP = {'add':add, 'sub':sub, 'mul':mul, 'div':div, 'and':and_, 'or':or_, 'xor':xor} class Machine(object): def __init__(self, cpu): self.cpu = cpu def execute(self, instruction): cmd, a, b = (instruction.rep...

0.511218

from random import choice def interpret(code): code = [list(l) for l in code.split('\n')] x, y = 0, 0 dx, dy = 1, 0 output = '' stack = [] string_mode = False while True: move = 1 i = code[y][x] if string_mode: if i == '"': s...

0.509496

op = {'+': 'Plus ','-': 'Minus ','*': 'Times ', '/': 'Divided By ', '**': 'To The Power Of ', '=': 'Equals ', '!=': 'Does Not Equal '} num = {'1': 'One', '2': 'Two', '3': 'Three', '4': 'Four', '5': 'Five', '6': 'Six', '7':'Seven', '8': 'Eight', '9': 'Nine', '10': 'Ten'} def expression_out(e): a, b, c = e.split...

0.507702

def summy(string_of_ints): return sum(map(int,string_of_ints.split()))

0.506063

res = 0 val = 0 sub = False for c in input()+'+': if c == '+' or c == '-': if sub: val *= -1 res += val val = 0 sub = (c == '-') val *= 10 val += ord(c) - ord('0') print(res)

0.502302

import re def calculate(input): try: return eval(re.sub(r'(\d+)', lambda m: str(int(m.group(1))), input)) except: return False

0.497871

class Solution: def calc(self, part): part += "+" ## added tmp symbol in the end to sum last item within the loop start = x = n = 0 coeff = 1 for end, char in enumerate(part): # print("charIdx:", equation[end], "char: ", char, char == "+" or char == "-", "slice: ", ...

0.494977

class Solution: def myAtoi(self, str): """ :type str: str :rtype: int """ base = "0123456789" plus = "+" minus = "-" sum = 0 flag = 1 bit = 0 INT_MAX = 2147483647 INT_MIN = -2147483648 if ...

0.492786

from collections import defaultdict import re P = re.compile(r'\+?(-?\d*)(x\^?)?(\d*)') def differentiate(eq, x): derivate = defaultdict(int) for coef,var,exp in P.findall(eq): exp = int(exp or var and '1' or '0') coef = int(coef!='-' and coef or coef and '-1' or '1') if...

0.485774

def calculator(x, y, op): return eval(f'{x}{op}{y}') if type(x) == type(y) == int and str(op) in '+-*/' else 'unknown value'

0.484567

TABLE = str.maketrans('0123456789','9876543210') def code(*args): return sum(map(lambda n:int(str(n).translate(TABLE)), args))

0.48001

from functools import reduce def solve(st): res, s, k = [], "", 1 for ch in st: if ch == '(': res.append(k); k = 1 elif ch == ')': res.pop(); k = 1 elif ch == '-': k = -1 elif ch == '+': k = 1 else: s+= '-'+ch if (reduce(lambda a,b: a * b,res,1) * (1 if k == 1 else -1) <...

0.477264

from operator import add, sub, mul, truediv D = {'+':add, '-':sub, '*':mul, '/':truediv} def calculate(a, o, b): try: return D[o](a, b) except: pass

0.475878

# cook your dish here def value(a, b, c): if(c == '&'): return a&b elif(c == '^'): return a^b elif(c == '|'): return a|b def break_rules(n, operator): if(len(n) == 1): return n elif(len(n) == 2): return [value(n[0], n[1], operator[0])] else: cont_...

0.474469

words = {w: n for n, w in enumerate('zero one two three four five six seven eight nine ten eleven twelve thirteen fourteen fifteen sixteen seventeen eighteen nineteen'.split())} words.update({w: 10 * n for n, w in enumerate('twenty thirty forty fifty sixty seventy eighty ninety hundred'.split(), 2)}) thousands = {w: 10...

0.473176

pos = {"L4":0, "L3":1, "L2":2, "L1":3, "L0":4, "R0":4, "R1":5, "R2":6, "R3":7, "R4":8} def tetris(arr): current, res = [0]*9, 0 for x in arr: p = pos[x[1:]] current[p] += int(x[0]) if current[p] >= 30: break y = min(current) if y: current, res = [v-y for v in current], r...

0.471863

def sum_nested_numbers(a, depth=1): return sum(sum_nested_numbers(e, depth+1) if type(e) == list else e**depth for e in a)

0.469781

def process_data(data): r = 1 for d in data: r *= d[0] - d[1] return r

0.469653

from operator import mul from functools import reduce def find_middle(s): if not s or not isinstance(s,str): return -1 lstDig = [int(c) for c in s if c.isnumeric()] if not lstDig: return -1 prod = str( reduce(mul,lstDig) ) i = (len(prod) - 1) // 2 return int(prod[i:-i or len(prod)]...

0.466

def house_numbers_sum(inp): return sum(inp[:inp.index(0)])

0.463348

import re def sum_of_integers_in_string(s): return sum(int(x) for x in re.findall(r"(\d+)", s))

0.463273

class Solution: def multiply(self,num1, num2): """ :type num1: str :type num2: str :rtype: str """ a=['0','1','2','3','4','5','6','7','8','9'] z=0 x=0 for i,element in enumerate(num1): for j in range(10): ...

0.462861

# 10 # + 8 # + 9 # + 11 # + 6 # + 1 # ? 3 # - 8 # ? 3 # ? 8 # ? 11 MAX_BIT = 30 class Node: def __init__(self): self.left = None self.right = None self.leftCnt = 0 self.rightCnt = 0 def AddRight(self): if self.right == None: self.right = Node() ...

0.457641

def sum_str(a, b): return str(int(a or 0) + int(b or 0))

0.451595

from fractions import gcd import re from functools import reduce def min_special_mult(arr): l = [e for e in arr if not re.match('(None)|([+-]?\d+)', str(e))] if len(l) == 1: return 'There is 1 invalid entry: {}'.format(l[0]) if len(l) > 1: return 'There are {} invalid entries: {}'.format(le...

0.449043

def largest_sum(s): return max(sum(map(int,x)) for x in s.split('0'))

0.448576

def sum_mix(arr): return sum(map(int, arr))

0.44769

def calculate(num1, operation, num2): # your code here try : return eval("{} {} {}".format(num1, operation, num2)) except (ZeroDivisionError, SyntaxError): return None

0.447177

class Solution: def decodeString(self, s): """ :type s: str :rtype: str """ stack = [] stack.append(["", 1]) num = "" for ch in s: if ch.isdigit(): num += ch elif ch == '[': stack.appen...

0.445601

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def sumNumbers(self, root): """ :type root: TreeNode :rtype: int """ def dfs(node, c...

0.445478

unflatten=lambda m,d,c=0:m if c==d else unflatten(parse(m,[0,1][c&1]),d,c+1) def parse(ar, lr): sub, i = [], [0, len(ar) - 1][lr] while 0 <= i < len(ar): j, r = ar[i], lr == 1 if isinstance(j, list): sub.append(parse(j, lr)) i += [1, -1][r] else: ...

0.443571

from itertools import cycle def sumDig_nthTerm(initVal, patternL, nthTerm): for c, i in enumerate(cycle(patternL), 2): initVal += i if c == nthTerm: return sum(int(v) for v in str(initVal))

0.44252

import operator as o class v: def __init__(s,a,b): s.a,s.b=a,b def compute(s): return getattr(o,type(s).__name__)(s.a,s.b) class value(int): pass class add(v): pass class sub(v): pass class mul(v): pass class truediv(v): pass class mod(v): pass class pow(v): pass

0.441316

s = input() l = [int(x) for x in s.split('+')] l.sort() print('+'.join([str(x) for x in l]))

0.441079

# cook your dish here s=input() i=0 l=len(s) orig='' st=[] flag=False while(i<l): if(s[i].isdigit()): num=int(s[i]) elif(s[i].isalpha()): if(flag==False): orig+=s[i] else:st.append(s[i]) elif(s[i]=='+'): flag=True st.clear() elif(s[i]==...

0.440537

def scratch(lottery): return sum(int(n) for lot in lottery for a,b,c,n in [lot.split()] if a==b==c)

0.440332

import re def solve_runes(runes): for d in sorted(set("0123456789") - set(runes)): toTest = runes.replace("?",d) if re.search(r'([^\d]|\b)0\d+', toTest): continue l,r = toTest.split("=") if eval(l) == eval(r): return int(d) return -1

0.44031

def binary_string_to_int(string): return sum((d == '1') * 2**i for i, d in enumerate(string[::-1])) def add(a, b): return '{:b}'.format(binary_string_to_int(a) + binary_string_to_int(b))

0.440283

points = [0, 40, 100, 300, 1200] def get_score(arr) -> int: cleared = 0 score = 0 for lines in arr: level = cleared // 10 score += (level+1) * points[lines] cleared += lines return score

0.439305

import re def solve(s): return max(map(int,re.findall(r"(\d+)", s)))

0.438985

add = lambda a, b: a + b multiply = lambda a, b: a * b divide = lambda a, b: a / b mod = lambda a, b: a % b exponent = lambda a, b: a ** b subt = lambda a, b:a - b

0.437606

def array_conversion(arr): sign = 0 while len(arr) > 1: sign = 1^sign arr = list(map(lambda x, y: x+y, arr[0::2],arr[1::2]) if sign else map(lambda x, y: x*y, arr[0::2],arr[1::2])) return arr[0]

0.437048

def calculate(n1, n2, o): operators = { "add": (lambda x, y: x + y), "subtract": (lambda x, y: x - y), "multiply": (lambda x, y: x * y), } return "{:b}".format( operators[o]( int(n1, 2), int(n2, 2) ) )

0.434433

def bowling_score(frames): rolls = list(frames.replace(' ','')) for i, hit in enumerate(rolls): if hit == 'X': rolls[i] = 10 elif hit == '/': rolls[i] = 10 - rolls[i - 1] else: rolls[i] = int(hit) score = 0 for i in range(10): frame = r...

0.433995

def string_expansion(s): m,n = '',1 for j in s: if j.isdigit(): n = int(j) else: m += j*n return m

0.433563

# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right import re class Solution: def recoverFromPreorder(self, S: str) -> TreeNode: itera = re.finditer(r'(-*)(\\d+)', S) ...

0.433522

from operator import add, mul, floordiv as fdiv, pow def poohbear(s): def updateMem(func, v): mem[p] = func(mem.get(p, 0), v) % 256 braces, stack = {}, [] for i,c in enumerate(s): if c == 'W': stack.append(i) if c == 'E': braces[i] = stack[-1] braces[stack.pop(...

0.433082

def sum_mul(n, m): if m>0 and n>0: return sum(range(n, m, n)) else: return 'INVALID'

0.432297

class Solution: def scoreOfParentheses(self, S: str) -> int: ans, val = 0, 1 for i in range(len(S) - 1): if S[i: i+2] == '((': val *= 2 if S[i: i+2] == '()': ans += val if S[i: i+2] == '))': val //= 2 return ans

0.432289

def solve(): s = input() pm = 0 cur = 0 ans = len(s) for i in range(len(s)): if s[i] == '+': cur += 1 else: cur -= 1 if cur < pm: pm = cur ans += i + 1 print(ans) t = int(input()) for _ in range(t): solve()

0.43217

one = int(input()) two = int(input()) element = input() if element == '/': print(one / two) elif element == '*': print(one * two) elif element == '-': print(one - two) elif element == '+': print(one + two)

0.431687

from functools import reduce from fractions import gcd def final_attack_value(x, monster_list): return reduce(lambda a, b: a + (b if b <= a else gcd(a, b)), monster_list, x)

0.430328

def find(a,b,n): strng = str(a) + str(b) #there are 10 and 4 long loops if (n > 20): n = n%20+20 while len(strng) <= n: next_ch = int(strng[-1]) + int(strng[-2]) strng = strng + str(next_ch) return int(strng[n])

0.430109

from itertools import accumulate def add(l): return list(accumulate(l)) if isinstance(l, list) and all(isinstance(x, int) for x in l) \ else 'Invalid input'

0.430079

def solution(roman): dict = { "M": 1000, "D": 500, "C": 100, "L": 50, "X": 10, "V": 5, "I": 1 } last, total = 0, 0 for c in list(roman)[::-1]: if last == 0: total += dict[c] elif last > dict[c]: total -= dic...

0.429276

from collections import defaultdict from itertools import chain import re PARSE = re.compile(r'[pP]\d+|q') def magic_call_depth_number(prog): def parse(it, p=''): for m in it: if m[0].startswith('p'): parse(it, m[0]) elif m[0]=='q': return else: ...

0.424921

def arithmetic(a, b, operator): return { 'add': a + b, 'subtract': a - b, 'multiply': a * b, 'divide': a / b, }[operator]

0.424622

def calc_type(a, b, res): return {a + b: "addition", a - b: "subtraction", a * b: "multiplication", a / b: "division"}[res]

0.424556

def parse(data): value = 0 res=[] for c in data: if c=="i": value+=1 elif c=="d": value-=1 elif c=="s": value*=value elif c=="o": res.append(value) return res

0.424163

INSTRUCTIONS = {"0F12": int.__add__, "B7A2": int.__sub__, "C3D9": int.__mul__} def communication_module(packet): header,inst,d1,d2,footer = (packet[i:i+4] for i in range(0,20,4)) res = max(0, min(9999, INSTRUCTIONS[inst](int(d1), int(d2)) )) return f"{header}FFFF{res:0>4}0000{footer}"

0.423023

def to_postfix (infix): prec = {'+': 1, '-': 1, '*': 2, '/': 2, '^': 3, '(': 0} postfix = [] stack = [] for ch in infix: if ch in '0123456789': postfix.append(ch) elif ch in '(': stack.append(ch) elif ch in ')': while stack and stack[-1] != '('...

0.422552

class Machine: def __init__(self): self.cmd = dict() self._actions = [lambda x: x + 1, lambda x: 0, lambda x: x / 2, lambda x: x * 100, lambda x: x % 2] def command(self, cmd, num): self.last_cmd = cmd if cmd in self.cmd: return self._actions[self.cmd[cmd]](num) ...

0.421639

from collections import defaultdict from functools import reduce import re P_EQ = re.compile("(?P<eq>=)|(?P<coef>[+-]?\d*)(?P<var>[a-zA-Z]*)") def solve(*equations): eqsMap = list(map(parse, equations)) # Transform each string in a dict {'var': coef} vars = reduce(set.union, (s...

0.419951

import re class Me(object): def __init__(self): self.x, self.y, self.dx, self.dy = 0,0,-1,0 def move(self, n): self.x += n*self.dx ; self.y += n*self.dy def back(self): self.dx *= -1 ; self.dy *= -1 def turn(self, d): self.dx,self.dy = (self.dy * (-1)**(d=='l'), 0) if self.dy else (0, self.dx * (...

0.419763

def candies(s): if not s or len(s) == 1: return -1 return len(s) * max(s) - sum(s)

0.419589

def simple_multiplication(number) : return number * 9 if number % 2 else number * 8

0.418323

def calc(s): total1 = ''.join(map(lambda c: str(ord(c)), s)) total2 = total1.replace('7', '1') return sum(map(int, total1)) - sum(map(int, total2))

0.418235

def eval_object(v): return {"+": v['a']+v['b'], "-": v['a']-v['b'], "/": v['a']/v['b'], "*": v['a']*v['b'], "%": v['a']%v['b'], "**": v['a']**v['b'], }.get(v['operation'])

0.417784

l = int(input()) a = [0] * (l+1) b = [1] * (l+1) st = 0 en = 1 cur = 0 for i in range(l): x = input() if x == 'add': a[en-1] += 1 elif x[0] == 'f': d = x.split() v = int(d[1]) a[en] = 0 b[en] = v en += 1 else: en -= 1 a[en-1] += a[en] * b[e...

0.416487

def problem(a): try: return a * 50 + 6 except TypeError: return "Error"

0.416449

import re s = input() ops = re.split('([+-])', s) assert len(ops) % 2 == 1 ops = ['+'] + ops total = 0 for i in range(0, len(ops), 2): if ops[i] == '+': total += int(ops[i+1]) elif ops[i] == '-': total -= int(ops[i+1]) else: assert False for b in bytes(str(total), 'ascii'): pr...

0.416196

def add(*args): return int(round(sum(float(a) / i for (i, a) in enumerate(args, 1))))

0.416118

def basereduct(x): for _ in range(150): x = int(str(x), int(max(str(x))) + 1 + ('9' in str(x))) if x < 10: return x return -1

0.415458

def score_hand(a): n = sum(11 if x == "A" else 10 if x in "JQK" else int(x) for x in a) for _ in range(a.count("A")): if n > 21: n -= 10 return n

0.414904

from functools import reduce from operator import mul def product(numbers): return reduce(mul, numbers) if numbers else None

0.414682

def get_derivative(s): if '^' in s: f,t = map(int, s.split('x^')) return '{}x'.format(f*t) if t==2 else '{}x^{}'.format(f*t, t-1) elif 'x' in s: return s[:-1] else: return '0'

0.413926

def add_point(ori,dis,c): lastPoint = c[-1] if ori == "N": c.append((lastPoint[0],lastPoint[1]+dis)) elif ori == "S": c.append((lastPoint[0],lastPoint[1]-dis)) elif ori == "E": c.append((lastPoint[0]+dis,lastPoint[1])) else: c.append((lastPoint[0]-dis,lastPoint[1])) ...

0.413379

In a country popular for train travel, you have planned some train travelling one year in advance. The days of the year that you will travel is given as an array days. Each day is an integer from 1 to 365. Train tickets are sold in 3 different ways: a 1-day pass is sold for costs[0] dollars; a 7-day pass is sold for...

class Solution: def mincostTickets(self, days: List[int], costs: List[int]) -> int: dp = [0] + [-1 for i in range(days[-1])] for day in days: dp[day] = 0 for i in range(1, len(dp)): if dp[i] == -1: dp[i] = dp[i-1] ...

0.811454

class Solution: def jobScheduling(self, startTime: List[int], endTime: List[int], profit: List[int]) -> int: # max profit ending at time t dp = [(0,0)] task = [(startTime[i], endTime[i], profit[i]) for i in range(len(startTime))] task = sorted(task, key = lambda x: ...

0.581295

class Solution: def shoppingOffers(self, price, special, needs): """ :type price: List[int] :type special: List[List[int]] :type needs: List[int] :rtype: int """ def dfs(curr, special, needs): p=curr+sum(p*needs[i] for i,p in enumerate(pri...

0.568383

def main(): trips, reg, cheap, cards, card_cost = list(map(int, input().split())) costs = [] indexes = {} total = 0 last = "" for i in range(trips): a, b = input().split() pair = (min(a, b), max(a, b)) if pair in indexes: index = indexes[pair] else: costs.append(0) index...

0.56394

from heapq import heappop, heappush def comb(fruits): total, heap = 0, sorted(fruits) while len(heap) > 1: cost = heappop(heap) + heappop(heap) heappush(heap, cost) total += cost return total

0.560983

w, r = open('output.txt', 'w'), open('input.txt', 'r') s, y = [0] * 466, [0, 100, 131, 159, 190, 220, 251, 281, 312, 343, 373, 404, 434] for i in range(int(r.readline())): m, d, p, t = map(int, r.readline().split()) x = y[m] + d s[x] -= p s[x - t] += p for i in range(465): s[i + 1] += s[i] w.write(s...

0.55752

from itertools import combinations def closest_sum(ints, num): return sum(min(combinations(ints, 3), key=lambda a: abs(num - sum(a))))

0.546738

from itertools import accumulate def tram(stops, descending, onboarding): return max(accumulate(o - d for d, o in zip(descending[:stops], onboarding)))

0.540148

class Solution: def twoCitySchedCost(self, costs: List[List[int]]) -> int: dcosts = sorted(costs, key=lambda i: i[0] - i[1]) n = len(costs) // 2 acost = sum(c[0] for c in dcosts[:n]) bcost = sum(c[1] for c in dcosts[n:]) return acost + bcost

0.533545

class Solution: def maxProfitAssignment(self, difficulty: List[int], profit: List[int], worker: List[int]) -> int: ws = sorted(worker, reverse=True) dp = sorted(zip(difficulty, profit), key=lambda x: x[1], reverse=True) # print(list(dp)) i = 0 total = 0 for w...

0.531999

import math def cost(mins): return 30 + 10 * math.ceil(max(0, mins - 60 - 5) / 30)

0.529475

# returns answer to the subproblem with interval range [start, end], # but with a total of "extra" additional stuff on the end # that must be deleted last. memo = {} def f(dat, rewards, start, end, extra): curr = (start, end, extra) if curr in memo: return memo[curr] if start > end: re...

0.529413

import sys import math import cProfile DEBUG = False def log(s): if DEBUG and False: print(s) def calc_dmg(num, arr): maximum = 0 if num - len(arr) < 0: maximum = max(arr) return sum(arr) + maximum if DEBUG: sys.stdin = open('input.txt') pr = cProfile.Profile() pr....

0.527926

n, C = map(int, input().split()) time = 0 stc = [] for i in range(n): temp = list(map(int, input().split())) time = max(time, temp[1]) stc.append(temp) tv = [[0 for i in range(C)] for i in range(time + 1)] for i in stc: s, t, c = i[0], i[1], i[2] for j in range(s, t + 1): tv[j][c - 1] = 1 an...

0.52681

import sys readline = sys.stdin.readline from collections import Counter def getpar(Edge, p): N = len(Edge) par = [0]*N par[0] = -1 par[p] -1 stack = [p] visited = set([p]) while stack: vn = stack.pop() for vf in Edge[vn]: if vf in visited: con...

0.526301

def least_bribes(bribes): mem = {} def s(n1, n2): if n1 >= n2: return 0 if (n1, n2) in mem: return mem[n1, n2] r = min(bribes[i] + max(s(n1, i), s(i + 1, n2)) for i in range(n1, n2)) mem[n1, n2] = r return r return s(0, len(bribes))

0.526116

class Solution: def deleteAndEarn(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums);#count is a dict [3,4,2]--> {2:1,3:1,4:1} prev = None; avoid = using = 0; for k in sorted(count): temp = ma...

0.522162

class Solution: def findPoisonedDuration(self, timeSeries, duration): """ :type timeSeries: List[int] :type duration: int :rtype: int """ if not timeSeries: return 0 prev = timeSeries[0] ret = 0 count = 0 for t i...

0.521418

from collections import deque def rollingmax(x, y, r, a): k = 2 * r + 1 d = deque() lx = len(x) for i in range(lx + r): if i < lx: while d and d[-1][1] <= x[i]: d.pop() d.append((i, x[i])) while d and d[0][0] <= i - k: d.popleft() ...

0.521019

n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) c = list(map(int, input().split())) fed_left = {0 : a[0]} not_fed_left = {0 : b[0]} for i in range(1, n): fed_left[i] = max(fed_left[i-1] + b[i], not_fed_left[i-1] + a[i]) # max(fed left, fed right) not_fed_left[i] = max(fed_le...

0.519806

A, B, C = list(map(int, input().split())) g = min(A//3,B//2,C//2) A -= g*3 B -= g*2 C -= g*2 L = [0,0,1,2,0,2,1] def calc(today, x): if x[L[today]] == 0: return 0 y = [xx for xx in x] y[L[today]] -= 1 return calc((today+1)%7, y) + 1 ma = 0 for i in range(7): ma = max(ma, calc(i, [A,B,C])...

0.517993

from operator import attrgetter, itemgetter n = int(input()); arr = [[int(x) for x in input().split(' ')] for y in range(n)]; arr = sorted(arr, key=itemgetter(1,0,2), reverse=True); dp = [0 for x in range(n)]; s = []; for i in range(n): while (s != [] and arr[s[-1]][0] >= arr[i][1]): s.pop(); if (s != []): dp[i] ...

0.516925

class Solution: def minCost(self, s: str, cost: List[int]) -> int: delete_cost = 0 last = 0 for i in range(1, len(s)): if s[last] == s[i]: if cost[last] < cost[i]: delete_cost += cost[last] last = i else: ...

0.513384

3 import array from fractions import Fraction import functools import itertools import math import os import sys def main(): H = [read_ints() for _ in range(10)] print(solve(H)) def pos_idx(x, y): i = y * 10 if y % 2 == 0: i += x else: i += 9 - x return i def idx_pos(i): ...

0.51209

#5:09 ''' nums = [3,6,5,1,8] sum_nums = 23 mod3_sum_nums = 2 mod3_dict = {0:[3,6], 1:[1], 2:[5,8]} helper([5,8], [1]) -> 5 ''' from collections import defaultdict class Solution: def helper(self, l1, l2): if len(l1) < 1 and len(l2) <2: sum_remove = 0 elif len(l1) < 1: s...

0.5112

c,f=list(map(int,input().split())) l=[[1000001 for i in range(c)] for j in range(c)] while f: x,y,cost=list(map(int,input().split())) l[x-1][y-1]=cost l[y-1][x-1]=cost f-=1 for i in range(c): l[i][i]=0 for k in range(c): for x in range(c): for y in range(c): ...

0.511189

from bisect import * n, tc, td = [int(i) for i in input().split()] fc = [] fd = [] mbc = 0 mbd = 0 for _ in range(n): b, p, ft = input().split() b, p = int(b), int(p) f = (p, b) if ft == 'C': if p <= tc: fc.append(f) mbc = max(mbc, b) else: if p <= td: ...

0.510891

'''Well I found the bug, but I don't understand why it was doing that. I mean, as far as I can tell, it shouldn't be a bug! Note to self: deleting from (supposedly) local lists through recursion is dangerous!''' class Group(object): def __init__(self,size,start,end,value): self.size = size self.sta...

0.509605

from collections import defaultdict import itertools n, c = map(int, input().split()) D = [list(map(int, input().split()))for _ in range(c)] # 集計 diago = [defaultdict(int)for _ in range(3)] for i in range(n): for j, color in enumerate(map(int, input().split())): color -= 1 if (i+j) % 3 == 0: ...

0.509576

def solve(arr): res = [] for first in (arr[0]-1, arr[0], arr[0]+1): for second in (arr[1]-1, arr[1], arr[1]+1): val, step, count = second, second-first, abs(arr[0]-first) + abs(arr[1]-second) for current in arr[2:]: val += step if abs(val-current) ...

0.509118

m = list(map(int, input().split())) w = list(map(int, input().split())) a = [500, 1000, 1500, 2000, 2500] v = list(map(int, input().split())) ans = 0 for i in range(len(m)): ans += max(0.3 * a[i], (1 - m[i] / 250) * a[i] - 50 * w[i]) ans += v[0] * 100 ans -= v[1] * 50 print(int(ans))

0.505925

n = int(input()) k = map(int, input().split()) times = [] for i in range(n): people = list(map(int, input().split())) time = len(people) * 15 for p in people: time += p*5 times.append(time) print(min(times))

0.50568

class Solution: def minCost(self, n: int, cuts: List[int]) -> int: cuts.sort() from functools import lru_cache @lru_cache(None) def helper(i = 0, j = n): ans = math.inf for c in cuts: if c <= i: continue if c >= j: break ...

0.504272

import collections def main(): from sys import stdin, stdout def read(): return stdin.readline().rstrip('\n') def read_array(sep=None, maxsplit=-1): return read().split(sep, maxsplit) def read_int(): return int(read()) def read_int_array(sep=None, maxsplit=-1): ...

0.504101

class Solution: def carPooling(self, trips: List[List[int]], capacity: int) -> bool: d = defaultdict(int) for a, b, c in trips: d[b] += a d[c] -= a k = 0 for t in sorted(d.keys()): k += d[t] if k > capacity: ...

0.503732

class Solution: def minimumTotal(self, triangle): """ :type triangle: List[List[int]] :rtype: int """ length = len(triangle) for i in range(length - 1, 0, -1): for j in range(1, len(triangle[i])): if triangle[i][j] < triangle[i][j-...

0.503392

n1 = int( input() ) n2 = int( input() ) n3 = int( input() ) print( min( n1 , n2 // 2 , n3 // 4 ) * 7 )

0.5026

S=input() a=1145141919810 for i in range(len(S)-2): a=min(a,abs(753-int(S[i:i+3]))) print(a)

0.50191

class Solution: def shipWithinDays(self, weights: List[int], D: int) -> int: left = max(weights) right = left * len(weights) // D while left < right: mid = left + (right - left) // 2 c = 0 d = 1 for w in weights: if c + w <= ...

0.501177

'''input 1 2 3 5 ''' n = int(input()) a = int(input()) b = int(input()) c = int(input()) cur = 0 pos = 0 for i in range(n-1): if pos == 0: if a < b: pos = 1 cur += a else: pos = 2 cur += b elif pos == 1: if a < c: pos = 1 ...

0.4991

n = int(input()) a = [[], []] a[0] = list(map(int, input().split())) a[1] = list(map(int, input().split())) b = list(map(int, input().split())) ans = float('+inf') for i in range(n): for j in range(n): if i == j: continue cur = sum(a[1][i:]) + sum(a[0][:i]) + sum(a[0][:j]) + sum(a[1][j:]) + b[i] + b[j] ans =...

0.498839

import math leftpeople = set() rightpeople = set() n, vl = list(map(int, input().split())) def leftinterval(x0, v0, t): if x0 / v0 <= t: return (0, 10**6) if x0 / (vl + v0) > t: return (-1, -2) leftbound = x0 rightbound = (vl * vl - v0 * v0) * t + x0 * v0 rightbound /= vl right...

0.498063

class Solution: def minCost(self, houses: List[int], Cost: List[List[int]], m: int, n: int, target: int) -> int: @lru_cache(None) def dfs(i, j, k): if i == len(houses): if j == target: return 0 else: return float('in...

0.497356

def tiaosheng(a): j, t = 0, 0 for j in a: t += 3 if j + t > 60: return min(j, 60-t+3) return 60-t

0.497193

a=input().split() a.sort(reverse=True) if len(set(a))==1: print(12*int(a[0])) else: ans=int(a[0]+a[1])+int(a[2]) print(ans)

0.497025

def max_tri_sum(numbers): return sum(sorted(set(numbers))[-3:])

0.494769

destination, max_gas_tank_volume, gas_prices_number = list(map(int, input().split())) start_point = 0 gas_prices = {start_point:0} for i in range(gas_prices_number): coordinate, price = list(map(int, input().split())) gas_prices[coordinate] = price points = sorted(list(gas_prices.keys()), reverse = True) curren...

0.493944

def find_unknown_number(x,y,z): return (x*70 + y*21 + z*15) % 105 or 105

0.493773

import sys n_discounts = int(sys.stdin.readline()) discount_values = [int(x) for x in sys.stdin.readline().split()] n_items = int(sys.stdin.readline()) item_values = [int(x) for x in sys.stdin.readline().split()] min_discount_req = 10000000 for discount_value in discount_values: min_discount_req = min(min_discoun...

0.491088

import sys rd = lambda : sys.stdin.readline().rstrip() n = int(rd()) c = list(map(int, rd().split())) a = list([int(x)-1 for x in rd().split()]) visited = [-1] * (n) res = 0 for i in range(n): trace = [] t = i mn = 1e9 while visited[t] == -1: visited[t] = i trace.append(t) ...

0.491055

def sum_of_regular_numbers(arr): res, value, save = 0, arr[1] - arr[0], arr[:2] for x,y in zip(arr[1:], arr[2:]): if y-x == value: save.append(y) else: if len(save) >= 3: res += sum(save) value, save = y-x, [x, y] if len(save) >= 3: res+= sum(save) ret...

0.490965

def target_game(values): a = b = 0 for n in values: a, b = b, max(a + n, b) return max(a, b)

0.490722

from itertools import permutations C = list(permutations(['A','B','C','D'])) V = list(permutations([3,6,9,12])) P = list(permutations([25,50,75,100])) R = [] def test(): d = {} n = int(input()) for i in C[0]: for j in V[0]: d[i+str(j)] = 0 for i in range(n): x,y = input().split() d[x+y] += 1 ans = -10000...

0.49036

import itertools def choose_best_sum(t, k, ls): try: return max(sum(i) for i in itertools.combinations(ls,k) if sum(i)<=t) except: return None

0.489606

def london_city_hacker(journey): # your code here tube = 2.40 bus = 1.50 total_cost = 0.00 count = 0 for link in journey: if isinstance(link, str): total_cost += tube count = 0 else: if count == 0: total_cost += bus ...

0.488051

class Solution: def minNumberOperations(self, target: List[int]) -> int: prev = -1 ans = 0 for num in target: if prev == -1: prev = num ans += num continue if num > prev: ans += (num - prev) #...

0.487947

def sum_of_intervals(intervals): s, top = 0, float("-inf") for a,b in sorted(intervals): if top < a: top = a if top < b: s, top = s+b-top, b return s

0.487863

class Solution: def maxProfit(self, prices): profits = 0 ln = len(prices) if not ln: return 0 elif ln == 2: return (prices[1]-prices[0]) if prices[1] > prices[0] else 0 lastPrice = prices[0] for price in prices: if lastPr...

0.487856

import sys sys.setrecursionlimit(1000000000) input = sys.stdin.readline n,w=map(int,input().split()) knap=[[] for i in range(4)] w0,v=map(int,input().split()) knap[0].append(v) for i in range(n-1): W,v=map(int,input().split()) knap[W-w0].append(v) for i in range(4): knap[i].sort(reverse=1) knap[i]=[0]+k...

0.487477

import sys from heapq import heappush, heappop n = int(input()) a = list(map(int, input().split())) count = {} for x in a: if x in count: count[x] = count[x] + 1 else: count[x] = 1 count = sorted(list(count.items())) #print(count) cost= list(map(int, input().split())) max_cost = max(cost) a = list(zip(a, co...

0.487412

#~ # MAGIC CODEFORCES PYTHON FAST IO import atexit import io import sys _INPUT_LINES = sys.stdin.read().splitlines() input = iter(_INPUT_LINES).__next__ _OUTPUT_BUFFER = io.StringIO() sys.stdout = _OUTPUT_BUFFER @atexit.register def write(): sys.__stdout__.write(_OUTPUT_BUFFER.getvalue()) #~ # END OF MAGIC CODEFO...

0.486628

def calc(a): res = [0] * (len(a) + 1) for k in range(len(a)): res = [2 * max(a[i] + res[i+1], a[i+k] + res[i]) for i in range(len(a) - k)] return res[0]

0.48652

T = int(input()) for t in range(T): n, m = list(map(int, input().split())) c = list(map(int, input().split())) dp1 = [1e9]*((1 << n)+1) for i in range(n): dp1[1 << i] = c[i] dp1[1 << (n-1)] = min(dp1[1 << (n-1)], sum(c)) for i in range(m): l = list(map(int, input().split())) cost = l[0] s = l[1] it...

0.486312

n,m,lk = list(map(int,input().split())) sp = [int(i)-1 for i in input().split()] dp = [] for i in range(n): dp += [[0]*n] for i in range(n): for j in range(n): if(i!=j): dp[i][j]=10**18 for _ in range(m): x,y,z = list(map(int,input().split())) dp[x-1][y-1]=z dp[y-1][x-1]=z for k in range(n): for i in range(n...

0.486086

n,r1,r2,r3,D = map(int,input().split()) state = [0,0] # after odd number of 2 (1st), or not (2nd) a = list(map(int,input().split())) # First element # Choosing P~P + A state[0] = r1 * a[0] + r3 # Choosing L + P later or all P state[1] = min(r2 + r1 + D, r1 * (a[0] + 2) + D) # Second to Second Last element for ...

0.486027

from sys import * f = list(map(int, stdin.read().split())) n, m = f[0], f[1] d = [[] for i in range(100001)] for j in range(2, len(f), 3): x, y, w = f[j:j + 3] d[w].append((y, x)) s = [0] * (n + 1) for q in d: for y, k in [(y, s[x]) for y, x in q]: s[y] = max(s[y], k + 1) print(max(s))

0.48581

def main(): n, m = list(map(int, input().split())) cost1 = [] cost2 = [] cost3 = [] for i in range(n): w, c = list(map(int, input().split())) if w == 1: cost1.append(c) elif w == 2: cost2.append(c) else: cost3.append(c) cost1...

0.485662

mod = 12345787 mat = [([1,1],[0,1,3]), ([2,1,-1],[0,2,6,11]), ([2,3,-1,-1],[0,2,10,23,70]), ([3,3,-4,-1,1],[0,3,15,42,155,533]), ([3,6,-4,-5,1,1],[0,3,21,69,301,1223,5103])] for i in range(100): [m.append(sum(k*m[-1-i] for i,k in enumerate(c))%mod) for c,m in mat] def circular_limited_sums...

0.484326

class Solution: def findMinDifference(self, timePoints): """ :type timePoints: List[str] :rtype: int """ if len(timePoints) > 1440: return 0 timeNum = [0] * len(timePoints) for i in range(len(timePoints)): timeNum[i] = 60 * int(timePoints[...

0.484241

# cook your dish here # cook your dish here import numpy as np n, s, q = [int(j) for j in input().split()] edges = [int(j)-1 for j in input().split()] costs = [int(j) for j in input().split()] special = [int(j)-1 for j in input().split()] queries = [[0] * 3 for _ in range(q)] for i in range(q): queries[i] = [int(j)-...

0.483372

# !/bin/env python3 # coding: UTF-8 # ✪ H4WK3yE乡 # Mohd. Farhan Tahir # Indian Institute Of Information Technology and Management,Gwalior # Question Link # https://codeforces.com/problemset/problem/392/B # # ///==========Libraries, Constants and Functions=============/// import sys inf = float("inf") mod = 10000...

0.482037

n=int(input()) d,x=map(int,input().split()) for i in range(n): t=int(input()) x+=(d+t-1)//t print(x)

0.481931

def queue_time(customers, n): l=[0]*n for i in customers: l[l.index(min(l))]+=i return max(l)

0.481194

""" Codeforces Round 252 Div 2 Problem B Author : chaotic_iak Language: Python 3.3.4 """ def read(mode=2): # 0: String # 1: List of strings # 2: List of integers inputs = input().strip() if mode == 0: return inputs if mode == 1: return inputs.split() if mode == 2: ...

0.480759

class Solution: def largestNumber(self, cost: List[int], target: int) -> str: dp = [0] + [-target]*target for t in range(1, target+1): dp[t] = max([dp[t-i] for i in cost if i<=t]+[dp[t]]) + 1 if dp[-1]<=0: return '0' res = '' for i in range(8, -1, -1): ...

0.480706

n = int(input()) a_list = sorted([int(x) for x in input().split()]) b_list = sorted([int(x) for x in input().split()]) c_list = sorted([int(x) for x in input().split()]) import bisect sum = 0 for b in b_list: b_num = bisect.bisect_left(a_list,b) c_num = bisect.bisect_right(c_list,b) sum += b_num*(len(c_lis...

0.480423

# cook your dish here while True: try: n=int(input()) lis=[] for i in range(n): k=list(map(int,input().split())) k.append(k[1]+k[2]) lis.append(k) #print(lis) p=sorted(lis,key=lambda x:x[3],reverse=True) #print(p) m...

0.48033

from collections import namedtuple from operator import itemgetter Friend = namedtuple("Friend", "m s") n, d = list(map(int, input().split())) f = [ ] for i in range(n): f.append(Friend(*list(map(int, input().split())))) f.sort(key=itemgetter(0)) left = 0 cur = f[0].s result = cur for i, fr in enumerate(f[1:],...

0.479129

class Solution: def maxCoins(self, piles: List[int]) -> int: piles.sort() i = 0 j = len(piles) - 1 max_coins = 0 for i in range(len(piles) // 3, len(piles), 2): max_coins += piles[i] return max_coins

0.478856

N = int(input()) A = [int(i) for i in input().split()] B = [int(i) for i in input().split()] C = [int(i) for i in input().split()] ans = 0 for i in range(N): ans += B[A[i]-1] if(A[i] == A[i-1]+1 and i != 0): ans += C[A[i]-2] print(ans)

0.478833

pos = {"L4":0, "L3":1, "L2":2, "L1":3, "L0":4, "R0":4, "R1":5, "R2":6, "R3":7, "R4":8} def tetris(arr): current, res = [0]*9, 0 for x in arr: p = pos[x[1:]] current[p] += int(x[0]) if current[p] >= 30: break y = min(current) if y: current, res = [v-y for v in current], r...

0.478705

import sys input = sys.stdin.readline n,m=list(map(int,input().split())) A=list(map(int,input().split())) C=list(map(int,input().split())) P=list(map(int,input().split())) DP=[[-1<<30]*(n+1) for i in range(5001)] # DP[k][cnt] = Aのmaxがkで, そういう人間がcnt人いるときのprofitの最大値 for i in range(5001): DP[i][0]=0 for i in range...

0.478148

def next_day_of_week(current_day, available_week_days): x = 2 ** current_day while not x & available_week_days: x = max(1, (x * 2) % 2 ** 7) return x.bit_length()

0.477848

import sys input = sys.stdin.readline def main(): x, y = list(map(int, input().split())) clst = list(map(int, input().split())) clst[0] = min(clst[0], clst[5] + clst[1]) clst[1] = min(clst[1], clst[0] + clst[2]) clst[2] = min(clst[2], clst[1] + clst[3]) clst[3] = min(clst[3], clst[2] + clst[4])...

0.477838

def solve(n): moves = [] for a, b in ["25", "75", "50", "00"]: s = str(n)[::-1] x = s.find(a) y = s.find(b, x+1 if a == "0" else 0) if x == -1 or y == -1: continue moves.append(x + y - (x > y) - (a == b)) s = s.replace(a, "", 1).replace(b, "", 1) ...

0.477761

from sys import stdin, stdout input, print = stdin.readline, stdout.write n = int(input()) r, g, b = [], [], [] ans = 0 for i in range(n): x, t = [i for i in input().split()] x = int(x) if t == 'P': g.append(x) elif t == 'R': r.append(x) else: b.append(x) if len(g) =...

0.477358

n, up = map(int, input().split()) res = 0 for i in range(n): fl, t = map(int, input().split()) res = max(res, max(t, up - fl) + fl) print(res)

0.476005

k, na, nb, nc, ta, tb, tc = list(map(int, input().split())) from collections import deque a = deque() b = deque() c = deque() for i in range(na): a.append(0) for i in range(nb): b.append(0) for i in range(nc): c.append(0) t = 0 for i in range(k): vr = max(a[0], b[0] - ta, c[0] - (ta +...

0.475595

rooms=int(input()) money=list(map(int,input().split())) keys=int(input()) rev=-1 a,b=0,-1 tot=[] #print(money[-3:-1]) x=0 for i in range(keys): #print(money[b:-1],money[0:a]) x=sum(money[b:])+sum(money[0:keys-abs(b)]) tot.append(x) b-=1 print(max(tot))

0.475588

t = input() t = t.split() n = int(t[0]) c1 = int(t[1]) c2 = int(t[2]) t = input() d = 0 for i in t: if(i=="1"): d = d+1 min = 10**1488 for i in range(1, d+1): t = c1*i + i*c2*(((n//i)-1)**2) + c2*(n%i)*(2*(n//i)-1) if t<min: min = t print(min)

0.475435

import math n = int(input()) a=list(map(int,input().split())) dp = [0 for x in range(n)] dp[0] = a[0] dp[1] = a[1] dp[2] = a[2] for x in range(3,n): dp[x] = a[x] + min(dp[x-1],dp[x-2],dp[x-3]) print(min(dp[-3:]))

0.475434

import sys from operator import itemgetter readline = sys.stdin.readline sys.setrecursionlimit(2*10**6) class UF(): def __init__(self, num): self.par = [-1]*num self.size = [1]*num def find(self, x): if self.par[x] < 0: return x else: x = self.par[x] ...

0.475016

import math import sys arrival, departure, time_per_client = [int(x) for x in input().split()] num_clients = int(input()) if num_clients > 0: clients_arrival = [int(x) for x in input().split()] else: print(arrival) return best_time = None current_time = arrival clients_at_queue = 0 client_to_arrive = 0 client_wa...

0.47492

for i in range(int(input())): n=int(input()) s=0 for i in range(n): a,b,c=map(int,input().split()) d=(c/100)*a e=a+d f=e-((c/100)*e) g=a-f h=b*g s=s+h print(s)

0.474238

import sys from math import ceil n, m, k = list(map(int, sys.stdin.readline().split())) places = [True for _ in range(n)] for x in map(int, sys.stdin.readline().split()): places[x] = False costs = list(map(int, sys.stdin.readline().split())) if not places[0]: print(-1) return prev = [i for i in range(n)] ...

0.473999

import sys from sys import stdout import random from fractions import Fraction from math import * def input(): return sys.stdin.readline().strip() def iinput(): return int(input()) def finput(): return float(input()) def tinput(): return input().split() def linput(): return list(input()) de...

0.473722

def main(): X, Y, A, B, C = list(map(int, input().split())) p = list(map(int, input().split())) q = list(map(int, input().split())) r = list(map(int, input().split())) p.sort(reverse=True); q.sort(reverse=True); r.sort() p = p[:X] q = q[:Y] s = p + q s.sort() rtmp = r.pop() ...

0.473113

class Solution: def maxProfit(self, k, prices): """ :type k: int :type prices: List[int] :rtype: int """ length = len(prices) v = p = 0 pairs, profits = [], [] while p < length: v = p ...

0.472557

import bisect import collections def solve(inp, *args): n, x = list(map(int, inp.split(" ", 1))) travels_by_len = collections.defaultdict(list) travels_by_len_processed = {} for travel in args: l, r, cost = list(map(int, travel.split(" ", 2))) travels_by_len[r - l + 1].append((l, r, co...

0.472473

def max_sum(arr, ranges): return max( sum(arr[start:stop+1]) for start, stop in ranges )

0.471878

x = int(input()) shoe_size = list(map(int,input().split())) n = int(input()) sell = 0 for i in range(n): s, p = list(map(int,input().split())) if s in shoe_size: sell = sell + p shoe_size.remove(s) print(sell)

0.471556

You are given a string containing only 4 kinds of characters 'Q', 'W', 'E' and 'R'. A string is said to be balanced if each of its characters appears n/4 times where n is the length of the string. Return the minimum length of the substring that can be replaced with any other string of the same length to make the origin...

class Solution: def balancedString(self, s: str) -> int: # minimum window so that outside is possible if len(s) //4 != len(s) / 4: return -1 ans, lb, n_cnt = len(s), 0, collections.Counter(s) i = 0 while i < len(s): n_cnt[s[i]] -= 1 while lb < ...

0.756697

n=int(input()) s=input() cnt=s[1:].count("E") ans=cnt for i in range(1,n): if s[i-1]=="W": cnt+=1 if s[i]=="E": cnt-=1 ans=min(ans,cnt) print(ans)

0.665668

n = int(input()) c = input() w = 0 r = c.count('R') i = 0 ans = max(w, r) while i <= n - 1: if c[i] == 'W': w += 1 else: r -= 1 ans = min(ans, max(w, r)) i += 1 print(ans)

0.655717

t = {i: 0 for i in 'qwertyuiopasdfghjklzxcvbnm'} for i in input(): t[i] += 1 print(min([t['i'], t['t'], t['e'] // 3, max(0, (t['n'] - 1)) // 2]))

0.648088

class Solution: def findTheLongestSubstring(self, s: str) -> int: s = s + 'a' bits, dp = {'a':0,'e':1,'i':2,'o':3,'u':4}, {0:-1} res = 0 key = 0 for i, char in enumerate(s): if char in bits: if key in dp: res = m...

0.620132

class Solution: def balancedStringSplit(self, s: str) -> int: lCount = rCount = 0 retVal = 0 for char in s: if char == 'R': rCount += 1 else: lCount += 1 if rCount == lCount: retVal ...

0.618328

class Solution: def longestAwesome(self, s: str) -> int: cum = [0] firsts = {0: -1} lasts = {0: -1} for i, c in enumerate(s): cum.append(cum[-1] ^ (1 << (ord(c) - 48))) if cum[-1] not in firsts: firsts[cum[-1]] = i lasts[cum[-1]] = ...

0.616246

S = str(input()) if "RRR" in S: print(3) elif "RR" in S: print(2) elif "R" in S: print(1) else: print(0)

0.612311

class Solution: def isvalid(self,C): if len(C)>2: return False if len(C)==1: a = min(C) if a==1 or C[a]==1: # EXPLANATION: # a==1 : All lengths are unitary like A=[1,2,3,4,...], so poping anything is fine # C[a...

0.606404

# class Solution: # def distinctEchoSubstrings(self, text: str) -> int: # ans = set() # for i in range(len(text)-1): # for j in range(i+1, (i+len(text))//2+1): # if text[i:j] == text[j:2*j-i]: ans.add(text[i:j]) # return len(ans) from collectio...

0.604102

from collections import Counter def main(): s = input() c = Counter(s) w = Counter("Bulbasaur") ans = 1e9 for char in w: ans = min(ans, c[char] // w[char]) print(ans) main()

0.602715

g = "ACTG" def dist(a, b): p = abs(ord(a) - ord(b)) return min(p, 26 - p) def price(s): return sum(dist(x, y) for x, y in zip(g, s)) n = int(input()) s = input() ans = 100000 for i in range(len(s) - 3): ans = min(ans, price(s[i:i+4])) print(ans)

0.597594

class Solution: def findSubstringInWraproundString(self, p): """ :type p: str :rtype: int """ pc = None sl = 0 ll = {} for c in p: if pc and (ord(pc) + 1 == ord(c) or (pc == 'z' and c == 'a')): sl += 1 ...

0.596176

class Solution: def maxRepOpt1(self, text: str) -> int: letters = {} for i, char in enumerate(text): if char in letters: letters[char].append(i) else: letters[char] = [i] if len(letters) == 1: return len(text) ...

0.589846

#!/usr/bin/env python3 # -*- coding: utf-8 -*- def f(first, s): second = 'r' if first == 'b' else 'b' alt = [first, second] error = [0, 0] for i,ch in enumerate(s): shouldbe = alt[i % 2] if ch != shouldbe: error[i % 2] += 1 return max(error) def main(): n = int(in...

0.589809

s=input() ans = 0 for i in range(len(s)): if s[i] == 'A': ans += s[:i].count('Q') * s[i:].count('Q') print(ans)

0.588641

# You lost the game. s = str(input()) n = len(s) d = -1 r = 0 V = "AEIOUY" for i in range(n): if V.count(s[i]): r = max(r,i-d) d = i print(max(r, n-d))

0.586782

for i in range(int(input())): s='R' + input() + 'R' prev=0 ma=-1 for i in range(1,len(s)): if s[i]=='R': ma=max(ma,i-prev) prev=i print(ma)

0.581245

s=input() dp=[[0,0,0] for i in range(len(s))] for i in range(len(s)): if s[i]=='a': dp[i][0]=dp[i-1][0]+1 dp[i][1]=dp[i-1][1] dp[i][2]=max(dp[i-1][1]+1,dp[i-1][2]+1) else: dp[i][0]=dp[i-1][0] dp[i][1]=max(dp[i-1][0]+1,dp[i-1][1]+1) dp[i][2]=dp[i-1][2] e=len(s)-1 p...

0.576638

""" Codeforces Round 253 Div 1 Problem A Author : chaotic_iak Language: Python 3.3.4 """ def read(mode=2): # 0: String # 1: List of strings # 2: List of integers inputs = input().strip() if mode == 0: return inputs if mode == 1: return inputs.split() if mode == 2: ...

0.574683

'''input 6 LLRRRR ''' n = int(input()) s = input() h, v = min(s.count("L"), s.count("R")), min(s.count("U"), s.count("D")) print(2*h + 2*v)

0.571709

N = int(input()) S = input() ans = S.count("R") * S.count("G") * S.count("B") for i in range(N-2): r = S[i] for j in range(i+1,N-1): g = S[j] if r == g: continue k = 2*j - i if k >= N: continue b = S[k] if r != b and g != b: an...

0.570479

s=input() if(len(s)<=3): print(0) else: n=len(s) ans=0 A=0 for i in range(3,n): if(s[i-3]+s[i-2]+s[i-1]+s[i]=='bear'): ans+=((i-3)-A+1)*(n-i) A=i-2 print(ans)

0.569471

s = input() ans = 0 for i in range(1, len(s)): if int(s[i - 1: i + 1]) % 4 == 0: ans += i for x in s: if int(x) % 4 == 0: ans += 1 print(ans)

0.567267

s = input() n = len(s) t = 'RBYG' for i in t: ind = s.find(i) % 4 ans = 0 while ind < n: ans += s[ind] == '!' ind += 4 print(ans, end=' ')

0.565722

H, W = 6, 8 KEYBOARD = [ "abcde123fghij456klmno789pqrst.@0uvwxyz_/\u000e ", "ABCDE123FGHIJ456KLMNO789PQRST.@0UVWXYZ_/\u000e ", "^~?!'\"()-:;+&%*=<>€£$¥¤\\[]{},.@§#¿¡\u000e\u000e\u000e_/\u000e "] MAP = [ {c: (i//W, i%W) for i,c in enumerate(KEYBOARD[x])} for x in range(len(KEYBOARD)) ]...

0.564996

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline mii=lambda:list(map(int,input().split())) s=input().strip() d=[0]*1000 e=[0]*1000 hist=[0]*26 for i in s: j=ord(i)-ord('a') for k in range(26): e[k*26+j]+=hist[k] hist[j]+=1 d[j]+=1 print(max(d+e))

0.563927

def total_bill(s): return 2*(s.count("r") - s.count("r")//5)

0.56372

import sys from math import * def minp(): return sys.stdin.readline().strip() def mint(): return int(minp()) def mints(): return map(int, minp().split()) def add(a,b): return (a+b)%1000000007 def sub(a,b): return (a+1000000007-b)%1000000007 def mul(a,b): return (a*b)%1000000007 p = 102367 s = list(map(int,...

0.563218

class Solution: def strongPasswordChecker(self, s): """ :type s: str :rtype: int """ def length_requirement(password): length = len(password) # positive means addition, negative means deletion if length < 6: return...

0.561881

from sys import stdin input = stdin.readline n = int(input()) s = list(input().strip()) for i in range(26): char = chr(ord('z') - i) prev = chr(ord('z') - i - 1) updated = True while updated: updated = False for idx in range(len(s)-1, -1, -1): if s[idx] == char: ...

0.558191

class Solution: def characterReplacement(self, s, k): """ :type s: str :type k: int :rtype: int """ if s == "": return 0 count = {} lo = 0 hi = 0 max_letter = 0 for hi in range(len(s)): try:...

0.557446

class Solution: def numRabbits(self, answers): cnts = collections.Counter(answers) return sum(-v % (k+1) + v for k, v in cnts.items())

0.557387

n = int(input()) m = 6 arr = [] for i in range(n): arr.append(input()) for i in range(n - 1): for j in range(i + 1, n): d = 0 for z in range(6): if arr[i][z] != arr[j][z]: d += 1 if d == 6: m = min(m, 2) elif d == 5: ...

0.55711

s= input() color = "chokudai" d = [] for c in s: if c != color: d.append(c) color = c print(len(d)-1)

0.555684

import collections n = int(input()) li = list(input().split()) c = collections.Counter(li) if len(c) == 3: print('Three') else: print('Four')

0.55561

t = [0] * 26 def get_k(c): return ord(c) - ord('a') def analyze(s): length_of_str = len(s) pos = 0 beauty_table = [0] * 26 for i in range(1, length_of_str): if s[i] != s[pos]: k = get_k(s[pos]) beauty_table[k] = max(beauty_table[k], i - pos) pos = i ...

0.554746

arr = [] for i in input(): arr.append(i) n = len(arr) res = 0 add = [0] * (n + 10) add[n] = 1 / n for i in range(n - 1, 0, -1): add[i] = add[i + 1] + 1 / i for i in range(n): if arr[i] in ['I', 'E', 'A', 'O', 'U', 'Y']: x = min(i, n - i - 1) y = max(i, n - i - 1) res += x + 1 ...

0.55459

class Solution: def maxFreq(self, s: str, maxLetters: int, minSize: int, maxSize: int) -> int: n = len(s) count = collections.Counter(s[i : i + minSize] for i in range(0, n - minSize + 1)) res = 0 for k, v in count.items(): if len(set(k)) <= maxLetters: ...

0.553998

#! env/bin/local python3 # -*- coding: utf-8 -*- sentence: str = input() n_sentence = len(sentence) sentence += '*' counter = 0 results = [] ans = {i+1: 0 for i in range(n_sentence)} for n in range(n_sentence): counter += 1 if sentence[n] != sentence[n+1]: results += [sentence[n], counter] co...

0.553742

n = int(input()) a = input().strip() nextl = [-1] * n lastr = [-1] * n ll = -1 for i in range(n): if a[i] == "R": ll = i if a[i] == "L": ll = -1 lastr[i] = ll nl = -1 for i in range(n - 1, -1, -1): if a[i] == "L": nl = i if a[i] == "R": nl = -1 nextl[i] = nl ans =...

0.553569

def solve(st): return next((n for n in range(len(st)//2, 0, -1) if st[:n] == st[-n:]), 0)

0.553364

str = input() l = len(str) a = [0] * (2 * l) pos = [[] for i in range(26)] for i, c in enumerate(str): t = ord(c) - ord('a') a[i] = t a[i + l] = t pos[t].append(i) ans = 0 for c in range(26): cur = 0 for k in range(1, l): cnt = [0] * 26 for i in pos[c]: cnt[a[i + k]] ...

0.553252

n,pos= (int(x) for x in input('').split()) s = input('') def dis(a, b): a=ord(a) b=ord(b) return min(abs(a - b), abs(a+26-b), abs(b+26-a)) d = [dis(s[i], s[len(s)-i-1]) for i in range((len(s) + 1)//2)] pos -= 1 if pos >= (len(s) + 1) // 2: pos = len(s) - pos - 1 #print(pos) #print(d) for rightmost, ...

0.552482

from collections import * c=Counter() ans=n=int(input()) s=input() k=len(set(s)) i=j=t=0 while j<n: while len(c)<k and j<n: c[s[j]]+=1; j+=1 while len(c)==k: if j-i<ans: ans=j-i c[s[i]]-=1 if c[s[i]]==0: del c[s[i]] i+=1 print(ans)

0.552396

def infected_zeroes(s): m=0; l=0 for i,n in enumerate(s): if n==0: m=i if l==0 else max(m, (i-l+1)//2); l=i+1 return max(m,len(s)-l)

0.552001

import sys def main(): n = int(input()) n = n*2 u = 0 res = 0 x = [] for i in range(n): s = sys.stdin.readline() if s[0] == 'r': u+=1 if len(x)==0: continue if x[-1] == u: x.pop() else: ...

0.55141

s = input() d = dict() d['V'] = 'K' d['K'] = 'V' m = s.count('VK') s = list(s) for i in range(len(s)): s[i] = d[s[i]] m = max(m,''.join(s).count('VK')) s[i] = d[s[i]] print(m)

0.549242

class Solution: def findMinStep(self, board, hand): """ :type board: str :type hand: str :rtype: int """ res=float("inf") hmap=collections.defaultdict(int) for c in hand: hmap[c]+=1 res=self.helper(board,hmap) if...

0.548116

from sys import stdin,stdout import math,bisect from datetime import date from collections import Counter,deque,defaultdict L=lambda:list(map(int, stdin.readline().strip().split())) M=lambda:list(map(int, stdin.readline().strip().split())) I=lambda:int(stdin.readline().strip()) S=lambda:stdin.readline().strip() C=lambd...

0.547885

X = [[], ['0', '1'], ['00', '01', '10', '11'], ['001', '010', '011', '100', '101', '110'], ['0010', '0011', '0100', '0101', '0110', '1001', '1010', '1011', '1100', '1101'], ['00100', '00101', '00110', '01001', '01011', '01100', '01101', '10010', '10011', '10100', '10110', '11001', '11010', '11011'], ['001001', '001011'...

0.546992

""" Codeforces Contest 288 Div 2 Problem C Author : chaotic_iak Language: Python 3.4.2 """ ################################################### SOLUTION def main(): m,t,r = read() w = read() if t < r: return -1 covers = [0]*1000 ct = 0 for i in w: x = covers[i] for j in range(...

0.546035

class Solution: def maxLength(self, arr: List[str]) -> int: def digit_representation(s): ans = 0 for c in s: ans |= 1<<(ord(c)-ord('a')) return ans A = sorted([(len(s), digit_representation(s)) for s in set(arr) if len(set(s))==len(s)], re...

0.544777

n = int(input()) st = input() ans = n now = '' ma = 0 for i in range(n // 2): now += st[i] t = '' for j in range(i + 1, 2 * i + 2): t += st[j] if t == now: ma = i print(ans - ma)

0.544167

s = input() cur_len = 1 a = [] char = [] for i in range(1, len(s)): if s[i] == s[i-1]: cur_len += 1 else: a.append(cur_len) char.append(s[i-1]) cur_len = 1 a.append(cur_len) char.append(s[len(s)-1]) ans = 0 while len(a) > 1: n = len(a) inner_min = 100000000 for i in range(...

0.543388

def frequency(s,n): f=[[0 for i in range(26)]for j in range(n+1)] count=0 for i in range(n): if s[i]!="#": f[count][ord(s[i])-97]+=1 else: count+=1 for j in range(26): f[count][j]=f[count-1][j] return (f,count) def solve(s): n=...

0.543251

t=input() s=input() n=len(s) h=[0]*(n+1) h[0]=0 j=0 fa=[0]*(n+1) for i in range(2,n+1) : while j and s[i-1]!=s[j]: #j=fa[j-1]; j=fa[j]; if s[i-1]==s[j]: j+=1 fa[i]=j; #print(fa) l=list() j=fa[n] while(j>0): l.append(j) j=fa[j] tmp=t t=s s=tmp n=len(s) dp=[0]*(n) m=[0]*n ...

0.542385

class Solution: def maxPower(self, s: str) -> int: n = len(s) count = 0 res = s[0] cur_count = 1 # Traverse string except # last character for i in range(n): # If current character # matches with next ...

0.542172

'''input abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxy...

0.541849

def solve(s): return max(map(len, ''.join(c if c in 'aeiou' else ' ' for c in s).split()))

0.541797

class Solution: def minDeletionSize(self, A: List[str]) -> int: dp = [(1, 1)] * len(A[0]) for i in range(len(dp)): if i > 0: max_pre = None for pre in range(i - 1, -1, -1): for word in A: if word[pre] > word[i]: ...

0.541727

class Solution: def numSplits(self, s: str) -> int: left = [0]*len(s) unique = set() n_distinct = 0 for i, l in enumerate(s): if l not in unique: unique.add(l) n_distinct += 1 left[i] = n_distinct count...

0.540842

class Solution: def minCostToMoveChips(self, position: List[int]) -> int: d = {} a = 0 b = 0 for i in position: if i not in d: d[i]=1 else: d[i]+=1 for i in d: if i%2==0: a +=d[i] ...

0.540641

cnt1 = int(input()) cnt2 = int(input()) cnt3 = int(input()) cnt4 = int(input()) if cnt1 != cnt4: print(0) return if (cnt3 != 0 and cnt1 == 0): print(0) return print(1)

0.539262

from math import ceil n = int(input()) word1 = input() word2 = input() combined = [] for i in range(ceil(n / 2)): if i > n / 2 - 1: combined.append([word1[i], word2[i]]) else: combined.append([word1[i], word1[- i - 1], word2[i], word2[- i - 1]]) count = 0 for l in combined: s = set(l) ...

0.538704

class Solution: def maxVowels(self, s: str, k: int) -> int: n = len(s) vowel = set(['a','e','i','o','u']) i=0 res = 0 while i<k: if s[i] in vowel: res+=1 i+=1 j=k i=0 maxV = res while j<n: if ...

0.537719

def replace_zero(arr): m, im, i, lst = 0, -1, -1, ''.join(map(str,arr)).split('0') for a,b in zip(lst,lst[1:]): i += len(a) + 1 candidate = len(a)+len(b)+1 if m <= candidate: im, m = i, candidate return im

0.537669

n,k = list(map(int, input().split())) b = list(map(int,input().split())) SSSSSSSSSS = input() INF = 1000*1000*1000+123 RRRR = []; WWWWWWW = []; OOOOOOOOO = []; for i in range(n): if SSSSSSSSSS[i] == 'R': RRRR.append(b[i]) elif SSSSSSSSSS[i] == 'W': WWWWWWW.append(b[i]) else: OOOOO...

0.536744

input() print(max(0, sum(len(s) + 1 for s in ''.join(input().split()).split('0') if s) - 1))

0.536692

class Solution: def longestDecomposition(self, text: str) -> int: n = len(text) splits = 0 leftstart, leftend = 0, 0 rightstart, rightend = n-1, n-1 while leftend<rightstart: if text[leftstart:leftend+1] == text[rightstart:rightend+1]: leftstart = ...

0.535616

for _ in range(int(input())): st=input().replace("=","") if not len(st):print(1) else: cu=mx=1 for j in range(1,len(st)): if st[j]==st[j-1]:cu+=1 else:mx=max(mx,cu);cu=1 print(max(mx+1,cu+1))

0.535363

import re H, W = 6, 8 KEYBOARD = "abcde123fghij456klmno789pqrst.@0uvwxyz_/* " MAP = {c: (i//W, i%W) for i,c in enumerate(KEYBOARD)} def manhattan(*pts): dxy = [abs(z2-z1) for z1,z2 in zip(*pts)] return 1 + sum( min(dz, Z-dz) for dz,Z in zip(dxy, (H,W)) ) def toggle(m): ups, end = m.groups() ...

0.535192

pos = {"L4":0, "L3":1, "L2":2, "L1":3, "L0":4, "R0":4, "R1":5, "R2":6, "R3":7, "R4":8} def tetris(arr): current, res = [0]*9, 0 for x in arr: p = pos[x[1:]] current[p] += int(x[0]) if current[p] >= 30: break y = min(current) if y: current, res = [v-y for v in current], r...

0.534872

class Solution: def minFlipsMonoIncr(self, S: str) -> int: onesSoFar = 0 partial = 0 for n in S: if n == '0': partial = min(onesSoFar, partial+1) else: onesSoFar += 1 return partial

0.534507

N=int(input()) S=input() ans=S[0] for s in S: if ans[-1]!=s: ans+=s print(len(ans))

0.53449

n, k = [int(i) for i in input().split()] dic = dict() s = list(input()) i = 0 while i<n: j = 1 while i+j < n and s[i] == s[i+j]: j+=1 if s[i] not in dic: dic[s[i]] = [] dic[s[i]].append(j) i += j ans = 0 for i in list(dic.keys()): ct = 0 for j in dic[i]: ct+=(j//k...

0.534394

from sys import stdin import math rgb = 'RGB' for query in range(int(stdin.readline())): n, k = list(map(int, stdin.readline().split())) s = stdin.readline() ans = math.inf for start in range(3): dp = [0 for i in range(n + 1)] for i in range(n): cur = rgb[(start + i) % le...

0.53388

#credits https://www.geeksforgeeks.org/minimum-steps-to-delete-a-ssing-after-repeated-deletion-of-palindrome-subssings/ n=int(input()) s=input() N = len(s) dp = [[0 for x in range(N + 1)] for y in range(N + 1)] D = [[[] for x in range(N + 1)] for y in range(N + 1)] ss="" re="" for i in range(0,N)...

0.533454

def countzero(s): return sum(1 if c in 'abdegopq069DOPQR' else 2 if c in '%&B8' else 0 for c in s.replace('()', '0'))

0.53278

#scott http://codeforces.com/problemset/problem/265/A new problem RO = input() # darn i don't know how to read string ins = input() #scott n = 0 for x in range (len(ins)): #scott yeah that looks fine #print (x) if ins[x] == RO[n]: n += 1 #scott print(n+1)

0.532316

class Solution: def minNumberOfFrogs(self, croakOfFrogs: str) -> int: # valid string? can be seperated into full croaks: ### dict of letters. c, r, o, a, k should all be equal, nothing else in if len(croakOfFrogs)%5!=0 or croakOfFrogs[0]!='c' or croakOfFrogs[-1]!='k': return -1 ...

0.531545

def binarySearch(arr, l, r, x): mid=0 while l <= r: mid = l + (r - l)//2; if arr[mid] == x: return mid+1 elif arr[mid] < x: l = mid + 1 else: r = mid - 1 if mid!=len(arr): if arr[mid]<x: return mid+1 return mid s=input() strt=[] end=[] plc=[] landr=[] l2r=[] lr=[] ans=0 n=len(s) if n!=1:...

0.531045

import sys def main(): mx = 1 n = int(input()) D = {} D["polycarp"] = 1 for i in range(n): s, r, t = input().split() s = s.lower() t = t.lower() D[s] = D[t] + 1 mx = max(mx, D[s]) print(mx) main()

0.530687

import sys input = sys.stdin.readline def main(): n, k = map(int, input().split()) string = input().strip() if "W" not in string: ans = min(n, k) * 2 - 1 print(max(ans, 0)) return L_s = [] cnt = 0 bef = string[0] ans = 0 for s in string: if s == ...

0.530678

# cook your dish here s = input().strip() start_w = 27 w_dict = {} words = ["A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M", "N", "O", "P", "Q", "R", "S", "T", "U", "V", "W", "X", "Y", "Z"] for word in words: w_dict[word] = start_w start_w = start_w - 1 total_wt = 0 for c in s: total_wt = t...

0.529849

s = input() res = set() for i in range(len(s) + 5): s = s[1:] + s[0] res.add(s) print(len(list(res)))

0.528832

n = int(input()) a = list(map(int, input().split())) cnt, good = 0, 0 for i in range(0, n): if a[i] == 4 or a[i] == 5: good = good + 1 else: good = 0 if good == 3: cnt = cnt + 1 good = 0 print(cnt)

0.528321

from collections import * h,q=list(map(int,input().split())) d=defaultdict(lambda:0) d[2**h]=0 d[2**(h-1)]=0 for _ in range(q): i,l,r,a=list(map(int,input().split())) l,r=l*2**(h-i),(r+1)*2**(h-i) if a:d[1]+=1;d[l]-=1;d[r]+=1 else:d[l]+=1;d[r]-=1 s=0 l=0 D=sorted(d.items()) for (a,x),(b,_) in zip(D,D[1:]): s+=x i...

0.52797

import sys n = int(sys.stdin.readline().strip()) s = sys.stdin.readline().strip() alph = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" arr = [0]*26 pref = [] for i in range(len(s)): for j in range(26): if alph[j] == s[i]: arr[j] += 1 break pref += [arr[:]] # for x in pref: # print(x) q = int(sys.std...

0.525074

class Solution: def getLengthOfOptimalCompression(self, s: str, k: int) -> int: n = len(s) def compLen(c): return 1 + len(str(c)) if c > 1 else 1 @lru_cache(None) def dp(i, k): # return {head: (len, -head_count)} if (n - i) <= k: return {} # ...

0.523679

from collections import Counter try: for _ in range(int(input())): n=int(input()) s=input() d1=dict(Counter(s)) u,d,r,l=0,0,0,0 if 'U' in d1: u=d1['U'] else: u=0 if 'D' in d1: d=d1['D'] else: d=0 if 'R' in d1: r=d1['R'] else: r=0 if 'L' in d1: l=d1['L'] else: l=0 x=...

0.523602

from itertools import groupby def replace(s): queue, rle = {}, [[i, k, len(list(g))] for i, (k, g) in enumerate(groupby(s))] for i, k, l in reversed(rle): if l not in queue: queue[l] = {} queue[l].setdefault(k, []).append(i) for l in queue: while sum(map(bool, queue[l].values())) > ...

0.523356

import numpy as np import sys input = sys.stdin.readline H,W = list(map(int,input().split())) S=np.array([list(input().rstrip("\n")) for _ in range(H)]) == '.' D = np.zeros((H,W),dtype=int) U = np.zeros((H,W),dtype=int) L = np.zeros((H,W),dtype=int) R = np.zeros((H,W),dtype=int) # 上下 for i in range(H): U[i] = (U[i...

0.521735

class Solution: def removePalindromeSub(self, s: str) -> int: # 'a' 1 # 'aa' 1 # 'ab' 2 # 'abb' 2 # 'aabb' 2 # 'abba' 1 # 'abaaba' if len(s) == 0: return 0 if s == s[::-1]: return 1 return 2

0.521729

#include<sdg.h> for _ in range(int(input())): s=input() n=len(s) if n==1: if s[0].isalpha(): print("-32") else: print(0) else: num,ch=0,0 p,q=0,0 c=1 x=s[0] ans="" for i in range(1,n): if s[i-1]==s[i]: c+=1 ...

0.521505

def solution(s): st=[1 for i in range(1,len(s)) if s[i-1]==s[i]] return sum(st)

0.521406

# # abc096 b # import sys from io import StringIO import unittest from collections import Counter class TestClass(unittest.TestCase): def assertIO(self, input, output): stdout, stdin = sys.stdout, sys.stdin sys.stdout, sys.stdin = StringIO(), StringIO(input) resolve() sys.stdout.se...

0.521062

class Solution: def maxUniqueSplit(self, s: str) -> int: self.x, n = 0, len(s) def maxUniqueSplit_(i=0, S=set()): if s[i:] not in S: self.x = max(self.x, len(S) + 1) for j in range(i + 1, n): if s[i : j] not in S and len(S) + 1 + n...

0.520862

class Solution: def lengthOfLongestSubstring(self, s): """ :type s: str :rtype: int """ L, res, last = -1, 0, {} for R, char in enumerate(s): if char in last and last[char] > L: L = last[char] elif R-L > res: ...

0.520725

s=input().strip() n=len(s) i=0 k=1 j=0 while i<n: #print(i,j) j=i i+=1 while i<n and s[i]=='0': i+=1 if j>i-j: k+=1 elif j==i-j: if s[:j]>=s[j:i]: k+=1 else: k=1 else: k=1 print(k)

0.51962

now = "a" ans = 0 S = input() for s in S: x = abs(ord(s) - ord(now)) ans += min(x, 26 - x) now = s print(ans)

0.519616

Given a positive integer N, return the number of positive integers less than or equal to N that have at least 1 repeated digit. Example 1: Input: 20 Output: 1 Explanation: The only positive number (<= 20) with at least 1 repeated digit is 11. Example 2: Input: 100 Output: 10 Explanation: The positive numbers (<= 1...

class Solution: def numDupDigitsAtMostN(self, N: int) -> int: # N -> total numbers less than or equal to N # We will calculate the integers with all different digits (which are less than/equal to N) # Then the answer would be: N - nums_with_different_digits # Calculate the n...

0.733435

class Solution: def countNumbersWithUniqueDigits(self, n): """ :type n: int :rtype: int """ ls = [1,10,91] mul = 9 res = 0 for i in range(8): mul = 9 m = 9 for j in range(i+2): ...

0.700819

def persistence(n): n = str(n) count = 0 while len(n) > 1: p = 1 for i in n: p *= int(i) n = str(p) count += 1 return count # your code

0.68514

n=input() rg=[0]*10 for i in n: rg[int(i)]+=1 rl=[] ff=0 for i in range(len(rg)): if rg[i]!=0: rl.append(rg[i]) if i==0: ff=1 fact=[1] fc=1 for i in range(1,20): fc*=i fact.append(fc) rt=[] t=0 def cfs(d): if d==len(rl): nonlocal t,ff jj=fact[sum(rt)] for i in rt:...

0.68356

def nb_dig(n, d): return sum(str(i*i).count(str(d)) for i in range(n+1))

0.679649

N = int(input()) keep = [[0 for i in range(10)] for j in range(10)] ans = 0 for i in range(1, N + 1): first = int(str(i)[0]) end = int(str(i)[-1]) keep[first - 1][end - 1] += 1 for i in range(9): for j in range(9): ans += (keep[i][j] * keep[j][i]) print(ans)

0.676324

def get_num(n): return sum({'0': 1, '6': 1, '9': 1, '8': 2}.get(d, 0) for d in str(n))

0.672709

from operator import mul from math import factorial from functools import reduce from collections import Counter def perms(inp): return factorial(len(str(inp))) // reduce(mul, map(factorial, Counter(str(inp)).values()), 1)

0.667944

class Solution: def countDigitOne(self, n): """ :type n: int :rtype: int """ ones, m = 0, 1 while m <= n: ones += (n // m + 8) // 10 * m + (n // m % 10 == 1) * (n % m + 1) m *= 10 return ones

0.667879

s=input() ans=0 i=1 past=int(s[0]) c=1 ans=1 while(i<len(s)): if(int(s[i])+past==9): c+=1 past=int(s[i]) else: if(c%2==1 and c!=1): ans*=(c//2+1) c=1 past=int(s[i]) i+=1 if(c!=1 and c%2==1): ans*=(c//2+1) print(ans)

0.654316

class Solution: def atMostNGivenDigitSet(self, digits: List[str], n: int) -> int: count = 0 length = 1 n_str = str(n) while length < len(n_str): count+= len(digits)**length length+=1 digits_sorted = sorted(digits) ## now length shou...

0.640315

class Solution: memory = {} largest = [0] trackerForLargest = {} largestSize = [0] numGroups = [0] def countLargestGroup(self, n: int) -> int: if n > self.largest[0]: for num in range(self.largest[0] + 1, n + 1): curr = num currSum = 0 ...

0.639654

masks = [0] * 10 for i in range(10 ** 4): for c in str(i): masks[int(c)] |= 1 << i def find_num(n): seq, x = 1, 0 for j in range(n): M = seq for m in masks: if x & m: M |= m x = ~M & (M+1) seq |= x return x.bit_length() - 1

0.637849

class Solution: def findIntegers(self, num): """ :type num: int :rtype: int """ dp=[1,2] for i in range(2,32): dp.append(dp[i-1]+dp[i-2]) bnum=bin(num)[2:] size=len(bnum) ans=dp[size] for i in range(1,s...

0.632393

import fractions import sys f = sys.stdin if len(sys.argv) > 1: f = open(sys.argv[1], "rt") sum_cache = {} def sum_func(x): if x < 10: return x r = sum_cache.get(x) if r is not None: return r xx = 0 while x > 0: xx += x % 10 x /= 10 r = sum_func(xx) ...

0.62936

def single_digit(n): while n > 9: n = bin(n).count("1") return n

0.622594

def count_pal(n): # No recursion; direct calculation: return [9 * 10**((n-1) // 2), 10**(n // 2) * (13 - 9 * (-1)**n) // 2 - 2]

0.622358

from itertools import count # Couldn't find the pattern of why it's 1 or 8, I'm sad :( def repeat_sequence_len(n): memo = {} for i in count(): if n in memo: return i - memo[n] memo[n] = i n = sum(d*d for d in map(int, str(n)))

0.621291

from math import factorial as fact def sum_arrangements(n): s = str(n) perms = fact(len(s)-1) coefAll = int('1'*len(s)) return coefAll*perms*sum(map(int,s))

0.621136

def subsets(collection): if len(collection) == 1: yield [collection] return first = collection[0] for smaller in subsets(collection[1:]): yield [first] + smaller for n, subset in enumerate(smaller): yield smaller[:n] + [first + subset] + smaller[n+1:] def bucke...

0.620987

# ========== //\\ //|| ||====//|| # || // \\ || || // || # || //====\\ || || // || # || // \\ || || // || # ========== // \\ ======== ||//====|| # code def solve(): x = int(input()) ans = 0 ok = 0 ...

0.618152

darling = {} x = int(input()) ans = 0 while (x not in darling): darling[x] = 1 ans += 1 x += 1 while (x % 10 == 0): x /= 10 print(ans)

0.613788

#!/usr/bin/env python def main(): N = int(input()) C = 0 for n in range(N): S = input().strip() Pi = S.split()[-1] L = [Pi.count(k) for k in map(str, list(range(10)))] if L[8] >= L[5] and L[5] >= L[3] and \ L[0] == 0 and L[1] == 0 and \ L[2] == 0 and L[4] == 0 and \ L[6] == 0 and L[7] == 0 and \ ...

0.609872

from sys import stdin as cin from sys import stdout as cout def main(): n = int(cin.readline()) o = 0 for x in range(9, 0, -1): if 10 ** x // 2 <= n: ##print(x) for i in range(9): q = 10 ** x * (i + 1) // 2 - 1 if q <= n: o...

0.607124

def count_zeros_n_double_fact(n): if n % 2 != 0: return 0 k = 0 while n >= 10: k += n // 10 n //= 5 return k

0.605866

from operator import mul from functools import reduce def unique_digit_products(nums): return len({reduce(mul, (int(a) for a in str(num))) for num in nums})

0.60319

s=input()[::-1] alist=[0]*2019 num1=0 num2=1/10 lens=len(s) for i in range(lens): num2=int(((num2)*10)%2019) num1=(num1+int(s[i])*(num2))%2019 alist[num1]+=1 alist[0]+=1 ans=0 for i in range(2019): ans+=alist[i]*(alist[i]-1)//2 print(ans)

0.601791

def sum_part(n): m, p, q, r, s = 1, 1, 1, 0, n while n > 9: n, d = divmod(n, 10) r += d * p p *= 10 if d: m = 1 else: m*= 2 s += q*n + m*memo[r] q *= 2 return s from collections import defaultdict qualified = defaultdict(list) memo = {n: n for n in ra...

0.601245

from math import factorial from string import digits, ascii_uppercase DIGITS = digits + ascii_uppercase FACTORIALS = [1, 1] f = 1 for i in range(2, 36): f *= i FACTORIALS.append(f) def dec2FactString(nb): ret = [] for f in reversed(FACTORIALS): (d, nb) = divmod(nb, f) if d or ret: ...

0.598966

def sel_number(n, d): cnt = 0 for a in range(12, n + 1): nums = list(map(int, str(a))) if nums == sorted(set(nums)) and \ all(c - b <= d for b, c in zip(nums[:-1], nums[1:])): cnt += 1 return cnt

0.598524

# precalculate results results = {} n, digits = 1, 0 while digits <= 1000: digits = len(str(sum( x**(n-x+1) for x in range(1, n) ))) if digits not in results: results[digits] = n n += 1 def min_length_num(digits, max_num): n = results.get(digits, 0) return [True, n+1] if n and n < max_num...

0.597212

from math import log10 def rocks(n): return (n + 1) * int(log10(n) + 1) - (10 ** int(log10(n) + 1) - 1) // 9

0.596908

from collections import defaultdict n = int(input()) s_dict = defaultdict(int) for i in range(n): s_int = [0] * 26 s = list(input()) for si in s: s_int[ord(si) - ord('a')] += 1 cnt = 0 for s_int_i in s_int: cnt *= 10 cnt += s_int_i s_dict[cnt] += 1 ans = 0 for key in s_dict: ans += s_dict[key]...

0.596766

s=input() dp0=[0]*(len(s)+1) dp1=[0]*(len(s)+1) dp1[0]=1 for i in range(1,len(s)+1): n=int(s[i-1:i]) dp0[i]=min(dp0[i-1]+n,dp1[i-1]+10-n) dp1[i]=min(dp0[i-1]+(1 if n+1==10 else n+1),dp1[i-1]+10-n-1) print(dp0[-1])

0.595861

T = 1 for test_no in range(T): MAXK = 5000 n = int(input()) cnt = [0] * (MAXK + 1) primeExponential = [[0 for j in range(MAXK + 1)] for i in range(MAXK + 1)] line, num = (input() + ' '), 0 for c in line: if c != ' ': num = num * 10 + (ord(c) - 48) else: cnt[num] += 1 num = 0 for i in range(2, MAXK + ...

0.593712

def digits(n): return len(str(n))

0.590405

def solve(s): return sum(i+1 for i,d in enumerate(list(s)) if d in '13579')

0.589381

from operator import mul from functools import reduce def genSequence(n): yield n while True: n += reduce(mul, [int(d) for d in str(n) if d != '0']) if n > 9 else n yield n def extract(seq, v): return sorted(seq).index(v) def convergence(n): gen1, genN = genSequence(1), genSequence(n)...

0.586025

#CF Round 150. Div II Prob. A - Dividing Orange import sys dp = [[[-1 for j in range(3)] for i in range (1 << 10)] for k in range(11)] In = sys.stdin n = In.readline().strip() def go (idx, mask, equal): if dp[idx][mask][equal] != -1: return dp[idx][mask][equal] if bin(mask).count("1") > 2: re...

0.585101

from math import * def count(n): return ceil(lgamma(n+1)/log(10))

0.584554

hola = 0 a = int(input()) d = len(str(a)) k = 10**(d-1) for i in range(1, d): hola += i * (10**(i-1)*9) hola += d * (a-k+1) print(hola)

0.58303

import math def count(n): if n is 0: return 0 x = int(math.log(n, 2)) return x * 2 ** (x - 1) + n - 2 ** x + 1 + count(n - 2 ** x) def countOnes(left, right): return count(right) - count(left - 1)

0.5772

n = int(input()) def p(x): ans = 1 while x > 0: ans *= x % 10 x //= 10 return ans ans = p(n) for i in range(len(str(n))): cans = 9 ** i * p((n // 10 ** i) - 1) ans = max(ans, cans) print(ans)

0.575764

def look_and_say_and_sum(N): l=[1] for n in range(N-1): result = [1,l[0]] for i in range(1,len(l)): if l[i]==result[-1]: result[-2] += 1 else: result += [1,l[i]] l=result return sum(l)

0.574919

from functools import reduce def product(ar): return reduce(lambda x,y:x*y, ar) def something_acci(num_digits): seq = [1, 1, 2, 2, 3, 3] while(len(str(seq[-1])) < num_digits): seq.append(product(seq[-3:]) - product(seq[-6:-3])) return (len(seq), len(str(seq[-1])))

0.574906

n=input() ls='' t=0 for i in range(len(n)): if int(n[i])%3==0: ls='' t+=1 else: ls+=n[i] for j in range(0,len(ls)): if int(ls[j:])%3==0: t+=1 ls='' break print(t) ''' //////////////// ////// /////// ...

0.574807

from math import floor, log def count_sixes(n): return floor((n - n % 2) * log(2, 10))

0.574066

def solve(n): def length(n): s = 0 for i in range(20): o = 10 ** i - 1 if o > n: break s += (n - o) * (n - o + 1) // 2 return s def binary_search(k): n = 0 for p in range(63, -1, -1): if length(n + 2 ** p) < k: n += 2 ** p ...

0.571448

# -*- coding: utf-8 -*- ngoods = { '0': 2, '1': 7, '2': 2, '3': 3, '4': 3, '5': 4, '6': 2, '7': 5, '8': 1, '9': 2 } digits = input().strip() print(ngoods[digits[0]] * ngoods[digits[1]])

0.569386

def colorful(number): base_result = [] for x in str(number): base_result.append(int(x)) for y in range(len(base_result) - 1): temp = base_result[y] * base_result[y + 1] base_result.append(temp) # Should you really eval the last value ? :shrug: If so, would use eval return len...

0.568824

N = int(input()) i = N + 1 flag = 0 for i in range(N+1, 987654321): a = str(i) b = list(a) c = set(a) if '0' not in b: if len(b) == len(c): print(i) flag += 1 break if flag < 1: print(0)

0.565352

import sys sys.setrecursionlimit(10000) n = input() k = int(input()) m = {} def doit(n, k): if len(n) == 0: return k == 0 d = int(n[0]) if (n, k) not in m: ret = 0 for i in range(d + 1): if i == d: ret += doit(n[1:], k - 1 if i > 0 else k) e...

0.561775

def solve(n): if n < 10: return n a = int((len(str(n)) - 1) * '9') b = n - a return sum([int(i) for i in (list(str(a)) + list(str(b)))])

0.561351

def compute_depth(n): i = 0 digits = set() while len(digits) < 10: i += 1 digits.update(str(n * i)) return i

0.56115

MEMO = [] def sum_dif_rev(n): i = MEMO[-1] if MEMO else 0 while len(MEMO) < n: i += 1 r = int(str(i)[::-1]) if i % 10 and r != i and (i + r) % abs(r - i) == 0: MEMO.append(i) return MEMO[n-1]

0.56079

def champernowne_digit(n): if not type(n) is int or n < 1: return float("NaN") i, l = 1, 11 while l <= n: i, l = i + 1, l + 9 * (i + 1) * 10**i return ((n - l) // (i * 10**(i - 1 - (n - l) % i))) % 10 champernowneDigit = champernowne_digit

0.560725

from itertools import permutations def sc_perm_comb(num): sNum = str(num) return sum({ int(''.join(p)) for d in range(1, len(sNum)+1) for p in permutations(sNum, d) })

0.560056

def dlog(x, n): bigMod = 5 ** n ans = [None, 0, 1, 3, 2][x % 5] val = 2 ** ans % bigMod mod, phi = 5, 4 phiVal = 2 ** phi % bigMod for i in range(2, n + 1): nextMod = mod * 5 while val % nextMod != x % nextMod: val = val * phiVal % bigMod ans += phi phi *= 5 phiVal = (phiVal * ...

0.558895

def number_of_carries(a, b): ans, carrie = 0, 0 while a > 0 or b > 0: carrie = (a%10 + b%10 + carrie) // 10 ans += [0,1][carrie > 0] a //= 10 b //= 10 return ans

0.558289

sum_dig = lambda n, D={str(d): d*d for d in range(10)}: sum(map(D.get, str(n))) is_happy = lambda n: n > 4 and is_happy(sum_dig(n)) or n == 1 happy_set = set(filter(is_happy, range(100))) for n in range(100, 3 * 10 ** 5): if sum_dig(n) in happy_set: happy_set.add(n) from bisect import bisect def performant_number...

0.558043

cache = {} def sum_div(x): if x not in cache: cache[x] = sum(i for i in range(1, x+1) if x % i == 0) return cache[x] def is_required(x): reversed = int(str(x)[::-1]) return x != reversed and sum_div(x) == sum_div(reversed) required = [x for x in range(528, 10**4) if is_required(x)] def equal_...

0.556856

x=int(input()) def s(a): r=0 while a>0: r+=a%10 a//=10 return r def d(a,b): r=0 for i in range(6): if a%10!=b%10: r += 1 a//=10 b//=10 return r c=6 for i in range(1000000): if s(i%1000)==s(i//1000): c=min(c,d(x,i)) print(c)

0.556846

def self_converge(number): n, cycle = str(number), set() while n not in cycle: cycle.add(n) s = ''.join(sorted(n)) n = '%0*d' % (len(n), int(s[::-1]) - int(s)) return -1 if not int(n) else len(cycle)

0.556205

d, polydivisible, arr = 1, [], list(range(1, 10)) while arr: d += 1 polydivisible.extend(arr) arr = [n for x in arr for n in range(-(-x*10 // d) * d, (x+1) * 10, d)] def next_num(n): from bisect import bisect idx = bisect(polydivisible, n) if idx < len(polydivisible): return ...

0.556199

class Solution: dp = [[1] * 10] def knightDialer(self, n: int) -> int: MOD = 10 ** 9 + 7 jump = [[4, 6], [6, 8], [7, 9], [4, 8], [3, 9, 0], [], [0, 1, 7], [2, 6], [1, 3], [2, 4]] for i in range(len(self.dp), n): new = [0] * 10 for j in range(10): n...

0.555959

from itertools import combinations def digits(num): return list(map(sum, combinations(map(int,str(num)),2)))

0.555475

ls = ['11', '13', '17', '19', '23', '29', '31', '37', '41', '43', '47', '53', '59', '61', '67', '71', '73', '79', '83', '89', '97'] def solve(a,b): i = a s = 0 while i < b: if (i*i-i)%100==0 and str(i)[:2] in ls and str(i*i)[:2] in ls: s += 1 i += 1 return s

0.554499

digits = lambda x: set(str(x)) def LDTA(n): if digits(n) == digits(n*n): return None seen = [] x = n while len(seen) < 10: for d in str(x): if d not in seen: seen.append(d) x *= n return int(seen[-1])

0.554457

class Solution: def countArrangement(self, N): """ :type N: int :rtype: int """ d = { 1:1, 2:2, 3:3, 4:8, 5:10, 6:36, 7:41, 8:132, 9:250, 10:700, 11:750, 12:4010, 13:4237, 14:10680, 15:24679 } return d.get(N, N)

0.554342

n = int(input()) a = int(str(n)[0]) l = len(str(n)) - 1 val1 = a * 10 ** l - 1 val2 = n - val1 def sd(x): return sum(int(d) for d in str(x)) print(sd(val1) + sd(val2))

0.553354

def per(n): r = [] while n>=10: p=1 for i in str(n): p=p*int(i) r.append(p) n = p return r

0.552021

from collections import Counter def is_dd(n): return any(value==count for value, count in Counter(int(x) for x in str(n)).items())

0.551735

import sys input = sys.stdin.readline from fractions import gcd import numpy as np MOD = 10 ** 9 + 7 S = int(input()) M = 10**4 def type_1(S): cnt = 0 # S 2種の桁数k,k+1からなる。さらにk>=9を仮定する。 # 項数nとすると、kn < S < (k+1)n となる(k,n)の個数を数える # まずk > Mとなるものを数える。このとき1<=n<=Mである。 n = np.arange(1,M+1) k_max = (...

0.551681

REV = {'6':'9', '9':'6'} BASE = set("01869") def isReversible(n): s = str(n) return ( not (set(s) - BASE) # contains only reversible characters and (not len(s)%2 or s[len(s)//2] not in "69") # does not contain 6...

0.551282

n = int(input()) num = 0 for x in range(1, 110000): if n % x == 0: num = num + 1 print(num - 1)

0.55

from fractions import Decimal, gcd from operator import mul from functools import reduce lcm = lambda a, b=1: a * b // gcd(a, b) def parameter(n): digits = Decimal(n).as_tuple().digits return lcm(sum(digits), reduce(mul, digits))

0.549897

start = input() counter = 0 sInt = int(start) while sInt!=0: sInt-=max([int(c) for c in start]) start=str(sInt) counter+=1 print(counter)

0.549816

from collections import Counter def self_descriptive(num): s = [int(a) for a in str(num)] cnt = Counter(s) return all(cnt[i] == b for i, b in enumerate(s))

0.549677

class Solution: def numTilePossibilities(self, tiles: str) -> int: res = 0 freqs = [f + 1 for f in Counter(tiles).values()] for t in itertools.product(*map(range, freqs)): n = sum(t) subtotal = math.factorial(n) for freq in t: subtotal //= ...

0.548042

def hamming(n): bases = [2, 3, 5] expos = [0, 0, 0] hamms = [1] for _ in range(1, n): next_hamms = [bases[i] * hamms[expos[i]] for i in range(3)] next_hamm = min(next_hamms) hamms.append(next_hamm) for i in range(3): expos[i] += int(next_hamms[i] == next_hamm)...

0.547119

def two_count(n): res = 0 while not n & 1: res += 1 n >>= 1 return res

0.545766

def bouncy_count(m): num = den = 1 for i in range(1, 11): num *= m + i + i * (i == 10) den *= i return 10 ** m - num // den + 10 * m + 1

0.545662

n = int(input()) t = input() if n == 1: if t == "0": print((10 ** 10)) else: print((2 * 10 ** 10)) elif n == 2: if t == "00": print((0)) elif t == "01": print((10 ** 10 - 1)) elif t == "10": print((10 ** 10)) else: # 11 print((10 ** 10)) else: ...

0.545262

import math def nth_perm(n,d): digits = [str(i) for i in range(d)] out = '' for i in range(1, d): cycles = math.ceil(n/math.factorial(d-i)) out += digits.pop((cycles % (d-i+1)) - 1) return out + digits.pop()

0.545142

def fusc(n): a, b = 1, 0 for i in bin(n)[2:]: if i == '1': b += a else: a += b return b

0.545121

from itertools import permutations def permutation_average(n): perms = [float(''.join(e)) for e in permutations(str(n))] return int(round(sum(perms) / len(perms)))

0.543497

series = [0] for a in range(2, 99): for b in range(2, 42): c = a**b if a == sum(map(int, str(c))): series.append(c) power_sumDigTerm = sorted(series).__getitem__

0.543234

def solve(n): moves = [] for a, b in ["25", "75", "50", "00"]: s = str(n)[::-1] x = s.find(a) y = s.find(b, x+1 if a == "0" else 0) if x == -1 or y == -1: continue moves.append(x + y - (x > y) - (a == b)) s = s.replace(a, "", 1).replace(b, "", 1) ...

0.542766

from re import findall def f(num): if num == 0: return 1 else: return num*f(num-1) dic = {1: [0,1,2,3,53,52],2: [4,5,6,7,50,51],3: [8,9,10,11,48,49], 4: [12,13,14,15,47,46], 5: [16,17,18,19,44,45],6:[20,21,22,23,42,43], 7:[24,25,26,27,40,41],8:[28,29,30,31,38,39],9:[32,33,34,35,36,37]} def test(): nonlocal i...

0.542626

def gen(n): if n >= 10**16: return for i in range(10): x = 10*n + i if x % sum(map(int, str(x))): continue yield x for y in gen(x): yield y L = sorted(x for n in range(1, 10) for x in gen(n)) from bisect import bisect_left as bl, bisect_right as br def rthn_between(a, b): re...

0.542592

# add 0,4,9,49 # this is a stupid solution import sys #sys.stdin=open("data.txt") input=sys.stdin.readline n=int(input()) # do a stupid approach dp=[0]*150 s=set([0]) for i in range(150): dp[i]=len(s) s2=set(s) for j in s: s2.add(j+4) s2.add(j+9) s2.add(j+49) s=s2 if 0: ...

0.542067

def get_sum_of_digits(num): return sum(map(int, str(num)))

0.541815

from itertools import combinations_with_replacement def find_all(sum_dig, digs): combs = combinations_with_replacement(list(range(1, 10)), digs) target = [''.join(str (x) for x in list(comb)) for comb in combs if sum(comb) == sum_dig] if not target: return [] return [len(target), int(target[0])...

0.540418

from scipy.special import comb def almost_everywhere_zero(n, k): if k == 0: return 1 first, *rest = str(n) l = len(rest) return 9**k*comb(l, k, exact=True) +\ (int(first)-1)*9**(k-1)*comb(l, k-1, exact=True) +\ almost_everywhere_zero(int("".join(rest) or 0), k-1)

0.540016

import sys def GRIG(L): LENT = len(L) MINT = 1 GOT = 0 DY = [ [{x: 0 for x in range(0, 10)}, 0, 0] ] for i in L: DY.append([{x: 0 for x in range(0, 10)}, 0, 0]) GOT += 1 for j in range(0, GOT): if DY[j][0][i] == 1: DY[j][0][i] = 0 ...

0.539907

def count_me(data): if not data.isdigit(): return '' result = [] count = 1 last = data[0] for char in data[1:]: if char == last: count += 1 else: result.append(str(count) + last) last = char count = 1 result.a...

0.5393

score = lambda sub_gen: lambda n: sum(int(''.join(sub)) for length in range(1, len(str(n)) + 1) for sub in sub_gen(str(n), length)) score1 = score(__import__('itertools').combinations) score2 = score(lambda s, r: (s[i: i+r] for i in range(len(s) - r + 1))) divs = lambda n: set.union(*({d, n // d} for d in range(1, int...

0.539158

def zeros(n): """ No factorial is going to have fewer zeros than the factorial of a smaller number. Each multiple of 5 adds a 0, so first we count how many multiples of 5 are smaller than `n` (`n // 5`). Each multiple of 25 adds two 0's, so next we add another 0 for each multiple of 25 sma...

0.53862

class Solution: def findNthDigit(self, n): """ :type n: int :rtype: int """ i=count=9 while count < n: i *= 10 count += i * len(str(i)) div, mod = divmod(n-(count-i*len(str(i))), len(str(i))) print(i, count, div, mod)...

0.538347

# cook your dish here x=input () y=len (x) if y==1: print('1') elif y==2: print('2') elif y==3: print('3') elif y>3: print('More than 3 digits')

0.53761

def sort_str(s): o = [] for c in s: o.append(c) o.sort() return "".join(o) def find_ana(s): if len(s) <= 1: return 0 h = {} c = 0 for i in range(len(s)): for j in range(i+1, len(s)+1): t = sort_str(s[i:j]) if t in h: c += h[t] ...

0.537492

Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push and pop operations on an initially empty stack. Example 1: Input: pushed = [1,2,3,4,5], popped = [4,5,3,2,1] Output: true Explanation: We might do the following sequence: push(...

class Solution: def validateStackSequences(self, pushed: List[int], popped: List[int]) -> bool: j = 0 l = [] for i in pushed: l.append(i) while l and (l[-1] == popped[j]): l.pop() j += 1 if l: return False re...

0.805466

class Solution: def canBeEqual(self, target: List[int], arr: List[int]) -> bool: return sorted(target) == sorted(arr)

0.554492

class Solution: def isIdealPermutation(self, A): """ :type A: List[int] :rtype: bool """ # tle # for i in range(len(A)-2): # if A[i] > min(A[i+2:]): # return False # return True # ac for...

0.553499

def are_similar(a, b): return sorted(a) == sorted(b) and sum(i != j for i, j in zip(a, b)) in [0, 2]

0.548949

def same(arr_a, arr_b): return sorted(map(sorted, arr_a)) == sorted(map(sorted, arr_b))

0.538845

def circularly_sorted(arr): m=arr.index(min(arr)) return sorted(arr) == ( arr[m:]+arr[:m] )

0.535868

def comp(array1, array2): try: return sorted([i ** 2 for i in array1]) == sorted(array2) except: return False

0.534159

def validate_sequence(seq): return len({a - b for a, b in zip(seq, seq[1:])}) == 1

0.530973

class Solution: def checkPossibility(self, nums): """ :type nums: List[int] :rtype: bool """ possibility_flag = False for i in range(1, len(nums)): if nums[i] < nums[i-1]: if possibility_flag: return False ...

0.522213

def pair_of_shoes(a): return sorted(s for lr, s in a if lr == 1) == sorted(s for lr, s in a if lr == 0)

0.519307

def round(flash_pile, turtle_pile): faceup_pile = [] while turtle_pile: for pile in flash_pile, turtle_pile: faceup_pile.append(pile.pop(0)) if len(faceup_pile) >= 2 and faceup_pile[-1] == faceup_pile[-2]: flash_pile.extend(faceup_pile) return True...

0.511353

def is_nice(arr): s = set(arr) return bool(arr) and all( n+1 in s or n-1 in s for n in s)

0.503659

import sys class SegmTree(): def __init__(self, array=None): size = len(array) N = 1 while N < size: N <<= 1 self.N = N self.tree = [0] * (2*self.N) for i in range(size): self.tree[i+self.N] = array[i] self.build() def build(self)...

0.503561

def isomorph(a, b): return [a.index(x) for x in a] == [b.index(y) for y in b]

0.503332

def solve(st): return all(True if ord(x) - ord(y) in [-2, 0, 2] else False for x, y in zip(st, st[::-1]))

0.495285

from collections import deque def yes_no(arr): d, result = deque(arr), [] while d: result.append(d.popleft()) d.rotate(-1) return result

0.494343

class Solution: def isScramble(self, A, B): if len(A) != len(B) or sorted(A) != sorted(B): return False if len(A) == 1 or A == B: return True for i in range(1, len(A)): if self.isScramble(A[:i], B[:i]) and self.isScramble(A[i:], B[i:]): ...

0.493688

class Solution: def canReorderDoubled(self, A: List[int]) -> bool: cache=Counter(A) c_list=sorted(list(cache),key=abs) for x in c_list: if cache[x]>cache[2*x]: return False cache[2*x]-=cache[x] return True

0.485128

class Solution: def isMonotonic(self, A: List[int]) -> bool: if not A: return True increasing = True index = 0 while index<len(A)-1 and A[index] == A[index+1]: index+=1 if index == len(A)-1: return True if A[index] > A[index+1]: inc...

0.484576

def is_inertial(arr): mx = max(arr, default=1) miO = min((x for x in arr if x%2==1), default=float("-inf")) miE2 = max((x for x in arr if x%2==0 and x!=mx), default=float("-inf")) return mx%2 == 0 and miE2 < miO

0.481031

def are_equally_strong(your_left, your_right, friends_left, friends_right): return sorted([your_left, your_right]) == sorted([friends_left, friends_right])

0.48066

def step_through_with(s): return any(m == n for m, n in zip(s, s[1:]))

0.478301

from collections import Counter def is_zero_balanced(arr): c = Counter(arr) return bool(arr) and all(c[k] == c[-k] for k in c)

0.477712

class Solution: def buddyStrings(self, A: str, B: str) -> bool: if len(A)!=len(B): return False if len(A)<2: return False if A==B: cnt = Counter(A) return bool([v for v in cnt.values() if v>1]) diffs = [] for i, a in enumerate(A...

0.477284

def almost_increasing_sequence(sequence): save, first = -float('inf'), True for i,x in enumerate(sequence): if x > save: save = x elif first: if i == 1 or x > sequence[i-2]: save = x first = False else: return False return True

0.47513

import random class RandomizedCollection: def __init__(self): """ Initialize your data structure here. """ self.val = [] self.idx = {} def insert(self, val): """ Inserts a value to the collection. Returns true if the collection did not alread...

0.473245

class Solution: def prevPermOpt1(self, A: List[int]) -> List[int]: n = len(A) if n == 1: return A tidx = -1 for i in range(n-2, -1, -1): if A[i] > A[i+1]: tidx = i break if tidx < 0: return A sidx ...

0.472779

def is_onion_array(a): return all(a[i] + a[-i-1] <= 10 for i in range(len(a) // 2))

0.466102

def scramble(s1,s2): for c in set(s2): if s1.count(c) < s2.count(c): return False return True

0.464901

def valid(a): d = {} day_length = len(a[0]) group_size = len(a[0][0]) golfers = {g for p in a[0] for g in p} for day in a: if len(day) != day_length: return False for group in day: if len(group) != group_size: return False for player in group: ...

0.463663

def wheat_from_chaff(values): i, j = 0, len(values)-1 while True: while i < j and values[i] < 0: i += 1 while i < j and values[j] > 0: j -= 1 if i >= j: return values values[i], values[j] = values[j], values[i]

0.461241

def duplicate_elements(m, n): return not set(m).isdisjoint(n)

0.46114

def all_non_consecutive(a): return [{"i": i, "n": y} for i, (x, y) in enumerate(zip(a, a[1:]), 1) if x != y - 1]

0.460222

def is_hollow(x): while x and x[0] != 0 and x[-1] != 0: x = x[1:-1] return len(x) > 2 and set(x) == {0}

0.457668

class Solution: def canCross(self, stones): """ :type stones: List[int] :rtype: bool """ if stones == []: return False if len(stones) == 1: return True diff = [0]*len(stones) for i in range(1,len(stones)): if stones[i] -...

0.457478

def solve(arr): re = [] for i in arr[::-1]: if i not in re: re.append(i) return re[::-1]

0.456603

def is_madhav_array(arr): nTerms = ((1+8*len(arr))**.5-1)/2 return (len(arr) > 1 and not nTerms%1 and len({ sum(arr[int(i*(i+1)//2):int(i*(i+1)//2)+i+1]) for i in range(int(nTerms))}) == 1)

0.456498

def pairs(ar): count = 0 for i in range(0, len(ar), 2): try: a, b = ar[i], ar[i+1] except IndexError: return count if abs(a-b) == 1: count +=1 return count

0.455788

#!/usr/bin/env python3 n = int(input()) a = list(map(int,input().split())) b = list(map(int,input().split())) if n <= 3: print('YES') else: a.remove(0) b.remove(0) i = a.index(1) a = a[i:] + a[:i] i = b.index(1) b = b[i:] + b[:i] print(['NO','YES'][a == b])

0.455036

def swap_head_tail(a): r, l = (len(a)+1)//2, len(a)//2 return a[r:] + a[l:r] + a[:l]

0.454521

def find_dup(arr): return sum(arr) - len(arr)*(len(arr)-1)/2 #your code here

0.452308

class Solution: def backspaceCompare(self, S1, S2): i1 = len(S1) - 1 i2 = len(S2) - 1 while i1 >= 0 or i2 >= 0: c1 = '' c2 = '' if i1 >= 0: c1, i1 = self.getChar(S1, i1) if i2 >= 0: c2, i2 = self.getCha...

0.450417

class Solution: def pancakeSort(self, A: List[int]) -> List[int]: n = len(A) res = [] for x in range(n, 1, -1): idx = A.index(x) res.extend([idx + 1, x]) A = A[idx::-1] + A[idx+1:] A = A[x-1::-1] return res

0.450394

def palindrome_pairs(w): return [[i, j] for i in range(len(w)) for j in range(len(w)) if str(w[i])+str(w[j])==(str(w[i])+str(w[j]))[::-1] and i!=j]

0.450061

def twos_difference(a): s = set(a) return sorted((x, x + 2) for x in a if x + 2 in s)

0.448204

class Solution: def validateBinaryTreeNodes(self, n: int, leftChild: List[int], rightChild: List[int]) -> bool: leftset, rightset = set(leftChild), set(rightChild) roots = [] for i in range(n): if i not in leftset and i not in rightset: roots.append(i) ...

0.448127

n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) def dif(x): c = [] for i in range(n-1): c.append(x[i+1] - x[i]) return c if list(sorted(dif(a))) == list(sorted(dif(b))) and a[0] == b[0] and a[n-1] == b[n-1]: print('Yes') else: print('No')

0.447594

n = int(input()) a = list(map(int, input().split()))[::-1] b = list(map(int, input().split())) ans = [0] * n marked = [True] * (n + 1) for i in range(n): if marked[b[i]]: while True: marked[a[-1]] = False ans[i] += 1 if a[-1] == b[i]: a.pop() ...

0.446277

import random class RandomizedSet: def __init__(self): """ Initialize your data structure here. """ self.dict = {} self.list = [] def insert(self, val): """ Inserts a value to the set. Returns true if the set did not alrea...

0.445998

class Solution: def stoneGame(self, piles: List[int]) -> bool: return True

0.445986

class Solution: # def canTransform(self, start, end): # """ # :type start: str # :type end: str # :rtype: bool # """ def canTransform(self, start, end): # For (i, x) and (j, y) in enumerate(start), enumerate(end) # where x != 'X' and y != 'X', ...

0.445578

class Solution: def isIsomorphic(self, s1, s2): return len(set(zip(s1, s2))) == len(set(s1)) == len(set(s2))

0.444444

def same_structure_as(original,other): if isinstance(original, list) and isinstance(other, list) and len(original) == len(other): for o1, o2 in zip(original, other): if not same_structure_as(o1, o2): return False else: return True else: return not isinstance(original, list) and not i...

0.444261

def cycle(sequence): for j, x in enumerate(sequence): i = sequence.index(x) if 0 <= i < j: return [i, j - i] return []

0.443886

class DynamicConnectivity(object): par = [] def __init__(self, n): self.par = [i for i in range(n)] def union(self, p, q): if self.root(p) != self.root(q): self.par[self.root(p)] = q def root(self, p): pp = p while self.par[pp] != pp: pp = self.p...

0.443041

def count_inversion(nums): return sum(a > b for i, a in enumerate(nums) for b in nums[i + 1:])

0.441358

""" Codeforces Contest Good Bye 2014 Contest Problem B Author : chaotic_iak Language: Python 3.4.2 """ ################################################### SOLUTION def main(): n, = read() p = read() dsu = DSU() for i in range(n): a = read(0) dsu.make() for j in range(i): ...

0.441262

def permute_a_palindrome (input): return sum( input.count(c)%2 for c in set(input) ) < 2

0.441066

from collections import Counter def exchange_sort(sequence): """Greedy algorithm based on permutation cycle decomposition: 1. Search for transposition placing TWO elements correctly. 2. Search iteratively for transposition placing ONE elements correctly.""" swaps, cnt = 0, Counter() for a, b in zip...

0.440608

def code_for_same_protein(seq1,seq2): if seq1 == seq2: return True lista = [['GCT','GCC','GCA','GCG'],['CGT','CGC','CGA','CGG','AGA','AGG'],['AAT','AAC'],['GAT','GAC'],['AAT','AAC','GAT','GAC'],['TGT','TGC'],['CAA','CAG'],['GAA','GAG'],['CAA','CAG','GAA','GAG'],['GGT','GGC','GGA','GGG'],['CAT','CAC'],['...

0.440011

def is_balanced(s, caps): stack = [] openers, closers = caps[::2], caps[1::2] for char in s: if char in openers: if char in closers and stack and stack[-1] == char: stack.pop() else: stack.append(char) elif char in closers: ...

0.439797

class Solution: def reconstructQueue(self, people): """ :type people: List[List[int]] :rtype: List[List[int]] """ people.sort(key = lambda x: (-x[0], x[1])) queue = [] for p in people: queue.insert(p[1], p) return queue

0.438495

class Solution: def canArrange(self, arr: List[int], k: int) -> bool: freq = [0] * k for n in arr: freq[n%k] += 1 if freq[0] % 2: return False for i in range(1, (k//2)+1): if freq[i] != freq[k-i]: return False if k%2 is 0: ...

0.437959

def smaller(arr): # Good Luck! return [len([a for a in arr[i:] if a < arr[i]]) for i in range(0, len(arr))]

0.437739

from collections import defaultdict class Solution: def uniqueOccurrences(self, arr: List[int]) -> bool: occurences = defaultdict(int) for i in arr: occurences[i] += 1 for i in occurences.values(): if list(occurences.values()).count(i) > 1: return Fals...

0.436452

I=input;a,b=I(),I();print("YNEOS"[len(a)!=len(b)or"1"in set(a)^set(b)::2])

0.435981

import collections n = int(input()) d = collections.deque() for i in range(n): cmd = list(input().strip().split()) opt = cmd[0] if opt == 'pop': d.pop() elif opt == 'popleft': d.popleft() elif opt == 'append': d.append(int(cmd[1])) elif opt == 'appendleft': d.appe...

0.43525

class Solution: def permuteUnique(self, nums): """ :type nums: List[int] :rtype: List[List[int]] """ if not nums: return [] nums.sort() n = len(nums) res = [nums[:]] i = n-1 while i > 0: if...

0.435198

class Solution: def containsNearbyDuplicate(self, nums, k): """ :type nums: List[int] :type k: int :rtype: bool """ s=set(nums) if len(s)==len(nums):return False d=dict() for num in nums: d[num]=d.get(num,0)+1 fo...

0.434836

class Skiplist: def __init__(self): self.skip_list={} def search(self, target: int) -> bool: if(target in self.skip_list): if(self.skip_list[target]>0): return True return False def add(self, num: int) -> None: if(num in self.sk...

0.434711

class Solution: def containsDuplicate(self, nums): """ :type nums: List[int] :rtype: bool """ num_set = set(nums) if len(nums) == len(num_set): return False return True

0.434504

def distinct(seq): return sorted(set(seq), key = seq.index)

0.43344

def hot_singles(arr1, arr2): a = [] for x in arr1 + arr2: if x in set(arr1) ^ set(arr2) and x not in a: a.append(x) return a

0.432532

def find_dup(arr): return sum(arr) - sum(range(1, max(arr)+1))

0.432356

# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: def deleteDuplicates(self, head): """ :type head: ListNode :rtype: ListNode """ if not head or not head.next: ...

0.432121

def main(): a = list(input()) b = list(input()) n = len(a) k = n while k % 2 == 0: k = k // 2 while k != n: pairs = n // (k * 2) for i in range(0, pairs * 2, 2): if a[k * i:k * (i + 1)] > a[k * (i + 1):k * (i + 2)]: a[k * i:k * (i + 1)], a[k ...

0.431815

n = int(input()) a = list(map(int,input().split())) b = list(map(int,input().split())) cnt = 0 for i in range(n): if a[i] != b[i]: cnt += 1 if cnt == 1: done = list(range(1,n+1)) x = 0 for i in range(n): if a[i] == b[i]: try: done.remove(a[i]) ...

0.430145

def is_bouncy(n): return sorted(str(n)) != list(str(n)) and sorted(str(n)) != list(str(n))[::-1]

0.428964

class MagicDictionary: def __init__(self): """ Initialize your data structure here. """ self.l = [] def buildDict(self, dict): """ Build a dictionary through a list of words :type dict: List[str] :rtype: void """ sel...

0.428859

N=int(input()) A=list(map(int,input().split())) B=list(map(int,input().split())) A.append(A[0]) B.append(B[0]) AX=[] BX=[] for i in range(N): AX.append(A[i]^A[i+1]) BX.append(B[i]^B[i+1]) AX+=AX+[AX[0]] # Rolling Hashで。 p=1<<30 mod=(1<<62)+1 # Hashがぶつからない, pと互いに素な数を適当に指定 A_TABLE=[0] # Rolling Hashのテーブル. 最...

0.428514

def letter_check(arr): return set(arr[1].lower()) <= set(arr[0].lower())

0.427953

# Enter your code here. Read input from STDIN. Print output to STDOUT ar=[] n=int(input()) for i in range(0,n): tmp_str=input() tmp_str_ar=tmp_str.strip().split(" ") cmd=tmp_str_ar[0] if(cmd=="print"): print(ar) elif(cmd=="sort"): ar.sort() elif(cmd=="reverse"): ar.revers...

0.427936

# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right class FindElements: def __init__(self, root: TreeNode): self.dicts = {} if root: root.val = 0 s...

0.427633

def diff(arr): r = arr and max(arr, key = lambda x : abs(eval(x))) return bool(arr and eval(r)) and r

0.427304

class Solution: def hasGroupsSizeX(self, deck: List[int]) -> bool: def findGCD(a,b): if b ==0: return a return findGCD(b, a%b) hash_cards = {} for card in deck: if card in hash_cards: hash_cards[card]+=1 ...

0.42713

from math import log def compare_powers(*numbers): a,b = map(lambda n: n[1]*log(n[0]), numbers) return (a<b) - (a>b)

0.426558

def amidakuji(ar): numbers = list(range(len(ar[0])+1)) for line in ar: for i, swap in enumerate(line): if swap == '1': numbers[i], numbers[i+1] = numbers[i+1], numbers[i] return numbers

0.425602

def can_jump(arr): if arr[0] == 0 or len(arr) == 1: return False if arr[0] >= len(arr): return True for jump in range(1, arr[0] +1): if can_jump(arr[jump:]): return True return False

0.425432

def solve(arr): r = [] for v in arr[::-1]: if not r or r[-1] < v: r.append(v) return r[::-1]

0.424885

class Solution: def isToeplitzMatrix(self, matrix): """ :type matrix: List[List[int]] :rtype: bool """ if not matrix: return False colSize = len(matrix[0]) - 1 for row in range(len(matrix) - 1): if matrix[row][:colSize] != mat...

0.424629

def vampire_test(x, y): return sorted(str(x * y)) == sorted(str(x) + str(y))

0.424286

n = int(input()) a = list(map(int,input().split())) b = list(map(int,input().split())) c = {} for i in range(n): c[b[i]] = i b = [] for i in range(n): a[i] = c[a[i]] print(sum(abs(a[i] - i) for i in range(n)) >> 1) while True: for i in range(n): if a[i] < i: for j in range(a[i], i): ...

0.423331

def trouble(x, t): arr = [x[0]] for c in x[1:]: if c + arr[-1] != t: arr.append(c) return arr

0.423189

class Solution: def validSquare(self, p1, p2, p3, p4): """ :type p1: List[int] :type p2: List[int] :type p3: List[int] :type p4: List[int] :rtype: bool """ def length(x,y): return (x[0]-y[0])*(x[0]-y[0]) + (x[1]-y[1])*(x...

0.422836

def solve(a,b): return [a.count(e) for e in b]

0.422773

def sort_array(xs): es = sorted(x for x in xs if x % 2 == 0) os = sorted((x for x in xs if x % 2 != 0), reverse=True) return [(es if x % 2 == 0 else os).pop() for x in xs]

0.422705

class Solution(object): def isSubPath(self, h, r0): h_vals = [] while h: h_vals.append(str(h.val)) h = h.next h_str = ('-'.join(h_vals)) + '-' # serialized list st = [(r0, '-')] # DFS stack while st: r, pre = st.pop() if not...

0.422409

class Solution: def validMountainArray(self, A: List[int]) -> bool: if len(A) <= 2: return False else: if A[1] < A[0]: return False is_up = True curr = A[0] for n in A[1:]: if n == curr: ...

0.422148

from heapq import heapify, heappush, heappop class DinnerPlates: # index * cap -> access start of stack at index # index * cap + (cap - 1) -> access last element of stack at index def __init__(self, capacity: int): self.stack = [] # just one array to simulate all the stacks ...

0.422033

def diffs(bird1, bird2): return sum(c1 != c2 for c1, c2 in zip(bird1, bird2)) def child(bird1, bird2): return diffs(bird1, bird2) in [1, 2] def grandchild(bird1, bird2): return diffs(bird1, bird2) in [0, 1, 2, 3, 4] if len(bird1) > 1 else bird1 == bird2

0.422019

def unique_in_order(iterable): result = [] prev = None for char in iterable[0:]: if char != prev: result.append(char) prev = char return result

0.420417

In a 2 dimensional array grid, each value grid[i][j] represents the height of a building located there. We are allowed to increase the height of any number of buildings, by any amount (the amounts can be different for different buildings). Height 0 is considered to be a building as well. At the end, the "skyline" when...

class Solution: def maxIncreaseKeepingSkyline(self, grid: List[List[int]]) -> int: # Pad with inf to make implementation easier INF = -10_000 n = len(grid) total = 0 max_rows = [max(row, default=INF) for row in grid] # Transpose the grid to make max less cumbersome ...

0.73668

class Solution: def swimInWater(self, grid): """ :type grid: List[List[int]] :rtype: int """ N = len(grid) if N == 1: return 0 eleD = {} for i in range(N): for j in range(N): eleD[grid[i][j]...

0.677212

def main(): import sys tokens = [int(i) for i in sys.stdin.read().split()] tokens.reverse() n = tokens.pop() people = [(tokens.pop(), tokens.pop()) for i in range(n)] result = float("inf") for i in range(n): for j in range(2): maxh = people[i][j] ...

0.644899

from itertools import permutations tab = [] for i in range(5): buf = input().split(" ") X = [] for j in range(5): X.append(int(buf[j])) tab.append(X) res = 0 for perm in permutations([0,1,2,3,4], 5): wyn = 0 wyn += tab[perm[0]][perm[1]] wyn += tab[perm[1]][perm[0]] wyn += tab[perm[2]][perm[3]] ...

0.64225

def main(): n, m = list(map(int, input().split())) aa = [] for _ in range(n): row = list(map(int, input().split())) row.append(0) aa.append(row) aa.append([0] * (m + 1)) d1, d2, d3, d4 = ([[0] * (m + 1) for _ in range(n + 1)] for _ in (1, 2, 3, 4)) for i in range(n): ...

0.641649

class Solution: def projectionArea(self, grid: List[List[int]]) -> int: ans=0 for i in range(len(grid)): row=0 col=0 for j in range(len(grid[i])): if(grid[i][j]): ans+=1 row=max(row,grid[i][j]) co...

0.638033

class Solution: def minimumTotal(self, triangle): """ :type triangle: List[List[int]] :rtype: int """ length = len(triangle) for i in range(length - 1, 0, -1): for j in range(1, len(triangle[i])): if triangle[i][j] < triangle[i][j-...

0.620625

class Solution: def maximalRectangle(self, matrix): """ :type matrix: List[List[str]] :rtype: int """ if not matrix or not matrix[0]: return 0 n = len(matrix[0]) height = [0] * (n + 1) ans = 0 for row in matrix: ...

0.620414

class Solution: def largestRectangleArea(self, heights): """ :type heights: List[int] :rtype: int """ if not heights: return 0 stack = [0] heights.append(0) # print(heights) max_area = 0 for i in range(...

0.619655

def calc(a): res = [0] * (len(a) + 1) for k in range(len(a)): res = [2 * max(a[i] + res[i+1], a[i+k] + res[i]) for i in range(len(a) - k)] return res[0]

0.610698

class Solution: def getMaximumGold(self, grid: List[List[int]]) -> int: height = len(grid) width = len(grid[0]) max_path = 0 # generator for legal indices to check def index_gen(index): i,j = index if i > 0 and grid[i-1][j] > 0: ...

0.609816

from operator import neg n = int(input()) a = [tuple(map(int, input().split())) for i in range(n)] def check(max_h): k = n // 2 b = [] for w, h in a: if h > max_h: if k <= 0 or w > max_h: return 1 << 60 b.append((h, w)) k -= 1 else: ...

0.598239

def solve(arr): p, q = 1, 1 for k in arr: x, y = max(k), min(k) a = p * x b = q * x c = p * y d = q * y p = max(a, b, c, d) q = min(a, b, c, d) return max(p, q)

0.59464

def largest_rect(h): st=[]; m=0; i=0 while i<len(h): if len(st)==0 or h[st[-1]]<=h[i]: st.append(i); i+=1 else: l=st.pop(); m=max(m, h[l]*(i if len(st)==0 else i-st[-1]-1)) while len(st)>0: l=st.pop(); m=max(m, h[l]*(i if len(st)==0 else i-st[-1]-1)) return m

0.593922

n = int(input()) t = [list(map(int, input().split())) for q in range(n)] t[0][0] = 0 n += 1 u = [-1e7] * n v = [0] * n for i, (j, a) in list(enumerate(t, 1))[::-1]: u[i] = max(u[i], v[i] + a) v[j], u[j] = max(v[j] + v[i], u[j] + u[i]), max(v[j] + u[i], u[j] + v[i]) print(u[1])

0.591075

class Solution: def minPathSum(self, grid): """ :type grid: List[List[int]] :rtype: int """ m, n = len(grid), len(grid[0]) dp = [0] + [float('inf')] * (n-1) for i in range(m): dp[0] = dp[0] + grid[i][0] for j in range(1, n): ...

0.590713

from itertools import chain import numpy as np import networkx as nx h, w, *X = map(int, open(0).read().split()) C = np.array(X[:100], dtype=int).reshape((10, 10)) A = np.array(X[100:], dtype=int).reshape((h, w)) G = nx.DiGraph(C) d = {-1:0} for i in range(10): d[i] = nx.shortest_path_length(G, i, 1, weight='weig...

0.589915

class Solution: def maximalSquare(self, matrix): """ :type matrix: List[List[str]] :rtype: int """ if not matrix: return 0 m, n = len(matrix), len(matrix[0]) dp = [int(matrix[i][0]) for i in range(m)] vmax = max(dp) ...

0.586996

from heapq import * def add_all(lst): heapify(lst) total = 0 while len(lst) > 1: s = heappop(lst) + heappop(lst) total += s heappush(lst, s) return total

0.586675

class Solution: def maxArea(self, height): """ :type height: List[int] :rtype: int """ # l = [] # maxH = 0 # for i in range(len(height)-1, -1, -1): # if height[i] > maxH: # maxH = height[i] # l.append((i, ...

0.585971

for t in range(int(input())): n = int(input()) l = [] m = [] x = list(map(int,input().split())) l.append(x) m.append(list(x)) for i in range(1,n): x = list(map(int,input().split())) l.append(x) temp = [] for i in range(4): temp.append (x[i]+min(m[-1][:i]+m[-1][i+1:])) m.append(temp) print(min(m[-1]...

0.585286

n = int(input()) a = [tuple(map(int, input().split())) for i in range(n)] a = [(y, x, k) for x, y, k in a] a.sort(reverse=True) dp = [[-1] * (n + 1) for i in range(n)] def f(i, j): if i < 0 or j < -1: return 0 if dp[i][j] == -1: y, x, k = a[i] dp[i][j] = f(i - 1, j) + max(0, x - k * y) ...

0.576883

class Solution: def leastBricks(self, wall): """ :type wall: List[List[int]] :rtype: int """ d = {} for i in wall: suma = 0 for j in range(len(i)-1): suma += i[j] if suma in d: d[s...

0.575118

class Solution: def trap(self, height): """ :type height: List[int] :rtype: int """ if not height: return 0 result = 0 left = 0 right = len(height) - 1 while left < right: if height[left] <= height[right]: ...

0.574655

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.574654

class Solution: def largestIsland(self, grid: List[List[int]]) -> int: directions = [(-1, 0), (1, 0), (0, -1), (0, 1)] for i in range(len(grid)): grid[i].insert(0, 0) grid[i].append(0) grid.insert(0, [0 for i in range(len(grid[0]))]) grid.append([0 for i in ra...

0.57287

def ii(): return int(input()) def mi(): return list(map(int, input().split())) def li(): return list(mi()) # A. Company Merging n = ii() c = [] for i in range(n): a = li()[1:] c.append(a) mx = max(max(e) for e in c) ans = sum((mx - max(e)) * len(e) for e in c) print(ans)

0.568691

#!/usr/bin/env python # coding:utf-8 # Copyright (C) dirlt from sys import stdin def run(n, m, pixels): ans = 1 << 30 acc = [[0] * (m + 1) for _ in range(n + 1)] for i in range(n): for j in range(m): acc[i + 1][j + 1] = acc[i + 1][j] + int(pixels[i][j]) for j in range(m): ...

0.567727

maxn = 100100 ar = [1 for i in range(maxn)] ar[0], ar[1] = 0, 0 for i in range(2, maxn): if ar[i]: for j in range(i, (maxn - 1) // i + 1): ar[i * j] = 0 dst = maxn d = [dst for i in range(maxn)] for i in reversed(list(range(maxn))): if ar[i]: dst = 0 d[i] = min(d[i], dst) dst += 1 n, m = list(map(...

0.567382

import numpy n,m = list(map(int,input().split())) ar = [] for i in range(n): tmp = list(map(int,input().split())) ar.append(tmp) np_ar = numpy.array(ar) print((numpy.max(numpy.min(np_ar,axis=1))))

0.56577

def largest_sum(arr): sum = max_sum = 0 for n in arr: sum = max(sum + n, 0) max_sum = max(sum, max_sum) return max_sum

0.56576

import sys readline = sys.stdin.readline def ceil(a, b): return -(-a//b) def main(): N = int(readline()) inp = [tuple(map(int, readline().rstrip().split())) for _ in range(N)] scr_t, scr_a = 0, 0 for t, a in inp: if t >= scr_t and a >= scr_a: scr_t = t scr_a = a ...

0.56553

#for _ in range(int(input()): #n,m = map(int,input().split()) #x = [int(w) for w in input().split()] #n = int(input()) #x = [int(input()) for _ in range(n)] #for i in range(n): #dt = {} for i in x:dt[i] = dt.get(i,0)+1 #dt = {k:v for k,v in sorted(x.items(), key=lambda i: i[1])} m,n = map(int,input().split()) # top,r...

0.562993

def main(): import sys from array import array input = sys.stdin.readline class Bit: def __init__(self, n): self.size = n self.size_bit_length = n.bit_length() self.tree = array('h', [0] * (n+1)) def reset(self): self.tree = array('h', [0...

0.560267

pos = {"L4":0, "L3":1, "L2":2, "L1":3, "L0":4, "R0":4, "R1":5, "R2":6, "R3":7, "R4":8} def tetris(arr): current, res = [0]*9, 0 for x in arr: p = pos[x[1:]] current[p] += int(x[0]) if current[p] >= 30: break y = min(current) if y: current, res = [v-y for v in current], r...

0.558669

from operator import attrgetter, itemgetter n = int(input()); arr = [[int(x) for x in input().split(' ')] for y in range(n)]; arr = sorted(arr, key=itemgetter(1,0,2), reverse=True); dp = [0 for x in range(n)]; s = []; for i in range(n): while (s != [] and arr[s[-1]][0] >= arr[i][1]): s.pop(); if (s != []): dp[i] ...

0.558053

from sys import stdin n,m=list(map(int,stdin.readline().strip().split())) s=[] for i in range(n): s.append(list(map(ord,list(stdin.readline().strip())))) for j in range(m): s[-1][j]=s[-1][j]-97 ct=[tuple(map(int,stdin.readline().strip().split())) for i in range(n)] mc=[[0 for i in range(22)] for j in ra...

0.55733

class Solution: def minFallingPathSum(self, arr: List[List[int]]) -> int: dp = [0] * len(arr[0]) for r, row in enumerate(arr): minNb = min(dp) min1 = dp.index(minNb) dp[min1] = float('inf') min2 = dp.index(min(dp)) dp[min1] = minNb ...

0.556889

class Solution: def maxSideLength(self, mat: List[List[int]], threshold: int) -> int: dp = [[0 for _ in range(len(mat[0]) + 1)]for r in range(len(mat) + 1)] for r in range(1, len(mat) + 1): for c in range(1, len(mat[r-1]) + 1): dp[r][c] += mat[r-1][c-1] ...

0.556698

# cook your dish here T=int(input()) for k in range(0,T): N=int(input()) matrix=[] for i in range(0,N): a=list(map(int, input().split())) matrix.append(a) max_trace = [] for i in range(0,N): trace1=0 trace2=0 for j in range(0,i+1): trace1+=matrix[j][N+j-i-1] trace2+=matrix[N+j-i-1][j] max_trace....

0.55559

class Solution: def deleteAndEarn(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums);#count is a dict [3,4,2]--> {2:1,3:1,4:1} prev = None; avoid = using = 0; for k in sorted(count): temp = ma...

0.553829

input() num = list(map(int, input().split())) maxn = 0 l, r = 0, len(num)-1 j1, j2 = num[l], num[r] while l < r: if j1 == j2: maxn = max(j1, maxn) l += 1 j1 += num[l] elif j1 < j2: l += 1 j1 += num[l] else: r -= 1 j2 += num[r] print(maxn)

0.552272

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def currentmax(self,root): leftval = 0 if root.left != None: leftval = self.currentmax(root.left) leftval = 0 if leftv...

0.551484

class Solution: def minFallingPathSum(self, A: List[List[int]]) -> int: dp = [A[0][:], [0 for _ in A[0]]] for i in range(1, len(A)): for j in range(len(A[i])): dp[i & 1][j] = min([dp[(i - 1) & 1][j + k] for k in (-1, 0, 1) if 0 <= j + k < len(A[i])]) + A[i][j] ret...

0.55039

# cook your dish here for _ in range(int(input())): d=dict() ls=[] for i in range(int(input())): ls=list(map(int,input().split())) if ls[0] in d: d[ls[0]]=max(ls[1],d[ls[0]]) else: d[ls[0]]=ls[1] # print(d) if len(d)<3: print(0) else: kd=list(d.values()) kd.sort() # print(kd) print(kd[-1]+kd...

0.548489

def bins(sortedlist,x): n=len(sortedlist) start = 0 end = n - 1 while(start <= end): mid =int( (start + end)/2) if (x == sortedlist[mid][0]): return mid elif(x < sortedlist[mid][0]): end = mid - 1 else: start = mid + 1 if(sorte...

0.548219

3 import array from fractions import Fraction import functools import itertools import math import os import sys def main(): H = [read_ints() for _ in range(10)] print(solve(H)) def pos_idx(x, y): i = y * 10 if y % 2 == 0: i += x else: i += 9 - x return i def idx_pos(i): ...

0.548076

rnd_mod = 1234567890133 rnd_x = 987654321098 def rnd(): nonlocal rnd_x rnd_x = rnd_x**2 % rnd_mod return (rnd_x>>5) % (1<<20) def randrange(a): return rnd() % a T = int(input()) for _ in range(T): N, M = list(map(int, input().split())) X = [] for __ in range(N): X.append([int(a) for...

0.546941

# !/bin/env python3 # coding: UTF-8 # ✪ H4WK3yE乡 # Mohd. Farhan Tahir # Indian Institute Of Information Technology and Management,Gwalior # Question Link # https://codeforces.com/problemset/problem/392/B # # ///==========Libraries, Constants and Functions=============/// import sys inf = float("inf") mod = 10000...

0.545174

n = int(input()) k = map(int, input().split()) times = [] for i in range(n): people = list(map(int, input().split())) time = len(people) * 15 for p in people: time += p*5 times.append(time) print(min(times))

0.542437

t=int(input()) while(t): n=int(input()) l=[] for i in range(n): l.append(list(map(int,input().split()))); m=[] for i in l: m.append((i[1]//(i[0]+1))*i[2]) res=max(m) print(res) t=t-1

0.541921

n = int(input()) arr = list(map(float, input().split())) if n == 1: print(int(arr[0])) return arr.sort(reverse = True) res = 0 while arr: res += sum(arr) arr = arr[:len(arr)//4] print(int(res))

0.541415

__author__ = "runekri3" stairs_amount = int(input()) stair_heights = list(map(int, input().split())) boxes_amount = int(input()) boxes = [] for _ in range(boxes_amount): boxes.append(list(map(int, input().split()))) for width, height in boxes: box_bottom = max(stair_heights[0], stair_heights[width - 1]) p...

0.537668

n = int(input()) a = [[], []] a[0] = list(map(int, input().split())) a[1] = list(map(int, input().split())) b = list(map(int, input().split())) ans = float('+inf') for i in range(n): for j in range(n): if i == j: continue cur = sum(a[1][i:]) + sum(a[0][:i]) + sum(a[0][:j]) + sum(a[1][j:]) + b[i] + b[j] ans =...

0.536786

def peak_height(mountain): M = {(r, c) for r, l in enumerate(mountain) for c in range(len(l)) if l[c] == '^'} h = 0 while M: M -= {(r, c) for r, c in M if {(r, c+1), (r, c-1), (r+1, c), (r-1, c)} - M} h += 1 return h

0.535938

class Solution(object): def getSkyline(self, buildings): """ :type buildings: List[List[int]] :rtype: List[List[int]] """ cp= set([b[0] for b in buildings]+[b[1] for b in buildings]) i, active, res = 0, [], [] for c in sorted(cp): while i<...

0.535793

import numpy as np def slope(p1, p2): dx, dy = vectorize(p1, p2) return dy/dx if dx else float("inf") def vectorize(p1, p2): return [b-a for a,b in zip(p1, p2)] def getArea (p1, p2, p3): return np.cross(vectorize(p1, p2), vectorize(p1, p3)) / 2 def isConcave(p1, pivot, p2): return getArea(pivot,...

0.535561

q=list(map(int,input().split())) a=[] s=[] for i in range(0,q[0]): s+=[min(list(map(int,input().split())))] print(max(s))

0.535028

def target_game(values): a = b = 0 for n in values: a, b = b, max(a + n, b) return max(a, b)

0.534843

from functools import lru_cache class Solution: def tallestBillboard(self, rods: List[int]) -> int: rods = sorted(rods)[::-1] n = len(rods) psum = rods.copy() for i in range(n-1)[::-1]: psum[i] += psum[i+1] @lru_cache(None) def dfs(idx, diff): ...

0.533641

# returns answer to the subproblem with interval range [start, end], # but with a total of "extra" additional stuff on the end # that must be deleted last. memo = {} def f(dat, rewards, start, end, extra): curr = (start, end, extra) if curr in memo: return memo[curr] if start > end: re...

0.533369

n=int(input()) l=[] for i in range(n): l.append([int(x) for x in input().split()]) d=[10**9]*(n) q=set([int(x) for x in range(1,n)]) d[1]=0 #print(q) def extract(): mini=10**9 o=0 for i in range(1,len(d)): if d[i]<mini and i in q: mini=d[i] o=i q.remove(o) return o while len(q)!=0: x=ex...

0.532653

import numpy as np from numba import njit R,C,K=list(map(int,input().split())) vl=np.zeros((R,C), np.int64) for _ in range(K): r,c,v=list(map(int,input().split())) vl[r-1][c-1]=v @njit def main(): dp=np.zeros((R+1,C+1,4), np.int64) for i in range(1,R+1): for j in range(1,C+1): for k in range(4): ...

0.531663

class Solution: def maxSizeSlices(self, slices: List[int]) -> int: a,b,n=[slices[0]],[0],len(slices) for i in range(1,n): a.append(max(a[-1],slices[i])) b.append(max(b[-1],slices[i])) for i in range(2,2*n//3,2): aa,bb=[0]*(n-1),[0]*n for j in r...

0.530886

# cook your dish here while True: try: n=int(input()) lis=[] for i in range(n): k=list(map(int,input().split())) k.append(k[1]+k[2]) lis.append(k) #print(lis) p=sorted(lis,key=lambda x:x[3],reverse=True) #print(p) m...

0.528972

class Solution: def maxSatisfaction(self, satisfaction: List[int]) -> int: satisfaction.sort() total, res = 0,0 while satisfaction and satisfaction[-1]+total > 0: total += satisfaction.pop() res += total return res

0.528449

class Solution: def maxSubArray(self, nums): """ :type nums: List[int] :rtype: int """ # i = 0 # i_keep = 0 # j = 1 # j_keep = 1 # max_sum = nums[0]-1 # while j < len(nums) and i < j: # temp_sum = sum(nums[i:j]) ...

0.527332

def calc(gamemap): nr, nc = len(gamemap), len(gamemap[0]) def _i(ra, rb): return ra*nr + rb vs, ws = [0] * nr**2, [0] * nr**2 for s in range(nr + nc - 1): for ra in range(max(0, s - nc + 1), min(s + 1, nr)): for rb in range(ra, min(s + 1, nr)): ws[_i(ra, rb)] ...

0.526566

t=int(input()) for _ in range(t): n=int(input()) grid=[] for _ in range(n): temp=[] temp=list(map(int,input().strip().split())) temp.sort() grid.append(temp) curr=max(grid[n-1]) total=curr for i in range(n-2,0-1,-1): flag=0 for j in range(n-1,0-1,-1): if grid[i][j]<curr: flag=1 curr=...

0.525307

h, n = map(int, input().split()) a, b = [], [] for _ in range(n): A, B = map(int, input().split()) a.append(A) b.append(B) a_max = max(a) dp = [0]*(h+a_max) for i in range(h+a_max): dp[i] = min(dp[i-a] + b for a, b in zip(a, b)) print(min(dp[h-1:]))

0.524502

class Solution: def largestOverlap(self, A, B) -> int: leng = len(A[0]) # convert A, B to binary a = 0 b = 0 for i in range(0, leng * leng): row = int(i % leng) col = int(i / leng) a = (a << 1) + A[col][row] b = (b << 1) + B[co...

0.523787

from itertools import permutations n = int(input()) p1, _, p2, _, p3, _, p4 = [input() for _ in range(n)], input(), [input() for _ in range(n)], input(), [input() for _ in range(n)], input(), [input() for _ in range(n)] def count(a,b,c,d): board = [a[i] + b[i] for i in range(n)] + [c[i] + d[i] for i in range(n)]...

0.523509

def flipping_game(num): current = 0 biggest = 0 for i in num: current = max(0, current - ( i or -1 ) ) biggest = max(biggest, current) return sum(num) + (biggest or -1)

0.523224

for i in range(int(input())): n=int(input()) chef=0 ans=[] for i in range(0,n): l=list(map(int,input().split())) c=l[0] if c%2==0: for i in range(1,len(l)//2+1): chef=chef+l[i] continue; for i in range(1,len(l)//2): chef=chef+l[i] ans.append(l[len(l)//2]) ans.sort(reverse=True) for i in ran...

0.520733

def smallest_integer(matrix): nums = set(sum(matrix, [])) n = 0 while n in nums: n += 1 return n

0.519837

class Solution: def largest1BorderedSquare(self, grid: List[List[int]]) -> int: rows = len(grid) cols = len(grid[0]) memo = [[0 for j in range(cols)] for i in range(rows)] ans = 0 if grid[0][0] == 1: memo[0][0] = (1,1) ans = 1 else: ...

0.519267

from itertools import combinations INF = float("inf") data = {d: [-INF, INF, -INF, INF] for d in 'RLUD'} _, *XYD = open(0).read().split() X = map(int, XYD[::3]) Y = map(int, XYD[1::3]) D = map(data.get, XYD[2::3]) for x, y, d in zip(X, Y, D): d[0] = max(d[0], x) d[1] = min(d[1], x) d[2] = max(d[2], y) ...

0.519086

import sys class Solution: def maximumSum(self, arr: List[int]) -> int: ignore=0 not_ignore=0 res=-sys.maxsize for i in arr: if i>=0: ignore+=i not_ignore+=i else: if ignore==0: ignore+=i ...

0.517709

def diagonal_sum(array): return sum(row[i] for i, row in enumerate(array))

0.516535

n = int(input()) l = list(map(int, input().split())) best = 0 for i in range(n): for j in range(i, n): for k in range(j, n): best = max(best, l[i] | l[j] | l[k]) print(best)

0.516508

import math from functools import reduce class SegmentTree(): def __init__(self, L, function = lambda x,y: x+y): self.function = function N = self.size = len(L) M = 1 << N.bit_length() self.margin = 2*M - N self.L = [None for i in range(self.margin)] + L for i in rang...

0.516438

cij = [list(input()) for _ in range(3)] print(cij[0][0] + cij[1][1] + cij[2][2])

0.515728

class Solution: def numSubmat(self, mat: List[List[int]]) -> int: n, m = len(mat), len(mat[0]) heights = [0] * m res = 0 for i in range(0, n): stack = [] count = 0 for j in range(0, m): if mat[i][j] == 1: heights...

0.515647

import sys import heapq, functools, collections import math, random from collections import Counter, defaultdict # available on Google, not available on Codeforces # import numpy as np # import scipy import heapq as hq import math def dijkstra(G, s): n = len(G) visited = [False]*n weights = [math.inf]*n ...

0.515301

n = input() s = [] a = 0 for i in map(int, input().split()): while len(s) > 1 and min(s[-2], i)>=s[-1]: a += min(i, s[-2]) del(s[-1]) s.append(i) s.sort() print(a + sum(s[0: -2])) # Made By Mostafa_Khaled

0.514187

class Solution: def fallingSquares(self, positions): """ :type positions: List[List[int]] :rtype: List[int] """ height = [0] pos = [0] res = [] max_h = 0 for left, side in positions: i = bisect.bisect_right(pos, left) ...

0.512849

import numpy as np import sys input = sys.stdin.readline H,W = list(map(int,input().split())) S=np.array([list(input().rstrip("\n")) for _ in range(H)]) == '.' D = np.zeros((H,W),dtype=int) U = np.zeros((H,W),dtype=int) L = np.zeros((H,W),dtype=int) R = np.zeros((H,W),dtype=int) # 上下 for i in range(H): U[i] = (U[i...

0.512219

for _ in range(int(input())): n=int(input()) l=list(map(int,input().split())) a=[] lis=[] prevsign=-1 if l[0]>0: prevsign=1 else: prevsign=0 i=0 for i in l: if (i>0 and prevsign==1) or (i<0 and prevsign==0): lis.append(i) else: ...

0.511821

import sys import math def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def MI(): return map(int, sys.stdin.readline().split()) def SI(): return sys.stdin.readline().strip() t = II() for q in range(t): a,b,c,d = MI() print(max(a+b,c+d))

0.511494

""" Codeforces Round 241 Div 1 Problem B Author : chaotic_iak Language: Python 3.3.4 """ class InputHandlerObject(object): inputs = [] def getInput(self, n = 0): res = "" inputs = self.inputs if not inputs: inputs.extend(input().split(" ")) if n == 0: res = inputs...

0.511337

import sys input = sys.stdin.readline from bisect import bisect_right bin_s = [1] while bin_s[-1] <= 10 ** 9: bin_s.append(bin_s[-1] * 2) def main(): n, q = map(int, input().split()) alst = list(map(int, input().split())) dp = [[-1, -1] for _ in range(n)] dp[0] = [alst[0], 0] for i, a in enum...

0.511204

h, w = list(map(int, input().split())) A = [] for i in range(h): line = list(map(int, input().split())) A.append(line) for i in range(h): line = list(map(int, input().split())) for j, num in enumerate(line): A[i][j] = abs(A[i][j] - num) const = 6400 mask = 1 << const DP = [0]*w DP[0] = mask >...

0.511141

class Solution: def rectangleArea(self, rectangles: List[List[int]]) -> int: def getArea(width): res = 0 prev_low = 0 for low, high in intervals: low = max(prev_low, low) if high > low: res += (high - low)*width...

0.510663

n = int(input()) *A, = list(map(int, input().split())) seq = [] cur = 1; cnt = 0 for a in A: if cur == a: cnt += 1 else: seq.append(cnt) cur = a; cnt = 1 if cnt > 0: seq.append(cnt) ans = max(seq) l = len(seq) dp = [[0]*4 for i in range(l+1)] for i in range(l): one = i % 2 #12 ...

0.510632

# cook your dish here from sys import stdin,stdout a,b=list(map(int,stdin.readline().split())) left=[] top=[] for i in range(a): c,d=list(map(int,stdin.readline().split())) left.append(c) top.append(d) left.sort() top.sort() from bisect import bisect_right as br from bisect import bisect_left as bl row=0 col=0 total...

0.510224

def least_bribes(bribes): mem = {} def s(n1, n2): if n1 >= n2: return 0 if (n1, n2) in mem: return mem[n1, n2] r = min(bribes[i] + max(s(n1, i), s(i + 1, n2)) for i in range(n1, n2)) mem[n1, n2] = r return r return s(0, len(bribes))

0.510195

def main(): w, h, n = list(map(int, input().split())) x_min = 0 x_max = w y_min = 0 y_max = h for _ in range(n): x, y, a = list(map(int, input().split())) if a == 1: x_min = max(x_min, x) elif a == 2: x_max = min(x_max, x) elif a == 3: ...

0.509937

for i in range(int(input())): n=int(input()) c=[int(z) for z in input().split()] c.sort() c.reverse() b1,b2=0,0 for i in range(n): if b1<b2: b1+=c[i] elif b2<b1: b2+=c[i] else: b1+=c[i] print(max(b1,b2))

0.509561

3 import sys (n, m) = list(map(int, input().split())) firstData = None maxHeight = -1 for i in range(m): (d, h) = list(map(int, input().split())) if firstData is None: firstData = (d, h) else: if (d - prevD) < abs(h - prevH): print ("IMPOSSIBLE") return ...

0.509243

points = [0, 40, 100, 300, 1200] def get_score(arr) -> int: cleared = 0 score = 0 for lines in arr: level = cleared // 10 score += (level+1) * points[lines] cleared += lines return score

0.508761

class Solution: def diagonalSum(self, mat: List[List[int]]) -> int: rows = len(mat) columns = len(mat[0]) sum_ = 0 for r, c1, c2 in zip(list(range(rows)), list(range(columns)), list(range(columns - 1, -1, -1))): sum_ += mat[r][c1] if c1 != c2: ...

0.507953

Given an integer n, you must transform it into 0 using the following operations any number of times: Change the rightmost (0th) bit in the binary representation of n. Change the ith bit in the binary representation of n if the (i-1)th bit is set to 1 and the (i-2)th through 0th bits are set to 0. Return the minimum n...

class Solution: def minimumOneBitOperations(self, n: int) -> int: s = 0 m = n while m: s += m & 1 m >>= 1 k = 1 while s: s -= bool(n & k) n ^= (s & 1) and k k <<= 1 return n

0.773046

class Solution: def findIntegers(self, num): """ :type num: int :rtype: int """ dp=[1,2] for i in range(2,32): dp.append(dp[i-1]+dp[i-2]) bnum=bin(num)[2:] size=len(bnum) ans=dp[size] for i in range(1,s...

0.762545

class Solution: def hammingWeight(self, n: int) -> int: count = 0 while n!=0: n &= (n-1) count += 1 return count

0.759914

class Solution: def integerReplacement(self, n): """ :type n: int :rtype: int """ ''' if n == 1: return 0 if not (n & 1): return self.integerReplacement(n//2) + 1 return min(self.integerReplacement(n+1), self.integerR...

0.757527

class Solution: def binaryGap(self, n: int) -> int: maxDist = 0 currDist = 0 while n: if n & 1 and currDist != 0: maxDist = max(maxDist, currDist) currDist = 1 elif n & 1: currDist = 1 elif not n & 1 and curr...

0.747074

s=input().strip() n=len(s) i=0 k=1 j=0 while i<n: #print(i,j) j=i i+=1 while i<n and s[i]=='0': i+=1 if j>i-j: k+=1 elif j==i-j: if s[:j]>=s[j:i]: k+=1 else: k=1 else: k=1 print(k)

0.737303

import math def count(n): if n is 0: return 0 x = int(math.log(n, 2)) return x * 2 ** (x - 1) + n - 2 ** x + 1 + count(n - 2 ** x) def countOnes(left, right): return count(right) - count(left - 1)

0.735077

def two_count(n): res = 0 while not n & 1: res += 1 n >>= 1 return res

0.733473

class Solution: def minOperations(self, nums: List[int]) -> int: return sum(bin(x).count('1') for x in nums)+len(bin(max(nums)))-3

0.722172

class Solution: def numSteps(self, s: str) -> int: i, mid_zero = 0 , 0 for j in range(1, len(s)): if s[j] == '1': mid_zero += j -i - 1 i = j if i == 0: return len(s)-1 return mid_zero + 1 + len(s)

0.713841

s = int(input(), 2) t, ans = 1, 0 while t < s: ans += 1 t *= 4 print(ans)

0.704981

def fusc(n): a, b = 1, 0 for i in bin(n)[2:]: if i == '1': b += a else: a += b return b

0.703381

def single_digit(n): while n > 9: n = bin(n).count("1") return n

0.703087

print(str(oct(int(input()))).count('1'))

0.700305

masks = [0] * 10 for i in range(10 ** 4): for c in str(i): masks[int(c)] |= 1 << i def find_num(n): seq, x = 1, 0 for j in range(n): M = seq for m in masks: if x & m: M |= m x = ~M & (M+1) seq |= x return x.bit_length() - 1

0.69738

# cook your dish here test=int(input()) for _ in range(test): n=int(input()) n=list(bin(n)) ans=n.count('1') print(ans-1)

0.696929

# cook your dish here s=input() s1=s[::-1] arr=[] cnt=0 for i in range(len(s1)): arr.append(s1[i]) for i in range(len(arr)): if(arr[i]=="1"): for j in range(i,len(arr)): if(arr[j]=="1"): arr[j]="0" else: arr[j]="1" cnt+=1 print(cnt)

0.696238

h = int(input()) ans = 0 n = 0 while h != 0: ans += 2**n n += 1 h = h//2 print(ans)

0.683189

class Solution: def numberOfSteps (self, num: int) -> int: steps = 0 while num > 0: if num % 2 == 0: num /= 2 else: num -= 1 steps += 1 return steps

0.682035

LOG = 20 def solve(s): n = len(s) res = 0 z = 0 for t in range(0, n): if s[t] == '0': z += 1 continue for l in range(1, min(LOG, n - t + 1)): x = int(s[t:t+l], 2) # print(l, t, x, l + z) if l + z >= x: res += 1 # print(t, l, x, res, z) z = 0 return res t = int(input()) while t > 0: ...

0.681669

class Solution: def bitwiseComplement(self, N: int) -> int: return (1 << len(bin(N))-2) - N - 1

0.672768

#CF Round 150. Div II Prob. A - Dividing Orange import sys dp = [[[-1 for j in range(3)] for i in range (1 << 10)] for k in range(11)] In = sys.stdin n = In.readline().strip() def go (idx, mask, equal): if dp[idx][mask][equal] != -1: return dp[idx][mask][equal] if bin(mask).count("1") > 2: re...

0.670542

class Solution: dp = {0: 0} def racecar(self, target: int) -> int: if target in self.dp: return self.dp[target] n = target.bit_length() if 2**n - 1 == target: self.dp[target] = n else: self.dp[target] = self.racecar(2**n - 1 - target) + n + 1 ...

0.670534

s = list(input()) ans = 0 for i in range(1, len(s)): if s[i] == s[i-1]: ans += 1 if s[i] == '1': s[i] = '0' else: s[i] = '1' print(ans)

0.669413

n = int(input()) s = input() if s == '0': print(0) else: print('1'+'0'*s.count('0'))

0.668672

n = int(input()) a = input().replace(' ', '') ans = 0 for i in range(n): for j in range(i, n): s = a[i:j + 1] ans = max(ans, s.count('0') + (a[:i] + a[j + 1:]).count('1')) print(ans)

0.665045

for t in range(int(input())): n=int(input()) print(bin(n).count("1"))

0.664446

def shortest_steps_to_num(num): steps = 0 while num != 1: if num % 2: num -= 1 else: num //= 2 steps += 1 return steps

0.663185

from collections import Counter, defaultdict import itertools import sys def main(): n = int(input()) ans = 1 for k in range(1, 10): v = ((1 << k) - 1) * (1 << (k - 1)) if n % v == 0: ans = v print(ans) main()

0.663043

n = int(input()) a = list(map(int, input().split())) c = 0 l = 0 b = 0 while c < len(a) and a[c] == 0: c += 1 b += 1 if c == len(a): print(0) return d = len(a) - 1 while a[d] != 1: d -= 1 b += 1 while c <= d: if a[c] == 0: l += 1 else: if l > 1: b += l ...

0.657359

'''input 8 11010111 ''' n = int(input()) s = input() a = [0] d = {0:0} for i in range(n): if s[i] == '1': a.append(a[-1]+1) else: a.append(a[-1]-1) if a[i+1] not in d: d[a[i+1]] = i+1 ans = 0 for i in range(1,n+1): ans = max(ans,i-d[a[i]]) print(ans)

0.651309

l = int(input()) n = input() best = int(n) p = (l - 1) // 2 for i in range(p, -1, -1): if (n[i + 1] == '0'): continue best = min(best, int(n[0:(i + 1)]) + int(n[i + 1:])) break p = l // 2 for i in range(p, l): if (n[i] == '0'): continue best = min(best, int(n[0:i]) + int(n[i:])) break print(best)

0.65066

TASK = "stars" # FIN = open(TASK + ".in") # FOUT = open(TASK + ".out", "w") a = [1, 0, 0, 0, 1, 0, 1, 0, 2, 1, 1, 2, 0, 1, 0, 0] ans = 0 n = int(input()) if n == 0: print(1) return while (n > 0): tmp = n % 16 ans += a[tmp] n //= 16 print(ans) # FIN.close() # FOUT.close()

0.649777

s =input() from collections import Counter count = Counter(s) c0 = count["0"] c1 = count["1"] print(min(c0,c1)*2)

0.64845

from sys import stdin as cin from sys import stdout as cout def main(): n = int(cin.readline()) o = 0 for x in range(9, 0, -1): if 10 ** x // 2 <= n: ##print(x) for i in range(9): q = 10 ** x * (i + 1) // 2 - 1 if q <= n: o...

0.64741

def gap(num): s = bin(num)[2:].strip("0") return max(map(len, s.split("1")))

0.646635

n = int(input()) if(n%2==1): print(0) else: print(2**(n//2))

0.646459

import sys import string from math import gcd import getpass import math from decimal import Decimal def ria(): return [int(i) for i in input().split()] if getpass.getuser() != 'frohenk': filename = 'half' # sys.stdin = open('input.txt') # sys.stdout = open('output.txt', 'w') else: sys.stdin = o...

0.646286

#!/usr/bin/env python3 import sys def rint(): return list(map(int, sys.stdin.readline().split())) #lines = stdin.readlines() def get_num1(i): cnt = 0 while i: if i%2: cnt +=1 i //=2 return cnt n = int(input()) a = list(rint()) b = [get_num1(aa) for aa in a] ans = 0 #S0[...

0.644765

n = int(input()) ans = 1 while n != 1: if n % 2 == 1: ans += 1 n -= 1 else: n //= 2 print(ans)

0.643421

class Solution: def bulbSwitch(self, n): """ :type n: int :rtype: int """ if n == 0: return 0 else: return int(n**0.5)

0.642447

x = int(input()) y = input() if x <= 3: print(x) quit() num1 = 0 num0 = 0 for i in y: if i == '1': num1 = max(num1, num0+1) else: num0 = max(num0, num1+1) maxx = max(num1, num0) if '11' not in y and '00' not in y: print(maxx) quit() print(min(maxx+2, x))

0.639695

# Contest: Codeforces Round #592 (Div. 2) (https://codeforces.com/contest/1244) # Problem: B: Rooms and Staircases (https://codeforces.com/contest/1244/problem/B) def rint(): return int(input()) def rints(): return list(map(int, input().split())) t = rint() for _ in range(t): n = rint() s = input()...

0.638689

class Solution: def maxScore(self, s: str) -> int: maxi=0 for i in range(1,len(s)): a=s[:i] b=s[i:] maxi=max(a.count('0')+b.count('1'),maxi) return maxi

0.632621

a = [0] cur = 1 while(cur < 10 ** 13): x = a[-1] a.append(x * 2 + cur) cur *= 2 n = int(input()) n -= 1 ans = 0 i = 1 cur = 1 while(n > 0): x = n % 2 n = n // 2 if(x > 0): ans += cur + a[i - 1] i += 1 cur *= 2 print(ans)

0.632396

n = int(input()) k = input() amount = 0 for elem in k: amount += 1 if elem == '0': break print(amount)

0.632173

from math import log2 def operation(a,b, n = 0): while log2(a) % 1: n += 1 a //= 2 return n + abs(log2(a/b))

0.630341

n = int(input()) A = list(map(int, input().split())) for i in range(n): A[i] %= 2 print(min(n - A.count(0), A.count(0)))

0.630066

n = int(input()) t = input() if n == 1: if t == "0": print((10 ** 10)) else: print((2 * 10 ** 10)) elif n == 2: if t == "00": print((0)) elif t == "01": print((10 ** 10 - 1)) elif t == "10": print((10 ** 10)) else: # 11 print((10 ** 10)) else: ...

0.629313

f=lambda a:(a+1)%2 n=int(input()) a=list(map(int, bin(n)[2:].zfill(4)[::-1])) a[3]=f(a[3]) if (a[3]): a[2]=f(a[2]) if a[3] and a[2]: a[1]=f(a[1]) if a[3] and a[2] and a[1]: a[0]=f(a[0]) print (int("".join(map(str, a))[::-1], 2))

0.628385

def plant_doubling(n): return bin(n).count("1")

0.627492

class Solution: def minFlipsMonoIncr(self, S: str) -> int: onesSoFar = 0 partial = 0 for n in S: if n == '0': partial = min(onesSoFar, partial+1) else: onesSoFar += 1 return partial

0.626888

for z in range(int(input())): s = input() n = len(s) i = 0 while i<n and s[i]=='1': i+=1 if i==0: print(0) else: k = 0 while i<n and s[i]=='0': i+=1 k+=1 print(k)

0.626742

input() print(max(0, sum(len(s) + 1 for s in ''.join(input().split()).split('0') if s) - 1))

0.625936

s=input() count=0 for i in range(len(s)): if(s[i]=="1"): count+=1 print(count)

0.625921

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline n=int(input()) ans=1 while 2**ans-1<n: ans+=1 print(ans)

0.625533

from sys import stdin, stdout input = stdin.readline from collections import defaultdict as dd import math def geti(): return list(map(int, input().strip().split())) def getl(): return list(map(int, input().strip().split())) def gets(): return input() def geta(): return int(input()) def print_s(s): stdout.write...

0.624171

M = 10 ** 9 + 7 def solve1(x): n = len(x) x = int(x, 2) ans = 0 for a in range(2 ** n): for c in range(2 ** n): b = a ^ x d = c ^ x if a < c and b > d: ans += 1 return ans % M def solve2(x): return int(x, 2) * pow(2, (len(x) - 1), M) %...

0.623616

t = input() j = t[0] d, s = 0, int(j) for i in t[1: ]: if j != i: if d == 1: d, s = 0, s + 1 else: d = 1 j = i else: d = 1 print(s + (d and j == '1'))

0.623061

class Solution: def countBits(self, num): """ :type num: int :rtype: List[int] """ ans = [0] while len(ans) < num + 1: ans += [1 + x for x in ans] # len(ans) > num return ans[:num+1]

0.622772

T = int(input()) for _ in range(T): s = input() n = len(s) res = 10 ** 100 for i in range(n + 1): p,q = s[:i], s[i:] res = min(res, p.count('0') + q.count('1')) res = min(res, p.count('1') + q.count('0')) print(res)

0.621129

n = int(input()) print(2**(n+1) - 2)

0.620866

#!/usr/bin/env python # -*- coding: utf-8 -*- from collections import defaultdict n = int(input()) A = list(map(int,input().split())) pattern = set() for a in A: p = [] while a > 0: if a in pattern: break p.append(a) a = a//2 pattern |= set(p) def check(v): ret = 0 ...

0.619742

class Solution: def baseNeg2(self, N: int) -> str: # res = [] # x = N # while x: # res.append(x & 1) # x = -(x >> 1) # return \"\".join(map(str, res[::-1] or [0])) neg = [1 << i for i in range(1, 33, 2)] for mask in neg: if...

0.616526

s = input().split() k = int(s[1]) s = s[0] if s.count('0') < k: if s.count('0') > 0: print(len(s) - 1) else: print(len(s)) return have = 0 its = 0 for i in range(len(s) - 1, -1, -1): its += 1 if s[i] == '0': have += 1 if have == k: print(its - have) return

0.613531

def count_zeros_n_double_fact(n): if n % 2 != 0: return 0 k = 0 while n >= 10: k += n // 10 n //= 5 return k

0.612266

class Solution: def minOperations(self, n: int) -> int: return (n*n)>>2

0.612246

n = int(input()) a = input() kol1 = 0 kol0 = 0 for i in range(len(a)): if a[i] == "1": kol1 += 1 else: kol0 += 1 print(abs(kol1 - kol0))

0.611893

import re ls = ["Zero","One","Two","Three","Four","Five","Six","Seven","Eight","Nine","Ten","Eleven","Twelve","Thirteen"] def max_consec_zeros(n): return ls[max(map(lambda x:len(x),re.findall(r'0*',bin(int(n))[2:])))]

0.611686

def hamming(n): bases = [2, 3, 5] expos = [0, 0, 0] hamms = [1] for _ in range(1, n): next_hamms = [bases[i] * hamms[expos[i]] for i in range(3)] next_hamm = min(next_hamms) hamms.append(next_hamm) for i in range(3): expos[i] += int(next_hamms[i] == next_hamm)...

0.610489

n, t = map(int, input().split()) s = bin(n + 2)[2:] l = len(s) if t & (t - 1): ans = 0 else: t = t.bit_length() f = [[0] * (l + 1) for i in range(l + 1)] for i in range(l + 1): f[i][0] = f[i][i] = 1 for j in range(1, i): f[i][j] = f[i - 1][j - 1] + f[i - 1][j] ans = c =...

0.609677

n = int(input()) a = list(map(int, input().split())) cnt = 0 for i in range(n): cnt = cnt | a[i] j = 0 ans = 0 while 1: if (cnt >> j & 1 == 0): ans += 1 j += 1 else: break print(ans)

0.608545

def persistence(n): n = str(n) count = 0 while len(n) > 1: p = 1 for i in n: p *= int(i) n = str(p) count += 1 return count # your code

0.608412

input() print(''.join(str(len(x)) for x in input().split('0')))

0.608243

from math import ceil, log def how_many_measurements(n): return ceil(log(n, 3))

0.607596

t = int(input()) for _ in range(t): s = input() pref = [0]*len(s) if s[0]=="1": pref[0]+=1 for i in range(1,len(s)): if s[i]=="1": pref[i]+=1 pref[i]=pref[i]+pref[i-1] k=1 cnt=0 while (k+k*k)<=len(s): r = k+k*k i=r-1 while i<len(s): if (i-r)>=0: if pref[i]-pref[i-r]==k: cnt+=1 i+=...

0.606722

n = int(input()) a = list(map(int,input().split())) cnt = 0 for i in range(n): while True: if a[i]%2==0: a[i]=a[i]//2 cnt +=1 else: break print(cnt)

0.604093

start = input() counter = 0 sInt = int(start) while sInt!=0: sInt-=max([int(c) for c in start]) start=str(sInt) counter+=1 print(counter)

0.603975

from math import log2 def t(n): if n == 0: return 0 k = int(log2(n)) i = n - 2**k if i == 0: return (2**(2*k+1)+1) // 3 else: return t(2**k) + 2*t(i) + t(i+1) - 1 toothpick = t

0.603594

def faro_cycles(n): x, cnt = 2, 1 while x != 1 and n > 3: cnt += 1 x = x*2 % (n-1) return cnt

0.602936

from math import ceil def branch(n): if n == 1: return 0 l = int(ceil(n ** 0.5)) // 2 n -= (2 * l - 1) ** 2 + 1 return n // (2*l or 1)

0.601535

class Solution: def countDigitOne(self, n): """ :type n: int :rtype: int """ ones, m = 0, 1 while m <= n: ones += (n // m + 8) // 10 * m + (n // m % 10 == 1) * (n % m + 1) m *= 10 return ones

0.600598

import sys input = sys.stdin.readline n = int(input()) a = list(map(int, input().split())) b = a ans = 0 for k in range(29): a0 = [] a1 = [] a0a = a0.append a1a = a1.append b0 = [] b1 = [] b0a = b0.append b1a = b1.append for i in a: if i&(1<<k): a1a(i) else: ...

0.600452

class SegmentTree: def __init__(self, data, default=0, func=max): """initialize the segment tree with data""" self._default = default self._func = func self._len = len(data) self._size = _size = 1 << (self._len - 1).bit_length() self.data = [default] * (2 * _size) ...

0.598301

import sys def get_max_kvazi(n): s = str(n) ans = '' for c in s: if c == '0': ans = ans + '0' else: ans = ans + '1' return int(ans) fin = sys.stdin fout = sys.stdout #fin = open("input.txt", 'r') #fout = open("output.txt", 'w') n = int(fin.readline()) ans = []...

0.597278

darling = {} x = int(input()) ans = 0 while (x not in darling): darling[x] = 1 ans += 1 x += 1 while (x % 10 == 0): x /= 10 print(ans)

0.597218

def friends(n): return len(str(bin(n-1)))-3 if n >1 else 0

0.59649

import sys import math from collections import defaultdict from itertools import combinations from itertools import permutations input = lambda : sys.stdin.readline().rstrip() read = lambda : list(map(int, input().split())) def write(*args, sep="\n"): for i in args: sys.stdout.write("{}".format(i) + sep) INF = fl...

0.595076

class Solution: def reorderedPowerOf2(self, n: int) -> bool: n_len = len(str(n)) n = Counter(str(n)) p = 1 while len(str(p)) <= n_len: if len(str(p)) == n_len and Counter(str(p)) == n: return True p *= 2 retur...

0.593401

from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf,comb from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement from collections import deque,defaultdict,Counter from bisect import bisect_left,bisect_right from operator ...

0.592045

n=int(input()) s=[c=='1' for c in input()] m=len(s) z=[[0,0]] for c in s: ind = z[-1][c] z[-1][c] = len(z) z.append(z[ind][:]) assert(len(z) == m+1) z[m][0] = z[m][1] = m # make it sticky # how many things match directly dp = [0 for _ in range(m+1)] dp[0] = 1 for i in range(n): ndp = [0 for _ in range(m+1)] for i...

0.591855

def infected_zeroes(s): m=0; l=0 for i,n in enumerate(s): if n==0: m=i if l==0 else max(m, (i-l+1)//2); l=i+1 return max(m,len(s)-l)

0.591438

from math import factorial MOD = 10**9+7 k = int(input()) bink = list(map(int, bin(k)[2:])) N = len(bink) # dp[i][j][k] = first i bits, j bases, # k = 1 if maxor matches k, 0 else dp = [[[0,0] for j in range(i+2)] for i in range(N+1)] dp[0][0][1] = 1 for i in range(1, N+1): for j in range(i+1): # k = 0 ...

0.590743

N = int(input()) S = list(map(int,input().split()))[::-1] print(min(N - S.index(0), N - S.index(1)))

0.590063

s = list(map(int, input())) ans = [] cnt = 0 if s[0] == 1: cnt += 1 else: ans.append('0') for i in range(1, len(s)): if s[i] == 0 and s[i - 1] == 0: ans.append('0') elif s[i] == 1: cnt += 1 else: maba = 0 b = 0 for x in range(i, len(s)): if s[x] ==...

0.589779

n=int(input())+1 if n==1: print(0) else: print(n if n%2==1 else n//2)

0.589425

def bin_str(s): return s.count("10") * 2 + (s[-1] == "1")

0.588711

import sys input = sys.stdin.readline for _ in range(int(input())): n = int(input()) ans = 0 f = 0 i = n while n: ans += i // 2**f n //= 2 f += 1 print(ans)

0.588512

def halving_sum(n): s=0 while n: s+=n ; n>>=1 return s

0.587343

from collections import defaultdict d = defaultdict(bool) n = int(input()) for i in range(1000000): if d[n]: print((i + 1)) return d[n] = True if n & 1: n = n * 3 + 1 else: n >>= 1

0.586558

t= int(input()) while(t>0): n = int(input()) m=0 m=n//(2**11) n%=(2**11) while(n>0): num=n%2 m+=num n//=2 print(m) t-=1

0.585384

Given an array of integers nums, find the maximum length of a subarray where the product of all its elements is positive. A subarray of an array is a consecutive sequence of zero or more values taken out of that array. Return the maximum length of a subarray with positive product. Example 1: Input: nums = [1,-2,-3,4]...

class Solution: def getMaxLen(self, nums: List[int]) -> int: maxx = 0 nums.append(0) # starting position # where we find a 0 i = -1 minusarr = [] for j,n in enumerate(nums): if n == 0: # now figure out previous one...

0.812762

# cook your dish here n = int(input()) l = list(map(int, input().strip().split())) m = 0 f = [] for e in l: if(e != 0): m = m+1 else: f.append(m) m = 0 f.append(m) print(max(f))

0.751873

class Solution: def maxProduct(self, nums): """ :type nums: List[int] :rtype: int """ def prod(nums): #function to calculate product prod = 1 for i in nums: prod*=i return prod def listsplit(l...

0.713339

class Solution: def longestSubarray(self, nums: List[int]) -> int: if not 0 in nums: return len(nums) - 1 ans = 0 tot = 0 prev = 0 for n in nums: if n == 1: tot += 1 else: ans = max(tot+prev, ans) ...

0.71176

import sys; sys.stdin = open('input.txt', 'r') sys.stdout = open('output.txt', 'w') n=int(sys.stdin.readline()); a=[int(x) for x in sys.stdin.readline().split()] front=[0]*(len(a)+2) for i in range(n): front[i+1]=front[i]+ (1 if (a[i]>=0) else 0 ) back=[0]*(len(a)+2) for i in range(n-1,-1,-1): back[i+1]=bac...

0.686203

def maximum_product(arr): if arr.count(0) > 1: return min(arr) neg = [n for n in arr if n < 0] pos = [n for n in arr if n >= 0] if len(neg) % 2: return min(neg) if 0 in arr else max(neg) else: return min(pos) if pos else min(neg)

0.669683

def infected_zeroes(s): m=0; l=0 for i,n in enumerate(s): if n==0: m=i if l==0 else max(m, (i-l+1)//2); l=i+1 return max(m,len(s)-l)

0.655136

# cook your dish here N=int(input()) for _ in range(N): n=int(input()) arr=list(map(int,input().split()))[:n] count=0 last=0 for i in range(n): if(arr[i]!=0): break last=i count+=1 for i in arr[-1:last:-1]: if(i!=0): break count+=1 ...

0.652809

n = int(input()) h = list(map(int, input().split())) res = 0 while True: if sum(h) == 0: break i = 0 while i < n: if h[i] == 0: i += 1 else: res += 1 while i < n and h[i] > 0: h[i] -= 1 i += 1 print(res)

0.645935

def close_to_zero(t): if len(t)==0: return (0) x=t.split(" ") l=[] poz=[] neg=[] for i in x: l.append(int(i)) for i in l: if i == 0: return (0) if i>0: poz.append(i) if i<0: neg.append(i) if 0-min(poz)==...

0.642314

# -1 0 1を足したもののうち最大値を数える n = int(input()) a = list(map(int, input().split())) # ai=0の場合もあるので-1がありえることに注意適当にa[0]を-1の数とする d = [0] * (10**5 + 10) for av in a: for x in [-1, 0, 1]: # 前述の通りa[0]を-1の数とする d[av + x + 1] += 1 print(max(d))

0.639462

__author__ = 'Pavel Mavrin' n = int(input()) a = [int(x) for x in input().split()] s = 0 res = 0 for i in a: if i == 0: res += s else: s += 1 print(res)

0.637445

import sys import math n = int(sys.stdin.readline()) if n <= 2: print(1) return a = [int(s) for s in sys.stdin.readline().split()] st = -1 # index of first positive number in current subset of a ed = -1 # index last positive number in current subset of a # differation is (a[ed] - a[st])/(ed - st) leadin...

0.634809

a=eval(input()) while(a): x=eval(input()) b=list(map(int,input().split())) z=[0]*100 k=1 j=0 c=0 for i in b: if i==0: z.insert(i,k) else: if z[z.index(i)+1]==0: z.insert(j,k) else: m=z.index(i) n=m+1 p=(len(z)-z.count(0))-n c=c+min(n,p) z.insert(m+1,...

0.633763

import re import itertools from collections import Counter class Task: a = [] answer = [] def getData(self): input() self.a = [int(x) for x in input().split(" ")] def solve(self): currentFolderCounter = 0 badDaysCounter = 0 for x in self.a: if x >...

0.633419

class Solution: def jump(self,nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 1: return 0 else: step = 0 pos = 0 while pos != len(nums) - 1: bestStep = -1 bes...

0.632959

n=int(input()) s=set() ar=list(map(int,input().split())) for x in range(n): if(ar[x]!=0): s.add(ar[x]) print(len(s))

0.627664

class Solution: def findMaxConsecutiveOnes(self, nums): """ :type nums: List[int] :rtype: int """ if nums == []: return 0 count = 0 countMax =0 for ele in nums: if ele == 1: count += 1 ...

0.626844

""" Codeforces Round 244 Div 1 Problem A Author : chaotic_iak Language: Python 3.3.4 """ class InputHandlerObject(object): inputs = [] def getInput(self, n = 0): res = "" inputs = self.inputs if not inputs: inputs.extend(input().split(" ")) if n == 0: res = inputs...

0.626211

from collections import defaultdict def findSubarraySum(arr, n, Sum): # Dictionary to store number of subarrays # starting from index zero having # particular value of sum. prevSum = defaultdict(lambda : 0) res = 0 # Sum of elements so far. currsum = 0 for i in range(0, n): # Add c...

0.624963

n,s = map(int,input().split()) A = list(map(int,input().split())) if A[s-1] != 0: per = 1 A[s-1] = 0 else: per = 0 A.sort() maxs = max(A) ans = [0] * (maxs + 1) answer = maxs + 1 o = -1 for j in range(n): if A[j] == 0: o += 1 if ans[A[j]] == 0: ans[A[j]] = 1 answer -= 1 ...

0.624779

def prog(): n = int(input()) inp = list(map(int,input().split())) ans = 0 for i in range(len(inp)): x,y = 0 ,0 for j in range(i,len(inp)): x+=inp[j] y+=100 if(x>y): ans = max(ans,(j-i)+1) print(ans) prog()

0.624738

import sys class Solution: def maximumSum(self, arr: List[int]) -> int: ignore=0 not_ignore=0 res=-sys.maxsize for i in arr: if i>=0: ignore+=i not_ignore+=i else: if ignore==0: ignore+=i ...

0.62313

n = int(input()) a = list(map(int, input().split())) c = 0 l = 0 b = 0 while c < len(a) and a[c] == 0: c += 1 b += 1 if c == len(a): print(0) return d = len(a) - 1 while a[d] != 1: d -= 1 b += 1 while c <= d: if a[c] == 0: l += 1 else: if l > 1: b += l ...

0.614295

class Solution: def arrayNesting(self, nums): """ :type nums: List[int] :rtype: int """ best = 0 n = len(nums) p = [] for i in range(len(nums)): j = i current = 0 while nums[j] != -1: cur...

0.613142

n = int(input()) a = list(map(int, input().split())) b = [] for i in range(len(a)): b.append(a[i]) for i in range(len(a)): b.append(a[i]) q = 0 r = set() for i in b: if i: q += 1 else: r.add(q) q = 0 print(max(r))

0.611981

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.611698

class Solution: def partitionDisjoint(self, A: List[int]) -> int: biggest = A[0] newbiggest = A[0] lenL = 1 total = 1 for itr in A[1:]: total += 1 if itr < biggest: lenL = total biggest = newbiggest else: ...

0.609886

N = int(input()) S = list(map(int,input().split()))[::-1] print(min(N - S.index(0), N - S.index(1)))

0.607135

class Solution: def maxSubarraySumCircular(self, A: List[int]) -> int: N = len(A) if(N==0): return 0 curr_max = A[0] global_max = A[0] curr_min = A[0] global_min = A[0] flag = 0 if(A[0]>=0): flag=1 for i in range(1...

0.604656

n = int(input()) l = list(map(int,input().split())) curr = 0 best = 0 prevs = [0] * 31 for v in l: curr += v if v >= 0: for i in range(0, v): prevs[i] = curr for i in range(v, 31): best = max(curr - prevs[i] - i, best) else: for i in range(31): pr...

0.602157

n = int(input()) A = list(map(int, input().split())) m = 0 pos = 0 neg = 0 for i in range(n): if A[i] < 0: neg += 1 m += (-A[i] - 1) A[i] = -1 elif A[i] > 0: pos += 1 m += (A[i] - 1) A[i] = 1 zer = n - pos - neg if zer: print(m + zer) elif neg % 2 == 0: pr...

0.600912

input() print(max(0, sum(len(s) + 1 for s in ''.join(input().split()).split('0') if s) - 1))

0.599936

n = int(input()) inp = input() seq = inp.split(' ') seq = [ abs(int(x)) for x in seq ] Max = max(seq) nxt = [0] * n cnt = [0] * n pos = [n] * (Max+1) for i in range(n-1, -1, -1): nxt[i] = pos[seq[i]] pos[seq[i]] = i for i in range(0, Max+1): j = pos[i] while(j<n): front = sum(cnt[0:j]) b...

0.599285

def positive_sum(arr): return sum(x for x in arr if x > 0)

0.597505

read = lambda: map(int, input().split()) n = int(input()) a = list(read()) was = [0] * (n + 1) bal = ans = 0 for i in a: if was[i]: bal -= 1 else: bal += 1 was[i] = 1 ans = max(ans, bal) print(ans)

0.596957

n=int(input()) vec=list(map(int,input().split())) al=[] otrez=[] for x in vec: if len(al)==0: al.append(x) elif(x<=al[-1]): otrez.append(al) al=[x] else: al.append(x) otrez.append(al) maxx=0 if(len(otrez)!=1): for i in range(0,len(otrez)-1): if(len(otrez[i])==1)or...

0.596507

rr = lambda: input().strip() rri = lambda: int(rr()) rrm = lambda: list(map(int, rr().split())) def solve(N, A): ans = 0 prev = float('inf') for x in reversed(A): x = min(x, prev - 1) ans += max(x, 0) prev = x return ans for tc in range(1):#rri()): N = rri() A = rrm() ...

0.595143

n = int(input()) a = list(map(int,input().split())) m = max(a) current = 0 longest = 0 for x in a: if x == m: current +=1 else: longest = max(current,longest) current = 0 longest = max(current,longest) print (longest)

0.59281

class Solution: def movesToMakeZigzag(self, nums): n = len(nums) res0 = 0 for i in range(0, n, 2): nei = min(nums[j] for j in [i - 1, i + 1] if 0 <= j <= n-1) if nums[i] >= nei: res0 += nums[i] - nei + 1 res1 = 0 for i in range(1, n, 2)...

0.592156

class Solution: def findLengthOfLCIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) < 1: return 0 cur_len = 1 max_len = 1 for i in range(1,len(nums)): if nums[i] > nums[i-1]: cur_...

0.589523

n=eval(input()) a=list(map(int,input().split())) c=m=0 maxi=max(a) for i in range(n): if a[i]==maxi: c+=1 m=max(c,m) else: c=0 print(m)

0.587754

n = int(input()) xs = [int(x) for x in input().split()] seen = {} res = 0 while xs: j = xs.index(xs[0], 1) res += j - 1 xs = xs[1:j] + xs[j+1:] print(res)

0.58715

input() memory = list(map(int, input().split())) proc_data = {p: (-1, -1) for p in memory} for i, c in enumerate(memory): d1, d2 = proc_data[c] if d1 == -1: d1 = i d2 = i proc_data[c] = (d1, d2) try: del proc_data[0] except KeyError: print("0") return data = list(proc_data.values()) data.sor...

0.586215

N = int(input()) A = [int(_) for _ in input().split()] def calc(A, y): result = abs(A[0] - y) t = y if t == 0: return 10**30 for a in A[1:N]: tt = t + a if t * tt >= 0: m = -t // abs(t) result += abs(m - tt) tt = m t = tt return r...

0.58563

n = int(input()) a = [0] + list(map(int, input().split())) + [1001] mx = 1 p = 1 for i in range(1, n + 2): if a[i] == a[i - 1] + 1: p += 1 mx = max(p, mx) else: p = 1 print(max(0, mx - 2))

0.585611

n=int(input()) arr=[int(x) for x in input().split()] l=[1]*n if sorted(arr)==arr: print('0') else: for i in range(0,len(arr)): for j in range(i): if arr[i]>=arr[j] and l[i]<l[j]+1: l[i]=l[j]+1 print(n-max(l))

0.583833

class Solution: def findLengthOfShortestSubarray(self, arr: List[int]) -> int: n = len(arr) if n<=1: return 0 l,r = n,-1 for i in range(1,n): if arr[i]<arr[i-1]: l = i break # monotonicially increasing ...

0.583603

from heapq import heappush, heappop N = int(input()) A = [int(a) for a in input().split()] for i in range(N): if A[i] < 0: k = i break A = [0] + [0 if i < k else A[i] for i in range(N) if i != k] ans = A.pop() H = [] while N > 2: N //= 2 for i in range(N): heappush(H, A.pop()) a...

0.582528

#scott http://codeforces.com/problemset/problem/291/A now? ok you start n = int(input()) arr = list(map (int, input().split())) #scott #for i in arr: # print (i) cnt = 0 clast, llast = -1, -1 #scott wait we need to sort arr = sorted(arr) bad = False #scott so now we just count # of pairs and make sure there's ...

0.58103

class Solution: def maxSubArray(self, nums): """ :type nums: List[int] :rtype: int """ # i = 0 # i_keep = 0 # j = 1 # j_keep = 1 # max_sum = nums[0]-1 # while j < len(nums) and i < j: # temp_sum = sum(nums[i:j]) ...

0.581016

def f(t, k): i, j = 0, 1 s, d = 0, t[0] n = len(t) while j <= n: if d > k: d -= t[i] i += 1 elif d == k: if t[i] and (j == n or t[j]): s += 1 else: a, b = i - 1, j - 1 while j < n and t[j] == 0: j += 1 ...

0.579318

n = int(input()) a = list(map(int, input().split())) dp = [[False] * (n + 1) for i in range(n + 1)] def solve(l, r): if dp[l][r]: return dp[l][r] if r - l == 1: dp[l][r] = (a[l], 1) return dp[l][r] tmp = 10 ** 9 for i in range(l + 1, r): if solve(l, i)[0] == -1 or solve...

0.577627

n=int(input()) a=list(map(int,input().split())) b=0 a[1:]=sorted(a[1:]) while a[0]<=a[-1]: a[-1]-=1 a[0]+=1 b+=1 a[1:]=sorted(a[1:]) print(b)

0.577056

from collections import defaultdict def fix_progression(arr): res = 0 for i in range(len(arr)): D = defaultdict(int) for j in range(i): q, r = divmod(arr[i]-arr[j], i-j) if not r: D[q] += 1 res = max(res, D[q]) return len(arr)-res-1

0.576692

import collections n = int(input()) A = list(map(int, input().split())) S = [0]*n S[0] = A[0] for i in range(1, n) : S[i] = S[i-1] + A[i] C = collections.Counter(S) max_val = 0 for key in C : max_val = max(max_val, C[key]) ans = n - max_val print(ans)

0.576127

n = int(input()) a = list(map(int, input().split())) maxi = 0 ans = 0 for i in range(n): a[i] -= 1 maxi = max(maxi, a[i]) if maxi == i: ans += 1 print(ans)

0.574258

# -*- coding: utf-8 -*- """ Created on Sun Apr 2 22:42:34 2017 @author: Sean38 """ n = int(input().rstrip()) s = input() a = [int(ch) for ch in s.split()] a = a[0:n] a.sort() def check_num(p, i): # i = ap + b(p+1) # min(a+b) <=> max(b) # b(p+1) <= i # b == i (mod p) max_b = (i // (p + 1)) b...

0.572285

n = int(input()) a = [int(x) for x in input().split()] alive = 0 left = n for i in range(n - 1, -1, -1): if i < left: alive += 1 left = min(left, i - a[i]) print(alive)

0.571915

class Solution: def isvalid(self,C): if len(C)>2: return False if len(C)==1: a = min(C) if a==1 or C[a]==1: # EXPLANATION: # a==1 : All lengths are unitary like A=[1,2,3,4,...], so poping anything is fine # C[a...

0.571131

for _ in range(int(input())): l=list(map(int,input().strip())) for j in range(len(l)-1,-1,-1): if l[j]==1: l.pop() else: break if l.count(1): time,prev,z,c=0,0,0,0 for j in range(len(l)-1,-1,-1): if l[j]==0: z+=1 continue if prev!=z: prev=z c+=1 time+=c+z print(time) else: ...

0.569713

n = int(input()) a = list(map(int, input().split())) info = 0 i = 0 dir = 1 result = 0 while True: if info >= a[i]: info += 1 a[i] = n + 1 if info == n: break i += dir if i < 0 or i == n: dir = -dir i += dir result += 1 print(result)

0.569089

n = int(input()) a = set(map(int, input().split())) if 0 in a: a.remove(0) print(len(a))

0.568162

N = int(input()) ds = [] mochidan = 0 for i in range(N): ds.append(int(input())) while ds: tmp = max(ds) ds = [j for j in ds if j < tmp] mochidan += 1 print(mochidan)

0.568062

def main(): n, l = int(input()), list(map(int, input().split())) if not (n & 1): l.append(0) l.append(150001) i, b, c, fails0, fails1 = 0, 0, 150001, [], [] try: while True: a, b, c = b, c, l[i] if a >= b or b <= c: if len(fails0) + len(fails1)...

0.568028

def largest_sum(s): return max(sum(map(int,x)) for x in s.split('0'))

0.567953

m,p,c=0,0,0 s=(input()) for i in s: if i=='-': c-=1 else: c+=1 m=min(m,c) p=max(p,c) print(p-m)

0.56788

n = int(input()) mass = list(map(int, input().split())) left = [1] * n right = [1] * n for i in range(1, n): if mass[i] > mass[i - 1]: left[i] = left[i - 1] + 1 for i in range(n - 2, -1, -1): if mass[i] < mass[i + 1]: right[i] = right[i + 1] + 1 mx = 1 for i in range(n): if i == 0: m...

0.567852

class Solution: def maxTurbulenceSize(self, A: List[int]) -> int: if len(A) == 1: return 1 prev = A[1] maxcount = count = 1 + int(A[0] != A[1]) print(count) lastcomp = A[0] < A[1] for a in A[2:]: comp = prev < a if prev == a: ...

0.56708

from sys import stdin n = int(stdin.readline()) a = list(map(int,stdin.readline().split())) a = [0] + a ans = n dp = [float("inf")] * (n+1) dp[0] = 0 for i in range(1,n+1): nmin = float("inf") for j in range(i-1,-1,-1): if a[j] <= nmin: dp[i] = min(dp[i] , dp[j] + max(0,a[i]-a[j]) + (i-...

0.566043

n = int(input()) arr = list(map(int, input().split())) arr.sort() arr = arr[::-1] ans = [arr[0]] for i in range(1, n): if(arr[i] < ans[-1]): ans.append(arr[i]) else: ans.append(max(0, ans[-1] - 1)) print(sum(ans))

0.565959

rd = lambda: list(map(int, input().split())) k = kk = rd()[1] a = rd() k -= sum(x<0 for x in a) a[:kk] = list(map(abs, a[:kk])) print(sum(a)-(2*min(a) if k>0 and k%2 else 0))

0.565938

class Solution: def longestMountain(self, A: List[int]) -> int: up=0 down=0 ans=0 for i in range(0,len(A)-1): if A[i]<A[i+1]: if down==0: up+=1 else: up=1 down=0 ...

0.565493

def lis(a): b = [] for c in a: # if len(b) == 0 or c > b[-1] if len(b) == 0 or c > b[-1]: b.append(c) else: l = 0 r = len(b) while l < r-1: m = l+r>>1 # if b[m] <= c: l = m if b[m] < c: l = m ...

0.565403

n = int(input()) *A, = list(map(int, input().split())) seq = [] cur = 1; cnt = 0 for a in A: if cur == a: cnt += 1 else: seq.append(cnt) cur = a; cnt = 1 if cnt > 0: seq.append(cnt) ans = max(seq) l = len(seq) dp = [[0]*4 for i in range(l+1)] for i in range(l): one = i % 2 #12 ...

0.5651

def main(): import sys input = sys.stdin.readline n = int(input()) arr = list(map(int, input().split())) dct = {} for x in arr: dct[x] = 0 i = 0 while i != n and dct[arr[i]] == 0: dct[arr[i]] = 1 i += 1 if i == n: print(0) r...

0.564065

from collections import defaultdict def calcBinomials(N): nonlocal binom N += 1 binom = [[0]*N for _ in range(N)] for n in range(N): binom[n][0] = binom[n][n] = 1 for k in range(1, n): binom[n][k] = binom[n-1][k] + binom[n-1][k-1] n = int(input()) a = list(map(int, input()....

0.562542

class Solution: def maxProduct(self, nums: List[int]) -> int: if nums[0] > nums[1]: largest = nums[0] second_largest = nums[1] else: largest = nums[1] second_largest = nums[0] for i in range(2,len(nums)): if nums[i] > largest: ...

0.562293

class Solution: def minOperations(self, nums: List[int]) -> int: return sum(bin(x).count('1') for x in nums)+len(bin(max(nums)))-3

0.560427

from bisect import bisect_right def main(): n = int(input()) a = [int(input()) for _ in range(n)] a.reverse() lis = [a[0]] for i in range(1, n): if a[i] >= lis[-1]: lis.append(a[i]) else: lis[bisect_right(lis, a[i])] = a[i] print((len(lis))) def __star...

0.55996

import sys readline = sys.stdin.readline N = int(readline()) S = list(map(int, readline().split())) S = [0 if s == 0 else 1 if s & 1 else -1 for s in S] odd = -(-N//2) even = N//2 for s in S: if s: if s == 1: odd -= 1 else: even -= 1 inf = 10**9 dpe = [[inf]*(odd+1) for _ ...

0.559743

def replace_zero(arr): m, im, i, lst = 0, -1, -1, ''.join(map(str,arr)).split('0') for a,b in zip(lst,lst[1:]): i += len(a) + 1 candidate = len(a)+len(b)+1 if m <= candidate: im, m = i, candidate return im

0.559629

# coding: utf-8 n = int(input()) a = [] b = [] c = [] for i in input().split(): i = int(i) if i < 0: a.append(i) elif i == 0: b.append(i) else: c.append(i) if len(c) == 0: c.append(a.pop()) c.append(a.pop()) if len(a)%2==0: b.append(a.pop()) print(len(a),' '.join([str...

0.559145

import sys def GRIG(L): LENT = len(L) MINT = 1 GOT = 0 DY = [ [{x: 0 for x in range(0, 10)}, 0, 0] ] for i in L: DY.append([{x: 0 for x in range(0, 10)}, 0, 0]) GOT += 1 for j in range(0, GOT): if DY[j][0][i] == 1: DY[j][0][i] = 0 ...

0.558451

import collections class Solution: def shortestSubarray(self, A: List[int], K: int) -> int: cum_sum = 0 queue = collections.deque([(-1, 0)]) result = len(A) + 1 for i, v in enumerate(A): cum_sum += v if v > 0: # find any matches and remove...

0.558292

n = int(input()) ans = 0 stk = [] for v in map(int, input().split()): last = 0 while len(stk) and stk[-1][0] < v and stk[-1][1]: last = max(last, stk[-1][1]) del stk[-1] if not len(stk) or stk[-1][0] < v: stk.append((v, 0)) else: stk.append((v, last + 1)); ans = max(ans,...

0.558167

from functools import reduce def product_sans_n(nums): z = nums.count(0) if z > 1: return [0] * len(nums) p = reduce(int.__mul__, (v for v in nums if v)) return [not v and p for v in nums] if z else [p//v for v in nums]

0.557858

input() a = list(map(int, input().split())) b = [] i = j = 0 while i < len(a): while j < len(a) and a[j] == a[i]: j += 1 if (j - i) % 2 == 1: b += [a[i]] i = j - (j - i) // 2 for k in range(i, j): a[k] += 1 print(b[-1] - len(b) + 1)

0.557087

ct = 0 x = int(input()) y = int(input()) z = [int(input()) for i in range(x)] z.sort() z.reverse() for i in z: if y <= 0: print(ct) quit() y-=i ct+=1 print(ct)

0.55689

x = int(input()) l = list(map(int, input().split(' '))) if min(l) == max(l): print(0) else: print(x-l.count(min(l))-l.count(max(l)))

0.556305

n = int(input()) ar = list(map(int,input().split(' '))) ar.sort() s=[] for i in ar: s.sort(reverse=True) for j in range(len(s)): if i>=s[j]: s[j]+=1 break else: s.append(1) print(len(s))

0.555499

'''input 8 11010111 ''' n = int(input()) s = input() a = [0] d = {0:0} for i in range(n): if s[i] == '1': a.append(a[-1]+1) else: a.append(a[-1]-1) if a[i+1] not in d: d[a[i+1]] = i+1 ans = 0 for i in range(1,n+1): ans = max(ans,i-d[a[i]]) print(ans)

0.555249

from sys import maxsize # Function to find the maximum contiguous subarray # and print its starting and end index def maxSubArraySum(a,size): max_so_far = -maxsize - 1 max_ending_here = 0 start = 0 end = 0 s = 0 for i in range(0,size): max_ending_here += a[i] if max_so_far < max_ending_here: ma...

0.554778

n = int(input()) m = [int(i) for i in input().split()] dm = [0 for i in range(n)] dm[-1] = m[-1] + 1 for i in range(n - 2, -1, -1): dm[i] = max(m[i] + 1, m[i+1], dm[i+1]-1) #print(dm) for i in range(1, n): dm[i] = max(dm[i], dm[i-1]) #print(dm) print(sum([dm[i] - 1 - m[i] for i in range(n)]))

0.554561

class Solution: def minStartValue(self, nums: List[int]) -> int: res = 1 for ind,n in enumerate(nums): temp = 1-sum(nums[:ind+1]) if(temp > res): res = temp return res

0.55401

t=int(input()) f=0 y=0 for _ in range(t): n=int(input()) seq=[int(x) for x in input().split()] prev=seq[0] for i in range(1,len(seq)): if prev==seq[i]: seq[i]=0 prev=seq[i] ans=0 anss=0 for el in seq: if el!=0: c=seq.count(el) if ans<c: ans=c anss=el elif ans==c: if el<anss: ...

0.553911

# cook your dish here n=int(input()) arr=[int(x) for x in input().split()] ans=n-1 while(ans>0 and arr[ans]==arr[ans-1]):ans-=1 print(ans+1)

0.553523

def flipping_game(num): current = 0 biggest = 0 for i in num: current = max(0, current - ( i or -1 ) ) biggest = max(biggest, current) return sum(num) + (biggest or -1)

0.553037

n = int(input()) a = list(map(int, input().split())) d = [] for i in range(1, n): d.append(a[i] - a[i - 1]) d.append(a[0] - a[n - 1]) cnt = 0 for i in range(0, n): if d[i] < 0: cnt += 1 pos = i if cnt == 0: print(0) elif cnt > 1: print(-1) else: print(n - pos - 1)

0.553004

def main(): n = int(input()) result = 0 d = set() for i in range(n): t, a = input().split() a = int(a) if t == "+": d.add(a) result = max(result, len(d)) else: if a in d: d.remove(a) else: ...

0.552896

n, m = list(map(int, input().split())) a = list(map(int, input().split())) a.sort() mx = a[-1] t = 0 ans = 0; for i in a: if i > 0: if i > t: t += 1 ans += i - 1 ans -= mx - t print(ans)

0.552608

We are given an array A of N lowercase letter strings, all of the same length. Now, we may choose any set of deletion indices, and for each string, we delete all the characters in those indices. For example, if we have an array A = ["abcdef","uvwxyz"] and deletion indices {0, 2, 3}, then the final array after deletions...

class Solution: def minDeletionSize(self, A: List[str]) -> int: def isSorted(arr, i, j): return all(arr[k] <= arr[k+1] for k in range(i, j)) ans = 0 ranges = [[0, len(A)-1]] for col in zip(*A): if not ranges: break if all(isSorted(c...

0.733318

class Solution: def minDeletionSize(self, A: List[str]) -> int: dp = [(1, 1)] * len(A[0]) for i in range(len(dp)): if i > 0: max_pre = None for pre in range(i - 1, -1, -1): for word in A: if word[pre] > word[i]: ...

0.743947

class Solution: def minDeletionSize(self, A: List[str]) -> int: return sum([list(col) != sorted(col) for col in zip(*A)])

0.726303

def codn1(s1,s2,p): c=0 ind=0 for i in range(len(s1)): if s1[i]!=s2[i]: c+=1 ind=i if c>1 or ind==len(s1)-1: return 0 if s1[ind]>s2[ind] and s1[ind] in s2[ind+1:]: p[0]=True if s1[ind]<s2[ind] and s2[ind] in s1[ind+1:]: p[1]=True return 1 def codn2(s1,s2): if len(s1)<len(s2): ...

0.645546

class Solution: def maxLength(self, arr: List[str]) -> int: def digit_representation(s): ans = 0 for c in s: ans |= 1<<(ord(c)-ord('a')) return ans A = sorted([(len(s), digit_representation(s)) for s in set(arr) if len(set(s))==len(s)], re...

0.6376

n = int(input()) for i in range(n): count = 0 k = input() x = list(k) kk = input() y = list(kk) for j in y: for jj in x: if(j==jj): count = count+1 break print(count)

0.625987

class Solution: def maxUncrossedLines(self, A, B): # Optimization #commons = set(A).intersection(set(B)) # or commons = set(A) & set(B) #A = [x for x in A if x in commons] #B = [x for x in B if x in commons] N1, N2 = len(A), len(B) dp = [[0 for _ in range(N2+1)] for ...

0.611459

class Solution: def findLUSlength(self, strs): """ :type strs: List[str] :rtype: int """ def isSubseq(s1, s2): i, m=0, len(s1) for c in s2: if i==m: return True if s1[i]==c: i+=1 return i==m ...

0.605937

from sys import stdin,stdout import math,bisect from datetime import date from collections import Counter,deque,defaultdict L=lambda:list(map(int, stdin.readline().strip().split())) M=lambda:list(map(int, stdin.readline().strip().split())) I=lambda:int(stdin.readline().strip()) S=lambda:stdin.readline().strip() C=lambd...

0.58737

class Solution: def kSimilarity(self, A: str, B: str) -> int: a = '' b = '' for i in range(len(A)): if A[i] != B[i]: a+=A[i] b+=B[i] return self.dfs(a,b) def dfs(self,a,b): if not a: ...

0.587289

n=int(input()) string_list=[input() for i in range(n)] count = len(set(string_list)) print(count)

0.585922

class Solution: def isvalid(self,C): if len(C)>2: return False if len(C)==1: a = min(C) if a==1 or C[a]==1: # EXPLANATION: # a==1 : All lengths are unitary like A=[1,2,3,4,...], so poping anything is fine # C[a...

0.583349

n = int(input()) s = '' s1 = '' ans = 0 for i in range(n): s = input() if (s != s1): ans += 1 s1 = s print(ans)

0.58062

class Solution: def longestStrChain(self, words: List[str]) -> int: by_length = collections.defaultdict(set) for word in words: by_length[len(word)].add(word) longest = 1 seen = {*()} mx = len(by_length) mn = min(by_length) for length in sorted(b...

0.580489

def main(): n = int(input()) a = [input() for i in range(n)] result = 0 for i in range(26): for j in range(i + 1, 26): t = 0 ci = chr(i + ord('a')) cj = chr(j + ord('a')) for s in a: if s.count(ci) + s.count(cj) == len(s): ...

0.571055

def list_input(): return list(map(int,input().split())) def map_input(): return map(int,input().split()) def map_string(): return input().split() n = int(input()) a = list(input()) ans = 0 for i in range(n): for j in range(i,n): b = a[i:j+1] for k in b: if k.lower() != k: break else: ...

0.56639

import sys input = lambda: sys.stdin.readline().rstrip() T = int(input()) for _ in range(T): N = int(input()) A = [ord(a) - 97 for a in input()] B = [ord(a) - 97 for a in input()] X = [[0] * 20 for _ in range(20)] for a, b in zip(A, B): X[a][b] = 1 if a > b: print(-1) ...

0.564691

def levenshtein(a,b): d = [[0] * (len(b) + 1) for _ in range(len(a) + 1)] d[0][:] = list(range(len(b)+1)) for i in range(1, len(a) + 1): d[i][0] = i for i, x in enumerate(a): for j, y in enumerate(b): d[i+1][j+1] = min(1 + d[i][j+1], 1 + d[i+1][j], d[i][j] + (1 if x != y el...

0.562438

t = int(input()) for j in range(0, t): n = int(input()) m = 100 for i in range(0, n): str = input() p = min(str.count("a",0,len(str)),str.count("b",0,len(str))) if (m > p): m = p print(m) t = t-1

0.560066

class Solution: def findLength(self, A, B): def check(length): seen = {A[i:i+length] for i in range(len(A) - length + 1)} return any(B[j:j+length] in seen for j in range(len(B) - length + 1)) A = ''.join(map(chr, A)) ...

0.554512

class Solution: def findLengthOfShortestSubarray(self, arr: List[int]) -> int: n = len(arr) if n<=1: return 0 l,r = n,-1 for i in range(1,n): if arr[i]<arr[i-1]: l = i break # monotonicially increasing ...

0.554344

def prefix1(a, b): cnt = 0 for i, j in zip(a, b): if i == j: cnt += 1 else: return cnt return cnt def prefix2(a, b, num): for i in range(num, -1, -1): if b.startswith(a[:i]): return i def zfunc(str_): z = [] k = len(str_) for i ...

0.554234

def CeilIndex(A, l, r, key): while (r - l > 1): m = l + (r - l)//2 if (A[m] >= key): r = m else: l = m return r def LongestIncreasingSubsequenceLength(A, size): # Add boundary case, # when array size is one tailTable = [0...

0.553438

t = [0] * 26 def get_k(c): return ord(c) - ord('a') def analyze(s): length_of_str = len(s) pos = 0 beauty_table = [0] * 26 for i in range(1, length_of_str): if s[i] != s[pos]: k = get_k(s[pos]) beauty_table[k] = max(beauty_table[k], i - pos) pos = i ...

0.55268

class Solution: def longestCommonSubsequence(self, a: str, b: str) -> int: last, current = [0] * (len(b) + 1), [0] * (len(b) + 1) for i in range(len(a) - 1, -1, -1): for j in range(len(b) - 1, -1, -1): if a[i] == b[j]: current[j] = 1 + last[j ...

0.552675

from collections import Counter def solve(A,B): a = Counter(A) b = Counter(B) ans = 0 for i in a: if i in b: ans += min(a[i],b[i]) return ans t = int(input()) for _ in range(t): A = input() B = input() print(solve(A,B))

0.551887

for _ in range(eval(input())): S1=input() m1=len(S1)/2 S2=input() m2=len(S2)/2 d1={} d2={} for i in range(len(S1)): c=S1[i] v=abs(m1-i) if c in d1: if v<d1[c][0]: d1[c]=[v,i] else: d1[c]=[v,i] for i in range(len(S2)...

0.551574

import re def buy_newspaper(s1, s2): p = re.sub(r"(.)", r"\1?", s1) return -1 if set(s2) - set(s1) else len(re.findall(p, s2)) - 1

0.549747

from collections import defaultdict as dd def find(a, b): n = len(a) m = len(b) dp = [[0]*(m+1) for i in range(n+1)] for i in range(n-1,-1, -1): for j in range(m-1, -1, -1): if a[i] == b[j]: dp[i][j] = dp[i+1][j+1] + 1 mx = dd(int) ans = 0 for i in range(n-1, -1, -1): for j in range(m-1, -1, -1): ...

0.548582

class Solution: def ladderLength(self, beginWord, endWord, wordList): wordDict = set(wordList) if not endWord in wordDict: return 0 visited = set() beginSet = set() beginSet.add(beginWord) visited.add(beginWord) endSet = set() ...

0.547535

# cook your dish here n=int(input()) l=[] for i in range(n): l.append(input()) m=int(input()) s=input() c=0 res=[s[i:j] for i in range(len(s)) for j in range(i+1,len(s)+1)] res=list(dict.fromkeys(res)) for i in res: if i in l: c=c+1 print(c)

0.545429

def sort_str(s): o = [] for c in s: o.append(c) o.sort() return "".join(o) def find_ana(s): if len(s) <= 1: return 0 h = {} c = 0 for i in range(len(s)): for j in range(i+1, len(s)+1): t = sort_str(s[i:j]) if t in h: c += h[t] ...

0.54107

n = int(input()) m = 6 arr = [] for i in range(n): arr.append(input()) for i in range(n - 1): for j in range(i + 1, n): d = 0 for z in range(6): if arr[i][z] != arr[j][z]: d += 1 if d == 6: m = min(m, 2) elif d == 5: ...

0.540298

t = int(input()) for _ in range(t): n = int(input()) a = input().strip() prev = a[0] ans = -1 for i in a: if prev == i: ans += 1 prev = i print(ans)

0.540134

class Solution: def minSwap(self, A: List[int], B: List[int]) -> int: n = len(A) if n == 1: return 0 dp = [[float('inf'), float('inf')] for _ in range(n)] dp[0] = [0,1] #[natural, swapped] for i in range(1, n): if A[...

0.540121

import sys input = sys.stdin.readline n = int(input()) def MakeSet(x): x.parent = x x.rank = 0 def Union(x, y): xRoot = Find(x) yRoot = Find(y) if xRoot.rank > yRoot.rank: yRoot.parent = xRoot elif xRoot.rank < yRoot.rank: xRoot.parent = yRoot elif xRoot != yRoo...

0.539403

from collections import defaultdict n = int(input()) d = defaultdict(int) r = 0 for i in range(n): d[input()] += 1 for i in range(n): s = input() if d[s]: d[s] -= 1 else: r += 1 print(r)

0.537799

n = int(input()) arr = input() final = len(arr) arr = arr.split() lens = [0 for x in range(n)] visit = [0 for x in range(n)] cnt = 0 ans = 0 for i in range(n): if visit[i]: continue lens[cnt] = len(arr[i]) for j in range(i+1,n): if arr[j]==arr[i]: arr[j] = cnt visit[j] = 1 arr[i] = cnt cnt...

0.536875

from sys import stdin from collections import Counter def func(arr,n,l): count=0 k=l//n if n<len(arr): for ele in arr[0:n]: count+=max(0,k-ele) else: for ele in arr: count+=max(0,ele-k) return count for _ in range(int(stdin.readline())): s=stdin.readline().strip() d=Counter(s) arr=sorted(list(d.val...

0.536757

import sys readline = sys.stdin.readline readlines = sys.stdin.readlines ns = lambda: readline().rstrip() ni = lambda: int(readline().rstrip()) nm = lambda: map(int, readline().split()) nl = lambda: list(map(int, readline().split())) prn = lambda x: print(*x, sep='\n') def solve(): n = ni() s = nl() dp =...

0.534657

class Solution: def numSpecialEquivGroups(self, A: List[str]) -> int: return len(set(''.join(sorted(s[0::2])) + ''.join(sorted(s[1::2])) for s in A))

0.533006

'''input abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxy...

0.531103

n = int(input()) d = {} for i in range(n): s = input() if s in d: d[s] += 1 else: d[s] = 1 print(d[max(d,key=d.get)])

0.529563

class Solution: def findLengthOfLCIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) < 1: return 0 cur_len = 1 max_len = 1 for i in range(1,len(nums)): if nums[i] > nums[i-1]: cur_...

0.527885

def check(s): arr=[s[0]] l=len(s) f1=0 for i in range(1,l): if arr==[]: arr.append(s[i]) elif arr[-1]!=s[i]:arr.append(s[i]) else: del arr[-1] if arr==[]: return True else: return False count = 0 for t in range(eval(input())): s=input().strip() if check(s): count+=1 print(count)

0.526253

t=int(input()) no_of_chars = 256 # Function to find smallest window # containing all characters of 'pat' def findSubString(string, pat): len1 = len(string) len2 = len(pat) if len1 < len2: return 0 hash_pat = [0] * no_of_chars hash_str = [0] * no_of_chars for i in...

0.52502

class Solution: def findShortestSubArray(self, nums): diction = {} for i in nums: if i not in diction: diction[i] = 1 else: diction[i] += 1 degree = max(list(diction.values())) ...

0.523362

# coding: utf-8 # Your code here! def solve(s, c): if(len(s)==1): if s[0]==c: return 0 else: return 1 ans1 = sum([i!=c for i in s[:len(s)//2]]) + solve(s[len(s)//2:],chr(ord(c)+1)) ans2 = sum([i!=c for i in s[len(s)//2:]]) + solve(s[:len(s)//2],chr(ord(c)+1)) ret...

0.522907

n = int(input()) a = set(''.join(sorted(set(v))) for v in input().split()) print(len(a))

0.522825

line = input().split() n = int(line[0]) m = int(line[1]) lst = [input()] sml = [] for i in range(n - 1): lst.append(input()) sml.append(False) ans = 0 for i in range(m): flag = True for j in range(n - 1): flag = flag and ((lst[j][i] <= lst[j + 1][i]) or sml[j]) if flag: for j in ra...

0.522155

from collections import * def go(): n,s,t=int(input()),input(),input() if Counter(s)!=Counter(t): return -1 ans=0 for i in range(n): k=0 for j in range(i,n): while k<n and s[k] != t[j]: k += 1 if k == n: break k += 1 ans = max(ans, j-i+1) return n-ans for _ in range(int(input())): print(go())

0.522042

class Solution: def maxUniqueSplit(self, s: str) -> int: self.x, n = 0, len(s) def maxUniqueSplit_(i=0, S=set()): if s[i:] not in S: self.x = max(self.x, len(S) + 1) for j in range(i + 1, n): if s[i : j] not in S and len(S) + 1 + n...

0.521995

import sys n = int(sys.stdin.readline().strip()) s = sys.stdin.readline().strip() dp = [[-1] * (n + 1) for i in range(26)] for c in range(26): for j in range(n): tst = 1 if s[j] == chr(c + 97) else 0 dp[c][1 - tst] = max(dp[c][1 - tst], 1) for k in range(j + 1, n): if s[k] ...

0.521217

class Solution: def findMinStep(self, board, hand): """ :type board: str :type hand: str :rtype: int """ res=float("inf") hmap=collections.defaultdict(int) for c in hand: hmap[c]+=1 res=self.helper(board,hmap) if...

0.520867

# Definition for an interval. # class Interval: # def __init__(self, s=0, e=0): # self.start = s # self.end = e class Solution: def eraseOverlapIntervals(self, intervals): """ :type intervals: List[Interval] :rtype: int """ intervals = sorted(...

0.520708

s=input() dp=[[0,0,0] for i in range(len(s))] for i in range(len(s)): if s[i]=='a': dp[i][0]=dp[i-1][0]+1 dp[i][1]=dp[i-1][1] dp[i][2]=max(dp[i-1][1]+1,dp[i-1][2]+1) else: dp[i][0]=dp[i-1][0] dp[i][1]=max(dp[i-1][0]+1,dp[i-1][1]+1) dp[i][2]=dp[i-1][2] e=len(s)-1 p...

0.520108

# AC import sys sys.setrecursionlimit(1000000) class Main: def __init__(self): self.buff = None self.index = 0 def __next__(self): if self.buff is None or self.index == len(self.buff): self.buff = self.next_line() self.index = 0 val = self.buff[self.ind...

0.519772

for t in range(int(input())): s = input() r = input() diff = list() index = list() cnt = 0 for i in range(len(s)): if s[i] != r[i]: cnt += 1 index.append(i) for i in range(1, len(index)): diff.append(index[i] - index[i - 1] - 1) diff.sort() fmin = cnt ** 2 oper = cnt ; moves = cnt for i in diff: ...

0.519013

class Solution: def numDistinct(self, s, t): """ :type s: str :type t: str :rtype: int """ setOft=set(t) news="" for ch in s: if ch in setOft: news+=ch dp=[[1 for i in range(len(news)+1)] for j in range(l...

0.516848

for _ in range(int(input())): st=input().replace("=","") if not len(st):print(1) else: cu=mx=1 for j in range(1,len(st)): if st[j]==st[j-1]:cu+=1 else:mx=max(mx,cu);cu=1 print(max(mx+1,cu+1))

0.516494

class Solution: def minIncrementForUnique(self, A: List[int]) -> int: if not A: return 0 A.sort() prev = A[0] res = 0 for num in A[1:]: if num <= prev: prev += 1 res += prev-num else: ...

0.515098

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): print(*args, **kwargs, file=sys.stderr) dprint('debug mode') except ...

0.514309

from sys import stdin from heapq import heappop, heappush, heapify def main(): n = int(stdin.readline()) a = stdin.readline().split() q = [] p = 0 c = 0 l = [0] * (n + 1) r = [0] * (n + 1) k = [0] * (n + 1) pa = [0] * (n + 1) for i, x in enumerate(a): if x == a[p]: ...

0.514243

from operator import mul from functools import reduce def solve(arr): return reduce(mul, map(len, map(set, arr)), 1)

0.51416

from math import * def r1(t): return t(input()) def r2(t): return [t(i) for i in input().split()] for _ in range(r1(int)): n = r1(int) a = r2(int) g = True for i in range(n): if a[i] != i + 1: g = False break if g: print(0) continue g =...

0.51392

class Solution: def partitionDisjoint(self, A: List[int]) -> int: biggest = A[0] newbiggest = A[0] lenL = 1 total = 1 for itr in A[1:]: total += 1 if itr < biggest: lenL = total biggest = newbiggest else: ...

0.512724

def solve(a, b): if len(a) is 1: return b.count(a) index = [x for x in range(len(b)-1) if b[x] is a[0]] return sum(solve(a[1:], b[x+1:]) for x in index)

0.511656

n=int(input()) C=[0]+list(map(int,input().split())) #n=5000 #C=list(range(n+1)) A=[] for i in range(1,n+1): if C[i]!=C[i-1]: A.append(C[i]) L=len(A) DP=[[[0]*L for i in range(L)] for j in range(2)] #左の色に揃える or 右の色に揃える,左からi～j番目を def color(r,i,j):#i<j if r==1: if A[i]==A[j]: DP[r][...

0.509823

import sys def GRIG(L): LENT = len(L) MINT = 1 GOT = 0 DY = [ [{x: 0 for x in range(0, 10)}, 0, 0] ] for i in L: DY.append([{x: 0 for x in range(0, 10)}, 0, 0]) GOT += 1 for j in range(0, GOT): if DY[j][0][i] == 1: DY[j][0][i] = 0 ...

0.509677

def det(s, i, j): ans = 0 curr = i for a in s: if a == curr: ans += 1 if curr == i: curr = j else: curr = i if i == j: return ans return ans // 2 * 2 for t in range(int(input())): s = list(map(int, list(input()))) ans = 0 for i in range(...

0.509326

#scott http://codeforces.com/problemset/problem/265/A new problem RO = input() # darn i don't know how to read string ins = input() #scott n = 0 for x in range (len(ins)): #scott yeah that looks fine #print (x) if ins[x] == RO[n]: n += 1 #scott print(n+1)

0.50879

n = int(input()) a = list(input()) b = list(input()) a = [int(i) for i in a] b = [int(i) for i in b] a.sort() b.sort() c = a[::] d = b[::] ans1 = 0 ans2 = 0 for i in a: for j in range(len(b)): if b[j] > i: del b[j] ans2 += 1 break for i in c: for j in range(len(d)): ...

0.508538

class Solution: def findLUSlength(self, a, b): """ :type a: str :type b: str :rtype: int """ return max(len(a),len(b)) if a != b else -1

0.508456

class Solution: def findLongestChain(self, pairs): """ :type pairs: List[List[int]] :rtype: int """ pairs = sorted(pairs,key=lambda x:x[1]) res = 1 first = pairs[0] for i in pairs[1:]: if first[-1] < i[0]: res += ...

0.508297

def upc(c): if c >= 'a' and c <= 'z': c = chr(ord(c) - ord('a') + ord('A')) return c a1, a2 = {}, {} for i in input(): if i in a1: a1[i] += 1 else: a1[i] = 1 for i in input(): if i in a2: a2[i] += 1 else: a2[i] = 1 r1, r2 = 0, 0 a3, a4 = {}, {} for k in a1...

0.506804

# # abc096 b # import sys from io import StringIO import unittest from collections import Counter class TestClass(unittest.TestCase): def assertIO(self, input, output): stdout, stdin = sys.stdout, sys.stdin sys.stdout, sys.stdin = StringIO(), StringIO(input) resolve() sys.stdout.se...

0.506725

from sys import stdin input = stdin.readline n = int(input()) s = list(input().strip()) for i in range(26): char = chr(ord('z') - i) prev = chr(ord('z') - i - 1) updated = True while updated: updated = False for idx in range(len(s)-1, -1, -1): if s[idx] == char: ...

0.506181

from collections import Counter def solve(a,b): return 0 if Counter(b) - Counter(a) else len(a) - len(b)

0.506142

class Solution: def numSplits(self, s: str) -> int: left = [0]*len(s) unique = set() n_distinct = 0 for i, l in enumerate(s): if l not in unique: unique.add(l) n_distinct += 1 left[i] = n_distinct count...

0.504016

def find_short(s): return min(len(x) for x in s.split())

0.503711

from collections import Counter def anagram_counter(words): return sum(n*(n-1)// 2 for n in Counter(''.join(sorted(x)) for x in words).values())

0.502541

def bs(arr, val, key=lambda x:x): l, r = 0, len(arr)-1 if key(arr[l])>val: return l if key(arr[r])<=val: return r+1 while l+1<r: m = (l+r)>>1 v = key(arr[m]) if v<=val: l = m else: r = m return r def bs_left(arr,...

0.501455

# Enter your code here. Read input from STDIN. Print output to STDOUT xml_str="" n=int(input()) for i in range(0,n): tmp_str=input() xml_str=xml_str+tmp_str import xml.etree.ElementTree as etree tree = etree.ElementTree(etree.fromstring(xml_str)) root=tree.getroot() ar=[] def cnt_node(node): return max...

0.500604

n=int(input()) l1=list(map(int,input().split())) l2=list(map(int,input().split())) fined=0 i=0 j=0 d1={} while i<n and j<n: if l1[i] in d1: i+=1 continue if l1[i]==l2[j]: i+=1 j+=1 else : while j<n and l2[j]!=l1[i]: d1[l2[j]]=1 j+=1 ...

0.500418

def solve(S): a = set(S) return len(a) t = int(input()) for _ in range(t): s = input() print(solve(s))

0.499702

from collections import Counter def create_anagram(s, t): return sum((Counter(s) - Counter(t)).values())

0.499208

#ABC147　C　やってる途中 n=int(input()) l=[] for i in range(n): a=int(input()) l_=[] for j in range(a): xy=list(map(int,input().split())) l_.append(xy) l.append(l_) ans=0 for i in range(2**n): table=[0]*n flag=False for j in range(n): if (i>>j)&1: table[j]=1 for j in range(n): for k in l[j...

0.497743

class Solution: def countCharacters(self, words: List[str], chars: str) -> int: d={} for i in chars: if i in d: d[i]+=1 else: d[i]=1 l=0 for i in words: flag = True for j in i: if j in d: ...

0.49747

class Solution: def flipgame(self, fronts: List[int], backs: List[int]) -> int: w = set(fronts[i] for i in range(len(fronts)) if fronts[i] == backs[i]) x = set() for a in fronts: if a not in w: x.add(a) for a in backs: if a not in w: ...

0.497371

from operator import mul from functools import reduce from collections import Counter from math import factorial as fact def uniq_count(s): return fact(len(s)) // reduce(mul, map(fact, Counter(s.lower()).values()), 1)

0.497118

class Solution: def heightChecker(self, heights: List[int]) -> int: max_val = max(heights) freq = [0] * (max_val + 1) for num in heights: freq[num] += 1 for num in range(1,len(freq)): freq[num] += freq[num-1] places = [0] * len(heights) ...

0.49662

from collections import Counter class Solution: def longestArithSeqLength(self, A: List[int]) -> int: c = dict(Counter(A).most_common()) # print(c) m1 = max(c.values()) # A = list(set(A)) # A.sort() index = {} # for i in range(len(A)): # index[A[i]...

0.496093

class Node(object): def __init__(self): super(Node, self).__init__() self.next = [-1] * 26 self.trans = [] self.matches = 0 self.leaf = 0 self.link = 0 class AhoCorasick(object): def __init__(self): super(AhoCorasick, self).__init__() self.T = [No...

0.495993

import bisect from functools import lru_cache class Solution: def makeArrayIncreasing(self, A: List[int], B: List[int]) -> int: B = sorted(set(B)) @lru_cache(None) def find_larger_value_in_B(val): if val >= B[-1]: return float('inf') return B[bisect...

0.495792

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ res = 0 temp = sorted(arr) sum1, sum2 = 0, 0 for i in range(0,len(arr)): sum1 += arr[i] sum2 += temp[i] if(sum1 =...

0.494752

def main(): from sys import stdin, stdout for _ in range(int(stdin.readline())): n = int(stdin.readline()) inp1 = [-1] * (n + 1) inp2 = [-1] * (n + 1) for i, ai in enumerate(map(int, stdin.readline().split())): if inp1[ai] < 0: inp1[ai] = i ...

0.494185

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ cnt, sm, ism = 0, 0, 0 for i, num in enumerate(arr): sm += num ism += i if sm == ism: cnt += 1 return cnt

0.49339

input() def v(x): ret = 0 for i in x: if ord('A') <= ord(i) <= ord('Z'): ret += 1 return ret print(max(v(i) for i in input().strip().split()))

0.49316

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.492679

import sys from math import * def minp(): return sys.stdin.readline().strip() def mint(): return int(minp()) def mints(): return map(int, minp().split()) def add(a,b): return (a+b)%1000000007 def sub(a,b): return (a+1000000007-b)%1000000007 def mul(a,b): return (a*b)%1000000007 p = 102367 s = list(map(int,...

0.492604

class Ddict: def __init__(self): self.dicts={} def add(self,key): d=self.dicts for i in key: if i not in d: d[i]={} d=d[i] d[' ']='' def find(self,key): if key=='': return '','' d=self.dicts q=[] ...

0.492484

Given a non-empty array of numbers, a0, a1, a2, … , an-1, where 0 ≤ ai < 231. Find the maximum result of ai XOR aj, where 0 ≤ i, j < n. Could you do this in O(n) runtime? Example: Input: [3, 10, 5, 25, 2, 8] Output: 28 Explanation: The maximum result is 5 ^ 25 = 28.

class Solution: def findMaximumXOR(self, nums): """ :type nums: List[int] :rtype: int """ ans = 0 for bit in range(31, -1, -1) : ans = (ans << 1) + 1 pre = set() for n in nums : p = (n >> bit) & ans ...

0.82571

class Solution: def getSum(self, a, b): max = 0x7FFFFFFF mask = 0xFFFFFFFF while b != 0: a, b = (a ^ b) & mask, ((a & b) << 1) & mask return a if a <= max else ~(a ^ mask)

0.679458

def maximum_xor_secondary(sequence): stack, answer = [], 0 for x in sequence: while stack: answer = max(answer, stack[-1] ^ x) if stack[-1] > x: break else: stack.pop() stack.append(x) return answer size, num = input(), [...

0.673301

n = int(input()) + 1 t = [0] + list(map(int, input().split())) for i in range(1, n): t[i] = t[i] ^ t[i - 1] print(max(t[j] ^ t[i] for i in range(0, n) for j in range(i + 1, n)))

0.610289

n = int(input()) a = list(map(int, input().split())) print(max(a) ^ a[-1])

0.600607

from functools import reduce from gmpy2 import comb from operator import xor def transform(a, x): return reduce(xor, (comb(n + 1, x + 1) for n in a))

0.581598

class Solution: def subarrayBitwiseORs(self, A: List[int]) -> int: res = set() cur = set() for a in A: cur = {a | i for i in cur} cur |= {a} res |= cur return len(res)

0.564435

def flipping_game(num): current = 0 biggest = 0 for i in num: current = max(0, current - ( i or -1 ) ) biggest = max(biggest, current) return sum(num) + (biggest or -1)

0.564356

#!/usr/bin/env python3 def main(): N = int(input()) A = list(map(int, input().split())) B = list(map(int, input().split())) ans = 0 for k in range(30): C = [x & ((1 << (k+1)) - 1) for x in A] D = [x & ((1 << (k+1)) - 1) for x in B] C.sort() D.sort() # print(f...

0.557678

# cook your dish here def value(a, b, c): if(c == '&'): return a&b elif(c == '^'): return a^b elif(c == '|'): return a|b def break_rules(n, operator): if(len(n) == 1): return n elif(len(n) == 2): return [value(n[0], n[1], operator[0])] else: cont_...

0.551509

def oddity(n): while True: n, m = divmod(n, 2) yield m def oddest(arr): res = arr[0] for n in arr[1:]: if next(b > a for a, b in zip(oddity(res), oddity(n)) if a != b): res = n return res

0.549876

n = int(input()) p = [int(i) for i in input().split()] s = [0] * n for i in range(1,n): s[i] = s[i-1] ^ i q = 0 for i in range(n): q = q ^ p[i] if (n // (i+1)) % 2 == 1: q = q ^ s[i] q = q ^ s[n % (i+1)] print(q)

0.541774

import sys input = sys.stdin.readline N=int(input()) A=list(map(int,input().split())) XOR=0 for a in A: XOR^=a for i in range(N): A[i] &=~XOR USED=[0]*N for bi in range(60,-1,-1): for i in range(N): if USED[i]==0 and A[i] & (1<<bi)!=0: USED[i]=1 useind=i ...

0.54133

AVAILABLE_METHODS = { 'even' : lambda x: x / 2, 'odd': lambda x: 3 * x + 1 } def generator(x): temp = x temp_num = 0 while temp > 1: if temp % 2 == 0: temp = AVAILABLE_METHODS['even'](temp) else: temp = AVAILABLE_METHODS['odd'](temp) temp_num += 1 ...

0.540145

class Solution: def hammingDistance(self, x, y): """ :type x: int :type y: int :rtype: int """ x = x ^ y y = 0 while (x): y += 1 x &= x-1 return y

0.539048

class Solution: def singleNumber(self, nums): """ :type nums: List[int] :rtype: int """ l = len(nums) if l == 1: return nums[0] # Attempt 1 - 80% # nums.sort() # i = 0 # while i < l: # if i...

0.53546

def largest_sum(s): return max(sum(map(int,x)) for x in s.split('0'))

0.529389

class Solution: def findMaxConsecutiveOnes(self, nums): """ :type nums: List[int] :rtype: int """ if nums == []: return 0 count = 0 countMax =0 for ele in nums: if ele == 1: count += 1 ...

0.52911

#!/usr/bin/env python3 def divmod(f, g): assert g h = 0 for i in reversed(list(range(f.bit_length() - g.bit_length() + 1))): if f & (1 << (g.bit_length() + i - 1)): f ^= g << i h ^= 1 << i return h, f def gcd(f, g): while g: q, r = divmod(f, g) f, g =...

0.528918

j=n=1<<int(input()) a=[[0,int(s)]for s in input().split()] while j>1:j>>=1;a=[sorted(a[i]+a[i^j]*(i&j>0))[-2:]for i in range(n)] for s,f in a[1:]:j=max(j,s+f);print(j)

0.525977

def convert_bits(a,b): return bin(a^b).count("1")

0.523778

def solve(arr): p, q = 1, 1 for k in arr: x, y = max(k), min(k) a = p * x b = q * x c = p * y d = q * y p = max(a, b, c, d) q = min(a, b, c, d) return max(p, q)

0.522202

def high(x): return max(x.split(), key=lambda k: sum(ord(c) - 96 for c in k))

0.520661

from collections import Counter def obtain_max_number(arr): c = Counter(arr) while 1: find = next((k for k in c if c[k] > 1), None) if not find:return max(c) c[find] -= 2 c[find*2] = c.get(find*2,0) + 1

0.518582

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): #print(*args, **kwargs, file=sys.stderr) # in python 3.4 **kwarg...

0.517603

def array_operations(a, n): li = [] for i in range(n): m = max(a) a = [m-i for i in a] if a in li: if not n & 1 : return li[-1] return a li.append(a) return a

0.517155

class Solution: def minOperations(self, nums: List[int]) -> int: return sum(bin(x).count('1') for x in nums)+len(bin(max(nums)))-3

0.514885

n=int(input()) a=list(map(int,input().split())) X=[] b=a[0] for i in range(1,n) : b^=a[i] for i in range(n) : x=b^a[i] X.append(x) for i in X : print(i,end=" ")

0.511742

n = int(input()) l = list(map(int, input().split())) best = 0 for i in range(n): for j in range(i, n): for k in range(j, n): best = max(best, l[i] | l[j] | l[k]) print(best)

0.508231

import sys from copy import copy input = sys.stdin.readline n = int(input()) l = [int(a) for a in input().split()] x = [] for i in range(0, 20): res = 0 for a in l: if a & (1 << i): res += 1 x.append(res) res = 0 for i in range(n): a = 0 for j in range(20): if i < x[j]...

0.50728

def highest_value(a, b): return max(a, b, key=lambda s: sum(map(ord, s)))

0.505729

class Solution: def xorOperation(self, n: int, start: int) -> int: if n == 0: return 0 i = 1 res = start while i != n: res = res ^ (2*i + start) i += 1 return res

0.505163

n=int(input()) F = [int(input().replace(" ",""),2) for _ in range(n)] P = [list(map(int,input().split())) for _ in range(n)] total = -10**9 for i in range(1,2**10): pgain = 0 for f,p in zip(F,P): pgain += p[bin(f&i).count("1")] if total < pgain: total = pgain k = i print(total)

0.502616

for _ in range(int(input())): n=int(input()) l=list(map(int,input().split())) su=l[0] for i in range(1,n): su^=l[i] print(su)

0.501946

from collections import defaultdict N,K = list(map(int, input().split())) A = list(map(int, input().split())) BMAX = 40 """ ・K以下の非負整数の範囲で〜：桁DP感ある・XORをとる：桁ごとに確認できる・Xを選んで、f = X xor A1 + X xor A2 + ... + X xor AN 　 -> それぞれのAと毎回 xor 取るのではなく、桁ごとに xor を取ることができる　←　超重要のはず　 -> A1 ~ AN の各桁（2進数の時の）に1が立っているのが何個あるか数えておく遷移 dp...

0.500411

import sys a = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8092, 16184, 32368, 64736, 129472, 258944, 517888, 1035776, 2071552, 4143104, 8286208, 16572416, 33144832, 66289664, 132579328, 265158656, 530317312, 1060634624, 2121269248, 4242538496, 8485076992, 16970153984, 33940307968] print(a[int(sys.stdin...

0.495998

from operator import __or__, __and__, __xor__ from sys import stdin, stdout n, b, c = int(stdin.readline()), 0, 1023 m = {'|': __or__, '&': __and__, '^': __xor__} for i in range(n): t, v = [i for i in stdin.readline().split()] b = m[t](b, int(v)) c = m[t](c, int(v)) x, o, a = 0, 0, 1023 for i in range(10): ...

0.495818

class Solution: def deleteAndEarn(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums);#count is a dict [3,4,2]--> {2:1,3:1,4:1} prev = None; avoid = using = 0; for k in sorted(count): temp = ma...

0.495533

def fixed_xor(a, b): return "".join(f"{int(x, 16)^int(y, 16):x}" for x, y in zip(a, b))

0.492545

def oddest(numbers): most_odd = 0 # The current most odd number in the list max_oddity = -1 # The current greatest oddity rate, starts at -1 so that even an even number can be the unique most odd is_unique = True # If the current most odd number is really the most, so if there is no unique odd...

0.492455

def solve(xs): m = 0 for x in sorted(xs): if x > m + 1: break m += x return m + 1

0.491898

def calc(a): res = [0] * (len(a) + 1) for k in range(len(a)): res = [2 * max(a[i] + res[i+1], a[i+k] + res[i]) for i in range(len(a) - k)] return res[0]

0.489886

#!/usr/bin/pypy3 from sys import stdin,stderr import random import cProfile def readInts(): return map(int,stdin.readline().strip().split()) def print_err(*args,**kwargs): print(*args,file=stderr,**kwargs) def solve(vs): return None def generate_tree(n,ns): out = [0 for _ in range(2**(n+1))] def gt(...

0.489502

import sys l,r=map(int,(sys.stdin.readline().split())) i=64 while i>=0: if ((1<<i)&l!=0 and (1<<i)&r!=0) or ((1<<i)&l==0 and (1<<i)&r==0):i-=1 else:break print((1<<(i+1))-1)

0.489348

def next_higher(value): s = f'0{value:b}' i = s.rfind('01') s = s[:i] + '10' + ''.join(sorted(s[i+2:])) return int(s, 2)

0.488047

def halving_sum(n): s=0 while n: s+=n ; n>>=1 return s

0.487982

from itertools import accumulate class Solution: def xorQueries(self, arr: List[int], queries: List[List[int]]) -> List[int]: xors = [0] for a in arr: xors.append(a^xors[-1]) return [xors[i]^xors[j+1] for i,j in queries]

0.486401

import sys def calc(b0, b1, q): if q == 0: return b0 ^ b1 if q == 1: return b0 | b1 if q == 2: return b0 & b1 n, m = list(map(int,sys.stdin.readline().split())) arr1 = {} opt = ['XOR', 'OR', 'AND'] arr2 = [] for j in range(n): a, b = list(map(str,sys.stdin.readline().split(" := "...

0.48634

def f(m): v = 0 for x in m: v |= x return v input() print(f(map(int, input().split())) + f(map(int, input().split())))

0.486097

from functools import reduce from fractions import gcd def final_attack_value(x, monster_list): return reduce(lambda a, b: a + (b if b <= a else gcd(a, b)), monster_list, x)

0.485585

class Solution: def singleNumber(self, nums): """ :type nums: List[int] :rtype: int """ a = set(nums) a = sum(a)*3 - sum(nums) return int(a/2)

0.484843

def dp(): dparr = [0] * len(sections) for i in range(len(sections) - 1, -1, -1): _, curend, curcomfort = sections[i] nextsection = i + 1 try: while sections[nextsection][0] <= curend: nextsection += 1 except IndexError: # Loop til end inc = curcomfort else: inc = curcomfort + dparr[nextsecti...

0.484586

def target_game(values): a = b = 0 for n in values: a, b = b, max(a + n, b) return max(a, b)

0.483756

def dominator(arr): for x in set(arr): if arr.count(x) > len(arr)/2.0: return x return -1

0.482403

def find_outlier(int): odds = [x for x in int if x%2!=0] evens= [x for x in int if x%2==0] return odds[0] if len(odds)<len(evens) else evens[0]

0.481974

#!/usr/bin/env python # -*- coding: utf-8 -*- from collections import defaultdict n = int(input()) A = list(map(int,input().split())) pattern = set() for a in A: p = [] while a > 0: if a in pattern: break p.append(a) a = a//2 pattern |= set(p) def check(v): ret = 0 ...

0.481184

def mystery(n): return n ^ (n >> 1) def mystery_inv(n): mask = n >> 1 while mask != 0: n = n ^ mask mask = mask >> 1 return n; def name_of_mystery(): return "Gray code"

0.480942

import collections as col import itertools as its import sys import operator from bisect import bisect_left, bisect_right from copy import copy, deepcopy class Solver: def __init__(self): pass def solve(self): a = int(input()) b = int(input()) c = int(input()) d = ...

0.479914

n, m = list(map(int, input().split())) a = list(map(int, input().split())) b = list(map(int, input().split())) possible = [[] for i in range(n)] for i in range(n): for j in range(m): possible[i].append(a[i] & b[j]) import sys for answer in range(2 ** 9): answer_flag = 1 for i in range(n): ...

0.479533

class Solution: def maximumSwap(self, num): """ :type num: int :rtype: int """ s = str(num) nums = [int(_) for _ in s] dp = [-1]*len(nums) for i in range(len(nums)-1,-1,-1): if i==len(nums)-1: dp[i] = i ...

0.478492

import operator from functools import reduce OPS = { "AND": operator.and_, "OR" : operator.or_, "XOR": operator.xor } def logical_calc(array, op): return reduce(OPS[op], array)

0.477556

#!/usr/bin/env python3 [n, k] = list(map(int, input().strip().split())) ais = list(map(int, input().strip().split())) iais = [0 for _ in range(n + 1)] for i in range(n): iais[i + 1] = iais[i] + ais[i] def calc(k, split): res = 0 for i in range(k): res &= iais[split[i + 1]] - iais[split[i]] return res def check...

0.47715

class Solution: def bitwiseComplement(self, N: int) -> int: return (1 << len(bin(N))-2) - N - 1

0.476608

M = 10 ** 9 + 7 def solve1(x): n = len(x) x = int(x, 2) ans = 0 for a in range(2 ** n): for c in range(2 ** n): b = a ^ x d = c ^ x if a < c and b > d: ans += 1 return ans % M def solve2(x): return int(x, 2) * pow(2, (len(x) - 1), M) %...

0.474576

def solution(digits): numlist = [int(digits[i:i+5]) for i in range(0,len(digits)-4)] return max(numlist)

0.474069

import sys n=int(input()) f={ 'AND':(lambda a:a[0]&a[1]), 'OR':(lambda a:a[0]|a[1]), 'XOR':(lambda a:a[0]^a[1]), 'NOT':(lambda a:a[0]^1), } g={'0':(lambda a:0), '1':(lambda a:1)} d=[(g[v[0]],[]) if o=='IN' else (f[o],[int(a)-1 for a in v]) for o,*v in map(str.split,sys.stdin.read().strip().split('\n'))] t=[0] for i...

0.47124

import sys input = sys.stdin.readline n = int(input()) a = list(map(int, input().split())) b = a ans = 0 for k in range(29): a0 = [] a1 = [] a0a = a0.append a1a = a1.append b0 = [] b1 = [] b0a = b0.append b1a = b1.append for i in a: if i&(1<<k): a1a(i) else: ...

0.469655

class Solution: def largestOverlap(self, A, B) -> int: leng = len(A[0]) # convert A, B to binary a = 0 b = 0 for i in range(0, leng * leng): row = int(i % leng) col = int(i / leng) a = (a << 1) + A[col][row] b = (b << 1) + B[co...

0.46859

score=lambda n:2**n.bit_length()-1

0.468458

def sort_by_bit(arr): return sorted(arr, key=lambda x: (bin(x).count("1"), x))

0.468403

n = int(input()) l = list(map(int, input().split())) inv = 0 out = 0 mult = 1 for i in range(32): curr = dict() opp = 0 same = 0 for v in l: if v ^ 1 in curr: if v & 1: opp += curr[v ^ 1] else: same += curr[v ^ 1] if ...

0.464366

class Solution: def getMax(self, arr, m, n): res = 0 for e in arr: if m >= e[0] and n >= e[1]: res += 1 m -= e[0] n -= e[1] return res def findMaxForm(self, strs, m, n): """ :type strs: List[str]...

0.463456

def largest_sum(arr): sum = max_sum = 0 for n in arr: sum = max(sum + n, 0) max_sum = max(sum, max_sum) return max_sum

0.462989

class Solution: def binaryGap(self, n: int) -> int: maxDist = 0 currDist = 0 while n: if n & 1 and currDist != 0: maxDist = max(maxDist, currDist) currDist = 1 elif n & 1: currDist = 1 elif not n & 1 and curr...

0.461808

def array_conversion(arr): sign = 0 while len(arr) > 1: sign = 1^sign arr = list(map(lambda x, y: x+y, arr[0::2],arr[1::2]) if sign else map(lambda x, y: x*y, arr[0::2],arr[1::2])) return arr[0]

0.46123

import copy def solve(): n = int(input()) a = [int(c)-1 for c in input().split(' ')] nextcard = [[-1 for i in range(8)] for j in range(n)] for i in range(n-2, -1, -1): nextcard[i] = copy.copy(nextcard[i+1]) nextcard[i][a[i+1]] = i+1 jump = [[-1 for i in range(n+1)] for j in range(...

0.461118

def gap(num): s = bin(num)[2:].strip("0") return max(map(len, s.split("1")))

0.460718

#!/usr/bin/env python3 import sys def rint(): return list(map(int, sys.stdin.readline().split())) #lines = stdin.readlines() def get_num1(i): cnt = 0 while i: if i%2: cnt +=1 i //=2 return cnt n = int(input()) a = list(rint()) b = [get_num1(aa) for aa in a] ans = 0 #S0[...

0.459795

from itertools import permutations tab = [] for i in range(5): buf = input().split(" ") X = [] for j in range(5): X.append(int(buf[j])) tab.append(X) res = 0 for perm in permutations([0,1,2,3,4], 5): wyn = 0 wyn += tab[perm[0]][perm[1]] wyn += tab[perm[1]][perm[0]] wyn += tab[perm[2]][perm[3]] ...

0.458757

n, x = list(map(int, input().split())) ar = list(map(int, input().split())) cnt = {} ans = 0 for val in ar: cur = val ^ x if cur in cnt: ans += cnt[cur] if val in cnt: cnt[val] += 1 else: cnt[val] = 1 print(ans)

0.457693

def basereduct(x): for _ in range(150): x = int(str(x), int(max(str(x))) + 1 + ('9' in str(x))) if x < 10: return x return -1

0.457462

a=1 for i in[*open(0)][1].split():a*=int(i);a=[-1,a][0<=a<=10**18] print(a)

0.457274

x = int(input()) y = list(map(int, input().split(' '))) if y == [0] * x: print(0) quit() for i in range(x): if y[i] == 1: y = y[i:] break y.reverse() for i in range(len(y)): if y[i] == 1: y = y[i:] break y.reverse() l = [] ct = 0 for i in y: if i == 0: ct+=...

0.456956

""" Codeforces Contest 264 Div 2 Problem B Author : chaotic_iak Language: Python 3.3.4 """ def main(): n, = read() print(max(read())) ################################### NON-SOLUTION STUFF BELOW def read(mode=2): # 0: String # 1: List of strings # 2: List of integers inputs = input().strip(...

0.456389

def f(a, ind): if a[ind] == 0: return -1 k = a[ind] // 14 x = a[ind] % 14 b = a[:] b[ind] = 0 for j in range(14): b[j] += k for j in range(ind + 1, ind + x + 1): j1 = j % 14 b[j1] += 1 res = 0 for j in range(14): if b[j] % 2 == 0: r...

0.45598

def find(r): return sum(2**i for i in r)

0.455759

n = int(input()) for _ in range(n): a, b = list(map(int, input().split())) print(a ^ b)

0.453604

n = int(input()) seq = sorted(list(map(int, input().split()))) #Left (inc), Right(exc), bit to check, value to add queue = [(0,n,30,0)] best = 2 ** 30 while queue: l, r, b, v = queue.pop() if b >= 0: mask = 1 << b if not mask & seq[l] and mask & seq[r - 1]: for i in range(...

0.453501

def xor(a,b): return a != b

0.452931

l = int(input()) n = input() best = int(n) p = (l - 1) // 2 for i in range(p, -1, -1): if (n[i + 1] == '0'): continue best = min(best, int(n[0:(i + 1)]) + int(n[i + 1:])) break p = l // 2 for i in range(p, l): if (n[i] == '0'): continue best = min(best, int(n[0:i]) + int(n[i:])) break print(best)

0.452686

def sxore(n): return [n, 1, n + 1, 0][n % 4]

0.452523

class Solution: def findLHS(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums) ret = 0 for i in count: if i+1 in count: ret = max(ret, count[i]+count[i+1]) return ret...

0.452515

# cook your dish here n=int(input()) l=[int(i) for i in input().split()] xors=[] for i in range(n): for j in range(i+1,n): xors.append([l[i]^l[j],(i,j)]) xors.sort() #print(xors) upto=[0]*n for i in range(len(xors)): #a=xors[i][0] b,c=xors[i][1][0],xors[i][1][1] upto[c]=max(upto[c],upto[b]+1) #...

0.451285

from itertools import cycle,chain def max_hexagon_beam(n,seq): h = 2*n-1 seq = cycle(seq) sums = [ [0]*h for _ in range(3)] # [horz, diagUp, diagDown] for r in range(h): for c,v in zip(list(range(n+r if r<n else h+n-1-r)),seq): idxs = (r, c+max(0,r-n+1), c+max(0,...

0.451144

class Solution: def maxValueAfterReverse(self, nums: List[int]) -> int: n = len(nums) base = sum([abs(nums[i] - nums[i+1]) for i in range(n - 1)]) if (n <= 2): return base #best = base #for i in range(n-1): # for j in range(i+1, n): # ...

0.450685

from functools import reduce VALID = frozenset('abcdefABCDEF') def fisHex(s): return reduce(lambda b, c: b ^ c, (int(a, 16) for a in s if a in VALID), 0)

0.450484

def bits_war(numbers): odd, even = 0, 0 for number in numbers: if number % 2 == 0: if number > 0: even += bin(number).count('1') else: even -= bin(number).count('1') else: if number > 0: odd += bin(number).count(...

0.450278

from operator import xor def choose_move(game_state): """Chooses a move to play given a game state""" x = reduce(xor, game_state) for i, amt in enumerate(game_state): if amt ^ x < amt: return (i, amt - (amt ^ x))

0.450147

from fractions import gcd def binary_gcd(x, y): return bin(gcd(x, y)).count('1')

0.44912

from functools import reduce def disjunction(operands, is_exclusive): return reduce(bool.__xor__ if is_exclusive else bool.__or__, operands)

0.448229

import sys n = int(sys.stdin.readline().strip()) a = list(map(int, sys.stdin.readline().strip().split())) b = a[:] C = [0] * n x = [0] * n for i in range (0, 40): for j in range (0, n): x[j] = b[j] % 2 b[j] = b[j] // 2 if sum(x) == 1: for j in range (0, n): if x[j] == 1: ...

0.447966

The i-th person has weight people[i], and each boat can carry a maximum weight of limit. Each boat carries at most 2 people at the same time, provided the sum of the weight of those people is at most limit. Return the minimum number of boats to carry every given person. (It is guaranteed each person can be carried by ...

class Solution: def numRescueBoats(self, people: List[int], limit: int) -> int: people.sort() lo = 0 hi = len(people) - 1 count = 0 while lo <= hi: count += 1 if people[lo] + people[hi] <= limit: lo += 1 h...

0.807172

n, limit = map(int, input().split()) lst = list(map(int, input().split())) count = 0 for i in range(n): if lst[i] >= limit: count += 1 print(count)

0.664145

from collections import deque class Solution: def longestSubarray(self, nums, limit): maxQ, minQ = deque(), deque() i = 0 res = 0 for j, val in enumerate(nums): while maxQ and val > maxQ[-1]: maxQ.pop() while minQ and val < minQ[-1]: minQ.pop() max...

0.606368

import sys from bisect import * sys.stdin = open('input.txt', 'r') sys.stdout = open('output.txt', 'w') ans=n=int(input()) a=sorted(map(int,sys.stdin.readline().split())) for i in range(n):ans=min(ans,n-bisect_right(a,a[i]*2)+i) print(ans)

0.573799

3 # Copyright (C) 2016 Sayutin Dmitry. # # This program is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License as # published by the Free Software Foundation; version 3 # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY;...

0.572591

class Solution: def bagOfTokensScore(self, tokens: List[int], P: int) -> int: tokens = sorted(tokens) left = 0 right = len(tokens) - 1 points = 0 if len(tokens) == 1: if tokens[0] <= P: return 1 if len(tokens) == 0: return 0 ...

0.572207

# cook your dish here a,b=list(map(int,input().split())) ls=[] for i in range(a): ls.append(int(input())) ls.sort() c=0;i=0 while i<(a-1): if ls[i+1]-ls[i]<=b: c=c+1 i=i+1 i=i+1 print(c)

0.564957

from heapq import * from collections import Counter class Solution: def minSetSize(self, arr: List[int]) -> int: counter = Counter(arr) size = len(arr) # unique elements (remove half of them) if len(counter) == size: return (size - 1) // 2 + 1 ...

0.5604

n = int(input()) a = list(map(int, input().split())) ans = [1] t = 1 for i in range(n - 1): if a[i + 1] / a[i] <= 2: t += 1 else: t = 1 ans.append(t) print(max(ans))

0.558945

class Solution: def maxNonOverlapping(self, nums: List[int], target: int) -> int: sum_set = set() sum_set.add(0) temp = 0 count = 0 for num in nums: temp += num if temp - target in sum_set: count += 1 sum_set.clear() ...

0.5583

x=int(input()) l=list(map(int, input().split(' '))) l.sort() a=1 for i in l: if i>=a: a+=1 print(a)

0.555759

n = int(input()) p = -float("INF") ans = 1 A = [] for i in range(n) : x, h = list(map(int, input().split())) A.append([x,h]) for i in range(n-1) : x, h = A[i] if x-h > p : ans += 1 p = x elif x+h < A[i+1][0] : ans += 1 p = x+h else : p = x print(ans)

0.546905

# cook your dish here import operator no_seq = int(input().strip()) seqs = [] for idx in range(no_seq): input_now = input().strip().split(" ") seqs.append([int(input_now[0]), int(input_now[1])]) seqs.sort(key=operator.itemgetter(0)) curr = seqs[0] answer = 1 for i in range(1, no_seq): if curr[1] < seqs[i...

0.546903

N, I = list(map(int, input().split())) A = sorted([int(a) for a in input().split()]) B = [] j = 0 for i in range(N): if i == 0 or A[i] == A[i-1]: B.append(j) else: j += 1 B.append(j) def calc(k): K = 1<<k i = 0 j = 0 ma = 0 while j < N: if B[j]-B[i] <= K - 1:...

0.542361

n=int(input()) p=list(map(int,input().split())) c=1 q=p[0] for i in range(1,n): q=min(q,p[i]) if p[i]<=q: c+=1 print(c)

0.541877

# O(n) time and space # Hashmap and array # Count number then count occurrence: # Count the occurrences of each number using HashMap; # Keep a count of different occurences # From small to big, for each unvisited least frequent element, deduct from k the multiplication with the number of elements of same occurrence, ch...

0.541082

class Solution: def numTimesAllBlue(self, light: List[int]) -> int: right = 0 ans = 0 for i in range(len(light)): if (light[i] > right): right = light[i] if (i + 1 == right): ans += 1 return ans

0.537869

test=int(input()) for _ in range(test): n=int(input()) ls=list(map(int,input().split())) ls.sort() s=0 for i in range(n): if s>=ls[i]: s=s+1 else: break print(s)

0.536641

n = input() v = list(map(int, input().split())) best = 1 current = 1 for i in range(1, len(v)): if v[i-1] <= v[i]: current += 1 else: current = 1 best = max(best, current) print(best)

0.533943

n,m=list(map(int,input().split())) L=list(map(int,input().split())) ans=0 ind=0 bus=0 while(ind<n): ans+=1 while(ind<n and bus+L[ind]<=m): bus+=L[ind] ind+=1 bus=0 print(ans)

0.532632

n = int(input()) ar = list(map(int,input().split(' '))) ar.sort() s=[] for i in ar: s.sort(reverse=True) for j in range(len(s)): if i>=s[j]: s[j]+=1 break else: s.append(1) print(len(s))

0.529879

n = int(input()) a = [int(x) for x in input().split()] a.sort() num = 0 res = 0 for i in range(n): if int(a[i]) >= num: res += 1 num += int(a[i]) #print(res, a[i]) print(res)

0.529099

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ cnt, sm, ism = 0, 0, 0 for i, num in enumerate(arr): sm += num ism += i if sm == ism: cnt += 1 return cnt

0.525767

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools sys.setrecursionlimit(10**7) inf = 10**20 eps = 1.0 / 10**10 mod = 10**9+7 dd = [(-1,0),(0,1),(1,0),(0,-1)] ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)] def LI(): return list(map(int, sys.stdin.readline().spli...

0.522804

def key_tri(argument): return argument[1] n = int(input()) L = [list(map(int, input().split())) for _ in range(n)] L.sort(key=key_tri) r = 1 t = L[0][1] for k in range(1,n): if L[k][0]>t: r+=1 t = L[k][1] print(r)

0.520314

read = lambda: list(map(int, input().split())) n, c = read() t = list(read()) cnt = 1 for i in range(1, n): if t[i] - t[i - 1] > c: cnt = 1 else: cnt += 1 print(cnt)

0.520182

class Solution: def minCostToMoveChips(self, position: List[int]) -> int: d = {} a = 0 b = 0 for i in position: if i not in d: d[i]=1 else: d[i]+=1 for i in d: if i%2==0: a +=d[i] ...

0.517855

class Solution: def partitionDisjoint(self, A: List[int]) -> int: biggest = A[0] newbiggest = A[0] lenL = 1 total = 1 for itr in A[1:]: total += 1 if itr < biggest: lenL = total biggest = newbiggest else: ...

0.517056

import sys n, z = list(map(int, sys.stdin.readline().strip().split())) x = list(map(int, sys.stdin.readline().strip().split())) x.sort() i = 0 j = n // 2 c = 0 while j < n and i < n // 2: if x[j] - x[i] >= z: i = i + 1 j = j + 1 c = c + 1 else: j = j + 1 print(c)

0.516225

N = int(input()) H = list(map(int,input().split())) top = H[0] cnt = 1 for i in range(1,N): if top <= H[i]: cnt += 1 top = H[i] print(cnt)

0.514964

def lamps(a): n = sum(1 for i, x in enumerate(a) if x != i % 2) return min(n, len(a) - n)

0.514628

read = lambda: map(int, input().split()) n, d = read() x = sorted(read()) ans = 2 for i in range(1, n): dx = x[i] - x[i - 1] if dx == 2 * d: ans += 1 elif dx > 2 * d: ans += 2 print(ans)

0.514609

def lis(a): b = [] for c in a: # if len(b) == 0 or c > b[-1] if len(b) == 0 or c > b[-1]: b.append(c) else: l = 0 r = len(b) while l < r-1: m = l+r>>1 # if b[m] <= c: l = m if b[m] < c: l = m ...

0.514237

# -*- coding: utf-8 -*- from time import perf_counter from sys import stdin def run(n, s): m = 0 small = n // 2 for big in range(n-1, (n+1)//2-1, -1): while small >= 0 and s[small] > s[big] / 2: small -= 1 if small == -1: break #print(small, big) smal...

0.514225

from bisect import bisect_right import heapq n = int(input()) l = [] ti, wi = list(map(int, input().split())) bal = ti pos = 1 for _ in range(n - 1): ti, wi = list(map(int, input().split())) if ti > bal: pos += 1 l.append((ti, wi - ti + 1)) l.sort() best_pos = pos op = bisect_right(l, (bal, floa...

0.512444

n, k = list(map(int, input().split())) a = list(map(int, input().split())) library = [] money = 0 for i in range(len(a)): if a[i] not in library: money += 1 if len(library) < k: library.append(a[i]) else: curmin = n curindex = 0 found = [n] * l...

0.51229

n = int(input()) mas = list(map(int, input().split())) dist = set([0]) res = 1 for i, e in enumerate(mas): time = i + 1 if e in dist: dist.remove(e) else: res += 1 dist.add(time) print(res)

0.510965

n=int(input()) a=list(map(int,input().split())) b=0 a[1:]=sorted(a[1:]) while a[0]<=a[-1]: a[-1]-=1 a[0]+=1 b+=1 a[1:]=sorted(a[1:]) print(b)

0.510898

def bs(arr, val, key=lambda x:x): l, r = 0, len(arr)-1 if key(arr[l])>val: return l if key(arr[r])<=val: return r+1 while l+1<r: m = (l+r)>>1 v = key(arr[m]) if v<=val: l = m else: r = m return r def bs_left(arr,...

0.510534

class Solution: def shipWithinDays(self, weights: List[int], D: int) -> int: left = max(weights) right = left * len(weights) // D while left < right: mid = left + (right - left) // 2 c = 0 d = 1 for w in weights: if c + w <= ...

0.51034

n = int(input()) pos_blast = [list(map(int, input().split())) for _ in range(n)] MAX_N = max(pos_blast, key=lambda x: x[0])[0] + 2 power = [0 for _ in range(MAX_N)] tower = [False for _ in range(MAX_N)] can_destroy = [0 for _ in range(MAX_N)] for pos, blast in pos_blast: pos += 1 tower[pos] = True power[pos...

0.509974

n = int(input()) nums = (abs(int(x)) for x in input().split()) nums = list(sorted(nums)) left = 0 right = 0 ans = 0 while left < n: while right < n and nums[right] <= 2 * nums[left]: right += 1 ans += right - left - 1 left += 1 print(ans)

0.509185

n, B = list(map(int, input().split())) A = [int(x) for x in input().split()] odd, even = 0, 0 cuts = [] for i in range(n - 1): if A[i] % 2 == 0: even += 1 else: odd += 1 if odd == even: cuts += [(abs(A[i] - A[i + 1]), i)] cuts.sort() result = 0 for cost, _ in cuts: if co...

0.508956

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ res = 0 temp = sorted(arr) sum1, sum2 = 0, 0 for i in range(0,len(arr)): sum1 += arr[i] sum2 += temp[i] if(sum1 =...

0.508609

def fish(shoal): eaten, size, target = 0, 1, 4 for f in sorted(map(int, shoal)): if f > size: break eaten += f if eaten >= target: size += 1 target += 4 * size return size

0.508155

n = int(input()) a = [int(x) for x in input().split()] alive = 0 left = n for i in range(n - 1, -1, -1): if i < left: alive += 1 left = min(left, i - a[i]) print(alive)

0.507294

n, k = [int(i) for i in input().split()] w = [int(i) for i in input().split()] tot = 0 for wi in w: tot += (wi+k-1)//k ans = (tot+1)//2 print(ans)

0.506863

def main(): n = int(input()) a = list(int(x) for x in input().split()) s = sum(a) t = 0 for i in range(n): t += a[i] if 2 * t >= s: print(i + 1) return main()

0.506607

rest, people = map(int, input().split()) types = list(map(int, input().split())) a = dict() for elem in types: if elem in a: a[elem] += 1 else: a[elem] = 1 maximum = 0 for key in a: if a[key] > maximum: maximum = a[key] needed = maximum while needed % people != 0: needed += 1 ans...

0.505795

l=[] for _ in range(int(input())): l.append(int(input())) avg=0;l.sort() for i in range(0,len(l)): j=0;n=len(l)-1 while j<n: s=l[j]+l[n] if s>2*l[i]: n-=1 elif s<2*l[i]: j+=1 else: avg+=1;break print(avg)

0.505607

from bisect import bisect_right def main(): n = int(input()) a = [int(input()) for _ in range(n)] a.reverse() lis = [a[0]] for i in range(1, n): if a[i] >= lis[-1]: lis.append(a[i]) else: lis[bisect_right(lis, a[i])] = a[i] print((len(lis))) def __star...

0.504155

class Solution: def maxJumps(self, arr: List[int], d: int) -> int: dp = [1] * (len(arr) + 1) stack = [] for i, n in enumerate(arr + [1000000]): while stack and arr[stack[-1]] < n: same_height_idx = [stack.pop()] while stack and arr[stack[-1]] == ar...

0.504117

from sys import stdin, stdout from math import sin, tan, cos, pi, atan2, sqrt, acos, atan, factorial from random import randint n, x, y = map(int, stdin.readline().split()) values = list(map(int, stdin.readline().split())) if x > y: stdout.write(str(n)) else: v = sum(map(lambda v: int(v <= x), values)) st...

0.503013

d, n, t = 0, int(input()), list(map(int, input().split())) p = {a: 0 for a in set(t)} for i in range(n): a = t[i] if not a in p: continue p.pop(a) s = t.count(a) - 1 if 2 * s < d: continue if s > d: d = s k = i + 1 for j in range(k, n): if t[j] == a: for b in set(t[k:...

0.502018

# cook your dish here n=(int(input())) x=[] for _ in range(n): a,b=map(int,input().split()) a=[a,a+b] x.append(a) x = sorted(x, key= lambda i:i[1]) y=-1 c=0 for i in range(len(x)): if x[i][0]>y: c+=1 y=x[i][1] print(c)

0.501897

from math import ceil t=int(input()) for i in range(t): p=int(input()) l=list(map(int,input().split())) maxx=1 for i in range(len(l)): maxx=max(maxx,l.count(l[i])) if(maxx*2>p): print(maxx) else: q=p-maxx*2 maxx+=ceil(q/2)...

0.50015

__MULTITEST = True ## solve def solve(): n, x = map(int, input().split()) a = list(map(int, input().split())) a.sort() group = 0 ptr = n-1 members = 0 currentMin = int(1e10) while ptr > -1: currentMin = min(currentMin, a[ptr]) members += 1 if currentMin * memb...

0.499154

class Solution: def removeCoveredIntervals(self, intervals: List[List[int]]) -> int: intervals.sort(key=lambda x: (x[0], -x[1])) prev_end = result = 0 for _, end in intervals: if end > prev_end: result += 1; prev_end = end return ...

0.498728

def main(): n = int(input()) arr = sorted(map(int, input().split())) j = 1 for x in arr: if x >= j: j += 1 print(j - 1) return 0 main()

0.497368

for _ in range(int(input())): n = int(input()) wt = list(map(int, input().split())) count = {} for x in wt: if x not in count: count[x] = 0 count[x] += 1 k = 0 for s in range(101): temp = 0 temp2 = 0 for x in count: if (s - x) in c...

0.496552

n = int(input()) d = list(map(int, input().split())) s = {i:0 for i in [1, 2]} for i in d: s[i] += 1 if s[2] >= s[1]: print(s[1]) else: print(s[2] + (s[1] - s[2]) // 3)

0.495421

n=int(input()) l=[0]*n for i in range(n): l[i]=int(input()) l.sort() s=0 i=n-1 while i>=0: x=2*l[i] if l[-1]>=x: j=i while j<len(l): if l[j]>=x: l.pop(j) l.pop(i) s+=1 break j+=1 i-=...

0.495017

for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) ans = 1 l1 = l[0] for i in range(1,n): if l[i] <= l1: l1 = l[i] ans = ans + 1 print(ans)

0.494525

import sys input=sys.stdin.readline for _ in range(int(input())): N=int(input()) e=list(map(int,input().split())) e.sort() ans=0 val=0 g=0 for i in range(0,N): g+=1 val=e[i] if g>=val: ans+=1 g=0 val=0 print(ans)

0.493981

# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right class Solution: def sufficientSubset(self, root, limit): if root.left == root.right: return None if root...

0.492926

def game(n,l,p): if(len(l)==0): return 0 l.sort() if(len(l)>=1 and p<l[0]): return 0 l.sort() c=0 ma=set() ma.add(0) while(len(l)): if(p>=l[0]): p-=l[0] c+=1 ma.add(c) l=l[1:] else: ...

0.492113

class Solution: def findContentChildren(self, g, s): """ :type g: List[int] :type s: List[int] :rtype: int """ res = 0 heapq.heapify(g) s.sort() for num in s: if not g: break elif g[0] <= num...

0.491963

def check(l,n): m = 0 for i in range(n-1): x = l[i] c = 0 j = i while (j+2<n and l[j+2]==x) or (j+1<n and l[j+1] == x): if l[j+1] == x: j = j+1 else: j+=2 c+=1 if m<c: m = c return m t = ...

0.491877

n, _q = map(int, input().split()) mni = [-1] * 200001 mxi = [-1] * 200001 cnt = [0] * 200001 nd = 0 a = list(map(int, input().split())) for i, v in enumerate(a): if mni[v] == -1: mni[v] = i; nd += 1 mxi[v] = i cnt[v] += 1 r = 0 z = 0 currmax = 0 for i, v in enumerate(a): if i == mni[v]: z += 1 if i ...

0.491758

import bisect; def getIntList(): return list(map(int, input().split())); def getTransIntList(n): first=getIntList(); m=len(first); result=[[0]*n for _ in range(m)]; for i in range(m): result[i][0]=first[i]; for j in range(1, n): curr=getIntList(); for i in range(m): ...

0.490508

from collections import deque def loose_change(coins_list, amount_of_change): q = deque([(0, amount_of_change)]) while q: l, a = q.popleft() if a == 0: return l q.extend((l + 1, a - i) for i in coins_list if a >= i)

0.489873

n = int(input()) a = list(map(int, input().split())) info = 0 i = 0 dir = 1 result = 0 while True: if info >= a[i]: info += 1 a[i] = n + 1 if info == n: break i += dir if i < 0 or i == n: dir = -dir i += dir result += 1 print(result)

0.48977

n = int(input()) a = list(map(int, input().split())) maxi = 0 ans = 0 for i in range(n): a[i] -= 1 maxi = max(maxi, a[i]) if maxi == i: ans += 1 print(ans)

0.489252

class Solution: def minPatches(self, nums, n): """ :type nums: List[int] :type n: int :rtype: int """ res, cur, i = 0, 1, 0 while cur <= n: if i < len(nums) and nums[i] <= cur: cur += nums[i] i += 1 ...

0.488363

def prog(): n = int(input()) inp = list(map(int,input().split())) ans = 0 for i in range(len(inp)): x,y = 0 ,0 for j in range(i,len(inp)): x+=inp[j] y+=100 if(x>y): ans = max(ans,(j-i)+1) print(ans) prog()

0.487927

l = 0 r = -1 segL, time = [int(x) for x in input().split()] a = [int(x) for x in input().split()] segSum = 0 segments = [] ##while r < segL-1: ## r += 1 ## segSum += a[r] ## if segSum == time: ## segments.append(r+1-l) ## elif segSum > time: ## segments.append(r-l) ## while segSum > ...

0.487005

t=int(input()) for _ in range(t): size=int(input()) li=list(map(int,input().split())) c = 0 for i in li: if(i >=len(li)/2): c += 1 print(c)

0.486707

import sys import math input=sys.stdin.readline #sys.setrecursionlimit(1000000) mod=int(1000000007) i=lambda :map(int,input().split()) n=int(input()) a=[int(x) for x in input().split()] t=[[0]*21 for i in range(300005)] for i in range(n): t[i][0]=a[i] def build(n): for j in range(1,20): for i in rang...

0.486572

import math for i in range(int(input())): n,x=list(map(int,input().split())) l=list(map(int,input().split())) l.sort() flag=0 d=0 for j in range(n): if l[j]>x: for k in range(j,n): if x<l[k]: d+=(math.ceil(math.log(l[k]/x)/math.log(2))+1) else: d+=1 x=l[...

0.486016

# cook your dish here from math import ceil for _ in range(int(input())): n=int(input()) a=list(map(int,input().split())) ans=ceil(n/min(a)) print(int(ans))

0.484628

class Solution: def maxDistToClosest(self, seats: List[int]) -> int: ans = 0 for seat, group in itertools.groupby(seats): if not seat: k = len(list(group)) ans = max(ans, (k+1)//2) return max(ans, seats.index(1),seats[::-1].index(1))

0.484205

n, m = map(int, input().split()) ab = [list(map(int, input().split())) for _ in range(m)] ab = sorted(ab, key=lambda x: x[1]) s = ab[0][1] ans = 1 for i in ab: if s <= i[0]: ans += 1 s = i[1] print(ans)

0.483127

from math import ceil def branch(n): if n == 1: return 0 l = int(ceil(n ** 0.5)) // 2 n -= (2 * l - 1) ** 2 + 1 return n // (2*l or 1)

0.482709

from collections import defaultdict maxn = 2000000000 mk = [] bs = 1 while bs <= maxn: mk.append(bs) bs *= 2 n = int(input()) ls = [int(i) for i in input().split()] dic = defaultdict(int) for i in ls: dic[i] += 1 cnt = 0 for i in ls: dic[i] -= 1 flag = False for j in mk: if dic[j - ...

0.482612

import sys input = sys.stdin.readline from collections import deque def read(): N = int(input().strip()) P = list(map(int, input().strip().split())) return N, P def solve(N, P): ans = 0 p = deque(P) q = deque() q.append(p.popleft()) for i in range(1, N): if i == q[-1]: ...

0.482453

#70 C - Five Transportations N = int(input()) lis = [int(input()) for _ in range(5)] mini = min(lis) group = (N+mini-1)//mini ans = 5 + group - 1 print(ans)

0.482335

n = int(input()) ans = 0 stk = [] for v in map(int, input().split()): last = 0 while len(stk) and stk[-1][0] < v and stk[-1][1]: last = max(last, stk[-1][1]) del stk[-1] if not len(stk) or stk[-1][0] < v: stk.append((v, 0)) else: stk.append((v, last + 1)); ans = max(ans,...

0.482333

# cook your dish here n=int(input()) counts=dict() z=0 upper=None for i in range(0,n): a,h= [int(num) for num in input().split()] counts[a]=h for key,count in counts.items(): c=0 x=key-count y=key+count c1=0 c2=0 for j in counts.keys(): if j==key: continue else: if x<=j<=key: c1=0 break els...

0.481879

# python3 def main(): n = int(input()) hard, soft = 0, 0 while n: n -= 1 if input().split()[1] == "hard": hard += 1 else: soft += 1 if hard < soft: hard, soft = soft, hard assert soft <= hard side = 1 while side ** 2 / 2 < soft or ...

0.480993

mod = 1000000007 eps = 10**-9 inf = 10**9 def main(): import sys input = sys.stdin.readline class Bit: def __init__(self, n): self.size = n self.tree = [0] * (n + 1) def sum(self, i): s = 0 while i > 0: s += self.tree[i] ...

0.480648

T = int(input()) for _ in range(T): W = list(map(int, input().strip().split())) S = W[0] W = W[1:] W = W[::-1] i = 0 c = 0 flag = 0 while (len(W) != 0 or flag != 1) and i<len(W): k = i su = 0 while su <= S and k<len(W)-1: su += W[k] k += 1 if su-W[k-1]<=S: c += 1 else: flag = 1 i += 1 p...

0.480011

from math import ceil def get_participants(h): return int(ceil(0.5 + (0.25 + 2 * h) ** 0.5))

0.479792

def minimum_steps(arr, n): arr = sorted(arr) s = 0 for i,v in enumerate(arr): s += v if s >= n: return i

0.479745

n,k = map(int,input().split()) prices = list(map(int,input().split())) prices.sort() sum,cnt = 0, 0 for price in prices: sum += price if sum <= k: cnt += 1 else: break print(cnt)

0.479398

# cook your dish here t=int(input()) while(t): t=t-1 n,k=list(map(int,input().split())) q=list(map(int,input().split())) days,rem=0,0 for i in range(n): rem+=q[i] if(rem>=k): rem-=k else: days=i+1 break days+=1 if(rem>=k): days+=(rem//k)+1 print(days)

0.479154

n, a, b = [int(x) for x in input().split()] hs = [int(x) for x in input().split()] target = 1.0 * hs[0] * a / b left = sorted(hs[1:]) s = sum(hs) res = 0 while s > target: res += 1 s -= left[-res] print(res)

0.478417

class Solution: def findLHS(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums) ret = 0 for i in count: if i+1 in count: ret = max(ret, count[i]+count[i+1]) return ret...

0.478047

import bisect from functools import lru_cache class Solution: def makeArrayIncreasing(self, A: List[int], B: List[int]) -> int: B = sorted(set(B)) @lru_cache(None) def find_larger_value_in_B(val): if val >= B[-1]: return float('inf') return B[bisect...

0.477542

R=lambda:list(map(int,input().split())) n,k=R() a=sorted(R()) b=0 for i in a: while i>k+k: k+=k b+=1 k=max(k,i) print(b)

0.477463

class Solution: def busyStudent(self, startTime: List[int], endTime: List[int], queryTime: int) -> int: res=0 for start,end in zip(startTime,endTime): if(queryTime>=start and queryTime<=end): res+=1 return res

0.477423

n, m = list(map(int, input().split())) line = list(map(int, input().split())) pairs = set() for i in range(m): a, b = list(map(int, input().split())) pairs.add((a,b)) req = [line.pop()] out = 0 while line != []: nex = line.pop() works = True for pers in req: if not (nex, pers) in pairs: ...

0.477263

Given a list of strings, you need to find the longest uncommon subsequence among them. The longest uncommon subsequence is defined as the longest subsequence of one of these strings and this subsequence should not be any subsequence of the other strings. A subsequence is a sequence that can be derived from one seque...

class Solution: def findLUSlength(self, strs): """ :type strs: List[str] :rtype: int """ def isSubseq(s1, s2): i, m=0, len(s1) for c in s2: if i==m: return True if s1[i]==c: i+=1 return i==m ...

0.836976

class Solution: def findLUSlength(self, a, b): """ :type a: str :type b: str :rtype: int """ return max(len(a),len(b)) if a != b else -1

0.738123

class Solution: def maxLength(self, arr: List[str]) -> int: def digit_representation(s): ans = 0 for c in s: ans |= 1<<(ord(c)-ord('a')) return ans A = sorted([(len(s), digit_representation(s)) for s in set(arr) if len(set(s))==len(s)], re...

0.689731

class Solution: def isvalid(self,C): if len(C)>2: return False if len(C)==1: a = min(C) if a==1 or C[a]==1: # EXPLANATION: # a==1 : All lengths are unitary like A=[1,2,3,4,...], so poping anything is fine # C[a...

0.656548

class Solution: def longestStrChain(self, words: List[str]) -> int: by_length = collections.defaultdict(set) for word in words: by_length[len(word)].add(word) longest = 1 seen = {*()} mx = len(by_length) mn = min(by_length) for length in sorted(b...

0.652093

class Solution: def lengthOfLongestSubstring(self, s): """ :type s: str :rtype: int """ L, res, last = -1, 0, {} for R, char in enumerate(s): if char in last and last[char] > L: L = last[char] elif R-L > res: ...

0.650219

def longest(a1, a2): return "".join(sorted(set(a1 + a2)))

0.645588

def longest(words): return max(map(len, words))

0.635213

class Solution: def longestWord(self, words): """ :type words: List[str] :rtype: str """ result = ""; wordSet = set(words); for word in words: if (len(word) > len(result) or len(word) == len(result) and word < result) and all(wor...

0.634311

class Solution: def findLongestWord(self, s, d): """ :type s: str :type d: List[str] :rtype: str """ result = '' for word in d: lo = 0 for l in word: lo = s.find(l, lo)+1 if lo == 0: ...

0.633135

from collections import * def go(): n,s,t=int(input()),input(),input() if Counter(s)!=Counter(t): return -1 ans=0 for i in range(n): k=0 for j in range(i,n): while k<n and s[k] != t[j]: k += 1 if k == n: break k += 1 ans = max(ans, j-i+1) return n-ans for _ in range(int(input())): print(go())

0.632379

class Solution: def minDeletionSize(self, A: List[str]) -> int: dp = [(1, 1)] * len(A[0]) for i in range(len(dp)): if i > 0: max_pre = None for pre in range(i - 1, -1, -1): for word in A: if word[pre] > word[i]: ...

0.63053

class Solution: def repeatedStringMatch(self, A, B): """ :type A: str :type B: str :rtype: int """ if not set(B).issubset(set(A)): return -1 max_rep = len(B) // len(A) + 3 A_new = A for i in ...

0.629354

class Solution: def longestDupSubstring(self, S): nums, N = [ord(c) - ord('a') for c in S], len(S) BASE, MOD = 26, 2**32 def check(L): cur_hash, seen = 0, set() for val in nums[:L]: cur_hash = (cur_hash * BASE + val) % MOD seen.add(cur_hash...

0.627728

class Solution: def findMinStep(self, board, hand): """ :type board: str :type hand: str :rtype: int """ res=float("inf") hmap=collections.defaultdict(int) for c in hand: hmap[c]+=1 res=self.helper(board,hmap) if...

0.624751

class Solution: def findLength(self, A, B): def check(length): seen = {A[i:i+length] for i in range(len(A) - length + 1)} return any(B[j:j+length] in seen for j in range(len(B) - length + 1)) A = ''.join(map(chr, A)) ...

0.61972

def prefix1(a, b): cnt = 0 for i, j in zip(a, b): if i == j: cnt += 1 else: return cnt return cnt def prefix2(a, b, num): for i in range(num, -1, -1): if b.startswith(a[:i]): return i def zfunc(str_): z = [] k = len(str_) for i ...

0.619241

def codn1(s1,s2,p): c=0 ind=0 for i in range(len(s1)): if s1[i]!=s2[i]: c+=1 ind=i if c>1 or ind==len(s1)-1: return 0 if s1[ind]>s2[ind] and s1[ind] in s2[ind+1:]: p[0]=True if s1[ind]<s2[ind] and s2[ind] in s1[ind+1:]: p[1]=True return 1 def codn2(s1,s2): if len(s1)<len(s2): ...

0.615301

class Solution: def arrayNesting(self, nums): """ :type nums: List[int] :rtype: int """ best = 0 n = len(nums) p = [] for i in range(len(nums)): j = i current = 0 while nums[j] != -1: cur...

0.613254

class Solution: def longestCommonSubsequence(self, a: str, b: str) -> int: last, current = [0] * (len(b) + 1), [0] * (len(b) + 1) for i in range(len(a) - 1, -1, -1): for j in range(len(b) - 1, -1, -1): if a[i] == b[j]: current[j] = 1 + last[j ...

0.610993

import re def buy_newspaper(s1, s2): p = re.sub(r"(.)", r"\1?", s1) return -1 if set(s2) - set(s1) else len(re.findall(p, s2)) - 1

0.609057

class Solution: def longestCommonPrefix(self, strs): """ :type strs: List[str] :rtype: str """ strs = strs import os return os.path.commonprefix(strs) # for x in strs: # if prefix in x: # print x ...

0.608946

class Solution: def firstUniqChar(self, s): """ :type s: str :rtype: int """ if not s: return -1 elif len(s) == 1: return 0 result = len(s) for ch in range(ord('a'), ord('z') + 1): if s.find(chr(ch)) ==...

0.607111

def finding_k(arr): for n in range(max(arr)-1, 0, -1): if len({ x%n for x in arr }) == 1: return n return -1

0.606202

from collections import Counter class Solution: def longestArithSeqLength(self, A: List[int]) -> int: c = dict(Counter(A).most_common()) # print(c) m1 = max(c.values()) # A = list(set(A)) # A.sort() index = {} # for i in range(len(A)): # index[A[i]...

0.606186

import sys a = input() b = input() if a != b: print(max(len(a), len(b))) else: print(-1)

0.605529

def find_longest(xs): return max(xs, key=lambda x: len(str(x)))

0.603837

def main(): n = int(input()) a = [input() for i in range(n)] result = 0 for i in range(26): for j in range(i + 1, 26): t = 0 ci = chr(i + ord('a')) cj = chr(j + ord('a')) for s in a: if s.count(ci) + s.count(cj) == len(s): ...

0.599038

from collections import defaultdict def find_uniq(a): d = {} c = defaultdict(int) for e in a: t = frozenset(e.strip().lower()) d[t] = e c[t] += 1 return d[next(filter(lambda k: c[k] == 1, c))]

0.598708

class Solution: def ladderLength(self, beginWord, endWord, wordList): wordDict = set(wordList) if not endWord in wordDict: return 0 visited = set() beginSet = set() beginSet.add(beginWord) visited.add(beginWord) endSet = set() ...

0.59864

def levenshtein(a,b): d = [[0] * (len(b) + 1) for _ in range(len(a) + 1)] d[0][:] = list(range(len(b)+1)) for i in range(1, len(a) + 1): d[i][0] = i for i, x in enumerate(a): for j, y in enumerate(b): d[i+1][j+1] = min(1 + d[i][j+1], 1 + d[i+1][j], d[i][j] + (1 if x != y el...

0.596914

class Solution: def findShortestSubArray(self, nums): diction = {} for i in nums: if i not in diction: diction[i] = 1 else: diction[i] += 1 degree = max(list(diction.values())) ...

0.596168

class Solution: def findTheLongestSubstring(self, s: str) -> int: s = s + 'a' bits, dp = {'a':0,'e':1,'i':2,'o':3,'u':4}, {0:-1} res = 0 key = 0 for i, char in enumerate(s): if char in bits: if key in dp: res = m...

0.596008

import sys import itertools inputs = sys.stdin.read().split() len_string = int(inputs[0]) desired_size = int(inputs[1]) string = inputs[2] size = 0 cost = 0 cur_set = set() cur_set.add(string) for i in range(len_string, -1, -1): cur_size = len(cur_set) if size+cur_size >= desired_size: cost += (desire...

0.593241

class Solution: def longestConsecutive(self, nums): """ :type nums: List[int] :rtype: int """ longest_streak = 0 num_set = set(nums) for num in num_set: if num - 1 not in num_set: current_num = num current...

0.592593

class Solution: def findMinMoves(self, machines): """ :type machines: List[int] :rtype: int """ if sum(machines) % len(machines) != 0: return -1 mean = sum(machines) // len(machines) cum, step = 0, 0 for x in machines: ...

0.591909

t = [0] * 26 def get_k(c): return ord(c) - ord('a') def analyze(s): length_of_str = len(s) pos = 0 beauty_table = [0] * 26 for i in range(1, length_of_str): if s[i] != s[pos]: k = get_k(s[pos]) beauty_table[k] = max(beauty_table[k], i - pos) pos = i ...

0.588938

import re import itertools from collections import Counter class Task: strings = [] answer = "" def getData(self): numberOfStrings = int(input()) for i in range(0, numberOfStrings): self.strings += [input()] def solve(self): badStrings = set() for current...

0.588417

from collections import Counter from functools import reduce from math import gcd def has_subpattern(string): return reduce(gcd, Counter(string).values()) != 1

0.588334

class Solution: def shortestSuperstring(self, A: List[str]) -> str: A = [a for i, a in enumerate(A) if all(a not in b for j, b in enumerate(A) if i != j)] def memo(f): dic = {} def f_alt(*args): if args not in dic: dic[args] = f(*args) ...

0.587684

def candies(s): if not s or len(s) == 1: return -1 return len(s) * max(s) - sum(s)

0.587227

def solve(arr): res = [] for first in (arr[0]-1, arr[0], arr[0]+1): for second in (arr[1]-1, arr[1], arr[1]+1): val, step, count = second, second-first, abs(arr[0]-first) + abs(arr[1]-second) for current in arr[2:]: val += step if abs(val-current) ...

0.586518

class Solution: def findLengthOfLCIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) < 1: return 0 cur_len = 1 max_len = 1 for i in range(1,len(nums)): if nums[i] > nums[i-1]: cur_...

0.584956

import sys def input(): return sys.stdin.readline()[:-1] from bisect import bisect def ctoi(c): return ord(c) - ord("a") print(ans) T = int(input()) for _ in range(T): s = input() t = input() if not (set(s) >= set(t)): print(-1) else: alph = [[] for _ in range(26)] for i in range(len(s)): alph[ctoi(s[...

0.584727

def base_finder(seq): return len(set(''.join(seq)))

0.583118

class Solution: def maxUncrossedLines(self, A, B): # Optimization #commons = set(A).intersection(set(B)) # or commons = set(A) & set(B) #A = [x for x in A if x in commons] #B = [x for x in B if x in commons] N1, N2 = len(A), len(B) dp = [[0 for _ in range(N2+1)] for ...

0.58276

def missing(seq): for digits in range(1, len(seq) // 2 + 1): my_seq = last = seq[:digits] n = int(my_seq) missing = None while len(my_seq) < len(seq): n += 1 my_seq += str(n) if not seq.startswith(my_seq): if m...

0.582423

def solve(s): return max(map(len, ''.join(c if c in 'aeiou' else ' ' for c in s).split()))

0.582374

def consecutive(arr): return max(arr) - min(arr) + 1 - len(arr) if arr else 0

0.581556

AVAILABLE_METHODS = { 'even' : lambda x: x / 2, 'odd': lambda x: 3 * x + 1 } def generator(x): temp = x temp_num = 0 while temp > 1: if temp % 2 == 0: temp = AVAILABLE_METHODS['even'](temp) else: temp = AVAILABLE_METHODS['odd'](temp) temp_num += 1 ...

0.57843

class Solution: def maxUniqueSplit(self, s: str) -> int: self.x, n = 0, len(s) def maxUniqueSplit_(i=0, S=set()): if s[i:] not in S: self.x = max(self.x, len(S) + 1) for j in range(i + 1, n): if s[i : j] not in S and len(S) + 1 + n...

0.577866

import sys input = lambda: sys.stdin.readline().rstrip() T = int(input()) for _ in range(T): N = int(input()) A = [ord(a) - 97 for a in input()] B = [ord(a) - 97 for a in input()] X = [[0] * 20 for _ in range(20)] for a, b in zip(A, B): X[a][b] = 1 if a > b: print(-1) ...

0.577802

def dominator(arr): for x in set(arr): if arr.count(x) > len(arr)/2.0: return x return -1

0.577463

from collections import Counter from functools import reduce from fractions import gcd def has_subpattern(s): c = Counter(s) m = reduce(gcd, c.values()) return ''.join(sorted(k*(v//m) for k,v in c.items()))

0.576542

from sys import stdin from collections import Counter def func(arr,n,l): count=0 k=l//n if n<len(arr): for ele in arr[0:n]: count+=max(0,k-ele) else: for ele in arr: count+=max(0,ele-k) return count for _ in range(int(stdin.readline())): s=stdin.readline().strip() d=Counter(s) arr=sorted(list(d.val...

0.575156

class Solution: def lenLongestFibSubseq(self, A: List[int]) -> int: def getFS(x1, x2): F = [x1, x2] while F[-1] <= 1000000000: F.append(F[-2] + F[-1]) return F C1 = getFS(1, 0) C2 = C1[1:] def getLLFS(x1, x2): ...

0.574794

n = int(input()) arr = input() final = len(arr) arr = arr.split() lens = [0 for x in range(n)] visit = [0 for x in range(n)] cnt = 0 ans = 0 for i in range(n): if visit[i]: continue lens[cnt] = len(arr[i]) for j in range(i+1,n): if arr[j]==arr[i]: arr[j] = cnt visit[j] = 1 arr[i] = cnt cnt...

0.574222

class Solution: def longestSubstring(self, s, k): """ :type s: str :type k: int :rtype: int """ for c in set(s): if s.count(c) < k: return max(self.longestSubstring(sp, k) for sp in s.split(c)) return len(s)

0.574148

def maxlen(s1, s2): sm, lg = sorted((s1, s2)) return min(max(lg / 3, sm), lg / 2)

0.573435

t = eval(input()) for _ in range(t): n = eval(input()) a = input().strip().split() cb, cs = 0, "" for i in range(len(a[0])): for j in range(i+1,len(a[0])+1): al = True s = a[0][i:j] for k in a[1:]: if s not in k: al = False break if al: if j-i>=cb: cb = max(cb, j-i) if len(...

0.573416

from operator import mul from functools import reduce def solve(arr): return reduce(mul, map(len, map(set, arr)), 1)

0.571692

import re reg = re.compile('a*b*c*d*e*f*g*h*i*j*k*l*m*n*o*p*q*r*s*t*u*v*w*x*y*z*') def longest(s): return max(reg.findall(s), key=len)

0.570964

def num(c): return ord(c) - 97 import sys input = sys.stdin.readline t = int(input()) for _ in range(t): n = int(input()) s1 = input().strip() s2 = input().strip() char1 = [0] * 26 char2 = [0] * 26 for c in s1: char1[num(c)] += 1 for c in s2: char2[num(c)] += 1 if ...

0.569741

from os.path import commonprefix def string_suffix(s): return sum(len(commonprefix([s, s[i:]])) for i in range(len(s)))

0.567329

def list_input(): return list(map(int,input().split())) def map_input(): return map(int,input().split()) def map_string(): return input().split() n = int(input()) a = list(input()) ans = 0 for i in range(n): for j in range(i,n): b = a[i:j+1] for k in b: if k.lower() != k: break else: ...

0.566128

def lcs(x, y): if len(x) == 0 or len(y) == 0: return '' if x[-1] == y[-1]: return lcs(x[:-1], y[:-1]) + x[-1] else: lcs1 = lcs(x,y[:-1]) lcs2 = lcs(x[:-1],y) if len(lcs1) > len(lcs2): return lcs1 else: return lcs2

0.566102

from collections import defaultdict def fix_progression(arr): res = 0 for i in range(len(arr)): D = defaultdict(int) for j in range(i): q, r = divmod(arr[i]-arr[j], i-j) if not r: D[q] += 1 res = max(res, D[q]) return len(arr)-res-1

0.565334

from functools import reduce from math import gcd def survivor(a): """Round Robin by Bocker & Liptak""" def __residue_table(a): n = [0] + [None] * (a[0] - 1) for i in range(1, len(a)): d = gcd(a[0], a[i]) for r in range(d): try: nn = m...

0.56525

from collections import defaultdict def repeat_sum(l): count = defaultdict(int) for l1 in l: for val in set(l1): count[val] += 1 return sum(k for k,v in list(count.items()) if v > 1)

0.560684

#!/usr/bin/env python3 from collections import Counter try: while True: n = int(input()) s = input() if n > 26: print(-1) else: c = Counter(s) print(sum(c.values()) - len(c)) except EOFError: pass

0.560478

def string_constructing(a, s): if len(s) == 0: return 0 i = -1 for j, c in enumerate(s): i = a.find(c, i+1) if i < 0 or i == len(a) - 1: break return len(a) - j + (i < 0) + string_constructing(a, s[j + (i >= 0):])

0.560293

def find_short(s): return min(len(x) for x in s.split())

0.559148

def first_tooth(lst): gums = lst[:1] + lst + lst[-1:] diff = [gums[i+1]*2 - gums[i] - gums[i+2] for i in range(len(lst))] m = max(diff) return diff.index(m) if diff.count(m) == 1 else -1

0.558345

import sys import math import bisect import heapq import collections S = input() T = input() lenS = len(S) lenT = len(T) F1 = [False]*26 F2 = [False]*26 alpha = 'abcdefghijklmnopqrstuvwxyz' for i in range(lenS): F1[alpha.index(S[i])] = True for i in range(lenT): F2[alpha.index(T[i])] = True for i in range(26):...

0.557889

from fractions import gcd def min_price(nums): nums.sort() ns = [0] + [float('inf')] * (nums[0] - 1) for c in nums[1:]: d = gcd(nums[0], c) for r in range(d): n = min(ns[r::d], default=float('inf')) if n < float('inf'): for j in range(nums[0] // d): ...

0.55695

class Solution: def findMaximumXOR(self, nums): """ :type nums: List[int] :rtype: int """ ans = 0 for bit in range(31, -1, -1) : ans = (ans << 1) + 1 pre = set() for n in nums : p = (n >> bit) & ans ...

0.556472

from collections import Counter def only_duplicates(string): cs = Counter(string) return ''.join(c for c in string if cs[c] > 1)

0.55596

class Solution: def maxPower(self, s: str) -> int: n = len(s) count = 0 res = s[0] cur_count = 1 # Traverse string except # last character for i in range(n): # If current character # matches with next ...

0.555895

def count_subsequences(needle, haystack): count = [1] + [0] * len(needle) for a in haystack: count = [1] + [count[i] + count[i-1] * (a == b) for i, b in enumerate(needle, 1)] return count[-1] % 10 ** 8

0.555635

t = int(input()) for _ in range(t): n = int(input()) a = input().strip() prev = a[0] ans = -1 for i in a: if prev == i: ans += 1 prev = i print(ans)

0.555387

from operator import mul from functools import reduce from collections import Counter from math import factorial as fact def uniq_count(s): return fact(len(s)) // reduce(mul, map(fact, Counter(s.lower()).values()), 1)

0.555336

for _ in range(eval(input())): S1=input() m1=len(S1)/2 S2=input() m2=len(S2)/2 d1={} d2={} for i in range(len(S1)): c=S1[i] v=abs(m1-i) if c in d1: if v<d1[c][0]: d1[c]=[v,i] else: d1[c]=[v,i] for i in range(len(S2)...

0.55451

class Solution: def longestAwesome(self, s: str) -> int: cum = [0] firsts = {0: -1} lasts = {0: -1} for i, c in enumerate(s): cum.append(cum[-1] ^ (1 << (ord(c) - 48))) if cum[-1] not in firsts: firsts[cum[-1]] = i lasts[cum[-1]] = ...

0.553659

def find_uniq(arr): a, b = set(arr) return a if arr.count(a) == 1 else b

0.552412

for _ in range(int(input())): lasts = {} ans = n = int(input()) for i, a in enumerate(input().split()): if a in lasts: ans = min(ans, i - lasts[a]) lasts[a] = i ans += 1 if ans > n: ans = -1 print(ans)

0.551591

from sys import stdin,stdout import math,bisect from datetime import date from collections import Counter,deque,defaultdict L=lambda:list(map(int, stdin.readline().strip().split())) M=lambda:list(map(int, stdin.readline().strip().split())) I=lambda:int(stdin.readline().strip()) S=lambda:stdin.readline().strip() C=lambd...

0.550021

class Solution: def minDeletionSize(self, A: List[str]) -> int: return sum([list(col) != sorted(col) for col in zip(*A)])

0.547633

class MagicDictionary: def __init__(self): """ Initialize your data structure here. """ self.l = [] def buildDict(self, dict): """ Build a dictionary through a list of words :type dict: List[str] :rtype: void """ sel...

0.547228

class Solution: def longestPalindrome(self, s): """ :type s: str :rtype: int """ re = 0 set_s = set(s) flag = False for x in set_s: if s.count(x) % 2 == 0: re += s.count(x) elif s.count(x) >= 3 : ...

0.547029

# coding=utf-8 from functools import reduce a = input() b = input() c = input() alen = len(a) blen = len(b) clen = len(c) kmpnext = [0]*(clen+1) i = 1 j = 0 while i < clen: while j > 0 and c[i]!=c[j]: j = kmpnext[j] if c[i] == c[j]: j+=1 kmpnext[i+1] = j i+=1 #print(kmpnext) f = [[[0 for i in range(clen+2)]...

0.545459

class Solution: def leastBricks(self, wall): """ :type wall: List[List[int]] :rtype: int """ d = {} for i in wall: suma = 0 for j in range(len(i)-1): suma += i[j] if suma in d: d[s...

0.544819

class Solution: def kSimilarity(self, A: str, B: str) -> int: a = '' b = '' for i in range(len(A)): if A[i] != B[i]: a+=A[i] b+=B[i] return self.dfs(a,b) def dfs(self,a,b): if not a: ...

0.544659

from itertools import combinations def strings_crossover(arr, result): return sum(1 for s1,s2 in combinations(arr,2) if all(r in (x,y) for x,y,r in zip(s1,s2,result)))

0.544232

from collections import Counter n = int(input()) ss = [input() for _ in range(n)] ss.sort() c = Counter() mc = 0 for s in ss: c[s] += 1 mc = max(mc, c[s]) seen = set() for s in ss: if c[s] == mc and s not in seen: print(s) seen.add(s)

0.542727

def avoid_obstacles(arr): n=2 while 1: if all([x%n for x in arr]): return n n+=1

0.542192

class Solution: def findSubstringInWraproundString(self, p): """ :type p: str :rtype: int """ pc = None sl = 0 ll = {} for c in p: if pc and (ord(pc) + 1 == ord(c) or (pc == 'z' and c == 'a')): sl += 1 ...

0.54166

import sys input = sys.stdin.readline sys.setrecursionlimit(10 ** 7) import numpy as np # 適当な素数と原始根でrolling hash MOD = 10 ** 9 + 993 base = 123450 S = np.array([ord(x) for x in input().rstrip()],dtype=np.int64) T = np.array([ord(x) for x in input().rstrip()],dtype=np.int64) # Sの方が長くする LS = len(S) LT = len(T) n = (L...

0.541121

n = int(input()) d = {} for i in range(n): s = input() if s in d: d[s] += 1 else: d[s] = 1 print(d[max(d,key=d.get)])

0.540099

from collections import Counter def highest_rank(arr): if arr: c = Counter(arr) m = max(c.values()) return max(k for k,v in c.items() if v==m)

0.539998

from collections import Counter def common(a,b,c): return sum((Counter(a) & Counter(b) & Counter(c)).elements())

0.539897

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.539474

In a row of trees, the i-th tree produces fruit with type tree[i]. You start at any tree of your choice, then repeatedly perform the following steps: Add one piece of fruit from this tree to your baskets. If you cannot, stop. Move to the next tree to the right of the current tree. If there is no tree to the right, s...

class Solution: def totalFruit(self, tree: List[int]) -> int: prior_fruit = tree[0] prior_fruit_counter = 0 fruits_in_basket = [tree[0]] fruits_in_basket_counter = 0 max_fib = -1 for fruit in tree: if prior_fruit == fruit: prior_fruit_coun...

0.732298

n = int(input()) sweets = [int(x) for x in input().strip().split(" ")] dict = {} for i in range(n - 1): for j in range(i + 1, n): sum = sweets[i] + sweets[j] if sum in dict: dict[sum] += 1 else: dict[sum] = 1 print(max(dict.values()))

0.664962

read = lambda: map(int, input().split()) n = int(input()) a = list(read()) was = [0] * (n + 1) bal = ans = 0 for i in a: if was[i]: bal -= 1 else: bal += 1 was[i] = 1 ans = max(ans, bal) print(ans)

0.664263

""" Codeforces Contest 260 Div 1 Problem A Author : chaotic_iak Language: Python 3.3.4 """ def main(): n, = read() ar = read() a = [0] * 100001 for i in ar: a[i] += 1 dp = [0] * 100001 dp[1] = a[1] for i in range(2, 100001): dp[i] = max(a[i] * i + dp[i-2], dp[i-1]) print(dp[-...

0.66289

mi = lambda: [int(i) for i in input().split()] n = int(input()) t = mi() a = [] v = 0 c = 0 for i in t: if i == v: c += 1 else: if c != 0: a.append(c) c = 1 v = i a.append(c) r = 0 for k in range(1, len(a)): r = max(r, min(a[k - 1], a[k]) * 2) print(r)

0.660161

from collections import Counter def obtain_max_number(arr): c = Counter(arr) while 1: find = next((k for k in c if c[k] > 1), None) if not find:return max(c) c[find] -= 2 c[find*2] = c.get(find*2,0) + 1

0.658455

t = eval(input()) for i in range(t): n = eval(input()) a = list(map(int, input().split())) cnt = 2 cnt1 = 2 ll = len(a) if ll < 3: cnt1 = ll else: for j in range(2,ll): if a[j-1] + a[j-2] == a[j]: cnt += 1 cnt1 = max(cnt1, cnt) else: cnt1 = max(cnt1, cnt) cnt = 2 print(cnt1)

0.654075

n = int(input()) d = {} for i in range(n): s = input() if s in d: d[s] += 1 else: d[s] = 1 print(d[max(d,key=d.get)])

0.653934

class Solution: def findLHS(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums) ret = 0 for i in count: if i+1 in count: ret = max(ret, count[i]+count[i+1]) return ret...

0.651882

def ii(): return int(input()) def mi(): return map(int, input().split()) def li(): return list(mi()) n = ii() a = li() ans = 0 cnt = [0] * (10 ** 5 + 10) cur = set() for ai in a: cnt[ai] = len(cur) cur.add(ai) ans = sum(cnt) print(ans)

0.651363

n = int(input()) d = list(map(int, input().split())) s = {i:0 for i in set(d)} for i in d: s[i] += 1 print(max(s.values()))

0.650134

from collections import defaultdict n = int(input()) A = [int(x) for x in input().split()] D = defaultdict(int) for a in A: D[a] += 1 S = set(D.keys()) ans = len(S) - 1 while S: for k in D: D[k] -= 1 if D[k] <= 0 and k in S: S.remove(k) ans += len(S) - 1 print(ans + 1)

0.644397

n = int(input()) *A, = list(map(int, input().split())) seq = [] cur = 1; cnt = 0 for a in A: if cur == a: cnt += 1 else: seq.append(cnt) cur = a; cnt = 1 if cnt > 0: seq.append(cnt) ans = max(seq) l = len(seq) dp = [[0]*4 for i in range(l+1)] for i in range(l): one = i % 2 #12 ...

0.643214

input() memory = list(map(int, input().split())) proc_data = {p: (-1, -1) for p in memory} for i, c in enumerate(memory): d1, d2 = proc_data[c] if d1 == -1: d1 = i d2 = i proc_data[c] = (d1, d2) try: del proc_data[0] except KeyError: print("0") return data = list(proc_data.values()) data.sor...

0.643153

import sys n = int(sys.stdin.readline().strip()) a = list(map(int, sys.stdin.readline().strip().split())) M = [[0 for i in range (0, 21)] for j in range (0, 21)] F = [0 for i in range (0, 21)] for i in range (0, n): x = int(a[i]) for j in range (0, 21): if j != x: M[j][x] = M[j][x] + F[j] ...

0.642881

class Solution: def isvalid(self,C): if len(C)>2: return False if len(C)==1: a = min(C) if a==1 or C[a]==1: # EXPLANATION: # a==1 : All lengths are unitary like A=[1,2,3,4,...], so poping anything is fine # C[a...

0.642676

d, n, t = 0, int(input()), list(map(int, input().split())) p = {a: 0 for a in set(t)} for i in range(n): a = t[i] if not a in p: continue p.pop(a) s = t.count(a) - 1 if 2 * s < d: continue if s > d: d = s k = i + 1 for j in range(k, n): if t[j] == a: for b in set(t[k:...

0.640924

from sys import stdin from heapq import heappop, heappush, heapify def main(): n = int(stdin.readline()) a = stdin.readline().split() q = [] p = 0 c = 0 l = [0] * (n + 1) r = [0] * (n + 1) k = [0] * (n + 1) pa = [0] * (n + 1) for i, x in enumerate(a): if x == a[p]: ...

0.640448

from collections import * import sys print(Counter(sys.stdin.readlines()).most_common(1)[0][1])

0.636329

import sys import math input=sys.stdin.readline #sys.setrecursionlimit(1000000) mod=int(1000000007) i=lambda :map(int,input().split()) n=int(input()) a=[int(x) for x in input().split()] t=[[0]*21 for i in range(300005)] for i in range(n): t[i][0]=a[i] def build(n): for j in range(1,20): for i in rang...

0.635633

def mi(): return map(int, input().split()) from collections import Counter n = list(mi())[0] a = Counter(list(mi())) ma= -1 for i in a: if a[i]>ma: ma = a[i] print (ma)

0.635157

class Solution: def maxRepOpt1(self, text: str) -> int: letters = {} for i, char in enumerate(text): if char in letters: letters[char].append(i) else: letters[char] = [i] if len(letters) == 1: return len(text) ...

0.633473

from collections import defaultdict def repeat_sum(l): count = defaultdict(int) for l1 in l: for val in set(l1): count[val] += 1 return sum(k for k,v in list(count.items()) if v > 1)

0.628848

n=eval(input()) a=list(map(int,input().split())) c=m=0 maxi=max(a) for i in range(n): if a[i]==maxi: c+=1 m=max(c,m) else: c=0 print(m)

0.628014

counts = {} rcount = {} input() m = 0 for i, x in enumerate(map(int, input().split())): if x in counts: rcount[counts[x]].remove(x) if not rcount[counts[x]]: del rcount[counts[x]] counts[x] += 1 if counts[x] not in rcount: rcount[counts[x]] = set() rcount[counts[x]].add(x) else: counts[x] = 1 if 1 ...

0.623295

n = int(input()) ar = list(map(int,input().split(' '))) ar.sort() s=[] for i in ar: s.sort(reverse=True) for j in range(len(s)): if i>=s[j]: s[j]+=1 break else: s.append(1) print(len(s))

0.618523

from collections import Counter n = int(input()) a = list(map(int, input().split())) c = Counter(a) res = 0 cur = 0 for i in sorted(c.keys()): d = min(c[i], cur) cur -= d res += d cur += c[i] print(res)

0.617102

n=int(input()) a=[int(i) for i in input().split()] a.sort() count=0 def get_num(a): count=1 taishou = a.pop() while a!=[]: second=a.pop() if taishou==second: count+=1 else: a.append(second) break if count==1: return taishou,0 e...

0.616585

import sys def GRIG(L): LENT = len(L) MINT = 1 GOT = 0 DY = [ [{x: 0 for x in range(0, 10)}, 0, 0] ] for i in L: DY.append([{x: 0 for x in range(0, 10)}, 0, 0]) GOT += 1 for j in range(0, GOT): if DY[j][0][i] == 1: DY[j][0][i] = 0 ...

0.6164

from operator import itemgetter import sys input = sys.stdin.readline MAX_A = 200 t = int(input()) for _ in range(t): n = int(input()) a = list(map(int, input().split())) ruiseki = [[0] * MAX_A for i in range(n + 1)] for i in range(n): for j in range(MAX_A): ruiseki[i + 1][j] ...

0.61472

from collections import Counter def sum_no_duplicates(nums): return sum(k for k, v in list(Counter(nums).items()) if v == 1)

0.613308

#!usr/bin/env python3 from collections import defaultdict, deque from heapq import heappush, heappop from itertools import permutations, accumulate import sys import math import bisect def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline()) def LS():return [list(x) for ...

0.612156

mod = 1000000007 eps = 10**-9 inf = 10**9 def main(): import sys input = sys.stdin.readline class Bit: def __init__(self, n): self.size = n self.tree = [0] * (n + 1) def sum(self, i): s = 0 while i > 0: s += self.tree[i] ...

0.6115

from collections import Counter n = int(input()) a = [int(_) for _ in input().split()] f = Counter(a) N = 10 ** 5 + 10 p = [0 for i in range(N)] ans = Counter() for i in range(2, N): if p[i]: continue for j in range(i, N, i): p[j] = 1 ans[i] += f[j] print(max(1, ans.most_common(1)[0][1])...

0.6104

n = int(input()) C = list(map(int, input().split())) dp = [[0]*n for _ in range(n)] for i in range(n) : dp[i][i] = 1 for i in range(n-2, -1, -1) : for j in range(i+1, n) : dp[i][j] = 1 + dp[i+1][j] if C[i] == C[i+1] : dp[i][j] = min( dp[i][j], 1 + (dp[i+2][j] if i+2 < n else 0) ) for k...

0.609034

n, _q = map(int, input().split()) mni = [-1] * 200001 mxi = [-1] * 200001 cnt = [0] * 200001 nd = 0 a = list(map(int, input().split())) for i, v in enumerate(a): if mni[v] == -1: mni[v] = i; nd += 1 mxi[v] = i cnt[v] += 1 r = 0 z = 0 currmax = 0 for i, v in enumerate(a): if i == mni[v]: z += 1 if i ...

0.6082

import sys inp = sys.stdin #inp = open('input.txt', 'r') n = int(inp.readline()) a = list(map(int, inp.readline().split())) best = [0, 0, 0] for i in range(n): nx_best = [0, 0, 0] if a[i] in (1, 3): nx_best[1] = max(best[0], best[2]) + 1 if a[i] in (2, 3): nx_best[2] = max(best[0], best[...

0.606931

from sys import stdin tt = 1 for loop in range(tt): dic = {} dic[0] = 1 n = int(stdin.readline()) a = list(map(int,stdin.readline().split())) now = 0 ans = 0 for i in a: now += i if now in dic: ans += 1 dic = {} dic[0] = 1 ...

0.606391

# -*- coding: utf-8 -*- """ Created on Sun Apr 2 22:42:34 2017 @author: Sean38 """ n = int(input().rstrip()) s = input() a = [int(ch) for ch in s.split()] a = a[0:n] a.sort() def check_num(p, i): # i = ap + b(p+1) # min(a+b) <=> max(b) # b(p+1) <= i # b == i (mod p) max_b = (i // (p + 1)) b...

0.606328

n = int(input()) d = list(map(int, input().split())) s = {i:0 for i in [1, 2]} for i in d: s[i] += 1 if s[2] >= s[1]: print(s[1]) else: print(s[2] + (s[1] - s[2]) // 3)

0.603992

from collections import defaultdict def fix_progression(arr): res = 0 for i in range(len(arr)): D = defaultdict(int) for j in range(i): q, r = divmod(arr[i]-arr[j], i-j) if not r: D[q] += 1 res = max(res, D[q]) return len(arr)-res-1

0.603981

from heapq import * from collections import Counter class Solution: def minSetSize(self, arr: List[int]) -> int: counter = Counter(arr) size = len(arr) # unique elements (remove half of them) if len(counter) == size: return (size - 1) // 2 + 1 ...

0.603979

#!/usr/bin/env python3 n = int(input()) a = [int(x) for x in input().split()] sorted_a = sorted(a) dict_a = {} for x in a: if not x in dict_a: dict_a[x] = 1 else: dict_a[x] += 1 sorted_uniq_a = sorted(dict_a.keys()) max_fib_prefix = [a[0], a[1]] for i in range(0, len(sorted_uniq_a)): for...

0.60363

n = int(input()) a = [int(x) for x in input().split()] a.sort() num = 0 res = 0 for i in range(n): if int(a[i]) >= num: res += 1 num += int(a[i]) #print(res, a[i]) print(res)

0.603483

input() a = list(map(int, input().split())) b = [] i = j = 0 while i < len(a): while j < len(a) and a[j] == a[i]: j += 1 if (j - i) % 2 == 1: b += [a[i]] i = j - (j - i) // 2 for k in range(i, j): a[k] += 1 print(b[-1] - len(b) + 1)

0.603146

# # abc096 b # import sys from io import StringIO import unittest from collections import Counter class TestClass(unittest.TestCase): def assertIO(self, input, output): stdout, stdin = sys.stdout, sys.stdin sys.stdout, sys.stdin = StringIO(), StringIO(input) resolve() sys.stdout.se...

0.60232

n = input() v = list(map(int, input().split())) best = 1 current = 1 for i in range(1, len(v)): if v[i-1] <= v[i]: current += 1 else: current = 1 best = max(best, current) print(best)

0.602224

def prog(): n = int(input()) inp = list(map(int,input().split())) ans = 0 for i in range(len(inp)): x,y = 0 ,0 for j in range(i,len(inp)): x+=inp[j] y+=100 if(x>y): ans = max(ans,(j-i)+1) print(ans) prog()

0.60101

from collections import defaultdict as dd for _ in range(int(input())): n=int(input()) a=list(map(int,input().split())) d=dd(int) for i in a: d[i]+=1 ma=0 r=len(d.keys()) for i in d.keys(): ma=max(ma,min(d[i]-1,r),min(d[i],r-1)) print(ma)

0.600989

def lis(a): b = [] for c in a: # if len(b) == 0 or c > b[-1] if len(b) == 0 or c > b[-1]: b.append(c) else: l = 0 r = len(b) while l < r-1: m = l+r>>1 # if b[m] <= c: l = m if b[m] < c: l = m ...

0.600754

n = int(input()) arr = input() final = len(arr) arr = arr.split() lens = [0 for x in range(n)] visit = [0 for x in range(n)] cnt = 0 ans = 0 for i in range(n): if visit[i]: continue lens[cnt] = len(arr[i]) for j in range(i+1,n): if arr[j]==arr[i]: arr[j] = cnt visit[j] = 1 arr[i] = cnt cnt...

0.600401

def solve(l): m = l.index(max(l)) if m == 0 or m == len(l) - 1: return 1 return 1 + min(solve(l[0:m]), solve(l[m+1:])) tc = int(input()) for test in range(tc): n = int(input()) l = list(map(int, input().split())) print(solve(l))

0.600338

n=int(input()) vec=list(map(int,input().split())) al=[] otrez=[] for x in vec: if len(al)==0: al.append(x) elif(x<=al[-1]): otrez.append(al) al=[x] else: al.append(x) otrez.append(al) maxx=0 if(len(otrez)!=1): for i in range(0,len(otrez)-1): if(len(otrez[i])==1)or...

0.599031

from collections import defaultdict maxn = 2000000000 mk = [] bs = 1 while bs <= maxn: mk.append(bs) bs *= 2 n = int(input()) ls = [int(i) for i in input().split()] dic = defaultdict(int) for i in ls: dic[i] += 1 cnt = 0 for i in ls: dic[i] -= 1 flag = False for j in mk: if dic[j - ...

0.598346

import collections N=int(input()) L=list(map(int,input().split())) L=sorted(L) C=collections.Counter(L) D=list(C.keys()) E=list(C.values()) K=len(C) ans=0 for i in range(K): if D[i]==E[i]: ans+=0 if D[i]>E[i]: ans+=E[i] if D[i]<E[i]: ans+=(E[i]-D[i]) print(ans)

0.597655

def bs(arr, val, key=lambda x:x): l, r = 0, len(arr)-1 if key(arr[l])>val: return l if key(arr[r])<=val: return r+1 while l+1<r: m = (l+r)>>1 v = key(arr[m]) if v<=val: l = m else: r = m return r def bs_left(arr,...

0.596943

def check(l,n): m = 0 for i in range(n-1): x = l[i] c = 0 j = i while (j+2<n and l[j+2]==x) or (j+1<n and l[j+1] == x): if l[j+1] == x: j = j+1 else: j+=2 c+=1 if m<c: m = c return m t = ...

0.596799

from collections import defaultdict def calcBinomials(N): nonlocal binom N += 1 binom = [[0]*N for _ in range(N)] for n in range(N): binom[n][0] = binom[n][n] = 1 for k in range(1, n): binom[n][k] = binom[n-1][k] + binom[n-1][k-1] n = int(input()) a = list(map(int, input()....

0.596781

def main(): n = int(input()) a = [input() for i in range(n)] result = 0 for i in range(26): for j in range(i + 1, 26): t = 0 ci = chr(i + ord('a')) cj = chr(j + ord('a')) for s in a: if s.count(ci) + s.count(cj) == len(s): ...

0.596703

import sys input = sys.stdin.readline for f in range(int(input())): n=int(input()) a=list(map(int,input().split())) patties=[0]*n mx=0 for p in a: patties[p-1]+=1 mx=max(patties[p-1],mx) mxs=0 for p in patties: if p==mx: mxs+=1 rest=n-mx rest-=mxs ...

0.596319

n = int(input()) ans = 0 stk = [] for v in map(int, input().split()): last = 0 while len(stk) and stk[-1][0] < v and stk[-1][1]: last = max(last, stk[-1][1]) del stk[-1] if not len(stk) or stk[-1][0] < v: stk.append((v, 0)) else: stk.append((v, last + 1)); ans = max(ans,...

0.592715

n = int(input()) s = list(map(int,input().split(' '))) a = [] for i in range(max(s)): a.append([]) for i in range(len(s)): a[s[i]-1].append(i) a = list([x for x in a if x != []]) if len(a) > 1: for i in range(1,len(a)): if len(a[i]) > 1: s = a[i-1][-1] if s > a[i][0] and ...

0.591075

import sys input = sys.stdin.readline from collections import deque def read(): N = int(input().strip()) P = list(map(int, input().strip().split())) return N, P def solve(N, P): ans = 0 p = deque(P) q = deque() q.append(p.popleft()) for i in range(1, N): if i == q[-1]: ...

0.590661

class Solution: def candy(self, ratings): """ :type ratings: List[int] :rtype: int """ if not ratings: return 0 total, pre, decrease = 1, 1, 0 for i in range(1, len(ratings)): if ratings[i] >= ratings[i-1]: ...

0.590428

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools sys.setrecursionlimit(10**7) inf = 10**20 eps = 1.0 / 10**10 mod = 10**9+7 dd = [(-1,0),(0,1),(1,0),(0,-1)] ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)] def LI(): return list(map(int, sys.stdin.readline().spli...

0.590082

n = int(input()) a = list(map(int,input().split())) m = max(a) current = 0 longest = 0 for x in a: if x == m: current +=1 else: longest = max(current,longest) current = 0 longest = max(current,longest) print (longest)

0.588354

from bisect import bisect_right def main(): n = int(input()) a = [int(input()) for _ in range(n)] a.reverse() lis = [a[0]] for i in range(1, n): if a[i] >= lis[-1]: lis.append(a[i]) else: lis[bisect_right(lis, a[i])] = a[i] print((len(lis))) def __star...

0.588053

n = int(input()) a = list(map(int, input().split())) b = [] for i in range(len(a)): b.append(a[i]) for i in range(len(a)): b.append(a[i]) q = 0 r = set() for i in b: if i: q += 1 else: r.add(q) q = 0 print(max(r))

0.587864

n = int(input()) a = list(map(int, input().split())) MAX = 10 ** 6 + 5 cnt = [0] * MAX ok = [True] * MAX for x in a: cnt[x] += 1 ans = 0 for i in range(1, MAX): if cnt[i] > 0: for j in range(i * 2, MAX, i): ok[j] = False if ok[i] and cnt[i] == 1: ans += 1 print(ans...

0.587579

n = int(input()) pos_blast = [list(map(int, input().split())) for _ in range(n)] MAX_N = max(pos_blast, key=lambda x: x[0])[0] + 2 power = [0 for _ in range(MAX_N)] tower = [False for _ in range(MAX_N)] can_destroy = [0 for _ in range(MAX_N)] for pos, blast in pos_blast: pos += 1 tower[pos] = True power[pos...

0.587122

def mForMaxSeq(arr, n): eim = dict() for i in range(n): if arr[i] in eim: eim[arr[i]].append(i) else: eim[arr[i]] = [i] keys = sorted(eim.keys()) # print(eim, keys) connected = False count = 0 pI = -1 nKeys = len(keys) ...

0.586239

x=int(input()) l=list(map(int, input().split(' '))) l.sort() a=1 for i in l: if i>=a: a+=1 print(a)

0.586147

n=int(input()) arr=[int(x) for x in input().split()] l=[1]*n if sorted(arr)==arr: print('0') else: for i in range(0,len(arr)): for j in range(i): if arr[i]>=arr[j] and l[i]<l[j]+1: l[i]=l[j]+1 print(n-max(l))

0.585302

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.585162

n = int(input()) mas = list(map(int, input().split())) dist = set([0]) res = 1 for i, e in enumerate(mas): time = i + 1 if e in dist: dist.remove(e) else: res += 1 dist.add(time) print(res)

0.584341

# cook your dish here n=int(input()) counts=dict() z=0 upper=None for i in range(0,n): a,h= [int(num) for num in input().split()] counts[a]=h for key,count in counts.items(): c=0 x=key-count y=key+count c1=0 c2=0 for j in counts.keys(): if j==key: continue else: if x<=j<=key: c1=0 break els...

0.583854

a=eval(input()) while(a): x=eval(input()) b=list(map(int,input().split())) z=[0]*100 k=1 j=0 c=0 for i in b: if i==0: z.insert(i,k) else: if z[z.index(i)+1]==0: z.insert(j,k) else: m=z.index(i) n=m+1 p=(len(z)-z.count(0))-n c=c+min(n,p) z.insert(m+1,...

0.583068

import sys num=int(sys.stdin.readline()) s=sys.stdin.readline().split() sky=list(map(int,s)) sky.reverse() cuts=0 change=0 t=False i=1 while i<len(sky): if sky[i]<=sky[i-1]: for j in range(i-1,-1,-1): if sky[j]<=sky[i]-(i-j): break else: change+=sky[j]-(sky[i]-(i-j)) if change>=sky[i]: ...

0.582863

import sys def solve(): n = int(sys.stdin.readline()) a = [0] + [int(i) for i in sys.stdin.readline().split()] dp = [[0]*(n + 1) for i in range(n + 1)] ans = 0 maxnum = [0] * (10**5 + 2) maxmod = [0] * 7 for y in range(n + 1): maxmod = [0] * 7 for ai in a: ma...

0.581954

class Solution: def findFrequentTreeSum(self, root): self.sums = [] if not root: return [] self.traverse(root) res = collections.Counter(self.sums) frequent = max(res.values()) return [x for x in res if res[x] == frequent] def traverse(s...

0.581699

for _ in range(int(input())): n = int(input()) wt = list(map(int, input().split())) count = {} for x in wt: if x not in count: count[x] = 0 count[x] += 1 k = 0 for s in range(101): temp = 0 temp2 = 0 for x in count: if (s - x) in c...

0.580963

def main(): input() l = list(map(int, input().split())) n = max(l) aa = [0] * (n + 1) for x in l: aa[x] += 1 f, x = [0] * n, 0 for a in reversed(aa): x += a f.append(x) f.reverse() res = [] for i, a in enumerate(aa): if a: tot, a = 0, f...

0.580601

class Solution: def deleteAndEarn(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums);#count is a dict [3,4,2]--> {2:1,3:1,4:1} prev = None; avoid = using = 0; for k in sorted(count): temp = ma...

0.580245

class Solution: def numTimesAllBlue(self, light: List[int]) -> int: right = 0 ans = 0 for i in range(len(light)): if (light[i] > right): right = light[i] if (i + 1 == right): ans += 1 return ans

0.580232

class Solution: def maxLength(self, arr: List[str]) -> int: def digit_representation(s): ans = 0 for c in s: ans |= 1<<(ord(c)-ord('a')) return ans A = sorted([(len(s), digit_representation(s)) for s in set(arr) if len(set(s))==len(s)], re...

0.579393

import sys input=sys.stdin.readline for _ in range(int(input())): N=int(input()) e=list(map(int,input().split())) e.sort() ans=0 val=0 g=0 for i in range(0,N): g+=1 val=e[i] if g>=val: ans+=1 g=0 val=0 print(ans)

0.577866

n=int(input()) L=list(map(int,input().split())) if(n==1 or n==2): print(n) else: length=2 i=2 maxx=2 while(i<n): if(L[i]==L[i-1]+L[i-2]): length+=1 else: if(length>maxx): maxx=length length=2 i+=1 if(length>maxx): ...

0.577856

# cook your dish here import math; from math import gcd,sqrt,floor,factorial,ceil from bisect import bisect_left,bisect_right import bisect; import sys; from sys import stdin,stdout import os sys.setrecursionlimit(pow(10,7)) import collections from collections import defaultdict,Counter from statistics import median # ...

0.577249

class Solution: def minCostToMoveChips(self, position: List[int]) -> int: d = {} a = 0 b = 0 for i in position: if i not in d: d[i]=1 else: d[i]+=1 for i in d: if i%2==0: a +=d[i] ...

0.576715

import collections n = int(input()) A = list(map(int, input().split())) S = [0]*n S[0] = A[0] for i in range(1, n) : S[i] = S[i-1] + A[i] C = collections.Counter(S) max_val = 0 for key in C : max_val = max(max_val, C[key]) ans = n - max_val print(ans)

0.575879

def dp(): dparr = [0] * len(sections) for i in range(len(sections) - 1, -1, -1): _, curend, curcomfort = sections[i] nextsection = i + 1 try: while sections[nextsection][0] <= curend: nextsection += 1 except IndexError: # Loop til end inc = curcomfort else: inc = curcomfort + dparr[nextsecti...

0.575615

def main(): from sys import stdin, stdout for _ in range(int(stdin.readline())): n = int(stdin.readline()) inp1 = [-1] * (n + 1) inp2 = [-1] * (n + 1) for i, ai in enumerate(map(int, stdin.readline().split())): if inp1[ai] < 0: inp1[ai] = i ...

0.575338

INF = 10 ** 10 def merge(l, r): res = l + r i = j = k = 0 while i < len(l) and j < len(r): if l[i] < r[j]: res[k] = l[i] k += 1 i += 1 else: res[k] = r[j] k += 1 j += 1 while i < len(l): res[k] = l[i] ...

0.574993

class Solution: def longestSubarray(self, nums: List[int]) -> int: if not 0 in nums: return len(nums) - 1 ans = 0 tot = 0 prev = 0 for n in nums: if n == 1: tot += 1 else: ans = max(tot+prev, ans) ...

0.57492

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline mii=lambda:list(map(int,input().split())) s=input().strip() d=[0]*1000 e=[0]*1000 hist=[0]*26 for i in s: j=ord(i)-ord('a') for k in range(26): e[k*26+j]+=hist[k] hist[j]+=1 d[j]+=1 print(max(d+e))

0.574815

# cook your dish here for _ in range(int(input())): n=int(input());li=list(map(int,input().split()));dli=dict();modi=0 for i in li: if i not in dli:dli[i]=1 else:dli[i]+=1 op=sorted(list(dli)) if(len(dli)!=0): while 1: tmp=[] for i in op: if dli[i]==0:continue tm...

0.574788

import sys n = int(input()) a = [int(t) for t in input().split(' ')] mx = [[] for _ in range(n)] lines = sys.stdin.readlines() for i in range(n-1): v1, v2 = (int(t) - 1 for t in lines[i].split(' ')) mx[v1].append(v2) mx[v2].append(v1) count = [[0, 0] for _ in range(n)] total = [a.count(1), a.count(2)] ...

0.574368

from collections import defaultdict def main(): d = defaultdict(int) d2 = defaultdict(int) N = int(input()) A = list(map(int, input().split())) for i in range(N): d[i + 1 + A[i]] += 1 d2[max(0, (i + 1) - A[i])] += 1 ans = 0 for k,v in d.items(): if k == 0:continu...

0.573945

f = lambda: map(int, input().split()) n, m = f() t = list(f()) d = {i: j for j, i in enumerate(sorted(set(t)))} t = [d[i] for i in t] k = len(d) a = [0] * k if m < 2 * k: for j in t * m: a[j] += 1 q = a[j] j += 1 while j < k and a[j] < q: a[j] += 1 j += 1 ...

0.573834

n = sum(list(map(int, input().split()))) A = [0 for i in range(n)] DP = [[0 for i in range(3)] for i in range(n)] for i in range(3): for j in map(int, input().split()): A[j - 1] = i DP[0] = [A[0] != i for i in range(3)] for i in range(1, n): DP[i][0] = DP[i - 1][0] + (A[i] != 0) DP[i][1] = min(DP[i - 1][0], D...

0.57255

test=int(input()) for _ in range(test): n=int(input()) ls=list(map(int,input().split())) ls.sort() s=0 for i in range(n): if s>=ls[i]: s=s+1 else: break print(s)

0.572163

Initially on a notepad only one character 'A' is present. You can perform two operations on this notepad for each step: Copy All: You can copy all the characters present on the notepad (partial copy is not allowed). Paste: You can paste the characters which are copied last time. Given a number n. You have to get ...

class Solution: def minSteps(self, n): """ :type n: int :rtype: int """ primeFactors=[] for i in range(2,int(n**.5)+1): while n%i==0: primeFactors.append(i) n=n//i if n>1: primeFactors.append(...

0.496384

def persistence(n): n = str(n) count = 0 while len(n) > 1: p = 1 for i in n: p *= int(i) n = str(p) count += 1 return count # your code

0.615976

from math import ceil, log def how_many_measurements(n): return ceil(log(n, 3))

0.587475

class Solution: def integerReplacement(self, n): """ :type n: int :rtype: int """ ''' if n == 1: return 0 if not (n & 1): return self.integerReplacement(n//2) + 1 return min(self.integerReplacement(n+1), self.integerR...

0.58062

def collatz(n): step = 1 while n!= 1: n = [n//2, (n*3)+1][n%2] step += 1 return step

0.56588

from math import * def count(n): return ceil(lgamma(n+1)/log(10))

0.561698

import math def count(n): if n is 0: return 0 x = int(math.log(n, 2)) return x * 2 ** (x - 1) + n - 2 ** x + 1 + count(n - 2 ** x) def countOnes(left, right): return count(right) - count(left - 1)

0.559523

def solve(n): a,b = '01' for _ in range(n): a,b = a+b,a return a

0.557196

from sys import stdin as cin from sys import stdout as cout def main(): n = int(cin.readline()) o = 0 for x in range(9, 0, -1): if 10 ** x // 2 <= n: ##print(x) for i in range(9): q = 10 ** x * (i + 1) // 2 - 1 if q <= n: o...

0.556573

from math import log2 def t(n): if n == 0: return 0 k = int(log2(n)) i = n - 2**k if i == 0: return (2**(2*k+1)+1) // 3 else: return t(2**k) + 2*t(i) + t(i+1) - 1 toothpick = t

0.552094

from math import log2 def operation(a,b, n = 0): while log2(a) % 1: n += 1 a //= 2 return n + abs(log2(a/b))

0.55128

class Solution: def countAndSay(self, n): s = '1' for _ in range(n-1): let, temp, count = s[0], "", 0 for l in s: if let == l: count += 1 else: temp += str(count) + let ...

0.550476

def faro_cycles(n): x, cnt = 2, 1 while x != 1 and n > 3: cnt += 1 x = x*2 % (n-1) return cnt

0.546895

def hotpo(n): cnt = 0 while n != 1: n = 3 * n + 1 if n % 2 else n / 2 cnt += 1 return cnt

0.543947

def two_count(n): res = 0 while not n & 1: res += 1 n >>= 1 return res

0.541443

start = input() counter = 0 sInt = int(start) while sInt!=0: sInt-=max([int(c) for c in start]) start=str(sInt) counter+=1 print(counter)

0.540627

n = int(input()) x = 0 cur = 1 lst = 1 while cur + lst <= n: cur, lst = cur + lst, cur x += 1 print(x)

0.539567

from collections import deque def dbl_linear(n): h = 1; cnt = 0; q2, q3 = deque([]), deque([]) while True: if (cnt >= n): return h q2.append(2 * h + 1) q3.append(3 * h + 1) h = min(q2[0], q3[0]) if h == q2[0]: h = q2.popleft() if h == q3[0]: h = q3.po...

0.539361

darling = {} x = int(input()) ans = 0 while (x not in darling): darling[x] = 1 ans += 1 x += 1 while (x % 10 == 0): x /= 10 print(ans)

0.534296

def shortest_steps_to_num(num): steps = 0 while num != 1: if num % 2: num -= 1 else: num //= 2 steps += 1 return steps

0.53325

def going(n): s = 1.0 for i in range(2, n + 1): s = s/i + 1 return int(s * 1e6) / 1e6

0.532364

class Solution: def bulbSwitch(self, n): """ :type n: int :rtype: int """ if n == 0: return 0 else: return int(n**0.5)

0.532055

from math import ceil, sqrt def layers(n): return ceil(sqrt(n)) // 2 + 1

0.532003

from itertools import count # Couldn't find the pattern of why it's 1 or 8, I'm sad :( def repeat_sequence_len(n): memo = {} for i in count(): if n in memo: return i - memo[n] memo[n] = i n = sum(d*d for d in map(int, str(n)))

0.527973

# cook your dish here a = int(input()) print(a)

0.527472

def digits(n): return len(str(n))

0.527014

class Solution: def numSquares(self, n): """ :type n: int :rtype: int """ while(n%4 == 0): n = n/4 if n%8 == 7: return 4; a = int(0) while(a*a <= n): b = int(math.sqrt(n-a*a)) if (a*a+b*b == n): ...

0.524755

def look_and_say_and_sum(N): l=[1] for n in range(N-1): result = [1,l[0]] for i in range(1,len(l)): if l[i]==result[-1]: result[-2] += 1 else: result += [1,l[i]] l=result return sum(l)

0.523046

n=int(input()) if n==2: print(2) else: print(1)

0.518796

from math import log10 def rocks(n): return (n + 1) * int(log10(n) + 1) - (10 ** int(log10(n) + 1) - 1) // 9

0.518781

masks = [0] * 10 for i in range(10 ** 4): for c in str(i): masks[int(c)] |= 1 << i def find_num(n): seq, x = 1, 0 for j in range(n): M = seq for m in masks: if x & m: M |= m x = ~M & (M+1) seq |= x return x.bit_length() - 1

0.516719

from math import ceil def branch(n): if n == 1: return 0 l = int(ceil(n ** 0.5)) // 2 n -= (2 * l - 1) ** 2 + 1 return n // (2*l or 1)

0.515901

s=input() dp=[[0,0,0] for i in range(len(s))] for i in range(len(s)): if s[i]=='a': dp[i][0]=dp[i-1][0]+1 dp[i][1]=dp[i-1][1] dp[i][2]=max(dp[i-1][1]+1,dp[i-1][2]+1) else: dp[i][0]=dp[i-1][0] dp[i][1]=max(dp[i-1][0]+1,dp[i-1][1]+1) dp[i][2]=dp[i-1][2] e=len(s)-1 p...

0.513484

class Solution: def findIntegers(self, num): """ :type num: int :rtype: int """ dp=[1,2] for i in range(2,32): dp.append(dp[i-1]+dp[i-2]) bnum=bin(num)[2:] size=len(bnum) ans=dp[size] for i in range(1,s...

0.511997

class Solution: dp = {0: 0} def racecar(self, target: int) -> int: if target in self.dp: return self.dp[target] n = target.bit_length() if 2**n - 1 == target: self.dp[target] = n else: self.dp[target] = self.racecar(2**n - 1 - target) + n + 1 ...

0.511981

def compute_depth(n): i = 0 digits = set() while len(digits) < 10: i += 1 digits.update(str(n * i)) return i

0.511831

def f(n): a, b = 0, 1 for _ in range(n): a, b = b, a + b + 1 return a

0.511131

class Solution: def numberOfSteps (self, num: int) -> int: steps = 0 while num > 0: if num % 2 == 0: num /= 2 else: num -= 1 steps += 1 return steps

0.510584

# https://oeis.org/A000108 from math import factorial as fac def solve(n): return fac(2*n)//fac(n)//fac(n+1)

0.510117

from operator import mul from functools import reduce def genSequence(n): yield n while True: n += reduce(mul, [int(d) for d in str(n) if d != '0']) if n > 9 else n yield n def extract(seq, v): return sorted(seq).index(v) def convergence(n): gen1, genN = genSequence(1), genSequence(n)...

0.508194

for _ in range(int(input())): S = input() n = len(S) a = n - S.count('a') print(2 ** n - 2 ** a)

0.50717

class Solution: def countNumbersWithUniqueDigits(self, n): """ :type n: int :rtype: int """ ls = [1,10,91] mul = 9 res = 0 for i in range(8): mul = 9 m = 9 for j in range(i+2): ...

0.506563

from fractions import gcd from functools import reduce def candies_to_buy(n): return reduce(lambda a,b:a*b//gcd(a,b), range(1,n+1))

0.506262

# cook your dish here n,a=map(int,input().split()) for i in range(a): if(n%10==0): n=n//10 else: n=n-1 print(n)

0.505609

def single_digit(n): while n > 9: n = bin(n).count("1") return n

0.505602

import math class Solution: def smallestGoodBase(self, n): n = int(n) maxLength = int(math.log(n,2)) for m in range(maxLength, 1, -1): k = int(n**m**-1) if (k**(m+1) - 1)//(k - 1) == n: return str(k) return str(n-1) """ ...

0.505596

s = int(input(), 2) t, ans = 1, 0 while t < s: ans += 1 t *= 4 print(ans)

0.505334

for _ in range(int(input())): n = int(input()) data = input() count = 0 while "AP" in data: data = data.replace("AP", "AA") count += 1 print(count)

0.504776

def a(n): """ """ if n % 2 != 0: n = n - 1 if n < 4: return '' side = " " * (n - 1) li = [side + "A" + side] for i in range(1, n): side = side[1:] middle = "A " * (i - 1) if i == (n / 2) else " " * (i - 1) li.append(side + "A " + middle + "A" + side) ...

0.502625

class Solution: def countDigitOne(self, n): """ :type n: int :rtype: int """ ones, m = 0, 1 while m <= n: ones += (n // m + 8) // 10 * m + (n // m % 10 == 1) * (n % m + 1) m *= 10 return ones

0.502604

class Solution: def getMaxRepetitions(self, s1, n1, s2, n2): """ :type s1: str :type n1: int :type s2: str :type n2: int :rtype: int """ if s2=='aac' and n2==100: return 29999 i,j=0,0 l1=len(s1) l2=len(s...

0.502548

def count_pal(n): # No recursion; direct calculation: return [9 * 10**((n-1) // 2), 10**(n // 2) * (13 - 9 * (-1)**n) // 2 - 2]

0.502438

N = int(input()) ANS = 1 for i in range(1,N-1): ANS += (N-1)//i print(ANS)

0.501225

from math import log def alex_mistakes(n, time): return int(log((time - n * 6) / 5 +1, 2))

0.497653

n = int(input()) a = b = 1 while a * b < n: if a < b: a += 1 else: b += 1 print(a+b)

0.496205

class Solution: def arrangeCoins(self, n): """ :type n: int :rtype: int """ #brute force: #m = i (i+1) / 2 #i = 0 #while True: # row = i * (i+1) / 2 # if n - row < 0: # return i - 1 # i += 1...

0.49476

s = input() c = s.count('a') print(min(2*c-1,len(s)))

0.494702

class Solution: def countBits(self, num): """ :type num: int :rtype: List[int] """ ans = [0] while len(ans) < num + 1: ans += [1 + x for x in ans] # len(ans) > num return ans[:num+1]

0.494514

def palindrome_chain_length(n): steps = 0 while str(n) != str(n)[::-1]: n = n + int(str(n)[::-1]) steps += 1 return steps

0.493331

from math import factorial as fact def sum_arrangements(n): s = str(n) perms = fact(len(s)-1) coefAll = int('1'*len(s)) return coefAll*perms*sum(map(int,s))

0.49296

def get_number_of_squares(n): k = 1 while k*(k+1)*(2*k+1)/6 < n: k+=1 return k-1

0.491991

def solve(n): def length(n): s = 0 for i in range(20): o = 10 ** i - 1 if o > n: break s += (n - o) * (n - o + 1) // 2 return s def binary_search(k): n = 0 for p in range(63, -1, -1): if length(n + 2 ** p) < k: n += 2 ** p ...

0.491869

from fractions import Decimal, gcd from operator import mul from functools import reduce lcm = lambda a, b=1: a * b // gcd(a, b) def parameter(n): digits = Decimal(n).as_tuple().digits return lcm(sum(digits), reduce(mul, digits))

0.490708

class Solution: def leastOpsExpressTarget(self, x: int, target: int) -> int: def dp(i, j): if i==0: return 2*j # if j==0: return 0 if j==1: return 2 if (i, j) in memo: return memo[(i, j)] base = x**i q, r = divmod(j, base) i...

0.490158

# coding: utf-8 # Your code here! def solve(s, c): if(len(s)==1): if s[0]==c: return 0 else: return 1 ans1 = sum([i!=c for i in s[:len(s)//2]]) + solve(s[len(s)//2:],chr(ord(c)+1)) ans2 = sum([i!=c for i in s[len(s)//2:]]) + solve(s[:len(s)//2],chr(ord(c)+1)) ret...

0.489805

def plant_doubling(n): return bin(n).count("1")

0.489428

class Solution: def minOperations(self, n: int) -> int: return (n*n)>>2

0.489387

def self_converge(number): n, cycle = str(number), set() while n not in cycle: cycle.add(n) s = ''.join(sorted(n)) n = '%0*d' % (len(n), int(s[::-1]) - int(s)) return -1 if not int(n) else len(cycle)

0.488436

n = int(input()) print(2**(n+1) - 2)

0.487906

def hamming(n): bases = [2, 3, 5] expos = [0, 0, 0] hamms = [1] for _ in range(1, n): next_hamms = [bases[i] * hamms[expos[i]] for i in range(3)] next_hamm = min(next_hamms) hamms.append(next_hamm) for i in range(3): expos[i] += int(next_hamms[i] == next_hamm)...

0.487341

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline n=int(input()) ans=1 while 2**ans-1<n: ans+=1 print(ans)

0.486468

from re import sub def look_and_say_sequence(s, n): for _ in range(1, n): s = sub(r'(.)\1*', lambda m: str(len(m.group(0))) + m.group(1), s) return s

0.486422

n = input() print(n+n[::-1])

0.486204

import sys sys.setrecursionlimit(10000) n = input() k = int(input()) m = {} def doit(n, k): if len(n) == 0: return k == 0 d = int(n[0]) if (n, k) not in m: ret = 0 for i in range(d + 1): if i == d: ret += doit(n[1:], k - 1 if i > 0 else k) e...

0.486037

def solve(n): zoznam = [int(i) for i in range (2,n+1)] res=[1] while zoznam != []: res.append(zoznam[0]) del zoznam[0::zoznam[0]] return sum(res)

0.486001

class Solution: dictionary = {} def climbStairs(self, n): """ :type n: int :rtype: int """ number = 0 if n == 0 or n == 1: return 1 if n in self.dictionary: return self.dictionary[n] else: numb...

0.485448

class Solution: def monotoneIncreasingDigits(self, N): """ :type N: int :rtype: int """ arr = [int(ch) for ch in str(N)] # create array from number 1234 => [1,2,3,4] marker = len(arr) i = len(arr)-2 while i >= 0: ...

0.484008

S, SS, SUM = [0], {0}, [0] def rec(n): while len(S)<=n: v = S[-1] - len(S) if v<= 0 or v in SS: v += 2*len(S) S.append(v) SS.add(v) SUM.append(SUM[-1]+v) return SUM[n-1]

0.483513

from math import floor, log def count_sixes(n): return floor((n - n % 2) * log(2, 10))

0.48285

n=int(input()) s=input() pw=[1] last=1 for i in range(70): if (last>1e19): break pw.append(last*n) last=last*n dp=[1e19]*100 for i in range(100): dp[i]=[1e19]*100 dp[len(s)][0]=0 for i in range(len(s),-1,-1): for power in range(0,len(pw)): cur='' for j in range(i-1,-1,-1): ...

0.482706

class Solution: def trailingZeroes(self, n): """ :type n: int :rtype: int """ n_fives = 0 while n > 0: n = n // 5 n_fives += n return n_fives

0.482583

def trotter(n): i, numStr, numList =0,'',['0','1','2','3','4','5','6','7','8','9'] if n==0: return('INSOMNIA') while all([i in numStr for i in numList])!=True: i+=1 numStr = numStr+str(n*i) return(i*n)

0.482579

s=input() ans=0 i=1 past=int(s[0]) c=1 ans=1 while(i<len(s)): if(int(s[i])+past==9): c+=1 past=int(s[i]) else: if(c%2==1 and c!=1): ans*=(c//2+1) c=1 past=int(s[i]) i+=1 if(c!=1 and c%2==1): ans*=(c//2+1) print(ans)

0.48237

from math import ceil PI_DIGITS_SQUARED = [int(d)**2 for d in "31415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679"] def square_pi(n): return ceil(sum(PI_DIGITS_SQUARED[:n])**0.5)

0.482334

def l2i(s): return [int(i) for i in s.split()] a, b=l2i(input()) t=0 while (a<=b): a*=3 b*=2 t+=1 print(t)

0.482121

n = int(input()) ans = 1 while n != 1: if n % 2 == 1: ans += 1 n -= 1 else: n //= 2 print(ans)

0.482076

how_many_apples=lambda n:n**n-(n-1)+[0,4][n==2]

0.478631

def prefix(s): p = [0] for i in range(1, len(s)): j = p[-1] while j > 0 and s[j] != s[i]: j = p[j - 1] if s[i] == s[j]: j += 1 p.append(j) return p s = input() n = len(s) ans = [0] * (n + 1) i = n - 1 while i >= 0: p = prefix(s[i:]) ans[i] =...

0.478311

def count_zeros_n_double_fact(n): if n % 2 != 0: return 0 k = 0 while n >= 10: k += n // 10 n //= 5 return k

0.47777

for t in range(int(input())): n=int(input()) print(bin(n).count("1"))

0.477551

class Solution: def countArrangement(self, N): """ :type N: int :rtype: int """ d = { 1:1, 2:2, 3:3, 4:8, 5:10, 6:36, 7:41, 8:132, 9:250, 10:700, 11:750, 12:4010, 13:4237, 14:10680, 15:24679 } return d.get(N, N)

0.477536

h = int(input()) ans = 0 n = 0 while h != 0: ans += 2**n n += 1 h = h//2 print(ans)

0.477447

T = 1 for test_no in range(T): MAXK = 5000 n = int(input()) cnt = [0] * (MAXK + 1) primeExponential = [[0 for j in range(MAXK + 1)] for i in range(MAXK + 1)] line, num = (input() + ' '), 0 for c in line: if c != ' ': num = num * 10 + (ord(c) - 48) else: cnt[num] += 1 num = 0 for i in range(2, MAXK + ...

0.47618

def find(a,b,n): strng = str(a) + str(b) #there are 10 and 4 long loops if (n > 20): n = n%20+20 while len(strng) <= n: next_ch = int(strng[-1]) + int(strng[-2]) strng = strng + str(next_ch) return int(strng[n])

0.47606

import sys input = sys.stdin.readline for _ in range(int(input())): n = int(input()) ans = 0 f = 0 i = n while n: ans += i // 2**f n //= 2 f += 1 print(ans)

0.475768

import fractions import sys f = sys.stdin if len(sys.argv) > 1: f = open(sys.argv[1], "rt") sum_cache = {} def sum_func(x): if x < 10: return x r = sum_cache.get(x) if r is not None: return r xx = 0 while x > 0: xx += x % 10 x /= 10 r = sum_func(xx) ...

0.475389

#CF Round 150. Div II Prob. A - Dividing Orange import sys dp = [[[-1 for j in range(3)] for i in range (1 << 10)] for k in range(11)] In = sys.stdin n = In.readline().strip() def go (idx, mask, equal): if dp[idx][mask][equal] != -1: return dp[idx][mask][equal] if bin(mask).count("1") > 2: re...

0.475193

def fusc(n): a, b = 1, 0 for i in bin(n)[2:]: if i == '1': b += a else: a += b return b

0.474281

n = int(input()) l = input() print(n+1)

0.47317

from operator import mul from math import factorial from functools import reduce from collections import Counter def perms(inp): return factorial(len(str(inp))) // reduce(mul, map(factorial, Counter(str(inp)).values()), 1)

0.472828

class Solution: def integerBreak(self, n): """ :type n: int :rtype: int """ if n==2:return 1 if n==3:return 2 res=1 while n>4: n=n-3 res*=3 return res*n

0.472554

You have 4 cards each containing a number from 1 to 9. You need to judge whether they could operated through *, /, +, -, (, ) to get the value of 24. Example 1: Input: [4, 1, 8, 7] Output: True Explanation: (8-4) * (7-1) = 24 Example 2: Input: [1, 2, 1, 2] Output: False Note: The division operator / represe...

class Solution(object): def judgePoint24(self, nums): bad = '떢븻각걎냇갅갸꺚뵟숣욄뵴뵞뤼갈갌뤔떌옊메늄숭캸긶꺛옖갍뇐쩢곴듇걯궄옕왹눞솴걃끗긬땉궿가쌀낐걄숤뺴늘걘꽸숢걂갋갃쫐꼔솾쩡쇔솿끛뤜간븺쩬웨딴옠뤛갂뵪덠놤빐옋귒늂갰갖놥궾갆옌뼘묰거갎긷낤겼' return chr(int(''.join(map(str, sorted(nums)))) + 42921) not in bad

0.676619

from itertools import permutations def equal_to_24(*aceg): ops = '+-*/' for b in ops: for d in ops: for f in ops: for (a,c,e,g) in permutations(aceg): for s in make_string(a,b,c,d,e,f,g): try: if ev...

0.731931

def e(s):return f([*s,'+']) def f(s,r=0,o=0,x='',c=0): while s and')'!=c: c=s.pop(0);i='+-*/)('.find(c) if c=='-'>x or i<0:x+=c elif c=='(':x=str(f(s)) elif i>-1:a=float(x);r=[r+a,r-a,r*a,r/a][o];o=i;x='' return r

0.653323

import re ADDSUB, MULDIV = '+-', '*$' def calculate(expression): return "400: Bad request" if re.search(r'[^+*$\d.-]', expression) else parseAndEval(expression, ADDSUB) def parseAndEval(expression, ops): v = 0 for op,part in re.findall(r'([{0}])?([^{0}]+)'.format(ops), expression): if not op: ...

0.639192

op = {'+': 'Plus ','-': 'Minus ','*': 'Times ', '/': 'Divided By ', '**': 'To The Power Of ', '=': 'Equals ', '!=': 'Does Not Equal '} num = {'1': 'One', '2': 'Two', '3': 'Three', '4': 'Four', '5': 'Five', '6': 'Six', '7':'Seven', '8': 'Eight', '9': 'Nine', '10': 'Ten'} def expression_out(e): a, b, c = e.split...

0.637869

class Solution: def calculate(self, s): """ :type s: str :rtype: int """ if not s: return 0 pre_op = '+' stack = [0] cur_num = 0 digits = '0123456789' s += '#' for c in s: ...

0.620906

class Solution: def evalRPN(self, tokens): """ :type tokens: List[str] :rtype: int """ s = [] for token in tokens: if token == "+": a = int(s.pop()) b = int(s.pop()) s.append(a+b) elif token == "/": a = int(s.pop()) b = int(s.po...

0.615395

import operator def calc(expr): OPERATORS = {'+': operator.add, '-': operator.sub, '*': operator.mul, '/': operator.truediv} stack = [0] for token in expr.split(" "): if token in OPERATORS: op2, op1 = stack.pop(), stack.pop() stack.append(OPERATORS[token](op1,op2)) e...

0.614697

import re class Solution: def calc(self, a, b, op): if op == '+': for k, v in b.items(): a[k] = a.get(k, 0) + v return a elif op == '-': for k, v in b.items(): a[k] = a.get(k, 0) - v return a eli...

0.613944

from operator import add, sub, mul, truediv D = {'+':add, '-':sub, '*':mul, '/':truediv} def calculate(a, o, b): try: return D[o](a, b) except: pass

0.611327

def calculator(x, y, op): return eval(f'{x}{op}{y}') if type(x) == type(y) == int and str(op) in '+-*/' else 'unknown value'

0.603015

def no_order(equation): equation = equation.replace(' ', '') equation = equation.replace('+', ')+') equation = equation.replace('-', ')-') equation = equation.replace('*', ')*') equation = equation.replace('/', ')//') equation = equation.replace('%', ')%') equation = equation.replace('^', ')...

0.599862

from functools import reduce from itertools import cycle from operator import add, truediv, mul, sub def do_math(s): xs = sorted(s.split(), key=lambda x: next(c for c in x if c.isalpha())) xs = [int(''.join(filter(str.isdigit, x))) for x in xs] ops = cycle([add, sub, mul, truediv]) return round(reduce...

0.590399

def calculate(s): return str(sum(int(n) for n in s.replace("minus", "plus-").split("plus"))) # I heard here and there that using eval is a very bad practice… #return str(eval(s.replace("plus", "+").replace("minus", "-")))

0.559763

import operator as o class v: def __init__(s,a,b): s.a,s.b=a,b def compute(s): return getattr(o,type(s).__name__)(s.a,s.b) class value(int): pass class add(v): pass class sub(v): pass class mul(v): pass class truediv(v): pass class mod(v): pass class pow(v): pass

0.557235

def calculate(num1, operation, num2): # your code here try : return eval("{} {} {}".format(num1, operation, num2)) except (ZeroDivisionError, SyntaxError): return None

0.555924

class Solution: def calPoints(self, ops): """ :type ops: List[str] :rtype: int """ sum = 0 for i in range (len(ops)): op = ops[i] if self.isInt(op): sum = sum + int(op) elif op == 'C': for ...

0.554087

for _ in range(int(input())): s = list(input().strip()) i = 0 while i < len(s) - 1: if s[i].isalpha() or s[i] == ')': if s[i + 1].isdigit(): if i + 2 >= len(s) or s[i + 2] == ')': s = s[:i+1] + ['*', s[i+1]] + s[i+2:] else: s = s[:i+1] + ['*', s[i+1], '+'] + s[i+2:] i += 1 elif s[i + ...

0.547705

class Solution: def calculate(self, s): """ :type s: str :rtype: int """ res = 0 num = 0 sign = 1 stk = [] for c in s: if c.isdigit(): num = 10 * num + (ord(c) - ord('0')) elif c == '+': ...

0.541761

def array_conversion(arr): sign = 0 while len(arr) > 1: sign = 1^sign arr = list(map(lambda x, y: x+y, arr[0::2],arr[1::2]) if sign else map(lambda x, y: x*y, arr[0::2],arr[1::2])) return arr[0]

0.541171

def sum_prod(strexpression): return "%.5e" %(eval(strexpression))

0.541098

def calc_type(a, b, res): return {a + b: "addition", a - b: "subtraction", a * b: "multiplication", a / b: "division"}[res]

0.538868

def check_root(string): try: a,b,c,d = [int(i) for i in string.split(',')] if not (a == b-1 and a == c-2 and a == d-3): return 'not consecutive' s = a*b*c*d+1 return str(s)+', '+str(int(s**0.5)) except: return 'incorrect input'

0.534612

def is_incrementing(number): return str(number) in '1234567890' def is_decrementing(number): return str(number) in '9876543210' def is_palindrome(number): return str(number) == str(number)[::-1] def is_round(number): return set(str(number)[1:]) == set('0') def is_interesting(number, awesome_phrases): test...

0.534471

import re def calculate(input): try: return eval(re.sub(r'(\d+)', lambda m: str(int(m.group(1))), input)) except: return False

0.533215

def valid_card(card): s = list(map(int, str(card.replace(' ', '')))) s[0::2] = [d * 2 - 9 if d * 2 > 9 else d * 2 for d in s[0::2]] return sum(s) % 10 == 0

0.52843

from itertools import product def operator_insertor(n): result = [] for ops in product(["+", "-", ""], repeat=8): expression = "".join(a+b for a, b in zip("123456789", list(ops) + [""])) res = eval(expression) if res == n: result.append(len(expression) - 9) ret...

0.527402

def simple_multiplication(number) : return number * 9 if number % 2 else number * 8

0.526726

class Solution: def makesquare(self, nums): """ :type nums: List[int] :rtype: bool """ if len(nums) < 4: return False length = sum(nums) if length % 4: return False length = (int) (length / 4) ...

0.525569

def calculate(n1, n2, o): operators = { "add": (lambda x, y: x + y), "subtract": (lambda x, y: x - y), "multiply": (lambda x, y: x * y), } return "{:b}".format( operators[o]( int(n1, 2), int(n2, 2) ) )

0.525058

import operator from functools import reduce OPS = { "AND": operator.and_, "OR" : operator.or_, "XOR": operator.xor } def logical_calc(array, op): return reduce(OPS[op], array)

0.523748

def vampire_test(x, y): return sorted(str(x * y)) == sorted(str(x) + str(y))

0.523237

import re def asterisc_it(s): if isinstance(s,int): s=str(s) elif isinstance(s,list): s=''.join(map(str,s)) return re.sub(r'(?<=[02468])(?=[02468])', '*', s)

0.521833

class Solution: def optimalDivision(self, nums): """ :type nums: List[int] :rtype: str """ if(len(nums) == 0): return '' if(len(nums) == 1): return str(nums[0]) if(len(nums) == 2): return str(nums[0]) + '/' + str(...

0.521199

class Solution(object): loc=0 lastloc=-1 f='' def getNext(self,formular,locked=False): stype=0 # 0:null, 1:numeric, 2/20: Elem, 3: parenthesis ret=0 if self.loc==self.lastloc: return (0,0) i=self.loc while i <len(formular): if stype in (0,1) ...

0.519746

def basic_op(operator, value1, value2): if operator=='+': return value1+value2 if operator=='-': return value1-value2 if operator=='/': return value1/value2 if operator=='*': return value1*value2

0.518359

import re def calculate_string(st): st = re.sub(r'[^-+*/\d.]', '', st) result = eval(st) return str(int(round(result)))

0.518224

def get_digits(n): return [int(x) for x in list(str(n))] def is_narc(n): return n == sum([x**len(get_digits(n)) for x in get_digits(n)]) def is_narcissistic(*values): try: return all(type(n) in [int,str] and is_narc(int(n)) for n in values) except ValueError: return False

0.516377

class Solution(object): def parse(self,expression,d,i): count = 0 start = i if expression[i] == "(": count += 1 i += 1 while count != 0: if expression[i] == "(": count += 1 elif expression[i] == ")": count -= 1 i += 1 val = self.evaluate(expression[start:i],d) el...

0.515515

cake=lambda c,d:['That was close!','Fire!'][c!=0and c*0.7<sum(ord(e)-96*(i%2!=0)for i,e in enumerate(d))]

0.51425

TABLE = str.maketrans('0123456789','9876543210') def code(*args): return sum(map(lambda n:int(str(n).translate(TABLE)), args))

0.513179

from random import choice def interpret(code): code = [list(l) for l in code.split('\n')] x, y = 0, 0 dx, dy = 1, 0 output = '' stack = [] string_mode = False while True: move = 1 i = code[y][x] if string_mode: if i == '"': s...

0.511024

# Enter your code here. Read input from STDIN. Print output to STDOUT a=int(input()) b=int(input()) c=int(input()) d=int(input()) print((pow(a,b)+pow(c,d)))

0.505239

def expression_matter(a, b, c): return max(a*b*c, a+b+c, (a+b)*c, a*(b+c))

0.504065

def narcissistic(value): return value == sum(int(x) ** len(str(value)) for x in str(value))

0.503296

def is_magical(sq): return sum(sq[2:7:2])==sum(sq[::4])==sum(sq[::3])==sum(sq[1::3])==sum(sq[2::3])==sum(sq[:3])==sum(sq[3:6])==sum(sq[6:])

0.501618

def is_happy(n): seen = set() while n!=1: n = sum(int(d)**2 for d in str(n)) if n not in seen: seen.add(n) else: return False return True

0.501181

s = input() res = eval(s) n = len(s) for i in range(-1, n): if i == -1 or s[i] == '*': for j in range(i + 1, n + 1): if j == n or s[j] == '*': new_s = s[0:i + 1] + "(" + s[i + 1:j] + ")" + s[j:n] res = max(res, eval(new_s)) print(res)

0.500794

def sum_it_up(a): return sum(int(*x) for x in a)

0.497618

from operator import add, sub, mul, floordiv as div, and_, or_, xor OP = {'add':add, 'sub':sub, 'mul':mul, 'div':div, 'and':and_, 'or':or_, 'xor':xor} class Machine(object): def __init__(self, cpu): self.cpu = cpu def execute(self, instruction): cmd, a, b = (instruction.rep...

0.497314

def process_data(data): r = 1 for d in data: r *= d[0] - d[1] return r

0.495106

def arithmetic(a, b, operator): return { 'add': a + b, 'subtract': a - b, 'multiply': a * b, 'divide': a / b, }[operator]

0.493799

def eval_object(v): return {"+": v['a']+v['b'], "-": v['a']-v['b'], "/": v['a']/v['b'], "*": v['a']*v['b'], "%": v['a']%v['b'], "**": v['a']**v['b'], }.get(v['operation'])

0.49358

class Solution: def calc(self, part): part += "+" ## added tmp symbol in the end to sum last item within the loop start = x = n = 0 coeff = 1 for end, char in enumerate(part): # print("charIdx:", equation[end], "char: ", char, char == "+" or char == "-", "slice: ", ...

0.493561

def isValid(formula): return not ( \ ( 1 in formula and 2 in formula) or \ ( 3 in formula and 4 in formula) or \ ( 5 in formula and not 6 in formula) or \ (not 5 in formula and 6 in formula) or \ (not 7 in formula and not 8 in formula))

0.493219

class Solution: def isHappy(self, n): """ :type n: int :rtype: bool """ former = set() while True: h = 0 while n > 0: d = n % 10 h += (d*d) n = n // 10 if h == 1: ...

0.491273

def prod2sum(a, b, c, d): e = sorted([abs(a*d-b*c), abs(a*c+b*d)]) f = sorted([abs(a*c-b*d), abs(a*d+b*c)]) if e == f: return [e] else: return sorted([e, f])

0.489777

S = input() a = int(S[0]) b = int(S[1]) c = int(S[2]) d = int(S[3]) if a+b+c+d==7: print('{}+{}+{}+{}=7'.format(a,b,c,d)) elif a+b+c-d==7: print('{}+{}+{}-{}=7'.format(a,b,c,d)) elif a+b-c+d==7: print('{}+{}-{}+{}=7'.format(a,b,c,d)) elif a+b-c-d==7: print('{}+{}-{}-{}=7'.format(a,b,c,d)) elif a-b+c+...

0.489052

import math import re from fractions import Fraction class Task: table = ['111111101010101111100101001111111\n', '100000100000000001010110001000001\n', '101110100110110000011010001011101\n', '101110101011001001111101001011101\n', '101110101100011000111100101011101\n', '100000101010101011010000101000001\n', '111111...

0.488242

triangular_sum=lambda n: (-0.5+(1+8*n)**0.5/2.0)**0.5%1==0

0.486156

from functools import reduce def solve(st): res, s, k = [], "", 1 for ch in st: if ch == '(': res.append(k); k = 1 elif ch == ')': res.pop(); k = 1 elif ch == '-': k = -1 elif ch == '+': k = 1 else: s+= '-'+ch if (reduce(lambda a,b: a * b,res,1) * (1 if k == 1 else -1) <...

0.486102

def fortune(f, p, c, n, i): for _ in range(n-1): f = int(f * (100 + p) / 100 - c) c = int(c * (100 + i) / 100) if f < 0: return False return True

0.485733

def check_concatenated_sum(n, r): return abs(n) == sum(int(e*r) for e in str(abs(n)) if r)

0.485573

class Machine: def __init__(self): self.cmd = dict() self._actions = [lambda x: x + 1, lambda x: 0, lambda x: x / 2, lambda x: x * 100, lambda x: x % 2] def command(self, cmd, num): self.last_cmd = cmd if cmd in self.cmd: return self._actions[self.cmd[cmd]](num) ...

0.484865

# -*- coding: utf-8 -*- import operator class Placeholder: def __init__(self, op=None, left=None, right=None): self.op = op self.left = left self.right = right def calc(self, args): if self.op: x, args = self.left.calc(args) if isinstance(self.left, Placeholder) el...

0.484645

from fractions import gcd import re from functools import reduce def min_special_mult(arr): l = [e for e in arr if not re.match('(None)|([+-]?\d+)', str(e))] if len(l) == 1: return 'There is 1 invalid entry: {}'.format(l[0]) if len(l) > 1: return 'There are {} invalid entries: {}'.format(le...

0.483886

from functools import reduce from operator import mul def product(numbers): return reduce(mul, numbers) if numbers else None

0.482048

def noonerize(numbers): try: num1 = int(str(numbers[1])[0] + str(numbers[0])[1:]) num2 = int(str(numbers[0])[0] + str(numbers[1])[1:]) except ValueError: return "invalid array" return abs(num1 - num2)

0.481637

import re yes = "In with a chance" no = "Plenty more fish in the sea" def validate_number(string): return yes if re.match(r'^(\+44|0)7[\d]{9}$',re.sub('-','',string)) else no

0.480713

from functools import reduce from operator import mul def multi(l_st): return reduce(mul,l_st) def add(l_st): return sum(l_st) def reverse(s): return s[::-1]

0.480593

pos = {"L4":0, "L3":1, "L2":2, "L1":3, "L0":4, "R0":4, "R1":5, "R2":6, "R3":7, "R4":8} def tetris(arr): current, res = [0]*9, 0 for x in arr: p = pos[x[1:]] current[p] += int(x[0]) if current[p] >= 30: break y = min(current) if y: current, res = [v-y for v in current], r...

0.479252

add = lambda a, b: a + b multiply = lambda a, b: a * b divide = lambda a, b: a / b mod = lambda a, b: a % b exponent = lambda a, b: a ** b subt = lambda a, b:a - b

0.479096

def answer(puzzlebox): return 42

0.478232

def calculate(s): x=[int(i) for i in s.split() if i.isdigit()] return sum(x) if 'gains' in s.split() else x[0]-x[1]

0.474462

def disarium_number(n): return "Disarium !!" if n == sum(int(d)**i for i, d in enumerate(str(n), 1)) else "Not !!"

0.472856

def palindrome(num): if not isinstance(num, int) or num < 0: return 'Not valid' s = str(num) return sum(sum(s[i:i+n] == s[i:i+n][::-1] for i in range(len(s)-n+1)) for n in range(2, len(s)+1))

0.472703

def triple_double(num1, num2): return any([i * 3 in str(num1) and i * 2 in str(num2) for i in '0123456789'])

0.472504

def automorphic(n): return "Automorphic" if str(n*n).endswith(str(n)) else "Not!!"

0.472347

from collections import defaultdict import re P = re.compile(r'\+?(-?\d*)(x\^?)?(\d*)') def differentiate(eq, x): derivate = defaultdict(int) for coef,var,exp in P.findall(eq): exp = int(exp or var and '1' or '0') coef = int(coef!='-' and coef or coef and '-1' or '1') if...

0.47188

from math import inf class Node: def __init__(self, parent = None, leftExp = None, rightExp = None, signQ = 0): self.parent, self.leftExp, self.rightExp, self.signQ = parent, leftExp, rightExp, signQ def __str__(self): return "Node" memo = {} def Memoize(node, p, maxValue, minValue): if n...

0.471416

def score_hand(a): n = sum(11 if x == "A" else 10 if x in "JQK" else int(x) for x in a) for _ in range(a.count("A")): if n > 21: n -= 10 return n

0.470087

how_many_apples=lambda n:n**n-(n-1)+[0,4][n==2]

0.469652

def palindrome(num): if type(num) is not int or num <1: return "Not valid" return num == int(str(num)[::-1])

0.466969

from math import log def powerof4(n): if type(n) in (float, int) and n > 0: return log(n,4).is_integer() return False

0.466816

# cook your dish here def value(a, b, c): if(c == '&'): return a&b elif(c == '^'): return a^b elif(c == '|'): return a|b def break_rules(n, operator): if(len(n) == 1): return n elif(len(n) == 2): return [value(n[0], n[1], operator[0])] else: cont_...

0.466635

import sys import math def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def MI(): return map(int, sys.stdin.readline().split()) def SI(): return sys.stdin.readline().strip() t = II() for q in range(t): a,b,c,d = MI() print(max(a+b,c+d))

0.465601

def is_divisible_by_6(s): all_numbers = [ int(s.replace('*', str(n))) for n in range(10) ] return [ str(n) for n in all_numbers if n % 6 == 0 ]

0.465284

def add(*args): return int(round(sum(float(a) / i for (i, a) in enumerate(args, 1))))

0.464964

def palindrome(num): if type(num) != int or num < 0: return "Not valid" s = str(num) for i in range(len(s)-2): if s[i] == s[i+1] or s[i] == s[i+2]: return True return len(s) != 1 and s[-1] == s[-2]

0.464826

def digit_all (x): return filter(str.isdigit, x) if isinstance(x, str) else 'Invalid input !'

0.463157

def find(a,b,n): strng = str(a) + str(b) #there are 10 and 4 long loops if (n > 20): n = n%20+20 while len(strng) <= n: next_ch = int(strng[-1]) + int(strng[-2]) strng = strng + str(next_ch) return int(strng[n])

0.462867

from itertools import product def is_divisible_by_6(s): if s[-1] in '13579': return [] ss = s.replace('*','{}') return [ v for v in (ss.format(*p) for p in product(*(['0123456789']*s.count('*')))) if not int(v)%6]

0.462752

from itertools import product def proc_seq(*args): nums = set(int(''.join(l)) for l in product(*(str(a) for a in args)) if l[0] != '0') if len(nums) == 1: return [1, nums.pop()] return [len(nums), min(nums), max(nums), sum(nums)]

0.462386

class Solution: def multiply(self,num1, num2): """ :type num1: str :type num2: str :rtype: str """ a=['0','1','2','3','4','5','6','7','8','9'] z=0 x=0 for i,element in enumerate(num1): for j in range(10): ...

0.462326

def is_narcissistic(n): num = str(n) length = len(num) return sum(int(a) ** length for a in num) == n

0.462311

def build_square(blocks): for x in range(4): if 4 in blocks: blocks.remove(4) elif 3 in blocks and 1 in blocks: blocks.remove(3) blocks.remove(1) elif blocks.count(2) >= 2: blocks.remove(2) blocks.remove(2) elif 2 in blocks ...

0.461824

from operator import add, mul, floordiv as fdiv, pow def poohbear(s): def updateMem(func, v): mem[p] = func(mem.get(p, 0), v) % 256 braces, stack = {}, [] for i,c in enumerate(s): if c == 'W': stack.append(i) if c == 'E': braces[i] = stack[-1] braces[stack.pop(...

0.461807

def validate(n): digits = [int(x) for x in str(n)] even = [x*2 if x*2 <= 9 else x*2 - 9 for x in digits[-2::-2]] odd = [x for x in digits[-1::-2]] return (sum(even + odd)%10) == 0

0.460801

def to_postfix (infix): prec = {'+': 1, '-': 1, '*': 2, '/': 2, '^': 3, '(': 0} postfix = [] stack = [] for ch in infix: if ch in '0123456789': postfix.append(ch) elif ch in '(': stack.append(ch) elif ch in ')': while stack and stack[-1] != '('...

0.460637

def calc(a): return sum( x**(1 + (x>=0)) * (1 + 2*(not i%3)) * (-1)**(not i%5) for i,x in enumerate(a,1))

0.460326

# 1390. Four Divisors # version 2, with optimized prime-finding. import math def remove (lst, index): assert lst tail = len (lst) - 1 lst[index], lst[tail] = lst[tail], lst[index] lst.pop () def swap_min (lst): if not lst: return argmin = min (range (len (lst)), key = lambda i: lst[i]) ls...

0.460212

Given an encoded string, return it's decoded string. The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is guaranteed to be a positive integer. You may assume that the input string is always valid; No extra white spaces, square...

class Solution: def decodeString(self, s): """ :type s: str :rtype: str """ stack = [] stack.append(["", 1]) num = "" for ch in s: if ch.isdigit(): num += ch elif ch == '[': stack.appen...

0.707006

from re import sub def encode(string): return sub(r'(.)\1*', lambda m: str(len(m.group(0))) + m.group(1),string) def decode(string): return sub(r'(\d+)(\D)', lambda m: m.group(2) * int(m.group(1)),string)

0.651635

import re def string_parse(string): return re.sub(r'(.)\1(\1+)', r'\1\1[\2]', string) if isinstance(string, str) else 'Please enter a valid string'

0.598057

import re REGEX = re.compile(r'\[(.*?)\]') def bracket_buster(strng): try: return REGEX.findall(strng) except TypeError: return 'Take a seat on the bench.'

0.55036

def string_expansion(s): m,n = '',1 for j in s: if j.isdigit(): n = int(j) else: m += j*n return m

0.534007

lm = ['.-', '-...', '-.-.', '-..', '.', '..-.', '--.', '....', '..', '.---', '-.-', '.-..', '--', '-.', '---', '.--.', '--.-', '.-.', '...', '-', '..-', '...-', '.--', '-..-', '-.--', '--..', '-----', '.----', '..---', '...--', '....-', '.....', '-....', '--...', '---..', '----.'] ll = "abcdefghijklmnopqrstuvwxyz012345...

0.521853

def duplicate_encode(word): return "".join(["(" if word.lower().count(c) == 1 else ")" for c in word.lower()])

0.51689

from random import choice def interpret(code): code = [list(l) for l in code.split('\n')] x, y = 0, 0 dx, dy = 1, 0 output = '' stack = [] string_mode = False while True: move = 1 i = code[y][x] if string_mode: if i == '"': s...

0.516756

import re def encoder(s): d, out, it = {},[], iter(s) for c in it: i,k = 0,c while k in d: i,c = d[k], next(it,'') if not c: break k += c d[k] = len(d)+1 out.append(f'{i}{c}') return ''.join(out) def decoder(s): d = [''] for m i...

0.512895

unflatten=lambda m,d,c=0:m if c==d else unflatten(parse(m,[0,1][c&1]),d,c+1) def parse(ar, lr): sub, i = [], [0, len(ar) - 1][lr] while 0 <= i < len(ar): j, r = ar[i], lr == 1 if isinstance(j, list): sub.append(parse(j, lr)) i += [1, -1][r] else: ...

0.499263

def decode(s): return s.translate(str.maketrans("1234567890", "9876043215"))

0.498623

class Solution(object): loc=0 lastloc=-1 f='' def getNext(self,formular,locked=False): stype=0 # 0:null, 1:numeric, 2/20: Elem, 3: parenthesis ret=0 if self.loc==self.lastloc: return (0,0) i=self.loc while i <len(formular): if stype in (0,1) ...

0.497933

from math import ceil def b91decode(strng): ret = '' base91_alphabet = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't'...

0.49658

def repeater(string, n): return '"{}" repeated {} times is: "{}"'.format(string, n, string * n)

0.494352

def decodeBits(bits): import re # remove trailing and leading 0's bits = bits.strip('0') # find the least amount of occurrences of either a 0 or 1, and that is the time hop time_unit = min(len(m) for m in re.findall(r'1+|0+', bits)) # hop through the bits and translate to morse ...

0.492109

# """ # This is the interface that allows for creating nested lists. # You should not implement it, or speculate about its implementation # """ #class NestedInteger: # def __init__(self, value=None): # """ # If value is not specified, initializes an empty list. # Otherwise initializes a ...

0.486889

def repeat_it(string,n): return string * n if isinstance(string,str) else 'Not a string'

0.485038

class Solution(object): def parse(self,expression,d,i): count = 0 start = i if expression[i] == "(": count += 1 i += 1 while count != 0: if expression[i] == "(": count += 1 elif expression[i] == ")": count -= 1 i += 1 val = self.evaluate(expression[start:i],d) el...

0.484374

def decode(number): return ', '.join( str(int(w, 2)) if i % 2 else ''.join( chr(int(w[x:x+3])-4) for x in range(0, len(w), 3) ) for i, w in enumerate( str(number).strip('98').split('98') ) )

0.482855

def encode(stg): return "".join(digit * 3 for char in stg for digit in f"{ord(char):08b}") def decode(binary): reduced = (get_digit(triplet) for triplet in chunks(binary, 3)) return "".join(get_char(byte) for byte in chunks("".join(reduced), 8)) def chunks(seq, size): return (seq[i:i+size] for i in ...

0.482377

def scoreboard(string): scores = {'nil': 0, 'one': 1, 'two': 2, 'three': 3, 'four': 4, 'five': 5, 'six': 6, 'seven': 7, 'eight': 8, 'nine': 9} return [scores[x] for x in string.split() if x in scores]

0.480071

def repeater(string, n): return string * n

0.479737

class Solution: def braceExpansionII(self, expression: str) -> List[str]: stack,res,cur=[],[],[''] for v in expression: if v.isalpha(): cur=[c+v for c in cur] elif v==',': res+=cur cur=[''] elif v==...

0.479714

from math import factorial as fac cards = [ "AC", "2C", "3C", "4C", "5C", "6C", "7C", "8C", "9C", "TC", "JC", "QC", "KC", "AD", "2D", "3D", "4D", "5D", "6D", "7D", "8D", "9D", "TD", "JD", "QD", "KD", "AH", "2H", "3H", "4H", "5H", "6H", "7H", "8H", "9H", "TH", "JH", "QH", "KH", "AS", "2S", "3S", "4S", "5...

0.47639

import re def asterisc_it(s): if isinstance(s,int): s=str(s) elif isinstance(s,list): s=''.join(map(str,s)) return re.sub(r'(?<=[02468])(?=[02468])', '*', s)

0.475234

from re import findall; repeat_adjacent=lambda s: len(findall(r"((.)\2+(?!\2)){2,}",s))

0.473591

class Solution(object): def splitIntoFibonacci(self, S): \"\"\" :type S: str :rtype: List[int] \"\"\" n = len(S) for i in range(1, 11): for j in range(1, 11): if i + j >= n: break L = self.buildFibo(S, i,...

0.473153

class Solution: def numDecodings(self, s): """ :type s: str :rtype: int """ if not s: return 0 def num_decode(i): # Number of ways to decode s[i:] if i == len(s): return 1 ...

0.472788

def num_obj(s): return [{str(i) : chr(i)} for i in s]

0.471078

0.465951

def reverse_in_parentheses(s): stack = [] for i in s: stack.append(i) if i == ')': opening = len(stack) - stack[::-1].index('(') - 1 stack.append(''.join([i[::-1].translate(str.maketrans('()',')(')) for i in stack[opening:][::-1]])) del stack[openin...

0.464229

import re def AlphaNum_NumAlpha(string): return re.sub( r'[0-9]{1,2}|[a-z]', lambda x:str(ord(x.group() )-96) if x.group().isalpha() else chr(int(x.group())+96) , string) #\w

0.462192

from re import sub def look_and_say_sequence(s, n): for _ in range(1, n): s = sub(r'(.)\1*', lambda m: str(len(m.group(0))) + m.group(1), s) return s

0.461995

from operator import add, mul, floordiv as fdiv, pow def poohbear(s): def updateMem(func, v): mem[p] = func(mem.get(p, 0), v) % 256 braces, stack = {}, [] for i,c in enumerate(s): if c == 'W': stack.append(i) if c == 'E': braces[i] = stack[-1] braces[stack.pop(...

0.461932

def repeat_str(repeat, string): return repeat * string

0.4615

import re def calculate_string(st): st = re.sub(r'[^-+*/\d.]', '', st) result = eval(st) return str(int(round(result)))

0.460639

def decipher_word(word): i = sum(map(str.isdigit, word)) decoded = chr(int(word[:i])) if len(word) > i + 1: decoded += word[-1] if len(word) > i: decoded += word[i+1:-1] + word[i:i+1] return decoded def decipher_this(string): return ' '.join(map(decipher_word, string.split()))

0.456621

def interpreter(code, tape): tape = list(map(int, tape)) ptr = step = loop = 0 while 0 <= ptr < len(tape) and step < len(code): command = code[step] if loop: if command == "[": loop += 1 elif command == "]": loop -= 1 elif command == "...

0.456404

import re class Solution: def calc(self, a, b, op): if op == '+': for k, v in b.items(): a[k] = a.get(k, 0) + v return a elif op == '-': for k, v in b.items(): a[k] = a.get(k, 0) - v return a eli...

0.455226

import re def words_to_object(s): return "[" + re.sub("([^ ]+) ([^ ]+)", r"{name : '\1', id : '\2'},", s).strip(',') + "]"

0.455014

def remove_parentheses(s): lvl,out = 0,[] for c in s: lvl += c=='(' if not lvl: out.append(c) lvl -= c==')' return ''.join(out)

0.454675

def domino_reaction(s): ds = "" for (i,d) in enumerate(s): if( d=="|" ): ds += "/" else: return ds+s[i:] return ds

0.454414

def encode(s): return ' '.join( w[-2::-1] + w[-1] for w in s.split() )

0.454068

def decrypt(s): return next((str(b // 11) for b in (int(str(a) + s) for a in range(1, 11)) if b % 11 == 0), 'impossible')

0.453472

def encode(s): lst = sorted( s[i or len(s):] + s[:i or len(s)] for i in reversed(range(len(s))) ) return ''.join(ss[-1] for ss in lst), s and lst.index(s) or 0 def decode(s, n): out, lst = [], sorted((c,i) for i,c in enumerate(s)) for _ in range(len(s)): c,n = lst[n] out.append(c) r...

0.453173

def e(s):return f([*s,'+']) def f(s,r=0,o=0,x='',c=0): while s and')'!=c: c=s.pop(0);i='+-*/)('.find(c) if c=='-'>x or i<0:x+=c elif c=='(':x=str(f(s)) elif i>-1:a=float(x);r=[r+a,r-a,r*a,r/a][o];o=i;x='' return r

0.452573

MORSE_TO_NUM = { ".----" : "1", "..---" : "2", "...--" : "3", "....-" : "4", "....." : "5", "-...." : "6", "--..." : "7", "---.." : "8", "----." : "9", "-----" : "0", } def morse_converter(s): return int("".join(MORSE_TO_NUM[s[i:i+5]] for i in range(0, len(s), 5)))

0.452006

def no_order(equation): equation = equation.replace(' ', '') equation = equation.replace('+', ')+') equation = equation.replace('-', ')-') equation = equation.replace('*', ')*') equation = equation.replace('/', ')//') equation = equation.replace('%', ')%') equation = equation.replace('^', ')...

0.44968

DIGITS = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/" def base64_to_base10(string): return sum(DIGITS.index(digit) * 64**i for i, digit in enumerate(string[::-1]))

0.449543

from itertools import cycle from string import ascii_lowercase def decode(code, key): keys = cycle(map(int, str(key))) return ''.join(ascii_lowercase[n - next(keys) - 1] for n in code)

0.449198

dict = {i[0]:i[1] for i in ['GA', 'DE', 'RY', 'PO', 'LU', 'KI', 'AG', 'ED', 'YR', 'OP', 'UL', 'IK','ga', 'de', 'ry', 'po', 'lu', 'ki', 'ag', 'ed', 'yr', 'op', 'ul', 'ik'] } def encode(s): return ''.join([dict[i] if i in dict else i for i in s]) def decode(s): return ''.join([dict[i] if i in dict else i for...

0.448967

import re reg = re.compile('a*b*c*d*e*f*g*h*i*j*k*l*m*n*o*p*q*r*s*t*u*v*w*x*y*z*') def longest(s): return max(reg.findall(s), key=len)

0.44861

remove=lambda s:' '.join(r for r,_ in __import__('re').findall(r'((!*)\w+\2)',s))

0.447762

import base64 import zlib pro = base64.decodebytes("""eJxtUUFuwyAQvPOKVarKkDhOm2MlX/uC3qqqAhs7KBgswGr6+y4QrLqqL7DD7OzMWk2zdQFGGWbu PVG59N/rdeLhUu6Om95OpVJBumCtXqlCedkFQgalpYcW3twiSS/FMmLxyrWXhKihzGrwXLx0lEHb QjU4e5HmWgHOgKTwQgC/0p/EIoDeGh96ZRC0szR0F6QPjTI7lt4fCsMuoVCqREGgqqH6qjIxBSZo cADdTZTXIFie6dCZM8BhDwJOp7SDZuz6zLn...

0.447649

import re def sum_from_string(string): d = re.findall("\d+",string) return sum(int(i) for i in d)

0.445867

def encode(str, key): key = key.lower() + key.upper() dict = { char: key[i-1] if i % 2 else key[i+1] for i, char in enumerate(key) } return ''.join( dict.get(char, char) for char in str ) decode = encode

0.444836

import re from collections import Counter class Task: answer = [] str = "" def getData(self): x = 0 self.str = input() def solve(self): list = re.findall("\".*?\"|[^ ]+", self.str) self.answer = ["<" + x.replace("\"", "") + ">" for x in list] def printAnswer(self): for x in self.answer: print(x...

0.443732

def encode(s, t=str.maketrans("aeiou", "12345")): return s.translate(t) def decode(s, t=str.maketrans("12345", "aeiou")): return s.translate(t)

0.442378

import re def solve(eq): return ''.join(reversed(re.split(r'(\W+)', eq)))

0.441774

def decipher(cipher): out = "" while cipher: l = 2 if cipher[0] == "9" else 3 out += chr(int(cipher[:l])) cipher = cipher[l:] return out

0.441738

class Solution: def reverseStr(self, s, k): """ :type s: str :type k: int :rtype: str """ for idx in range(0, len(s), 2*k): s = s[:idx] + s[idx:idx+k][::-1] + s[idx+k:] return s

0.44019

def de_nico(key, msg): ll, order, s = len(key), [sorted(key).index(c) for c in key], '' while msg: s, msg = s + ''.join(msg[i] for i in order if i < len(msg)), msg[ll:] return s.strip()

0.439128

def clean_string(s): stk = [] for c in s: if c=='#' and stk: stk.pop() elif c!='#': stk.append(c) return ''.join(stk)

0.436033

import re ADDSUB, MULDIV = '+-', '*$' def calculate(expression): return "400: Bad request" if re.search(r'[^+*$\d.-]', expression) else parseAndEval(expression, ADDSUB) def parseAndEval(expression, ops): v = 0 for op,part in re.findall(r'([{0}])?([^{0}]+)'.format(ops), expression): if not op: ...

0.434911

def string_func(s, n): l, s = [s], list(s) while True: s[::2], s[1::2] = s[:len(s)//2-1:-1], s[:len(s)//2] l.append(''.join(s)) if l[0] == l[-1]: del l[-1]; break return l[n % len(l)]

0.434591

TABLE = str.maketrans('0123456789','9876543210') def code(*args): return sum(map(lambda n:int(str(n).translate(TABLE)), args))

0.433908

from itertools import groupby def replace(s): queue, rle = {}, [[i, k, len(list(g))] for i, (k, g) in enumerate(groupby(s))] for i, k, l in reversed(rle): if l not in queue: queue[l] = {} queue[l].setdefault(k, []).append(i) for l in queue: while sum(map(bool, queue[l].values())) > ...

0.431792

def array(strng): return ' '.join(strng.split(',')[1:-1]) or None

0.431656

from math import ceil def matrixfy(s): if not s: return "name must be at least one letter" x = ceil(len(s)**.5) it = iter(s.ljust(x*x,'.')) return [ [next(it) for _ in range(x)] for _ in range(x)]

0.431638

def interpreter(code, iterations, width, height): code = "".join(c for c in code if c in "[news]*") canvas = [ [0] * width for _ in range(height) ] row = col = step = count = loop = 0 while step < len(code) and count < iterations: command = code[step] if loop: i...

0.431296

def doubles(s): cs = [] for c in s: if cs and cs[-1] == c: cs.pop() else: cs.append(c) return ''.join(cs)

0.430123

def explode(arr): return [arr] * sum(v for v in arr if isinstance(v,int)) or 'Void!'

0.430075

def multiple_split(string, delimiters=[]): for d in delimiters: string = string.replace(d, '###') return [s for s in string.split('###') if s]

0.42979

from itertools import groupby def run_length_encoding(s): return [[sum(1 for _ in g), c] for c, g in groupby(s)]

0.429109

def interpreter(tape): ptr, stack, output = 0, [0], [] while ptr < len(tape): command = tape[ptr] if command == '^': stack.pop() elif command == '!': stack.append(0) elif command == '+': stack[-1] = (stack[-1] + 1) % 256 elif command == '-': stack[-1] = (s...

0.429064

class Solution: def hasAllCodes(self, s: str, k: int) -> bool: if len(s) < 2 ** k + k - 1: return False # Cannot be a string, as this is the de brujin length target = 2 ** k seen = set() cur_len = 0 for end in range(k, len(s) + 1): chunk = s[end - k: e...

0.428827

def abacaba(k): return next(chr(97+i) for i,d in enumerate(f'{k:b}'[::-1]) if d=='1')

0.428771

def mobile_keyboard(s): lookup = { c: i for s in "1,2abc,3def,4ghi,5jkl,6mno,7pqrs,8tuv,9wxyz,*,0,#".split(",") for i, c in enumerate(s, start=1) } return sum(lookup[c] for c in s)

0.428526

import base64 import binascii import math from itertools import zip_longest def adFly_decoder(sc): code1 = "" code2 = "" flip = False for c in sc: if flip: code2 += c else: code1 += c flip = not flip try: url = base64.b64decode(code1 + code2...

0.428461

def interpreter(tape): memory, ptr, output, iCmd = {}, 0, "", 0 while True: cmd = tape[iCmd] if cmd == ">": ptr += 1 elif cmd == "<": ptr -= 1 elif cmd == "+": memory[ptr] = (memory.get(ptr, 0) + 1) % 256 elif cmd == "-": memory[ptr] = (memory.get(ptr, 0) - 1) ...

0.427805

from itertools import cycle def encode(message, key): return [ord(a) - 96 + int(b) for a,b in zip(message,cycle(str(key)))]

0.427633

class Solution: def isValid(self, code): """ :type code: str :rtype: bool """ def parseTag(src, i): j = i tag, i = findtag(src, i) if not tag: return False, j res, i = parseContent(src, i) ...

0.427534

def parse(data): value = 0 res=[] for c in data: if c=="i": value+=1 elif c=="d": value-=1 elif c=="s": value*=value elif c=="o": res.append(value) return res

0.427529

def simplify(p): new_p=[(0,0)] new_str='' x=0 y=0 for i in p: if i == '<': x-=1 elif i == '>': x+=1 elif i == '^': y+=1 elif i == 'v': y-=1 if (x,y) not in new_p: new_p.append((x,y)) new_s...

0.427503

# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right import re class Solution: def recoverFromPreorder(self, S: str) -> TreeNode: itera = re.finditer(r'(-*)(\\d+)', S) ...

0.426398

from pprint import * uni= {'q': '\u2655', 'B': '\u265D', 'p': '\u2659', 'K': '\u265A', 'N': '\u265E', 'Q': '\u265B', 'P': '\u265F', 'R': '\u265C', 'n': '\u2658', 'r': '\u2656', 'b': '\u2657', 'k': '\u2654', 1:"\u2587",0:"\uFF3F"} def parse_fen(string): board=[[1,0...

0.425956

class Solution: def calculate(self, s): """ :type s: str :rtype: int """ res = 0 num = 0 sign = 1 stk = [] for c in s: if c.isdigit(): num = 10 * num + (ord(c) - ord('0')) elif c == '+': ...

0.42591

import re def calculate(input): try: return eval(re.sub(r'(\d+)', lambda m: str(int(m.group(1))), input)) except: return False

0.4259

import re def inside_out(s): return re.sub(r'\S+', lambda m: inside_out_word(m.group()), s) def inside_out_word(s): i, j = len(s) // 2, (len(s) + 1) // 2 return s[:i][::-1] + s[i:j] + s[j:][::-1]

0.425077

#CHAR_TO_MORSE preloaded to convert characters into Morse code CODE = {'A': '.-', 'B': '-...', 'C': '-.-.', 'D': '-..', 'E': '.', 'F': '..-.', 'G': '--.', 'H': '....', 'I': '..', 'J': '.---', 'K': '-.-', 'L': '.-..', 'M': '--', 'N': '-.', 'O': '---', ...

0.424737

def esrever(s): return s[:-1][::-1] + s[-1] if s else ''

0.424165

def split_exp(n): dot = n.find('.') if dot == -1: dot = len(n) return [d+"0"*(dot-i-1) if i<dot else ".{}{}".format("0"*(i-dot-1), d) for i,d in enumerate(n) if i != dot and d != '0']

0.424128

def reverse_fizzbuzz(s): if s == 'Fizz': return [3] if s == 'Buzz': return [5] if s == 'Fizz Buzz': return [9, 10] if s == 'Buzz Fizz': return [5, 6] if s == 'FizzBuzz': return [15] s = s.split() for i in range(len(s)): if s[i].isdigit(): start = int(s[i]) - i ...

0.424096

class Solution: def reverseParentheses(self, s: str) -> str: stack = [] curr = '' for c in s: if c=='(': stack.append(curr) curr = '' stack.append('(') elif c==')': stack.append(curr) ...

0.42355

splitSentence=str.split

0.423389

def tongues(code): AsT = "" for i in code: if i == "i": AsT = AsT + "o" elif i == "t": AsT = AsT + "n" elif i == "a": AsT = AsT + "e" elif i == "d": AsT = AsT + "r" elif i == "f": AsT = AsT + "g" elif i =...

0.423136

import sys def main(): s = sys.stdin.readline save = {' ': '%20', '!': '%21', '$': '%24', '%': '%25', '(': '%28', ')': '%29', '*': '%2a'} string = s().strip() while True: output = [] if '#' in string: return for i in string: if i in save: o...

0.421963

#!/usr/bin/env python import base64 exec(base64.b64decode(b'Cm4gPSBpbnQoaW5wdXQoKSkKZ3JhcGggPSBbW2ludCh4KSBmb3IgeCBpbiBpbnB1dCgpLnNwbGl0KCldIGZvciBfIGluIHJhbmdlKG4pXQpkaXN0ID0gW3Jvd1s6XSBmb3Igcm93IGluIGdyYXBoXQoKZm9yIGsgaW4gcmFuZ2Uobik6CiAgICBmb3IgaSBpbiByYW5nZShuKToKICAgICAgICBmb3IgaiBpbiByYW5nZShuKToKICAgICAgICAgI...

0.421854

ghostbusters = lambda s: (s.replace(' ','') if (' ' in s) else "You just wanted my autograph didn't you?")

0.421344

import re def reversi_row(moves): row = '........' stones = '*O' for i, m in enumerate(moves): L, M, R = row[:m], stones[i%2], row[m+1:] if R!='' and R[0] == stones[(i+1)%2] and R.find(stones[i%2])>0 and '.' not in R[:R.find(stones[i%2])]: R = R.replace(stones[(i+1)%2], stones[i%...

0.421119

c='black brown red orange yellow green blue violet gray white'.split() def encode_resistor_colors(ohms_string): ohms = str(int(eval(ohms_string.replace('k', '*1000').replace('M', '*1000000').split()[0]))) return '%s %s %s gold' % (c[int(ohms[0])], c[int(ohms[1])], c[len(ohms[2:])])

0.420481

There are n engineers numbered from 1 to n and two arrays: speed and efficiency, where speed[i] and efficiency[i] represent the speed and efficiency for the i-th engineer respectively. Return the maximum performance of a team composed of at most k engineers, since the answer can be a huge number, return this modulo 10^...

class Solution: def maxPerformance(self, n: int, speed: List[int], efficiency: List[int], k: int) -> int: mod = 10**9+7 order = sorted(range(n), key=lambda i: efficiency[i], reverse=True) heap = [] filled = 0 rec = 0 speed_sum = 0 for i in order: ...

0.856324

import math n, k = [int(x) for x in input().split()] a = [int(x) for x in input().split()] b = [int(x) for x in input().split()] c = 1 for i in range(n // k): count = (10 ** k - 1) // a[i] + 1 mmin = b[i] * (10 ** (k-1)) mmax = (b[i] + 1) * (10 ** (k-1)) - 1 mcount = mmax // a[i] - math.ceil(mmin / a...

0.693728

class Solution: def kConcatenationMaxSum(self, arr: List[int], k: int) -> int: oneArrSum = sum(arr) twoArr = arr + arr def findMaxSub(array): if len(array) == 1: return array[0] cur = 0 small = 0 ret = -999...

0.673524

n, k = [int(x) for x in input().strip().split(" ")] p = 10**9 + 7 num_list = [int(x) for x in input().strip().split(" ")] num_list = sorted(num_list, reverse = True) ans = 1 l_idx = 0 r_idx = -1 if num_list[0] < 0 and k % 2 == 1: for i in range(k): ans = (ans * num_list[i]) % p else: while True: if k >= ...

0.653492

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools import time,random sys.setrecursionlimit(10**7) inf = 10**20 eps = 1.0 / 10**10 mod = 10**9+7 mod2 = 998244353 dd = [(-1,0),(0,1),(1,0),(0,-1)] ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)] def LI(): return lis...

0.635648

n,k, q = list(map(int, input().split())) mod = 10 ** 9 + 7 A = [0] * n a, b, c, d, e, f, r, s, t, m, x = list(map(int, input().split())) A[0] = x for x in range(1, n): if pow(t, x+1, s) <= r: A[x] = (a*pow(A[x-1], 2, m) + b*A[x-1] + c) % m else: A[x] = (d*pow(A[x-1], 2, m) + e*A[x-1] + f) % m def SRMQ(arr, ...

0.628149

f = 5003*[0] modn = 1000000007 def qPow(a, b): nonlocal modn res = 1 while b > 0: if (b & 1) == 1: res = res * a % modn a = a * a % modn b = b >> 1 return res def getF(): nonlocal f f[0] = 1 for i in range(1, 5001): f[i] = f[i-1] * i def __starting_point(): getF() T = int(input()) while T > 0...

0.626249

fact = [] fact.append(1) for i in range(1,100001): fact.append((i*fact[i-1])%1000000007) def power(a,b,p): x=1 y=a while(b>0): if(b%2 == 1): x=(x*y) if(x>p): x=x%p y=(y*y) if(y>p): y=y%p b=b/2 return x def inverse(N,p): return power(N,p-2,p) def combination(N,R,p): return (fact[N]*((...

0.622633

import sys import numpy as np sr = lambda: sys.stdin.readline().rstrip() ir = lambda: int(sr()) lr = lambda: list(map(int, sr().split())) MOD = 10 ** 9 + 7 N, K = lr() M = int(N**.5) # M+1以上で、Nを割るとxになるもの upper_cnt = np.zeros(M+1, dtype=np.int64) # 1-indexed A = np.arange(M+1, dtype=np.int64) upper_cnt[1:] = N // A[1...

0.621778

n, k = map(int, input().split()) t = list(map(int, input())) p, d = 1, 10 ** 9 + 7 s, f = 0, [1] * n for i in range(2, n): f[i] = (i * f[i - 1]) % d c = lambda a, b: 0 if a > b else (f[b] * pow(f[a] * f[b - a], d - 2, d)) % d if k: u = [0] * (n + 1) p = [1] * (n + 1) for i in range(n): u[i] = (p[i] ...

0.615744

n, k = list(map(int, input().split())) m = 0x3b9aca07 v = 500000004 r = 0 p = pow(2, n, m) a = [1] + [0] * k for i in range(k): for j in range(i, -1, -1): a[j + 1] += a[j] a[j] = a[j] * j % m for i in range(k + 1): r = (r + p * a[i]) % m p = p * v * (n - i) % m print(r)

0.608828

class Solution: def maxSum(self, nums1: List[int], nums2: List[int]) -> int: d2 = {nums2[i]:i for i in range(len(nums2))} _nums1 = [] _nums2 = [] prev_i, prev_j = 0, 0 for i in range(len(nums1)): if nums1[i] in d2: _nums1.append(sum(nums1[prev_i:i]...

0.608472

# cook your dish here for _ in range(int(input())): n,k = list(map(int,input().split())) mod = 10**9+7 s=0 for i in range(1,n+1): p = pow(k,(2*i)-1,mod) # print(p) s=(s+p)%mod # print(k) k = (p*k)%mod print(s)

0.608467

n, k = map(int, input().split()) l = [(0, 0) for i in range(k)] for i in range(k): start, end = map(int, input().split()) l[i] = start, end dp = [0 for i in range(n+1)] prefixSum = [0 for i in range(n+1)] dp[1] = 1 prefixSum[1] = 1 for i in range(2, n + 1): for j in range(k): start, end = l[j] ...

0.606635

n,k=list(map(int, input().split())) s=0 for i in range(k,n+2): s+=i*(n-i+1)+1 print((s%(10**9+7)))

0.606145

class Solution: def maxSumRangeQuery(self, nums: List[int], requests: List[List[int]]) -> int: count = [0] * (len(nums) + 1) for start, end in requests: count[start] += 1 count[end + 1] -= 1 for i in range(1, len(nums) + 1): count[i] += count[i - 1] count.pop() res = 0 for n...

0.60518

N, K = map(int, input().split()) S = []; T = [] for x in range(1, int(N**.5)+1): if N % x == 0: S.append(x) if x*x < N: T.append(N//x) T.reverse() S += T M = len(S) U = [] MOD = 10**9 + 7 ans = 0 v = 0 for i in range(M): x = S[i] v = pow(K, (x+1)//2, MOD) for j in range(i): ...

0.603242

def norm(x): return (x % 998244353 + 998244353) % 998244353 n, k = map(int, input().split()) dp1 = [0] dp2 = [0] for i in range(n): l = [1] cur = 0 for j in range(n + 1): cur += l[j] if(j > i): cur -= l[j - i - 1] cur = norm(cur) l.append(cur) dp1.appen...

0.601058

n,k=[int(i) for i in input().split()] l=[int(i) for i in input().split()] cons=int(5e5+1) mod=10**9+7 tpa=[1 for i in range(cons)] tpa[0]=1 for i in range(1,cons): tpa[i]=(tpa[i-1]*2)%mod if k>n: print(tpa[n-1]) else: il=[[]for i in range(k+1)] for i in range(n): if l[i]<=k: il[l[i]]...

0.598617

(N), *D = [list(map(int, s.split())) for s in open(0)] V = D[0] A = V.pop(N[0]-1) M = 1000000000 + 7 R=0 for value in reversed(V): R = R + ((A) * value) % M A = A + value print(R % M)

0.598178

cases = int(input()) for case in range(cases): N, M, K = [int(i) for i in input().split()] A = [int(i) for i in input().split()] jad = 0 P = M*K for milk in A: if(milk>P): jad += milk-P else: jad += milk%K print(jad%1000000007)

0.598111

mod=10**9+7 def fibonacci(n): if n < 0: raise ValueError("Negative arguments not implemented") return (_fib(n)[0]%mod + mod)%mod; def _fib(n): if n == 0: return (0, 1) else: a, b = _fib(n // 2) c = (a * (b * 2 - a))%mod d = (a * a + b * b)%mod if n % 2 == 0: return (c, d) else: return (d, c + d)...

0.595034

# cook your dish here from collections import Counter def solve(arr, n, k): ans = 0 dict1 = {} mod = 1000000007 for i in range(n): if arr[i] in dict1: dict1[arr[i]] += 1 else: dict1[arr[i]] = 1 l1 = [0]+list(dict1.keys()) v = min(k, len(l1)) dp = [[0 for _ in range(v+1)]for _ in range(len(l1))] dp[...

0.592206

import sys readline = sys.stdin.readline T = int(readline()) MOD = 998244353 Ans = [None]*T for qu in range(T): N, K = map(int, readline().split()) A = [0] + list(map(int, readline().split())) + [0] B = list(map(int, readline().split())) C = [None]*(N+1) for i in range(1, N+1): C[A[i]] = i...

0.589822

mod = int(1e9) + 7 # <-- input modulo maxf = 500000 # <-- input factional limitation def make_fact(n, k): tmp = n perm = [i for i in range(k)] L = [0 for _ in range(k)] for i in range(k): L[i] = tmp % (i + 1) tmp //= i + 1 LL = [0 for _ in range(k)] for i in range(k): ...

0.589405

P = 10**9 + 7 n, k = list(map(int, input().split())) print(n + 1 if k == 1 else (k * pow(2 * k - 1, n, P) - pow(k, n, P)) * pow(k - 1, P - 2, P) % P)

0.589245

n,k=map(int,input().split()) L=list(map(int,input().split())) ind=[] for i in range(n): if L[i]>n-k:ind.append(i) m=1 for i in range(len(ind)-1): m*=(ind[i+1]-ind[i]) m%=998244353 print(((n*(n+1)//2)-((n-k)*((n-k)+1))//2),m)

0.58788

class Solution: def profitableSchemes(self, G: int, P: int, group: List[int], profit: List[int]) -> int: MOD = 10**9 + 7 group_len, profit_len = len(group),len(profit) dp = [[0]*(G+1) for _ in range(P+1)] dp[0][0] = 1 for pro, gro in zip(profit,group): dp2 = [x[:]...

0.586679

import bisect,collections,copy,heapq,itertools,math,numpy as np,string,sys def I(): return int(sys.stdin.readline().rstrip()) def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) def S(): return sys.stdin.readline().rstrip() def LS(): return list(sys.stdin.readline().rstrip().split()) class UnionFind(...

0.582973

n,N,MOD,ans=int(input()),int(1e6+5),int(1e9+7),0 cnt,pw,f=[0]*int(N),[1]*(n+1),[0]*int(N) for i in range(n): pw[i+1]=pw[i]*2%MOD for i in input().split(): cnt[int(i)]+=1 for i in reversed(range(2,N)): t=sum([cnt[j] for j in range(i,N,i)]) if t: f[i]=t*pw[t-1]%MOD for j in range(i*2,N,i): f[i]=(f[i]-f[j])%MOD...

0.580133

n,k=map(int,input().split()) mod=998244353 dp=[0]*(n+1) dp[0]=1 for i in range(1,n+1): for j in range(i,-1,-1): dp[j]=dp[j-1] if 2*j<=i: dp[j]+=dp[2*j] dp[j]%=mod print(dp[k])

0.579093

__author__ = 'Prateek' MOD = int(10**9+7) def test(): n,k=list(map(int,input().split())) l = k d =n-1 ans = l-1 ans = ans%MOD a = k-n term = (d+a)//d ll = (a%MOD - (((term-1)%MOD)*(d%MOD))%MOD)%MOD if ll < 0: ll = (ll +MOD)%MOD m = ((term%MOD)*((a%MOD+ll%MOD)%MOD))%MOD m = (m*pow(2,MOD-2,MOD))%MOD ans +...

0.578807

n,k=list(map(int,input().split())) M=10**9+7 print(k**~-k*pow(n-k,n-k,M)%M)

0.577308

ways=x=0 val=10**9 remi=((10**9)+7) t=int(input()) for i in range(t): n,k=list(map(int,input().split())) if t<=100 and n>=1 and k<=val: x=(k-1)**(n-1) ways=k*x ways=ways%remi print(ways) x=ways=0 else: break

0.577004

A = [0] * 100001 M = 1000000007 def nCk(n, k): if k ==0 or k ==n: return 1 r = (A[n-k]*A[k])%M x = (A[n]*pow(r, M-2, M))%M return x for _ in range(int(input())): n, k = list(map(int, input().split())) for i in range(n-1): u,v = input().split() summ = 0 A[0] = 1 for i in range(1, len(A)): A[i] = (i*A[i-...

0.576878

n, k = list(map(int, input().split())) MOD = 10**9+7 def fast_modinv(up_to, M): ''' Fast modular inverses of 1..up_to modulo M. ''' modinv = [-1 for _ in range(up_to + 1)] modinv[1] = 1 for x in range(2, up_to + 1): modinv[x] = (-(M//x) * modinv[M%x])%M return modinv maxn = 2*10**5 + 1...

0.576708

def main(): _, k, m = [int(x) for x in input().split()] a = [] last = ("-1", 0) a.append(last) for ai in input().split(): if last[0] == ai: last = (ai, last[1]+1) a[-1] = last else: last = (ai, 1) a.append(last) if last[1] == k...

0.576128

M=998244353 class Factorial: def __init__(self,n): self.f=f=[0]*(n+1) f[0]=b=1 for i in range(1,n+1):f[i]=b=b*i%M self.inv=inv=[0]*(n+1) inv[n]=b=pow(self.f[n],M-2,M) for i in range(n,0,-1):inv[i-1]=b=b*i%M def factorial(self,i): return self.f[i] def i...

0.575962

3 import sys from functools import lru_cache MOD = 1000000007 cnk = [[1 for i in range(1001)] for j in range(1001)] for i in range(1, 1001): for j in range(1, i): cnk[i][j] = cnk[i - 1][j - 1] + cnk[i - 1][j] k = int(input()) cs = [int(input()) for i in range(k)] ans = 1 sm = 0 for c in cs: sm += ...

0.575934

import numpy as np N,K = list(map(int,input().split())) A=np.array(list(map(int,input().split()))) mod = 998244353 fact = [1]*(K+1) for i in range(1,K+1): fact[i]=i*fact[i-1]%mod inv_fact = [pow(f,mod-2,mod) for f in fact] # r = [sum(pow(aa,t,mod) for aa in A)%mod for t in range(K+1)]##遅い r = [0]*(K+1) r[0] = N ...

0.575745

class Solution: def maxArea(self, h: int, w: int, horizontalCuts: List[int], verticalCuts: List[int]) -> int: mod = int(1e9)+7 return ( ( self.getMax(horizontalCuts, h) % mod ) * ( self.getMax(verticalCuts, w) % mod ) ) % mod def getMax(self, cuts, size): if len(cuts) == 1: ...

0.573435

mod=10**9+7 n,k=list(map(int,input().split())) A=[0]*(n+1) B=[0]*(n+1) C=[0]*(n+1) F=[0]*(n+1) G=[0]*(n+1) F[0]=G[0]=1 for i in range(1,n+1): G[i]=F[i]=F[i-1]*i%mod G[i]=pow(F[i],(mod-2),mod) for i in range(0,n): if i*2>n: break B[i]=(F[n-i]*G[i]*G[n-i*2])%mod for i in range(0,n//2+1): for j in range(0,n//2+1...

0.571997

def modfac(n, MOD): f = 1 factorials = [1] for m in range(1, n + 1): f *= m f %= MOD factorials.append(f) inv = pow(f, MOD - 2, MOD) invs = [1] * (n + 1) invs[n] = inv for m in range(n, 1, -1): inv *= m inv %= MOD invs[m - 1] = inv retur...

0.570977

import itertools k, m = list(map(int,input().split())) main_ar = [] for i in range(k): ar = list(map(int,input().split())) main_ar.append(ar[1:]) all_combination = itertools.product(*main_ar) result = 0 for single_combination in all_combination: result = max(sum([x*x for x in single_combination])%m,re...

0.570532

fa = [1] m = 251 P = 10**9+7 for i in range(1, m+1): fa.append(fa[-1] * i % P) fainv = [pow(fa[m], P-2, P)] for i in range(1, m+1)[::-1]: fainv.append(fainv[-1] * i % P) fainv = fainv[::-1] def C(a, b): return fa[a] * fainv[a-b] * fainv[b] % P N, K = list(map(int, input().split())) poK = [1] for i in range(251): poK.a...

0.570303

def multiple_input(): return map(int, input().split()) def list_input(): return list(map(int, input().split())) mod = int(1e9) + 7 for _ in range(int(input())): n, m = multiple_input() a = list_input() a.sort() max_level = a[-1] + 1 levels = [0] * max_level levels[0] = 1 for i in a: levels[i] += 1 ans = 1...

0.57019

input() t = list(map(int, input().split())) s, m = 0, 1000000007 p = {i for i, q in enumerate(t, 1) if q == -1} n, k = len(p), len(p - set(t)) d, c = 2 * (n & 1) - 1, 1 for j in range(n + 1): d = -d * max(1, j) % m if n - j <= k: s += c * d c = c * max(1, n - j) * pow(k - n + j + 1, m - 2, m) % ...

0.568828

def main(): import sys from collections import defaultdict tokens = [int(i) for i in sys.stdin.read().split()] tokens.reverse() n, k = tokens.pop(), tokens.pop() d1 = defaultdict(int) d2 = defaultdict(int) result = 0 for i in tokens: result += d2[i * k] ...

0.568045

def main(): p, k = list(map(int, input().split())) s = 1 m = pow(10,9)+7 if k == 0: s = pow(p,p-1,m) elif k == 1: s = pow(p,p,m) else: o = 1 n = k while n != 1: n = k*n %p o += 1 c = (p-1)//o s = pow(p,c,m) print(s%m) main()

0.565532

from math import sqrt, ceil MAX_N = 10 ** 6 * 2 prime = [] isPrime = [True for i in range(MAX_N)] for i in range(2, MAX_N): if isPrime[i]: prime.append(i) for j in range(i * i, MAX_N, i): isPrime[j] = False def factor(a): divs = [] for i in prime: cnt = 0 w...

0.564949

N,K,M=map(int,input().split());R=range;T=[[1]] for i in R(1,N): q=K*i if i>~i+N:T+=[y:=T[-1][:len(T[~i+N])]] else:T+=[y:=T[-1][:]+[0]*q] p=len(y)-i for j in R(p):y[j+i]+=y[j]%M for j in R(p-q):y[~j]-=y[~j-i-q]%M for i in R(N):print(sum(T[i][j]*T[~i+N][j]for j in R(len(T[i])))*-~K%M-1)

0.564384

from sys import stdin n, k = list(map(int, input().split())) our = list(map(int, input().split())) cap = set(map(int, input().split())) res = 0 sum_b = sum(our) for elem in cap: sum_b -= our[elem - 1] res += sum_b * our[elem - 1] for i in range(len(our)): if (i + 1) not in cap and (i + 1) % n + 1 not in c...

0.564127

n, k = map(int, input().split()) l, a = list(map(int, input().split())), list(map(int, input().split())) v, t, s = 0, 0, sum(l) for i in range(n): l[i] -= a[i] L, A = [l[0]], [a[0]] for i in range(1, n): if a[i] <= A[-1]: L[-1] += l[i] else: A.append(a[i]) L.append(l[i]) for i in range(len(A...

0.564003

# cook your dish here mod = 10**9 + 7 for i in range(int(input())): n,k,m = tuple(map(int, input().split())) a = list(map(int, input().split())) ans = [0 for i in range(k+1)] ans[0] = 1 curr_ending = 1 for i in range(n): mod_a = a[i]%m start = curr_ending - (curr_ending%m - mod_a)%m ...

0.561109

n, k = list(map(int, input().split())) a = list(map(int, input().split())) mask = list(map(int, input().split())) result = sum(a[i] if mask[i] == 1 else 0 for i in range(n)) h = [a[i] if mask[i] == 0 else 0 for i in range(len(a))] best_awake = sum(h[:k]) curr = best_awake for j in range(k, n): curr += h[j] cu...

0.560824

import itertools import functools import operator N = 100001 P = 10**9 + 7 fact = [1] for i in range(1, N): fact.append(fact[-1] * i % P) inv = [0, 1] for i in range(2, N): inv.append(P - P // i * inv[P % i] % P) inv_fact = [1] for i in range(1, N): inv_fact.append(inv_fact[-1] * inv[i] % P) least_div = [-1] * N...

0.560793

import sys input = sys.stdin.readline import numpy as np MOD = 10**9 + 7 N,M,K = map(int,input().split()) def cumprod(arr): L = len(arr); Lsq = int(L**.5+1) arr = np.resize(arr,Lsq**2).reshape(Lsq,Lsq) for n in range(1,Lsq): arr[:,n] *= arr[:,n-1]; arr[:,n] %= MOD for n in range(1,Lsq): ...

0.55938

mod = 1000000007 def sum(x, y, k, add) : if k < add : return 0 up = x + add if up > k : up = k add = add + 1 return y * ( ( (add + up) * (up - add + 1) // 2 ) % mod ) % mod def solve(x, y, k, add = 0) : if x == 0 or y == 0 : return 0 if x > y : x, y = y, x pw = 1 while (pw ...

0.559228

# cook your dish here import bisect n, k1, *l = map(int, input().split()) v_l, b_l = l[:n], l[n:] b_inv = {key:[] for key in range(2*k1)} for i in range(n): b_l[i] -= 1 b_inv[b_l[i]].append(i) dp = [[0 for _ in range(n)] for _ in range(n)] for k in range(1, n): for j in range(n-2, -1, -1): ...

0.558125

import sys input = sys.stdin.readline MOD = 998244353 MAX = 5 * 10 ** 5 + 5 fact = [1] for i in range(1, MAX + 1): new = fact[-1] * i fact.append(new % MOD) invL = pow(fact[MAX],MOD-2,MOD) factInv = [invL] * (MAX + 1) for i in range(MAX - 1, -1, -1): old = factInv[i + 1] new = old * (i + 1) fa...

0.557469

rr = lambda: input().strip() rri = lambda: int(rr()) rrm = lambda: list(map(int, rr().split())) MOD = 10**9 + 7 class DSU: def __init__(self, N): #R * C is the source, and isn't a grid square self.par = list(range(N+1)) self.rnk = [0] * (N+1) self.sz = [1] * (N+1) def find(self...

0.55685

import sys input = sys.stdin.readline n,m=map(int,input().split()) a=list(map(int,input().split())) b=list(map(int,input().split())) mod=998244353 sol=1 i=n-1 j=m-1 while sol>0 and j>=0: goal=b[j] s=0 r=False while i>=0 and a[i]>=goal: if r: s+=1 else: if a[i]==go...

0.55678

def __starting_point(): a=[int(x) for x in input().split()] N=a[0] A=a[1] B=a[2] K=a[3] s=input() mod = 1000000009 Q = pow(B*pow(A,mod-2,mod)%mod,K,mod) if Q!=1: D = (pow(Q,(N+1)//K,mod)-1)*pow(Q-1,mod-2,mod)%mod else: D = (N+1)//K ans=0 C = pow(A,N,mod) A=pow(A,mod-2,mod) for i in range(K): if s[i]...

0.556512

def main(): f= [1] for i in range(1,1000002): f.append((f[-1] * i)%1000000007) n = int(input()) a = sorted(int(x) for x in input().split()) sol = 0 j = 0 s = 1 sq = 1 for i in range(n - 1): sq = sq * (n - i) % 1000000007 if a[i] != a[i + 1]: ...

0.556468

3 # Copyright (C) 2017 Sayutin Dmitry. # # This program is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License as # published by the Free Software Foundation; version 3 # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY;...

0.556362

p = 1000000007 n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) m = int(input()) d = [1] * 300001 td = [0] * 300001 L = b[0] for i in range(1, n): if a[i - 1] != 1: t = m % a[i - 1] if L < t: print(0) return m //= a[i - 1] for j in range((L - t) // a[i - 1] + 1):...

0.556197

k, pa, pb = list(map(int, input().split())) MOD = 10**9 + 7 INF = ((pa + pb) * pow(pb, MOD-2, MOD)) % MOD rAB = pow(pa+pb, MOD-2, MOD) rB = pow(pb, MOD-2, MOD) memo = {} def dfs(a, ab): if ab >= k: return ab if a + ab >= k: #return INF #return (pa + pb) / pb return ((a + MOD-1...

0.555356

from functools import reduce def comb(n, max_k, mod): """ (n,k) := n個からk個選ぶ組み合わせ k = 0~max_Kまでを計算して返す """ res = [1]*(max_k+1) t = 1 for i in range(max_k+1): res[i] *= t t *= n-i t %= mod n = reduce(lambda x,y: (x*y)%mod, range(1,max_k+1), 1) n = pow(n,-1, mod...

0.554443

from sys import stdin, stdout, exit mod = 10**9 + 7 def modinv(x): return pow(x, mod-2, mod) N = 2*10**5 + 10 facts = [1]*N for i in range(1,N): facts[i] = facts[i-1] * i facts[i] %= mod def binom(n, k): ans = modinv(facts[k]) * modinv(facts[n-k]) ans %= mod ans *= facts[n] ans %= mod ...

0.554066

P,a,I=998244353,1,input n=int(I()) d=list(map(int,I().split())) s=sum(d)%P for i in d:a=a*i%P for i in range(n,2*n-2):a=a*(s-i)%P print(a)

0.554051

class Solution: def dieSimulator(self, n: int, rollMax: List[int]) -> int: a,b,m=[deque([0]*x) for x in rollMax],[1]*6,1000000007 for x in a: x[-1]=1 for _ in range(n-1): s=sum(b)%m for i,x in enumerate(a): x.append((s-b[i])%m) b[i]=(b[...

0.553658

from functools import lru_cache N, K = list(map(int, input().split())) P = 998244353 A = [K+100] + [int(a) for a in input().split()] + [K+j for j in range(1, 10)] # A = [K+100] + [1, 2] + [-1 for a in range(N-4)] + [3,4]+ [K+j for j in range(1, 10)] X = [[0,0] for _ in range(N//2+5)] X[0][0] = 1 for i in range(1, N//2...

0.552801

import sys mod = 10**9 + 7 for _ in range(int(input())): x = int(input()) s = list(map(int, input())) ans = len(s) for i in range(1, x+1): ans = (i + (ans-i) * s[i-1]) % mod r = len(s) for _ in range(s[i-1]-1): if len(s) < x: s += s[i:r] e...

0.552242

def prepare(n, MOD): # 1! - n! の計算 f = 1 factorials = [1] # 0!の分 for m in range(1, n + 1): f *= m f %= MOD factorials.append(f) # n!^-1 の計算 inv = pow(f, MOD - 2, MOD) # n!^-1 - 1!^-1 の計算 invs = [1] * (n + 1) invs[n] = inv for m in range(n, 1, -1): ...

0.551473

# cook your dish here T=int(input()) MOD=int(1e9+7) for t in range(T): N,K=[int(a) for a in input().split()] M=K//2 # ans= ((K%2)?( (N+M)*(N+M) + M ):( (N+M)*(N+M) - M) ) ans=(N+M)*(N+M) -M if(K%2): ans+=2*M if(N==0): ans=K*(K-1) print(ans%MOD)

0.546959

x,y=map(int, input().split()) A=list(map(int, input().split())) B=list(map(int, input().split())) A,B=sorted(A)[::-1],sorted(B)[::-1] mod=10**9+7 X,Y=0,0 for i in range(x): d=A[i]*(x-i)-A[i]*(i)-A[i] X+=d X%=mod for i in range(y): d=B[i]*(y-i)-B[i]*(i)-B[i] Y+=d Y%=mod print(X*Y%mod)

0.545857

p = 10 ** 9 + 7 n, b, k, x = [int(s) for s in input().split()] block = [int(s) for s in input().split()] D = [0 for i in range(10)] for s in block: D[s] += 1 A = [[0 for t in range(x)]] pows = [pow(10, 1<<j, x) for j in range(b.bit_length())] for i in range(10): A[0][i%x] += D[i] for j in range(b.bit_length()-1...

0.545541

def main(): n, k = list(map(int, input().split())) cnt = [[[0] * 21 for _ in (0, 1)] for _ in range(n + 1)] edges, mod = [[] for _ in range(n + 1)], 1000000007 for _ in range(n - 1): u, v = list(map(int, input().split())) edges[u].append(v) edges[v].append(u) def dfs(u, f): ...

0.545215

n, m, k = map(int, input().split()) mod = 998244353 def powerDX(n, r, mod): if r == 0: return 1 if r%2 == 0: return powerDX(n*n % mod, r//2, mod) % mod if r%2 == 1: return n * powerDX(n, r-1, mod) % mod def cmb(n, r, mod): if ( r<0 or r>n ): return 0 r = min(r, n-r) return g1[n] * g2...

0.544369

MOD=10**9+7 N,C=map(int, input().split()) A=list(map(int, input().split())) B=list(map(int, input().split())) P=[[1] for _ in range(401)] for _ in range(1,401): for i in range(1,401): P[i].append(P[i][-1]*i%MOD) R=[[] for _ in range(N)] for i,AB in enumerate(zip(A, B)): AA,BB=AB for a in range(401):...

0.544113

m = 1000000007 (t, k) = [int(i) for i in input().split(' ')] n = 100000 dp=[0]*(n+1) dp[0] = 1 for i in range(1, n+1): dp[i] = (dp[i-1] + (0 if i-k < 0 else dp[i-k])) % m s = [0]*(n+1) s[1] = dp[1] s[0] = 0 for i in range(2, n+1): s[i] = (s[i-1] + dp[i]) % m for _ in range(t): (a, b) = [int(i) for i...

0.543998

import sys input = sys.stdin.readline MOD = 10 ** 9 + 7 t = int(input()) for _ in range(t): n, p = list(map(int, input().split())) l = list(map(int, input().split())) if p == 1: print(n % 2) else: l.sort(reverse = True) curr = l[0] out = 0 real = True f...

0.543628

from functools import reduce def modpow(a, n, m): if n == 0: return 1 tmp = modpow(a, n // 2, m) if n % 2 == 0: return tmp * tmp % m else: return tmp * tmp * a % m def modinv(a, m): return modpow(a, m - 2, m) n, m = [int(_) for _ in input().split(' ')] s = sum([int(_) for ...

0.543071

def two_by_n(n, k): vv, vh, hv, hh = k-1, (k-1)*(k-2), k-2, (k-1)*(k-2) + 1 va, ha, vb, hb = 0, 0, 1, 1 for i in range(n - 1): va, ha, vb, hb = vb, hb, vv*vb + vh*ha, hv*vb + hh*ha return (k * vb + k*(k-1) * ha) % 12345787

0.542893

class Solution: def sumSubseqWidths(self, A: List[int]) -> int: A.sort() ret, mod, p = 0, 10 ** 9 + 7, 1 for i in range(len(A)): ret += (A[i] - A[len(A) - i - 1]) * p % mod p = (p << 1) % mod return ret % mod

0.541055

import math p=7+10**9 n,k=list(map(int,input().split())) c=math.factorial(n+k-1)//((math.factorial(k))*(math.factorial(n-1))) print(c%p)

0.540735

n, m, k = map(int, input().split()) if k == -1 and n % 2 != m % 2: print(0) else: print(pow(2, (n - 1) * (m - 1), 10**9 + 7))

0.540708

from collections import defaultdict import sys input = sys.stdin.readline ''' for CASES in range(int(input())): n, m = map(int, input().split()) n = int(input()) A = list(map(int, input().split())) S = input().strip() sys.stdout.write(" ".join(map(str,ans))+"\n") ''' inf = 100000000000000000 # 1e17 mod = 998244353 n,...

0.539286

import sys input = sys.stdin.readline def main(): n, m, k = map(int, input().split()) half = m // 2 se_s = [] for i in range(n): lst = list(map(int, input().split())) lst.sort(reverse = True) total_sub = sum(lst[:half]) dp = [[0 for _ in range(k)] for _ in range(half + 1...

0.539222

n = int(input()) a = list(map(int, input().split())) aord = sorted([i for i in range(n)], key=lambda x: a[x] * (n - x) * (x + 1)) b = sorted(map(int, input().split()))[::-1] new_b = [0] * n for i in range(n): new_b[aord[i]] = b[i] b = new_b m = 998244353 c = [0] * n for i in range(n): c[i] = a[i] * b[i] % m...

0.53886

from scipy.special import comb mod = 10**9 + 7 N, K = list(map(int,input().split())) for i in range(1,K+1): a = K-i b = i-1 c = N-(i-1)-K d = i print((comb(a+b,b,exact=True)*comb(c+d,d,exact=True)%mod))

0.538644

class Solution: def rangeSum(self, nums: List[int], n: int, left: int, right: int) -> int: # B: partial sum of A # C: partial sum of B # Use prefix sum to precompute B and C A = nums B, C = [0] * (n + 1), [0] * (n + 1) for i in range(n): B[i + 1] = B[i] + ...

0.537464

n, k = list(map(int, input().split())) A = list(map(int, input().split())) cumsum = [0] for a in A: cumsum.append(cumsum[-1] + a) #print(cumsum) pows = set([k**i for i in range(50)]) cum = dict({}) cum[0] = 1 res = 0 for x in cumsum[1:]: for pow in pows: if (x - pow) in cum: res += cum[x -...

0.537161

import numpy as np n,s=map(int,input().split()) a=list(map(int,input().split())) mod=998244353 dp=np.zeros([n+1,s+1],int) dp[0][0]=1 for i in range(1,n+1): dp[i][:]=dp[i-1][:]*2 dp[i][a[i-1]:]+=dp[i-1][:-a[i-1]] dp[i][:]%=mod print(dp[n][s])

0.537144

def vasya_and_array(): n,k,leng = [int(x) for x in input().split()] if(leng==1): return 0 a = [int(x) for x in input().split()] mod = 998244353 a.insert(0,0) dp = [[0 for x in range((k+1))] for y in range(n+1)] sumdp = [0 for _ in range(n+1)] sumdp[0]=1 count = [0 for _ in ra...

0.536097

d = 10**9 + 7 t = int(input()) while t: t-=1 n =int(input()) p =list(map(int, input().strip().split())) a =list(map(int, input().strip().split())) b =list(map(int, input().strip().split())) ans = 1 for i in range(n): c = a[i] - b[i] + 1 tmp = (( pow(p[i],b[i]...

0.535955

from sys import stdin,stdout from math import gcd for _ in range(int(stdin.readline())): # n=int(stdin.readline()) k-pieces n,k=list(map(int,stdin.readline().split())) a=list(map(int,stdin.readline().split())) gr=[[0 for _ in range(n)]for _ in range(n)];ans=0;k-=1 for sz in range(n): ...

0.535566

n,k=list(map(int,input().split())) mod=998244353 NEXT={(0,1):2,(1,2):2}#ww or wh,point k,場合の数 for i in range(1,n): NOW=NEXT NEXT=dict() for key in NOW: if key[0]==0: if k-(n-i)*2<=key[1]<=k: NEXT[key]=NEXT.get(key,0)+NOW[key] if k-(n-i)*2<...

0.534749

n, m = map(int, input().split()) t = sorted(map(int, input().split())) f, d = [1] * (n + 1), 1000000007 for i in range(2, n + 1): f[i] = (f[i - 1] * i) % d p, q = 0, (f[t[0] - 1] * f[n - t[-1]]) % d for i in range(m - 1): l = t[i + 1] - t[i] - 1 q = (q * f[l]) % d if l > 1: p += l - 1 print(pow(2, p, d) * f...

0.53366

#q = int(input()) #x, y = map(int,input().split(' ')) #print (' '.join(list(map(str, s)))) def extended_gcd(aa, bb): lastremainder, remainder = abs(aa), abs(bb) x, lastx, y, lasty = 0, 1, 1, 0 while remainder: lastremainder, (quotient, remainder) = remainder, divmod(lastremainder, remainder) ...

0.533335

x, k = map(int, input().split()) if x == 0: print(0) else: mod = 10 ** 9 + 7 p = pow(2, k, mod) ans = (x * (p * 2) - (p - 1)) % mod print(ans)

0.533315

We have jobs: difficulty[i] is the difficulty of the ith job, and profit[i] is the profit of the ith job. Now we have some workers. worker[i] is the ability of the ith worker, which means that this worker can only complete a job with difficulty at most worker[i]. Every worker can be assigned at most one job, but one ...

class Solution: def maxProfitAssignment(self, difficulty: List[int], profit: List[int], worker: List[int]) -> int: ws = sorted(worker, reverse=True) dp = sorted(zip(difficulty, profit), key=lambda x: x[1], reverse=True) # print(list(dp)) i = 0 total = 0 for w...

0.851876

class Solution: def jobScheduling(self, startTime: List[int], endTime: List[int], profit: List[int]) -> int: # max profit ending at time t dp = [(0,0)] task = [(startTime[i], endTime[i], profit[i]) for i in range(len(startTime))] task = sorted(task, key = lambda x: ...

0.705669

from typing import * from heapq import heappop, heappush class Solution: def mincostToHireWorkers(self, quality: List[int], wage: List[int], K: int) -> float: N = len(quality) heap_quality = [] workers = [i for i in range(N)] workers = sorted(workers, key=lambda x: wage[x] / qualit...

0.591059

import sys sys.setrecursionlimit(1000000000) input = sys.stdin.readline n,w=map(int,input().split()) knap=[[] for i in range(4)] w0,v=map(int,input().split()) knap[0].append(v) for i in range(n-1): W,v=map(int,input().split()) knap[W-w0].append(v) for i in range(4): knap[i].sort(reverse=1) knap[i]=[0]+k...

0.568334

def least_bribes(bribes): mem = {} def s(n1, n2): if n1 >= n2: return 0 if (n1, n2) in mem: return mem[n1, n2] r = min(bribes[i] + max(s(n1, i), s(i + 1, n2)) for i in range(n1, n2)) mem[n1, n2] = r return r return s(0, len(bribes))

0.549122

class Solution: def maxProbability(self, n: int, edges: List[List[int]], probs: List[float], s: int, t: int) -> float: # first build the graph graph = {u: {} for u in range(n)} for (u, v), prob in zip(edges, probs): graph[u][v] = prob graph[v][u] = prob # run...

0.541884

m = list(map(int, input().split())) w = list(map(int, input().split())) a = [500, 1000, 1500, 2000, 2500] v = list(map(int, input().split())) ans = 0 for i in range(len(m)): ans += max(0.3 * a[i], (1 - m[i] / 250) * a[i] - 50 * w[i]) ans += v[0] * 100 ans -= v[1] * 50 print(int(ans))

0.538414

class Solution: def maxProfit(self, prices): profits = 0 ln = len(prices) if not ln: return 0 elif ln == 2: return (prices[1]-prices[0]) if prices[1] > prices[0] else 0 lastPrice = prices[0] for price in prices: if lastPr...

0.537483

# returns answer to the subproblem with interval range [start, end], # but with a total of "extra" additional stuff on the end # that must be deleted last. memo = {} def f(dat, rewards, start, end, extra): curr = (start, end, extra) if curr in memo: return memo[curr] if start > end: re...

0.535311

class Solution: def shoppingOffers(self, price, special, needs): """ :type price: List[int] :type special: List[List[int]] :type needs: List[int] :rtype: int """ def dfs(curr, special, needs): p=curr+sum(p*needs[i] for i,p in enumerate(pri...

0.53466

class Solution: def largestValsFromLabels(self, values: List[int], labels: List[int], num_wanted: int, use_limit: int) -> int: # my solution ... 128 ms ... 99 % ... 17.9 MB ... 85 % # time: O(nlogn) # space: O(n) l2v = collections.defaultdict(list...

0.534061

'''Well I found the bug, but I don't understand why it was doing that. I mean, as far as I can tell, it shouldn't be a bug! Note to self: deleting from (supposedly) local lists through recursion is dangerous!''' class Group(object): def __init__(self,size,start,end,value): self.size = size self.sta...

0.533923

def solve(arr): p, q = 1, 1 for k in arr: x, y = max(k), min(k) a = p * x b = q * x c = p * y d = q * y p = max(a, b, c, d) q = min(a, b, c, d) return max(p, q)

0.532188

def pack_bagpack(scores, weights, capacity): load = [0] * (capacity + 1) for score, weight in zip(scores, weights): load = [max(l, weight <= w and load[w - weight] + score) for w, l in enumerate(load)] return load[-1]

0.531943

class Solution: def minDifficulty(self, jobDifficulty: List[int], d: int) -> int: N = len(jobDifficulty) if N < d: return -1 dp = [jobDifficulty[0]] for j in jobDifficulty[1:]: dp.append(max(dp[-1], j)) for i in range(1, d): ...

0.527096

import sys n_discounts = int(sys.stdin.readline()) discount_values = [int(x) for x in sys.stdin.readline().split()] n_items = int(sys.stdin.readline()) item_values = [int(x) for x in sys.stdin.readline().split()] min_discount_req = 10000000 for discount_value in discount_values: min_discount_req = min(min_discoun...

0.52686

import sys input = sys.stdin.readline n,m=list(map(int,input().split())) A=list(map(int,input().split())) C=list(map(int,input().split())) P=list(map(int,input().split())) DP=[[-1<<30]*(n+1) for i in range(5001)] # DP[k][cnt] = Aのmaxがkで, そういう人間がcnt人いるときのprofitの最大値 for i in range(5001): DP[i][0]=0 for i in range...

0.525086

class Solution: def maxProfit(self, k, prices): """ :type k: int :type prices: List[int] :rtype: int """ length = len(prices) v = p = 0 pairs, profits = [], [] while p < length: v = p ...

0.524966

n = [ int(i) for i in input().split() ] p = [ int(i) for i in input().split() ] p = sorted(p) val = sum( p[:n[1]] ) print(val)

0.521622

n, k = list(map(int, input().split())) a = list(map(int, input().split())) d = list(map(int, input().split())) if k == 0: best = 0 curr = sum(a) for i in range(n): best = max(best, curr - d[i]) curr -= a[i] print(best) elif k == 1: best = sum(a[:-1]) - min(d[:-1]) other = s...

0.520262

from functools import reduce def crashing_weights(weights): return reduce(lambda a, b: [a1 + b1 if a1 > b1 else b1 for a1, b1 in zip(a, b)], weights)

0.520157

# import getpass import sys import math EPS = 0.000000001 files = True debug = False # if getpass.getuser() == 'frohenk' and files: # debug = True # sys.stdin = open("test.in") # # sys.stdout = open('test.out', 'w') # elif files: # # fname = "gift" # # sys.stdin = open("%s.in" % fname) # # sy...

0.517953

class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ tmax_profit = 0 rmax_profits = [0] * len(prices) rmax = -1 for ii in range(len(prices)-2, -1, -1): if (prices[rmax] - prices[ii] > rmax_profi...

0.51718

t = int(input()) for _ in range(t): p, f = [int(x) for x in input().split()] cs, cw = [int(x) for x in input().split()] s, w = [int(x) for x in input().split()] if s > w: s, w = w, s cs, cw = cw, cs best = 0 for i in range(cs + 1): if s*i <= p: war_me = min(...

0.516288

class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ n = len(prices) if n <=1: return 0 else: minprice = prices[0] res = 0 for i in range(1,n): if ...

0.515003

def queue_time(customers, n): l=[0]*n for i in customers: l[l.index(min(l))]+=i return max(l)

0.514777

class Solution: def deleteAndEarn(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums);#count is a dict [3,4,2]--> {2:1,3:1,4:1} prev = None; avoid = using = 0; for k in sorted(count): temp = ma...

0.512818

class Solution: def shipWithinDays(self, weights: List[int], D: int) -> int: left = max(weights) right = left * len(weights) // D while left < right: mid = left + (right - left) // 2 c = 0 d = 1 for w in weights: if c + w <= ...

0.509693

import sys input = sys.stdin.readline from itertools import permutations, accumulate import heapq import bisect from operator import itemgetter def dijkstra(start, edge): n = len(edge) dist = [0]*n que = [(0, start)] while que: d, v = heapq.heappop(que) if dist[v] < d: conti...

0.509654

# Codeforces Round #488 by NEAR (Div. 2) import collections from functools import cmp_to_key #key=cmp_to_key(lambda x,y: 1 if x not in y else -1 ) import math import sys def getIntList(): return list(map(int, input().split())) import bisect def makePair(z): return [(z[i], z[i+1]) for i in range(0,le...

0.509469

a=int(input()) b=int(input()) c=int(input()) d=int(input()) e=int(input()) f=int(input()) if e>=f: ans=min(a,d) d-=ans a-=ans ans*=e ans+=min(d,b,c)*f else: ans=min(d,b,c) d-=ans ans*=f ans+=min(a,d)*e print(ans)

0.508672

n, m = list(map(int, input().split())) prices = list(map(int, input().split())) auci = list(map(int, input().split())) scores = 0 # m auc # n - m default for i in range(len(prices)): if (i+1) not in auci: scores += prices[i] prices[i] = 0 ra = [] for i in prices: if i != 0: ra.appe...

0.507863

def max_profit(prices): m = best = float('-inf') for v in reversed(prices): m, best = max(m, best-v), max(best,v) return m

0.507546

from itertools import permutations as p def disc(a,b): for ai in a: for bi in b: if ai==bi: return False return True for i in range(eval(input())): n = eval(input()) arr = list(map(int,input().split())) perms = list(p(arr)) m = eval(input()) offer = {} for i in range(m): dup = list(map(int,input().s...

0.506626

class Cashier: def __init__(self, n: int, discount: int, products: List[int], prices: List[int]): self.n = n self.count = 0 self.discount = discount self.products = {} for i in range(0, len(products)): self.products[products[i]] = p...

0.506313

import heapq def max_product(a): x = heapq.nlargest(2,a) return x[0]*x[1]

0.506041

class Solution: def maxSatisfaction(self, satisfaction: List[int]) -> int: satisfaction.sort() total, res = 0,0 while satisfaction and satisfaction[-1]+total > 0: total += satisfaction.pop() res += total return res

0.505114

import sys import math import cProfile DEBUG = False def log(s): if DEBUG and False: print(s) def calc_dmg(num, arr): maximum = 0 if num - len(arr) < 0: maximum = max(arr) return sum(arr) + maximum if DEBUG: sys.stdin = open('input.txt') pr = cProfile.Profile() pr....

0.50248

def target_game(values): a = b = 0 for n in values: a, b = b, max(a + n, b) return max(a, b)

0.50157

def maximum_product(arr): if arr.count(0) > 1: return min(arr) neg = [n for n in arr if n < 0] pos = [n for n in arr if n >= 0] if len(neg) % 2: return min(neg) if 0 in arr else max(neg) else: return min(pos) if pos else min(neg)

0.500512

# import collections, atexit, math, sys from functools import cmp_to_key #key=cmp_to_key(lambda x,y: 1 if x not in y else -1 ) sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) import bisect try : #raise ModuleNotFoundError import numpy def dprint(*args...

0.498543

import sys import numpy as np sr = lambda: sys.stdin.readline().rstrip() ir = lambda: int(sr()) lr = lambda: list(map(int, sr().split())) # 二分探索 N, K = lr() A = np.array(lr()) F = np.array(lr()) A.sort() F = np.sort(F)[::-1] def check(x): count = np.maximum(0, (A - (x // F))).sum() return count <= K left = ...

0.496697

n, k = list(map(int, input().strip().split())) jobs = list(map(int, input().strip().split())) times = list(map(int, input().strip().split())) counts_jobs = {} for job in jobs: if job in counts_jobs: counts_jobs[job] += 1 else: counts_jobs[job] = 1 times_i = [] for i, time in enumerate(times):...

0.496073

n, w = list(map(int, input().split())) a = sorted(map(int, input().split())) x = min(min(a[:n]), min(a[n:]) / 2) print(min(w, 3 * n * x))

0.493733

from heapq import heappop, heappush def comb(fruits): total, heap = 0, sorted(fruits) while len(heap) > 1: cost = heappop(heap) + heappop(heap) heappush(heap, cost) total += cost return total

0.493694

from operator import attrgetter, itemgetter n = int(input()); arr = [[int(x) for x in input().split(' ')] for y in range(n)]; arr = sorted(arr, key=itemgetter(1,0,2), reverse=True); dp = [0 for x in range(n)]; s = []; for i in range(n): while (s != [] and arr[s[-1]][0] >= arr[i][1]): s.pop(); if (s != []): dp[i] ...

0.493558

class Solution: def findBestValue(self, arr: List[int], target: int) -> int: arr.sort() n = len(arr) for i in range(n): sol = round(target / n) if arr[i] >= sol: return sol target -= arr[i] n -= 1 return arr[-1]

0.493338

from collections import namedtuple from operator import itemgetter Friend = namedtuple("Friend", "m s") n, d = list(map(int, input().split())) f = [ ] for i in range(n): f.append(Friend(*list(map(int, input().split())))) f.sort(key=itemgetter(0)) left = 0 cur = f[0].s result = cur for i, fr in enumerate(f[1:],...

0.492835

import sys it = iter(sys.stdin.readlines()) input = it.__next__ n, k = list(map(int, input().split())) d, c = [0] * n, [0] * n for i in range(n): a, b = list(map(int, input().split())) d[i], c[i] = a, k - b p, r, pre, suf, sm, mx = list(range(n)), [0] * n, c[:], c[:], c[:], c[:] def find(x): if x != p[x]:...

0.492071

n, m, d = list(map(int, input().split())) a = [] b = [] for i in range(n): a.append(list(map(int, input().split()))) for i in range(m): b.append(list(map(int, input().split()))) a = sorted(a, key=lambda x: x[0] + (1- x[1] * 1e-10)) b = sorted(b, key=lambda x: x[0] + (1- x[1] * 1e-10)) tc, td = 0, 0 tc += ...

0.492065

n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) c = [0] * n stk = [0] for i in range(1, n): while len(stk) > 1 and c[stk[1]] - c[stk[0]] <= a[i] * (b[stk[0]] - b[stk[1]]): del stk[0] c[i] = c[stk[0]] + a[i] * b[stk[0]] while len(stk) > 1 and ((c[s...

0.490775

def main(): n, m = list(map(int, input().split())) cost1 = [] cost2 = [] cost3 = [] for i in range(n): w, c = list(map(int, input().split())) if w == 1: cost1.append(c) elif w == 2: cost2.append(c) else: cost3.append(c) cost1...

0.490388

class Solution: def mincostTickets(self, days: List[int], costs: List[int]) -> int: dp = [0] + [-1 for i in range(days[-1])] for day in days: dp[day] = 0 for i in range(1, len(dp)): if dp[i] == -1: dp[i] = dp[i-1] ...

0.488852

from collections import deque n = int(input()) p = list(map(int,input().split())) a = list(map(int,input().split())) edge = [[] for i in range(n)] for i in range(n-1): edge[p[i]-1].append(i+1) dp = [0 for i in range(n)] size = [not edge[v] for v in range(n)] res = [] deq = deque([0]) while deq: v = deq.popl...

0.488731

from bisect import * n, tc, td = [int(i) for i in input().split()] fc = [] fd = [] mbc = 0 mbd = 0 for _ in range(n): b, p, ft = input().split() b, p = int(b), int(p) f = (p, b) if ft == 'C': if p <= tc: fc.append(f) mbc = max(mbc, b) else: if p <= td: ...

0.488428

class Solution: def maximumProduct(self, nums): """ :type nums: List[int] :rtype: int """ import heapq a, b = heapq.nlargest(3, nums), heapq.nsmallest(2, nums) return max(a[0]*a[1]*a[2], a[0]*b[0]*b[1])

0.487694

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline n,p,q,r=map(int,input().split()) a=list(map(int,input().split())) s1=[a[i]*p for i in range(n)] s2=[] m=s1[0] for i in range(n): m=max(m,s1[i]) s2.append(m+a[i]*q) s3=[] m=s2[0] for i in range(n): m=max(m,s2[i]) s3.append(m+a[i]*r) p...

0.487106

import time import random W = int(input()) M = [int(a) for a in input().split()] A = [0] * 8 sTime = time.time() s = 0 mi = 10**20 for i in range(8): if s + M[i]*(i+1) <= W: s += M[i]*(i+1) A[i] = M[i] else: t = (W-s)//(i+1) s += t*(i+1) A[i] += t if s <= W: ...

0.486543

def min_dot(a, b): return sum(x * y for (x, y) in zip(sorted(a), sorted(b, reverse = True)))

0.486086

class Solution: def minimumTotal(self, triangle): """ :type triangle: List[List[int]] :rtype: int """ length = len(triangle) for i in range(length - 1, 0, -1): for j in range(1, len(triangle[i])): if triangle[i][j] < triangle[i][j-...

0.485799

class Solution: def maxDotProduct(self, nums1: List[int], nums2: List[int]) -> int: # DP(a=index of last, b=index of last) = max of: # DP(a-1, b) # DP(a-1, i) + nums1[a] * max_or_min(nums2[i+1:b+1]) # same for b INF = int(1e9) n, m = len(nums1)...

0.485336

def adjacent_element_product(array): return max( a*b for a, b in zip(array, array[1:]) )

0.484783

def profitLoss(records): return round(sum(price - price / (1 + profit / 100) for (price, profit) in records), 2)

0.48477

def main(): trips, reg, cheap, cards, card_cost = list(map(int, input().split())) costs = [] indexes = {} total = 0 last = "" for i in range(trips): a, b = input().split() pair = (min(a, b), max(a, b)) if pair in indexes: index = indexes[pair] else: costs.append(0) index...

0.48445

import sys input = sys.stdin.readline N, K = list(map(int, input().split())) nums = [] for i in range(N): t, d = list(map(int, input().split())) nums.append((d, t)) nums.sort(reverse=True) se = set() a1 = [] a2 = [] rest = [] for i, n in enumerate(nums): if i < K: if not n[1] in se: se....

0.484325

#~ # MAGIC CODEFORCES PYTHON FAST IO import atexit import io import sys _INPUT_LINES = sys.stdin.read().splitlines() input = iter(_INPUT_LINES).__next__ _OUTPUT_BUFFER = io.StringIO() sys.stdout = _OUTPUT_BUFFER @atexit.register def write(): sys.__stdout__.write(_OUTPUT_BUFFER.getvalue()) #~ # END OF MAGIC CODEFO...

0.484143

n = int(input()) bestP = 10**9 sol = 0 for i in range(0, n): a, p = list(map(int, input().split())) bestP = min(bestP, p) sol += a * bestP print(sol)

0.483834

def knapsack(capacity, items): ratios = [float(item[1]) / item[0] for item in items] collection = [0] * len(items) space = capacity while any(ratios): best_index = ratios.index(max(ratios)) if items[best_index][0] <= space: collection[best_index] += 1 space -= ite...

0.482931

def calc(a): res = [0] * (len(a) + 1) for k in range(len(a)): res = [2 * max(a[i] + res[i+1], a[i+k] + res[i]) for i in range(len(a) - k)] return res[0]

0.482806

q=list(map(int,input().split())) a=[] s=[] for i in range(0,q[0]): s+=[min(list(map(int,input().split())))] print(max(s))

0.480763

n, w, v, u = list(map(int, input().split())) versh = [] for i in range(n): a, b = list(map(int, input().split())) versh.append((a, b)) versh.sort(key=lambda x : x[1]) for i in versh: if i[0] / v < i[1] / u: break else: print(w / u) return y = 0 time = 0 for i in versh: x = i[0] - time *...

0.480068

from functools import reduce from fractions import gcd def final_attack_value(x, monster_list): return reduce(lambda a, b: a + (b if b <= a else gcd(a, b)), monster_list, x)

0.479907

n = int(input()) k = map(int, input().split()) times = [] for i in range(n): people = list(map(int, input().split())) time = len(people) * 15 for p in people: time += p*5 times.append(time) print(min(times))

0.479715

def bins(sortedlist,x): n=len(sortedlist) start = 0 end = n - 1 while(start <= end): mid =int( (start + end)/2) if (x == sortedlist[mid][0]): return mid elif(x < sortedlist[mid][0]): end = mid - 1 else: start = mid + 1 if(sorte...

0.478221

class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ n = len(prices) if n < 2: return 0 sells = [0] * n buys = [0] * n buys[0] = -prices[0] for i in ...

0.478178

read = lambda: map(int, input().split()) n, k = read() a = list(read()) b = list(read()) c = [(a[i], b[i]) for i in range(n)] c.sort(key = lambda x: x[0] - x[1]) ans = sum(c[i][0] for i in range(k)) for i in range(k, n): ans += min(c[i][0], c[i][1]) print(ans)

0.478105

n, m, k = list(map(int, input().split())) x, s = list(map(int, input().split())) t = list(map(int, input().split())) pr = list(map(int, input().split())) t2 = list(map(int, input().split())) pr2 = list(map(int, input().split())) mass1 = [] minans = 10**20 for i in range(m): mass1.append((pr[i], t[i])) mass1.sort() ...

0.477862

import sys # sys.stdin = open('in.txt') s = sys.stdin.read().split() p = 0 def getSm(k, a, b, c, d): return (k + 1) * a - (k * (k + 1) >> 1) * b * d t = int(s[p]) p += 1 res = [] for _ in range(t): a = int(s[p]) p += 1 b = int(s[p]) p += 1 c = int(s[p]) p += 1 d = int(s[p]) p...

0.477859

from itertools import accumulate def tram(stops, descending, onboarding): return max(accumulate(o - d for d, o in zip(descending[:stops], onboarding)))

0.476994

import sys readline = sys.stdin.readline from collections import Counter def getpar(Edge, p): N = len(Edge) par = [0]*N par[0] = -1 par[p] -1 stack = [p] visited = set([p]) while stack: vn = stack.pop() for vf in Edge[vn]: if vf in visited: con...

0.476505

import math import sys arrival, departure, time_per_client = [int(x) for x in input().split()] num_clients = int(input()) if num_clients > 0: clients_arrival = [int(x) for x in input().split()] else: print(arrival) return best_time = None current_time = arrival clients_at_queue = 0 client_to_arrive = 0 client_wa...

0.475336

import sys import copy input = sys.stdin.readline n,m,k=list(map(int,input().split())) A=list(map(int,input().split())) SHOP=[list(map(int,input().split())) for i in range(m)] A=sorted(A)[:k] A=A[::-1] SHOP.sort(key=lambda x:x[0]) from itertools import accumulate DP=[0]+list(accumulate(A)) SUM=copy.deepcopy(DP) ...

0.475179

n, up = map(int, input().split()) res = 0 for i in range(n): fl, t = map(int, input().split()) res = max(res, max(t, up - fl) + fl) print(res)

0.475179

#難しく考えすぎていた #こういう問題は最後どうなるかを考える #最後は結局一番最後のカードを必ず引くことになる #そのカードをどちらが引くのか #先攻が圧倒的有利 n,z,w=map(int,input().split()) a=list(map(int,input().split())) if len(a)==1: print(abs(a[-1]-w)) else: print(max(abs(a[-1]-w),abs(a[-1]-a[-2])))

0.475038

c = list(map(int, input().split())) n, m = list(map(int, input().split())) a = list(map(int, input().split())) b = list(map(int, input().split())) sa = sum(a)*c[0] sb = sum(b)*c[0] for i in a: sa = min(sa, sa - i*c[0] + c[1]) for i in b: sb = min(sb, sb - i*c[0] + c[1]) print(min(sa + sb, sa + c[2], sb + c[2],...

0.475013

from itertools import islice from functools import reduce def greatest_product(n): numbers=[int(value) for value in n] result=[reduce(lambda x,y: x*y, islice(numbers, i, i+5), 1) for i in range(len(numbers)-4)] return max(result)

0.474939

from sys import * f = list(map(int, stdin.read().split())) n, m = f[0], f[1] d = [[] for i in range(100001)] for j in range(2, len(f), 3): x, y, w = f[j:j + 3] d[w].append((y, x)) s = [0] * (n + 1) for q in d: for y, k in [(y, s[x]) for y, x in q]: s[y] = max(s[y], k + 1) print(max(s))

0.474798

# cook your dish here x=int(input()) for i in range(x): s=list(map(int,input().split())) s.sort() print(s[1])

0.474164

import sys from heapq import heappush, heappop n = int(input()) a = list(map(int, input().split())) count = {} for x in a: if x in count: count[x] = count[x] + 1 else: count[x] = 1 count = sorted(list(count.items())) #print(count) cost= list(map(int, input().split())) max_cost = max(cost) a = list(zip(a, co...

0.474

import itertools def choose_best_sum(t, k, ls): try: return max(sum(i) for i in itertools.combinations(ls,k) if sum(i)<=t) except: return None

0.473941

# cook your dish here while True: try: n=int(input()) lis=[] for i in range(n): k=list(map(int,input().split())) k.append(k[1]+k[2]) lis.append(k) #print(lis) p=sorted(lis,key=lambda x:x[3],reverse=True) #print(p) m...

0.473707

n = int(input()) a = [[], []] a[0] = list(map(int, input().split())) a[1] = list(map(int, input().split())) b = list(map(int, input().split())) ans = float('+inf') for i in range(n): for j in range(n): if i == j: continue cur = sum(a[1][i:]) + sum(a[0][:i]) + sum(a[0][:j]) + sum(a[1][j:]) + b[i] + b[j] ans =...

0.473498

class Solution: def twoCitySchedCost(self, costs: List[List[int]]) -> int: dcosts = sorted(costs, key=lambda i: i[0] - i[1]) n = len(costs) // 2 acost = sum(c[0] for c in dcosts[:n]) bcost = sum(c[1] for c in dcosts[n:]) return acost + bcost

0.473066

import numpy as np N, C = list(map(int, input().split())) xv = [(0, 0)] for i in range(N): x, v = list(map(float, input().split())) xv.append((x, v)) sumA = np.zeros(N+2, dtype=float) sumB = np.zeros(N+2, dtype=float) xv.sort(key=lambda tup:tup[0]) xv.append((C,0)) for i in range(N+1): sumA[i+1] = sumA[...

0.472666

import sys readline = sys.stdin.readline def ceil(a, b): return -(-a//b) def main(): N = int(readline()) inp = [tuple(map(int, readline().rstrip().split())) for _ in range(N)] scr_t, scr_a = 0, 0 for t, a in inp: if t >= scr_t and a >= scr_a: scr_t = t scr_a = a ...

0.472496

import itertools import math import random import time def timer(f): def tmp(*args, **kwargs): t = time.time() res = f(*args, **kwargs) print("Время выполнения функции: %f" % (time.time()-t)) return res return tmp def genArray(length, lower, upper): return [random.randint(...

0.472138

def roundRobin(jobs, slice, index): total_cc = 0 while True: for idx in range(len(jobs)): cc = min(jobs[idx], slice) jobs[idx] -= cc total_cc += cc if idx == index and jobs[idx] == 0: return total_cc

0.471583

for T in range(int (eval(input()))): N,K,D=list(map(int,input().split())) A=list(map(int,input().split())) P=sum(A)//K print(min(P,D))

0.47145

import itertools import bisect n, A, cf, cm, m = [int(x) for x in input().split()] skills = [int(x) for x in input().split()] sorted_skills = list(sorted((k, i) for i, k in enumerate(skills))) bottom_lift = [0 for i in range(n)] for i in range(1, n): bottom_lift[i] = bottom_lift[i-1] + i * (sorted_skills[i][0] - s...

0.471246

t=int(input()) while(t): n=int(input()) l=[] for i in range(n): l.append(list(map(int,input().split()))); m=[] for i in l: m.append((i[1]//(i[0]+1))*i[2]) res=max(m) print(res) t=t-1

0.471041

g = {} def push(u, v, w): g[u] = [v, w] n, pos = list(map(int, input().split())) V = list(map(int, input().split())) W = list(map(int, input().split())) for _ in range(n): push(_, V[_], W[_]) max_log = 35 next_n = [[-1] * n for _ in range(max_log)] next_m = [[float('inf')] * n for _ in range(max_log)] ...

0.471032

Given a string s, a k duplicate removal consists of choosing k adjacent and equal letters from s and removing them causing the left and the right side of the deleted substring to concatenate together. We repeatedly make k duplicate removals on s until we no longer can. Return the final string after all such duplicate r...

class Solution: def removeDuplicates(self, s: str, k: int) -> str: st=[['*',0]] for c in s: if c!=st[-1][0]: st.append([c,1]) else: st[-1][1]+=1 if st[-1][1]==k: st.pop() res='' for c,v in st:...

0.709763

def solve(st,k): for l in sorted(st)[:k]: st=st.replace(l,'',1) return st

0.714581

class Solution: def orderlyQueue(self, S: str, K: int) -> str: if K >= 2: return ''.join(sorted(S)) length = len(S) S = S + S i, j, k = 0, 1, 0 while j + k < len(S) and k < length: if S[i + k] == S[j + k]: k += 1 ...

0.711596

from collections import Counter, defaultdict from string import ascii_lowercase as al n, k = list(map(int, input().split())) s = list(input()) C = defaultdict(int, Counter(s)) C_ = defaultdict(int) k_ = k for char in al: temp = min(C[char], k_) C_[char] += temp k_ -= temp for i, el in enumerate(s): ...

0.690756

'''input 3 4 aba ''' n, k = map(int, input().split()) t = input() for i in range(1, n): if t[i:] == t[:n-i]: print(t[:i] * k + t[i:]) break else: print(t * k)

0.657696

class Solution: def longestSubstring(self, s, k): """ :type s: str :type k: int :rtype: int """ for c in set(s): if s.count(c) < k: return max(self.longestSubstring(sp, k) for sp in s.split(c)) return len(s)

0.65331

K = int(input()) S = input() if len(S) <= K: print(S) else: print(S[0:K] + '...')

0.636377

N, K = map(int, input().split()) S = input() print("".join(c.lower() if i == K else c for i, c in enumerate(S, 1)))

0.630459

class Solution: def getLengthOfOptimalCompression(self, s: str, k: int) -> int: n = len(s) def compLen(c): return 1 + len(str(c)) if c > 1 else 1 @lru_cache(None) def dp(i, k): # return {head: (len, -head_count)} if (n - i) <= k: return {} # ...

0.629371

class Solution: def characterReplacement(self, s, k): """ :type s: str :type k: int :rtype: int """ if s == "": return 0 count = {} lo = 0 hi = 0 max_letter = 0 for hi in range(len(s)): try:...

0.624221

class Solution: def removeDuplicateLetters(self, s): """ :type s: str :rtype: str """ rindex = {c: i for i, c in enumerate(s)} result = '' for i, c in enumerate(s): if c not in result: while c < result[-1:] and i < rindex[...

0.62385

from string import ascii_lowercase class Solution: def removeDuplicates(self, S: str) -> str: dup = {2*ch for ch in ascii_lowercase} prev_length = -1 while prev_length!=len(S): prev_length = len(S) for d in dup: S = S.replace...

0.622906

def solve(st, k): length = len(st) - k return max(int(st[i:i + length]) for i in range(k + 1))

0.612944

class Solution: def hasAllCodes(self, s: str, k: int) -> bool: if len(s) < 2 ** k + k - 1: return False # Cannot be a string, as this is the de brujin length target = 2 ** k seen = set() cur_len = 0 for end in range(k, len(s) + 1): chunk = s[end - k: e...

0.606709

class Solution: def lastSubstring(self, s: str) -> str: #mx = \"\" #for i in range(len(s)): # mx = max(mx,s[i:]) #return mx index = {c: i for i, c in enumerate(sorted(set(s)))} cur, radix, max_val, max_i = 0, len(index), 0, 0 for i in range(len(s)-1, -1, -1...

0.604167

class Solution: def minInteger(self, num: str, k: int) -> str: n=len(num) if k<=0: return num if k>n*(n-1)//2: return ''.join(sorted(list(num))) for i in range(10): idx = num.find(str(i)) if idx>=0 and idx<=k: ...

0.603949

class Solution: def decodeAtIndex(self, S: str, K: int) -> str: size = 0 # Find size = length of decoded string for c in S: if c.isdigit(): size *= int(c) else: size += 1 for c in reversed(S): K %= size i...

0.603097

n,k = map(int, input().split()) s = input() ls = sorted(list(set(s))) if k > n: ans = s + ''.join([ls[0] for i in range(k-n)]) print(ans) return c = len(ls) d = {} for i in range(c): d[ls[i]] = i ns = [] for i in range(k-1,-1,-1): ns.append(d[s[i]]) r = 1 ans = [] for i in range(k): ans.append((...

0.601356

class Solution: def removeKdigits(self, num, k): """ :type num: str :type k: int :rtype: str """ out=[] for digit in num: while k and out and out[-1] > digit: out.pop() k-=1 out.append(digit) ...

0.601218

from itertools import groupby def replace(s): queue, rle = {}, [[i, k, len(list(g))] for i, (k, g) in enumerate(groupby(s))] for i, k, l in reversed(rle): if l not in queue: queue[l] = {} queue[l].setdefault(k, []).append(i) for l in queue: while sum(map(bool, queue[l].values())) > ...

0.599464

def substring(s): r, rm = [], [] for i, x in enumerate(s): if x in r or len(set(r)) < 2: r += x; else: if len(r) > len(rm): rm = r[:] r = [y for y in r[-1::-1] if y == r[-1]] + [x] if len(r) > len(rm): rm = r[:] return ''.join(rm)

0.59505

import sys stdin=sys.stdin ip=lambda: int(sp()) fp=lambda: float(sp()) lp=lambda:list(map(int,stdin.readline().split())) sp=lambda:stdin.readline().rstrip() yp=lambda:print('Yes') np=lambda:print('No') s=list(sp()) k=ip() ans=set() alpa=list(set(s)) alpa.sort() ch=0 siyou=[] for i in range(len(alpa)): if i<=2: ...

0.593125

from array import array inf = (1 << 30) def main(): (n,k) = [int(x) for x in input().split(' ')] Matrix = [] for i in range(n): Matrix.append(array('b',[ord(x) for x in input()])) dp = [array('l', [inf for j in range(n)]) for i in range(n)] direct = [[ord('d') for j in range(n)] for i in ra...

0.591299

for _1 in range(int(input())): n=int(input()) s=input().strip() answer=s for i in range(len(s)): c=s[i] string=s[:i]+s[i+1:] for j in range(len(string)+1): answer=min(answer, string[:j]+c+string[j:]) print(answer)

0.579952

a, k = input().split() k = int(k) a = [i for i in a] i = 0 while k > 0 and i < len(a): m = a[i : i + k + 1].index(max(a[i : i + k + 1])) if a[i + m] > a[i]: k -= m for j in range(i + m, i, -1): a[j], a[j - 1] = a[j - 1], a[j] i += 1 print("".join(a))

0.57925

class Solution: def longestDupSubstring(self, S): nums, N = [ord(c) - ord('a') for c in S], len(S) BASE, MOD = 26, 2**32 def check(L): cur_hash, seen = 0, set() for val in nums[:L]: cur_hash = (cur_hash * BASE + val) % MOD seen.add(cur_hash...

0.578896

s = input().strip() if len(s)<=2: print(s) return ne = s[0]+s[1] for i in range(2,len(s)): if s[i]!=s[i-1] or s[i]!=s[i-2]: ne+=s[i] ne2 = ne[:3] for i in range(3,len(ne),1): if ne2[-3]==ne2[-2] and ne2[-1]==ne[i]: pass else: ne2+=ne[i] print(ne2)

0.573942

n, k = [int(i) for i in input().split()] dic = dict() s = list(input()) i = 0 while i<n: j = 1 while i+j < n and s[i] == s[i+j]: j+=1 if s[i] not in dic: dic[s[i]] = [] dic[s[i]].append(j) i += j ans = 0 for i in list(dic.keys()): ct = 0 for j in dic[i]: ct+=(j//k...

0.573457

from collections import Counter from functools import reduce from fractions import gcd def has_subpattern(s): c = Counter(s) m = reduce(gcd, c.values()) return ''.join(sorted(k*(v//m) for k,v in c.items()))

0.573437

class Solution: def sortString(self, s: str) -> str: sforward = sorted(s) sbackward = sforward[-1] suniq = '' for i in s: if i not in suniq: suniq += i suniq = sorted(suniq) max_count = 0 for i i...

0.572677

import sys readline = sys.stdin.readline T = int(readline()) Ans = [None]*T for qu in range(T): N, K = map(int, readline().split()) S = list(map(lambda x: ord(x)-97, readline().strip())) S.sort() if len(set(S[:K])) != 1: Ans[qu] = chr(97+S[K-1]) continue L = len(set(S[K:])) if L...

0.568212

from collections import Counter class Solution: def reorganizeString(self, S): """ :type S: str :rtype: str """ if len(S) <= 1: return S chars = [char for char, count in Counter(S).most_common() for _ in range(count)] h = math.ceil(...

0.567182

def ii(): return int(input()) def mi(): return list(map(int, input().split())) def li(): return list(mi()) n, k = mi() a = li() s = input().strip() ans = 0 i = 0 while i < n: j = i + 1 while j < n and s[j] == s[i]: j += 1 b = sorted(a[i:j]) ans += sum(b[-k:]) i = j print(ans)

0.564083

class Solution: def maxVowels(self, s: str, k: int) -> int: n = len(s) vowel = set(['a','e','i','o','u']) i=0 res = 0 while i<k: if s[i] in vowel: res+=1 i+=1 j=k i=0 maxV = res while j<n: if ...

0.563959

n = int(input()) s = input() i = 0 d = 1 t = [] while i < n: t.append(s[i]) i += d d += 1 print(''.join(t))

0.563415

class Solution: def reverseStr(self, s, k): """ :type s: str :type k: int :rtype: str """ for idx in range(0, len(s), 2*k): s = s[:idx] + s[idx:idx+k][::-1] + s[idx+k:] return s

0.560509

class Solution: def shortestPalindrome(self, s): if len(s)<2: return s if len(s)==40002: return s[20000:][::-1]+s for i in range(len(s)-1,-1,-1): if s[i]==s[0]: j=0 while j<(i+1)//2 and s[i-j]==s[j]: ...

0.5591

import math class Solution: def __init__(self): self.happy_string = '' def getHappyString(self, n: int, k: int) -> str: # determine starting character poss_per_group = 2 ** (n - 1) group_num = math.ceil(k / poss_per_group) - 1 starting_char = '' # c...

0.559093

def solve(s): it = reversed(s.replace(' ','')) return ''.join(c if c == ' ' else next(it) for c in s)

0.549682

from functools import lru_cache class Solution: def palindromePartition(self, s: str, k: int) -> int: n = len(s) if n == k: return 0 @lru_cache(None) def cnt(left,right): # cost to make palindrome if left >= right: return 0 return ...

0.549553

n = int( input() ) for _ in range( n ): s = input() i = 0 a = set() while i < len( s ): if i == len( s ) - 1 or s[ i ] != s[ i + 1 ]: a.add( s[ i ] ) i += 1 else: i += 2 l = [ c for c in a ] l.sort() print( "".join( l ) )

0.549018

n, k = map(int, input().split()) a = [0] * n b = ['0'] * n c = [] s = input() for i in range(n): if k != 0: if s[i] == '(': c.append(i) else: d = c.pop() a[i] = 1 a[d] = 1 k -= 2 for i in range(n): if a[i] == 1: print(s[i], end ...

0.548848

from collections import Counter class Solution: def canConstruct(self, s: str, k: int) -> bool: if k > len(s): #return False return False counter = Counter(s) odd_counts = 0 for char in counter: if counter[char] % 2 == 1: odd_counts +=...

0.548124

n = int(input()) words = input().split()[:n] p_base = 1543 p_mod = 1300199 current = [c for c in words[0]] for word in words[1:]: cur_hash = 0 word_hash = 0 cur_base = 1 i_matches = [] same_i = 0 biggest_match = None while same_i < len(current) and same_i < len(word): cur_hash *= p...

0.547704

class Solution: def licenseKeyFormatting(self, S, K): """ :type S: str :type K: int :rtype: str """ # count_dash = 0 # for item in S: # if item == '-': # count_dash += 1 # S_len = len(S) - count_...

0.546857

def doubles(s): cs = [] for c in s: if cs and cs[-1] == c: cs.pop() else: cs.append(c) return ''.join(cs)

0.542889

class Solution: def maxPower(self, s: str) -> int: n = len(s) count = 0 res = s[0] cur_count = 1 # Traverse string except # last character for i in range(n): # If current character # matches with next ...

0.542768

from bisect import bisect_left as bl from bisect import bisect_right as br from heapq import heappush,heappop import math from collections import defaultdict from functools import reduce,cmp_to_key,lru_cache import io, os input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline # import sys # input = sys.stdin.read...

0.542371

3 import sys def solve(s, k): l = len(s) for i in range(l-1, -1, -1): prev = s[max(i-2, 0):i] z = s[i] + 1 while z in prev: z += 1 if z >= k: continue # Gotcha! ret = s[:i] + [z] while len(ret) < l: prev = ret[max(len...

0.540572

def main(): N, K = list(map(int, input().split())) S = list(input()) base = S[0] flag = False for i in range(0, N): if K == 0: break if S[i] != base and (not flag): flag = True S[i] = base elif S[i] != base and flag: S[i] = base...

0.538571

n, k = map(int, input().split()) print(('abcdefghijklmnopqrstuvwxyz'[:k] * n)[:n])

0.536966

class Solution: def canConvertString(self, s: str, t: str, k: int) -> bool: if len(s) != len(t): return False c = Counter((ord(c2) - ord(c1)) % 26 for c1, c2 in zip(s, t)) return k >= max( (m + 26 * (count - 1) for m, count in list(c.items()) if m), ...

0.536474

n = int(input()) s = input() t = [] vowels = 'aeiouy' for c in s: if t and t[-1] in vowels and c in vowels: continue else: t.append(c) print(''.join(t))

0.531873

S = input() K = int(input()) if len(S) == 1: print(S) else: flg = False while S[0] == '1': S = S[1:] K -= 1 if K == 0: print(1) flg = True break if not flg: if S[0] == '2': if K.bit_length() - 1 >= 5000000000000000: ...

0.531567

from collections import Counter def only_duplicates(string): cs = Counter(string) return ''.join(c for c in string if cs[c] > 1)

0.531058

class Solution: def longestPrefix(self, strn: str) -> str: max_prefs = [0]*len(strn) curr = 0 for idx in range(1, len(strn)): while True: if curr == 0: if strn[idx] == strn[0]: curr = 1 max_prefs[idx...

0.527913

t = eval(input()) for _ in range(t): n = eval(input()) a = input().strip().split() cb, cs = 0, "" for i in range(len(a[0])): for j in range(i+1,len(a[0])+1): al = True s = a[0][i:j] for k in a[1:]: if s not in k: al = False break if al: if j-i>=cb: cb = max(cb, j-i) if len(...

0.527705

def check(s, k): ans = 0 for i in range(len(s)): ans += abs(ord(s[i]) - ord(k[i])) return ans n, k = list(map(int, input().split())) s = input() cnt = 0 for i in s: cnt += max(ord('z') - ord(i), ord(i) - ord('a')) if k > cnt: print(-1) return else: ans = '' cr = 0 while k !=...

0.527404

s=input() def shift(x,k): x=x[-k:]+x[:-k] return x for i in range(int(input())): l,r,k=tuple(map(int,input().split())) l-=1 k%=(r-l) s=s[:l]+shift(s[l:r],k)+s[r:] print(s)

0.526342

def no_repeat(s): return next(c for c in s if s.count(c) == 1)

0.525513

from itertools import permutations def solve(s,k): return sum(not v%k for v in map(int, map(''.join, permutations(s.split(),2))))

0.523869

from collections import deque S = input() mn = [ 300 for i in range( len( S ) ) ] for i in range( len( S ) - 1, -1, -1 ): if i == len( S ) - 1: mn[ i ] = ord( S[ i ] ) else: mn[ i ] = min( mn[ i + 1 ], ord( S[ i ] ) ) ans = "" dq = deque() for i in range( len( S ) ): dq.append( ord( S[ i ] ) ) while len...

0.523723

class Solution: def numberOfArrays(self, s: str, k: int) -> int: dp = [-1] * len(s) return self.dfs(s, k, 0, dp) def dfs(self, s: str, k: int, start: int, dp: List[int]) -> int: if start == len(s): return 1 if s[start] == '0': return 0 if dp[s...

0.523582

from itertools import combinations def solve(n, k): return ''.join(min(combinations(str(n), len(str(n))-k)))

0.522851

from collections import Counter from string import ascii_lowercase def missing_alphabets(s): c = Counter(s) m = max(c.values()) return ''.join(letter * (m - c[letter]) for letter in ascii_lowercase)

0.52192

class Solution: def minCost(self, s: str, cost: List[int]) -> int: delete_cost = 0 last = 0 for i in range(1, len(s)): if s[last] == s[i]: if cost[last] < cost[i]: delete_cost += cost[last] last = i else: ...

0.520625

for _ in range(int(input())): s,k=map(str,input().split()) k=int(k) n="NOPE" al=[0]*26 for ele in s: al[ord(ele)-ord('a')]=1 l=len(s) ans=[] # print(al) for i in range(26): if len(ans)==l: break elif al[i]==1 and k>0: k-=1 ans.append(chr(i+ord('a'))) elif al[i]==0: ans.append(chr(i+ord('a')...

0.520265

n = int(input()) s = input() for i in range(len(s) - 1): if s[i] > s[i + 1]: print(s[:i] + s[i + 1:len(s)]) return print(s[:len(s) - 1])

0.520068

s = input() L = input() k = int(input()) '''from datetime import * time1 = datetime.now()''' good = set() string = set() LIST = [chr(i) for i in range(97,123)] for i in range(26): if L[i]=='1': good.add(LIST[i]) t = [s[i] not in good for i in range(len(s))] end = [0]*len(s) badchars = 0 front=0; rear=0 w...

0.518698

def string_func(s, n): l, s = [s], list(s) while True: s[::2], s[1::2] = s[:len(s)//2-1:-1], s[:len(s)//2] l.append(''.join(s)) if l[0] == l[-1]: del l[-1]; break return l[n % len(l)]

0.518061

n = int(input()) def test(a, s): k = [''] * len(a) d = {} for i in range(len(a)): tof = True if a[i] == s[:len(a[i])]: if a[i] not in d: d[a[i]] = 'P' tof = False k[i] = 'P' if not tof: continue if a[i]...

0.517575

def solved(s): if len(s)&1: s = s[:len(s)//2]+s[len(s)//2+1:] return ''.join(sorted(s))

0.517496

read=lambda:list(map(int,input().split())) from collections import Counter as co k,n=read() s=input() repeated=(len(s)!=len(set(s))) etalon=co(s) a=[] kk=[] ap=a.append for i in range(k-1): ap(input()) if co(a[-1])!=etalon: print(-1) return ss=False for i in a: if i!=s: ss=i ...

0.517454

class Solution: def shortestSuperstring(self, A: List[str]) -> str: A = [a for i, a in enumerate(A) if all(a not in b for j, b in enumerate(A) if i != j)] def memo(f): dic = {} def f_alt(*args): if args not in dic: dic[args] = f(*args) ...

0.516117

s = list(input()) n = len(s) // 2 m = int(input()) a = [int(x) for x in input().split()] sums = [0] * (n + 1) for i in a: sums[i - 1] += 1 for i in range(1, len(sums)): sums[i] += sums[i-1] for i in range(n): if (sums[i] % 2 == 1): s[i], s[-i-1] = s[-i-1], s[i] print("".join(s))

0.514015

m = int(input()) s = input().strip() sa = [0] * len(s) for i in range(len(s)): sa[i] = ord(s[i]) - ord('a') sa = [-1] + sa + [-1] def check_value(sa, m, threshold): prev_ind = 0 for i in range(len(sa)): if sa[i] <= threshold: if i - prev_ind <= m: prev_ind = i else: return False return True def ...

0.51297

class Solution: def smallestStringWithSwaps(self, s: str, pairs: List[List[int]]) -> str: pr=[i for i in range(len(s))] def union(x,y): p1=find(x) p2=find(y) if p1!=p2: pr[p1]=p2 def find(x): while pr[x]!=x: pr[x...

0.512201

def center_of(chars): if not chars: return "" total=0 res=[] for i in range(1,len(chars)*2+1): if i%2==1: res.append((i+1)//2+total) res[-1]=chars[(res[-1]-1)%len(chars)] total+=i res="".join(res) for i in range(len(res)//2+1): if le...

0.510429

class Solution: def longestAwesome(self, s: str) -> int: cum = [0] firsts = {0: -1} lasts = {0: -1} for i, c in enumerate(s): cum.append(cum[-1] ^ (1 << (ord(c) - 48))) if cum[-1] not in firsts: firsts[cum[-1]] = i lasts[cum[-1]] = ...

0.509375

def solve(s,a,b): return s[:a]+s[a:b+1][::-1]+s[b+1:]

0.509367

import string rd = lambda: list(map(int, input().split())) n, k = rd() if k>26 or k>n or k==1 and n>1: print(-1) elif k==1 and n==1: print('a') else: print(('ab'*(n+1>>1))[:n-k+2]+string.ascii_lowercase[2:k])

0.50915

from typing import List def winner(a: str, b: str) -> str: return b if (a, b) in [("R", "P"), ("P", "S"), ("S", "R")] else a N, K = list(map(int, input().split())) S: List[str] = list(input()) for i in range(K): T: List[str] = S + S S = [winner(T[2 * j], T[2 * j + 1]) for j in range(N)] print((S[0]))

0.508829

def solve(st): return sorted((st.find(c) - st.rfind(c), c) for c in set(st))[0][1]

0.508611

def sol(a,k): n=len(a) if(k==0):return 1 if(k==1): v=set() for x in a: v.add(x) return len(v) if(n<k or n<1 or k<1): return 0 if(n==k): return 1 sz=max(3000,n) v1=[0]*sz v2=[0]*sz v3=[0]*sz v2[n-1]=1 v3[a[n-1]-1]=1 for i...

0.505588

def least_rotation(S: str) -> int: """Booth's algorithm.""" f = [-1] * len(S) # Failure function k = 0 # Least rotation of string found so far for j in range(1, len(S)): sj = S[j] i = f[j - k - 1] while i != -1 and sj != S[k + i + 1]: if sj < S[k + i + 1]: ...

0.505257

class Solution: def getWinner(self, arr: List[int], k: int) -> int: win=0 curr = arr[0] mx=0 for i in range(1,len(arr)): if arr[i] > curr: curr=arr[i] win=0 win=win+1 ...

0.505006

# cook your dish here for _ in range(int(input())): s=input() while(s.count("abc")!=0): s=s.replace("abc","") print(s)

0.504538

class Solution: def modifyString(self, s: str) -> str: if len(s) == 0: return s string = ['#'] string.extend(list(s)) string.append('#') for i in range(1,len(string)-1): if string[i] == '?': for j in range(97,123): i...

0.503928

class Solution: def longestOnes(self, A: List[int], K: int) -> int: hulu = [] cnt = 0 num = A[0] for x in A: if x == num: cnt += 1 else: hulu.append([num,cnt]) cnt = 1 num = x if cnt>0: ...

0.503559

class Solution: def distinctSubseqII(self, s: str) -> int: n = len(s) MOD = 10**9 + 7 seen = dict() a = 1 for i in range(n): char = s[i] b = 2 * a if char in seen: b -= seen[char] b %= MOD ...

0.502259

import copy def process( s ): res = s[:] for i in range( 1, len(s) ): if s[i] == 'G' and s[i - 1] == 'B': res[i], res[i - 1] = res[i - 1], res[i] return res fl = input().split() n = int( fl[0] ) t = int( fl[1] ) s = input().split()[0] S = [] for i in range(n): S.append( s[i] ) for i in range(t): S = process...

0.502183

import math as mt import sys,string input=sys.stdin.readline print=sys.stdout.write import random from collections import deque,defaultdict L=lambda : list(map(int,input().split())) Ls=lambda : list(input().split()) M=lambda : map(int,input().split()) I=lambda :int(input()) t=I() d=defaultdict(str) ml=0 p=0 for _ in r...

0.502047

t = int(input()) def gcd(a,b): if b == 0: return a return gcd(b,a%b) for _ in range(t): n,k = map(int,input().split()) s = input() occ = [0] * 26 for i in s: occ[ord(i)-97] += 1 occ.sort() occ.reverse() for l in range(1,n+1): cycle = gcd(l,k) need = l/...

0.501512

from collections import deque def main(): s = deque(input()) res = [] for i in range(len(s) - 1, -1, -1): if i % 2 == 1: res.append(s.pop()) else: res.append(s.popleft()) print(''.join(res[::-1])) main()

0.501235

from collections import Counter def most_common(s): count = Counter(s) return ''.join(sorted(s, key=lambda c: -count[c]))

0.50045

import re def encoder(s): d, out, it = {},[], iter(s) for c in it: i,k = 0,c while k in d: i,c = d[k], next(it,'') if not c: break k += c d[k] = len(d)+1 out.append(f'{i}{c}') return ''.join(out) def decoder(s): d = [''] for m i...

0.500255

T = int(input()) def call_me(N,A,X): max = 0 ans = '' for i in A: if i.count(X) > max: max = i.count(X) ans = i return ans for i in range(T): N = int(input()) A = list(map(str,input().split())) X = input() print(call_me(N,A,X))

0.500079

''' \"aabcaca\" 0123456 x devide conquer 先找到第一个stamp把string分成左右两部分（必须要）（On 然后从长到短用stamp的头match左边的部分，直到match到最头如果不能到最头则退出从长到短用stamp的尾巴match右边，直到match到尾巴，如果不能match到最尾巴则继续找下一个stamp 能把他分成左右这时的左边有个offset了，比如****b** offset是3，只要stamp的长度不超过头且能match上，就可以这个解法可以有nwin*M^2 其中m平方是在用stamp去match的时候最坏能从stamp最长match到1 可以给出最短...

0.497142

def jumbled_string(s, n): iterations = [s] while True: s = s[::2] + s[1::2] if s == iterations[0]: break iterations.append(s) return iterations[n % len(iterations)]

0.496256

def check(s,k): for i in range(k+1): if chr(ord('0')+i) not in s: return False return True n, k = map(int,input().split()) ans = 0 for i in range(n): ss = input() if check(ss,k): ans +=1 print(ans)

0.494411

class Solution: def maxUniqueSplit(self, s: str) -> int: self.x, n = 0, len(s) def maxUniqueSplit_(i=0, S=set()): if s[i:] not in S: self.x = max(self.x, len(S) + 1) for j in range(i + 1, n): if s[i : j] not in S and len(S) + 1 + n...

0.493718

Given an array A, partition it into two (contiguous) subarrays left and right so that: Every element in left is less than or equal to every element in right. left and right are non-empty. left has the smallest possible size. Return the length of left after such a partitioning. It is guaranteed that such a partitioni...

class Solution: def partitionDisjoint(self, A: List[int]) -> int: biggest = A[0] newbiggest = A[0] lenL = 1 total = 1 for itr in A[1:]: total += 1 if itr < biggest: lenL = total biggest = newbiggest else: ...

0.806186

class Solution: def findLengthOfShortestSubarray(self, arr: List[int]) -> int: n = len(arr) if n<=1: return 0 l,r = n,-1 for i in range(1,n): if arr[i]<arr[i-1]: l = i break # monotonicially increasing ...

0.756488

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ cnt, sm, ism = 0, 0, 0 for i, num in enumerate(arr): sm += num ism += i if sm == ism: cnt += 1 return cnt

0.749503

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ res = 0 temp = sorted(arr) sum1, sum2 = 0, 0 for i in range(0,len(arr)): sum1 += arr[i] sum2 += temp[i] if(sum1 =...

0.711813

class Solution: def maxWidthRamp(self, A: List[int]) -> int: width = 0 icandidate = [0] for i in range(len(A)): if A[i] < A[icandidate[-1]]: icandidate.append(i) for j in range(len(A) - 1, -1, -1): while icandidate and A[icandidate[-1]] <= A[j]...

0.710663

def lis(a): b = [] for c in a: # if len(b) == 0 or c > b[-1] if len(b) == 0 or c > b[-1]: b.append(c) else: l = 0 r = len(b) while l < r-1: m = l+r>>1 # if b[m] <= c: l = m if b[m] < c: l = m ...

0.708151

def bs(arr, val, key=lambda x:x): l, r = 0, len(arr)-1 if key(arr[l])>val: return l if key(arr[r])<=val: return r+1 while l+1<r: m = (l+r)>>1 v = key(arr[m]) if v<=val: l = m else: r = m return r def bs_left(arr,...

0.704619

class Solution: def findUnsortedSubarray(self, nums): """ :type nums: List[int] :rtype: int """ left = 1 size = len(nums) if size == 0: return 0 while left < size and nums[left - 1] <= nums[left]: left += 1 i...

0.701335

class Solution: def findLengthOfLCIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) < 1: return 0 cur_len = 1 max_len = 1 for i in range(1,len(nums)): if nums[i] > nums[i-1]: cur_...

0.678288

class Solution: def minIncrementForUnique(self, A: List[int]) -> int: if not A: return 0 A.sort() prev = A[0] res = 0 for num in A[1:]: if num <= prev: prev += 1 res += prev-num else: ...

0.676059

class Solution: def isvalid(self,C): if len(C)>2: return False if len(C)==1: a = min(C) if a==1 or C[a]==1: # EXPLANATION: # a==1 : All lengths are unitary like A=[1,2,3,4,...], so poping anything is fine # C[a...

0.675377

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.675075

def smaller(arr): # Good Luck! return [len([a for a in arr[i:] if a < arr[i]]) for i in range(0, len(arr))]

0.67338

from bisect import bisect_right def main(): n = int(input()) a = [int(input()) for _ in range(n)] a.reverse() lis = [a[0]] for i in range(1, n): if a[i] >= lis[-1]: lis.append(a[i]) else: lis[bisect_right(lis, a[i])] = a[i] print((len(lis))) def __star...

0.672349

n = int(input()) a = [int(x) for x in input().split()] alive = 0 left = n for i in range(n - 1, -1, -1): if i < left: alive += 1 left = min(left, i - a[i]) print(alive)

0.667033

n=int(input()) arr=[int(x) for x in input().split()] l=[1]*n if sorted(arr)==arr: print('0') else: for i in range(0,len(arr)): for j in range(i): if arr[i]>=arr[j] and l[i]<l[j]+1: l[i]=l[j]+1 print(n-max(l))

0.665591

from heapq import * from collections import Counter class Solution: def minSetSize(self, arr: List[int]) -> int: counter = Counter(arr) size = len(arr) # unique elements (remove half of them) if len(counter) == size: return (size - 1) // 2 + 1 ...

0.6632

def prog(): n = int(input()) inp = list(map(int,input().split())) ans = 0 for i in range(len(inp)): x,y = 0 ,0 for j in range(i,len(inp)): x+=inp[j] y+=100 if(x>y): ans = max(ans,(j-i)+1) print(ans) prog()

0.660732

from collections import defaultdict def fix_progression(arr): res = 0 for i in range(len(arr)): D = defaultdict(int) for j in range(i): q, r = divmod(arr[i]-arr[j], i-j) if not r: D[q] += 1 res = max(res, D[q]) return len(arr)-res-1

0.660259

class Solution: def findShortestSubArray(self, nums): diction = {} for i in nums: if i not in diction: diction[i] = 1 else: diction[i] += 1 degree = max(list(diction.values())) ...

0.659622

class Solution: def maxTurbulenceSize(self, A: List[int]) -> int: if len(A) == 1: return 1 prev = A[1] maxcount = count = 1 + int(A[0] != A[1]) print(count) lastcomp = A[0] < A[1] for a in A[2:]: comp = prev < a if prev == a: ...

0.654386

def artificial_rain(garden): left,area,record = 0,0,1 for i in range(1,len(garden)): if garden[i] < garden[i-1]: left = i elif garden[i] > garden[i-1]: area = max(area,record) record = i - left record += 1 return max(area,record)

0.654342

n=int(input()) a=list(map(int,input().split())) b=0 a[1:]=sorted(a[1:]) while a[0]<=a[-1]: a[-1]-=1 a[0]+=1 b+=1 a[1:]=sorted(a[1:]) print(b)

0.651074

class Solution: def lengthOfLIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 0: return 0 res = [nums[0]] def binarySearch(l,target): left , right = 0 , len(l)-1 while left < right: ...

0.649875

class Solution: def jump(self,nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 1: return 0 else: step = 0 pos = 0 while pos != len(nums) - 1: bestStep = -1 bes...

0.64732

import sys num=int(sys.stdin.readline()) s=sys.stdin.readline().split() sky=list(map(int,s)) sky.reverse() cuts=0 change=0 t=False i=1 while i<len(sky): if sky[i]<=sky[i-1]: for j in range(i-1,-1,-1): if sky[j]<=sky[i]-(i-j): break else: change+=sky[j]-(sky[i]-(i-j)) if change>=sky[i]: ...

0.644442

n = int(input()) ar = list(map(int,input().split(' '))) ar.sort() s=[] for i in ar: s.sort(reverse=True) for j in range(len(s)): if i>=s[j]: s[j]+=1 break else: s.append(1) print(len(s))

0.643843

n, ar = int(input()), [int(x) for x in input().split()][::-1] ans = 0 for i in range(1, n): if ar[i] > ar[i - 1]: ans = n - i break print(ans)

0.643194

class Solution: def longestSubarray(self, nums: List[int]) -> int: if not 0 in nums: return len(nums) - 1 ans = 0 tot = 0 prev = 0 for n in nums: if n == 1: tot += 1 else: ans = max(tot+prev, ans) ...

0.64077

class Solution: def movesToMakeZigzag(self, nums): n = len(nums) res0 = 0 for i in range(0, n, 2): nei = min(nums[j] for j in [i - 1, i + 1] if 0 <= j <= n-1) if nums[i] >= nei: res0 += nums[i] - nei + 1 res1 = 0 for i in range(1, n, 2)...

0.640307

import sys n=0; inp=[]; tree=[];#stores the index of min in range(i,j) def build(node,i,j): if(i>j): return; if(i==j): tree[node]=int(i); return; mid=int( (i+j)/2 ); build(2*node,i,mid) build(2*node+1,mid+1,j) if( inp[ tree[2*node] ] < inp[ tree[2*node+1] ] ): t...

0.639095

# class Solution: # def specialArray(self, nums: List[int]) -> int: # nums.sort(reverse=True) # left, right = 0, len(nums) # while left < right: # mid = left + (right - left) // 2 # if mid < nums[mid]: # left = mid + 1 # else: # ...

0.637266

n = int(input()) a = [int(ai) for ai in input().split()] def solve(x): n = len(x) if sorted(x) == x: return n return max(solve(x[:n//2]), solve(x[n//2:])) print(solve(a))

0.634512

def main(): n = int(input()) arr = sorted(map(int, input().split())) j = 1 for x in arr: if x >= j: j += 1 print(j - 1) return 0 main()

0.634401

class Solution: def findLHS(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums) ret = 0 for i in count: if i+1 in count: ret = max(ret, count[i]+count[i+1]) return ret...

0.634203

class Solution: def getMaxLen(self, nums: List[int]) -> int: maxx = 0 nums.append(0) # starting position # where we find a 0 i = -1 minusarr = [] for j,n in enumerate(nums): if n == 0: # now figure out previous one...

0.634145

n=int(input()) vec=list(map(int,input().split())) al=[] otrez=[] for x in vec: if len(al)==0: al.append(x) elif(x<=al[-1]): otrez.append(al) al=[x] else: al.append(x) otrez.append(al) maxx=0 if(len(otrez)!=1): for i in range(0,len(otrez)-1): if(len(otrez[i])==1)or...

0.633599

import bisect from functools import lru_cache class Solution: def makeArrayIncreasing(self, A: List[int], B: List[int]) -> int: B = sorted(set(B)) @lru_cache(None) def find_larger_value_in_B(val): if val >= B[-1]: return float('inf') return B[bisect...

0.632716

import sys import math input=sys.stdin.readline #sys.setrecursionlimit(1000000) mod=int(1000000007) i=lambda :map(int,input().split()) n=int(input()) a=[int(x) for x in input().split()] t=[[0]*21 for i in range(300005)] for i in range(n): t[i][0]=a[i] def build(n): for j in range(1,20): for i in rang...

0.63178

n = input() v = list(map(int, input().split())) best = 1 current = 1 for i in range(1, len(v)): if v[i-1] <= v[i]: current += 1 else: current = 1 best = max(best, current) print(best)

0.631606

n = int(input()) xs = [int(x) for x in input().split()] seen = {} res = 0 while xs: j = xs.index(xs[0], 1) res += j - 1 xs = xs[1:j] + xs[j+1:] print(res)

0.63068

def main(): import sys input = sys.stdin.readline n = int(input()) arr = list(map(int, input().split())) dct = {} for x in arr: dct[x] = 0 i = 0 while i != n and dct[arr[i]] == 0: dct[arr[i]] = 1 i += 1 if i == n: print(0) r...

0.629776

test=int(input()) for _ in range(test): n=int(input()) ls=list(map(int,input().split())) ls.sort() s=0 for i in range(n): if s>=ls[i]: s=s+1 else: break print(s)

0.629543

from sys import stdin n = int(stdin.readline()) a = list(map(int,stdin.readline().split())) a = [0] + a ans = n dp = [float("inf")] * (n+1) dp[0] = 0 for i in range(1,n+1): nmin = float("inf") for j in range(i-1,-1,-1): if a[j] <= nmin: dp[i] = min(dp[i] , dp[j] + max(0,a[i]-a[j]) + (i-...

0.628523

def consecutive(arr): return max(arr) - min(arr) + 1 - len(arr) if arr else 0

0.628479

rr = lambda: input().strip() rri = lambda: int(rr()) rrm = lambda: list(map(int, rr().split())) def solve(N, A): ans = 0 prev = float('inf') for x in reversed(A): x = min(x, prev - 1) ans += max(x, 0) prev = x return ans for tc in range(1):#rri()): N = rri() A = rrm() ...

0.627171

from collections import Counter class Solution: def longestArithSeqLength(self, A: List[int]) -> int: c = dict(Counter(A).most_common()) # print(c) m1 = max(c.values()) # A = list(set(A)) # A.sort() index = {} # for i in range(len(A)): # index[A[i]...

0.624397

n = int(input()) a = list(map(int, input().split())) maxi = 0 ans = 0 for i in range(n): a[i] -= 1 maxi = max(maxi, a[i]) if maxi == i: ans += 1 print(ans)

0.624356

from collections import deque class Solution: def longestSubarray(self, nums, limit): maxQ, minQ = deque(), deque() i = 0 res = 0 for j, val in enumerate(nums): while maxQ and val > maxQ[-1]: maxQ.pop() while minQ and val < minQ[-1]: minQ.pop() max...

0.624247

n = int(input()) mass = list(map(int, input().split())) left = [1] * n right = [1] * n for i in range(1, n): if mass[i] > mass[i - 1]: left[i] = left[i - 1] + 1 for i in range(n - 2, -1, -1): if mass[i] < mass[i + 1]: right[i] = right[i + 1] + 1 mx = 1 for i in range(n): if i == 0: m...

0.623592

class Solution: def countSmaller(self, nums): """ :type nums: List[int] :rtype: List[int] """ s = sorted(nums) c = [] for n in nums: p = bisect.bisect_left(s, n) c.append(p) s.pop(p) return c

0.623255

def rank_of_element(arr,i): return sum(x <= arr[i] if n < i else x < arr[i] for n,x in enumerate(arr))

0.621496

n=eval(input()) a=list(map(int,input().split())) c=m=0 maxi=max(a) for i in range(n): if a[i]==maxi: c+=1 m=max(c,m) else: c=0 print(m)

0.619825

class Solution: def minSubArrayLen(self, k, nums): """ :type k: int :type nums: List[int] :rtype: int """ if not nums: return 0 _min = float('inf') _sum = 0 j = 0 for i ,n in enumerate(nums): _su...

0.619728

# -*- coding: utf-8 -*- from time import perf_counter from sys import stdin def run(n, s): m = 0 small = n // 2 for big in range(n-1, (n+1)//2-1, -1): while small >= 0 and s[small] > s[big] / 2: small -= 1 if small == -1: break #print(small, big) smal...

0.618937

input() memory = list(map(int, input().split())) proc_data = {p: (-1, -1) for p in memory} for i, c in enumerate(memory): d1, d2 = proc_data[c] if d1 == -1: d1 = i d2 = i proc_data[c] = (d1, d2) try: del proc_data[0] except KeyError: print("0") return data = list(proc_data.values()) data.sor...

0.618688

def segment_cover(A, L): n=1 s=min(A) for i in sorted(A): if s+L<i: s=i n+=1 return n

0.6177

n=int(input()) p=list(map(int,input().split())) c=1 q=p[0] for i in range(1,n): q=min(q,p[i]) if p[i]<=q: c+=1 print(c)

0.61625

import sys from bisect import * sys.stdin = open('input.txt', 'r') sys.stdout = open('output.txt', 'w') ans=n=int(input()) a=sorted(map(int,sys.stdin.readline().split())) for i in range(n):ans=min(ans,n-bisect_right(a,a[i]*2)+i) print(ans)

0.615678

def minimum_steps(arr, n): arr = sorted(arr) s = 0 for i,v in enumerate(arr): s += v if s >= n: return i

0.615116

def largest_rect(h): st=[]; m=0; i=0 while i<len(h): if len(st)==0 or h[st[-1]]<=h[i]: st.append(i); i+=1 else: l=st.pop(); m=max(m, h[l]*(i if len(st)==0 else i-st[-1]-1)) while len(st)>0: l=st.pop(); m=max(m, h[l]*(i if len(st)==0 else i-st[-1]-1)) return m

0.610719

class Solution: def findMin(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) <= 3: return min(nums) lo = 0 hi = len(nums) - 1 mid = (hi + lo) // 2 if nums[mid] < nums[mid-1] and nums[mid] < nums[mid+1]:...

0.610395

# -*- coding: utf-8 -*- """ Created on Sun Apr 2 22:42:34 2017 @author: Sean38 """ n = int(input().rstrip()) s = input() a = [int(ch) for ch in s.split()] a = a[0:n] a.sort() def check_num(p, i): # i = ap + b(p+1) # min(a+b) <=> max(b) # b(p+1) <= i # b == i (mod p) max_b = (i // (p + 1)) b...

0.610188

for __ in range(int(input())): n = int(input()) ar = list(map(int, input().split())) ar.reverse() ans = n - 1 flag = False for i in range(1, n): if ar[i] < ar[i - 1]: flag = True if flag: if ar[i] > ar[i - 1]: break ans -= 1 pri...

0.608968

def peak(arr): for i, val in enumerate(arr): if sum(arr[:i]) == sum(arr[i+1:]): return i return -1

0.608956

import bisect; def getIntList(): return list(map(int, input().split())); def getTransIntList(n): first=getIntList(); m=len(first); result=[[0]*n for _ in range(m)]; for i in range(m): result[i][0]=first[i]; for j in range(1, n): curr=getIntList(); for i in range(m): ...

0.608556

n = int(input()) ans = 0 stk = [] for v in map(int, input().split()): last = 0 while len(stk) and stk[-1][0] < v and stk[-1][1]: last = max(last, stk[-1][1]) del stk[-1] if not len(stk) or stk[-1][0] < v: stk.append((v, 0)) else: stk.append((v, last + 1)); ans = max(ans,...

0.607885

# O(n) time and space # Hashmap and array # Count number then count occurrence: # Count the occurrences of each number using HashMap; # Keep a count of different occurences # From small to big, for each unvisited least frequent element, deduct from k the multiplication with the number of elements of same occurrence, ch...

0.607814

# cook your dish here n=int(input()) arr=[int(x) for x in input().split()] ans=n-1 while(ans>0 and arr[ans]==arr[ans-1]):ans-=1 print(ans+1)

0.607582

x=int(input()) l=list(map(int, input().split(' '))) l.sort() a=1 for i in l: if i>=a: a+=1 print(a)

0.607121

class Solution: def findMin(self, nums): """ :type nums: List[int] :rtype: int """ min = nums[0] start, end = 0, len(nums) - 1 while start<end: mid = (start+end)//2 if nums[mid]>nums[end]: start = mid+1 ...

0.606605

class Solution: def arrayNesting(self, nums): """ :type nums: List[int] :rtype: int """ best = 0 n = len(nums) p = [] for i in range(len(nums)): j = i current = 0 while nums[j] != -1: cur...

0.606469

N = int(input()) ds = [] mochidan = 0 for i in range(N): ds.append(int(input())) while ds: tmp = max(ds) ds = [j for j in ds if j < tmp] mochidan += 1 print(mochidan)

0.606439

class Solution: def trap(self, height): """ :type height: List[int] :rtype: int """ if not height: return 0 result = 0 left = 0 right = len(height) - 1 while left < right: if height[left] <= height[right]: ...

0.606001

class Solution: def findMaxConsecutiveOnes(self, nums): """ :type nums: List[int] :rtype: int """ if nums == []: return 0 count = 0 countMax =0 for ele in nums: if ele == 1: count += 1 ...

0.605089

n = int(input()) a = list(map(int,input().split())) m = max(a) current = 0 longest = 0 for x in a: if x == m: current +=1 else: longest = max(current,longest) current = 0 longest = max(current,longest) print (longest)

0.604748

n = int(input()) a = [int(x) for x in input().split()] a.sort() num = 0 res = 0 for i in range(n): if int(a[i]) >= num: res += 1 num += int(a[i]) #print(res, a[i]) print(res)

0.604181

# cook your dish here n = int(input()) l = list(map(int, input().strip().split())) m = 0 f = [] for e in l: if(e != 0): m = m+1 else: f.append(m) m = 0 f.append(m) print(max(f))

0.604143

for _ in range(int(input())): n = int(input()) A = list(map(int, input().split())) m = 10 ** 9 c = 0 for i in range(n - 1, -1, -1): if A[i] <= m: m = A[i] else: c += 1 print(c)

0.604116

mod = 1000000007 eps = 10**-9 inf = 10**9 def main(): import sys input = sys.stdin.readline class Bit: def __init__(self, n): self.size = n self.tree = [0] * (n + 1) def sum(self, i): s = 0 while i > 0: s += self.tree[i] ...

0.603443

def f(n): s = list(map(int, input().split())) low = [] high = [] for i in range(n - 1): low.append(min(s[i], s[i+1])) high.append(max(s[i], s[i+1])) low.sort() high.sort() curr = mx = 0 i = j = 0 n -= 1 while i < n and j < n: if low[i] < high[j]: i += 1 curr += 1 else: j += 1 curr -= 1 ...

0.602055

l = 0 r = -1 segL, time = [int(x) for x in input().split()] a = [int(x) for x in input().split()] segSum = 0 segments = [] ##while r < segL-1: ## r += 1 ## segSum += a[r] ## if segSum == time: ## segments.append(r+1-l) ## elif segSum > time: ## segments.append(r-l) ## while segSum > ...

0.601501

from collections import defaultdict def calcBinomials(N): nonlocal binom N += 1 binom = [[0]*N for _ in range(N)] for n in range(N): binom[n][0] = binom[n][n] = 1 for k in range(1, n): binom[n][k] = binom[n-1][k] + binom[n-1][k-1] n = int(input()) a = list(map(int, input()....

0.600806

n = int(input()) a = list(map(int, input().split())) mx, cnt = 1, 1 for i in range(1, n): if a[i] > a[i - 1]: cnt += 1 else: cnt = 1 mx = max(mx, cnt) print(mx)

0.600381

from sys import stdin, stdout n = int(stdin.readline().rstrip()) p = list(map(int,stdin.readline().rstrip().split())) if n==1: print(p[0]) else: removeDict={i:0 for i in range(1,n+1)} l1 = p[0] removeDict[l1]-=1 l2 = 0 for i in range(1,n): if p[i]>l2: if p[i]>l1: ...

0.59965

class Solution: def longestMountain(self, A: List[int]) -> int: up=0 down=0 ans=0 for i in range(0,len(A)-1): if A[i]<A[i+1]: if down==0: up+=1 else: up=1 down=0 ...

0.599464

def main(): from sys import stdin, stdout for _ in range(int(stdin.readline())): n = int(stdin.readline()) inp1 = [-1] * (n + 1) inp2 = [-1] * (n + 1) for i, ai in enumerate(map(int, stdin.readline().split())): if inp1[ai] < 0: inp1[ai] = i ...

0.599166

n = int(input()) a = list(map(int, input().split())) dp = [[False] * (n + 1) for i in range(n + 1)] def solve(l, r): if dp[l][r]: return dp[l][r] if r - l == 1: dp[l][r] = (a[l], 1) return dp[l][r] tmp = 10 ** 9 for i in range(l + 1, r): if solve(l, i)[0] == -1 or solve...

0.599019

#!/usr/bin/env python3 n = int(input()) a = [int(x) for x in input().split()] sorted_a = sorted(a) dict_a = {} for x in a: if not x in dict_a: dict_a[x] = 1 else: dict_a[x] += 1 sorted_uniq_a = sorted(dict_a.keys()) max_fib_prefix = [a[0], a[1]] for i in range(0, len(sorted_uniq_a)): for...

0.598613

class Solution: def minMoves(self, nums): """ :type nums: List[int] :rtype: int """ minx=min(nums) sums=sum(nums) return sums-len(nums)*minx

0.597493

N = int(input()) H = [int(i) for i in input().split()] count = 0 ans = 0 for i in range(N-1): if(H[i] >= H[i+1]): count += 1 else: ans = max(ans,count) count = 0 print(max(ans,count))

0.596245

n,s = map(int,input().split()) A = list(map(int,input().split())) if A[s-1] != 0: per = 1 A[s-1] = 0 else: per = 0 A.sort() maxs = max(A) ans = [0] * (maxs + 1) answer = maxs + 1 o = -1 for j in range(n): if A[j] == 0: o += 1 if ans[A[j]] == 0: ans[A[j]] = 1 answer -= 1 ...

0.596014

n = int(input()) a = [0] + list(map(int, input().split())) + [1001] mx = 1 p = 1 for i in range(1, n + 2): if a[i] == a[i - 1] + 1: p += 1 mx = max(p, mx) else: p = 1 print(max(0, mx - 2))

0.592641

n = int(input()) u = [int(u) for u in input().split()] NMAX = 100005 suma = [0 for _ in range(NMAX)] total = [0 for _ in range(NMAX)] diferentes = 0 sol = 0 maximo = 1 for i, v in enumerate(u): if total[v] == 0: diferentes += 1 else: suma[total[v]] -= 1 total[v] += 1 suma[total[v]] += 1 maximo = max(maxim...

0.592054

class Solution(object): def hIndex(self, citations): """ :type citations: List[int] :rtype: int """ n = len(citations) l = 0 r = n-1 while l <= r: m = (l + r) // 2 if m == 0 and citations[m] >= n - m or citations[m-1...

0.591216

x = int(input()) l = list(map(int, input().split(' '))) if min(l) == max(l): print(0) else: print(x-l.count(min(l))-l.count(max(l)))

0.59112

class Solution: def maxArea(self, height): """ :type height: List[int] :rtype: int """ # l = [] # maxH = 0 # for i in range(len(height)-1, -1, -1): # if height[i] > maxH: # maxH = height[i] # l.append((i, ...

0.5905

read = lambda: map(int, input().split()) n = int(input()) a = list(read()) was = [0] * (n + 1) bal = ans = 0 for i in a: if was[i]: bal -= 1 else: bal += 1 was[i] = 1 ans = max(ans, bal) print(ans)

0.590269

class Solution: def minDeletionSize(self, A: List[str]) -> int: def isSorted(arr, i, j): return all(arr[k] <= arr[k+1] for k in range(i, j)) ans = 0 ranges = [[0, len(A)-1]] for col in zip(*A): if not ranges: break if all(isSorted(c...

0.589869

n = int(input()) A = [int(x) for x in input().split()] mn = min(A) I = [i for i in range(len(A)) if A[i] == mn] mindiff = min(I[i]-I[i-1] for i in range(1,len(I))) print(mindiff)

0.589843

N, I = list(map(int, input().split())) A = sorted([int(a) for a in input().split()]) B = [] j = 0 for i in range(N): if i == 0 or A[i] == A[i-1]: B.append(j) else: j += 1 B.append(j) def calc(k): K = 1<<k i = 0 j = 0 ma = 0 while j < N: if B[j]-B[i] <= K - 1:...

0.589762

A password is considered strong if below conditions are all met: It has at least 6 characters and at most 20 characters. It must contain at least one lowercase letter, at least one uppercase letter, and at least one digit. It must NOT contain three repeating characters in a row ("...aaa..." is weak, but "...aa.....

class Solution: def strongPasswordChecker(self, s): """ :type s: str :rtype: int """ def length_requirement(password): length = len(password) # positive means addition, negative means deletion if length < 6: return...

0.867784

class Solution: def longestAwesome(self, s: str) -> int: cum = [0] firsts = {0: -1} lasts = {0: -1} for i, c in enumerate(s): cum.append(cum[-1] ^ (1 << (ord(c) - 48))) if cum[-1] not in firsts: firsts[cum[-1]] = i lasts[cum[-1]] = ...

0.586284

class Solution: def findMinStep(self, board, hand): """ :type board: str :type hand: str :rtype: int """ res=float("inf") hmap=collections.defaultdict(int) for c in hand: hmap[c]+=1 res=self.helper(board,hmap) if...

0.573148

from re import findall; repeat_adjacent=lambda s: len(findall(r"((.)\2+(?!\2)){2,}",s))

0.57218

def string_constructing(a, s): if len(s) == 0: return 0 i = -1 for j, c in enumerate(s): i = a.find(c, i+1) if i < 0 or i == len(a) - 1: break return len(a) - j + (i < 0) + string_constructing(a, s[j + (i >= 0):])

0.566845

def countzero(s): return sum(1 if c in 'abdegopq069DOPQR' else 2 if c in '%&B8' else 0 for c in s.replace('()', '0'))

0.564822

import re def buy_newspaper(s1, s2): p = re.sub(r"(.)", r"\1?", s1) return -1 if set(s2) - set(s1) else len(re.findall(p, s2)) - 1

0.56444

def duplicate_count(s): return len([c for c in set(s.lower()) if s.lower().count(c)>1])

0.560731

def base_finder(seq): return len(set(''.join(seq)))

0.556674

def solve(st): return next((n for n in range(len(st)//2, 0, -1) if st[:n] == st[-n:]), 0)

0.555238

import re def slogans(p,r): reg=re.compile("|".join([p[i:] for i in range(len(p))])) return len(re.findall(reg,r))

0.55458

CRITERIA = (str.islower, str.isupper, str.isdigit) def password(s): return len(s)>7 and all( any(map(f,s)) for f in CRITERIA)

0.552165

def permute_a_palindrome (input): return sum( input.count(c)%2 for c in set(input) ) < 2

0.550858

def solution(s): st=[1 for i in range(1,len(s)) if s[i-1]==s[i]] return sum(st)

0.548613

def solve(s): uc, lc, num, sp = 0, 0, 0, 0 for ch in s: if ch.isupper(): uc += 1 elif ch.islower(): lc += 1 elif ch.isdigit(): num += 1 else: sp += 1 return [uc, lc, num, sp]

0.547915

H, W = 6, 8 KEYBOARD = [ "abcde123fghij456klmno789pqrst.@0uvwxyz_/\u000e ", "ABCDE123FGHIJ456KLMNO789PQRST.@0UVWXYZ_/\u000e ", "^~?!'\"()-:;+&%*=<>€£$¥¤\\[]{},.@§#¿¡\u000e\u000e\u000e_/\u000e "] MAP = [ {c: (i//W, i%W) for i,c in enumerate(KEYBOARD[x])} for x in range(len(KEYBOARD)) ]...

0.546998

class Solution: def longestPalindrome(self, s): """ :type s: str :rtype: int """ re = 0 set_s = set(s) flag = False for x in set_s: if s.count(x) % 2 == 0: re += s.count(x) elif s.count(x) >= 3 : ...

0.546175

class Solution: def findSubstringInWraproundString(self, p): """ :type p: str :rtype: int """ pc = None sl = 0 ll = {} for c in p: if pc and (ord(pc) + 1 == ord(c) or (pc == 'z' and c == 'a')): sl += 1 ...

0.54483

def string_cnt(s): try: if s.isalpha(): return sum(ord(a) for a in s.upper()) except AttributeError: pass return 0 def compare(s1, s2): return string_cnt(s1) == string_cnt(s2)

0.544602

import re KEYBOARD = "abcde123fghij456klmno789pqrst.@0uvwxyz_/* " MAP = {c: (i//8, i%8) for i,c in enumerate(KEYBOARD)} def manhattan(*pts): return 1 + sum( abs(z2-z1) for z1,z2 in zip(*pts)) def toggle(m): ups, end = m.group(1), m.group(2) off = '*' * bool(end) return f'*{ups.lower()}{off}{end}' ...

0.542107

from operator import mul from functools import reduce from collections import Counter from math import factorial as fact def uniq_count(s): return fact(len(s)) // reduce(mul, map(fact, Counter(s.lower()).values()), 1)

0.539271

KEYBOARD = "abcde123fghij456klmno789pqrst.@0uvwxyz_/" MAP = {c: (i//8, i%8) for i,c in enumerate(KEYBOARD)} def manhattan(*pts): return sum( abs(z2-z1) for z1,z2 in zip(*pts)) def tv_remote(word): return len(word) + sum( manhattan(MAP[was], MAP[curr]) for was,curr in zip('a'+word, word))

0.539248

from re import sub def encode(string): return sub(r'(.)\1*', lambda m: str(len(m.group(0))) + m.group(1),string) def decode(string): return sub(r'(\d+)(\D)', lambda m: m.group(2) * int(m.group(1)),string)

0.538092

def replace_zero(arr): m, im, i, lst = 0, -1, -1, ''.join(map(str,arr)).split('0') for a,b in zip(lst,lst[1:]): i += len(a) + 1 candidate = len(a)+len(b)+1 if m <= candidate: im, m = i, candidate return im

0.536563

#include<sdg.h> for _ in range(int(input())): s=input() n=len(s) if n==1: if s[0].isalpha(): print("-32") else: print(0) else: num,ch=0,0 p,q=0,0 c=1 x=s[0] ans="" for i in range(1,n): if s[i-1]==s[i]: c+=1 ...

0.536197

import re H, W = 6, 8 KEYBOARD = "abcde123fghij456klmno789pqrst.@0uvwxyz_/* " MAP = {c: (i//W, i%W) for i,c in enumerate(KEYBOARD)} def manhattan(*pts): dxy = [abs(z2-z1) for z1,z2 in zip(*pts)] return 1 + sum( min(dz, Z-dz) for dz,Z in zip(dxy, (H,W)) ) def toggle(m): ups, end = m.groups() ...

0.534469

import re pattern = re.compile('o(.*?)d(.*?)d') def odd(s): n = 0 while pattern.search(s): n += 1 s = pattern.sub(r'\1\2', s, count=1) return n

0.534312

from itertools import groupby def count_repeats(s): return len(s) - len(list(groupby(s)))

0.533672

def solve(s): return sum(i+1 for i,d in enumerate(list(s)) if d in '13579')

0.532284

import re; def check_password(s): if re.search('^(?=.*?[a-z])(?=.*?[A-Z])(?=.*?\d)(?=.*?[!@#$%^&*?])[a-zA-Z\d!@#$%^&*?]{8,20}$', s) : return 'valid' else: return 'not valid'

0.531955

def prefix1(a, b): cnt = 0 for i, j in zip(a, b): if i == j: cnt += 1 else: return cnt return cnt def prefix2(a, b, num): for i in range(num, -1, -1): if b.startswith(a[:i]): return i def zfunc(str_): z = [] k = len(str_) for i ...

0.529933

def palindrome_rearranging(s): return sum(s.count(c) % 2 for c in set(s)) < 2

0.529606

def self_converge(number): n, cycle = str(number), set() while n not in cycle: cycle.add(n) s = ''.join(sorted(n)) n = '%0*d' % (len(n), int(s[::-1]) - int(s)) return -1 if not int(n) else len(cycle)

0.525694

def count_subsequences(needle, haystack): count = [1] + [0] * len(needle) for a in haystack: count = [1] + [count[i] + count[i-1] * (a == b) for i, b in enumerate(needle, 1)] return count[-1] % 10 ** 8

0.525376

def frequency(s,n): f=[[0 for i in range(26)]for j in range(n+1)] count=0 for i in range(n): if s[i]!="#": f[count][ord(s[i])-97]+=1 else: count+=1 for j in range(26): f[count][j]=f[count-1][j] return (f,count) def solve(s): n=...

0.524899

def contamination(text, char): return char*len(text)

0.524491

from operator import mul from math import factorial from functools import reduce from collections import Counter def perms(inp): return factorial(len(str(inp))) // reduce(mul, map(factorial, Counter(str(inp)).values()), 1)

0.522694

def change(st): new = "" st = st.lower() for letter in "abcdefghijklmnopqrstuvwxyz": if letter in st: new += "1" else: new += "0" return new

0.522575

def more_zeros(s): results = [] for letter in s: dec_repr = bin(ord(letter))[2:] if (dec_repr.count("0") > dec_repr.count("1")) and (letter not in results): results.append(letter) return results

0.521856

from itertools import combinations def strings_crossover(arr, result): return sum(1 for s1,s2 in combinations(arr,2) if all(r in (x,y) for x,y,r in zip(s1,s2,result)))

0.521119

from itertools import product def is_divisible_by_6(s): if s[-1] in '13579': return [] ss = s.replace('*','{}') return [ v for v in (ss.format(*p) for p in product(*(['0123456789']*s.count('*')))) if not int(v)%6]

0.52094

import math def strong_num(number): return "STRONG!!!!" if sum(math.factorial(int(i)) for i in str(number)) == number else "Not Strong !!"

0.520158

import re def compare(a, b): return a if specificity(a) > specificity(b) else b def specificity(s): return [len(re.findall(r, s)) for r in (r'#\w+', r'\.\w+', r'(^| )\w+')]

0.520064

def is_incrementing(number): return str(number) in '1234567890' def is_decrementing(number): return str(number) in '9876543210' def is_palindrome(number): return str(number) == str(number)[::-1] def is_round(number): return set(str(number)[1:]) == set('0') def is_interesting(number, awesome_phrases): test...

0.519203

def numericals(s): dictio = {} t = "" for i in s: dictio[i] = dictio.get(i,0) + 1 t += str(dictio[i]) return t

0.515782

X = [[], ['0', '1'], ['00', '01', '10', '11'], ['001', '010', '011', '100', '101', '110'], ['0010', '0011', '0100', '0101', '0110', '1001', '1010', '1011', '1100', '1101'], ['00100', '00101', '00110', '01001', '01011', '01100', '01101', '10010', '10011', '10100', '10110', '11001', '11010', '11011'], ['001001', '001011'...

0.514062

s= input() color = "chokudai" d = [] for c in s: if c != color: d.append(c) color = c print(len(d)-1)

0.513363

from collections import Counter from functools import reduce from math import gcd def has_subpattern(string): return reduce(gcd, Counter(string).values()) != 1

0.512438

from functools import lru_cache def failure(pat): i, target, n = 1, 0, len(pat) res = [0] while i < n: if pat[i] == pat[target]: target += 1 res.append(target) i+=1 elif target: target = res[target-1] else: res.append(0) ...

0.511878

def colorful(number): base_result = [] for x in str(number): base_result.append(int(x)) for y in range(len(base_result) - 1): temp = base_result[y] * base_result[y + 1] base_result.append(temp) # Should you really eval the last value ? :shrug: If so, would use eval return len...

0.511608

def levenshtein(a,b): d = [[0] * (len(b) + 1) for _ in range(len(a) + 1)] d[0][:] = list(range(len(b)+1)) for i in range(1, len(a) + 1): d[i][0] = i for i, x in enumerate(a): for j, y in enumerate(b): d[i+1][j+1] = min(1 + d[i][j+1], 1 + d[i+1][j], d[i][j] + (1 if x != y el...

0.510654

def string_hash(s): a = sum(ord(c) for c in s) b = sum(ord(b) - ord(a) for a, b in zip(s, s[1:])) c = (a | b) & (~a << 2) return c ^ (32 * (s.count(" ") + 1))

0.510642

import re def trump_detector(ts): x=re.findall(r'([aeiou])(\1*)',ts,re.I) y=[len(i[1]) for i in x] return round(sum(y)/len(y),2)

0.509605

class Solution: def minCut(self, s): """ :type s: str :rtype: int """ # acceleration if s == s[::-1]: return 0 if any(s[:i] == s[:i][::-1] and s[i:] == s[i:][::-1] for i in range(1, len(s))): return 1 # algorithm cut = [x for x in ran...

0.508097

s=input() if(len(s)<=3): print(0) else: n=len(s) ans=0 A=0 for i in range(3,n): if(s[i-3]+s[i-2]+s[i-1]+s[i]=='bear'): ans+=((i-3)-A+1)*(n-i) A=i-2 print(ans)

0.50779

from collections import Counter from functools import reduce from fractions import gcd def has_subpattern(s): c = Counter(s) m = reduce(gcd, c.values()) return ''.join(sorted(k*(v//m) for k,v in c.items()))

0.507329

def tiaosheng(a): j, t = 0, 0 for j in a: t += 3 if j + t > 60: return min(j, 60-t+3) return 60-t

0.507235

class Solution: def minDeletionSize(self, A: List[str]) -> int: return sum([list(col) != sorted(col) for col in zip(*A)])

0.506851

def words_to_marks(s): return sum(ord(c)-96 for c in s)

0.506716

s = input() res = set() for i in range(len(s) + 5): s = s[1:] + s[0] res.add(s) print(len(list(res)))

0.506688

import sys from math import * def minp(): return sys.stdin.readline().strip() def mint(): return int(minp()) def mints(): return map(int, minp().split()) def add(a,b): return (a+b)%1000000007 def sub(a,b): return (a+1000000007-b)%1000000007 def mul(a,b): return (a*b)%1000000007 p = 102367 s = list(map(int,...

0.505967

class Solution: def countSubstrings(self, s): """ :type s: str :rtype: int """ ret = 0 left, right = 0, 0 while left < len(s): while right < len(s) and s[right] == s[left]: right += 1 ret += self.sum(right - l...

0.505888

SWAP = {'i': '1', 'I': '1', 'o': '0', 'O': '0', 's': '5', 'S': '5'} def make_password(phrase): return ''.join(SWAP.get(a[0], a[0]) for a in phrase.split())

0.505799

class Solution: def ladderLength(self, beginWord, endWord, wordList): wordDict = set(wordList) if not endWord in wordDict: return 0 visited = set() beginSet = set() beginSet.add(beginWord) visited.add(beginWord) endSet = set() ...

0.505326

def find_missing(sequence): t = sequence return (t[0] + t[-1]) * (len(t) + 1) / 2 - sum(t)

0.505197

# cook your dish here from collections import deque, defaultdict from math import sqrt, ceil,factorial import sys import copy def get_array(): return list(map(int, sys.stdin.readline().strip().split())) def get_ints(): return map(int, sys.stdin.readline().strip().split()) def input(): return sys.stdin.readline()...

0.505141

from functools import reduce def permutation_position(perm): return reduce(lambda t,c:t*26+ord(c)-97,perm,0)+1

0.504278

def count_pal(n): # No recursion; direct calculation: return [9 * 10**((n-1) // 2), 10**(n // 2) * (13 - 9 * (-1)**n) // 2 - 2]

0.504254

def find_longest(st): res,pos=0,[0] for i,b in enumerate(st,1): if b=="(": pos.append(i) else: try:pos.pop();res=max(res,i-pos[-1]) except:pos.append(i) return res

0.503812

def folding(a,b): squares = 1 while a != b: squares += 1 b, a = sorted((a - b, b)) return squares

0.503785

class Solution: def getMaxRepetitions(self, s1, n1, s2, n2): """ :type s1: str :type n1: int :type s2: str :type n2: int :rtype: int """ if s2=='aac' and n2==100: return 29999 i,j=0,0 l1=len(s1) l2=len(s...

0.503777

''' \"aabcaca\" 0123456 x devide conquer 先找到第一个stamp把string分成左右两部分（必须要）（On 然后从长到短用stamp的头match左边的部分，直到match到最头如果不能到最头则退出从长到短用stamp的尾巴match右边，直到match到尾巴，如果不能match到最尾巴则继续找下一个stamp 能把他分成左右这时的左边有个offset了，比如****b** offset是3，只要stamp的长度不超过头且能match上，就可以这个解法可以有nwin*M^2 其中m平方是在用stamp去match的时候最坏能从stamp最长match到1 可以给出最短...

0.503294

def bin_str(s): return s.count("10") * 2 + (s[-1] == "1")

0.50315

s=input() dp=[[0,0,0] for i in range(len(s))] for i in range(len(s)): if s[i]=='a': dp[i][0]=dp[i-1][0]+1 dp[i][1]=dp[i-1][1] dp[i][2]=max(dp[i-1][1]+1,dp[i-1][2]+1) else: dp[i][0]=dp[i-1][0] dp[i][1]=max(dp[i-1][0]+1,dp[i-1][1]+1) dp[i][2]=dp[i-1][2] e=len(s)-1 p...

0.502152

class Solution: def getHint(self, secret, guess): """ :type secret: str :type guess: str :rtype: str """ s_count = collections.defaultdict(int) g_count = collections.defaultdict(int) bull_cnt = 0 # first iteration can get bull_cnt imm...

0.501945

class Solution: def minDeletionSize(self, A: List[str]) -> int: dp = [(1, 1)] * len(A[0]) for i in range(len(dp)): if i > 0: max_pre = None for pre in range(i - 1, -1, -1): for word in A: if word[pre] > word[i]: ...

0.501885

# cook your dish here x=input () y=len (x) if y==1: print('1') elif y==2: print('2') elif y==3: print('3') elif y>3: print('More than 3 digits')

0.500491

def get_char_count(s): counts = {} for c in (c.lower() for c in s if c.isalnum()): counts[c] = counts[c] + 1 if c in counts else 1 m = {} for k, v in counts.items(): m[v] = sorted(m[v] + [k]) if v in m else [k] return m

0.500165

def calc(s): total1 = ''.join(map(lambda c: str(ord(c)), s)) total2 = total1.replace('7', '1') return sum(map(int, total1)) - sum(map(int, total2))

0.499237

def count_correct_characters(c, g): if len(c) != len(g): raise Exception('Error') return sum(1 for i,j in zip(c,g) if i==j)

0.499132

from re import compile, finditer OMIT = {'a', 'the', 'on', 'at', 'of', 'upon', 'in', 'as'} REGEX = compile(r'[a-z]+') def word_count(s): return sum(a.group() not in OMIT for a in finditer(REGEX, s.lower()))

0.498803

from itertools import groupby def replace(s): queue, rle = {}, [[i, k, len(list(g))] for i, (k, g) in enumerate(groupby(s))] for i, k, l in reversed(rle): if l not in queue: queue[l] = {} queue[l].setdefault(k, []).append(i) for l in queue: while sum(map(bool, queue[l].values())) > ...

0.498778

g = "ACTG" def dist(a, b): p = abs(ord(a) - ord(b)) return min(p, 26 - p) def price(s): return sum(dist(x, y) for x, y in zip(g, s)) n = int(input()) s = input() ans = 100000 for i in range(len(s) - 3): ans = min(ans, price(s[i:i+4])) print(ans)

0.498375

def solve(st): return all(True if ord(x) - ord(y) in [-2, 0, 2] else False for x, y in zip(st, st[::-1]))

0.498348

s = input().strip() flag1 = len(s) >= 5 d1 = 'qwertyuiopasdfghjklzxcvbnm' d2 = 'QWERTYUIOPASDFGHJKLZXCVBNM' d3 = '123456789' flag2 = False flag3 = False flag4 = False for i in d1: if i in s: flag2 = True for i in d2: if i in s: flag3 = True for i in d3: if i in s: flag4 = True if(...

0.498049

class Solution: def numSplits(self, s: str) -> int: left = [0]*len(s) unique = set() n_distinct = 0 for i, l in enumerate(s): if l not in unique: unique.add(l) n_distinct += 1 left[i] = n_distinct count...

0.497259

class Solution: def findLength(self, A, B): def check(length): seen = {A[i:i+length] for i in range(len(A) - length + 1)} return any(B[j:j+length] in seen for j in range(len(B) - length + 1)) A = ''.join(map(chr, A)) ...

0.497136

def consonant_count(str): return sum(1 for c in str if c.isalpha() and c.lower() not in "aeiou")

0.497016

import re reg = re.compile('a*b*c*d*e*f*g*h*i*j*k*l*m*n*o*p*q*r*s*t*u*v*w*x*y*z*') def longest(s): return max(reg.findall(s), key=len)

0.496905

class Solution: def maxLength(self, arr: List[str]) -> int: def digit_representation(s): ans = 0 for c in s: ans |= 1<<(ord(c)-ord('a')) return ans A = sorted([(len(s), digit_representation(s)) for s in set(arr) if len(set(s))==len(s)], re...

0.49672

from itertools import cycle def find_pattern(s): diffs = [y - x for x, y in zip(s, s[1:])] for i in range(1, len(diffs) + 1): if len(diffs) % i == 0 and all(a == b for a, b in zip(diffs, cycle(diffs[:i]))): return diffs[:i]

0.496619

class Solution: def kSimilarity(self, A: str, B: str) -> int: a = '' b = '' for i in range(len(A)): if A[i] != B[i]: a+=A[i] b+=B[i] return self.dfs(a,b) def dfs(self,a,b): if not a: ...

0.496534

def shift_left(a, b): r = len(a) + len(b) for i in range(-1, -min(len(a), len(b)) - 1, -1): if a[i] != b[i]: break r -= 2 return r

0.496423

class Solution: def numDistinct(self, s, t): """ :type s: str :type t: str :rtype: int """ setOft=set(t) news="" for ch in s: if ch in setOft: news+=ch dp=[[1 for i in range(len(news)+1)] for j in range(l...

0.496103

class Solution: def originalDigits(self, s): """ :type s: str :rtype: str """ dmap={} dmap[0]=s.count('z') dmap[2]=s.count('w') dmap[4]=s.count('u') dmap[6]=s.count('x') dmap[8]=s.count('g') dmap[1]=s.count('o')-dmap...

0.495758

def infected_zeroes(s): m=0; l=0 for i,n in enumerate(s): if n==0: m=i if l==0 else max(m, (i-l+1)//2); l=i+1 return max(m,len(s)-l)

0.494826

class Solution: def numSteps(self, s: str) -> int: i, mid_zero = 0 , 0 for j in range(1, len(s)): if s[j] == '1': mid_zero += j -i - 1 i = j if i == 0: return len(s)-1 return mid_zero + 1 + len(s)

0.494227

def count_char(s,c): return s.lower().count(c.lower())

0.494203

""" *************************************** * O(n) time complexity solution ! * *************************************** """ def longest_palindrome (s): maxPal, tmpPal = 0, 1 count_dct = {} inPal = False for i,l in enumerate(s): count_dct[l] = count_dct.get(l,0) + 1 ...

0.494151

def solve(s): return max(map(len, ''.join(c if c in 'aeiou' else ' ' for c in s).split()))

0.49415

def catch_sign_change(lst): count = 0 for i in range(1,len(lst)): if lst[i] < 0 and lst[i-1] >= 0:count += 1 if lst[i] >= 0 and lst[i-1] < 0:count += 1 return count

0.494033

In universe Earth C-137, Rick discovered a special form of magnetic force between two balls if they are put in his new invented basket. Rick has n empty baskets, the ith basket is at position[i], Morty has m balls and needs to distribute the balls into the baskets such that the minimum magnetic force between any two ba...

class Solution: def maxDistance(self, position: List[int], m: int) -> int: position.sort() max_distance_between = (position[-1] - 1) // (m - 1) min_distance_between = 1 if self.isDistancePossible(max_distance_between, position, m): return max_distance_between ...

0.837146

class Solution: def findLatestStep(self, arr: List[int], m: int) -> int: A = arr if m == len(A): return m length = [0] * (len(A) + 2) res = -1 for i, a in enumerate(A): left, right = length[a - 1], length[a + 1] if left == m or right == m:...

0.796929

import itertools def f(n): return n * (n - 1) / 2 + 1 if n % 2 else n * (n - 1) / 2 + n / 2 n, m = list(map(int, input().split())) table = sorted([int(input().split()[1]) for _ in range(m)], reverse = True) ans = 1 while f(ans) <= n: ans += 1 ans -= 1 print(list(itertools.accumulate(table))[min(ans - 1, m - 1...

0.761305

import sys input = sys.stdin.readline n,m=list(map(int,input().split())) A=list(map(int,input().split())) MIN=0 MAX=m while MIN!=MAX: x=(MIN+MAX)//2 #print(x,MIN,MAX) #print() M=0 for a in A: #print(a,M) if a<=M and a+x>=M: continue elif a>M and a+x>=m and (a...

0.751842

n, m = list(map(int, input().split())) v = list(map(int, input().split())) for i in range(1, len(v)): if v[i] < v[i-1]: v[i] += ((v[i-1] - v[i]) // n) * n while v[i] < v[i-1]: v[i] += n print(v[-1]-1)

0.738539

def ii(): return int(input()) def mi(): return map(int, input().split()) def li(): return list(mi()) n, M = mi() a = [0] + li() + [M] n = len(a) ans = 0 p = [0] * n q = [0] * n for i in range(1, n): p[i] = p[i - 1] q[i] = q[i - 1] if i % 2 == 0: p[i] += a[i] - a[i - 1] else: ...

0.738133

n, m = list(map(int, input().split())) v = list(map(int, input().split())) v = sorted(v) diff = 10**10 for i in range(0, len(v)): if i+n-1 < len(v): diff = min(diff, v[i+n-1] - v[i]) print(diff)

0.736404

from bisect import * n, m = list(map(int, input().split())) a = [int(i) for i in input().split()] b = [int(i) for i in input().split()] r = -1 a.sort() b.sort() for i in a: y = 1000000000000 x = bisect_left(b, i) if (x >= 0) and (x < m): y = min(y, abs(i - b[x])) x += 1 if (x >= 0) and (x < m): y = min(y, ...

0.736023

class Solution: def splitArray(self, nums, m): """ :type nums: List[int] :type m: int :rtype: int """ accum = [0] N = len(nums) mmm = max(nums) if m >= N: return mmm res = 0 for i in nums: r...

0.728293

def main(): from collections import deque n, m = [int(i) for i in input().split()] children = deque([0, int(v), i + 1] for i, v in enumerate(input().split())) while len(children) > 1: tmp = children.popleft() tmp[0] += m if tmp[1] > tmp[0]: children.append(t...

0.720239

def read_data(): n, m = map(int, input().strip().split()) a = list(map(int, list(input().strip().split()))) return n, m, a def find(start,end,v): mid = int((start + end) / 2) if start == end: return start if end - start == 1: if a[end] <= v: return end else: ...

0.713511

n, m, k = list(map(int, input().split())) m -= 1 line = list(map(int, input().split())) answer = n for i in range(n): if line[i] == 0: continue if line[i] > k: continue answer = min(answer, abs(m - i)) print(answer * 10)

0.706578

n, m = map(int, input().split()) t = [int(input().split()[0]) for i in range(n)] p = [0] * (m + 1) for i, j in enumerate(t): p[j] = min(p[j], min(p[: j])) - 1 print(n + min(p))

0.696609

import bisect n, m = [int(x) for x in input().split()] a = [int(x) for x in input().split()] # n : number of integers # m : mod half_n = n // 2 a1, a2 = a[:half_n], a[half_n:] n1, n2 = len(a1), len(a2) r1, r2 = [], [] def dfs1(i, sum): if i == n1: r1.append(sum) else: dfs1(i+1, sum) ...

0.696576

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline n,m=list(map(int,input().split())) party=[[] for _ in range(m+5)] pc=sorted([list(map(int,input().split())) for _ in range(n)],key=lambda x:x[1]) choose=[0]*n for i in range(n): party[pc[i][0]].append(i) want=10**18 for i in range(1,n+1): p1...

0.686114

def median(a): if len(a) == 0: return 0 if len(a) % 2 == 1: return a[len(a) // 2] else: return (a[len(a) // 2] + a[(len(a) // 2) - 1]) // 2 def profit(a, old_val): a.sort() med = median(a) sum_old = 0 sum_new = 0 for i in a: sum_old += abs(i - old_val) ...

0.685806

n,m=map(int,input().split()) A=[int(i)-1 for i in input().split()] ds=[0]*m de=[[] for i in range(m)] h,dec=0,0 for i in range(n-1): if A[i+1]-A[i]>0: h+=A[i+1]-A[i] else: h+=A[i+1]+1 dec+=1 de[A[i+1]].append((i,(A[i+1]-A[i])%m)) for i in range(m): for a in de[i]: ds[(i-a[1]+1)%m]+=1 ans=float("...

0.674479

import bisect N,M,X = map(int,input().split()) A = list(map(int,input().split())) index = bisect.bisect_left(A,X) ans = min(M-index,index) print(ans)

0.669814

f = lambda: map(int, input().split()) n, m = f() t = list(f()) d = {i: j for j, i in enumerate(sorted(set(t)))} t = [d[i] for i in t] k = len(d) a = [0] * k if m < 2 * k: for j in t * m: a[j] += 1 q = a[j] j += 1 while j < k and a[j] < q: a[j] += 1 j += 1 ...

0.667989

import sys input = sys.stdin.readline n,m=list(map(int,input().split())) A=[] COVERED=[0]*(m+1) for i in range(n): x,y=list(map(int,input().split())) A.append((x-y,x+y)) for j in range(max(0,x-y),min(m+1,x+y+1)): COVERED[j]=1 if min(COVERED[1:])==1: print(0) return A.sort() DP=[m]*(m+...

0.665632

# import itertools # import math # import sys # sys.setrecursionlimit(500*500) # import numpy as np from collections import deque # N = int(input()) # S = input() # n, *a = map(int, open(0)) N, M = map(int, input().split()) A = list(map(int, input().split())) # B = list(map(int, input().split())) # tree = [[] for _ in...

0.663226

import sys from itertools import * from math import * def solve(): n, m = map(int, input().split()) h = list(map(int, input().split())) p = list(map(int, input().split())) ss, ll = 0, int(2.2e10) while ss < ll: avg = (ss + ll) // 2 works = True hidx = 0 pidx = 0 ...

0.662813

# -*- coding: utf-8 -*- def main(): n, m = list(map(int, input().split())) x = sorted(list(map(int, input().split()))) diff = list() for i, j in zip(x, x[1:]): diff.append(abs(i - j)) diff = sorted(diff, reverse=True) print((sum(diff) - sum(diff[:n - 1]))) def __starting_point(): ...

0.660472

n, m = [int(x) for x in input().split()] a = [int(x) for x in input().split()] a.sort(reverse=True) def check(d): s=0 for i in range(len(a)): s+=max(0,a[i]-i//d) return s>=m if sum(a)<m: print(-1) else: l, r = 1,n mid = l+r>>1 while l<r: if check(mid): r=mid ...

0.659233

import math from math import gcd,pi,sqrt INF = float("inf") MOD = 10**9 + 7 import sys sys.setrecursionlimit(10**6) import itertools import bisect from collections import Counter,deque def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): retu...

0.658059

from itertools import accumulate def main(): n, m, k = list(map(int, input().split())) a = list(map(int, input().split())) km = k * m if m == 1: a.sort(reverse=True) print(sum(a[:k])) return a = list(accumulate(a)) a.append(0) if n == km: print(a...

0.657461

MAXN = 200001 def less_sum(s, m): n = len(s) a = 0 b = 0 res = 0 last = 0 count = [0 for i in range(-MAXN, MAXN+1)] count[0] = 1 x = 0 last = 1 for i in range(n): if s[i] > m: b += 1 else: a += 1 x = a-b #print(x) ...

0.657355

# written with help of editorial n, m = list(map(int, input().split())) a = list(map(int, input().split())) def gcd(x, y): while y: x, y = y, x % y return x g = 0 for x in a: g = gcd(g, x - 1) answer = 0 def process(x): nonlocal answer if x % 2 == 0: return 0 for i in range(3...

0.65683

def solve(): N,M,K = map(int, input().split()) A = list(map(int, input().split())) B = list(map(int, input().split())) ret = 0 A_cusum = [0] A_border_index = 0 # 超えるときのindex for a_ in A: A_end = A_cusum[-1] if A_end+a_ > K: break A_cusum.append(A_end+a_) A_border_index = len(A_c...

0.655854

import sys readline = sys.stdin.readline N, D, M = map(int, readline().split()) A = list(map(int, readline().split())) Am = [a for a in A if a > M] Ao = [a for a in A if a <= M] Am.sort(reverse = True) Ao.sort(reverse = True) Cam = Am[:] Cao = Ao[:] for i in range(1, len(Cam)): Cam[i] += Cam[i-1] for i in range(1...

0.651841

n,m=list(map(int,input().split())) L=list(map(int,input().split())) ans=0 ind=0 bus=0 while(ind<n): ans+=1 while(ind<n and bus+L[ind]<=m): bus+=L[ind] ind+=1 bus=0 print(ans)

0.651143

n, m = map(int, input().split()) l = n f = 1 s = ((n)*(n+1))//2 - l - f for _ in range(m): k = int(input()) if 2 <= k <= n-1 or k in [f, l]: l, f = f, l else: l = k print(s+l+f)

0.651076

import sys input=sys.stdin.readline N,M=list(map(int,input().split())) # N: 処理する区間の長さ INF = 2**31-1 LV = (M+2-1).bit_length() N0 = 2**LV data = [0]*(2*N0) lazy = [0]*(2*N0) def gindex(l, r): L = (l + N0) >> 1; R = (r + N0) >> 1 lc = 0 if l & 1 else (L & -L).bit_length() rc = 0 if r & 1 else (R & -R).bi...

0.650535

from sys import * f = list(map(int, stdin.read().split())) n, m = f[0], f[1] d = [[] for i in range(100001)] for j in range(2, len(f), 3): x, y, w = f[j:j + 3] d[w].append((y, x)) s = [0] * (n + 1) for q in d: for y, k in [(y, s[x]) for y, x in q]: s[y] = max(s[y], k + 1) print(max(s))

0.650139

n,m,k = list(map(int, input().strip().split())) a = list(map(int, input().strip().split())) a.sort() count = 0 start = 0 konec = 0 ur = 0 while start < len(a): if a[start] is not None: v = a[start] while konec < len(a) and a[konec] - v < m : ur += 1 if ur >= k: ...

0.647254

n = int(input()) m = int(input()) a = [] for i in range(n): a.append(int(input())) mx = max(a) + m while m: for i in range(n): if a[i] == min(a): a[i] += 1 m -= 1 break print(max(a), mx)

0.64486

from bisect import bisect_left as bl import sys N, M, Q = map(int, sys.stdin.readline().split()) count = [0] * (M + 1) A = [] for a in sys.stdin.readline().split(): a = int(a) A.append(count[a] * M + a) count[a] += 1 A.sort() A = [a - i for i, a in enumerate(A, 1)] for _ in range(Q): q = int(sys.stdin....

0.643968

n, m = map(int, input().split()) a = list(map(int, input().split())) b = list(map(int, input().split())) a = [u % m for u in a] b = [u % m for u in b] a.sort() b.sort() possible = set(sorted([(b[0] - u + m) % m for u in a])) # At most 2000 elements # O(n^2) for x in possible: array = [(u + x) % m for u in a] if...

0.642287

n, m = list(map(int, input().split())) a = list(map(int, input().split())) a.sort() mx = a[-1] t = 0 ans = 0; for i in a: if i > 0: if i > t: t += 1 ans += i - 1 ans -= mx - t print(ans)

0.641769

N, M, K = list(map(int, input().split())) A = [int(a) for a in input().split()] S = [0] for a in A: S.append(S[-1]+M*a-K) MI = [(10**50)] * M ans = 0 for i in range(N+1): MI[i%M] = min(MI[i%M], S[i]) for j in range(M): ans = max(ans, (S[i]-MI[(i-j)%M] - K*((-j)%M))//M) print(ans)

0.640156

n,m,k = list(map(int,input().split())) l = list(map(int,input().split())) out = 0 d = 0 while m > d: nex = l[d] page = (nex - d - 1)//k add = 1 while d + add < m and (page * k) < l[d + add] - d <= (page + 1) * k: add += 1 d += add out += 1 print(out)

0.63852

n, m = (int(x) for x in input().split()) winners = [0] * n for i in range(m): a = [int(x) for x in input().split()] winners[a.index(max(a))] += 1 print(winners.index(max(winners)) + 1)

0.638439

import sys import copy input = sys.stdin.readline n,m,k=list(map(int,input().split())) A=list(map(int,input().split())) SHOP=[list(map(int,input().split())) for i in range(m)] A=sorted(A)[:k] A=A[::-1] SHOP.sort(key=lambda x:x[0]) from itertools import accumulate DP=[0]+list(accumulate(A)) SUM=copy.deepcopy(DP) ...

0.634785

import sys import copy input = sys.stdin.readline n,m=list(map(int,input().split())) MAT=[list(map(int,input().split())) for i in range(n)] #n=15 #m=10000 #MAT=[list(range(j*j,j*j*(m+1),j*j)) for j in range(1,n+1)] if n==1: ANS=10**10 for i in range(1,m): if ANS>abs(MAT[0][i]-MAT[0][i-1]): ...

0.634244

import math import sys from collections import Counter def solve(): n, m = [int(x) for x in input().split()] L, R = 1, n for line in sys.stdin: x, y = [int(x) for x in line.split()] x, y = min(x, y), max(x, y) L, R = max(L, x), min(R, y) return max(R - L, 0) print(solv...

0.632488

from sys import stdin n,m=list(map(int,stdin.readline().strip().split())) s=list(map(int,stdin.readline().strip().split())) ans=[0 for i in range(n)] sm=[0 for i in range(n)] sm1=[0 for i in range(n)] for i in range(n): if i==0: sm[i]=s[i] else: sm[i]=sm[i-1]+s[i] for i in range(n-1,-1,-1): ...

0.631029

def main(): from collections import defaultdict def f(x): inc = [0 for i in range(n + w)] cur_inc = 0 days = m for i, v in enumerate(arr): cur_inc -= inc[i] v += cur_inc if x - v > days: return False if x > v: ...

0.630711

n, p, m = input().split() n = int(n) p = int(p) m = int(m) ans = 0 curb = 0 curd = 1 for i in range(0, n): #print(curb) tday, tplus = input().split() tday = int(tday) tplus = int(tplus) if curb < 0: ans += (tday - curd) curb -= p * (tday - curd) elif curb - p * (tday - curd) < 0...

0.630639

n, m, k = [int(_) for _ in input().split()] a = [int(_) for _ in input().split()] b = k count = 0 for obj in a[::-1]: if obj > k: break if obj > b: if m > 1: m -= 1 b = k - obj count += 1 else: break else: b -= obj coun...

0.628523

from bisect import bisect_left,bisect # ===================================== 約数のリスト def enum_div(n): ir=int(n**(0.5))+1 ret=[] for i in range(1,ir): if n%i == 0: ret.append(i) if (i!= 1) & (i*i != n): ret.append(n//i) return ret n,m=list(map(int,inpu...

0.62526

class Solution: def reachableNodes(self, edges: List[List[int]], M: int, N: int) -> int: conns = defaultdict(dict) for i, j, n in edges: conns[i][j] = n conns[j][i] = n heap = [(0, 0)] visited = set() ans = 0 while heap: d, n = he...

0.625164

# import collections, atexit, math, sys from functools import cmp_to_key #key=cmp_to_key(lambda x,y: 1 if x not in y else -1 ) sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) import bisect try : #raise ModuleNotFoundError import numpy def dprint(*args...

0.625118

n, m = map(int, input().split()) c = [0] + list(map(int, input().split())) t = {i: set() for i in set(c[1:])} for i in range(m): a, b = map(int, input().split()) if c[a] != c[b]: t[c[a]].add(c[b]) t[c[b]].add(c[a]) j, k = c[1], 0 for i, s in t.items(): l = len(s) if l >= k: if l...

0.624559

import sys import bisect input = sys.stdin.readline def main(): n, m = list(map(int, input().split())) a = list(map(int, input().split())) a.sort() l, r = -1, 10**6 while r-l > 1: k = (r+l)//2 count = 0 for i in range(n): count += n-bisect.bisect_left(a, k-...

0.623621

n, k, m = list(map(int, input().split())) l = list(map(int, input().split())) l.sort() s = sum(l) ans = 0 for i in range(n + 1): mi = m - s * i if mi < 0: break cnt = (k + 1) * i for j in range(k): x = min(mi // l[j], n - i) cnt += x mi -= l[j] * x ans = max(ans, cnt...

0.623055

c = list(map(int, input().split())) n, m = list(map(int, input().split())) a = list(map(int, input().split())) b = list(map(int, input().split())) sa = sum(a)*c[0] sb = sum(b)*c[0] for i in a: sa = min(sa, sa - i*c[0] + c[1]) for i in b: sb = min(sb, sb - i*c[0] + c[1]) print(min(sa + sb, sa + c[2], sb + c[2],...

0.622666

import collections n,m=map(int,input().split()) m+=2 arr=list(map(int,input().split())) arr.append(0) arr.append(n) arr=sorted(arr) g,r=map(int,input().split()) q=collections.deque() q.append((0,0)) dist=[[0]*(g+1) for _ in range(m+2)] checked=[[0]*(g+1) for _ in range(m+2)] checked[0][0]=1 ans=-1 while len(q)!=0: v...

0.621569

t=1 for _ in range(t): n,m,k=(list(map(int,input().split()))) a=list(map(int,input().split())) for i in range(n): a[i]=a[i]%k s=1 for j in range(k): ss=0 v=0 for i in range(n): v+=min(abs(a[i]-j),k-abs(a[i]-j)) while ssm: ...

0.619041

def f(m): nonlocal dp, sdp l = 0 for i in range(n): while l < n and v[l] < v[i] - m: l += 1 if l - 1 > i - k: dp[i] = False else: dp[i] = (sdp[i - k + 1] != sdp[l - 1]) sdp[i + 1] = sdp[i] + (1 if dp[i] else 0) return dp[n - 1] n, k = ...

0.616325

class Solution: def minDays(self, bloomDay: List[int], m: int, k: int) -> int: flowersN = len(bloomDay) if flowersN < m*k: return -1 def checkFlowers(x): count = 0 gotFlowers = 0 for num in bloomDay: if num <= ...

0.614573

import sys input = sys.stdin.readline n,m=list(map(int,input().split())) A=list(map(int,input().split())) SP=[list(map(int,input().split())) for i in range(m)] MIN=min(A) x=A.index(MIN) EDGE_x=[[x+1,i+1,A[x]+A[i]] for i in range(n) if x!=i] EDGE=EDGE_x+SP EDGE.sort(key=lambda x:x[2]) #UnionFind Group=[i for i in...

0.614019

n,m,k = map(int,input().split()) a = list(map(int,input().split())) a = sorted(a) b1 = a[-1] b2 = a[-2] k+=1 total = m//k score = 0 score += (m%k) * b1 score += b1 * (total*(k-1)) score += b2 * total print (score)

0.614001

# = map(int, input().split()) n, m = list(map(int, input().split())) ans = 10 ** 100 for i in range(n): p, q = list(map(int, input().split())) ans = min(ans, p / q * m) print(ans)

0.61385

from sys import stdin, stdout n, m, k = map(int, stdin.readline().split()) position = set(list(map(int, stdin.readline().split()))) start = 1 for i in range(k): if start in position: break else: a, b = map(int, stdin.readline().split()) if a == start: start = b elif...

0.613436

3 def readln(): return tuple(map(int, input().split())) n, m, a = readln() b = list(sorted(readln())) p = list(sorted(readln())) l = ost = 0 r = min(m, n) + 1 while r - l > 1: k = (r + l) // 2 s = d = 0 for x, y in zip(b[-k:], p[:k]): if x < y: d += y - x s += y if d <= a...

0.613271

import sys input = sys.stdin.readline n,m,k,q=list(map(int,input().split())) TR=[list(map(int,input().split())) for i in range(k)] SAFE=list(map(int,input().split())) SAFE.sort() TRLIST=[[] for i in range(n+1)] for x,y in TR: TRLIST[x].append(y) while TRLIST[-1]==[]: TRLIST.pop() n-=1 START={1:0} #pla...

0.611935

def bfs(source): q = [0] * (n + 1); fa = [-1] * n l, r = [1] * 2 fa[source] = source q[1] = source while l <= r: x = q[l] l += 1 for y in e[x]: if fa[y] == -1: fa[y] = x r += 1 q[r] = y i = r; while i >=...

0.61105

# cook your dish here for _ in range(int(input())): m,n=list(map(int,input().split())) a=[int(i) for i in input().split()] l=-1 for i in range(n-1,-1,-1): if a[i]==m: l=i break f=-1 for i in range(0,n): if a[i]==m: f=i break pri...

0.610823

n, m, r = map(int, input().split()) S = list(map(int, input().split())) B = list(map(int, input().split())) x = min(S) y = max(B) cnt = r % x act = r // x cnt += act * y print(max(r, cnt))

0.610688

import bisect n,m=list(map(int,input().split())) L1=list(map(int,input().split())) L2=list(map(int,input().split())) x=int(input()) newL1=[0] newL2=[0] for i in L1:newL1.append(newL1[-1]+i) for i in L2:newL2.append(newL2[-1]+i) min1=[] min2=[] mx=9999999999999999999 for i in range(1,n+1): m1=mx for j in range(n...

0.610171

n, s, m, k = map(int, input().split()) a = list(map(int, input().split())) nt = [-1 for i in range(n+1)] for i in range(s): l, r = map(int, input().split()) l-=1 for j in range(l, r): nt[j] = max(nt[j], r) dp = [[0 for i in range(m+1)] for i in range(n+1)] sum = [0 for i in range(n+1)] def solve(mid): for i in ...

0.609493

from collections import defaultdict import sys input = sys.stdin.readline ''' for CASES in range(int(input())): n, m = map(int, input().split()) n = int(input()) A = list(map(int, input().split())) S = input().strip() sys.stdout.write(" ".join(map(str,ans))+"\n") ''' inf = 100000000000000000 # 1e17 mod = 998244353 n,...

0.608907

import sys n,m,q=map(int,input().split()) p=[-1]*(n+m) r=[0]*(n+m) def par(i): if p[i]==-1: return i p[i]=par(p[i]) return p[i] def merge(a,b): a,b=par(a),par(b) if a==b: return 0 if r[a]<r[b]:p[a]=b elif r[b]<r[a]:p[b]=a else:p[a]=b;r[b]+=1 return 1 v=n+m for l in sys.stdin.read().strip().split('\n') if q els...

0.608438

import itertools k, m = list(map(int,input().split())) main_ar = [] for i in range(k): ar = list(map(int,input().split())) main_ar.append(ar[1:]) all_combination = itertools.product(*main_ar) result = 0 for single_combination in all_combination: result = max(sum([x*x for x in single_combination])%m,re...

0.607384

""" Codeforces Round 251 Div 2 Problem D Author : chaotic_iak Language: Python 3.3.4 """ def read(mode=2): # 0: String # 1: List of strings # 2: List of integers inputs = input().strip() if mode == 0: return inputs if mode == 1: return inputs.split() if mode == 2: ...

0.606846

from sys import stdin input = stdin.readline n,m = map(int,input().split()) l = list(map(int,input().split())) if n > m: print(0) else: res = 1 for i in range(n-1): for j in range(i+1,n): res = ((res*abs(l[i]-l[j])) % m) print(res%m)

0.606111

from operator import itemgetter import sys input = sys.stdin.readline n, m = map(int, input().split()) info = [list(map(int, input().split())) + [i] for i in range(n)] info = sorted(info, key = itemgetter(1)) max_num = info[-1][1] N = max_num INF = 0 LV = (N-1).bit_length() N0 = 2**LV data = [0]*(2*N0) lazy = [0]*(2...

0.606104

n, m = map(int, input().split()) if (m >= n): print(n) else: c = n - m l = 0 r = 10 ** 18 while r - l > 1: md = (r + l) // 2 if (1 + md) * md // 2 < c: l = md else: r = md print(r + m)

0.605456

class Solution: def processQueries(self, queries: List[int], m: int) -> List[int]: if not queries: return [] p = list(range(1, m+1)) res = [] for i in queries: z = p.index(i) res.append(z) del p[z] p.insert(0,i) retu...

0.604806

n, m = list(map(int, input().split())) if n == 1: print(1) elif m - 1 >= n - m: print(m - 1) else: print(m + 1)

0.604733

from collections import defaultdict n, m, p = map(int, input().split()) a = list(map(int, input().split())) b = list(map(int, input().split())) u = defaultdict(int) for i in b: u[i] += 1 ans = [] for q in range(p): c = a[q: n: p] if len(c) < m: break v = defaultdict(int) for i in c[: m]: v[i] += 1 ...

0.604592

# import collections, atexit, math, sys from functools import cmp_to_key #key=cmp_to_key(lambda x,y: 1 if x not in y else -1 ) sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) import bisect try : #raise ModuleNotFoundError import numpy def dprint(*args...

0.604466

import sys input = sys.stdin.readline def main(): n, m, k = map(int, input().split()) half = m // 2 se_s = [] for i in range(n): lst = list(map(int, input().split())) lst.sort(reverse = True) total_sub = sum(lst[:half]) dp = [[0 for _ in range(k)] for _ in range(half + 1...

0.603887

import functools def gcd(x,y): if(y == 0): return x return gcd(y, x%y) for _ in range(int(input())): n, m= map(int, input().split()) p = list(map(int, input().split())) ans = functools.reduce(lambda x,y: gcd(x, y), p) if(ans <= n): print(n-ans) else: f = [1] for k in range(ans//2, 1, -1): if ans...

0.60377

n,m = map(int,input().split()) min_i = 1 max_i = n for i in range(m): l,r = map(int,input().split()) min_i = max(min_i,l) max_i = min(max_i,r) if max_i-min_i>=0: print(max_i-min_i+1) else: print(0)

0.603195

import sys n, m = [int(x) for x in input().split()] A = [int(x) for x in input().split()] B, C = [0]*(m+1), [0]*(m+1) for a in A: if a <= m: B[a] += 1 for i in range(2, m + 1): for j in range(i, m+1, i): C[j] += B[i] k, l = 1, 0 for i in range(2, m+1): if C[i] > l: l = C[i] k = i p...

0.603086

N, K, M = map(int,input().split()) A = list(map(int,input().split())) def score(): max_aim = M*N last_score = max_aim - sum(A) if last_score <=0: return 0 elif 0 < last_score <= K: return last_score elif K < last_score: return -1 print(score())

0.602705

import bisect from functools import lru_cache class Solution: def makeArrayIncreasing(self, A: List[int], B: List[int]) -> int: B = sorted(set(B)) @lru_cache(None) def find_larger_value_in_B(val): if val >= B[-1]: return float('inf') return B[bisect...

0.602463

n, m = list(map(int, input().split())) line = list(map(int, input().split())) pairs = set() for i in range(m): a, b = list(map(int, input().split())) pairs.add((a,b)) req = [line.pop()] out = 0 while line != []: nex = line.pop() works = True for pers in req: if not (nex, pers) in pairs: ...

0.60245

import sys readline = sys.stdin.readline class Segtree: def __init__(self, A, intv, initialize = True, segf = max): self.N = len(A) self.N0 = 2**(self.N-1).bit_length() self.intv = intv self.segf = segf if initialize: self.data = [intv]*self.N0 + A + [intv]*(self...

0.602281

import collections def main(): from sys import stdin, stdout def read(): return stdin.readline().rstrip('\n') def read_array(sep=None, maxsplit=-1): return read().split(sep, maxsplit) def read_int(): return int(read()) def read_int_array(sep=None, maxsplit=-1): ...

0.601952

# -*- coding:utf-8 -*- """ created by shuangquan.huang at 11/20/18 """ import collections import bisect N, M = map(int, input().split()) vlines = [] for i in range(N): x = int(input()) vlines.append(x) vlines.sort() vlines.append(10**9) yxs = collections.defaultdict(list) ys = set() for i in range(M): ...

0.601845

import sys input = lambda: sys.stdin.readline().rstrip() N, M = list(map(int, input().split())) X = [] for _ in range(N): a, b = list(map(int, input().split())) X.append((a, b)) Y = [] for _ in range(M): c, d = list(map(int, input().split())) c, d = c, d+1 Y.append((c, d)) Y.sort(key = lambda x: -x...

0.601684

def main(): from sys import stdin n, m = list(map(int, input().split())) n += 1 aa, pos, duo = [0] * n, [0] * n, [0] * n for i, a in enumerate(map(int, input().split()), 1): aa[i] = a pos[a] = i for s in stdin.read().splitlines(): x, y = list(map(int, s.split())) ...

0.601031

def shortest_time(n, m, speeds): lift, open, close, walk = speeds return min( # taking the elevator abs(m - n) * lift + open + close + (n - 1) * lift + open, # walking (n - 1) * walk )

0.600511

def game(n,l,p): if(len(l)==0): return 0 l.sort() if(len(l)>=1 and p<l[0]): return 0 l.sort() c=0 ma=set() ma.add(0) while(len(l)): if(p>=l[0]): p-=l[0] c+=1 ma.add(c) l=l[1:] else: ...

0.599757

# 272 D2 A def func(p,m,n): w = p while w % m != 0 and w<=n: w += 1 if w<= n: return w else: return -1 l = input().split() n = int(l[0]) m = int(l[1]) if n % 2 == 0: p = int(n/2) else: p = int(n/2)+1 print(func(p,m,n))

0.598265

f = lambda: map(int, input().split()) n, m, w = f() wb = [(0, 0)] + list(zip(f(), f())) t = list(range(n + 1)) def g(x): if x == t[x]: return x t[x] = g(t[x]) return t[x] for i in range(m): x, y = f() x, y = g(x), g(y) if x != y: t[y] = x p = [[] for j in range(n + 1)] for i in range(1, n +...

0.598076

n,k,m = list(map(int,input().split())) ai = list(map(int,input().split())) ai.sort() n2 = n num = sum(ai) ans = 0.0 i = 0 while n2 > 0 and m > -1: num2 = (num + min(m,n2 * k)) / n2 ans = max(ans,num2) num -= ai[i] i += 1 n2 -= 1 m -= 1 print(ans)

0.59763

N,M=map(int, input().split()) AB=sorted([list(map(int, input().split())) for _ in range(N)]) cnt=0 gokei=0 for ab in AB: if M-cnt>ab[1]: gokei+=ab[1]*ab[0] cnt+=ab[1] else: gokei+=(M-cnt)*ab[0] cnt+=M-cnt if cnt==M: print(gokei) return

0.597462

import math m,a,b=map(int,input().split()) g=math.gcd(a,b) a1=a//g b1=b//g alls=g*(a1+b1-1) dists=[0]+[-1]*(a1+b1-1) dist=0 far=0 while dist!=b1: if dist<b1: dist+=a1 far=max(dist,far) else: dist-=b1 if dists[dist]==-1: dists[dist]=far tot=0 for i in range(a1+b1): if i*g<...

0.597023

Remember the story of Little Match Girl? By now, you know exactly what matchsticks the little match girl has, please find out a way you can make one square by using up all those matchsticks. You should not break any stick, but you can link them up, and each matchstick must be used exactly one time. Your input will be...

class Solution: def makesquare(self, nums): """ :type nums: List[int] :rtype: bool """ if len(nums) < 4: return False length = sum(nums) if length % 4: return False length = (int) (length / 4) ...

0.768125

def build_square(blocks): for x in range(4): if 4 in blocks: blocks.remove(4) elif 3 in blocks and 1 in blocks: blocks.remove(3) blocks.remove(1) elif blocks.count(2) >= 2: blocks.remove(2) blocks.remove(2) elif 2 in blocks ...

0.646116

class Solution: def validSquare(self, p1, p2, p3, p4): """ :type p1: List[int] :type p2: List[int] :type p3: List[int] :type p4: List[int] :rtype: bool """ def length(x,y): return (x[0]-y[0])*(x[0]-y[0]) + (x[1]-y[1])*(x...

0.632015

from collections import Counter def word_square(ls): n = int(len(ls)**0.5) return n*n==len(ls) and sum(i%2 for i in list(Counter(ls).values())) <= n

0.615891

class Solution: def canPartition(self, nums): """ :type nums: List[int] :rtype: bool """ _sum=sum(nums) div,mod=divmod(_sum,2) if mod!=0: return False target=[div]*2 self._len=len(nums) nums.sort(reverse=True) ...

0.611432

class Solution: def splitArraySameAverage(self, A): N, S = len(A), sum(A) if N == 1: return False A = [z * N - S for z in A] mid, left, right = N//2, {A[0]}, {A[-1]} if not any((S*size) % N == 0 for size in range(1, mid+1)): return False for i in range(1, mid): le...

0.611394

def is_magical(sq): return sum(sq[2:7:2])==sum(sq[::4])==sum(sq[::3])==sum(sq[1::3])==sum(sq[2::3])==sum(sq[:3])==sum(sq[3:6])==sum(sq[6:])

0.602591

def is_madhav_array(arr): nTerms = ((1+8*len(arr))**.5-1)/2 return (len(arr) > 1 and not nTerms%1 and len({ sum(arr[int(i*(i+1)//2):int(i*(i+1)//2)+i+1]) for i in range(int(nTerms))}) == 1)

0.601093

class Solution: def isSelfCrossing(self, x): """ :type x: List[int] :rtype: bool """ if not x or len(x) < 4: return False i = 3 while i < len(x): #print(i) if x[i] >= x[i-2] and x[i-1] <= x[i-3]: ...

0.587612

class Solution: def numSquarefulPerms(self, A: List[int]) -> int: A.sort() self.ans = 0 def check(A, i, path): return int((A[i] + path[-1])**0.5 + 0.0)**2 == A[i] + path[-1] def dfs(A, path): if not A: self.ans += 1 return ...

0.578301

def one_square(n): return round(n ** .5) ** 2 == n def two_squares(n): while n % 2 == 0: n //= 2 p = 3 while p * p <= n: while n % (p * p) == 0: n //= p * p while n % p == 0: if p % 4 == 3: return False n //= p p += 2 return n % 4 == 1 de...

0.575224

def is_onion_array(a): return all(a[i] + a[-i-1] <= 10 for i in range(len(a) // 2))

0.571488

def is_nice(arr): s = set(arr) return bool(arr) and all( n+1 in s or n-1 in s for n in s)

0.564

def square_sums_row(n): def dfs(): if not inp: yield res for v in tuple(inp): if not res or not ((res[-1]+v)**.5 % 1): res.append(v) inp.discard(v) yield from dfs() inp.add(res.pop()) inp, res = set(range(1,n+1)), [] ...

0.561068

def is_happy(n): seen = set() while n!=1: n = sum(int(d)**2 for d in str(n)) if n not in seen: seen.add(n) else: return False return True

0.557493

class Solution: def canThreePartsEqualSum(self, A: List[int]) -> bool: # if len(A)<3: # return # i = 1 # j = len(A)-2 # tgtsum = sum(A)/3 # sum1 = sum(A[:i]) # while i<(len(A)-2) and sum1!=tgtsum: # sum1 = sum1 + A[i]...

0.555269

import math def is_square(n): return n > -1 and math.sqrt(n) % 1 == 0;

0.551881

from itertools import combinations def solve(a, n): return any(sum(c) % n == 0 for i in range(len(a)) for c in combinations(a, i+1))

0.551505

def is_inertial(arr): mx = max(arr, default=1) miO = min((x for x in arr if x%2==1), default=float("-inf")) miE2 = max((x for x in arr if x%2==0 and x!=mx), default=float("-inf")) return mx%2 == 0 and miE2 < miO

0.547593

class Solution: def leastBricks(self, wall): """ :type wall: List[List[int]] :rtype: int """ d = {} for i in wall: suma = 0 for j in range(len(i)-1): suma += i[j] if suma in d: d[s...

0.545215

def consecutive_sum(num): upper_limit = 1 while True: if upper_limit * (upper_limit + 1) // 2 > num: break upper_limit += 1 return sum([1 if i % 2 and not num % i else 1 if not i % 2 and num % i == i//2 else 0 for i in range(1, upper_limit)])

0.541057

class Solution: def isPossibleDivide(self, s: List[int], k: int) -> bool: if len(s) % k != 0: return False ctr = collections.Counter(s) for _ in range(len(s) // k): mn = [] for i in ctr: if mn == [] and ctr[i] > 0: ...

0.539925

class Solution: def canReorderDoubled(self, A: List[int]) -> bool: cache=Counter(A) c_list=sorted(list(cache),key=abs) for x in c_list: if cache[x]>cache[2*x]: return False cache[2*x]-=cache[x] return True

0.538726

from math import ceil def will_it_balance(stick, gnd): gravPt = sum(v*i for i,v in enumerate(stick)) / sum(stick) return gnd[int(gravPt)] == gnd[ceil(gravPt)] == 1

0.53864

from collections import Counter def self_descriptive(num): s = [int(a) for a in str(num)] cnt = Counter(s) return all(cnt[i] == b for i, b in enumerate(s))

0.536378

def find_dup(arr): return sum(arr) - len(arr)*(len(arr)-1)/2 #your code here

0.53601

from collections import Counter def is_zero_balanced(arr): c = Counter(arr) return bool(arr) and all(c[k] == c[-k] for k in c)

0.532802

S, SS, SUM = [0], {0}, [0] def rec(n): while len(S)<=n: v = S[-1] - len(S) if v<= 0 or v in SS: v += 2*len(S) S.append(v) SS.add(v) SUM.append(SUM[-1]+v) return SUM[n-1]

0.530768

class Solution: def numSquares(self, n): """ :type n: int :rtype: int """ while(n%4 == 0): n = n/4 if n%8 == 7: return 4; a = int(0) while(a*a <= n): b = int(math.sqrt(n-a*a)) if (a*a+b*b == n): ...

0.529931

class Solution: def findTargetSumWays(self, nums, S): """ :type nums: List[int] :type S: int :rtype: int """ c = [0]*1001 c[0] = 1 T = sum(nums) A = T+S if T<S or A&1: return 0 A>>=1 nums = sort...

0.526696

def is_centered(arr,n): l = int(len(arr)/2) if len(arr)%2==0 else int((len(arr)-1)/2) return any(sum(arr[i:-i])==n for i in range(1, l+1)) or sum(arr)==n

0.526024

def get_digits(n): return [int(x) for x in list(str(n))] def is_narc(n): return n == sum([x**len(get_digits(n)) for x in get_digits(n)]) def is_narcissistic(*values): try: return all(type(n) in [int,str] and is_narc(int(n)) for n in values) except ValueError: return False

0.525379

class Solution: def isHappy(self, n): """ :type n: int :rtype: bool """ former = set() while True: h = 0 while n > 0: d = n % 10 h += (d*d) n = n // 10 if h == 1: ...

0.524118

class Solution: def hasGroupsSizeX(self, deck: List[int]) -> bool: def findGCD(a,b): if b ==0: return a return findGCD(b, a%b) hash_cards = {} for card in deck: if card in hash_cards: hash_cards[card]+=1 ...

0.521914

def learn_charitable_game(arr): return sum(arr) % len(arr) == 0 and sum(arr) > 0

0.521571

def count_squareable(n): return n//4 + (n+1)//2

0.52102

def only_one(*args): return sum(args) == 1

0.520834

triangular_sum=lambda n: (-0.5+(1+8*n)**0.5/2.0)**0.5%1==0

0.520759

def has_two_cube_sums(n): cubic_list = [i**3 for i in range(1, int((n)**(1./3.)) + 1)] return sum([(n != 2*c) and ((n-c) in cubic_list) for c in cubic_list]) > 3

0.520145

class Solution: def isIdealPermutation(self, A): """ :type A: List[int] :rtype: bool """ # tle # for i in range(len(A)-2): # if A[i] > min(A[i+2:]): # return False # return True # ac for...

0.519744

# 1390. Four Divisors # version 2, with optimized prime-finding. import math def remove (lst, index): assert lst tail = len (lst) - 1 lst[index], lst[tail] = lst[tail], lst[index] lst.pop () def swap_min (lst): if not lst: return argmin = min (range (len (lst)), key = lambda i: lst[i]) ls...

0.519527

def is_triangular(t): x = int((t*2)**0.5) return t == x*(x+1)/2

0.518667

def luck_check(string): e0, b1 = len(string) // 2, (len(string) + 1) // 2 return sum(map(int, string[:e0])) == sum(map(int, string[b1:]))

0.518448

def can_jump(arr): if arr[0] == 0 or len(arr) == 1: return False if arr[0] >= len(arr): return True for jump in range(1, arr[0] +1): if can_jump(arr[jump:]): return True return False

0.517322

def valid(a): d = {} day_length = len(a[0]) group_size = len(a[0][0]) golfers = {g for p in a[0] for g in p} for day in a: if len(day) != day_length: return False for group in day: if len(group) != group_size: return False for player in group: ...

0.514902

from math import floor #Pretty sure this is the fastest implementation; only one square root, and sqrt(n) multiplications. #Plus, no booleans, because they're super slow. locker_run = lambda l: [i * i for i in range(1, int(floor(l ** .5)) + 1)]

0.509001

def magic_sum(arr): return arr and sum(x for x in arr if x%2 and '3' in str(x)) or 0

0.507643

class Solution: def canPartitionKSubsets(self, nums, k): """ :type nums: List[int] :type k: int :rtype: bool """ target,rem=divmod(sum(nums),k) if rem or max(nums)>target: return False n=len(nums) seen=[0]*n nums.sort(reverse...

0.507544

def validate_sequence(seq): return len({a - b for a, b in zip(seq, seq[1:])}) == 1

0.506244

from itertools import groupby def sum_groups(arr): newarr = [sum(j) for i,j in groupby(arr, key = lambda x: x % 2 == 0)] return len(newarr) if newarr == arr else sum_groups(newarr)

0.505804

def find(seq): return (min(seq)+max(seq))*(len(seq)+1)/2-sum(seq)

0.504675

from itertools import combinations def area(t): (a,b),(c,d),(e,f) = t return abs(a*d+b*e+c*f-d*e-a*f-b*c)/2 def find_biggTriang(lst): tris = list(combinations(lst,3)) areas = list(map(area,tris)) m = max(areas) mTris = [list(map(list,t)) for t,v in zip(tris,areas) if v==m] return [ le...

0.504408

def find_missing(sequence): t = sequence return (t[0] + t[-1]) * (len(t) + 1) / 2 - sum(t)

0.503807

def pair_of_shoes(a): return sorted(s for lr, s in a if lr == 1) == sorted(s for lr, s in a if lr == 0)

0.503765

def solve(arr): return sum(set(arr))

0.503412

from itertools import combinations def counting_triangles(v): v.sort() return sum(a+b>c for a,b,c in combinations(v,3))

0.503133

from itertools import combinations def digits(num): return list(map(sum, combinations(map(int,str(num)),2)))

0.502184

def validate(n): digits = [int(x) for x in str(n)] even = [x*2 if x*2 <= 9 else x*2 - 9 for x in digits[-2::-2]] odd = [x for x in digits[-1::-2]] return (sum(even + odd)%10) == 0

0.502125

def equable_triangle(a, b, c): p = a + b + c ph = p / 2 return p * p == ph * (ph - a) * (ph - b) * (ph - c)

0.500959

def find_dup(arr): return sum(arr) - sum(range(1, max(arr)+1))

0.499969

from itertools import chain def hyperrectangularity_properties(arr): hr, arr = [], [arr] while 1: check = sum(isinstance(v, int) for v in arr) # Check homogeneity if check or not arr: # some int are present or empty array (edge case) if check ==...

0.498033

class Solution: def canCross(self, stones): """ :type stones: List[int] :rtype: bool """ if stones == []: return False if len(stones) == 1: return True diff = [0]*len(stones) for i in range(1,len(stones)): if stones[i] -...

0.49763

cache = {} def sum_div(x): if x not in cache: cache[x] = sum(i for i in range(1, x+1) if x % i == 0) return cache[x] def is_required(x): reversed = int(str(x)[::-1]) return x != reversed and sum_div(x) == sum_div(reversed) required = [x for x in range(528, 10**4) if is_required(x)] def equal_...

0.497269

def alternate_sq_sum(arr): return sum([ x**2 if i % 2 == 1 else x for i, x in enumerate(arr) ])

0.495911

def unique_sum(lst): return sum(set(lst)) if lst else None

0.493639

def is_triangle(a, b, c): return (a<b+c) and (b<a+c) and (c<a+b)

0.493517

from itertools import combinations_with_replacement def find_all(sum_dig, digs): combs = combinations_with_replacement(list(range(1, 10)), digs) target = [''.join(str (x) for x in list(comb)) for comb in combs if sum(comb) == sum_dig] if not target: return [] return [len(target), int(target[0])...

0.493356

class Solution: def stoneGame(self, piles: List[int]) -> bool: return True

0.492547

from heapq import * def add_all(lst): heapify(lst) total = 0 while len(lst) > 1: s = heappop(lst) + heappop(lst) total += s heappush(lst, s) return total

0.492504

class Solution(object): def judgePoint24(self, nums): bad = '떢븻각걎냇갅갸꺚뵟숣욄뵴뵞뤼갈갌뤔떌옊메늄숭캸긶꺛옖갍뇐쩢곴듇걯궄옕왹눞솴걃끗긬땉궿가쌀낐걄숤뺴늘걘꽸숢걂갋갃쫐꼔솾쩡쇔솿끛뤜간븺쩬웨딴옠뤛갂뵪덠놤빐옋귒늂갰갖놥궾갆옌뼘묰거갎긷낤겼' return chr(int(''.join(map(str, sorted(nums)))) + 42921) not in bad

0.492196

def iq_test(numbers): e = [int(i) % 2 == 0 for i in numbers.split()] return e.index(True) + 1 if e.count(True) == 1 else e.index(False) + 1

0.492141

class Solution: def isPerfectSquare(self, num): """ :type num: int :rtype: bool """ n = num**0.5 if n == int(n): return True else: return False

0.491822

def is_thue_morse(seq): init_seq = [0] while len(init_seq) < len(seq): init_seq += [1 if n == 0 else 0 for n in init_seq] return init_seq[:len(seq)] == seq

0.490943

def fish(shoal): eaten, size, target = 0, 1, 4 for f in sorted(map(int, shoal)): if f > size: break eaten += f if eaten >= target: size += 1 target += 4 * size return size

0.490768

def shortest_arrang(n): # For odd n, we can always construct n with 2 consecutive integers. if n % 2 == 1: return [n//2 + 1, n//2] # For even n, n is the sum of either an odd number or even number of # consecutive positive integers. Moreover, this property is exclusive. for i in range(3, n...

0.489683

def square_sum(numbers): return sum(x ** 2 for x in numbers)

0.489384

def is_happy(n): seen = set() while n not in seen: seen.add(n) n = sum( int(d)**2 for d in str(n) ) return n == 1 def happy_numbers(n): return [x for x in range(1, n+1) if is_happy(x)]

0.489265

def count_squares(n): return sum([i * i for i in range(n + 1 ) ] )

0.488566

def is_narcissistic(n): num = str(n) length = len(num) return sum(int(a) ** length for a in num) == n

0.488125

from itertools import product def proc_seq(*args): nums = set(int(''.join(l)) for l in product(*(str(a) for a in args)) if l[0] != '0') if len(nums) == 1: return [1, nums.pop()] return [len(nums), min(nums), max(nums), sum(nums)]

0.487093

def sumin(n): return n * (n + 1) * (2 * n + 1) // 6 def sumax(n): return n * (n + 1) * (4 * n - 1) // 6 def sumsum(n): return n * n * (n + 1)

0.486939

import math class Sudoku(object): def __init__(self, board): self.board = board def is_valid(self): if not isinstance(self.board, list): return False n = len(self.board) rootN = int(round(math.sqrt(n))) if rootN * rootN != n: return False...

0.486559

from itertools import combinations def isRect(a,b,c): X,Y,Z = sorted( sum( (q-p)**2 for p,q in zip(p1,p2)) for p1,p2 in [(a,b), (a,c), (b,c)] ) return X+Y == Z def count_rect_triang(points): return sum( isRect(*c) for c in combinations(set(map(tuple, points)), 3) )

0.486379

from collections import defaultdict SQUARES = [x**2 for x in range(1, 3163)] DIGITS = defaultdict(int) for sqr in SQUARES: DIGITS[''.join(sorted(str(sqr)))] += 1 def sort_by_perfsq(arr): return sorted(arr, key=lambda n: (-DIGITS[''.join(sorted(str(n)))], n))

0.485414

class Solution: def checkIfExist(self, arr: List[int]) -> bool: found = {} for num in arr: if num * 2 in found: return True if num % 2 == 0 and num / 2 in found: return True found[num] = True return False

0.484166

def check_concatenated_sum(n, r): return abs(n) == sum(int(e*r) for e in str(abs(n)) if r)

0.48388

def check_three_and_two(array): return { array.count(x) for x in set(array) } == {2, 3}

0.483614

def solution(*args): return len(args) != len(set(args))

0.483252

def comp(array1, array2): try: return sorted([i ** 2 for i in array1]) == sorted(array2) except: return False

0.481156

def est_subsets(arr): return 2**len(set(arr)) - 1

0.479536

def different_squares(matrix): s = set() rows, cols = len(matrix), len(matrix[0]) for row in range(rows - 1): for col in range(cols - 1): s.add((matrix[row][col], matrix[row][col + 1], matrix[row + 1][col], matrix[row + 1][col + 1])) return len(s)

0.479096

def square_it(digits): s = str(digits) n = len(s)**0.5 if n != int(n): return "Not a perfect square!" n = int(n) return "\n".join(s[i*n:i*n+n] for i in range(int(n)))

0.478866

def almost_increasing_sequence(sequence): save, first = -float('inf'), True for i,x in enumerate(sequence): if x > save: save = x elif first: if i == 1 or x > sequence[i-2]: save = x first = False else: return False return True

0.478827

def check_root(string): try: a,b,c,d = [int(i) for i in string.split(',')] if not (a == b-1 and a == c-2 and a == d-3): return 'not consecutive' s = a*b*c*d+1 return str(s)+', '+str(int(s**0.5)) except: return 'incorrect input'

0.478407

def prod2sum(a, b, c, d): e = sorted([abs(a*d-b*c), abs(a*c+b*d)]) f = sorted([abs(a*c-b*d), abs(a*d+b*c)]) if e == f: return [e] else: return sorted([e, f])

0.478154

def is_keith_number(n): numList = [int(i) for i in str(n)] # int array if len(numList) > 1: # min 2 digits itr = 0 while numList[0] <= n: # replace array entries by its sum: numList[itr % len(numList)] = sum(numList) itr += 1 if n in numList: # ...

0.478052

def count_squares(lines): def s(i, j, z): try: return ( '+' == lines[i+z][j] == lines[i][j+z] == lines[i+z][j+z] and all(lines[i][c] in '-+' for c in range(j+1, j+z)) and all(lines[i+z][c] in '-+' for c in range(j+1, j+z)) and all...

0.477953

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ res = 0 temp = sorted(arr) sum1, sum2 = 0, 0 for i in range(0,len(arr)): sum1 += arr[i] sum2 += temp[i] if(sum1 =...

0.477775

def polydivisible(x): for i in range(1, len(str(x)) + 1): if int(str(x)[:i]) % i != 0: return False return True

0.477711

def is_very_even_number(n): while len(str(n)) > 1: n = sum(int(x) for x in str(n)) return True if n % 2 == 0 else False

0.477258

class Solution: def checkPerfectNumber(self, num): """ :type num: int :rtype: bool """ perfect = set([6, 28, 496, 8128, 33550336, 8589869056]) return num in perfect

0.477258

Given a rectangular cake with height h and width w, and two arrays of integers horizontalCuts and verticalCuts where horizontalCuts[i] is the distance from the top of the rectangular cake to the ith horizontal cut and similarly, verticalCuts[j] is the distance from the left of the rectangular cake to the jth vertical c...

class Solution: def maxArea(self, h: int, w: int, horizontalCuts: List[int], verticalCuts: List[int]) -> int: mod = int(1e9)+7 return ( ( self.getMax(horizontalCuts, h) % mod ) * ( self.getMax(verticalCuts, w) % mod ) ) % mod def getMax(self, cuts, size): if len(cuts) == 1: ...

0.926161

from collections import defaultdict,deque import sys,heapq,bisect,math,itertools,string,queue,copy,time sys.setrecursionlimit(10**8) INF = float('inf') mod = 10**9+7 eps = 10**-7 def inp(): return int(sys.stdin.readline()) def inpl(): return list(map(int, sys.stdin.readline().split())) def inpl_str(): return list(sys.s...

0.725635

def check(amidakuji,w): before=0 flag=True for _ in range(w-1): if amidakuji&1==1 and before==1: flag=False break elif amidakuji&1==1: before=1 amidakuji>>=1 else: before=0 amidakuji>>=1 return flag from sys...

0.690306

from operator import mul from functools import reduce def cmb(n, r, p): if (r < 0) or (n < r): return 0 r = min(r, n - r) return fact[n] * factinv[r] * factinv[n-r] % p p = 10 ** 9 + 7 N = 10 ** 6 fact = [1, 1] # fact[n] = (n! mod p) factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p) inv ...

0.677529

def build_fac(): nonlocal mod fac = [1] * int(3e5 + 1) for i in range(1, int(3e5)): fac[i] = i*fac[i-1] % mod return fac def inv(x): nonlocal mod return pow(x, mod-2, mod) def ncr(n, r): nonlocal fac if n < 0 or n < r: return 0 return fac[n]*inv(fac[r])*inv(fac[n-r]) % mod def cf(f, ...

0.667294

def init_factorials(N, mod): f = 1 fac = [1] * N for i in range(1, N): f *= i f %= mod fac[i] = f return fac def init_inv(N, mod, fac): b = bin(mod-2)[2:][-1::-1] ret = 1 tmp = fac[N] if b[0] == '1': ret = fac[N] for bi in b[1:]: tmp *= tmp ...

0.661546

class Solution: def maxSumRangeQuery(self, nums: List[int], requests: List[List[int]]) -> int: count = [0] * (len(nums) + 1) for start, end in requests: count[start] += 1 count[end + 1] -= 1 for i in range(1, len(nums) + 1): count[i] += count[i - 1] count.pop() res = 0 for n...

0.642282

mod = 10**9 + 7 n, h = map(int, input().split()) a = list(map(int, input().split())) dp = [[0 for j in range(h + 1)] for i in range (n + 1)] dp[0][0] = 1 for i in range(1, n + 1): need = h - a[i - 1] if need < 0: break if need == 0: dp[i][0] = dp[i - 1][0] else: dp[i][need] = (dp[i - 1][need] + dp[i - 1][need...

0.636835

class Solution: def maxSum(self, nums1: List[int], nums2: List[int]) -> int: d2 = {nums2[i]:i for i in range(len(nums2))} _nums1 = [] _nums2 = [] prev_i, prev_j = 0, 0 for i in range(len(nums1)): if nums1[i] in d2: _nums1.append(sum(nums1[prev_i:i]...

0.634488

MOD=10**9+7 N,C=map(int, input().split()) A=list(map(int, input().split())) B=list(map(int, input().split())) P=[[1] for _ in range(401)] for _ in range(1,401): for i in range(1,401): P[i].append(P[i][-1]*i%MOD) R=[[] for _ in range(N)] for i,AB in enumerate(zip(A, B)): AA,BB=AB for a in range(401):...

0.629989

M=998244353 class Factorial: def __init__(self,n): self.f=f=[0]*(n+1) f[0]=b=1 for i in range(1,n+1):f[i]=b=b*i%M self.inv=inv=[0]*(n+1) inv[n]=b=pow(self.f[n],M-2,M) for i in range(n,0,-1):inv[i-1]=b=b*i%M def factorial(self,i): return self.f[i] def i...

0.628095

class Solution: def numberWays(self, hats: List[List[int]]) -> int: # assign hat to people n = len(hats) dic = collections.defaultdict(list) for i,hat in enumerate(hats): for h in hat: dic[h].append(i) # mask for people: ways bfs =...

0.627049

class Solution: def profitableSchemes(self, G: int, P: int, group: List[int], profit: List[int]) -> int: MOD = 10**9 + 7 group_len, profit_len = len(group),len(profit) dp = [[0]*(G+1) for _ in range(P+1)] dp[0][0] = 1 for pro, gro in zip(profit,group): dp2 = [x[:]...

0.623135

class Solution: def rectangleArea(self, rectangles: List[List[int]]) -> int: def getArea(width): res = 0 prev_low = 0 for low, high in intervals: low = max(prev_low, low) if high > low: res += (high - low)*width...

0.622381

from queue import Queue import sys import math import os.path # CONFIG sys.setrecursionlimit(10**9) # LOG def log(*args, **kwargs): print(*args, file=sys.stderr, **kwargs) # INPUT def ni(): return list(map(int, input().split())) def nio(offset): return [int(x) + offset for x in input().split()] def...

0.598989

H, W = map(int, input().split()) ans = float('inf') for h in range(1,H): S = [h * W] w = W // 2 S += [(H-h) * w] S += [(H-h) * (W-w)] ans = min(ans,max(S)-min(S)) for h in range(1,H): S = [h * W] hb = (H-h) // 2 S += [hb * W] S += [(H-h-hb) * W] ans = min(ans,max(S)-min(S)) for...

0.594988

from math import ceil from bisect import bisect_right as b_r from bisect import bisect_left as b_l ar = list(map(int , input().split())) a = [int(ceil((ar[1]-int(x)+1)/ar[2])) for x in input().split()] s = sum(a) ar[1] = max(a) m = ar[1] - (s-ar[1])%2 mi = s%2 print(int( (m-mi)//2 +1)%(10**9+7))

0.59041

import sys f = sys.stdin C, Hr, Hb, Wr, Wb = map(int, f.readline().strip().split()) if Hr/Wr < Hb/Wb: Hr, Hb, Wr, Wb = Hb, Hr, Wb, Wr if (C % Wr) == 0 and (C // Wr) > 0: print((C // Wr)*Hr) elif (C // Wr) == 0: print((C // Wb)*Hb) else: nmax = (C // Wr) pmax = nmax*Hr + ((C - nmax*Wr) // W...

0.589854

n,N,MOD,ans=int(input()),int(1e6+5),int(1e9+7),0 cnt,pw,f=[0]*int(N),[1]*(n+1),[0]*int(N) for i in range(n): pw[i+1]=pw[i]*2%MOD for i in input().split(): cnt[int(i)]+=1 for i in reversed(range(2,N)): t=sum([cnt[j] for j in range(i,N,i)]) if t: f[i]=t*pw[t-1]%MOD for j in range(i*2,N,i): f[i]=(f[i]-f[j])%MOD...

0.586714

x,y=map(int, input().split()) A=list(map(int, input().split())) B=list(map(int, input().split())) A,B=sorted(A)[::-1],sorted(B)[::-1] mod=10**9+7 X,Y=0,0 for i in range(x): d=A[i]*(x-i)-A[i]*(i)-A[i] X+=d X%=mod for i in range(y): d=B[i]*(y-i)-B[i]*(i)-B[i] Y+=d Y%=mod print(X*Y%mod)

0.585282

H, W = map(int, input().split()) h, w = map(int, input().split()) print((H-h) * (W-w))

0.582638

from itertools import chain import numpy as np import networkx as nx h, w, *X = map(int, open(0).read().split()) C = np.array(X[:100], dtype=int).reshape((10, 10)) A = np.array(X[100:], dtype=int).reshape((h, w)) G = nx.DiGraph(C) d = {-1:0} for i in range(10): d[i] = nx.shortest_path_length(G, i, 1, weight='weig...

0.582382

n, k = map(int, input().split()) l = [(0, 0) for i in range(k)] for i in range(k): start, end = map(int, input().split()) l[i] = start, end dp = [0 for i in range(n+1)] prefixSum = [0 for i in range(n+1)] dp[1] = 1 prefixSum[1] = 1 for i in range(2, n + 1): for j in range(k): start, end = l[j] ...

0.580546

class Solution: def maxPerformance(self, n: int, speed: List[int], efficiency: List[int], k: int) -> int: mod = 10**9+7 order = sorted(range(n), key=lambda i: efficiency[i], reverse=True) heap = [] filled = 0 rec = 0 speed_sum = 0 for i in order: ...

0.579534

h, w, k = list(map(int, input().split())) choco = [list(map(int, list(input()) )) for i in range(h)] choco_cumsum = [[0 for i in range(w)] for j in range(h)] for i in range(h): choco_cumsum[i][0] = choco[i][0] for j in range(1, w): choco_cumsum[i][j] = choco_cumsum[i][j-1] + choco[i][j] ans = h + w ...

0.579115

import sys readline = sys.stdin.readline MOD = 998244353 N = int(readline()) wants = [tuple(map(int, readline().split()))[1:] for _ in range(N)] Q = [0]*(10**6+1) P = [0]*(10**6+1) for i in range(N): k = len(wants[i]) kinv = pow(k, MOD-2, MOD) for w in wants[i]: P[w] += 1 Q[w] = (Q[w] + k...

0.578053

import sys def input(): return sys.stdin.readline()[:-1] H, W = map(int, input().split()) s = [input() for _ in range(H)] ans = max(H, W) def max_rect(a): res = 0 stack = [a[0]] for i in range(1, W-1): new_pos = i while stack and stack[-1] % 10000 >= a[i]: pos, hght = stack[-1] // 10000, stack[-1] % 10000 ...

0.576834

def resolve(): H, W, D = list(map(int, input().split())) A = [list(map(int, input().split())) for _ in range(H)] Q = int(input()) LR = [list(map(int, input().split())) for _ in range(Q)] num_to_pos = {} for i in range(H): for j in range(W): num_to_pos[A[i][j]] = (i, j) ...

0.576688

import math n, k = [int(x) for x in input().split()] a = [int(x) for x in input().split()] b = [int(x) for x in input().split()] c = 1 for i in range(n // k): count = (10 ** k - 1) // a[i] + 1 mmin = b[i] * (10 ** (k-1)) mmax = (b[i] + 1) * (10 ** (k-1)) - 1 mcount = mmax // a[i] - math.ceil(mmin / a...

0.574713

class Solution: def countRoutes(self, locations: List[int], start: int, finish: int, fuel: int) -> int: n = len(locations) sloc = sorted([(x,i) for i,x in enumerate(locations)]) froutes = [[0]*n for _ in range(fuel+1) ] st,fn = -1,-1 for i in range(n): if sloc[i][...

0.573763

n, k = list(map(int, input().split())) MOD = 10**9+7 def fast_modinv(up_to, M): ''' Fast modular inverses of 1..up_to modulo M. ''' modinv = [-1 for _ in range(up_to + 1)] modinv[1] = 1 for x in range(2, up_to + 1): modinv[x] = (-(M//x) * modinv[M%x])%M return modinv maxn = 2*10**5 + 1...

0.572807

mod = 10 ** 9 + 7 n = int(input()) h = list([int(x) - 1 for x in input().split()]) ans = x = 0 for i in range(n): ans += h[i] + min(h[i], h[i - 1]) * x if i < n - 1: x *= min(h[i - 1], h[i], h[i + 1]) x += min(h[i], h[i + 1]) ans %= mod x %= mod print(ans)

0.57007

# cook your dish here folding paper from collections import Counter def li():return [int(i) for i in input().rstrip('\n').split()] def st():return input().rstrip('\n') def val():return int(input().rstrip('\n')) def dist(a,b):return ((a[0]-b[0])**2+(a[1]-b[1])**2)**0.5 for _ in range(val()): n,m,w,h=li() s=Counter(st(...

0.566756

import sys input = sys.stdin.readline n,m=map(int,input().split()) a=list(map(int,input().split())) b=list(map(int,input().split())) mod=998244353 sol=1 i=n-1 j=m-1 while sol>0 and j>=0: goal=b[j] s=0 r=False while i>=0 and a[i]>=goal: if r: s+=1 else: if a[i]==go...

0.566536

from sys import * from math import * mod = 1000000000 f = [0 for i in range(200)] f[0] = f[1] = 1 for i in range(2, 200): f[i] = f[i - 1] + f[i - 2] n, m = stdin.readline().split() n = int(n) m = int(m) a = list(map(int, stdin.readline().split())) for i in range(m): tp, x, y = stdin.readline().split() tp = int(t...

0.564958

# https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/discuss/569521/7-python-approaches-with-Time-and-Space-analysis class Solution: def numWays(self, steps: int, arrLen: int) -> int: r = min(arrLen, steps // 2 + 1) dp = [0, 1] for t in range(steps): ...

0.562857

def multiple_input(): return map(int, input().split()) def list_input(): return list(map(int, input().split())) mod = int(1e9) + 7 for _ in range(int(input())): n, m = multiple_input() a = list_input() a.sort() max_level = a[-1] + 1 levels = [0] * max_level levels[0] = 1 for i in a: levels[i] += 1 ans = 1...

0.562664

class Solution: def sumSubseqWidths(self, A: List[int]) -> int: A.sort() ret, mod, p = 0, 10 ** 9 + 7, 1 for i in range(len(A)): ret += (A[i] - A[len(A) - i - 1]) * p % mod p = (p << 1) % mod return ret % mod

0.562348

def main(): import sys input=sys.stdin.readline mod=998244353 N=10**5+3 fac=[1]*(N+1) for i in range(1,N+1): fac[i]=fac[i-1]*i%mod inv_fac=[1]*(N+1) inv_fac[N]=pow(fac[N],mod-2,mod) for i in range(N-1,0,-1): inv_fac[i]=inv_fac[i+1]*(i+1)%mod D=int(input()) A=[...

0.562291

w, l = [int(i) for i in input().split(' ')] arr = [int(i) for i in input().split(' ')] cummulative = [0 for i in range(len(arr) + 1)] for i in range(len(arr)): cummulative[i+1] = cummulative[i] + arr[i] min_cut = 1000000009 for i in range(w - l): cut = cummulative[i + l] - cummulative[i] if cut < min_cu...

0.562257

# -*- coding: utf-8 -*- def solve(): mod = 10**9 + 7 n, m = map(int, input().split()) p = input() if m == 0: return powmod(n) delta = len(p) - 1 ys = map(int, input().split()) answer = 1 tail = 0 for y in ys: if y > tail: answer *= powmod(y - tail - 1) ...

0.562126

n = int(input()) c, d = {}, {} for x, y in zip(input().split(), input().split()): c[x] = c.get(x, 1) + 1 c[y] = c.get(y, 1) + 1 if x == y: d[x] = d.get(x, 0) + 2 s, m = 1, int(input()) for k, v in c.items(): u = d.get(k, 0) for i in range(v - u, v, 2): s = s * (i * i + i) // 2 % m for i in range...

0.560864

p = 1000000007 n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) m = int(input()) d = [1] * 300001 td = [0] * 300001 L = b[0] for i in range(1, n): if a[i - 1] != 1: t = m % a[i - 1] if L < t: print(0) return m //= a[i - 1] for j in range((L - t) // a[i - 1] + 1):...

0.560529

class Solution: def sumSubarrayMins(self, A: List[int]) -> int: stack = [] result = 0 A = [0] + A + [0] for i, x in enumerate(A): while stack and x < A[stack[-1]]: j = stack.pop() result += A[j] * (i - j) * (j - stack[-1]) stac...

0.56048

def treeProduct(num, h, root, ch): if ch >= h: return num[root] left = (root * 2) + 1 right = (root * 2) + 2 ret1 = treeProduct(num, h, left, ch + 1) ret2 = treeProduct(num, h, right, ch + 1) return num[root] * max(ret1, ret2) def main(): n = int(input()) while n!=0: line = str(input()) s = line.split...

0.559968

import numpy as np import sys input = sys.stdin.readline H,W = list(map(int,input().split())) S=np.array([list(input().rstrip("\n")) for _ in range(H)]) == '.' D = np.zeros((H,W),dtype=int) U = np.zeros((H,W),dtype=int) L = np.zeros((H,W),dtype=int) R = np.zeros((H,W),dtype=int) # 上下 for i in range(H): U[i] = (U[i...

0.559483

h, w = list(map(int, input().split())) A = [] for i in range(h): line = list(map(int, input().split())) A.append(line) for i in range(h): line = list(map(int, input().split())) for j, num in enumerate(line): A[i][j] = abs(A[i][j] - num) const = 6400 mask = 1 << const DP = [0]*w DP[0] = mask >...

0.558186

def fastpow(base, power): result = 1 while power > 0: if power % 2 == 0: power = power // 2 base = base * base else: power = power - 1 result = result * base power = power // 2 base = base * base return result t=int(input()) for i in range(t): a=list(map(int,input().split())) n,r=a[0],a[1] ...

0.557944

#写経 #https://atcoder.jp/contests/abc168/submissions/13414936 from math import gcd from collections import Counter mod = 10**9 + 7 N,*AB = map(int,open(0).read().split()) def std(a,b): """ a,bを既約にする """ if a == 0: return(0,int(b!=0)) g = gcd(a,b) a,b = a// g, b//g return(a,b) if a > ...

0.556798

MOD = 1000000007 n = int(input()) p = [int(x) for x in input().split()] x = [int(x) for x in input().split()] children = [[] for x in range(n)] for i in range(1,n): children[p[i-1]].append(i) #print(children) count = [(0,0) for i in range(n)] for i in reversed(list(range(n))): prod = 1 for ch in childr...

0.556674

n, m = [int(x) for x in input().split()] a = [int(x) for x in input().split()] b = [int(x) for x in input().split()] mult = 1 mod = 10 ** 9 + 7 res = 0 m_inv = pow(m, mod - 2, mod) for x, y in zip(a, b): if x and y: if x > y: res += mult res %= mod break elif ...

0.556486

from fractions import gcd def count_black_cells(h, w): return (h + w) -2 + gcd(h,w)

0.554795

#!/usr/bin/env python3 M = 10 ** 9 + 7 def solve(n, m, s, lst): cnt = [0] * n t = 0 for i in range(n): if s[i] == '1': t += 1 cnt[i] = t dp = [[0] * (n + 1) for _ in range(n + 1)] dp[0][0] = 1 r = 0 j = 0 for i in range(n): while j < m: ...

0.553029

for _ in range(int(input())): n,w = map(int , input().split()) sigma = 1 #len(str(num)) == n and D[i] - D[i - 1] ... = w if(w > 9 or w < -9): print(0) continue sigma = pow(10,n - 2,1000000007) if(w >= 0): sigma *= (9 - w) else: sigma *= (w + 10) print(sigma % 1000000007)

0.551896

3 import sys from functools import lru_cache MOD = 1000000007 cnk = [[1 for i in range(1001)] for j in range(1001)] for i in range(1, 1001): for j in range(1, i): cnk[i][j] = cnk[i - 1][j - 1] + cnk[i - 1][j] k = int(input()) cs = [int(input()) for i in range(k)] ans = 1 sm = 0 for c in cs: sm += ...

0.551762

import sys from collections import defaultdict, Counter P = 10 ** 9 + 7 def factmod(n): res = 1 for i in range(2, n+1): res *= i res %= P return res def solve(): n, m = list(map(int, input().split())) colour = {i:0 for i in range(1, m+1)} colour_map = {} for i, line in en...

0.551646

n, m = map(int, input().split()) t = sorted(map(int, input().split())) f, d = [1] * (n + 1), 1000000007 for i in range(2, n + 1): f[i] = (f[i - 1] * i) % d p, q = 0, (f[t[0] - 1] * f[n - t[-1]]) % d for i in range(m - 1): l = t[i + 1] - t[i] - 1 q = (q * f[l]) % d if l > 1: p += l - 1 print(pow(2, p, d) * f...

0.551408

l= [] for i in range(62): l.append(2**i) T = int(input()) flag = 0 for t in range(T): L,R = [int(i) for i in input().split()] bL = bin(L) lL = len(bL)-2 index = 1 ans = 0 temp = 0 while(index<=lL): temp = L%l[index] if temp>=l[index-1]: if(l[index]-temp<=R-L+1): ans= (ans +(l[index-1])*(l[index]-t...

0.551325

import sys readline = sys.stdin.readline T = int(readline()) MOD = 998244353 Ans = [None]*T for qu in range(T): N, K = map(int, readline().split()) A = [0] + list(map(int, readline().split())) + [0] B = list(map(int, readline().split())) C = [None]*(N+1) for i in range(1, N+1): C[A[i]] = i...

0.551145

from bisect import bisect_left M = 998244353 def pw(x, y): if y == 0: return 1 res = pw(x, y//2) res = res * res % M if y % 2 == 1: res = res * x % M return res def cal(x, y): y += x - 1 res = 1 for i in range(1, x + 1): res = res * (y - i + 1) res = re...

0.55091

import sys mod = 10**9 + 7 for _ in range(int(input())): x = int(input()) s = list(map(int, input())) ans = len(s) for i in range(1, x+1): ans = (i + (ans-i) * s[i-1]) % mod r = len(s) for _ in range(s[i-1]-1): if len(s) < x: s += s[i:r] e...

0.550693

fact = [] fact.append(1) for i in range(1,100001): fact.append((i*fact[i-1])%1000000007) def power(a,b,p): x=1 y=a while(b>0): if(b%2 == 1): x=(x*y) if(x>p): x=x%p y=(y*y) if(y>p): y=y%p b=b/2 return x def inverse(N,p): return power(N,p-2,p) def combination(N,R,p): return (fact[N]*((...

0.550589

from collections import defaultdict import sys input = sys.stdin.readline ''' for CASES in range(int(input())): n, m = map(int, input().split()) n = int(input()) A = list(map(int, input().split())) S = input().strip() sys.stdout.write(" ".join(map(str,ans))+"\n") ''' inf = 100000000000000000 # 1e17 mod = 998244353 n,...

0.54845

T=int(input()) # cook your dish here for i in range(T): n=list(map(int,input().split())) a=n[0] b=n[1] c=n[2] l=[] A=list(map(int,input().split())) B=list(map(int,input().split())) C=list(map(int,input().split())) for i in range(b): for j in range(a): for k in ra...

0.5477

import fractions def read_data(): m = int(input()) h1, a1 = map(int, input().split()) x1, y1 = map(int, input().split()) h2, a2 = map(int, input().split()) x2, y2 = map(int, input().split()) return m, h1, a1, x1, y1, h2, a2, x2, y2 def solve(m, h1, a1, x1, y1, h2, a2, x2, y2): t = 0 h1...

0.547531

from bisect import bisect from collections import defaultdict class Bit: def __init__(self, n, MOD): self.size = n self.tree = [0] * (n + 1) self.depth = n.bit_length() self.mod = MOD def sum(self, i): s = 0 while i > 0: s += self.tree[i] ...

0.5473

d = 10**9 + 7 t = int(input()) while t: t-=1 n =int(input()) p =list(map(int, input().strip().split())) a =list(map(int, input().strip().split())) b =list(map(int, input().strip().split())) ans = 1 for i in range(n): c = a[i] - b[i] + 1 tmp = (( pow(p[i],b[i]...

0.545514

(N), *D = [list(map(int, s.split())) for s in open(0)] V = D[0] A = V.pop(N[0]-1) M = 1000000000 + 7 R=0 for value in reversed(V): R = R + ((A) * value) % M A = A + value print(R % M)

0.545171

mod = 1000000007 def sum(x, y, k, add) : if k < add : return 0 up = x + add if up > k : up = k add = add + 1 return y * ( ( (add + up) * (up - add + 1) // 2 ) % mod ) % mod def solve(x, y, k, add = 0) : if x == 0 or y == 0 : return 0 if x > y : x, y = y, x pw = 1 while (pw ...

0.544475

n, h, m = map(int, input().split()) a = [h] * n for i in range(m): l, r, x = map(int, input().split()) for i in range(l - 1, r): a[i] = min(a[i], x) s = 0 for i in range(n): s += a[i] ** 2 print(s)

0.544212

import numpy as np n,s=map(int,input().split()) a=list(map(int,input().split())) mod=998244353 dp=np.zeros([n+1,s+1],int) dp[0][0]=1 for i in range(1,n+1): dp[i][:]=dp[i-1][:]*2 dp[i][a[i-1]:]+=dp[i-1][:-a[i-1]] dp[i][:]%=mod print(dp[n][s])

0.544088

def main(): w, h, n = list(map(int, input().split())) x_min = 0 x_max = w y_min = 0 y_max = h for _ in range(n): x, y, a = list(map(int, input().split())) if a == 1: x_min = max(x_min, x) elif a == 2: x_max = min(x_max, x) elif a == 3: ...

0.544071

mod =(10**9)+7 n,m = list(map(int,input().split())) a = [int(i) for i in input().split()] b = [int(i) for i in input().split()] dp = [] for i in range(n): dp += [[0]*m] dp[-1][-1]=1 for i in range(n-2,-1,-1): dp[i][-1]=1 for j in range(m-1): x = (a[i]+b[j])-(b[j+1]) temp = 0 for k in...

0.543958

import heapq n = int(input()) buy = [] # negative sell = [] unknown = [] res = 1 for i in range(n): cmd, amount = input().strip().split() amount = int(amount) if cmd == 'ADD': if sell and sell[0] < amount: heapq.heappush(sell, amount) elif buy and -buy[0] > amount: ...

0.541792

# cook your dish here for t in range(int(input().strip())): d = int(input().strip()) L, R = map(int, input().strip().split(" ")) if L % 2 == 0: L += 1 sum = (((((R - L + 2)//2)//d)+1)//2) - 1 sum = (sum * 2 * d * (sum + 1) * d) + (sum+1) *d * (L + d -1) print(sum%1000000007)

0.540062

n = int(input()) a = list(map(int, input().split())) aord = sorted([i for i in range(n)], key=lambda x: a[x] * (n - x) * (x + 1)) b = sorted(map(int, input().split()))[::-1] new_b = [0] * n for i in range(n): new_b[aord[i]] = b[i] b = new_b m = 998244353 c = [0] * n for i in range(n): c[i] = a[i] * b[i] % m...

0.539939

3 # Copyright (C) 2017 Sayutin Dmitry. # # This program is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License as # published by the Free Software Foundation; version 3 # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY;...

0.539102

#q = int(input()) #x, y = map(int,input().split(' ')) #print (' '.join(list(map(str, s)))) def extended_gcd(aa, bb): lastremainder, remainder = abs(aa), abs(bb) x, lastx, y, lasty = 0, 1, 1, 0 while remainder: lastremainder, (quotient, remainder) = remainder, divmod(lastremainder, remainder) ...

0.538787

n = int(input()) beauty = list(map(int, input().strip().split())) tree = [[] for i in range(n)] mod = 1000000007 used = [False for i in range(n)] def gcd(a,b): mn = min(a,b) mx = max(a,b) if mn == 0: return mx md = mx%mn if md == 0: return mn else: return gcd(mn, md) for ...

0.538775

class Solution: def rangeSum(self, nums: List[int], n: int, left: int, right: int) -> int: # B: partial sum of A # C: partial sum of B # Use prefix sum to precompute B and C A = nums B, C = [0] * (n + 1), [0] * (n + 1) for i in range(n): B[i + 1] = B[i] + ...

0.5386

MAX = 100005 tree = [0] * MAX; lazy = [0] * MAX; def updateRangeUtil(si, ss, se, us, ue, diff) : if (lazy[si] != 0) : tree[si] += lazy[si]; if (ss != se) : lazy[si * 2 + 1] += lazy[si]; lazy[si * 2 + 2] += lazy[si]; lazy[si] = 0; if (ss > se or ss > ue or se ...

0.538216

import sys input = sys.stdin.readline MOD = 10 ** 9 + 7 t = int(input()) for _ in range(t): n, p = list(map(int, input().split())) l = list(map(int, input().split())) if p == 1: print(n % 2) else: l.sort(reverse = True) curr = l[0] out = 0 real = True f...

0.537509

import itertools import numpy as np b = np.zeros((100001), dtype=np.int) def power2(a): b[0] = 1 if b[a] > 0: return b[a] else: for i in range(1,a+1): b[i] = b[i-1]*2 if b[i] > (10**9+7): b[i] = b[i]%(10**9+7) return b[a] def __starting_point(): t = eval(input()) for i in range(t): s = input()...

0.536616

d=1000000007 for _ in range(int(input())): l=sorted(list(map(int,input().split()))) ans=(l[0]%d)*((l[1]-1)%d)*((l[2]-2)%d) print(ans%d)

0.534743

mod = int(1e9 + 7) n, m = map(int, input().split()) f = [ [0 for i in range(60)] for j in range(60) ] g = [ [0 for i in range(60)] for j in range(60) ] s = [ [0 for i in range(60)] for j in range(60) ] inv = [ 1 ] f[0][0] = s[0][0] = 1 def pow(x, exp) : res = 1 for i in range(0, 31) : if exp & 1 : res ...

0.53473

class Solution: def kConcatenationMaxSum(self, arr: List[int], k: int) -> int: oneArrSum = sum(arr) twoArr = arr + arr def findMaxSub(array): if len(array) == 1: return array[0] cur = 0 small = 0 ret = -999...

0.534395

import sys input = sys.stdin.readline #lev contains height from root,lower neighbour, higher neighbours #lev[0] contains 0 (because it is the root), higher neighbours (=neighbours) n,m,q=map(int,input().split()) mod=1000000007 mxw=0 wgts=[0]*n neig=[0]*n for i in range(n): neig[i]=[0] for i in range(m): a,b,w=...

0.534327

P = 998244353 N, M = list(map(int, input().split())) A = [int(a) for a in input().split()] B = [int(a) for a in input().split()] li = sum([A[i]*B[i] for i in range(N)]) di = sum([(A[i]^1)*B[i] for i in range(N)]) X = [[] for _ in range(M+1)] X[0] = [1] def calc(L): su = sum(L) pl = 0 pd = 0 RE = [] ...

0.533864

f = 5003*[0] modn = 1000000007 def qPow(a, b): nonlocal modn res = 1 while b > 0: if (b & 1) == 1: res = res * a % modn a = a * a % modn b = b >> 1 return res def getF(): nonlocal f f[0] = 1 for i in range(1, 5001): f[i] = f[i-1] * i def __starting_point(): getF() T = int(input()) while T > 0...

0.533088

def main(): n,m=list(map(int,input().split())) s=list(map(int,input().split())) t=list(map(int,input().split())) dp=[[0]*(m+1) for _ in [0]*(n+1)] for i in range(n+1): dp[i][m]=1 for i in range(m+1): dp[n][i]=1 for i in range(n-1,-1,-1): for j in range(m-1,-1,-1): ...

0.533026

h, w = list(map(int, input().split())) field = [[c == "." for c in input()] + [False] for i in range(h)] field.append([False] * (w + 1)) subVerts = [[0] * (w + 1) for i in range(h + 1)] subHoriz = [[0] * (w + 1) for i in range(h + 1)] for y in range(h): subVerts[y][0] = 0 subHoriz[y][0] = 0 for x in range(w)...

0.532795

w, h = map(int, input().split()) u1, d1 = map(int, input().split()) u2, d2 = map(int, input().split()) for i in range(h, -1, -1): w += i if i == d1: w = max(w - u1, 0) elif i == d2: w = max(w - u2, 0) print(w)

0.530654

c=0 for i in range (int(input ())): a, b=map(int, input().split()) c+=abs(a-b)+1 print(c%((10**9) +7))

0.530628

s = input() t = input() n = len(s) m = len(t) t = t + '$' + s p = [0] * (n + m + 1) k = 0 for i in range(1, n + m + 1): while k > 0 and t[k] != t[i]: k = p[k - 1] if t[k] == t[i]: k += 1 p[i] = k ans = [0] * n sums = [0] * (n + 1) curs = 0 was = False j = 0 MOD = 10 ** 9 + 7 for i in ran...

0.530553

import math f = math.factorial for u in range(eval(input())): n, q = list(map(int, input().split())) for j in range(q): i,k = list(map(int, input().split())) if k>i: c=0 print(c) else: a=2**(n-i) b=1 d=int(i-1) e=1 h=1 g=1 #b=f(i-1)/f(k-1)/f(i-k) if(k-1>i-k): for z in range(i-k...

0.529376

def main(): f= [1] for i in range(1,1000002): f.append((f[-1] * i)%1000000007) n = int(input()) a = sorted(int(x) for x in input().split()) sol = 0 j = 0 s = 1 sq = 1 for i in range(n - 1): sq = sq * (n - i) % 1000000007 if a[i] != a[i + 1]: ...

0.529314

class Solution: def dieSimulator(self, n: int, rollMax: List[int]) -> int: a,b,m=[deque([0]*x) for x in rollMax],[1]*6,1000000007 for x in a: x[-1]=1 for _ in range(n-1): s=sum(b)%m for i,x in enumerate(a): x.append((s-b[i])%m) b[i]=(b[...

0.52878

import sys readline = sys.stdin.readline H, W = map(int, readline().split()) G = [[1 if s == '#' else 0 for s in readline().strip()] for _ in range(H)] DIREC = [(0, 1), (1, 0), (-1, 0), (0, -1)] def calc(): zh = 0 for i in range(H): cnt = 0 for j in range(W): if G[i][j]: ...

0.528267

def main(): import sys input = sys.stdin.readline N, H, L, R = list(map(int, input().split())) A = list(map(int, input().split())) dp = [[-1] * H for _ in range(N+1)] dp[0][0] = 0 for i, a in enumerate(A): for t in range(H): if dp[i][t] >= 0: dp[i+1][(t+...

0.528076

# cook your dish here import sys mod_val = 1000000007 rang = [0]*101 pow_cache = [0]*102 multisets = {} def mod_pow(base, pow): result = 1 while pow: if pow&1: result = (result*base) % mod_val base = (base*base) % mod_val pow = pow>>1 return result def precalculate(): for i in range(1, 102): pow_ca...

0.527665

from sys import stdin, stdout, exit mod = 10**9 + 7 def modinv(x): return pow(x, mod-2, mod) N = 2*10**5 + 10 facts = [1]*N for i in range(1,N): facts[i] = facts[i-1] * i facts[i] %= mod def binom(n, k): ans = modinv(facts[k]) * modinv(facts[n-k]) ans %= mod ans *= facts[n] ans %= mod ...

0.527641

Given an array of integers arr and an integer d. In one step you can jump from index i to index: i + x where: i + x < arr.length and 0 < x <= d. i - x where: i - x >= 0 and 0 < x <= d. In addition, you can only jump from index i to index j if arr[i] > arr[j] and arr[i] > arr[k] for all indices k between i and j (Mo...

class Solution: def maxJumps(self, arr: List[int], d: int) -> int: dp = [1] * (len(arr) + 1) stack = [] for i, n in enumerate(arr + [1000000]): while stack and arr[stack[-1]] < n: same_height_idx = [stack.pop()] while stack and arr[stack[-1]] == ar...

0.801806

import sys def read_int(): return int(input()) def read_ints(): return [int(x) for x in input().split()] n, d = read_ints() a = read_ints() a = sorted(a) best = 0 for i in range(n): for j in range(i, n): if a[j] - a[i] <= d: best = max(best, j - i + 1) print(len(a) - best)

0.685504

from collections import defaultdict class Solution: def longestSubsequence(self, arr: List[int], difference: int) -> int: count_dict = defaultdict(int) for num in arr: count_dict[num] = count_dict[num-difference] + 1 return max(count_dict.values())

0.647024

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline mii=lambda:list(map(int,input().split())) for _ in range(int(input())): n,d=mii() a=list(mii()) ans=0 for i in range(n): while d>=i and a[i]: a[i]-=1 ans+=1 d-=i print(ans)

0.641583

read = lambda: map(int, input().split()) n, d = read() x = sorted(read()) ans = 2 for i in range(1, n): dx = x[i] - x[i - 1] if dx == 2 * d: ans += 1 elif dx > 2 * d: ans += 2 print(ans)

0.627261

class Solution: def shipWithinDays(self, weights: List[int], D: int) -> int: left = max(weights) right = left * len(weights) // D while left < right: mid = left + (right - left) // 2 c = 0 d = 1 for w in weights: if c + w <= ...

0.626472

from collections import defaultdict def fix_progression(arr): res = 0 for i in range(len(arr)): D = defaultdict(int) for j in range(i): q, r = divmod(arr[i]-arr[j], i-j) if not r: D[q] += 1 res = max(res, D[q]) return len(arr)-res-1

0.61732

class Solution: def jump(self,nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 1: return 0 else: step = 0 pos = 0 while pos != len(nums) - 1: bestStep = -1 bes...

0.614496

class Solution: def partitionDisjoint(self, A: List[int]) -> int: biggest = A[0] newbiggest = A[0] lenL = 1 total = 1 for itr in A[1:]: total += 1 if itr < biggest: lenL = total biggest = newbiggest else: ...

0.611445

def sel_number(n, d): cnt = 0 for a in range(12, n + 1): nums = list(map(int, str(a))) if nums == sorted(set(nums)) and \ all(c - b <= d for b, c in zip(nums[:-1], nums[1:])): cnt += 1 return cnt

0.605953

for _ in range(int(input())): n, k, d = list(map(int, input().split())) a = list(map(int, input().split())) s = {} for q in range(d): s[a[q]] = s.get(a[q], 0)+1 ans = len(s) for q in range(d, n): if s[a[q-d]] == 1: del s[a[q-d]] else: s[a[q-d]] -= ...

0.602058

# cook your dish here import collections def shortestSubarray(A, K): N = len(A) P = [0] for x in A: P.append(P[-1] + x) #Want smallest y-x with Py - Px >= K ans = N+1 # N+1 is impossible monoq = collections.deque() #opt(y) candidates, represented as indices of P for y, Py in enume...

0.598931

class Solution: def findTheDistanceValue(self, arr1: List[int], arr2: List[int], d: int) -> int: count=0 for i in arr1: flag=0 for j in arr2: if abs(i-j)<=d: flag=1 break if flag == 0: count+=...

0.595526

from copy import deepcopy import itertools from bisect import bisect_left from bisect import bisect_right import math from collections import deque from collections import Counter def read(): return int(input()) def readmap(): return map(int, input().split()) def readlist(): return list(map(int, input...

0.592007

def solve(): n1, m, a, d = list(map(int, input().split())) t = list(map(int, input().split())) from bisect import insort from math import floor insort(t, a * n1) pred = 0 k = 0 kpred = 0 n = 0 step = d // a + 1 sol = 0 fl = 0 for i in t: if (i > pred): ...

0.582628

def prog(): n = int(input()) inp = list(map(int,input().split())) ans = 0 for i in range(len(inp)): x,y = 0 ,0 for j in range(i,len(inp)): x+=inp[j] y+=100 if(x>y): ans = max(ans,(j-i)+1) print(ans) prog()

0.579919

def bs(arr, val, key=lambda x:x): l, r = 0, len(arr)-1 if key(arr[l])>val: return l if key(arr[r])<=val: return r+1 while l+1<r: m = (l+r)>>1 v = key(arr[m]) if v<=val: l = m else: r = m return r def bs_left(arr,...

0.578452

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ cnt, sm, ism = 0, 0, 0 for i, num in enumerate(arr): sm += num ism += i if sm == ism: cnt += 1 return cnt

0.577869

class Solution: def arrayNesting(self, nums): """ :type nums: List[int] :rtype: int """ best = 0 n = len(nums) p = [] for i in range(len(nums)): j = i current = 0 while nums[j] != -1: cur...

0.572989

from collections import Counter class Solution: def longestArithSeqLength(self, A: List[int]) -> int: c = dict(Counter(A).most_common()) # print(c) m1 = max(c.values()) # A = list(set(A)) # A.sort() index = {} # for i in range(len(A)): # index[A[i]...

0.57208

d, n, t = 0, int(input()), list(map(int, input().split())) p = {a: 0 for a in set(t)} for i in range(n): a = t[i] if not a in p: continue p.pop(a) s = t.count(a) - 1 if 2 * s < d: continue if s > d: d = s k = i + 1 for j in range(k, n): if t[j] == a: for b in set(t[k:...

0.567796

class Solution: def findPoisonedDuration(self, timeSeries, duration): """ :type timeSeries: List[int] :type duration: int :rtype: int """ if not timeSeries: return 0 prev = timeSeries[0] ret = 0 count = 0 for t i...

0.567639

class Solution: def minDifficulty(self, jobDifficulty: List[int], d: int) -> int: N = len(jobDifficulty) if N < d: return -1 dp = [jobDifficulty[0]] for j in jobDifficulty[1:]: dp.append(max(dp[-1], j)) for i in range(1, d): ...

0.562593

class Solution: def isvalid(self,C): if len(C)>2: return False if len(C)==1: a = min(C) if a==1 or C[a]==1: # EXPLANATION: # a==1 : All lengths are unitary like A=[1,2,3,4,...], so poping anything is fine # C[a...

0.559471

import collections class Graph: def __init__(self, n, dir): self.node_cnt = n self.__directed = dir self.__adjList = [] for i in range(n): self.__adjList.append([]) def addEdge(self, u, v): self.__adjList[u].append(v) if not self.__directed: self.__adjList[v].append(u) def getDistances(self, start, e...

0.558641

def Search(L,aa,x): a=aa b=len(L) while(b-a>1): i=(b+a)//2 if(L[i]>x): b=i elif(L[i]<x): a=i else: return (i+1)-aa-1 return b-aa-1 import math n,d=list(map(int,input().split())) P=list(map(int,input().split())) ans=0 for i in range(n...

0.558605

from collections import deque class Solution: def minJumps(self, arr: list) -> int: if len(arr) == 1: return 0 graph = {} for i, n in enumerate(arr): if n in graph: graph[n].append(i) else: graph[n] = [i] c...

0.556607

class Solution: def maxTurbulenceSize(self, A: List[int]) -> int: if len(A) == 1: return 1 prev = A[1] maxcount = count = 1 + int(A[0] != A[1]) print(count) lastcomp = A[0] < A[1] for a in A[2:]: comp = prev < a if prev == a: ...

0.555913

for i in range(int(input())): n, k, d = map(int, input().split()) a = list(map(int, input().split())) ans = d for day in range(n - d + 1): ans = min(ans, len(set(a[day:day + d]))) print(ans)

0.553629

n = int(input()) mas = list(map(int, input().split())) dist = set([0]) res = 1 for i, e in enumerate(mas): time = i + 1 if e in dist: dist.remove(e) else: res += 1 dist.add(time) print(res)

0.553297

class Solution: def maxWidthRamp(self, A: List[int]) -> int: width = 0 icandidate = [0] for i in range(len(A)): if A[i] < A[icandidate[-1]]: icandidate.append(i) for j in range(len(A) - 1, -1, -1): while icandidate and A[icandidate[-1]] <= A[j]...

0.552404

class Solution: def maxNonOverlapping(self, nums: List[int], target: int) -> int: sum_set = set() sum_set.add(0) temp = 0 count = 0 for num in nums: temp += num if temp - target in sum_set: count += 1 sum_set.clear() ...

0.55039

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.54853

import sys import math input=sys.stdin.readline #sys.setrecursionlimit(1000000) mod=int(1000000007) i=lambda :map(int,input().split()) n=int(input()) a=[int(x) for x in input().split()] t=[[0]*21 for i in range(300005)] for i in range(n): t[i][0]=a[i] def build(n): for j in range(1,20): for i in rang...

0.547453

# O(n) time and space # Hashmap and array # Count number then count occurrence: # Count the occurrences of each number using HashMap; # Keep a count of different occurences # From small to big, for each unvisited least frequent element, deduct from k the multiplication with the number of elements of same occurrence, ch...

0.546567

n = int(input()) ans = 0 stk = [] for v in map(int, input().split()): last = 0 while len(stk) and stk[-1][0] < v and stk[-1][1]: last = max(last, stk[-1][1]) del stk[-1] if not len(stk) or stk[-1][0] < v: stk.append((v, 0)) else: stk.append((v, last + 1)); ans = max(ans,...

0.545687

n=int(input()) vec=list(map(int,input().split())) al=[] otrez=[] for x in vec: if len(al)==0: al.append(x) elif(x<=al[-1]): otrez.append(al) al=[x] else: al.append(x) otrez.append(al) maxx=0 if(len(otrez)!=1): for i in range(0,len(otrez)-1): if(len(otrez[i])==1)or...

0.545321

n = input() v = list(map(int, input().split())) best = 1 current = 1 for i in range(1, len(v)): if v[i-1] <= v[i]: current += 1 else: current = 1 best = max(best, current) print(best)

0.545207

class Solution: def longestSubarray(self, nums: List[int]) -> int: if not 0 in nums: return len(nums) - 1 ans = 0 tot = 0 prev = 0 for n in nums: if n == 1: tot += 1 else: ans = max(tot+prev, ans) ...

0.544698

n = int(input()) a = [0] + list(map(int, input().split())) + [1001] mx = 1 p = 1 for i in range(1, n + 2): if a[i] == a[i - 1] + 1: p += 1 mx = max(p, mx) else: p = 1 print(max(0, mx - 2))

0.541977

import sys def solve(): n = int(sys.stdin.readline()) a = [0] + [int(i) for i in sys.stdin.readline().split()] dp = [[0]*(n + 1) for i in range(n + 1)] ans = 0 maxnum = [0] * (10**5 + 2) maxmod = [0] * 7 for y in range(n + 1): maxmod = [0] * 7 for ai in a: ma...

0.541973

class Solution: def findLengthOfLCIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) < 1: return 0 cur_len = 1 max_len = 1 for i in range(1,len(nums)): if nums[i] > nums[i-1]: cur_...

0.541499

# You lost the game. n,b,d = list(map(int, input().split())) L = list(map(int, input().split())) r = 0 c = 0 for i in range(n): if L[i] <= b: c += L[i] if c > d: r += 1 c = 0 print(r)

0.540078

from collections import deque class Solution: def longestSubarray(self, nums, limit): maxQ, minQ = deque(), deque() i = 0 res = 0 for j, val in enumerate(nums): while maxQ and val > maxQ[-1]: maxQ.pop() while minQ and val < minQ[-1]: minQ.pop() max...

0.539888

n, d = map(int, input().split()) line = list(map(int, input().split())) pref = [0] * n maxx = 0 for i in range(n): pref[i] = pref[max(i - 1, 0)] + line[i] maxx = max(maxx, pref[i]) maxr = [0] * n for i in range(n - 1, -1, -1): if i == n - 1: maxr[i] = pref[i] else: maxr[i] = max(maxr[i +...

0.538815

def artificial_rain(garden): left,area,record = 0,0,1 for i in range(1,len(garden)): if garden[i] < garden[i-1]: left = i elif garden[i] > garden[i-1]: area = max(area,record) record = i - left record += 1 return max(area,record)

0.538721

test=int(input()) for _ in range(test): n=int(input()) ls=list(map(int,input().split())) ls.sort() s=0 for i in range(n): if s>=ls[i]: s=s+1 else: break print(s)

0.538279

from math import floor def group_size(S, D): return floor((2*D+S*(S-1))**.5+.5)

0.538246

R = lambda: map(int, input().split()) n = int(input()) dp = [0] * (10**6 + 1) for x in R(): dp[x] = 1 for i in range(10**6, -1, -1): if dp[i]: for x in range(i + i, 10**6 + 1, i): if dp[x]: dp[i] = max(dp[i], dp[x] + 1) print(max(dp))

0.536883

t = int(input()) for _ in range(t): nd = list(map(int, input().split())) n = nd[0] d = nd[1] cutOff = [] x = d buses = list(map(int, input().split())) for i in range(len(buses)-1,-1,-1): x = x - x%buses[i] print(x)

0.536696

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ res = 0 temp = sorted(arr) sum1, sum2 = 0, 0 for i in range(0,len(arr)): sum1 += arr[i] sum2 += temp[i] if(sum1 =...

0.534256

n=int(input()) for _ in range(n): i=int(input()) ar=sorted(list(map(int,input().split())))[::-1] mx=0 for e in range(i): mx=max(mx,min(e+1,ar[e])) print(mx)

0.534203

# cook your dish here from sys import stdin, stdout import math # from itertools import permutations, combinations from collections import defaultdict,deque # import bisect # import heapq as hq def bfs(d,n,d1,s): high=[-1 for x in range(n+1)] q=deque([0]) high[0]=0 while q: node=q.popleft() for x in d1[int(s[n...

0.531397

n = int(input()) a = [int(x) for x in input().split()] alive = 0 left = n for i in range(n - 1, -1, -1): if i < left: alive += 1 left = min(left, i - a[i]) print(alive)

0.530947

n = int(input()) A = list(map(int, input().split())) maxDist = [0] * n G = [[] for _ in range(n)] for v in range(1, n): u, d = tuple(map(int, input().split())) u -= 1 G[v].append((u, d)) G[u].append((v, d)) seen = [False] * n seen[0] = True q = [0] to_remove = [] while q: v = q.pop(); for...

0.529367

read = lambda: list(map(int, input().split())) n, d, b = read() d += 1 t, a = 0, [0] * (n + 1) for i, x in enumerate(read()): t += x a[i + 1] = t print(max(i - min(a[min(n, i * d)], (a[n] - a[max(0, n - i * d)])) // b for i in range(n + 3 >> 1)))

0.527946

n = int(input()) ar = list(map(int,input().split(' '))) ar.sort() s=[] for i in ar: s.sort(reverse=True) for j in range(len(s)): if i>=s[j]: s[j]+=1 break else: s.append(1) print(len(s))

0.52771

def main(): n = int(input()) arr = sorted(map(int, input().split())) j = 1 for x in arr: if x >= j: j += 1 print(j - 1) return 0 main()

0.527691

mod = 1000000007 eps = 10**-9 inf = 10**9 def main(): import sys input = sys.stdin.readline class Bit: def __init__(self, n): self.size = n self.tree = [0] * (n + 1) def sum(self, i): s = 0 while i > 0: s += self.tree[i] ...

0.527616

class Solution: def findLengthOfShortestSubarray(self, arr: List[int]) -> int: n = len(arr) if n<=1: return 0 l,r = n,-1 for i in range(1,n): if arr[i]<arr[i-1]: l = i break # monotonicially increasing ...

0.526699

n=int(input()) arr=[int(x) for x in input().split()] l=[1]*n if sorted(arr)==arr: print('0') else: for i in range(0,len(arr)): for j in range(i): if arr[i]>=arr[j] and l[i]<l[j]+1: l[i]=l[j]+1 print(n-max(l))

0.526525

class Solution: def findLatestStep(self, arr: List[int], m: int) -> int: A = arr if m == len(A): return m length = [0] * (len(A) + 2) res = -1 for i, a in enumerate(A): left, right = length[a - 1], length[a + 1] if left == m or right == m:...

0.526199

class Solution: def maxDistToClosest(self, seats: List[int]) -> int: ans = 0 for seat, group in itertools.groupby(seats): if not seat: k = len(list(group)) ans = max(ans, (k+1)//2) return max(ans, seats.index(1),seats[::-1].index(1))

0.524968

class Solution: def lengthOfLIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 0: return 0 res = [nums[0]] def binarySearch(l,target): left , right = 0 , len(l)-1 while left < right: ...

0.524004

from collections import deque from math import ceil n,d,a = map(int,input().split()) M = [list(map(int,input().split())) for i in range(n)] M = sorted([(x,ceil(h/a)) for x,h in M]) que = deque() ans = 0 atack = 0 for x,h in M: while len(que) > 0 and que[0][0] < x: tx,ta = que.popleft() atack -= ta ...

0.523926

input() memory = list(map(int, input().split())) proc_data = {p: (-1, -1) for p in memory} for i, c in enumerate(memory): d1, d2 = proc_data[c] if d1 == -1: d1 = i d2 = i proc_data[c] = (d1, d2) try: del proc_data[0] except KeyError: print("0") return data = list(proc_data.values()) data.sor...

0.523343

import sys n=0; inp=[]; tree=[];#stores the index of min in range(i,j) def build(node,i,j): if(i>j): return; if(i==j): tree[node]=int(i); return; mid=int( (i+j)/2 ); build(2*node,i,mid) build(2*node+1,mid+1,j) if( inp[ tree[2*node] ] < inp[ tree[2*node+1] ] ): t...

0.522774

class Solution: def longestConsecutive(self, nums): """ :type nums: List[int] :rtype: int """ longest_streak = 0 num_set = set(nums) for num in num_set: if num - 1 not in num_set: current_num = num current...

0.521724

#!usr/bin/env python3 from collections import defaultdict, deque from heapq import heappush, heappop from itertools import permutations, accumulate import sys import math import bisect def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline()) def LS():return [list(x) for ...

0.521267

l = 0 r = -1 segL, time = [int(x) for x in input().split()] a = [int(x) for x in input().split()] segSum = 0 segments = [] ##while r < segL-1: ## r += 1 ## segSum += a[r] ## if segSum == time: ## segments.append(r+1-l) ## elif segSum > time: ## segments.append(r-l) ## while segSum > ...

0.52087

def count_pairs_int(d, m): return sum(1 for i in range(1, m - d) if divisors(i) == divisors(i + d)) def divisors(n): return sum(1 + (n // k != k) for k in range(1, int(n**0.5) + 1) if n % k == 0)

0.520383

import sys def GRIG(L): LENT = len(L) MINT = 1 GOT = 0 DY = [ [{x: 0 for x in range(0, 10)}, 0, 0] ] for i in L: DY.append([{x: 0 for x in range(0, 10)}, 0, 0]) GOT += 1 for j in range(0, GOT): if DY[j][0][i] == 1: DY[j][0][i] = 0 ...

0.520316

# -*- coding: utf-8 -*- """ Created on Sun Apr 2 22:42:34 2017 @author: Sean38 """ n = int(input().rstrip()) s = input() a = [int(ch) for ch in s.split()] a = a[0:n] a.sort() def check_num(p, i): # i = ap + b(p+1) # min(a+b) <=> max(b) # b(p+1) <= i # b == i (mod p) max_b = (i // (p + 1)) b...

0.520153

class Solution: def removeCoveredIntervals(self, intervals: List[List[int]]) -> int: intervals.sort(key=lambda x: (x[0], -x[1])) prev_end = result = 0 for _, end in intervals: if end > prev_end: result += 1; prev_end = end return ...

0.520113

class Solution: def minIncrementForUnique(self, A: List[int]) -> int: if not A: return 0 A.sort() prev = A[0] res = 0 for num in A[1:]: if num <= prev: prev += 1 res += prev-num else: ...

0.52008

def lis(a): b = [] for c in a: # if len(b) == 0 or c > b[-1] if len(b) == 0 or c > b[-1]: b.append(c) else: l = 0 r = len(b) while l < r-1: m = l+r>>1 # if b[m] <= c: l = m if b[m] < c: l = m ...

0.520018

def mForMaxSeq(arr, n): eim = dict() for i in range(n): if arr[i] in eim: eim[arr[i]].append(i) else: eim[arr[i]] = [i] keys = sorted(eim.keys()) # print(eim, keys) connected = False count = 0 pI = -1 nKeys = len(keys) ...

0.518424

'''Author- Akshit Monga''' from sys import stdin, stdout input = stdin.readline t=int(input()) for _ in range(t): n=int(input()) a=[int(x) for x in input().split()] ans=0 dp=[-1 for i in range(0,n+1)] for i in a: var1=dp[i] var2=ans ans=max(ans,var1+1) dp[i]=max(dp[i],var2+1) print(n-ans)

0.518413

import bisect; def getIntList(): return list(map(int, input().split())); def getTransIntList(n): first=getIntList(); m=len(first); result=[[0]*n for _ in range(m)]; for i in range(m): result[i][0]=first[i]; for j in range(1, n): curr=getIntList(); for i in range(m): ...

0.51816

n = int(input()) a = list(map(int, input().split())) maxi = 0 ans = 0 for i in range(n): a[i] -= 1 maxi = max(maxi, a[i]) if maxi == i: ans += 1 print(ans)

0.517886

class Solution: def findShortestSubArray(self, nums): diction = {} for i in nums: if i not in diction: diction[i] = 1 else: diction[i] += 1 degree = max(list(diction.values())) ...

0.517502

N, I = list(map(int, input().split())) A = sorted([int(a) for a in input().split()]) B = [] j = 0 for i in range(N): if i == 0 or A[i] == A[i-1]: B.append(j) else: j += 1 B.append(j) def calc(k): K = 1<<k i = 0 j = 0 ma = 0 while j < N: if B[j]-B[i] <= K - 1:...

0.51657

class Solution: def findLongestChain(self, pairs): """ :type pairs: List[List[int]] :rtype: int """ pairs = sorted(pairs,key=lambda x:x[1]) res = 1 first = pairs[0] for i in pairs[1:]: if first[-1] < i[0]: res += ...

0.516303

from bisect import bisect_right def main(): n = int(input()) a = [int(input()) for _ in range(n)] a.reverse() lis = [a[0]] for i in range(1, n): if a[i] >= lis[-1]: lis.append(a[i]) else: lis[bisect_right(lis, a[i])] = a[i] print((len(lis))) def __star...

0.515875

import sys input = sys.stdin.readline for f in range(int(input())): n=int(input()) a=list(map(int,input().split())) a.sort() mx=1 for i in range(n): if a[i]<=i+1: mx=i+2 print(mx)

0.515776

def finding_k(arr): for n in range(max(arr)-1, 0, -1): if len({ x%n for x in arr }) == 1: return n return -1

0.515359

#!/usr/bin/env python3 n = int(input()) a = [int(x) for x in input().split()] sorted_a = sorted(a) dict_a = {} for x in a: if not x in dict_a: dict_a[x] = 1 else: dict_a[x] += 1 sorted_uniq_a = sorted(dict_a.keys()) max_fib_prefix = [a[0], a[1]] for i in range(0, len(sorted_uniq_a)): for...

0.514403

class Solution: def lenLongestFibSubseq(self, A: List[int]) -> int: def getFS(x1, x2): F = [x1, x2] while F[-1] <= 1000000000: F.append(F[-2] + F[-1]) return F C1 = getFS(1, 0) C2 = C1[1:] def getLLFS(x1, x2): ...

0.513936

def main(): from sys import stdin, stdout for _ in range(int(stdin.readline())): n = int(stdin.readline()) inp1 = [-1] * (n + 1) inp2 = [-1] * (n + 1) for i, ai in enumerate(map(int, stdin.readline().split())): if inp1[ai] < 0: inp1[ai] = i ...

0.513779

t=int(input()) for _ in range(t): n=int(input()) arr=list(map(int,input().split())) d={} for i in range(n): if arr[i] in d: d[arr[i]].append(i) else: d[arr[i]]=[i] q=int(input()) for i in range(q): m=int(input()) if len(d[m])==...

0.513386

for _ in range(int(input())): n = int(input()) A = list(map(int, input().split())) A.sort() ans = 1 for i in range(n - 1): if A[i] + 1 == A[i + 1]: ans = 2 break print(ans)

0.512506

for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) ans = 1 l1 = l[0] for i in range(1,n): if l[i] <= l1: l1 = l[i] ans = ans + 1 print(ans)

0.51179

for _ in range(int(input())): N,U,D=list(map(int,input().split())) H=list(map(int,input().split())) jumps=0 paracount=0 for i in range(len(H)-1): if H[i+1]-H[i]<=U and H[i+1]>=H[i]: jumps+=1 elif H[i]>=H[i+1] and H[i]-H[i+1]<=D: jumps+=1 elif H[i]-H[i+1]>D and paracount==0: jumps+=1 paracount=1 ...

0.511384

n = int(input()) a = list(map(int,input().split())) m = max(a) current = 0 longest = 0 for x in a: if x == m: current +=1 else: longest = max(current,longest) current = 0 longest = max(current,longest) print (longest)

0.511214

from heapq import * from collections import Counter class Solution: def minSetSize(self, arr: List[int]) -> int: counter = Counter(arr) size = len(arr) # unique elements (remove half of them) if len(counter) == size: return (size - 1) // 2 + 1 ...

0.510614

def greatest_distance(arr): return max(i - arr.index(x) for i,x in enumerate(arr))

0.510323

def check(l,n): m = 0 for i in range(n-1): x = l[i] c = 0 j = i while (j+2<n and l[j+2]==x) or (j+1<n and l[j+1] == x): if l[j+1] == x: j = j+1 else: j+=2 c+=1 if m<c: m = c return m t = ...

0.51014

from collections import Counter def obtain_max_number(arr): c = Counter(arr) while 1: find = next((k for k in c if c[k] > 1), None) if not find:return max(c) c[find] -= 2 c[find*2] = c.get(find*2,0) + 1

0.509933

def increasing_numbers(d): s = 1 for i in range(1,10): s=s*(i+d)//i return s

0.509853

n, m = list(map(int, input().split())) p = list(map(int, input().split())) c = list(map(int, input().split())) d = int(input()) k = [] for i in range(d): k.append(int(input())) vis = [False for i in range(m+1)] match = [-1 for i in range(m+1)] def dfs(u: int) -> bool: for v in e[u]: if not vis[v]: ...

0.50939

# cook your dish here n=int(input()) l=[int(i) for i in input().split()] xors=[] for i in range(n): for j in range(i+1,n): xors.append([l[i]^l[j],(i,j)]) xors.sort() #print(xors) upto=[0]*n for i in range(len(xors)): #a=xors[i][0] b,c=xors[i][1][0],xors[i][1][1] upto[c]=max(upto[c],upto[b]+1) #...

0.508226

Given two strings str1 and str2, return the shortest string that has both str1 and str2 as subsequences. If multiple answers exist, you may return any of them. (A string S is a subsequence of string T if deleting some number of characters from T (possibly 0, and the characters are chosen anywhere from T) results in th...

import sys def dp(s1, s2, i, j, mem): if (i, j) in mem: return mem[(i, j)] elif i >= len(s1) and j >= len(s2): res = '' elif i >= len(s1): res = s2[j:] elif j >= len(s2): res = s1[i:] else: if s1[i] == s2[j]: res = s1[i] + dp(s1, s2, i+1, j+1, mem...

0.759982

class Solution: def gcdOfStrings(self, str1: str, str2: str) -> str: contender = '' for i in str1: contender += i if str1.count(contender) * len(contender) == len(str1) and str2.count(contender) * len(contender) == len(str2): break orig = contender ...

0.773956

def longest(a1, a2): return "".join(sorted(set(a1 + a2)))

0.717753

def lcs(x, y): if len(x) == 0 or len(y) == 0: return '' if x[-1] == y[-1]: return lcs(x[:-1], y[:-1]) + x[-1] else: lcs1 = lcs(x,y[:-1]) lcs2 = lcs(x[:-1],y) if len(lcs1) > len(lcs2): return lcs1 else: return lcs2

0.710023

def solve(a,b): s = set(a)&set(b) return ''.join(c for c in a+b if c not in s)

0.701959

class Solution: def shortestSuperstring(self, A: List[str]) -> str: A = [a for i, a in enumerate(A) if all(a not in b for j, b in enumerate(A) if i != j)] def memo(f): dic = {} def f_alt(*args): if args not in dic: dic[args] = f(*args) ...

0.701487

class Solution: def longestCommonSubsequence(self, a: str, b: str) -> int: last, current = [0] * (len(b) + 1), [0] * (len(b) + 1) for i in range(len(a) - 1, -1, -1): for j in range(len(b) - 1, -1, -1): if a[i] == b[j]: current[j] = 1 + last[j ...

0.698319

class Solution: def findLength(self, A, B): def check(length): seen = {A[i:i+length] for i in range(len(A) - length + 1)} return any(B[j:j+length] in seen for j in range(len(B) - length + 1)) A = ''.join(map(chr, A)) ...

0.675548

from collections import * import itertools import sys def main(): a, b = input().split() ans = a + b n = len(a) m = len(b) for i in range(1, n + 1): for j in range(1, m + 1): c = a[:i] + b[:j] # print(c) ans = min(ans, c) print(ans) main()

0.641232

class Solution: def kSimilarity(self, A: str, B: str) -> int: a = '' b = '' for i in range(len(A)): if A[i] != B[i]: a+=A[i] b+=B[i] return self.dfs(a,b) def dfs(self,a,b): if not a: ...

0.628257

k = int(input()) a = reversed(input()) b = reversed(input()) aa = [0] * (k + 1) bb = [0] * (k + 1) for i, x in enumerate(a): aa[i] = ord(x) - 97 for i, x in enumerate(b): bb[i] = ord(x) - 97 carry = 0 cc = [0] * (k + 1) for i in range(k + 1): cc[i] = aa[i] + bb[i] + carry if cc[i] >= 26: carry...

0.62503

def solution(a, b): return a+b+a if len(a)<len(b) else b+a+b

0.617886

class Solution: def minWindow(self, s, t): """ :type s: str :type t: str :rtype: str """ left=-1 right = 0 result = "" totalMatch = 0 d = {} for c in t: d[c] = d.get(c, 0) + 1 for right in ran...

0.615373

def mix(s1, s2): hist = {} for ch in "abcdefghijklmnopqrstuvwxyz": val1, val2 = s1.count(ch), s2.count(ch) if max(val1, val2) > 1: which = "1" if val1 > val2 else "2" if val2 > val1 else "=" hist[ch] = (-max(val1, val2), which + ":" + ch * max(val1, val2)) return "/"...

0.612225

def maxlen(s1, s2): sm, lg = sorted((s1, s2)) return min(max(lg / 3, sm), lg / 2)

0.609328

def shift_left(a, b): r = len(a) + len(b) for i in range(-1, -min(len(a), len(b)) - 1, -1): if a[i] != b[i]: break r -= 2 return r

0.604307

from sys import stdin,stdout # stdout = open('output.txt', 'w+') # stdin = open('input.txt','r+') from collections import Counter def prefixsuffixmatch(s): pi_table=[0 for i in range(len(s))] for i in range(1,len(s)): y=pi_table[i-1] while s[i]!=s[y] and y!=0: y=pi_table[y-1] if s[i]==s[y]: y+=1 pi_ta...

0.602565

S,T = map(str,input().split()) print(T + S)

0.601392

def interweave(s1, s2): s = [''] * (len(s1) + len(s2)) s[::2], s[1::2] = s1, s2 return ''.join(c for c in s if not c.isdigit()).strip()

0.596239

def get_substr_ends(haystack, needle): ans = [-1] index = 0 for char in needle: while index < len(haystack) and char != haystack[index]: index += 1 ans.append(index) if index < len(haystack): index += 1 return ans haystack = input() needle = input() pref = get_substr_ends(haystack, needle) suff = get_...

0.595047

# coding=utf-8 from functools import reduce a = input() b = input() c = input() alen = len(a) blen = len(b) clen = len(c) kmpnext = [0]*(clen+1) i = 1 j = 0 while i < clen: while j > 0 and c[i]!=c[j]: j = kmpnext[j] if c[i] == c[j]: j+=1 kmpnext[i+1] = j i+=1 #print(kmpnext) f = [[[0 for i in range(clen+2)]...

0.594198

class Solution: def longestCommonPrefix(self, strs): """ :type strs: List[str] :rtype: str """ strs = strs import os return os.path.commonprefix(strs) # for x in strs: # if prefix in x: # print x ...

0.593677

def common_ground(s1,s2): lst = [] for w in s2.split(): if w in s1.split() and w not in lst: lst.append(w) return ' '.join(lst) if lst else "death"

0.591517

def substring(s): r, rm = [], [] for i, x in enumerate(s): if x in r or len(set(r)) < 2: r += x; else: if len(r) > len(rm): rm = r[:] r = [y for y in r[-1::-1] if y == r[-1]] + [x] if len(r) > len(rm): rm = r[:] return ''.join(rm)

0.587457

def shorter_reverse_longer(a,b): if len(a) < len(b): a, b = b, a return b+a[::-1]+b

0.582685

def prefix1(a, b): cnt = 0 for i, j in zip(a, b): if i == j: cnt += 1 else: return cnt return cnt def prefix2(a, b, num): for i in range(num, -1, -1): if b.startswith(a[:i]): return i def zfunc(str_): z = [] k = len(str_) for i ...

0.580427

def combs(a, b): return min(mesh(a, b), mesh(b, a)) def mesh(a, b): for i in range(len(a)): for j, k in zip(a[i:], b): if j + k == '**': break else: return max(i + len(b), len(a)) return len(a) + len(b)

0.578919

def levenshtein(a,b): d = [[0] * (len(b) + 1) for _ in range(len(a) + 1)] d[0][:] = list(range(len(b)+1)) for i in range(1, len(a) + 1): d[i][0] = i for i, x in enumerate(a): for j, y in enumerate(b): d[i+1][j+1] = min(1 + d[i][j+1], 1 + d[i+1][j], d[i][j] + (1 if x != y el...

0.57833

from collections import defaultdict as dd def find(a, b): n = len(a) m = len(b) dp = [[0]*(m+1) for i in range(n+1)] for i in range(n-1,-1, -1): for j in range(m-1, -1, -1): if a[i] == b[j]: dp[i][j] = dp[i+1][j+1] + 1 mx = dd(int) ans = 0 for i in range(n-1, -1, -1): for j in range(m-1, -1, -1): ...

0.577214

def scramble(s1,s2): for c in set(s2): if s1.count(c) < s2.count(c): return False return True

0.576871

from collections import Counter class Solution: def checkIfCanBreak(self, s1: str, s2: str) -> bool: d1, d2 = Counter(s1), Counter(s2) return self.check(d1, d2) or self.check(d2, d1) def check(self, d1: dict, d2: dict) -> bool: s = 0 for c in 'abcdefghijklmnopqrstuvwxyz'...

0.574405

class Solution: def findLUSlength(self, a, b): """ :type a: str :type b: str :rtype: int """ return max(len(a),len(b)) if a != b else -1

0.573885

from collections import Counter def added_char(s1, s2): return next((Counter(s2) - Counter(s1)).elements())

0.571128

q=str(input()) e=str(input()) a=len(q) b=len(e) c="" if a==b: for i in range(a): c+=q[i] c+=e[i] else: for i in range(b): c+=q[i] c+=e[i] c+=q[a-1] print(c)

0.570834

import re def buy_newspaper(s1, s2): p = re.sub(r"(.)", r"\1?", s1) return -1 if set(s2) - set(s1) else len(re.findall(p, s2)) - 1

0.57058

class Solution: def maxUncrossedLines(self, A, B): # Optimization #commons = set(A).intersection(set(B)) # or commons = set(A) & set(B) #A = [x for x in A if x in commons] #B = [x for x in B if x in commons] N1, N2 = len(A), len(B) dp = [[0 for _ in range(N2+1)] for ...

0.569603

from collections import Counter from functools import reduce from fractions import gcd def has_subpattern(s): c = Counter(s) m = reduce(gcd, c.values()) return ''.join(sorted(k*(v//m) for k,v in c.items()))

0.568784

# import sys # sys.stdin = open('in.txt', 'r') _ = input() s = input() t = input() par = [i for i in range(26)] def find(x): if par[x] != x: par[x] = find(par[x]) return par[x] else: return x for i in range(len(s)): a, b = find(ord(s[i])-97), find(ord(t[i])-97) if a != b: ...

0.568485

for _ in range(eval(input())): S1=input() m1=len(S1)/2 S2=input() m2=len(S2)/2 d1={} d2={} for i in range(len(S1)): c=S1[i] v=abs(m1-i) if c in d1: if v<d1[c][0]: d1[c]=[v,i] else: d1[c]=[v,i] for i in range(len(S2)...

0.567454

import sys reader = (s.rstrip() for s in sys.stdin) input = reader.__next__ def solve(): s,c = input().split() # i,jでjが複数あるとき n = len(s) for i in range(n-1): prev = s[i] pos = i for j in range(i+1, n): if s[j]<prev: prev = s[j] pos = j...

0.566376

def substring_test(first, second): first = first.lower() second = second.lower() for i in range(len(first) - 2): if first[i:i+2] in second: return True return False

0.565995

class Solution: def getMaxRepetitions(self, s1, n1, s2, n2): """ :type s1: str :type n1: int :type s2: str :type n2: int :rtype: int """ if s2=='aac' and n2==100: return 29999 i,j=0,0 l1=len(s1) l2=len(s...

0.564467

def check(w, s): j = 0 for i in range(len(s)): while j < len(w) and s[i] != w[j]: j += 1 if j >= len(w) or s[i] != w[j]: return False j += 1 return True n = int(input()) s = input() t = input() st = [] i = 0 while i < n and s[i] == t[i]: st.append(s[i]) ...

0.562563

def string_merge(string1, string2, letter): return string1[:string1.index(letter)] + string2[string2.index(letter):]

0.561779

x = input().split(" ") y = input() ans = '' l = 1 for i in x: if i!=y and sorted(i) == sorted(y): ans = ans + (str)(l) l=l+1 ans+='.' print("The antidote is found in",ans)

0.557655

class Solution: def longestDupSubstring(self, S): nums, N = [ord(c) - ord('a') for c in S], len(S) BASE, MOD = 26, 2**32 def check(L): cur_hash, seen = 0, set() for val in nums[:L]: cur_hash = (cur_hash * BASE + val) % MOD seen.add(cur_hash...

0.557562

a = int(input()) p, q = input().split() ans = '' for i in range(a): ans += p[i] ans += q[i] print(ans)

0.557507

import re import itertools from collections import Counter class Task: strings = [] answer = "" def getData(self): numberOfStrings = int(input()) for i in range(0, numberOfStrings): self.strings += [input()] def solve(self): badStrings = set() for current...

0.556325

class Solution: def findTheDifference(self, s, t): """ :type s: str :type t: str :rtype: str """ sums=sum([ord(i) for i in s]), sum([ord(i) for i in t]) return chr(sum([ord(i) for i in t])-sum([ord(i) for i in s]))

0.555896

class Solution: def isScramble(self, A, B): if len(A) != len(B) or sorted(A) != sorted(B): return False if len(A) == 1 or A == B: return True for i in range(1, len(A)): if self.isScramble(A[:i], B[:i]) and self.isScramble(A[i:], B[i:]): ...

0.555596

class Solution: def longestPrefix(self, strn: str) -> str: max_prefs = [0]*len(strn) curr = 0 for idx in range(1, len(strn)): while True: if curr == 0: if strn[idx] == strn[0]: curr = 1 max_prefs[idx...

0.554718

import itertools def transpose_two_strings(arr): return '\n'.join( ' '.join(elt) for elt in itertools.zip_longest(arr[0],arr[1],fillvalue=' ') )

0.550653

for _1 in range(int(input())): n=int(input()) s=input().strip() answer=s for i in range(len(s)): c=s[i] string=s[:i]+s[i+1:] for j in range(len(string)+1): answer=min(answer, string[:j]+c+string[j:]) print(answer)

0.550392

class Solution: def findLUSlength(self, strs): """ :type strs: List[str] :rtype: int """ def isSubseq(s1, s2): i, m=0, len(s1) for c in s2: if i==m: return True if s1[i]==c: i+=1 return i==m ...

0.550315

class Solution: def orderlyQueue(self, S: str, K: int) -> str: if K >= 2: return ''.join(sorted(S)) length = len(S) S = S + S i, j, k = 0, 1, 0 while j + k < len(S) and k < length: if S[i + k] == S[j + k]: k += 1 ...

0.548738

class Solution: def smallestStringWithSwaps(self, s: str, pairs: List[List[int]]) -> str: pr=[i for i in range(len(s))] def union(x,y): p1=find(x) p2=find(y) if p1!=p2: pr[p1]=p2 def find(x): while pr[x]!=x: pr[x...

0.546627

def mutate_my_strings(s1,s2): return '\n'.join( [s1] + [s2[:i]+s1[i:] for i,(a,b) in enumerate(zip(s1,s2),1) if a != b ]) + '\n'

0.546073

t = eval(input()) for _ in range(t): n = eval(input()) a = input().strip().split() cb, cs = 0, "" for i in range(len(a[0])): for j in range(i+1,len(a[0])+1): al = True s = a[0][i:j] for k in a[1:]: if s not in k: al = False break if al: if j-i>=cb: cb = max(cb, j-i) if len(...

0.545384

def work_on_strings(a, b): new_a = [letter if b.lower().count(letter.lower()) % 2 == 0 else letter.swapcase() for letter in a] new_b = [letter if a.lower().count(letter.lower()) % 2 == 0 else letter.swapcase() for letter in b] return ''.join(new_a) + ''.join(new_b)

0.543495

def solve(st,k): for l in sorted(st)[:k]: st=st.replace(l,'',1) return st

0.542481

class Solution: def numDistinct(self, s, t): """ :type s: str :type t: str :rtype: int """ setOft=set(t) news="" for ch in s: if ch in setOft: news+=ch dp=[[1 for i in range(len(news)+1)] for j in range(l...

0.540589

class Solution: def isSubsequence(self, s, t): """ :type s: str :type t: str :rtype: bool """ if len(s) > len(t): return False for i in s: if i in t: index = t.find(i) t = t[index + 1:] ...

0.539447

class Solution: def minSteps(self, s: str, t: str) -> int: s_count=[s.count(chr(i)) for i in range(97,123)] t_count=[t.count(chr(i)) for i in range(97,123)] diff=[t_count[i]-s_count[i] for i in range(26) if t_count[i]-s_count[i]>0] sum=0 for i in range(len(diff)): ...

0.53894

class Solution: def checkInclusion(self, s1, s2): """ :type s1: str :type s2: str :rtype: bool """ if len(s2) < len(s1): return False c1 = [0] * 128 n = 0 for i in s1: c = ord(i) if c1[c] == 0: n...

0.538579

def find_short(s): return min(len(x) for x in s.split())

0.538003

def ii(): return int(input()) def mi(): return list(map(int, input().split())) def li(): return list(mi()) # B. The Fair Nut and Strings n, k = mi() s = input().strip() t = input().strip() ans = 0 jj = 0 for i in range(n): if s[i] == t[i]: ans += 1 jj = i + 1 else: break c...

0.536426

class Solution: def repeatedStringMatch(self, A, B): """ :type A: str :type B: str :rtype: int """ if not set(B).issubset(set(A)): return -1 max_rep = len(B) // len(A) + 3 A_new = A for i in ...

0.535986

class Solution: def longestDiverseString(self, a: int, b: int, c: int) -> str: if a == 0 and b == 0 and c == 0: return '' res = '' heap = [(-a, 'a'), (-b, 'b'), (-c, 'c')] heapq.heapify(heap) prev_val = 0 prev_char = '' while heap: v...

0.535624

# -*- coding: utf-8 -*- """ Created on Mon Sep 28 02:20:36 2020 @author: liang """ S = input() T = input() S = S[::-1] T = T[::-1] res = list() for i in range(len(S)-len(T)+1): flag = True for j in range(len(T)): if S[i+j] == "?" or S[i+j] == T[j]: continue else: flag...

0.533385

class Solution: def isIsomorphic(self, s1, s2): return len(set(zip(s1, s2))) == len(set(s1)) == len(set(s2))

0.532864

class Solution: def lastSubstring(self, s: str) -> str: #mx = \"\" #for i in range(len(s)): # mx = max(mx,s[i:]) #return mx index = {c: i for i, c in enumerate(sorted(set(s)))} cur, radix, max_val, max_i = 0, len(index), 0, 0 for i in range(len(s)-1, -1, -1...

0.531109

s = input()[::-1] t = input()[::-1] i = 0 while i < min(len(s),len(t)) and s[i] == t[i]: i += 1 print(len(s) - i + len(t) - i)

0.530616

def shortest_to_char(s, c): if not s or not c: return [] indexes = [i for i, ch in enumerate(s) if ch == c] if not indexes: return [] return [ min(abs(i - ic) for ic in indexes) for i in range(len(s)) ]

0.530419

a = input() b = input() n, m = len(a), len(b) if n > m: b = '0' * (n - m) + b else: a = '0' * (m - n) + a i = 0 while i < max(n, m) and a[i] == b[i]: i += 1 print('=' if i == max(n, m) else '<' if int(a[i]) < int(b[i]) else '>')

0.529329

def main(): import sys n, t, s1, s2 = sys.stdin.read().split() n, t = int(n), int(t) result = [-1] * n rest = n - t for i in range(n): if rest == 0: break if s1[i] == s2[i]: result[i] = s1[i] rest -= 1 k = rest for i in range(n): ...

0.529256

def least_rotation(S: str) -> int: """Booth's algorithm.""" f = [-1] * len(S) # Failure function k = 0 # Least rotation of string found so far for j in range(1, len(S)): sj = S[j] i = f[j - k - 1] while i != -1 and sj != S[k + i + 1]: if sj < S[k + i + 1]: ...

0.528218

from collections import Counter def solve(A,B): a = Counter(A) b = Counter(B) ans = 0 for i in a: if i in b: ans += min(a[i],b[i]) return ans t = int(input()) for _ in range(t): A = input() B = input() print(solve(A,B))

0.524838

def string_constructing(a, s): if len(s) == 0: return 0 i = -1 for j, c in enumerate(s): i = a.find(c, i+1) if i < 0 or i == len(a) - 1: break return len(a) - j + (i < 0) + string_constructing(a, s[j + (i >= 0):])

0.524403

def is_substitution_cipher(s1, s2): return len(set(s1)) == len(set(s2)) == len(set(zip(s1, s2)))

0.523353

class Solution: def getHint(self, secret, guess): """ :type secret: str :type guess: str :rtype: str """ s_count = collections.defaultdict(int) g_count = collections.defaultdict(int) bull_cnt = 0 # first iteration can get bull_cnt imm...

0.523315

class Solution: def minCost(self, s: str, cost: List[int]) -> int: delete_cost = 0 last = 0 for i in range(1, len(s)): if s[last] == s[i]: if cost[last] < cost[i]: delete_cost += cost[last] last = i else: ...

0.520585

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): print(*args, **kwargs, file=sys.stderr) dprint('debug mode') except ...

0.520574

class Solution: def equalSubstring(self, s: str, t: str, maxCost: int) -> int: dist = [ abs( ord(s[i]) - ord(t[i]) ) for i in range(len(s))] # i = 0 # cur = 0 # res = 0 # for j in range(len(s)): # cur += dist[j] # while cur>maxCost: # ...

0.519223

from collections import Counter def create_anagram(s, t): return sum((Counter(s) - Counter(t)).values())

0.518064

class Solution: def shortestPalindrome(self, s): if len(s)<2: return s if len(s)==40002: return s[20000:][::-1]+s for i in range(len(s)-1,-1,-1): if s[i]==s[0]: j=0 while j<(i+1)//2 and s[i-j]==s[j]: ...

0.517922

from itertools import combinations def strings_crossover(arr, result): return sum(1 for s1,s2 in combinations(arr,2) if all(r in (x,y) for x,y,r in zip(s1,s2,result)))

0.517883

def solve(st): return sorted((st.find(c) - st.rfind(c), c) for c in set(st))[0][1]

0.517874

s1 = input() s2 = input() s = input() r='' for i in s: if i.isalpha(): #print (s1.index(i.lower())) if i.isupper(): r+= (s2[(s1.index(i.lower()))].upper()) else: r+=(s2[(s1.index(i.lower()))]) else: r+=(i) print (r)

0.517663

class Solution: def wordSubsets(self, A: List[str], B: List[str]) -> List[str]: s = set(A) letters_required = {} for i in B: for j in i: count = i.count(j) if j not in letters_required or count > letters_required[j]: letters_req...

0.516055

s, t = input(), input() sx, tx = str(sorted(s)), str(sorted(t)) def subset(s, t): i = 0 for c in s: if c == t[i]: i += 1 if i == len(t): break return i == len(t) if sx == tx: print("array") elif subset(s, t): print("automaton") elif subset(sx, tx): print("both") else: print...

0.515844

class Solution: def flipgame(self, fronts: List[int], backs: List[int]) -> int: w = set(fronts[i] for i in range(len(fronts)) if fronts[i] == backs[i]) x = set() for a in fronts: if a not in w: x.add(a) for a in backs: if a not in w: ...

0.515708

#!/usr/bin/env python3 from functools import cmp_to_key def cmpEqLen(a, b): if a < b: return -1 elif a > b: return 1 else: return 0 def compare(a, b): alen = len(a) blen = len(b) if alen == blen: return cmpEqLen(a, b) l = min(alen, blen) c = cmpEqLen(a[:...

0.515039

from string import ascii_lowercase class Solution: def removeDuplicates(self, S: str) -> str: dup = {2*ch for ch in ascii_lowercase} prev_length = -1 while prev_length!=len(S): prev_length = len(S) for d in dup: S = S.replace...

0.513849

from collections import Counter from string import ascii_lowercase def missing_alphabets(s): c = Counter(s) m = max(c.values()) return ''.join(letter * (m - c[letter]) for letter in ascii_lowercase)

0.513462

n = int(input()) words = input().split()[:n] p_base = 1543 p_mod = 1300199 current = [c for c in words[0]] for word in words[1:]: cur_hash = 0 word_hash = 0 cur_base = 1 i_matches = [] same_i = 0 biggest_match = None while same_i < len(current) and same_i < len(word): cur_hash *= p...

0.512435

import math from collections import Counter s = list(map(int, input())) substr = input().rstrip() t = list(map(int, substr)) m = len(s) x, y = 0, m z = (x + y) // 2 while z != x: if z + math.floor(math.log10(z)) + 1 <= m: x = z else: y = z z = (x + y)//2 m1 = z k = math.floor(math.log10(m1...

0.512136

from collections import Counter class Solution: def reorganizeString(self, S): """ :type S: str :rtype: str """ if len(S) <= 1: return S chars = [char for char, count in Counter(S).most_common() for _ in range(count)] h = math.ceil(...

0.511819

class Solution: def longestSubstring(self, s, k): """ :type s: str :type k: int :rtype: int """ for c in set(s): if s.count(c) < k: return max(self.longestSubstring(sp, k) for sp in s.split(c)) return len(s)

0.51151

class Solution: def addStrings(self, num1, num2): """ :type num1: str :type num2: str :rtype: str """ if len(num1) < len(num2): num1, num2 = num2, num1 addon = 0 res = "" l = len(num2) for i in range(l): ...

0.510554

A = input() B = input() C = input() turn = 'a' while True: if turn == 'a': if len(A) == 0: print('A') break turn = A[0] A = A[1:] elif turn == 'b': if len(B) == 0: print('B') break turn = B[0] B = B[1:] else: if len(C) == 0: print('C') break turn...

0.510378

class Solution: def canConvertString(self, s: str, t: str, k: int) -> bool: if len(s) != len(t): return False c = Counter((ord(c2) - ord(c1)) % 26 for c1, c2 in zip(s, t)) return k >= max( (m + 26 * (count - 1) for m, count in list(c.items()) if m), ...

0.509769

Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '*'. '?' Matches any single character. '*' Matches any sequence of characters (including the empty sequence). The matching should cover the entire input string (not partial). Note: s could be empty an...

class Solution: def isMatch(self, s, p): """ :type s: str :type p: str :rtype: bool """ '''维护两个下标，逐个比较，如果pj为*，则记录*的位置，将*后一个元素与si进行比较，如果不相等，则将i从记录的位置+1，重新比较''' i=0 j=0 star=-1 lenp=len(p) while i<len(s): ...

0.818534

class Solution: cache = {} def isMatch(self, s, p): """ :type s: str :type p: str :rtype: bool """ if (s, p) in self.cache: return self.cache[(s, p)] if not p: return not s if p[-1] == '*': if self...

0.733694

g = set(input()) s = input() n = int(input()) a = s.find("*") for _ in range(n): temp = input() if a == -1: if len(temp) != len(s): print("NO") else: for i in range(len(s)): if s[i] == '?': if temp[i] not in g: p...

0.556335

N = int(input()) p = input() M = int(input()) words = [input() for _ in range(M)] cnt = 0 letters = [set() for _ in range(M)] used = set() for c in p: used.add(c) fail = [False]*M for i, w in enumerate(words): for j, c in enumerate(w): if p[j] == '*': letters[i].add(c) if c in u...

0.530048

def product(s): return s.count("?")*s.count("!")

0.522365

class Solution: def modifyString(self, s: str) -> str: if len(s) == 0: return s string = ['#'] string.extend(list(s)) string.append('#') for i in range(1,len(string)-1): if string[i] == '?': for j in range(97,123): i...

0.507259

s = input() k = int(input()) c = 0 p = 0 has_star = False for i in range(len(s)): if s[i] in ['*', '?']: if s[i] == '*': has_star = True c -= 1 else: p += 1 c += 1 if k < c: print("Impossible") elif (not has_star) and (k > p): print("Impossible") else: sig...

0.499329

import re def asterisc_it(s): if isinstance(s,int): s=str(s) elif isinstance(s,list): s=''.join(map(str,s)) return re.sub(r'(?<=[02468])(?=[02468])', '*', s)

0.497883

t=input() s=input() n=len(s) h=[0]*(n+1) h[0]=0 j=0 fa=[0]*(n+1) for i in range(2,n+1) : while j and s[i-1]!=s[j]: #j=fa[j-1]; j=fa[j]; if s[i-1]==s[j]: j+=1 fa[i]=j; #print(fa) l=list() j=fa[n] while(j>0): l.append(j) j=fa[j] tmp=t t=s s=tmp n=len(s) dp=[0]*(n) m=[0]*n ...

0.495977

class Solution: def backspaceCompare(self, S1, S2): i1 = len(S1) - 1 i2 = len(S2) - 1 while i1 >= 0 or i2 >= 0: c1 = '' c2 = '' if i1 >= 0: c1, i1 = self.getChar(S1, i1) if i2 >= 0: c2, i2 = self.getCha...

0.494714

r, c = list(map(int, input().split())) b = [list(input()) for i in range(r)] for y in range(r): for x in range(c): if b[y][x] == '.': b[y][x] = '0' ok = True for Y in range(r): for X in range(c): if not b[Y][X].isdigit(): continue p = 0 for dy in range(-...

0.488975

def word_pattern(pattern, string): x = list(pattern) y = string.split(" ") return (len(x) == len(y) and len(set(x)) == len(set(y)) == len(set(zip(x, y))) )

0.482029

def has_subpattern(string): return (string * 2).find(string, 1) != len(string)

0.480797

h,w = map(int,input().split()) s = [list(input()) for i in range(h)] hh = -1 tmp = -1 for k,i in enumerate(s): a = i.count('*') if tmp < a: tmp = a hh = k t = [list(i) for i in list(zip(*s))] ww = -1 tmp = -1 for k,i in enumerate(t): a = i.count('*') if tmp < a: tmp = a ...

0.480127

from fnmatch import fnmatch def solve(a, b): return fnmatch(b, a)

0.47589

#!/usr/bin/env python3 def solve(n, m, s, t): if '*' in s: l, r = s.split('*') return len(l) + len(r) <= len(t) and t.startswith(l) and t.endswith(r) else: return s == t n, m = list(map(int, input().split())) s = input() t = input() print(['NO', 'YES'][solve(n, m, s, t)])

0.475503

kk=0 x = int(input()) y = input() z = [i for i in range(len(y)) if y[i] == '*'] for i in range(0, 100): for j in range(1, 100): if i in z and i+j in z and i+2*j in z and i+3*j in z and i+4*j in z: kk=1 if kk==1: print("yes") else: print("no")

0.474106

def word_problem(rules: List[Tuple[str, str]], from_str: str, to_str: str, applications: int) -> bool: rec = lambda s,n: s == to_str or n and any(s[i:].startswith(x) and rec(s[:i] + y + s[i+len(x):], n-1) for i in range(len(s)) for x,y in rules) return rec(from_str, applications)

0.472818

s = input() t = input() abc = 'abcdefghijklmnopqrstuvwxyz' dabc ={} for i in range(26): dabc[abc[i]] = i lt = {} ls = {} dd = {} ls['?'] = 0 for i in abc: lt[i] = 0 ls[i] = 0 dd[i] = 0 for letter in t: lt[letter] += 1 for letter in s: ls[letter] +=1 X = ls['?'] def check(ans): nonlocal ls, lt, abc, X return -...

0.470453

class Solution: def wordPattern(self, pattern, str): """ :type pattern: str :type str: str :rtype: bool """ # d['a'] = word #pattern_arr = list(pattern) str_arr = str.split() pattern_dict = {} str_dict = {} ...

0.464408

Mod=1000000007 s=input() n=len(s) a,b,c,d=1,0,0,0 for i in range(0,n): if s[i]=='*': a,b,c,d=0,(a+b+d)%Mod,0,0 elif s[i]=='?': a,b,c,d=(a+b+c)%Mod,(a+b+d)%Mod,0,0 elif s[i]=='0': a,b,c,d=0,0,(a+c)%Mod,0 elif s[i]=='1': a,b,c,d=0,0,b,(a+c)%Mod else: a,b,c,d=0,0...

0.457766

import re def find(stg): matches = re.findall(r"(!+|\?+)", stg) return max((f"{a}{b}" for a, b in zip(matches, matches[1:])), key=len, default="")

0.456792

class Solution: def isValid(self, s: str) -> bool: if not s: return True return self.isValid(s.replace('abc', '')) if s.replace('abc', '') != s else False

0.455117

import re class WordDictionary: def __init__(self): self.data=[] def add_word(self,x): self.data.append(x) def search(self,x): for word in self.data: if re.match(x+"\Z",word): return True return False

0.45496

import re def solve_runes(runes): for d in sorted(set("0123456789") - set(runes)): toTest = runes.replace("?",d) if re.search(r'([^\d]|\b)0\d+', toTest): continue l,r = toTest.split("=") if eval(l) == eval(r): return int(d) return -1

0.454356

# cook your dish here def ans(n,a,b): if n == act: return 0 if dp[n][a][b] != -1: return dp[n][a][b] if l[n] == "0": dp[n][a][b] return ans(n+1,a+1,b) elif l[n] == "1": dp[n][a][b] = ans(n+1,a,b+1) return ans(n+1,a,b+1) elif l[n] == "?": dp[n][...

0.452917

SCORE = {'O': '0', 'o': '0', 'k': '1'} def okkOokOo(s): return ''.join(chr(int(''.join(SCORE.get(a, '') for a in word), 2)) for word in s.split('?'))

0.45065

input() s = input() if 'MM' in s or 'YY' in s or 'CC' in s: print ('No') elif s.startswith('?') or s.endswith('?'): print ('Yes') elif '??' in s: print ('Yes') elif 'C?C' in s or 'M?M' in s or 'Y?Y' in s: print ('Yes') else: print ('No')

0.447585

# cook your dish here t=int(input()) while t: n=int(input()) r1=input() r2=input() r1count=0 r2count=0 count=0 for i in range(n): if(r1[i]=="*"): r1count+=1 if(r2[i]=="*"): r2count+=1 if(r1count>0) and (r2count>0): count=1 r1count=0 r2count=0 i=0 while(i<n): if(r1[i]=="*"): r1count+=1...

0.445662

from collections import Counter from functools import reduce from math import gcd def has_subpattern(string): return reduce(gcd, Counter(string).values()) != 1

0.444984

import sys q = int(sys.stdin.readline().strip()) for Q in range(0, q): s = sys.stdin.readline().strip() t = sys.stdin.readline().strip() p = sys.stdin.readline().strip() i = 0 j = 0 alpha = [0] * 26 while i != len(s) and j != len(t): if s[i] == t[j]: i = i + 1 ...

0.444724

# -*- coding: utf-8 -*- """ Created on Mon Sep 28 02:20:36 2020 @author: liang """ S = input() T = input() S = S[::-1] T = T[::-1] res = list() for i in range(len(S)-len(T)+1): flag = True for j in range(len(T)): if S[i+j] == "?" or S[i+j] == T[j]: continue else: flag...

0.444413

def solve(s, p): diffs = 0 for x, y in zip(s, p): if x == y: continue if x == '0': if diffs < 1: return "No" diffs -= 1 else: diffs += 1 return "Yes" if diffs == 0 else "No" for _ in range(int(input())): l = int(input()) s = input().strip() p = input().strip() print(solve(s, p))

0.443943

import sys n, k = list(map(int, input().split(' '))) s = input() def max_streak(s): result = 0 for i in range(len(s)): j = i while j < len(s) and s[j] == 'N': j += 1 result = max(result, j - i) return result for i in range(n - k + 1): cur = list(s) for j in...

0.440048

import re def slogans(p,r): reg=re.compile("|".join([p[i:] for i in range(len(p))])) return len(re.findall(reg,r))

0.439197

import sys input = sys.stdin.readline t = int(input()) for _ in range(t): n, k = list(map(int, input().split())) s = input() l = ['']*k works = True for i in range(n): c = s[i] if c != '?': if l[i%k] == c or l[i%k] == '': l[i%k] = c else: ...

0.436344

from collections import Counter def solve(s): return any(len(set(Counter(s.replace(c, '', 1)).values())) == 1 for c in s)

0.435811

pillow=lambda s:('n','B')in zip(*s)

0.435747

import re def double_check(str): return bool(re.search(r"(.)\1", str.lower()))

0.435491

class StreamChecker: def __init__(self, words: List[str]): #reverse trie self.trie = {} self.stream = deque([]) for word in set(words): node = self.trie for ch in word[::-1]: if not ch in node: node[ch] = {} ...

0.433832

from sys import stdin, stdout n = int(stdin.readline()) s = stdin.readline().strip() mins = [] packs = [] for i in range(len(s)): if s[i] == '*': mins.append(i) elif s[i] == 'P': packs.append(i) l, r = -1, 2 * len(s) + 1 while r - l > 1: m = (l + r) >> 1 test1 = mins[:] test...

0.43357

class Solution: def checkInclusion(self, s1, s2): """ :type s1: str :type s2: str :rtype: bool """ if len(s2) < len(s1): return False c1 = [0] * 128 n = 0 for i in s1: c = ord(i) if c1[c] == 0: n...

0.433526

n = q = int(input()) k = list(input()) cntl = k.count('(') cntr = k.count(')') cntq = k.count('?') for i in range(n): if k[i] == '?': if cntl < q // 2 and cntr + cntq >= q // 2: k[i] = '(' cntl += 1 cntq -= 1 else: k[i] = ')' cntr += 1 ...

0.432436

def main(): s = input() l = len(s) pretty_count = 0 for i in range(l): left_paren_count = 0 right_paren_count = 0 wild_count = 0 for j in range(i, l): if s[j] == '(': left_paren_count += 1 elif s[j] == ')': rig...

0.431069

import sys INF = 10**20 MOD = 10**9 + 7 I = lambda:list(map(int,input().split())) from math import gcd from math import ceil from collections import defaultdict as dd, Counter from bisect import bisect_left as bl, bisect_right as br """ Facts and Data representation Constructive? Top bottom up down """ def check(s): ...

0.430521

class Solution: def removeDuplicates(self, s: str, k: int) -> str: st=[['*',0]] for c in s: if c!=st[-1][0]: st.append([c,1]) else: st[-1][1]+=1 if st[-1][1]==k: st.pop() res='' for c,v in st:...

0.430361

import re def compare(a, b): return a if specificity(a) > specificity(b) else b def specificity(s): return [len(re.findall(r, s)) for r in (r'#\w+', r'\.\w+', r'(^| )\w+')]

0.429285

class Solution: def checkValidString(self, s): """ :type s: str :rtype: bool """ low, high = 0, 0 for c in s: if c == "(": low += 1 high += 1 elif c == ")": if low > 0: ...

0.427741

n, s = int(input()), 0 s1, s2 = str(input()), str(input()) b1, b2 = False, False for i in range(n): if s1[i] != '?' and s2[i] != '?': if ord(s1[i]) < ord(s2[i]): b1 = True if ord(s1[i]) > ord(s2[i]): b2 = True s += (s1[i] == '?') + (s2[i] == '?') ans1, ans2, ans3 = 1, 1, 1 for i in range(n): i...

0.426785

# cook your dish here t=int(input()) for _ in range(t): l = input() n= len(l) prod = 1 for k in range(n//2): i = l[k] j = l[n-k-1] if ((i!=j) and (i!='?' and j!="?") ): prod=0 break elif ((i==j) and (i=='?')): prod*=26 prod = prod%10000009 if n%2!=0: if l[n//2]=="?": prod*=26 print(...

0.425921

class MagicDictionary: def __init__(self): """ Initialize your data structure here. """ self.l = [] def buildDict(self, dict): """ Build a dictionary through a list of words :type dict: List[str] :rtype: void """ sel...

0.422658

import math class Solution: def isRationalEqual(self, S: str, T: str) -> bool: if len(S) == 0 or len(T) == 0: return False def process(s): if s[-1] == '.': s = s[:-1] stack, repeat_9 = [], False for i, x in enumerate(s): ...

0.421975

# cook your dish here from difflib import get_close_matches import sys, os def closeMatches(patterns, word): return get_close_matches(word, patterns, 1, 0.9)[0] def get_string(): return sys.stdin.readline().strip() def get_ints(): return map(int, sys.stdin.readline().strip().split()) ans = [] test = int(inp...

0.419603

class Solution: def repeatedSubstringPattern(self, s): return s in (s + s)[1:-1]

0.419139

def num(s): ans1 = [0]*n for q in range(n): ans1[q] = s[q] == 'a' sum1 = 0 for q in range(n): w = sum1*(s[q] == 'b') sum1 += ans1[q] ans1[q] = w sum1 = 0 for q in range(n): w = sum1*(s[q] == 'c') sum1 += ans1[q] ans1[q] = w sum1 = 0 ...

0.417872

s, p = input(), input() n, m = len(s) + 1, len(p) d = [[0] * n for t in range(n)] for x in range(1, n): i, j = x, m while i and j: j -= s[i - 1] == p[j - 1] i -= 1 if not j: for y in range(i + 1): d[x][y + x - i - m] = d[i][y] + 1 for y in range(x): d[x][y] = max(d[x][y], d[x - 1...

0.417586

n = int(input()) arr = [] for i in range(n): s = input() arr.append('<') arr.append('3') for j in range(len(s)): arr.append(s[j]) arr.append('<') arr.append('3') s = input() cur = 0 i = 0 while cur < len(s) and i < len(arr): if s[cur] == arr[i]: i+=1 cur+=1 if i == len(arr): ...

0.417394

def count_subsequences(needle, haystack): count = [1] + [0] * len(needle) for a in haystack: count = [1] + [count[i] + count[i-1] * (a == b) for i, b in enumerate(needle, 1)] return count[-1] % 10 ** 8

0.416065

3 import sys s = sys.stdin.readline().strip() k = int(sys.stdin.readline()) s += '*' * k def is_tandem(s): # print(s) n = len(s) // 2 a, b = s[:n], s[n:] for i in range(n): if a[i] == '*' or b[i] == '*': continue if a[i] != b[i]: return False return True l = 0 for i i...

0.415203

res = 1 started = False seen = set() codes = set(['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J']) for ch in input(): if ch == '?': if started: res *= 10 else: res *= 9 elif (ch in codes) and (ch not in seen): if not started: res *= len(codes) - len(seen) - 1 else: res *= len(codes) - len(seen) ...

0.414905

match = 0 nonmatch = 0 count = 0 def calc_match(s, t, p): nonlocal match nonlocal nonmatch nonlocal count if p == len(s)-len(t): return if p+len(t) < len(s): if s[p+len(t)] == '?': count -= 1 elif s[p+len(t)] == t[-1]: match -= 1 else: nonmatch -= 1 match, nonmatch = nonma...

0.414459

from sys import stdin def main(): cnt = [0] * 2 ** 18 t = str.maketrans("0123456789", "0101010101") _, *l = stdin.read().splitlines() for sign, s in map(str.split, l): if sign == '?': print(cnt[int(s, 2)]) else: cnt[int(s.translate(t), 2)] += 1 if sign == '+' el...

0.413981

from collections import Counter class Solution: def checkIfCanBreak(self, s1: str, s2: str) -> bool: d1, d2 = Counter(s1), Counter(s2) return self.check(d1, d2) or self.check(d2, d1) def check(self, d1: dict, d2: dict) -> bool: s = 0 for c in 'abcdefghijklmnopqrstuvwxyz'...

0.411003

n=int(input()) s=input() left=0 right=0 left_ques=0 right_ques=0 for i in range(n): if i<n//2: if s[i]=='?': left_ques+=1 else : left+=int(s[i]) else : if s[i]=='?': right_ques+=1 else : right+=int(s[i]) x=min(left_ques,right_ques) ...

0.409056

s = input() n = int(input()) a = [input() for i in range(n)] for i in range(n): for j in range(n): if a[i] == s or a[i][1] + a[j][0] == s: print("YES") return print("NO")

0.408604

def prime_string(s): return (s + s).find(s, 1) == len(s)

0.406931

n, m = list(map(int, input().split())) a = [-1] * m b = [] f = True for i in range(n): s = input() q = set() for j in range(len(s)): if (s[j] == "#"): q.add(j) for j in range(len(s)): if (s[j] == "#"): if (a[j] == -1): a[j] = i else: ...

0.406723

I=input;a,b=I(),I();print("YNEOS"[len(a)!=len(b)or"1"in set(a)^set(b)::2])

0.4065

import re def buy_newspaper(s1, s2): p = re.sub(r"(.)", r"\1?", s1) return -1 if set(s2) - set(s1) else len(re.findall(p, s2)) - 1

0.404786

def string_constructing(a, s): if len(s) == 0: return 0 i = -1 for j, c in enumerate(s): i = a.find(c, i+1) if i < 0 or i == len(a) - 1: break return len(a) - j + (i < 0) + string_constructing(a, s[j + (i >= 0):])

0.404628

import re def string_parse(string): return re.sub(r'(.)\1(\1+)', r'\1\1[\2]', string) if isinstance(string, str) else 'Please enter a valid string'

0.404522

''' \"aabcaca\" 0123456 x devide conquer 先找到第一个stamp把string分成左右两部分（必须要）（On 然后从长到短用stamp的头match左边的部分，直到match到最头如果不能到最头则退出从长到短用stamp的尾巴match右边，直到match到尾巴，如果不能match到最尾巴则继续找下一个stamp 能把他分成左右这时的左边有个offset了，比如****b** offset是3，只要stamp的长度不超过头且能match上，就可以这个解法可以有nwin*M^2 其中m平方是在用stamp去match的时候最坏能从stamp最长match到1 可以给出最短...

0.404377

class Solution: def wordBreak(self, s, wordDict): n = len(s) dp = [False for i in range(n+1)] dp[0] = True for i in range(1,n+1): for w in wordDict: if dp[i-len(w)] and s[i-len(w):i]==w: dp[i]=True return dp[-1]

0.403855

import re; def check_password(s): if re.search('^(?=.*?[a-z])(?=.*?[A-Z])(?=.*?\d)(?=.*?[!@#$%^&*?])[a-zA-Z\d!@#$%^&*?]{8,20}$', s) : return 'valid' else: return 'not valid'

0.403815

def solve(st): return all(True if ord(x) - ord(y) in [-2, 0, 2] else False for x, y in zip(st, st[::-1]))

0.40375

class Solution: def hasAllCodes(self, s: str, k: int) -> bool: if len(s) < 2 ** k + k - 1: return False # Cannot be a string, as this is the de brujin length target = 2 ** k seen = set() cur_len = 0 for end in range(k, len(s) + 1): chunk = s[end - k: e...

0.402333

class Solution: def isLongPressedName(self, name: str, typed: str) -> bool: name=list(name) typed= list(typed) while name: i, j=0,0 n=name[0] while name and name[0]==n: i+=1 name.pop(0) while typed and t...

0.401465

class Solution: def queryString(self, S: str, N: int) -> bool: for i in range(1,N+1): b = bin(i).replace('0b','') if b not in S: return False return True

0.401422

class Solution: def validPalindrome(self, s): """ :type s: str :rtype: bool """ if s == s[::-1]: return True r = s[::-1] for i in range(0, len(s)): if r[i] == s[i]: continue else: ...

0.39996

class Solution: def isNumber(self, s): """ :type s: str :rtype: bool """ dot = False exp = False try: while s.startswith(' '): s = s[1:] while s.endswith(' '): s = s[:-1] ...

0.399466

def simplify(p): new_p=[(0,0)] new_str='' x=0 y=0 for i in p: if i == '<': x-=1 elif i == '>': x+=1 elif i == '^': y+=1 elif i == 'v': y-=1 if (x,y) not in new_p: new_p.append((x,y)) new_s...

0.399363

from math import gcd import sys input=lambda : sys.stdin.readline().strip() c=lambda x: 10**9 if(x=="?") else int(x) def main(): for _ in range(int(input())): s=list(input())[::-1] l=['F','E','H','C'] i=0 while(i<len(s)): if(i+3<len(s)): f=True for j in range(i,i+4): if(l[j-i]==s[j] or s[j]=='?...

0.39936

def prefix1(a, b): cnt = 0 for i, j in zip(a, b): if i == j: cnt += 1 else: return cnt return cnt def prefix2(a, b, num): for i in range(num, -1, -1): if b.startswith(a[:i]): return i def zfunc(str_): z = [] k = len(str_) for i ...

0.399275

from collections import Counter from functools import reduce from fractions import gcd def has_subpattern(s): c = Counter(s) m = reduce(gcd, c.values()) return ''.join(sorted(k*(v//m) for k,v in c.items()))

0.399125

class Solution: def isInterleave(self, s1, s2, s3): """ :type s1: str :type s2: str :type s3: str :rtype: bool """ if len(s3) != len(s1) + len(s2): return False if not s1 or not s2: return (s1 or s2) == s3 op...

0.398971

def main(): S = str(input()) ans = [0] * 13 ans[0] = 1 MOD = 10**9 + 7 for i in S: dp = [0] * 13 for j in range(13): dp[(j * 10) % 13] = ans[j] % MOD dp += dp if i == '?': for j in range(13): ans[j] = sum(dp[j+4:j+14]) else: for j in...

0.398403

import sys def main(): s = sys.stdin.readline save = {' ': '%20', '!': '%21', '$': '%24', '%': '%25', '(': '%28', ')': '%29', '*': '%2a'} string = s().strip() while True: output = [] if '#' in string: return for i in string: if i in save: o...

0.397136

import re def is_alt(s): return not re.search('[aeiou]{2}|[^aeiou]{2}',s)

0.396249

def sub(a, s): pa = 0 ps = 0 while pa < len(a) and ps < len(s): if a[pa] == s[ps]: ps += 1 pa += 1 else: pa += 1 return ps == len(s) def subword(t, ord_ar, n): t_copy = [] for i in range(len(ord_ar)): if ord_ar[i] >= n: t_...

0.395829

#!/usr/bin/env python3 def __starting_point(): x, k = map(int, input().strip().split()) string = input().strip() if eval(string) == k: print(True) else: print(False) __starting_point()

0.395548

def convertToParitys(s): """ This converts the string s to an int, which is a bitMap of the parity of each letter odd ? = first bit set odd a = second bit set odd b = third bit set etc """ keys = '?abcdefghijklmnopqrstuvwxyz' paritys = {c:0 for c in keys} for c in s: ...

0.395293

class Solution: def findAndReplacePattern(self, words: List[str], pattern: str) -> List[str]: out = [] for word in words: pat_dict = dict() used = set() if len(word) == len(pattern): can_be = True for i in range(len(word)): ...

0.395204

#写経 #https://atcoder.jp/contests/abc167/submissions/13072107 import sys readline = sys.stdin.readline def resolve(): N = int(readline()) S = [readline().strip() for i in range(N)] L,R = [],[] D = [] for s in S: l, r = 0, 0 for c in s: if c == ')': if l > ...

0.394591

def solve(s, t, i, l): if i == l: return False if s[i] == "?": if solve(s, t, i + 1, l): s[i] = t[i] return True elif t[i] == "9": return False s[i] = nxt[t[i]] for j in range(i, l): if s[j] == "?": s[j] = "0...

0.394548

for _ in range(int(input())): length = int(input()) S = input() R = input() if S.count("1") == R.count("1"): print("YES") else: print("NO")

0.394435

n, q = map(int, input().split()) s = '!' + input() nxt = [[n + 1] * (n + 2) for _ in range(26)] for i in range(n - 1, -1, -1): c = ord(s[i + 1]) - 97 for j in range(26): nxt[j][i] = nxt[j][i + 1] nxt[c][i] = i + 1 w = [[-1], [-1], [-1]] idx = lambda i, j, k: i * 65536 + j * 256 + k dp = [0] * (256...

0.394221

class Solution: def decodeString(self, s): """ :type s: str :rtype: str """ stack = [] stack.append(["", 1]) num = "" for ch in s: if ch.isdigit(): num += ch elif ch == '[': stack.appen...

0.394154

class Solution: def parseBoolExpr(self, expression: str) -> bool: if expression == 'f': return False if expression == 't': return True if expression[0] == '!': return not self.parseBoolExpr(expression[2:-1]) if expression[0] == '|': cur...

0.393247

def scramble(s1,s2): for c in set(s2): if s1.count(c) < s2.count(c): return False return True

0.390931

import re p = input().strip() range_check = bool(re.match(r'^[1-9][0-9]{5}$',p)) repeat_check = len(re.findall(r'(?=([0-9])[0-9]\1)',p)) print((range_check == True and repeat_check<2))

0.390802

def countzero(s): return sum(1 if c in 'abdegopq069DOPQR' else 2 if c in '%&B8' else 0 for c in s.replace('()', '0'))

0.389265

Strings A and B are K-similar (for some non-negative integer K) if we can swap the positions of two letters in A exactly K times so that the resulting string equals B. Given two anagrams A and B, return the smallest K for which A and B are K-similar. Example 1: Input: A = "ab", B = "ba" Output: 1 Example 2: Input: A ...

class Solution: def kSimilarity(self, A: str, B: str) -> int: a = '' b = '' for i in range(len(A)): if A[i] != B[i]: a+=A[i] b+=B[i] return self.dfs(a,b) def dfs(self,a,b): if not a: ...

0.782128

def levenshtein(a,b): d = [[0] * (len(b) + 1) for _ in range(len(a) + 1)] d[0][:] = list(range(len(b)+1)) for i in range(1, len(a) + 1): d[i][0] = i for i, x in enumerate(a): for j, y in enumerate(b): d[i+1][j+1] = min(1 + d[i][j+1], 1 + d[i+1][j], d[i][j] + (1 if x != y el...

0.7094

class Solution: def findLength(self, A, B): def check(length): seen = {A[i:i+length] for i in range(len(A) - length + 1)} return any(B[j:j+length] in seen for j in range(len(B) - length + 1)) A = ''.join(map(chr, A)) ...

0.70814

from collections import Counter def solve(a,b): return 0 if Counter(b) - Counter(a) else len(a) - len(b)

0.65779

def shift_left(a, b): r = len(a) + len(b) for i in range(-1, -min(len(a), len(b)) - 1, -1): if a[i] != b[i]: break r -= 2 return r

0.649936

from collections import Counter def create_anagram(s, t): return sum((Counter(s) - Counter(t)).values())

0.640625

class Solution: def longestCommonSubsequence(self, a: str, b: str) -> int: last, current = [0] * (len(b) + 1), [0] * (len(b) + 1) for i in range(len(a) - 1, -1, -1): for j in range(len(b) - 1, -1, -1): if a[i] == b[j]: current[j] = 1 + last[j ...

0.638089

# AC import sys sys.setrecursionlimit(1000000) class Main: def __init__(self): self.buff = None self.index = 0 def __next__(self): if self.buff is None or self.index == len(self.buff): self.buff = self.next_line() self.index = 0 val = self.buff[self.ind...

0.634413

class Solution: def minSwap(self, A: List[int], B: List[int]) -> int: n = len(A) if n == 1: return 0 dp = [[float('inf'), float('inf')] for _ in range(n)] dp[0] = [0,1] #[natural, swapped] for i in range(1, n): if A[...

0.629026

def solve(a, b): if len(a) is 1: return b.count(a) index = [x for x in range(len(b)-1) if b[x] is a[0]] return sum(solve(a[1:], b[x+1:]) for x in index)

0.628966

def folding(a,b): squares = 1 while a != b: squares += 1 b, a = sorted((a - b, b)) return squares

0.628413

def prefix1(a, b): cnt = 0 for i, j in zip(a, b): if i == j: cnt += 1 else: return cnt return cnt def prefix2(a, b, num): for i in range(num, -1, -1): if b.startswith(a[:i]): return i def zfunc(str_): z = [] k = len(str_) for i ...

0.628401

import re def buy_newspaper(s1, s2): p = re.sub(r"(.)", r"\1?", s1) return -1 if set(s2) - set(s1) else len(re.findall(p, s2)) - 1

0.627151

class Solution: def maxUncrossedLines(self, A, B): # Optimization #commons = set(A).intersection(set(B)) # or commons = set(A) & set(B) #A = [x for x in A if x in commons] #B = [x for x in B if x in commons] N1, N2 = len(A), len(B) dp = [[0 for _ in range(N2+1)] for ...

0.625968

class Solution: def minSteps(self, s: str, t: str) -> int: s_count=[s.count(chr(i)) for i in range(97,123)] t_count=[t.count(chr(i)) for i in range(97,123)] diff=[t_count[i]-s_count[i] for i in range(26) if t_count[i]-s_count[i]>0] sum=0 for i in range(len(diff)): ...

0.622423

def hamming_distance(a, b): return sum(c != d for c, d in zip(a, b))

0.617189

def ii(): return int(input()) def mi(): return list(map(int, input().split())) def li(): return list(mi()) # B. The Fair Nut and Strings n, k = mi() s = input().strip() t = input().strip() ans = 0 jj = 0 for i in range(n): if s[i] == t[i]: ans += 1 jj = i + 1 else: break c...

0.609706

from collections import defaultdict as dd def find(a, b): n = len(a) m = len(b) dp = [[0]*(m+1) for i in range(n+1)] for i in range(n-1,-1, -1): for j in range(m-1, -1, -1): if a[i] == b[j]: dp[i][j] = dp[i+1][j+1] + 1 mx = dd(int) ans = 0 for i in range(n-1, -1, -1): for j in range(m-1, -1, -1): ...

0.607176

def main(): a = str(input()) b = str(input()) print(a.count(b)) def __starting_point(): main() __starting_point()

0.606128

for _ in range(eval(input())): S1=input() m1=len(S1)/2 S2=input() m2=len(S2)/2 d1={} d2={} for i in range(len(S1)): c=S1[i] v=abs(m1-i) if c in d1: if v<d1[c][0]: d1[c]=[v,i] else: d1[c]=[v,i] for i in range(len(S2)...

0.605516

from collections import Counter def solve(A,B): a = Counter(A) b = Counter(B) ans = 0 for i in a: if i in b: ans += min(a[i],b[i]) return ans t = int(input()) for _ in range(t): A = input() B = input() print(solve(A,B))

0.594288

class Solution: def numDistinct(self, s, t): """ :type s: str :type t: str :rtype: int """ setOft=set(t) news="" for ch in s: if ch in setOft: news+=ch dp=[[1 for i in range(len(news)+1)] for j in range(l...

0.593097

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): print(*args, **kwargs, file=sys.stderr) dprint('debug mode') except ...

0.592223

#scott http://codeforces.com/problemset/problem/265/A new problem RO = input() # darn i don't know how to read string ins = input() #scott n = 0 for x in range (len(ins)): #scott yeah that looks fine #print (x) if ins[x] == RO[n]: n += 1 #scott print(n+1)

0.591586

class Solution: def getHint(self, secret, guess): """ :type secret: str :type guess: str :rtype: str """ s_count = collections.defaultdict(int) g_count = collections.defaultdict(int) bull_cnt = 0 # first iteration can get bull_cnt imm...

0.588157

class Solution: def repeatedStringMatch(self, A, B): """ :type A: str :type B: str :rtype: int """ if not set(B).issubset(set(A)): return -1 max_rep = len(B) // len(A) + 3 A_new = A for i in ...

0.586626

class Solution: def equalSubstring(self, s: str, t: str, maxCost: int) -> int: dist = [ abs( ord(s[i]) - ord(t[i]) ) for i in range(len(s))] # i = 0 # cur = 0 # res = 0 # for j in range(len(s)): # cur += dist[j] # while cur>maxCost: # ...

0.583638

s = list(input()) t = list(input()) cnt = 0 for i in range(3): if s[i] == t[i]: cnt += 1 print(cnt)

0.580713

class Solution: def buddyStrings(self, A: str, B: str) -> bool: if len(A)!=len(B): return False if len(A)<2: return False if A==B: cnt = Counter(A) return bool([v for v in cnt.values() if v>1]) diffs = [] for i, a in enumerate(A...

0.57654

class Solution: def findLUSlength(self, a, b): """ :type a: str :type b: str :rtype: int """ return max(len(a),len(b)) if a != b else -1

0.574962

def hamming_distance(a, b): return bin(a ^ b).count('1')

0.574563

n = int(input()) for i in range(n): count = 0 k = input() x = list(k) kk = input() y = list(kk) for j in y: for jj in x: if(j==jj): count = count+1 break print(count)

0.572966

def string_cnt(s): try: if s.isalpha(): return sum(ord(a) for a in s.upper()) except AttributeError: pass return 0 def compare(s1, s2): return string_cnt(s1) == string_cnt(s2)

0.572188

class Solution: def flipgame(self, fronts: List[int], backs: List[int]) -> int: w = set(fronts[i] for i in range(len(fronts)) if fronts[i] == backs[i]) x = set() for a in fronts: if a not in w: x.add(a) for a in backs: if a not in w: ...

0.572179

def check(w, s): j = 0 for i in range(len(s)): while j < len(w) and s[i] != w[j]: j += 1 if j >= len(w) or s[i] != w[j]: return False j += 1 return True n = int(input()) s = input() t = input() st = [] i = 0 while i < n and s[i] == t[i]: st.append(s[i]) ...

0.567998

from collections import Counter class Solution: def checkIfCanBreak(self, s1: str, s2: str) -> bool: d1, d2 = Counter(s1), Counter(s2) return self.check(d1, d2) or self.check(d2, d1) def check(self, d1: dict, d2: dict) -> bool: s = 0 for c in 'abcdefghijklmnopqrstuvwxyz'...

0.566213

class Solution: def minDeletionSize(self, A: List[str]) -> int: dp = [(1, 1)] * len(A[0]) for i in range(len(dp)): if i > 0: max_pre = None for pre in range(i - 1, -1, -1): for word in A: if word[pre] > word[i]: ...

0.5632

class Solution: def getMaxRepetitions(self, s1, n1, s2, n2): """ :type s1: str :type n1: int :type s2: str :type n2: int :rtype: int """ if s2=='aac' and n2==100: return 29999 i,j=0,0 l1=len(s1) l2=len(s...

0.561871

class Solution: def hammingDistance(self, x, y): """ :type x: int :type y: int :rtype: int """ x = x ^ y y = 0 while (x): y += 1 x &= x-1 return y

0.561283

for t in range(int(input())): s = input() r = input() diff = list() index = list() cnt = 0 for i in range(len(s)): if s[i] != r[i]: cnt += 1 index.append(i) for i in range(1, len(index)): diff.append(index[i] - index[i - 1] - 1) diff.sort() fmin = cnt ** 2 oper = cnt ; moves = cnt for i in diff: ...

0.560411

s = input()[::-1] t = input()[::-1] i = 0 while i < min(len(s),len(t)) and s[i] == t[i]: i += 1 print(len(s) - i + len(t) - i)

0.559713

class Solution: def ladderLength(self, beginWord, endWord, wordList): wordDict = set(wordList) if not endWord in wordDict: return 0 visited = set() beginSet = set() beginSet.add(beginWord) visited.add(beginWord) endSet = set() ...

0.559424

# cook your dish here try: a,b,da=list(input()),input(),list(map(int,input().split())) print(len(a)-len(b)) except: pass

0.559197

class Solution: def canConvertString(self, s: str, t: str, k: int) -> bool: if len(s) != len(t): return False c = Counter((ord(c2) - ord(c1)) % 26 for c1, c2 in zip(s, t)) return k >= max( (m + 26 * (count - 1) for m, count in list(c.items()) if m), ...

0.556706

# Enter your code here. Read input from STDIN. Print output to STDOUT s=input() ss=input() cnt=0 len_s=len(s) len_ss=len(ss) for i in range(0,len_s): tmp=s[i:i+len_ss] if(tmp==ss): cnt=cnt+1 print(cnt)

0.554591

def shortest_to_char(s, c): if not s or not c: return [] indexes = [i for i, ch in enumerate(s) if ch == c] if not indexes: return [] return [ min(abs(i - ic) for ic in indexes) for i in range(len(s)) ]

0.552811

def count_correct_characters(c, g): if len(c) != len(g): raise Exception('Error') return sum(1 for i,j in zip(c,g) if i==j)

0.552734

s = input() t = input() m = 1000 for i in range(len(s) - len(t) + 1): c = 0 for j in range(len(t)): if s[i + j] != t[j]: c += 1 m = min(m, c) print(m)

0.552163

from collections import Counter def added_char(s1, s2): return next((Counter(s2) - Counter(s1)).elements())

0.548686

from math import ceil n = int(input()) word1 = input() word2 = input() combined = [] for i in range(ceil(n / 2)): if i > n / 2 - 1: combined.append([word1[i], word2[i]]) else: combined.append([word1[i], word1[- i - 1], word2[i], word2[- i - 1]]) count = 0 for l in combined: s = set(l) ...

0.546659

s = input() pole = input() t = 0 count = 0 for i in range(len(pole)): if pole[i] == s[t]: t += 1 if t == len(s): break count += 1 t -= 1 for i in range(len(pole) - 1, -1, -1): if pole[i] == s[t]: t -= 1 if t == -1: count1 = i break if count1 - count > 0: p...

0.542104

def solve(a,b): return [a.count(e) for e in b]

0.539667

S = input() T = input() tigau = 0 for i in range(len(S)): if S[i] != T[i]: tigau += 1 print(tigau)

0.53894

def similarity(a, b): try: return len(set(a) & set(b)) / len(set(a) | set(b)) except: return 0

0.537492

class Solution: def isIsomorphic(self, s1, s2): return len(set(zip(s1, s2))) == len(set(s1)) == len(set(s2))

0.536948

def count_subsequences(needle, haystack): count = [1] + [0] * len(needle) for a in haystack: count = [1] + [count[i] + count[i-1] * (a == b) for i, b in enumerate(needle, 1)] return count[-1] % 10 ** 8

0.536232

class Solution: def isScramble(self, A, B): if len(A) != len(B) or sorted(A) != sorted(B): return False if len(A) == 1 or A == B: return True for i in range(1, len(A)): if self.isScramble(A[:i], B[:i]) and self.isScramble(A[i:], B[i:]): ...

0.53601

def string_constructing(a, s): if len(s) == 0: return 0 i = -1 for j, c in enumerate(s): i = a.find(c, i+1) if i < 0 or i == len(a) - 1: break return len(a) - j + (i < 0) + string_constructing(a, s[j + (i >= 0):])

0.535774

from functools import lru_cache def failure(pat): i, target, n = 1, 0, len(pat) res = [0] while i < n: if pat[i] == pat[target]: target += 1 res.append(target) i+=1 elif target: target = res[target-1] else: res.append(0) ...

0.53441

def shifted_diff(first, second): return (second + second).find(first) if len(first) == len(second) else - 1;

0.53299

def scramble(s1,s2): for c in set(s2): if s1.count(c) < s2.count(c): return False return True

0.532714

class Solution: def findMinStep(self, board, hand): """ :type board: str :type hand: str :rtype: int """ res=float("inf") hmap=collections.defaultdict(int) for c in hand: hmap[c]+=1 res=self.helper(board,hmap) if...

0.532231

# import sys # sys.stdin = open('in.txt', 'r') _ = input() s = input() t = input() par = [i for i in range(26)] def find(x): if par[x] != x: par[x] = find(par[x]) return par[x] else: return x for i in range(len(s)): a, b = find(ord(s[i])-97), find(ord(t[i])-97) if a != b: ...

0.531713

class Solution: def minimumSwap(self, s1: str, s2: str) -> int: xy_pair = 0 yx_pair = 0 for c1, c2 in zip(s1, s2): if c1 == 'x' and c2 == 'y': xy_pair += 1 elif c1 == 'y' and c2 == 'x': yx_pair += 1 if (xy_pair...

0.531326

import sys input = sys.stdin.readline s = input() t = input() l, r = [0]*len(t), [0]*len(t) li, ri = 0, len(s) - 1 for i in range(len(t)): while s[ li ] != t[ i ]: li += 1 while s[ ri ] != t[ - i - 1 ]: ri -= 1 l[ i ] = li r[ -i -1 ] = ri li += 1 ri -= 1 print( max( [ r[ 0 ], le...

0.531188

s = input() t = input() l, r = [0]*len(t), [0]*len(t) li, ri = 0, len(s) - 1 for i in range(len(t)): while s[ li ] != t[ i ]: li += 1 while s[ ri ] != t[ - i - 1 ]: ri -= 1 l[ i ] = li r[ -i -1 ] = ri li += 1 ri -= 1 print( max( [ r[ 0 ], len(s) - l[ -1 ] - 1 ] + [ max( 0, r[ i ...

0.530846

class Solution: def findTheDifference(self, s, t): """ :type s: str :type t: str :rtype: str """ sums=sum([ord(i) for i in s]), sum([ord(i) for i in t]) return chr(sum([ord(i) for i in t])-sum([ord(i) for i in s]))

0.524858

class Solution: def minDeletionSize(self, A: List[str]) -> int: return sum([list(col) != sorted(col) for col in zip(*A)])

0.523239

#!/usr/bin/env python3 a = input() b = input() sumi = 0 for i in range(len(b) - len(a) + 1): if b[i] == '1': sumi += 1 lowest = 0 highest = len(b) - len(a) + 1 total = 0 for i in range(len(a)): if a[i] == '0': total += sumi else: total += highest - lowest - sumi if b[lowest]...

0.522941

def solve(a,b): s = set(a)&set(b) return ''.join(c for c in a+b if c not in s)

0.5224

def upc(c): if c >= 'a' and c <= 'z': c = chr(ord(c) - ord('a') + ord('A')) return c a1, a2 = {}, {} for i in input(): if i in a1: a1[i] += 1 else: a1[i] = 1 for i in input(): if i in a2: a2[i] += 1 else: a2[i] = 1 r1, r2 = 0, 0 a3, a4 = {}, {} for k in a1...

0.521557

import sys def input(): return sys.stdin.readline()[:-1] from bisect import bisect def ctoi(c): return ord(c) - ord("a") print(ans) T = int(input()) for _ in range(T): s = input() t = input() if not (set(s) >= set(t)): print(-1) else: alph = [[] for _ in range(26)] for i in range(len(s)): alph[ctoi(s[...

0.521084

class Solution: def isAnagram(self, s, t): """ :type s: str :type t: str :rtype: bool """ # dic = {} # for item in s: # if item not in dic: # dic[item] = 1 # else: # dic[item] += 1 # ...

0.519535

s=input() dp=[[0,0,0] for i in range(len(s))] for i in range(len(s)): if s[i]=='a': dp[i][0]=dp[i-1][0]+1 dp[i][1]=dp[i-1][1] dp[i][2]=max(dp[i-1][1]+1,dp[i-1][2]+1) else: dp[i][0]=dp[i-1][0] dp[i][1]=max(dp[i-1][0]+1,dp[i-1][1]+1) dp[i][2]=dp[i-1][2] e=len(s)-1 p...

0.517348

n = int(input()) s = input() code = input() res = 0 for i in range(n): k = abs(int(s[i]) - int(code[i])) res += min(k, 10 - k) print(res)

0.516842

def maxlen(s1, s2): sm, lg = sorted((s1, s2)) return min(max(lg / 3, sm), lg / 2)

0.516612

def greek_comparator(lhs, rhs): greek_alphabet = [ 'alpha', 'beta', 'gamma', 'delta', 'epsilon', 'zeta', 'eta', 'theta', 'iota', 'kappa', 'lambda', 'mu', 'nu', 'xi', 'omicron', 'pi', 'rho', 'sigma', 'tau', 'upsilon', 'phi', 'chi', 'psi', 'omega'] l = len(greek_alphabet) k = 0...

0.514695

k = int(input()) a = reversed(input()) b = reversed(input()) aa = [0] * (k + 1) bb = [0] * (k + 1) for i, x in enumerate(a): aa[i] = ord(x) - 97 for i, x in enumerate(b): bb[i] = ord(x) - 97 carry = 0 cc = [0] * (k + 1) for i in range(k + 1): cc[i] = aa[i] + bb[i] + carry if cc[i] >= 26: carry...

0.514641

class Solution: def findSubstringInWraproundString(self, p): """ :type p: str :rtype: int """ pc = None sl = 0 ll = {} for c in p: if pc and (ord(pc) + 1 == ord(c) or (pc == 'z' and c == 'a')): sl += 1 ...

0.51326

def combs(a, b): return min(mesh(a, b), mesh(b, a)) def mesh(a, b): for i in range(len(a)): for j, k in zip(a[i:], b): if j + k == '**': break else: return max(i + len(b), len(a)) return len(a) + len(b)

0.51295

class Solution: def minDeletionSize(self, A: List[str]) -> int: def isSorted(arr, i, j): return all(arr[k] <= arr[k+1] for k in range(i, j)) ans = 0 ranges = [[0, len(A)-1]] for col in zip(*A): if not ranges: break if all(isSorted(c...

0.51283

def num(c): return ord(c) - 97 import sys input = sys.stdin.readline t = int(input()) for _ in range(t): n = int(input()) s1 = input().strip() s2 = input().strip() char1 = [0] * 26 char2 = [0] * 26 for c in s1: char1[num(c)] += 1 for c in s2: char2[num(c)] += 1 if ...

0.512826

def spot_diff(s1, s2): return [i for i in range(len(s1)) if s1[i] != s2[i]]

0.510903

from collections import deque moves = ((1, 2), (1, -2), (-1, 2), (-1, -2), (2, 1), (2, -1), (-2, 1), (-2, -1)) def knight(p1, p2): x, y = ord(p2[0])-97, int(p2[1])-1 left, seen = deque([(ord(p1[0])-97, int(p1[1])-1, 0)]), set() while left: i, j, v = left.popleft() if i==x and j==y: return v...

0.510803

class Solution: def numSpecialEquivGroups(self, A: List[str]) -> int: return len(set(''.join(sorted(s[0::2])) + ''.join(sorted(s[1::2])) for s in A))

0.510702

def are_similar(a, b): return sorted(a) == sorted(b) and sum(i != j for i, j in zip(a, b)) in [0, 2]

0.510513

class Solution: def maxLength(self, arr: List[str]) -> int: def digit_representation(s): ans = 0 for c in s: ans |= 1<<(ord(c)-ord('a')) return ans A = sorted([(len(s), digit_representation(s)) for s in set(arr) if len(set(s))==len(s)], re...

0.510304

n = input().rstrip() m = input().rstrip() cnt1 = [0] * 26 cnt2 = [0] * 26 for i in n: cnt1[ord(i) - ord("a")] += 1 for i in m: cnt2[ord(i) - ord("a")] += 1 res = 0 for i in range(26): a1 = cnt1[i] a2 = cnt2[i] if a1 == 0 and a2 != 0: print(-1) return res += min(a1, a2) print(res)

0.510078

class Solution: def checkInclusion(self, s1, s2): """ :type s1: str :type s2: str :rtype: bool """ if len(s2) < len(s1): return False c1 = [0] * 128 n = 0 for i in s1: c = ord(i) if c1[c] == 0: n...

0.509248

# class Solution: # def distinctEchoSubstrings(self, text: str) -> int: # ans = set() # for i in range(len(text)-1): # for j in range(i+1, (i+len(text))//2+1): # if text[i:j] == text[j:2*j-i]: ans.add(text[i:j]) # return len(ans) from collectio...

0.509044

def find_the_key(message, code): diffs = "".join( str(c - ord(m) + 96) for c, m in zip(code, message) ) for size in range(1, len(code) +1): key = diffs[:size] if (key * len(code))[:len(code)] == diffs: return int(key)

0.508669

from collections import * def go(): n,s,t=int(input()),input(),input() if Counter(s)!=Counter(t): return -1 ans=0 for i in range(n): k=0 for j in range(i,n): while k<n and s[k] != t[j]: k += 1 if k == n: break k += 1 ans = max(ans, j-i+1) return n-ans for _ in range(int(input())): print(go())

0.508605

import sys def joseph(k, n=6): if k==0: k = 1 x = 0 for i in range(2,n+1): x = (x+k)%i return x FLAMES = ['FRIENDS', 'LOVE', 'ADORE', 'MARRIAGE', 'ENEMIES', 'SISTER'] nCase = int(sys.stdin.readline()) for _ in range(nCase): a = ''.join(sys.stdin.readline().split()) b = ''.join(sys.stdin.readline().split())...

0.508324

def lcs(x, y): if len(x) == 0 or len(y) == 0: return '' if x[-1] == y[-1]: return lcs(x[:-1], y[:-1]) + x[-1] else: lcs1 = lcs(x,y[:-1]) lcs2 = lcs(x[:-1],y) if len(lcs1) > len(lcs2): return lcs1 else: return lcs2

0.508282

S = input() T = input() base = 998244353 dp = [[0 for _ in range(len(S) + 1)] for _ in range(len(S) + 1)] for j in range(1, len(S) + 1): if (j > len(T)) or (S[0] == T[j - 1]): dp[1][j] = 2 for i in range(2, len(S) + 1): for j in range(1, len(S) - i + 1 + 1): if (j > len(T)) or (S[i - 1] == T[j -...

0.507992

class Solution: def characterReplacement(self, s, k): """ :type s: str :type k: int :rtype: int """ if s == "": return 0 count = {} lo = 0 hi = 0 max_letter = 0 for hi in range(len(s)): try:...

0.505653

import sys SIGMA = 26 nodes = [] pairs = [] res = 0 class Node: def __init__(self): self.ch = {} self.a = [] self.b = [] self.d = 0 def add(self, s, i): t = self for c in s: v = ord(c) - ord('a') if not v in t.ch: t.ch[v...

0.505626

match = 0 nonmatch = 0 count = 0 def calc_match(s, t, p): nonlocal match nonlocal nonmatch nonlocal count if p == len(s)-len(t): return if p+len(t) < len(s): if s[p+len(t)] == '?': count -= 1 elif s[p+len(t)] == t[-1]: match -= 1 else: nonmatch -= 1 match, nonmatch = nonma...

0.505591

import sys from math import * def minp(): return sys.stdin.readline().strip() def mint(): return int(minp()) def mints(): return map(int, minp().split()) def add(a,b): return (a+b)%1000000007 def sub(a,b): return (a+1000000007-b)%1000000007 def mul(a,b): return (a*b)%1000000007 p = 102367 s = list(map(int,...

0.505423

from itertools import combinations def strings_crossover(arr, result): return sum(1 for s1,s2 in combinations(arr,2) if all(r in (x,y) for x,y,r in zip(s1,s2,result)))

0.50479

def is_substitution_cipher(s1, s2): return len(set(s1)) == len(set(s2)) == len(set(zip(s1, s2)))

0.504571

Given an integer array nums and an integer k, return the maximum sum of a non-empty subsequence of that array such that for every two consecutive integers in the subsequence, nums[i] and nums[j], where i < j, the condition j - i <= k is satisfied. A subsequence of an array is obtained by deleting some number of element...

from collections import deque class Solution: def constrainedSubsetSum(self, nums, k): N, queue = len(nums), deque() dp = [val for val in nums] for i, val in enumerate(nums): if queue and (i - queue[0] > k): queue.popleft() if queue and dp[queue[0]] > ...

0.815954

class Solution: def maxSumAfterPartitioning(self, arr, k): res = [0] for idx, val in enumerate(arr): max_val, cur_val = 0, 0 for i in range(max(0, idx-k+1), idx+1)[::-1]: if arr[i] > max_val: max_val =...

0.813782

try: n, k=map(int, input().split()) arr=list(map(int, input().split())) forward = [0]*(n+1) backward= [0]*(n+1) backward[0]=arr[0] backward[1]=arr[0]+arr[1] for i in range(k, n): forward[i]=arr[i] +max(forward[i-1],forward[i-2]) for i in range(2, n): backward[i]=arr[i]+max(bac...

0.778513

try: n,k = map(int,input().split()) x = [int(input()) for _ in range(n)] k = k//2 dp = [0]*(k+1) for i in range(k+1): dp[i] = [0]*n #print(dp) for i in range(1,k+1): #print("*",dp[i-1][0]) diff = (-1)*x[0] for j in range(1,n): diff = max(dp[i-1][j]-x[j],diff) dp[i][j] = max(dp[i][j-1],diff+x[j]) ...

0.753374

n, k = map(int, input().split()) v = list(map(int, input().split())) reverse_v = v[::-1] lst = [0] * (k + 1) left = [[]] right = [[]] for i in range(1, n+1): left.append(v[:i]) right.append(reverse_v[:i]) for cnt in range(1, k+1): rest = k - cnt total = 0 if cnt <= n: for j in range(cnt+1): lst_j =...

0.733893

class Solution: def maxScore(self, cardPoints: List[int], k: int) -> int: max_score = 0 curr_score= 0 init_hand = cardPoints[len(cardPoints)-k:] max_score = sum(init_hand) curr_score = max_score for i in range(k): curr_score -= init_hand[i] cur...

0.731982

class Solution: def largestSumAfterKNegations(self, A: List[int], K: int) -> int: A.sort() i = 0 while A[i] < 0 and K > 0: A[i] *= -1 i += 1 K -= 1 if K % 2 == 1 and 0 not in A: return sum(A) - 2*min(A) ret...

0.722303

class Solution: def maxSubArray(self, nums): """ :type nums: List[int] :rtype: int """ # i = 0 # i_keep = 0 # j = 1 # j_keep = 1 # max_sum = nums[0]-1 # while j < len(nums) and i < j: # temp_sum = sum(nums[i:j]) ...

0.716125

class Solution: def maxProfit(self, k, prices): """ :type k: int :type prices: List[int] :rtype: int """ length = len(prices) v = p = 0 pairs, profits = [], [] while p < length: v = p ...

0.713171

n, k = map(int, input().split()) a = list(map(int, input().split())) a = a[::-1] s = [a[0]] S = 0 for x in a[1:]: s.append(s[-1]+x) S += s[-1] s.pop() k -= 1 s = sorted(s) i=0 while i<=k-1: S += s.pop() i += 1 print(S)

0.706712

class Solution: def kConcatenationMaxSum(self, arr: List[int], k: int) -> int: oneArrSum = sum(arr) twoArr = arr + arr def findMaxSub(array): if len(array) == 1: return array[0] cur = 0 small = 0 ret = -999...

0.703749

n, k = list(map(int,input().split())) L = list(map(int,input().split())) i = 0 p = 0 z = 1 R = [0 for _ in range(k)] while i<n: R[p] += L[n-1-i] p = p + z i+=1 if p == k or p == -1: z = z*(-1) if p == k: p = p - 1 else: p = p + 1 print(max(R))

0.697428

def max_sum(arr): # Finds the maximum sum of sub-arrays of arr max_till_now = -1000000 #minimum possible number current_sum = 0 for i in range(len(arr)): if current_sum < 0: # If sum of previous elements is negative, then ignore them. Start fresh # with `current_sum = 0`...

0.697171

def solve(a,l,r,k): out = sorted(a[:l]+a[r:],reverse=True) inside = sorted(a[l:r]) cur = sum(a[l:r]) for i in range(min(k,len(inside),len(out))): if out[i] > inside[i]: cur += out[i]-inside[i] else: break return cur n,k = [int(x) for x in input().split()] a =...

0.692165

class Solution: def getWinner(self, arr: List[int], k: int) -> int: win=0 curr = arr[0] mx=0 for i in range(1,len(arr)): if arr[i] > curr: curr=arr[i] win=0 win=win+1 ...

0.69163

import sys class Solution: def maximumSum(self, arr: List[int]) -> int: ignore=0 not_ignore=0 res=-sys.maxsize for i in arr: if i>=0: ignore+=i not_ignore+=i else: if ignore==0: ignore+=i ...

0.680827

def solve(a,n): max1=curr=a[0] for i in range(1,n): curr=max(a[i],curr+a[i]) max1=max(max1,curr) return max1 n,k = list(map(int,input().split())) a = list(map(int,input().split())) print(sum(a)-solve(a,n)+solve(a,n)/k)

0.678678

class Solution: def smallestRangeII(self, A: List[int], K: int) -> int: if not A: return 0 nums = sorted([num + K for num in set(A)], reverse=True) max_num = nums[0] min_num = nums[-1] changed_max = max_num - 2 * K res = max_num - min_num for i in ...

0.676482

import sys from math import * def minp(): return sys.stdin.readline().strip() def mint(): return int(minp()) def mints(): return map(int, minp().split()) n, k, x = mints() a = list(mints()) d = [None]*(n+1) p = [None]*(n+1) for i in range(0,k): d[i] = a[i] for xx in range(2,x+1): d,p = p,d for nn in range(n):...

0.668866

(n, k) = map(int, input().split()) a = list(map(int, input().split())) a.sort() cur = 0 idx = 0 for i in range(k): ans = 0 while idx < n: ans = a[idx] - cur idx += 1 if ans != 0: break print(ans) cur += ans

0.659154

import numpy as np INF = 10**15 def solve(n, k, h): dp = np.full((n+1, n+1), INF, dtype=int) dp[0, 0] = 0 h = np.array([0] + h, dtype=int) for i, h_i in enumerate(h[1:], 1): t = np.maximum(h_i - h[:i], 0) dp[i,1:] = np.min(dp[:i,:-1]+t[:,None], axis=0) return np.min(dp[:, n-k]) n, k...

0.658648

class Solution: def largestSumOfAverages(self, A: List[int], K: int) -> float: #if not A: return 0 #if len(A)==1: return A[0] # Real Run Time is a little bit UNSTABLE N = len(A) P = [0] * (N+1) for i in range(1,N+1): P[i] = P[i-1] + A[i-1] # Table[a] ...

0.65854

rooms=int(input()) money=list(map(int,input().split())) keys=int(input()) rev=-1 a,b=0,-1 tot=[] #print(money[-3:-1]) x=0 for i in range(keys): #print(money[b:-1],money[0:a]) x=sum(money[b:])+sum(money[0:keys-abs(b)]) tot.append(x) b-=1 print(max(tot))

0.65716

import collections class Solution: def shortestSubarray(self, A: List[int], K: int) -> int: cum_sum = 0 queue = collections.deque([(-1, 0)]) result = len(A) + 1 for i, v in enumerate(A): cum_sum += v if v > 0: # find any matches and remove...

0.654565

n, k = list(map(int, input().split())) a = list(map(int, input().split())) d = list(map(int, input().split())) if k == 0: best = 0 curr = sum(a) for i in range(n): best = max(best, curr - d[i]) curr -= a[i] print(best) elif k == 1: best = sum(a[:-1]) - min(d[:-1]) other = s...

0.654563

def calc(a): res = [0] * (len(a) + 1) for k in range(len(a)): res = [2 * max(a[i] + res[i+1], a[i+k] + res[i]) for i in range(len(a) - k)] return res[0]

0.654009

n = int(input()) k = int(input()) x = list(map(int,input().split())) ans = 0 for i in range(n): ans += 2*min(k-x[i],x[i]) print(ans)

0.653846

import numpy as np n,k = map(int,input().split()) a = np.array(list(map(int,input().split()))) a.sort() posi = a[a>0] zero = a[a==0] nega = a[a<0] def cnt(x): c = 0 if x >= 0: c += len(zero)*n c += np.searchsorted(a, x // posi, side = 'right').sum() c += (n-np.searchsorted(a, (- x - 1) // (-neg...

0.653554

#!usr/bin/env python3 from collections import defaultdict, deque from heapq import heappush, heappop from itertools import permutations, accumulate import sys import math import bisect def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline()) def LS():return [list(x) for ...

0.65125

try: a=list(map(int,input().split())) n=a[0] k=a[1] hi=[] for i in range(n): hi.append(int(input())) hi.sort() diff=[] for i in range(n-k+1): diff.append(hi[i+k-1]-hi[i]) print(min(diff)) except: pass

0.650178

def solve(st, k): length = len(st) - k return max(int(st[i:i + length]) for i in range(k + 1))

0.649105

def largest_sum(arr): sum = max_sum = 0 for n in arr: sum = max(sum + n, 0) max_sum = max(sum, max_sum) return max_sum

0.64843

def maxval(arr): fn = [float('-inf')]*(len(arr)+1) sn = [float('-inf')]*len(arr) tn = [float('-inf')]*(len(arr)-1) fon = [float('-inf')]*(len(arr)-2) for i in reversed(list(range(len(arr)))): fn[i] = max(fn[i + 1], arr[i]) for i in reversed(list(range(len(arr) - 1))): sn[i] = max...

0.646468

import heapq def sum_sqaure(a, k): q, r = divmod(a, k) return q**2 * (k-r) + (q+1)**2 * r def diff(a, k): return sum_sqaure(a, k+1) - sum_sqaure(a, k) n, k = map(int, input().split()) nums = list(map(int, input().split())) curr = sum(sum_sqaure(a, 1) for a in nums) Q = [(diff(a, 1), a, 1) for a in nums]...

0.64639

n, k = list(map(int, input().split())) t = list(map(int, input().split())) d = [0 for _ in range(n)] for _ in range(n): for i in range(n): if i % k != _ % k: d[_] += t[i] print(max(abs(d[_]) for _ in range(n)))

0.644947

class Solution: def maxSubarraySumCircular(self, A: List[int]) -> int: N = len(A) if(N==0): return 0 curr_max = A[0] global_max = A[0] curr_min = A[0] global_min = A[0] flag = 0 if(A[0]>=0): flag=1 for i in range(1...

0.644389

n, k = map(int, input().split()) H = list(map(int, input().split())) H.sort(reverse=True) print(sum(H[k:]))

0.644077

class CustomStack: def __init__(self, maxSize: int): self.stack = [] self.add = [] self.limit = maxSize def push(self, x: int) -> None: if len(self.stack) < self.limit: self.stack.append(x) self.add.append(0) def pop(self) -> int: if len(sel...

0.643655

import sys n_k = [int(x) for x in sys.stdin.readline().split()] k = n_k[1] a = [int(x) for x in sys.stdin.readline().split()] # sum of k smallest numbers a = sorted(a) k_smallest = sum(a[:k]) print(k_smallest)

0.642276

def f(m): nonlocal dp, sdp l = 0 for i in range(n): while l < n and v[l] < v[i] - m: l += 1 if l - 1 > i - k: dp[i] = False else: dp[i] = (sdp[i - k + 1] != sdp[l - 1]) sdp[i + 1] = sdp[i] + (1 if dp[i] else 0) return dp[n - 1] n, k = ...

0.641899

import sys (n, k) = [int(x) for x in sys.stdin.readline().strip().split()] ans = -999999999999999999999999999999999999999999 for i in range(0, n): (f, t) = [int(x) for x in sys.stdin.readline().strip().split()] ans = max(ans, f-max(0,t-k)) print(ans)

0.64158

class Solution: def mergeStones(self, stones: List[int], K: int) -> int: n = len(stones) if (n - 1) % (K - 1) != 0: return -1 prefix = [0] for s in stones: prefix.append(prefix[-1] + s) @lru_cache(None) def dp(i, j): if j - i + 1 < ...

0.641436

import sys input = sys.stdin.readline sys.setrecursionlimit(100000) def getN(): return int(input()) def getList(): return list(map(int, input().split())) import math from bisect import bisect_left n, k = getList() nums = getList() nums.sort() half = (n // 2) + 1 nums = nums[half-1:] sm = sum(nums) def check...

0.641262

class Solution: def deleteAndEarn(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums);#count is a dict [3,4,2]--> {2:1,3:1,4:1} prev = None; avoid = using = 0; for k in sorted(count): temp = ma...

0.640358

class Solution: def minStartValue(self, nums: List[int]) -> int: res = 1 for ind,n in enumerate(nums): temp = 1-sum(nums[:ind+1]) if(temp > res): res = temp return res

0.639243

tmp = list(map(int,input().split())) n,k = tmp[0],tmp[1] a = list(map(int,input().split())) cur = a[0] w = 0 OK = False for i in range(1,10000): op = a[i] if cur > op: a.append(op) w += 1 else: cur = op a.append(cur) w = 1 if w >= k: OK = True bre...

0.637918

import sys input = sys.stdin.readline sys.setrecursionlimit(100000) def getN(): return int(input()) def getList(): return list(map(int, input().split())) import math n, k = getList() nums = getList() diff = [] for i, j in zip(nums, nums[1:]): diff.append(j - i) diff.sort() print(sum(diff[:(n-k)]))

0.636024

N,K=map(int,input().split()) l=list(map(int,input().split())) l.sort(reverse=True) sum=0 for i in range(K) : sum+=l[i] print(sum)

0.635157

n,m,k=map(int,input().split()) b=list(map(int,input().split())) diffs=[] for i in range(n-1): diffs.append(b[i+1]-b[i]) diffs.sort() print(k+sum(diffs[:n-k]))

0.634602

class Solution: def smallestRangeI(self, A: List[int], K: int) -> int: if len(A) == 1: return 0 _min = min(A) _max = max(A) if _max - K <= _min + K: return 0 return _max - _min - 2*K

0.632727

n = int(input()) l = list(map(int,input().split())) curr = 0 best = 0 prevs = [0] * 31 for v in l: curr += v if v >= 0: for i in range(0, v): prevs[i] = curr for i in range(v, 31): best = max(curr - prevs[i] - i, best) else: for i in range(31): pr...

0.632387

# returns answer to the subproblem with interval range [start, end], # but with a total of "extra" additional stuff on the end # that must be deleted last. memo = {} def f(dat, rewards, start, end, extra): curr = (start, end, extra) if curr in memo: return memo[curr] if start > end: re...

0.631328

from functools import * class Solution: def stoneGameII(self, arr): a =[] s=0 n = len(arr) for i in arr[::-1]: s+=i a.append(s) a=a[::-1] @lru_cache(None) def fun(i,m): if i+2*m>=n:return a[i] mn = inf ...

0.630652

class Solution: def rob(self, nums: List[int]) -> int: if not nums: return 0 if len(nums) < 3: return max(nums) dp = [0] * len(nums) dp[0] = nums[0] dp[1] = max(nums[0], nums[1]) for i in range(2, len(nums)): dp[i] = max(dp...

0.630193

class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ tmax_profit = 0 rmax_profits = [0] * len(prices) rmax = -1 for ii in range(len(prices)-2, -1, -1): if (prices[rmax] - prices[ii] > rmax_profi...

0.629743

class Solution: def getMaxLen(self, nums: List[int]) -> int: maxx = 0 nums.append(0) # starting position # where we find a 0 i = -1 minusarr = [] for j,n in enumerate(nums): if n == 0: # now figure out previous one...

0.629184

import heapq def contig(p, A): ans = [] n = len(A) for i in range(n): for j in range(i, n): if i == j: ans.append(p[i]) else: ans.append(p[j] - p[i]) return ans def solver(N, K, A): a = [] prefix = [A[0]] for x in A[1:]: prefix.append(prefix[-1] + x) return heapq.nlargest(K, contig(pref...

0.625283

import sys read = sys.stdin.read readline = sys.stdin.readline readlines = sys.stdin.readlines sys.setrecursionlimit(10 ** 9) INF = 1 << 60 MOD = 1000000007 def main(): N, K, *X = list(map(int, read().split())) A = [abs(x - X[0]) for x in X] ans = INF for i in range(N - K + 1): if ans > min...

0.625186

# cook your dish here import bisect n, k1, *l = map(int, input().split()) v_l, b_l = l[:n], l[n:] b_inv = {key:[] for key in range(2*k1)} for i in range(n): b_l[i] -= 1 b_inv[b_l[i]].append(i) dp = [[0 for _ in range(n)] for _ in range(n)] for k in range(1, n): for j in range(n-2, -1, -1): ...

0.624014

# for _ in range(int(input())): n,k = list(map(int,input().split())) arr = list(map(int,input().split())) s=set(arr) t1=len(s) max=-1 for i in range(n-k+1): temp=set(arr[i:i+k]) #print(temp,i,k+i+1) t=len(temp) if t1 == t: if max<sum(arr[i:k+i]): max=sum(arr[i:k+i]) print(max)

0.623753

n,k = map(int,input().split()) a = list(map(int,input().split())) if k==1: print(min(a)) elif k==2: print(max(a[0],a[-1])) else: print(max(a))

0.623365

class Solution: def rob(self, nums): """ :type nums: List[int] :rtype: int """ if not nums: return 0 if len(nums)==1: return nums[0] return max(self.helper(nums[1:]), self.helper(nums[:-1])) def helper(self,nums...

0.622708

class Solution: def PredictTheWinner(self, nums): """ :type nums: List[int] :rtype: bool """ if not nums: return True n = len(nums) if n & 1 == 0: return True dp = [0] * n for i in range(n-1, -1, -1): for j in r...

0.621847

n = int(input()) a = [0] * n a = list(map(int, input().split())) for i in range(1, len(a)): a[i] += a[i - 1] ans = a[-1] for i in range(n - 2, 0, -1): ans = max(ans, a[i] - ans) print(ans)

0.619744

#dt = {} for i in x: dt[i] = dt.get(i,0)+1 import sys;input = sys.stdin.readline inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()] def check(mid): pos = x[0] ct = 1 for i in range(1,n): if x[i]-pos >= mid: pos = x[i] ct += 1 if ct...

0.61857

class Solution: def maxSizeSlices(self, slices: List[int]) -> int: a,b,n=[slices[0]],[0],len(slices) for i in range(1,n): a.append(max(a[-1],slices[i])) b.append(max(b[-1],slices[i])) for i in range(2,2*n//3,2): aa,bb=[0]*(n-1),[0]*n for j in r...

0.616366

rd = lambda: list(map(int, input().split())) k = kk = rd()[1] a = rd() k -= sum(x<0 for x in a) a[:kk] = list(map(abs, a[:kk])) print(sum(a)-(2*min(a) if k>0 and k%2 else 0))

0.616356

N = int(input()) A = [int(s) for s in input().split(" ")] ABI = sorted(((a, i) for i, a in enumerate(A, 1)), reverse=True) prev = [0] for k, (a,i) in enumerate(ABI): curr = [0]*(k+2) for l in range(k+1): curr[l] = max(curr[l], prev[l]+abs(N-i-k+l)*a) curr[l+1] = prev[l]+abs(i-l-1)*a prev = curr pri...

0.61597

k, n = map(int, input().split()) points = list(map(int, input().split())) dist = [] for i in range(n): if i != n-1: distance = points[i+1] - points[i] else: distance = points[0]+k - points[i] dist.append(distance) max = dist[0] for j in range(1, len(dist), 1): if max < dist[j]: ...

0.61572

line=input().split() n=int(line[0]) k=int(line[1]) nums=input().split() for i in range(n): nums[i]=int(nums[i]) firstsum = 0 for i in range(k): firstsum+=nums[i] totsum=firstsum for i in range(n-k): firstsum-=nums[i] firstsum+=nums[k+i] totsum+=firstsum print(totsum/(n-k+1))

0.615517

n = int(input()) a = list(map(int, input().split())) k = input() pref = [a[0]] for i in range(1, n): pref.append(pref[-1] + a[i]) cur = 0 ans = 0 for i in range(n - 1, -1, -1): if k[i] == '0': continue if cur + (pref[i - 1] if i > 0 else 0) > ans: ans = cur + (pref[i - 1] if i > 0 else 0) ...

0.615147

class Solution: def longestOnes(self, A: List[int], K: int) -> int: hulu = [] cnt = 0 num = A[0] for x in A: if x == num: cnt += 1 else: hulu.append([num,cnt]) cnt = 1 num = x if cnt>0: ...

0.614735

N = int(input()) A = list(map(int,input().split())) T = 0 for i in range(len(A)-1): if (A[i] > A[i + 1]): T += A[i] - A[i +1] A[i+1] = A[i] print(T)

0.613737

# cook your dish here def func(arr, k): sumi = 0 for j in range(k): sumi += arr[j] maxi = sumi for i in range(k,len(arr)): sumi -= arr[i - k] sumi += arr[i] maxi = max(maxi,sumi) return maxi for _ in range(int(input())): n, k = map(int,input().split()) arr = [...

0.613122

from sys import maxsize # Function to find the maximum contiguous subarray # and print its starting and end index def maxSubArraySum(a,size): max_so_far = -maxsize - 1 max_ending_here = 0 start = 0 end = 0 s = 0 for i in range(0,size): max_ending_here += a[i] if max_so_far < max_ending_here: ma...

0.611822

class Solution: def maxValueAfterReverse(self, nums: List[int]) -> int: n = len(nums) base = sum([abs(nums[i] - nums[i+1]) for i in range(n - 1)]) if (n <= 2): return base #best = base #for i in range(n-1): # for j in range(i+1, n): # ...

0.61104

#taken from https://stackoverflow.com/questions/30698441/optimal-way-to-find-sums-of-all-contiguous-sub-arrays-max-difference def max_sums(d): stack = [(-1, float('inf'))] sum_ = 0 for i, x in enumerate(d): while x > stack[-1][1]: prev_i, prev_x = stack.pop() prev_prev_i, pr...

0.610282

import sys import itertools sys.setrecursionlimit(10 ** 8) ini = lambda: int(sys.stdin.readline()) inl = lambda: [int(x) for x in sys.stdin.readline().split()] ins = lambda: sys.stdin.readline().rstrip() debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw)) N = ini() A = inl() def...

0.609561

INF = 10 ** 18 + 179 [n, k], a = [list(map(int, input().split())) for x in range(2)] a.sort() dp, l = [[0] * (k - n % k + 1) for x in range(n % k + 1)], n // k for i in range(n % k + 1): for j in range(k - n % k + 1): pos = i * (l + 1) + j * l dp[i][j] = min((dp[i - 1][j] + a[pos - 1] - a[pos - l - ...

0.605942

rr = lambda: input().strip() rri = lambda: int(rr()) rrm = lambda: list(map(int, rr().split())) def solve(N, A): ans = 0 prev = float('inf') for x in reversed(A): x = min(x, prev - 1) ans += max(x, 0) prev = x return ans for tc in range(1):#rri()): N = rri() A = rrm() ...

0.603487

#!usr/bin/env python3 from collections import defaultdict,deque from heapq import heappush, heappop import sys import math import bisect import random def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline()) def LS():return [list(x) for x in sys.stdin.readline().split()]...

0.603211

import operator N = eval(input()); N = int(N); k = eval(input()); k = int(k); list= []; for i in range(k): a=eval(input()); a=int(a); list.append(a); list.sort() for i in range(k,N): a=eval(input()) a=int(a) if(a>=0): if(a<list[k-1]): list.pop() list.append(a) list.sort() else: print(list[k-1]...

0.603023

# python3 def readline(): return tuple(map(int, input().split())) def main(): n, k = readline() a = readline() answer = list() for (i, link) in enumerate(a): bottom = max(0, i - k) top = min(n, i + k + 1) if link == 0: answer.append(top - bottom) else: ...

0.602904

n,k = map(int, input().split()) P = list(map(int, input().split())) e = [] for i in P: e.append((i+1)/2) cumsum = [0]*(n+1) for i in range(1,n+1): cumsum[i] = cumsum[i-1]+e[i-1] k_sum = cumsum.copy() for i in range(n+1): if i>=k: k_sum[i] -= cumsum[i-k] print(max(k_sum[k-1:]))

0.601656

class Solution: def minSubArrayLen(self, k, nums): """ :type k: int :type nums: List[int] :rtype: int """ if not nums: return 0 _min = float('inf') _sum = 0 j = 0 for i ,n in enumerate(nums): _su...

0.601426

import sys n, k = map(int, sys.stdin.readline().split()) nums = list(map(int, sys.stdin.readline().split())) total = sum(nums) avg = int(total / n) def check1(nums, target, K): for x in nums: if K < 0: return False if x < target: K -= target - x return K >= 0 def check...

0.601

n, k = list(map(int, input().split())) a = list(map(int, input().split())) mask = list(map(int, input().split())) result = sum(a[i] if mask[i] == 1 else 0 for i in range(n)) h = [a[i] if mask[i] == 0 else 0 for i in range(len(a))] best_awake = sum(h[:k]) curr = best_awake for j in range(k, n): curr += h[j] cu...

0.600479

import sys n, k = list(map(int, sys.stdin.readline().strip().split())) L = [] R = [] A = [] for i in range (0, n): x = list(map(int, sys.stdin.readline().strip().split())) L.append(x[0]) R.append(x[1]) A.append(x[2]) L.append(R[-1]) i = n-1 x = 0 y = 0 ans = 0 v = True N = [0 for i in range (0, n)] whi...

0.600398

class Solution: def maxProfit(self, prices): profits = 0 ln = len(prices) if not ln: return 0 elif ln == 2: return (prices[1]-prices[0]) if prices[1] > prices[0] else 0 lastPrice = prices[0] for price in prices: if lastPr...

0.600064

for _ in range(int(input())): n, k = map(int, input().split()) l = [*map(int, input())] count = [0] * (n + 1) for i in range(n - 1, -1, -1): if l[i] == 1: count[i] = count[i + 1] + 1 x,y = 0,0 for i in range(n): if l[i] == 1: x += 1 else: try: y = max(y, x + k + count[i + k]) except: ...

0.599706

n = int(input()) a = list(map(int, input().split())) lp,rp = [0 for i in range(n)],[0 for i in range(n)] lnr, rnr = [a[i] for i in range(n)],[a[i] for i in range(n)] mx = a[0] for i in range(1,n): if a[i] > mx: mx = a[i] lp[i] = lp[i-1] else: mx += 1 lp[i] = lp[i-1] + mx - a[i]...

0.599498

input() num = list(map(int, input().split())) maxn = 0 l, r = 0, len(num)-1 j1, j2 = num[l], num[r] while l < r: if j1 == j2: maxn = max(j1, maxn) l += 1 j1 += num[l] elif j1 < j2: l += 1 j1 += num[l] else: r -= 1 j2 += num[r] print(maxn)

0.597831

import sys import math def main(arr,k): x=[] y=[] for e in arr: if e%2==0: x.append(e) y.append(0) else: x.append(0) y.append(e) a=[0]*n b=[0]*n a[0]=x[0] b[0]=y[0] for i in range(1,n): if i<k: a[i]=max(x[i],a[i-1]) b[i]=max(y[i],b[i-1]) else: a[i]=max(x[i]+a[i-k-1...

0.59783

n, k = map(int, input().split()) s = sorted(list(map(int, input().split())), reverse = True) print(s[k - 1])

0.596816

from itertools import accumulate def main(): n, m, k = list(map(int, input().split())) a = list(map(int, input().split())) km = k * m if m == 1: a.sort(reverse=True) print(sum(a[:k])) return a = list(accumulate(a)) a.append(0) if n == km: print(a...

0.595558

N, K = map(int, input().split()) A = list(map(int, input().split())) ans = [] c = 2**30 r = 2**30 while r: r //= 2 l = sum(-(-a//c)-1 for a in A) if l > K: c += r else: ans.append(c) c -= r print(ans and min(ans) or 1)

0.595256

n,k=list(map(int,input().split())) a=list(map(int,input().split())) prefix=[a[0]] for i in range(1,n): prefix.append(prefix[-1]+a[i]) ans=[] for i in range(n): for j in range(i+k-1,n): if(i==0): ans.append(prefix[j]/(j-i+1)) else: ans.append((prefix[j]-prefix[i-1])/(j-i+1...

0.595131

n=int(input()) a=list(map(int,input().split())) print(n*max(a)-sum(a))

0.594103

n, k = list(map(int, input().split())) a = list(map(int, input().split())) g = {} def dfs(v, p=-1): c = [dfs(child, v) for child in g.get(v, set()) - {p}] c.sort(key=len, reverse=True) r = [] i = 0 while c: if i >= len(c[-1]): c.pop() else: o = max(i, k - i - 1) s = q = 0 for x in c: if len(x)...

0.59392

class Solution: def checkSubarraySum(self, nums, k): """ :type nums: List[int] :type k: int :rtype: bool """ if k==0: j=0 for i in range(0,len(nums)): if nums[i]==0: if j<i: ...

0.593792

n, k = list(map(int, input().split())) ab = [list(map(int, input().split())) for _ in range(n)] ab.sort() num_sum = 0 for a, b in ab: num_sum += b if num_sum >= k: print(a) return

0.592923

Alex and Lee play a game with piles of stones. There are an even number of piles arranged in a row, and each pile has a positive integer number of stones piles[i]. The objective of the game is to end with the most stones. The total number of stones is odd, so there are no ties. Alex and Lee take turns, with Alex star...

class Solution: def stoneGame(self, piles: List[int]) -> bool: return True

0.808577

class Solution: def PredictTheWinner(self, nums): """ :type nums: List[int] :rtype: bool """ if not nums: return True n = len(nums) if n & 1 == 0: return True dp = [0] * n for i in range(n-1, -1, -1): for j in r...

0.701347

class Solution: def canPartition(self, nums): """ :type nums: List[int] :rtype: bool """ _sum=sum(nums) div,mod=divmod(_sum,2) if mod!=0: return False target=[div]*2 self._len=len(nums) nums.sort(reverse=True) ...

0.643037

from functools import * class Solution: def stoneGameII(self, arr): a =[] s=0 n = len(arr) for i in arr[::-1]: s+=i a.append(s) a=a[::-1] @lru_cache(None) def fun(i,m): if i+2*m>=n:return a[i] mn = inf ...

0.63077

class Solution: def divisorGame(self, N: int) -> bool: return N%2 == 0

0.628955

def is_odd_heavy(arr): maxEven, minOdd = ( f(filter(lambda n: n%2 == v, arr), default=float("-inf")) for f,v in ((max, 0), (min,1)) ) return maxEven < minOdd

0.615895

class Solution: def oddEvenJumps(self, A: List[int]) -> int: def findNextHighestIdx(B: List[int]) -> List[int]: next_idx_list = [None] * len(B) stack = [] for i in B: while stack and stack[-1] < i: next_idx_list[stack.pop()] = i ...

0.615248

def bits_battle(nums): binary = '{:b}'.format evens = odds = 0 for num in nums: if num % 2: odds += binary(num).count('1') else: evens += binary(num).count('0') if odds == evens: return 'tie' return '{} win'.format('odds' if odds > evens else 'evens')

0.609421

def bits_war(numbers): odd, even = 0, 0 for number in numbers: if number % 2 == 0: if number > 0: even += bin(number).count('1') else: even -= bin(number).count('1') else: if number > 0: odd += bin(number).count(...

0.6094

def oddity(n): while True: n, m = divmod(n, 2) yield m def oddest(arr): res = arr[0] for n in arr[1:]: if next(b > a for a, b in zip(oddity(res), oddity(n)) if a != b): res = n return res

0.604947

def main(): n, l = int(input()), list(map(int, input().split())) if not (n & 1): l.append(0) l.append(150001) i, b, c, fails0, fails1 = 0, 0, 150001, [], [] try: while True: a, b, c = b, c, l[i] if a >= b or b <= c: if len(fails0) + len(fails1)...

0.602384

def solve(s): v = sum(s[i] != s[-1-i] for i in range((len(s))//2) ) return v == 1 or not v and len(s)%2

0.600385

input() a = list(map(int, input().split())) b = [] i = j = 0 while i < len(a): while j < len(a) and a[j] == a[i]: j += 1 if (j - i) % 2 == 1: b += [a[i]] i = j - (j - i) // 2 for k in range(i, j): a[k] += 1 print(b[-1] - len(b) + 1)

0.600369

def solve(n,a): tot=0 for i in range(n): tot+=a[i] diffs = [] #alla suffix - prefix diffs[i]=prefix-suffix om delas innan element i diffs.append(-tot) for i in range(n): tot-=2*a[i] diffs.append(-tot) if tot==0: return ("YES") for i in range(n): ...

0.5908

def luck_check(string): e0, b1 = len(string) // 2, (len(string) + 1) // 2 return sum(map(int, string[:e0])) == sum(map(int, string[b1:]))

0.587399

def flipping_game(num): current = 0 biggest = 0 for i in num: current = max(0, current - ( i or -1 ) ) biggest = max(biggest, current) return sum(num) + (biggest or -1)

0.587111

import sys def solve(ppp): section_start = -1 moved_left_max = 0 moved_right_max = 0 prev = True for i, p in enumerate(ppp, start=1): if i == p: if prev: moved_left_max = 0 moved_right_max = 0 section_start = -1 prev ...

0.58431

def odd_or_even(arr): return 'even' if sum(arr) % 2 == 0 else 'odd'

0.583865

class Solution: def lastStoneWeight(self, stones: List[int]) -> int: while True: if len(stones) == 1: return stones[0] if len(stones) == 0: return 0 stones.sort() x = stones.pop() y = stones.pop() if y !=...

0.583363

class Solution: def checkPossibility(self, nums): """ :type nums: List[int] :rtype: bool """ possibility_flag = False for i in range(1, len(nums)): if nums[i] < nums[i-1]: if possibility_flag: return False ...

0.581826

from math import * from collections import * from random import * from bisect import * import sys input=sys.stdin.readline t=int(input()) while(t): t-=1 n=int(input()) a=list(map(int,input().split())) z=a.count(1) if(z==n): if(z%2): print("First") else: print(...

0.57899

class Solution: def findLHS(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums) ret = 0 for i in count: if i+1 in count: ret = max(ret, count[i]+count[i+1]) return ret...

0.575403

print('YES' if input().count('1')+1>>1<<1 >= input().count('1') else 'NO')

0.575148

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): #print(*args, **kwargs, file=sys.stderr) # in python 3.4 **kwarg...

0.574617

def learn_charitable_game(arr): return sum(arr) % len(arr) == 0 and sum(arr) > 0

0.573661

def is_very_even_number(n): while len(str(n)) > 1: n = sum(int(x) for x in str(n)) return True if n % 2 == 0 else False

0.572318

import sys input = sys.stdin.readline sys.setrecursionlimit(100000) def getN(): return int(input()) def getList(): return list(map(int, input().split())) import math from bisect import bisect_left n = getN() nums = getList() if sum(nums) % 2 == 1: print("NO") return if max(nums) * 2 > sum(nums): ...

0.570889

class Solution: def canWinNim(self, n): """ :type n: int :rtype: bool """ return (n%4 != 0)

0.568506

# -*- coding: utf-8 -*- from time import perf_counter from sys import stdin def run(n, s): m = 0 small = n // 2 for big in range(n-1, (n+1)//2-1, -1): while small >= 0 and s[small] > s[big] / 2: small -= 1 if small == -1: break #print(small, big) smal...

0.56608

from collections import Counter def obtain_max_number(arr): c = Counter(arr) while 1: find = next((k for k in c if c[k] > 1), None) if not find:return max(c) c[find] -= 2 c[find*2] = c.get(find*2,0) + 1

0.565832

def iq_test(numbers): e = [int(i) % 2 == 0 for i in numbers.split()] return e.index(True) + 1 if e.count(True) == 1 else e.index(False) + 1

0.564601

class Solution: def stoneGameIII(self, stoneValue: List[int]) -> str: A = stoneValue dp = [0] * 3 for i in range(len(A) - 1, -1, -1): dp[i % 3] = max(sum(A[i:i + k]) - dp[(i + k) % 3] for k in (1, 2, 3)) if dp[0] > 0: return 'Alice' elif dp[0]...

0.563912

def read_ints(): return [int(i) for i in input().split()] n = read_ints() a = read_ints() if len(a) % 2 and a[0] % 2 and a[-1] % 2: print('Yes') else: print('No')

0.562097

class Solution: def maxValueAfterReverse(self, nums: List[int]) -> int: n = len(nums) base = sum([abs(nums[i] - nums[i+1]) for i in range(n - 1)]) if (n <= 2): return base #best = base #for i in range(n-1): # for j in range(i+1, n): # ...

0.561598

class Solution: def canReorderDoubled(self, A: List[int]) -> bool: cache=Counter(A) c_list=sorted(list(cache),key=abs) for x in c_list: if cache[x]>cache[2*x]: return False cache[2*x]-=cache[x] return True

0.561329

n = int(input()) a = sum(list(map(int, input().split()))) if n == 1: if a == 1: print("YES") else: print("NO") else: if a == n - 1: print("YES") else: print("NO")

0.560533

class Solution: def increasingTriplet(self, nums): """ :type nums: List[int] :rtype: bool """ n1 = n2 = float('inf') for n in nums: if n <= n1: n1 = n elif n <= n2: n2 = n else: ...

0.560516

def dp(): dparr = [0] * len(sections) for i in range(len(sections) - 1, -1, -1): _, curend, curcomfort = sections[i] nextsection = i + 1 try: while sections[nextsection][0] <= curend: nextsection += 1 except IndexError: # Loop til end inc = curcomfort else: inc = curcomfort + dparr[nextsecti...

0.55791

3 # Copyright (C) 2017 Sayutin Dmitry. # # This program is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License as # published by the Free Software Foundation; version 3 # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY;...

0.557793

class Solution: def arrayPairSum(self, nums): """ :type nums: List[int] :rtype: int """ nums.sort() return sum(nums[::2])

0.556824

def round(flash_pile, turtle_pile): faceup_pile = [] while turtle_pile: for pile in flash_pile, turtle_pile: faceup_pile.append(pile.pop(0)) if len(faceup_pile) >= 2 and faceup_pile[-1] == faceup_pile[-2]: flash_pile.extend(faceup_pile) return True...

0.55668

from functools import lru_cache class Solution: def tallestBillboard(self, rods: List[int]) -> int: rods = sorted(rods)[::-1] n = len(rods) psum = rods.copy() for i in range(n-1)[::-1]: psum[i] += psum[i+1] @lru_cache(None) def dfs(idx, diff): ...

0.555975

""" Codeforces Contest 260 Div 1 Problem B Author : chaotic_iak Language: Python 3.3.4 """ def main(): n,k = read() s = set() for i in range(n): s.add(read(0)) s = list(s) s.sort() s = treeify(s) res = solve(s) if res == 0: # neither: second player win print("Second") if r...

0.555708

b,k = map(int, input().split()) a = list(map(int, input().split())) r = 0 for x in a: r = (r*b+x) % 2 if r == 0: print('even') else: print('odd')

0.555063

def DFS(x): for i in range(x): if(Seen[i][x]): continue if(Rem[i]>=C[x]): if(Rem[i]==C[x] and len(Children[i])==0): continue Rem[i]-=C[x] Parent[x]=i Children[i].append(x) return True for i in range(x): ...

0.554734

import sys from collections import defaultdict input = sys.stdin.readline sys.setrecursionlimit(1000000) arr=[int(x) for x in input().split()] if arr[0]==1: print(0) return p=[None] for i in range(1,arr[0]+1): p.append(arr[i]) a=[None] for i in range(arr[0]+1,2*arr[0]+1): a.appe...

0.554348

class Solution: def maxScoreSightseeingPair(self, A: List[int]) -> int: curmaxsight = A[0] - 1 curmaxpair = 0 for sight in A[1:]: if sight + curmaxsight > curmaxpair: curmaxpair = sight + curmaxsight if sight > curmaxsight: curmaxsight ...

0.553777

import sys input=sys.stdin.readline from collections import defaultdict def solve(n,A): d=defaultdict(int) for a in A: d[a]+=1 flag=True for v in d.values(): if v%2!=0: flag=False break return bool(n%2)^flag def main(): t=int(input()) for _ in range(...

0.553175

def find_outlier(int): odds = [x for x in int if x%2!=0] evens= [x for x in int if x%2==0] return odds[0] if len(odds)<len(evens) else evens[0]

0.553051

class Solution: def movesToMakeZigzag(self, nums): n = len(nums) res0 = 0 for i in range(0, n, 2): nei = min(nums[j] for j in [i - 1, i + 1] if 0 <= j <= n-1) if nums[i] >= nei: res0 += nums[i] - nei + 1 res1 = 0 for i in range(1, n, 2)...

0.551878

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.551189

#!/usr/bin/env python3 import sys def rint(): return list(map(int, sys.stdin.readline().split())) #lines = stdin.readlines() def get_num1(i): cnt = 0 while i: if i%2: cnt +=1 i //=2 return cnt n = int(input()) a = list(rint()) b = [get_num1(aa) for aa in a] ans = 0 #S0[...

0.550827

def lamps(a): n = sum(1 for i, x in enumerate(a) if x != i % 2) return min(n, len(a) - n)

0.550238

def is_onion_array(a): return all(a[i] + a[-i-1] <= 10 for i in range(len(a) // 2))

0.549993

class Solution: def maxCoins(self, piles: List[int]) -> int: piles.sort() i = 0 j = len(piles) - 1 max_coins = 0 for i in range(len(piles) // 3, len(piles), 2): max_coins += piles[i] return max_coins

0.549513

n = int(input()) a = list(map(int, input().split())) nechet = 0 for el in a: if el % 2 == 1: nechet += 1 if nechet == 0: print('Second') else: print('First')

0.549007

""" Codeforces Contest 264 Div 2 Problem B Author : chaotic_iak Language: Python 3.3.4 """ def main(): n, = read() print(max(read())) ################################### NON-SOLUTION STUFF BELOW def read(mode=2): # 0: String # 1: List of strings # 2: List of integers inputs = input().strip(...

0.547417

def odd_ball(arr): return arr.index("odd") in arr

0.54698

import os import random import sys from typing import List, Dict class Int: def __init__(self, val): self.val = val def get(self): return self.val + 111 class Unique: def __init__(self): self.s = set() def add(self, val : int): self.s.add(val) def __contains__(s...

0.546735

def main(): N, *A = list(map(int, open(0).read().split())) B = sorted(A) l, r = 0, N m, c = N // 2, N * (N + 1) // 2 def check(x): b, r, y = N, 0, 0 D = [0] * (2 * N + 1) for a in A: D[b] += 1 if a < x: r += D[b] b += ...

0.54651

def dfs(i): if i >= 2 ** n: return 0, 0 x1, m1 = dfs(i * 2) x2, m2 = dfs(i * 2 + 1) if m1 + a[i * 2] < m2 + a[i * 2 + 1]: return x1 + x2 + m2 + a[i * 2 + 1] - m1 - a[i * 2], m2 + a[i * 2 + 1] return x1 + x2 + m1 + a[i * 2] - m2 - a[i * 2 + 1], m1 + a[i * 2] n = int(input()) a = [0, 0...

0.546478

r,n = [int(x) for x in input().split()] cells = [[int(x) for x in input().split()] for i in range(n)] cells.sort() #print(cells) out = False res = {True:"WIN",False:"LOSE"} if len(cells) == 0: print(res[r%2 == 1]) else: out = False #print(cells[0][0] > 1) #print(cells[-1][0] < r) for i in range(1,n): ...

0.546446

def solve(xs): m = 0 for x in sorted(xs): if x > m + 1: break m += x return m + 1

0.546221

from collections import Counter, defaultdict import itertools import sys def main(): n = int(input()) spec = 3 poss = True for _ in range(n): winner = int(input()) if winner != spec: spec = 6 - winner - spec else: poss = False print('YES' if poss else...

0.546219

def can_jump(arr): if arr[0] == 0 or len(arr) == 1: return False if arr[0] >= len(arr): return True for jump in range(1, arr[0] +1): if can_jump(arr[jump:]): return True return False

0.546165

_n = input() lines = list(map(int, input().split())) lines.sort() longest = lines.pop() if sum(lines) > longest: print("Yes") else: print("No")

0.546145

n = int(input()) a = list(map(int, input().split())) print(max(a) ^ a[-1])

0.545882

n = int(input()) l = list(map(int, input().split())) f1 = l[2] l.sort() f2 = l[0] print(2 + (f1 ^ f2))

0.545251

read = lambda: list(map(int, input().split())) n = int(input()) a = list(read()) s = set() for i in a: s.add(i) f1 = len(s) < 3 f2 = len(s) == 3 and max(s) + min(s) == 2 * sorted(s)[1] print('YES' if f1 or f2 else 'NO')

0.544387

n = int(input()) p = [-1, 0] + [int(x) for x in input().split()] h = [0] * (n+1) count = [0] * n count[0] = 1 max_h = 0 for i in range(2, n+1): h[i] = h[p[i]]+1 count[h[i]]+=1 max_h = max(max_h,h[i]) ans = 0 for i in range(max_h+1): ans += count[i]%2 print(ans)

0.544387

n = int(input()) z = list(map(int, input().split())) z.sort() if z[n - 1] < z[n]: print("YES") else: print("NO")

0.543903

from bisect import bisect_left as bisect n = 5000000 sieve, PED, PED_DATA = [0]*((n>>1)+1), [], [] for i in range(3, n+1, 2): if not sieve[i>>1]: for j in range(i**2>>1, (n+1)>>1, i): sieve[j] = 1 s = str(i) nEveD = sum(s.count(d) for d in "02468") if nEveD: PED.append(i...

0.54334

n = int(input()) if n * (n + 1) // 2 % 2 == 1: print(1) else: print(0)

0.543226

n,m=list(map(int,input().split())) if(m!=0): L=list(map(int,input().split())) else: L=[] L.sort() valid=True for i in range(2,m): if(L[i]-L[i-2]==2): valid=False if(m==0 or(valid and L[0]!=1 and L[-1]!=n)): print("YES") else: print("NO")

0.542536

n=int(input()) l=list(map(int,input().split())) ans=l[0]+l[n-2] for i in range(n-2): ans+=min(l[i],l[i+1]) print(ans)

0.542003

from heapq import * def add_all(lst): heapify(lst) total = 0 while len(lst) > 1: s = heappop(lst) + heappop(lst) total += s heappush(lst, s) return total

0.540741

n, a = list(map(int, input().split())) x = list(map(int, input().split())) a -= 1 result = x[a] for i in range(1, n + 1): le = a - i rg = a + i le_i = le >= 0 and le < n rg_i = rg >= 0 and rg < n if not le_i and not rg_i: break if le_i and not rg_i: result += x[le] elif ...

0.540736

def validate(n): digits = [int(x) for x in str(n)] even = [x*2 if x*2 <= 9 else x*2 - 9 for x in digits[-2::-2]] odd = [x for x in digits[-1::-2]] return (sum(even + odd)%10) == 0

0.540358

import math class Solution: def winnerSquareGame(self, n: int) -> bool: dp: List[int] = [0] * (n+1) candidates: List[int] = [] for j in range(1, int(math.sqrt(n))+1): candidates.append(j*j) for i in range(n): if not dp[i]: for can in candidate...

0.540326

n = int(input()) mas = list(map(int, input().split())) mas2 = [0 for _ in range(1001)] for i in mas: mas2[i]+=1 i = 0 for i in mas2: if i > (n + 1) / 2: print ("NO") return print ("YES")

0.540161

class Solution: def threeConsecutiveOdds(self, arr: List[int]) -> bool: flag = False odd = 0 i = 0 while i < len(arr): if arr[i] % 2 == 1: if not flag: flag = True odd += 1 i += 1 ...

0.539576

mi = lambda: [int(i) for i in input().split()] n = int(input()) t = mi() a = [] v = 0 c = 0 for i in t: if i == v: c += 1 else: if c != 0: a.append(c) c = 1 v = i a.append(c) r = 0 for k in range(1, len(a)): r = max(r, min(a[k - 1], a[k]) * 2) print(r)

0.53912

def __starting_point(): s = input() c = [s.count(x) for x in set(s)] total = 0 for x in c: if x % 2 != 0: total += 1 if total % 2 == 0 and total != 0: print("Second") else: print("First") __starting_point()

0.538999

# arr = [ # 1, # 1 # 0, # 0, # 1, # think so # 1, # not sure # 0, # not sure # 0, # 2 # 1, # 1, # think so # 1, # 0, # 0, # 1, # 0, # 1, # 0, # ] arr = [ 1, # 1 0, 0, 1, # think so 0, # not sure 1, # not sure 0, # 2 1, 1, # think so 1, 0, 0, 1, 0, 1, 0, ] n = int(input()) - 1 print(arr[n]) # assert n in {1, 7} or n...

0.538815

def calc(a): res = [0] * (len(a) + 1) for k in range(len(a)): res = [2 * max(a[i] + res[i+1], a[i+k] + res[i]) for i in range(len(a) - k)] return res[0]

0.538516

# python3 def main(): n = int(input()) hard, soft = 0, 0 while n: n -= 1 if input().split()[1] == "hard": hard += 1 else: soft += 1 if hard < soft: hard, soft = soft, hard assert soft <= hard side = 1 while side ** 2 / 2 < soft or ...

0.538159

n = int(input()) x = list(map(int,input().split())) y = sorted(x) ans1 = y[n//2] ans2 = y[n//2-1] for i in x : if i < ans1 : print(ans1) else : print(ans2)

0.537995

n = int(input()) a = list(map(int, input().split())) b = [] for i in range(len(a)): b.append(a[i]) for i in range(len(a)): b.append(a[i]) q = 0 r = set() for i in b: if i: q += 1 else: r.add(q) q = 0 print(max(r))

0.537747

n = int(input()) arr = [int(x) for x in input().split()] arr.sort() if(n%2): print(arr[n//2]) else: print(arr[n//2-1])

0.535711

# import all important libraries and inbuilt functions from fractions import Fraction import numpy as np import sys,bisect,copyreg,copy,statistics,os from math import * from collections import Counter,defaultdict,deque,OrderedDict from itertools import combinations,permutations,accumulate from numpy.linalg import ...

0.535693

n = int(input()) a = list(map(int, input().split())) q = (10 ** 6) * [-1] pnt = -1 ans = "YES" for i in range(n): if pnt == -1: pnt += 1 q[pnt] = a[i] else : if q[pnt] == a[i] or abs(q[pnt] - a[i]) % 2 == 0: q[pnt] = -1 pnt -= 1 else: pnt += 1 ...

0.535182

#!/usr/bin/env python3 n = int(input()) a = [int(x) for x in input().split()] sorted_a = sorted(a) dict_a = {} for x in a: if not x in dict_a: dict_a[x] = 1 else: dict_a[x] += 1 sorted_uniq_a = sorted(dict_a.keys()) max_fib_prefix = [a[0], a[1]] for i in range(0, len(sorted_uniq_a)): for...

0.534599

def solve(a): return sum(1 if v % 2 == 0 else -1 for v in a if type(v) == int)

0.534378

n=int(input()) l=[0]*n for i in range(n): l[i]=int(input()) l.sort() s=0 i=n-1 while i>=0: x=2*l[i] if l[-1]>=x: j=i while j<len(l): if l[j]>=x: l.pop(j) l.pop(i) s+=1 break j+=1 i-=...

0.534209

def palindrome_rearranging(s): return sum(s.count(c) % 2 for c in set(s)) < 2

0.533967

n = int(input()) a = [int(ai) for ai in input().split()] def solve(x): n = len(x) if sorted(x) == x: return n return max(solve(x[:n//2]), solve(x[n//2:])) print(solve(a))

0.533925

def fish(shoal): eaten, size, target = 0, 1, 4 for f in sorted(map(int, shoal)): if f > size: break eaten += f if eaten >= target: size += 1 target += 4 * size return size

0.53391

def peak(arr): for i, val in enumerate(arr): if sum(arr[:i]) == sum(arr[i+1:]): return i return -1

0.533714

def solve(a): seen = set() for i in range(len(a)): c = 0 for j in range(i+2,len(a)): c += a[j-1] if a[i]^a[j] == c: seen.add((i,j)) if c >= 2*a[i]: break for i in range(len(a)-1,-1,-1): c = 0 for j in ra...

0.533578

class Solution: def lastStoneWeightII(self, stones: List[int]) -> int: dp = {0} total = sum(stones) for stone in stones: dp |= {_sum + stone for _sum in dp} return min(abs(total - _sum - _sum) for _sum in dp)

0.533554

x = int(input()) y = list(map(int, input().split(' '))) bad = x//2 s = 0 t=0 y = y + y for i in range(bad): s += y[2*i] # print("adding {} to s".format(2*i)) t += y[2*i+1] # print("adding {} to t".format(2*i+1)) mini = min(s, t) for i in range(bad): s -= y[2*i] # print("subing {} to s".format(2...

0.533329

One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node's value. If it is a null node, we record using a sentinel value such as #. _9_ / \ 3 2 / \ / \ 4 1 # 6 / \ / \ / \ # # # # # # For example, the above binary tree can...

class Solution(object): def isValidSerialization(self, preorder): """ :type preorder: str :rtype: bool """ # remember how many empty slots we have # non-null nodes occupy one slot but create two new slots # null nodes occupy one slot ...

0.779547

# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right import re class Solution: def recoverFromPreorder(self, S: str) -> TreeNode: itera = re.finditer(r'(-*)(\\d+)', S) ...

0.524134

class Solution(object): def isSubPath(self, h, r0): h_vals = [] while h: h_vals.append(str(h.val)) h = h.next h_str = ('-'.join(h_vals)) + '-' # serialized list st = [(r0, '-')] # DFS stack while st: r, pre = st.pop() if not...

0.493871

# """ # This is the interface that allows for creating nested lists. # You should not implement it, or speculate about its implementation # """ #class NestedInteger: # def __init__(self, value=None): # """ # If value is not specified, initializes an empty list. # Otherwise initializes a ...

0.492662

def clean_string(s): stk = [] for c in s: if c=='#' and stk: stk.pop() elif c!='#': stk.append(c) return ''.join(stk)

0.474186

class Solution: def isValid(self, code): """ :type code: str :rtype: bool """ def parseTag(src, i): j = i tag, i = findtag(src, i) if not tag: return False, j res, i = parseContent(src, i) ...

0.470522

# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right class FindElements: def __init__(self, root: TreeNode): self.dicts = {} if root: root.val = 0 s...

0.468163

def is_hollow(x): while x and x[0] != 0 and x[-1] != 0: x = x[1:-1] return len(x) > 2 and set(x) == {0}

0.452625

class Solution: def backspaceCompare(self, S1, S2): i1 = len(S1) - 1 i2 = len(S2) - 1 while i1 >= 0 or i2 >= 0: c1 = '' c2 = '' if i1 >= 0: c1, i1 = self.getChar(S1, i1) if i2 >= 0: c2, i2 = self.getCha...

0.44633

class Solution: def isNumber(self, s): """ :type s: str :rtype: bool """ dot = False exp = False try: while s.startswith(' '): s = s[1:] while s.endswith(' '): s = s[:-1] ...

0.443889

class Solution: def validateBinaryTreeNodes(self, n: int, leftChild: List[int], rightChild: List[int]) -> bool: leftset, rightset = set(leftChild), set(rightChild) roots = [] for i in range(n): if i not in leftset and i not in rightset: roots.append(i) ...

0.440451

class Solution: def calculate(self, s): """ :type s: str :rtype: int """ if not s: return 0 pre_op = '+' stack = [0] cur_num = 0 digits = '0123456789' s += '#' for c in s: ...

0.433642

def simplify(p): new_p=[(0,0)] new_str='' x=0 y=0 for i in p: if i == '<': x-=1 elif i == '>': x+=1 elif i == '^': y+=1 elif i == 'v': y-=1 if (x,y) not in new_p: new_p.append((x,y)) new_s...

0.43144

def isTree(matrix): visited_nodes = set([0]) crossed_edges = set() agenda = [0] while agenda: node = agenda.pop() for i in matrix[node]: if (node, i) in crossed_edges: continue if i in visited_nodes: return False agenda.append(i) crossed_...

0.421005

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def postorderTraversal(self, root): """ :type root: TreeNode :rtype: List[int] """ i...

0.420697

def is_thue_morse(seq): init_seq = [0] while len(init_seq) < len(seq): init_seq += [1 if n == 0 else 0 for n in init_seq] return init_seq[:len(seq)] == seq

0.419267

def isValid(formula): return not ( \ ( 1 in formula and 2 in formula) or \ ( 3 in formula and 4 in formula) or \ ( 5 in formula and not 6 in formula) or \ (not 5 in formula and 6 in formula) or \ (not 7 in formula and not 8 in formula))

0.418971

class Solution(object): loc=0 lastloc=-1 f='' def getNext(self,formular,locked=False): stype=0 # 0:null, 1:numeric, 2/20: Elem, 3: parenthesis ret=0 if self.loc==self.lastloc: return (0,0) i=self.loc while i <len(formular): if stype in (0,1) ...

0.418321

BRACES = { '(': ')', '[': ']', '{': '}' } def group_check(s): stack = [] for b in s: c = BRACES.get(b) if c: stack.append(c) elif not stack or stack.pop() != b: return False return not stack

0.416052

class Solution: def isValid(self, s): """ :type s: str :rtype: bool """ stack = [] dict = {"]":"[", "}":"{", ")":"("} for i in s: if i in dict.values(): stack.append(i) elif i in dict.keys(): ...

0.415825

def valid_parentheses(string): cnt = 0 for char in string: if char == '(': cnt += 1 if char == ')': cnt -= 1 if cnt < 0: return False return True if cnt == 0 else False

0.410357

class Solution: def checkValidString(self, s): """ :type s: str :rtype: bool """ low, high = 0, 0 for c in s: if c == "(": low += 1 high += 1 elif c == ")": if low > 0: ...

0.406986

class Solution(object): def parse(self,expression,d,i): count = 0 start = i if expression[i] == "(": count += 1 i += 1 while count != 0: if expression[i] == "(": count += 1 elif expression[i] == ")": count -= 1 i += 1 val = self.evaluate(expression[start:i],d) el...

0.406876

def no_order(equation): equation = equation.replace(' ', '') equation = equation.replace('+', ')+') equation = equation.replace('-', ')-') equation = equation.replace('*', ')*') equation = equation.replace('/', ')//') equation = equation.replace('%', ')%') equation = equation.replace('^', ')...

0.405828

s = input() last = s.rfind('#') dif = s.count('(')-s.count(')')-s.count('#') try: assert dif >= 0 lev = 0 out = [] for i in range(len(s)): c = s[i] if c == '(': lev += 1 elif c == ')': lev -= 1 assert lev >= 0 elif c == '#': lev -= 1 ...

0.404718

class Solution: def isMatch(self, s, p): """ :type s: str :type p: str :rtype: bool """ '''维护两个下标，逐个比较，如果pj为*，则记录*的位置，将*后一个元素与si进行比较，如果不相等，则将i从记录的位置+1，重新比较''' i=0 j=0 star=-1 lenp=len(p) while i<len(s): ...

0.404328

def digit_all (x): return filter(str.isdigit, x) if isinstance(x, str) else 'Invalid input !'

0.403572

class T: def __init__(self,value,left=None,right=None): self.value=value self.left=left self.right=right def is_bst(node): def extract(node): if node is not None: yield from extract(node.left) yield node.value yield from extract(node.right) ...

0.402852

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def buildTree(self, preorder, inorder): """ :type preorder: List[int] :type inorder: List[int] ...

0.401749

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def sumNumbers(self, root): """ :type root: TreeNode :rtype: int """ def dfs(node, c...

0.40169

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution(object): def validBST(self, root, min, max): if root == None: return True if root.v...

0.401485

def is_balanced(s, caps): stack = [] openers, closers = caps[::2], caps[1::2] for char in s: if char in openers: if char in closers and stack and stack[-1] == char: stack.pop() else: stack.append(char) elif char in closers: ...

0.400314

def to_bits(s): lst = [0] * 5000 for i in map(int,s.split()): lst[i] = 1 return lst

0.398122

import math class Solution: def isRationalEqual(self, S: str, T: str) -> bool: if len(S) == 0 or len(T) == 0: return False def process(s): if s[-1] == '.': s = s[:-1] stack, repeat_9 = [], False for i, x in enumerate(s): ...

0.39733

class Solution: def isOneBitCharacter(self, bits): """ :type bits: List[int] :rtype: bool """ """ i = 0 while i < len(bits)-1: if bits[i] == 1: i += 2 else: # bits[i] is 0 ...

0.396164

import sys def main(): s = sys.stdin.readline save = {' ': '%20', '!': '%21', '$': '%24', '%': '%25', '(': '%28', ')': '%29', '*': '%2a'} string = s().strip() while True: output = [] if '#' in string: return for i in string: if i in save: o...

0.39549

def domino_reaction(s): ds = "" for (i,d) in enumerate(s): if( d=="|" ): ds += "/" else: return ds+s[i:] return ds

0.394557

def stringify(list): return 'None' if list == None else str(list.data) + ' -> ' + stringify(list.next)

0.393796

from re import compile, sub REGEX = compile(r',+') def dad_filter(strng): return sub(REGEX, ',', strng).rstrip(' ,')

0.393758

class Solution: def parseBoolExpr(self, expression: str) -> bool: if expression == 'f': return False if expression == 't': return True if expression[0] == '!': return not self.parseBoolExpr(expression[2:-1]) if expression[0] == '|': cur...

0.391196

import re def calculate(input): try: return eval(re.sub(r'(\d+)', lambda m: str(int(m.group(1))), input)) except: return False

0.391191

class Solution: def evalRPN(self, tokens): """ :type tokens: List[str] :rtype: int """ s = [] for token in tokens: if token == "+": a = int(s.pop()) b = int(s.pop()) s.append(a+b) elif token == "/": a = int(s.pop()) b = int(s.po...

0.388674

from collections import deque def tree_by_levels(node): if not node: return [] res, queue = [], deque([node,]) while queue: n = queue.popleft() res.append(n.value) if n.left is not None: queue.append(n.left) if n.right is not None: queue.appe...

0.386863

class Solution: def validIPAddress(self, IP): """ :type IP: str :rtype: str """ if ":" in IP: res = self.validIPv6(IP) return "IPv6" if res else "Neither" elif "." in IP: res = self.validIPV4(IP) return "IPv4"...

0.386757

def parse(data): value = 0 res=[] for c in data: if c=="i": value+=1 elif c=="d": value-=1 elif c=="s": value*=value elif c=="o": res.append(value) return res

0.385411

def e(s):return f([*s,'+']) def f(s,r=0,o=0,x='',c=0): while s and')'!=c: c=s.pop(0);i='+-*/)('.find(c) if c=='-'>x or i<0:x+=c elif c=='(':x=str(f(s)) elif i>-1:a=float(x);r=[r+a,r-a,r*a,r/a][o];o=i;x='' return r

0.38516

brackets = {"}":"{","]":"[",")":"("} def braces_status(s): stack = [] for c in s: if c in "[({": stack.append(c) elif c in "])}": if not stack or stack.pop() != brackets[c]: return False return not stack

0.38482

import re class Simplexer(object): ORDERED_TOKENS = [ {"type": "integer", "reg": r'\d+'}, {"type": "boolean", "reg": r'true|false'}, {"type": "string", "reg": r'\".*\"'}, {"type": "operator", "reg": r'[-+*/%\)\(=]'}, ...

0.384247

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def levelOrder(self, root): """ :type root: TreeNode :rtype: List[List[int]] """ que...

0.383924

def my_parse_int(s): try: return int(s) except ValueError: return 'NaN'

0.381748

def validBraces(string): braces = {"(": ")", "[": "]", "{": "}"} stack = [] for character in string: if character in braces.keys(): stack.append(character) else: if len(stack) == 0 or braces[stack.pop()] != character: return False return len(stack)...

0.381308

# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right class Solution: def pruneTreeHelper(self, root: TreeNode) -> TreeNode: if not root: return None ...

0.379656

""" Codeforces April Fools Contest 2014 Problem I Author : chaotic_iak Language: Python 3.3.4 """ class InputHandlerObject(object): inputs = [] def getInput(self, n = 0): res = "" inputs = self.inputs if not inputs: inputs.extend(input().split(" ")) if n == 0: res...

0.379267

import re def is_matched(read): total = sum([int(num) for num in re.findall(r'\d+', read[0])]) if read[0] == str(len(read[1])) + 'M': return True elif len(read[1]) != total: return 'Invalid cigar' else: return False

0.379136

n = int(input()) arr = [] for i in range(n): arr.append(list(input())) k = 1 for i in range(n): for j in range(n): if arr[i][j] == '#': if i+2<=n-1 and j-1>=0 and j+1<=n-1: if arr[i+1][j-1] == '#' and arr[i+1][j] == '#' and arr[i+1][j+1] == '#' and arr[i+2][j] == '#': ...

0.378075

import re def solve_runes(runes): for d in sorted(set("0123456789") - set(runes)): toTest = runes.replace("?",d) if re.search(r'([^\d]|\b)0\d+', toTest): continue l,r = toTest.split("=") if eval(l) == eval(r): return int(d) return -1

0.377942

class StreamChecker: def __init__(self, words: List[str]): #reverse trie self.trie = {} self.stream = deque([]) for word in set(words): node = self.trie for ch in word[::-1]: if not ch in node: node[ch] = {} ...

0.376684

n, m = list(map(int, input().split())) a = [-1] * m b = [] f = True for i in range(n): s = input() q = set() for j in range(len(s)): if (s[j] == "#"): q.add(j) for j in range(len(s)): if (s[j] == "#"): if (a[j] == -1): a[j] = i else: ...

0.372993

def complete_binary_tree(a): def in_order(n=0): if n < len(a): yield from in_order(2 * n + 1) yield n yield from in_order(2 * n + 2) result = [None] * len(a) for i, x in zip(in_order(), a): result[i] = x return result

0.372662

class Solution: def isValid(self, s: str) -> bool: if not s: return True return self.isValid(s.replace('abc', '')) if s.replace('abc', '') != s else False

0.371755

def get_tree_height(node, parent_node_height): if node is None: return 0 node.height = parent_node_height + 1 if node.left is None and node.right is None: return 1 return max(get_tree_height(node.left, node.height), get_tree_height(node.right, node.height)) + 1 def fill_in_array...

0.370947

class Solution: def decodeString(self, s): """ :type s: str :rtype: str """ stack = [] stack.append(["", 1]) num = "" for ch in s: if ch.isdigit(): num += ch elif ch == '[': stack.appen...

0.370435

def to_postfix (infix): prec = {'+': 1, '-': 1, '*': 2, '/': 2, '^': 3, '(': 0} postfix = [] stack = [] for ch in infix: if ch in '0123456789': postfix.append(ch) elif ch in '(': stack.append(ch) elif ch in ')': while stack and stack[-1] != '('...

0.370374

class Solution: def validUtf8(self, data): """ :type data: List[int] :rtype: bool """ count=0 for x in data: if count==0: if x>>5==0b110: count=1 elif x>>4==0b1110: count=2...

0.369418

SCORE = {'O': '0', 'o': '0', 'k': '1'} def okkOokOo(s): return ''.join(chr(int(''.join(SCORE.get(a, '') for a in word), 2)) for word in s.split('?'))

0.369393

class Solution: cache = {} def isMatch(self, s, p): """ :type s: str :type p: str :rtype: bool """ if (s, p) in self.cache: return self.cache[(s, p)] if not p: return not s if p[-1] == '*': if self...

0.369326

# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right class Solution: def bstFromPreorder(self, preorder: List[int]) -> TreeNode: # time O(n); space O(n) vals = d...

0.367934

from itertools import groupby def shut_the_gate(farm): who_eats_whom = {'H': ['A', 'V'], 'R': ['V'], 'C': []} runaway_back ,runaway_front, farm = [], [], ["".join(j) for k, j in groupby(farm)] def doSomeFarm(i=0): def do(j,s=False): while (j >= 0 if s else j<len(farm)) and farm[j] != '|'...

0.367606

starts_with = str.startswith

0.367308

def check_valid_tr_number(n): return type(n) == int and len(str(n)) == 11 and \ 8*sum(map(int, str(n)[:-1:2])) % 10 == sum(map(int, str(n)[:-1])) % 10 == n % 10

0.367102

def countzero(s): return sum(1 if c in 'abdegopq069DOPQR' else 2 if c in '%&B8' else 0 for c in s.replace('()', '0'))

0.366416

import sys fin = sys.stdin fout = sys.stdout a = [0] * 6 for i in range(6): a[i] = [0] * 6 for i in range(2): a[i][0] = 3 a[i][1] = 3 a[i][2] = 4 a[i][3] = 4 a[i][4] = 3 a[i][5] = 3 for i in range(2, 4): a[i][0] = 2 a[i][1] = 2 a[i][2] = 3 a[i][3] = 3 a[i][4] = 2 a[...

0.366224

def scoreboard(string): scores = {'nil': 0, 'one': 1, 'two': 2, 'three': 3, 'four': 4, 'five': 5, 'six': 6, 'seven': 7, 'eight': 8, 'nine': 9} return [scores[x] for x in string.split() if x in scores]

0.365626

words = {w: n for n, w in enumerate('zero one two three four five six seven eight nine ten eleven twelve thirteen fourteen fifteen sixteen seventeen eighteen nineteen'.split())} words.update({w: 10 * n for n, w in enumerate('twenty thirty forty fifty sixty seventy eighty ninety hundred'.split(), 2)}) thousands = {w: 10...

0.365521

import re def asterisc_it(s): if isinstance(s,int): s=str(s) elif isinstance(s,list): s=''.join(map(str,s)) return re.sub(r'(?<=[02468])(?=[02468])', '*', s)

0.365073

class Solution: def braceExpansionII(self, expression: str) -> List[str]: stack,res,cur=[],[],[''] for v in expression: if v.isalpha(): cur=[c+v for c in cur] elif v==',': res+=cur cur=[''] elif v==...

0.365052

class Solution(object): def judgePoint24(self, nums): bad = '떢븻각걎냇갅갸꺚뵟숣욄뵴뵞뤼갈갌뤔떌옊메늄숭캸긶꺛옖갍뇐쩢곴듇걯궄옕왹눞솴걃끗긬땉궿가쌀낐걄숤뺴늘걘꽸숢걂갋갃쫐꼔솾쩡쇔솿끛뤜간븺쩬웨딴옠뤛갂뵪덠놤빐옋귒늂갰갖놥궾갆옌뼘묰거갎긷낤겼' return chr(int(''.join(map(str, sorted(nums)))) + 42921) not in bad

0.364902

def frequency(s,n): f=[[0 for i in range(26)]for j in range(n+1)] count=0 for i in range(n): if s[i]!="#": f[count][ord(s[i])-97]+=1 else: count+=1 for j in range(26): f[count][j]=f[count-1][j] return (f,count) def solve(s): n=...

0.363044

def string_to_int_list(s): return [int(n) for n in s.split(",") if n]

0.363008

pillow=lambda s:('n','B')in zip(*s)

0.362909

def isDigit(string): try: float(string) return True except: return False

0.360756

def binary_simulation(s, q): out,n,s = [],int(s,2),len(s) for cmd,*i in q: if cmd=='I': a,b=i n ^= (1<<b-a+1)-1<<s-b else: out.append( str(int(0 < 1<<s-i[0] & n )) ) return out

0.3605

class Solution: def calculate(self, s): """ :type s: str :rtype: int """ res = 0 num = 0 sign = 1 stk = [] for c in s: if c.isdigit(): num = 10 * num + (ord(c) - ord('0')) elif c == '+': ...

0.360202

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def countNodes(self, root): """ :type root: TreeNode :rtype: int """ node = root ...

0.359726

class Solution: def myAtoi(self, str): """ :type str: str :rtype: int """ base = "0123456789" plus = "+" minus = "-" sum = 0 flag = 1 bit = 0 INT_MAX = 2147483647 INT_MIN = -2147483648 if ...

0.359437

import re def string_parse(string): return re.sub(r'(.)\1(\1+)', r'\1\1[\2]', string) if isinstance(string, str) else 'Please enter a valid string'

0.358496

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def splitBST(self, root,target): """ :type root: TreeNode :type V: int :rtype: List[TreeNode]...

0.35843

def is_solved(board): curr = 0; for r in board: for c in r: if c != curr: return False; curr+=1; return True;

0.35789

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def pathSum(self, root, sum): """ :type root: TreeNode :type sum: int :rtype: List[List[int]]...

0.357066

# cook your dish here def value(a, b, c): if(c == '&'): return a&b elif(c == '^'): return a^b elif(c == '|'): return a|b def break_rules(n, operator): if(len(n) == 1): return n elif(len(n) == 2): return [value(n[0], n[1], operator[0])] else: cont_...

0.35702

def bracket_pairs(string): brackets = {} open_brackets = [] for i, c in enumerate(string): if c == '(': open_brackets.append(i) elif c == ')': if not open_brackets: return False brackets[open_brackets.pop()] = i return False if open_b...

0.356679

from random import choice def interpret(code): code = [list(l) for l in code.split('\n')] x, y = 0, 0 dx, dy = 1, 0 output = '' stack = [] string_mode = False while True: move = 1 i = code[y][x] if string_mode: if i == '"': s...

0.355483

def step_through_with(s): return any(m == n for m, n in zip(s, s[1:]))

0.355381

class Solution: def calPoints(self, ops): """ :type ops: List[str] :rtype: int """ sum = 0 for i in range (len(ops)): op = ops[i] if self.isInt(op): sum = sum + int(op) elif op == 'C': for ...

0.355081

from itertools import compress, product, chain from functools import partial def check(f, s): if f.is_literal(): return f in s elif f.is_and(): return all(check(e, s) for e in f.args) elif f.is_or(): return any(check(e, s) for e in f.args) elif f.is_not(): return not check(f.args[0], s) def get_name(f...

0.35489

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def zigzagLevelOrder(self, root): """ :type root: TreeNode :rtype: List[List[int]] """ ...

0.354578

import re def words_to_object(s): return "[" + re.sub("([^ ]+) ([^ ]+)", r"{name : '\1', id : '\2'},", s).strip(',') + "]"

0.354459

def solve(s, idx): stack = [] for i, c in enumerate(s): if c == '(': stack += [i] if c == ')': if not stack: break if stack.pop() == idx: return i return -1

0.354366

from collections import deque class Solution: def isPrintable(self, targetGrid: List[List[int]]) -> bool: grids = targetGrid num_to_range = dict() for i, row in enumerate(targetGrid): for j, val in enumerate(row): if val not in num_to_range: #...

0.354331

from math import inf class Node: def __init__(self, parent = None, leftExp = None, rightExp = None, signQ = 0): self.parent, self.leftExp, self.rightExp, self.signQ = parent, leftExp, rightExp, signQ def __str__(self): return "Node" memo = {} def Memoize(node, p, maxValue, minValue): if n...

0.353838

import re ADDSUB, MULDIV = '+-', '*$' def calculate(expression): return "400: Bad request" if re.search(r'[^+*$\d.-]', expression) else parseAndEval(expression, ADDSUB) def parseAndEval(expression, ops): v = 0 for op,part in re.findall(r'([{0}])?([^{0}]+)'.format(ops), expression): if not op: ...

0.35357

Given two strings text1 and text2, return the length of their longest common subsequence. A subsequence of a string is a new string generated from the original string with some characters(can be none) deleted without changing the relative order of the remaining characters. (eg, "ace" is a subsequence of "abcde" while "...

class Solution: def longestCommonSubsequence(self, a: str, b: str) -> int: last, current = [0] * (len(b) + 1), [0] * (len(b) + 1) for i in range(len(a) - 1, -1, -1): for j in range(len(b) - 1, -1, -1): if a[i] == b[j]: current[j] = 1 + last[j ...

0.800471

class Solution: def findLength(self, A, B): def check(length): seen = {A[i:i+length] for i in range(len(A) - length + 1)} return any(B[j:j+length] in seen for j in range(len(B) - length + 1)) A = ''.join(map(chr, A)) ...

0.71602

def levenshtein(a,b): d = [[0] * (len(b) + 1) for _ in range(len(a) + 1)] d[0][:] = list(range(len(b)+1)) for i in range(1, len(a) + 1): d[i][0] = i for i, x in enumerate(a): for j, y in enumerate(b): d[i+1][j+1] = min(1 + d[i][j+1], 1 + d[i+1][j], d[i][j] + (1 if x != y el...

0.676969

class Solution: def kSimilarity(self, A: str, B: str) -> int: a = '' b = '' for i in range(len(A)): if A[i] != B[i]: a+=A[i] b+=B[i] return self.dfs(a,b) def dfs(self,a,b): if not a: ...

0.665596

class Solution: def maxUncrossedLines(self, A, B): # Optimization #commons = set(A).intersection(set(B)) # or commons = set(A) & set(B) #A = [x for x in A if x in commons] #B = [x for x in B if x in commons] N1, N2 = len(A), len(B) dp = [[0 for _ in range(N2+1)] for ...

0.664594

def lcs(x, y): if len(x) == 0 or len(y) == 0: return '' if x[-1] == y[-1]: return lcs(x[:-1], y[:-1]) + x[-1] else: lcs1 = lcs(x,y[:-1]) lcs2 = lcs(x[:-1],y) if len(lcs1) > len(lcs2): return lcs1 else: return lcs2

0.655246

for _ in range(eval(input())): S1=input() m1=len(S1)/2 S2=input() m2=len(S2)/2 d1={} d2={} for i in range(len(S1)): c=S1[i] v=abs(m1-i) if c in d1: if v<d1[c][0]: d1[c]=[v,i] else: d1[c]=[v,i] for i in range(len(S2)...

0.654206

from collections import defaultdict as dd def find(a, b): n = len(a) m = len(b) dp = [[0]*(m+1) for i in range(n+1)] for i in range(n-1,-1, -1): for j in range(m-1, -1, -1): if a[i] == b[j]: dp[i][j] = dp[i+1][j+1] + 1 mx = dd(int) ans = 0 for i in range(n-1, -1, -1): for j in range(m-1, -1, -1): ...

0.642932

class Solution: def findLUSlength(self, a, b): """ :type a: str :type b: str :rtype: int """ return max(len(a),len(b)) if a != b else -1

0.632843

def prefix1(a, b): cnt = 0 for i, j in zip(a, b): if i == j: cnt += 1 else: return cnt return cnt def prefix2(a, b, num): for i in range(num, -1, -1): if b.startswith(a[:i]): return i def zfunc(str_): z = [] k = len(str_) for i ...

0.621289

class Solution: def numDistinct(self, s, t): """ :type s: str :type t: str :rtype: int """ setOft=set(t) news="" for ch in s: if ch in setOft: news+=ch dp=[[1 for i in range(len(news)+1)] for j in range(l...

0.605079

import sys input = sys.stdin.readline s = input() t = input() l, r = [0]*len(t), [0]*len(t) li, ri = 0, len(s) - 1 for i in range(len(t)): while s[ li ] != t[ i ]: li += 1 while s[ ri ] != t[ - i - 1 ]: ri -= 1 l[ i ] = li r[ -i -1 ] = ri li += 1 ri -= 1 print( max( [ r[ 0 ], le...

0.604955

import re def buy_newspaper(s1, s2): p = re.sub(r"(.)", r"\1?", s1) return -1 if set(s2) - set(s1) else len(re.findall(p, s2)) - 1

0.603868

from collections import Counter def solve(A,B): a = Counter(A) b = Counter(B) ans = 0 for i in a: if i in b: ans += min(a[i],b[i]) return ans t = int(input()) for _ in range(t): A = input() B = input() print(solve(A,B))

0.601648

s = input() t = input() l, r = [0]*len(t), [0]*len(t) li, ri = 0, len(s) - 1 for i in range(len(t)): while s[ li ] != t[ i ]: li += 1 while s[ ri ] != t[ - i - 1 ]: ri -= 1 l[ i ] = li r[ -i -1 ] = ri li += 1 ri -= 1 print( max( [ r[ 0 ], len(s) - l[ -1 ] - 1 ] + [ max( 0, r[ i ...

0.59899

import sys def dp(s1, s2, i, j, mem): if (i, j) in mem: return mem[(i, j)] elif i >= len(s1) and j >= len(s2): res = '' elif i >= len(s1): res = s2[j:] elif j >= len(s2): res = s1[i:] else: if s1[i] == s2[j]: res = s1[i] + dp(s1, s2, i+1, j+1, mem...

0.597426

def shift_left(a, b): r = len(a) + len(b) for i in range(-1, -min(len(a), len(b)) - 1, -1): if a[i] != b[i]: break r -= 2 return r

0.595302

def maxlen(s1, s2): sm, lg = sorted((s1, s2)) return min(max(lg / 3, sm), lg / 2)

0.59389

def longest(a1, a2): return "".join(sorted(set(a1 + a2)))

0.592634

s = input() t = input() m = 1000 for i in range(len(s) - len(t) + 1): c = 0 for j in range(len(t)): if s[i + j] != t[j]: c += 1 m = min(m, c) print(m)

0.591439

def solve(a, b): if len(a) is 1: return b.count(a) index = [x for x in range(len(b)-1) if b[x] is a[0]] return sum(solve(a[1:], b[x+1:]) for x in index)

0.589724

s = input()[::-1] t = input()[::-1] i = 0 while i < min(len(s),len(t)) and s[i] == t[i]: i += 1 print(len(s) - i + len(t) - i)

0.589692

def check(w, s): j = 0 for i in range(len(s)): while j < len(w) and s[i] != w[j]: j += 1 if j >= len(w) or s[i] != w[j]: return False j += 1 return True n = int(input()) s = input() t = input() st = [] i = 0 while i < n and s[i] == t[i]: st.append(s[i]) ...

0.587337

class Solution: def equalSubstring(self, s: str, t: str, maxCost: int) -> int: dist = [ abs( ord(s[i]) - ord(t[i]) ) for i in range(len(s))] # i = 0 # cur = 0 # res = 0 # for j in range(len(s)): # cur += dist[j] # while cur>maxCost: # ...

0.58616

from collections import Counter def create_anagram(s, t): return sum((Counter(s) - Counter(t)).values())

0.585244

class Solution: def minSteps(self, s: str, t: str) -> int: s_count=[s.count(chr(i)) for i in range(97,123)] t_count=[t.count(chr(i)) for i in range(97,123)] diff=[t_count[i]-s_count[i] for i in range(26) if t_count[i]-s_count[i]>0] sum=0 for i in range(len(diff)): ...

0.582141

def string_constructing(a, s): if len(s) == 0: return 0 i = -1 for j, c in enumerate(s): i = a.find(c, i+1) if i < 0 or i == len(a) - 1: break return len(a) - j + (i < 0) + string_constructing(a, s[j + (i >= 0):])

0.581712

from collections import Counter def solve(a,b): return 0 if Counter(b) - Counter(a) else len(a) - len(b)

0.579613

def main(): a = str(input()) b = str(input()) print(a.count(b)) def __starting_point(): main() __starting_point()

0.576501

class Solution: def getMaxRepetitions(self, s1, n1, s2, n2): """ :type s1: str :type n1: int :type s2: str :type n2: int :rtype: int """ if s2=='aac' and n2==100: return 29999 i,j=0,0 l1=len(s1) l2=len(s...

0.576351

class Solution: def minDeletionSize(self, A: List[str]) -> int: dp = [(1, 1)] * len(A[0]) for i in range(len(dp)): if i > 0: max_pre = None for pre in range(i - 1, -1, -1): for word in A: if word[pre] > word[i]: ...

0.575776

class Solution: def gcdOfStrings(self, str1: str, str2: str) -> str: contender = '' for i in str1: contender += i if str1.count(contender) * len(contender) == len(str1) and str2.count(contender) * len(contender) == len(str2): break orig = contender ...

0.573912

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): print(*args, **kwargs, file=sys.stderr) dprint('debug mode') except ...

0.568794

n = int(input()) for i in range(n): count = 0 k = input() x = list(k) kk = input() y = list(kk) for j in y: for jj in x: if(j==jj): count = count+1 break print(count)

0.566145

for t in range(int(input())): s = input() r = input() diff = list() index = list() cnt = 0 for i in range(len(s)): if s[i] != r[i]: cnt += 1 index.append(i) for i in range(1, len(index)): diff.append(index[i] - index[i - 1] - 1) diff.sort() fmin = cnt ** 2 oper = cnt ; moves = cnt for i in diff: ...

0.566044

class Solution: def longestDecomposition(self, text: str) -> int: n = len(text) splits = 0 leftstart, leftend = 0, 0 rightstart, rightend = n-1, n-1 while leftend<rightstart: if text[leftstart:leftend+1] == text[rightstart:rightend+1]: leftstart = ...

0.563297

# Enter your code here. Read input from STDIN. Print output to STDOUT s=input() ss=input() cnt=0 len_s=len(s) len_ss=len(ss) for i in range(0,len_s): tmp=s[i:i+len_ss] if(tmp==ss): cnt=cnt+1 print(cnt)

0.562766

#scott http://codeforces.com/problemset/problem/265/A new problem RO = input() # darn i don't know how to read string ins = input() #scott n = 0 for x in range (len(ins)): #scott yeah that looks fine #print (x) if ins[x] == RO[n]: n += 1 #scott print(n+1)

0.558252

class Solution: def findLUSlength(self, strs): """ :type strs: List[str] :rtype: int """ def isSubseq(s1, s2): i, m=0, len(s1) for c in s2: if i==m: return True if s1[i]==c: i+=1 return i==m ...

0.553057

# AC import sys sys.setrecursionlimit(1000000) class Main: def __init__(self): self.buff = None self.index = 0 def __next__(self): if self.buff is None or self.index == len(self.buff): self.buff = self.next_line() self.index = 0 val = self.buff[self.ind...

0.552637

def count_subsequences(needle, haystack): count = [1] + [0] * len(needle) for a in haystack: count = [1] + [count[i] + count[i-1] * (a == b) for i, b in enumerate(needle, 1)] return count[-1] % 10 ** 8

0.550463

class Solution: def lengthOfLongestSubstring(self, s): """ :type s: str :rtype: int """ L, res, last = -1, 0, {} for R, char in enumerate(s): if char in last and last[char] > L: L = last[char] elif R-L > res: ...

0.545062

def string_cnt(s): try: if s.isalpha(): return sum(ord(a) for a in s.upper()) except AttributeError: pass return 0 def compare(s1, s2): return string_cnt(s1) == string_cnt(s2)

0.535987

s = list(input()) t = list(input()) cnt = 0 for i in range(3): if s[i] == t[i]: cnt += 1 print(cnt)

0.535415

class Solution: def largestOverlap(self, A, B) -> int: leng = len(A[0]) # convert A, B to binary a = 0 b = 0 for i in range(0, leng * leng): row = int(i % leng) col = int(i / leng) a = (a << 1) + A[col][row] b = (b << 1) + B[co...

0.534845

class Solution: def strStr(self, haystack, needle): """ :type haystack: str :type needle: str :rtype: int """ if haystack == "" and needle == "": return 0 if needle == "": return 0 if haystack == "" or needle == "" or...

0.526334

class Solution: def countSubstrings(self, s): """ :type s: str :rtype: int """ ret = 0 left, right = 0, 0 while left < len(s): while right < len(s) and s[right] == s[left]: right += 1 ret += self.sum(right - l...

0.526305

from collections import * import itertools import sys def main(): a, b = input().split() ans = a + b n = len(a) m = len(b) for i in range(1, n + 1): for j in range(1, m + 1): c = a[:i] + b[:j] # print(c) ans = min(ans, c) print(ans) main()

0.526182

from math import ceil n = int(input()) word1 = input() word2 = input() combined = [] for i in range(ceil(n / 2)): if i > n / 2 - 1: combined.append([word1[i], word2[i]]) else: combined.append([word1[i], word1[- i - 1], word2[i], word2[- i - 1]]) count = 0 for l in combined: s = set(l) ...

0.525221

class Solution: def maxPower(self, s: str) -> int: n = len(s) count = 0 res = s[0] cur_count = 1 # Traverse string except # last character for i in range(n): # If current character # matches with next ...

0.524879

def hamming_distance(a, b): return sum(c != d for c, d in zip(a, b))

0.523957

s = input() pole = input() t = 0 count = 0 for i in range(len(pole)): if pole[i] == s[t]: t += 1 if t == len(s): break count += 1 t -= 1 for i in range(len(pole) - 1, -1, -1): if pole[i] == s[t]: t -= 1 if t == -1: count1 = i break if count1 - count > 0: p...

0.523376

def combs(a, b): return min(mesh(a, b), mesh(b, a)) def mesh(a, b): for i in range(len(a)): for j, k in zip(a[i:], b): if j + k == '**': break else: return max(i + len(b), len(a)) return len(a) + len(b)

0.523123

class Solution: def repeatedStringMatch(self, A, B): """ :type A: str :type B: str :rtype: int """ if not set(B).issubset(set(A)): return -1 max_rep = len(B) // len(A) + 3 A_new = A for i in ...

0.51939

import sys def input(): return sys.stdin.readline()[:-1] from bisect import bisect def ctoi(c): return ord(c) - ord("a") print(ans) T = int(input()) for _ in range(T): s = input() t = input() if not (set(s) >= set(t)): print(-1) else: alph = [[] for _ in range(26)] for i in range(len(s)): alph[ctoi(s[...

0.519227

class Solution: def minWindow(self, s, t): """ :type s: str :type t: str :rtype: str """ left=-1 right = 0 result = "" totalMatch = 0 d = {} for c in t: d[c] = d.get(c, 0) + 1 for right in ran...

0.517889

class Solution: def ladderLength(self, beginWord, endWord, wordList): wordDict = set(wordList) if not endWord in wordDict: return 0 visited = set() beginSet = set() beginSet.add(beginWord) visited.add(beginWord) endSet = set() ...

0.516883

def ii(): return int(input()) def mi(): return list(map(int, input().split())) def li(): return list(mi()) # B. The Fair Nut and Strings n, k = mi() s = input().strip() t = input().strip() ans = 0 jj = 0 for i in range(n): if s[i] == t[i]: ans += 1 jj = i + 1 else: break c...

0.515635

class Solution: def checkInclusion(self, s1, s2): """ :type s1: str :type s2: str :rtype: bool """ if len(s2) < len(s1): return False c1 = [0] * 128 n = 0 for i in s1: c = ord(i) if c1[c] == 0: n...

0.515433

# class Solution: # def distinctEchoSubstrings(self, text: str) -> int: # ans = set() # for i in range(len(text)-1): # for j in range(i+1, (i+len(text))//2+1): # if text[i:j] == text[j:2*j-i]: ans.add(text[i:j]) # return len(ans) from collectio...

0.514484

S = input() T = input() base = 998244353 dp = [[0 for _ in range(len(S) + 1)] for _ in range(len(S) + 1)] for j in range(1, len(S) + 1): if (j > len(T)) or (S[0] == T[j - 1]): dp[1][j] = 2 for i in range(2, len(S) + 1): for j in range(1, len(S) - i + 1 + 1): if (j > len(T)) or (S[i - 1] == T[j -...

0.512369

S = input() T = input() tigau = 0 for i in range(len(S)): if S[i] != T[i]: tigau += 1 print(tigau)

0.510827

class Solution: def longestStrChain(self, words: List[str]) -> int: by_length = collections.defaultdict(set) for word in words: by_length[len(word)].add(word) longest = 1 seen = {*()} mx = len(by_length) mn = min(by_length) for length in sorted(b...

0.508115

from functools import lru_cache def failure(pat): i, target, n = 1, 0, len(pat) res = [0] while i < n: if pat[i] == pat[target]: target += 1 res.append(target) i+=1 elif target: target = res[target-1] else: res.append(0) ...

0.507456

class Solution: def countCharacters(self, words: List[str], chars: str) -> int: d={} for i in chars: if i in d: d[i]+=1 else: d[i]=1 l=0 for i in words: flag = True for j in i: if j in d: ...

0.507347

s, p = input(), input() n, m = len(s) + 1, len(p) d = [[0] * n for t in range(n)] for x in range(1, n): i, j = x, m while i and j: j -= s[i - 1] == p[j - 1] i -= 1 if not j: for y in range(i + 1): d[x][y + x - i - m] = d[i][y] + 1 for y in range(x): d[x][y] = max(d[x][y], d[x - 1...

0.506696

from os.path import commonprefix def string_suffix(s): return sum(len(commonprefix([s, s[i:]])) for i in range(len(s)))

0.506495

from collections import Counter class Solution: def checkIfCanBreak(self, s1: str, s2: str) -> bool: d1, d2 = Counter(s1), Counter(s2) return self.check(d1, d2) or self.check(d2, d1) def check(self, d1: dict, d2: dict) -> bool: s = 0 for c in 'abcdefghijklmnopqrstuvwxyz'...

0.505805

# cook your dish here try: a,b,da=list(input()),input(),list(map(int,input().split())) print(len(a)-len(b)) except: pass

0.504361

def folding(a,b): squares = 1 while a != b: squares += 1 b, a = sorted((a - b, b)) return squares

0.502284

def num(c): return ord(c) - 97 import sys input = sys.stdin.readline t = int(input()) for _ in range(t): n = int(input()) s1 = input().strip() s2 = input().strip() char1 = [0] * 26 char2 = [0] * 26 for c in s1: char1[num(c)] += 1 for c in s2: char2[num(c)] += 1 if ...

0.500255

import sys import math import bisect import heapq import collections S = input() T = input() lenS = len(S) lenT = len(T) F1 = [False]*26 F2 = [False]*26 alpha = 'abcdefghijklmnopqrstuvwxyz' for i in range(lenS): F1[alpha.index(S[i])] = True for i in range(lenT): F2[alpha.index(T[i])] = True for i in range(26):...

0.499238

#!/usr/bin/env python3 a = input() b = input() sumi = 0 for i in range(len(b) - len(a) + 1): if b[i] == '1': sumi += 1 lowest = 0 highest = len(b) - len(a) + 1 total = 0 for i in range(len(a)): if a[i] == '0': total += sumi else: total += highest - lowest - sumi if b[lowest]...

0.497528

import sys a = input() b = input() if a != b: print(max(len(a), len(b))) else: print(-1)

0.496973

def solution(s): st=[1 for i in range(1,len(s)) if s[i-1]==s[i]] return sum(st)

0.496382

n = input().rstrip() m = input().rstrip() cnt1 = [0] * 26 cnt2 = [0] * 26 for i in n: cnt1[ord(i) - ord("a")] += 1 for i in m: cnt2[ord(i) - ord("a")] += 1 res = 0 for i in range(26): a1 = cnt1[i] a2 = cnt2[i] if a1 == 0 and a2 != 0: print(-1) return res += min(a1, a2) print(res)

0.495931

class Solution: def maxLength(self, arr: List[str]) -> int: def digit_representation(s): ans = 0 for c in s: ans |= 1<<(ord(c)-ord('a')) return ans A = sorted([(len(s), digit_representation(s)) for s in set(arr) if len(set(s))==len(s)], re...

0.495565

class Solution: def longestDupSubstring(self, S): nums, N = [ord(c) - ord('a') for c in S], len(S) BASE, MOD = 26, 2**32 def check(L): cur_hash, seen = 0, set() for val in nums[:L]: cur_hash = (cur_hash * BASE + val) % MOD seen.add(cur_hash...

0.493219

def codn1(s1,s2,p): c=0 ind=0 for i in range(len(s1)): if s1[i]!=s2[i]: c+=1 ind=i if c>1 or ind==len(s1)-1: return 0 if s1[ind]>s2[ind] and s1[ind] in s2[ind+1:]: p[0]=True if s1[ind]<s2[ind] and s2[ind] in s1[ind+1:]: p[1]=True return 1 def codn2(s1,s2): if len(s1)<len(s2): ...

0.491355

def shortest_to_char(s, c): if not s or not c: return [] indexes = [i for i, ch in enumerate(s) if ch == c] if not indexes: return [] return [ min(abs(i - ic) for ic in indexes) for i in range(len(s)) ]

0.489965

from collections import * def go(): n,s,t=int(input()),input(),input() if Counter(s)!=Counter(t): return -1 ans=0 for i in range(n): k=0 for j in range(i,n): while k<n and s[k] != t[j]: k += 1 if k == n: break k += 1 ans = max(ans, j-i+1) return n-ans for _ in range(int(input())): print(go())

0.489765

class Solution: def isSubsequence(self, s, t): """ :type s: str :type t: str :rtype: bool """ if len(s) > len(t): return False for i in s: if i in t: index = t.find(i) t = t[index + 1:] ...

0.489502

def count_correct_characters(c, g): if len(c) != len(g): raise Exception('Error') return sum(1 for i,j in zip(c,g) if i==j)

0.489032

class Solution: def isIsomorphic(self, s1, s2): return len(set(zip(s1, s2))) == len(set(s1)) == len(set(s2))

0.487182

import sys input = lambda: sys.stdin.readline().rstrip() T = int(input()) for _ in range(T): N = int(input()) A = [ord(a) - 97 for a in input()] B = [ord(a) - 97 for a in input()] X = [[0] * 20 for _ in range(20)] for a, b in zip(A, B): X[a][b] = 1 if a > b: print(-1) ...

0.48658

n=int(input()) l1=list(map(int,input().split())) l2=list(map(int,input().split())) fined=0 i=0 j=0 d1={} while i<n and j<n: if l1[i] in d1: i+=1 continue if l1[i]==l2[j]: i+=1 j+=1 else : while j<n and l2[j]!=l1[i]: d1[l2[j]]=1 j+=1 ...

0.486115

class Solution: def longestSubstring(self, s, k): """ :type s: str :type k: int :rtype: int """ for c in set(s): if s.count(c) < k: return max(self.longestSubstring(sp, k) for sp in s.split(c)) return len(s)

0.486047

# cook your dish here n=int(input()) l=[] for i in range(n): l.append(input()) m=int(input()) s=input() c=0 res=[s[i:j] for i in range(len(s)) for j in range(i+1,len(s)+1)] res=list(dict.fromkeys(res)) for i in res: if i in l: c=c+1 print(c)

0.486

def base_finder(seq): return len(set(''.join(seq)))

0.485893

def solve(st): return next((n for n in range(len(st)//2, 0, -1) if st[:n] == st[-n:]), 0)

0.484153

import sys input = sys.stdin.readline sys.setrecursionlimit(10 ** 7) import numpy as np # 適当な素数と原始根でrolling hash MOD = 10 ** 9 + 993 base = 123450 S = np.array([ord(x) for x in input().rstrip()],dtype=np.int64) T = np.array([ord(x) for x in input().rstrip()],dtype=np.int64) # Sの方が長くする LS = len(S) LT = len(T) n = (L...

0.48403

class Solution: def flipgame(self, fronts: List[int], backs: List[int]) -> int: w = set(fronts[i] for i in range(len(fronts)) if fronts[i] == backs[i]) x = set() for a in fronts: if a not in w: x.add(a) for a in backs: if a not in w: ...

0.484012

class Solution: def minCost(self, s: str, cost: List[int]) -> int: delete_cost = 0 last = 0 for i in range(1, len(s)): if s[last] == s[i]: if cost[last] < cost[i]: delete_cost += cost[last] last = i else: ...

0.483543

class Solution: def maxRepOpt1(self, text: str) -> int: letters = {} for i, char in enumerate(text): if char in letters: letters[char].append(i) else: letters[char] = [i] if len(letters) == 1: return len(text) ...

0.483161

class Solution: def maxScore(self, s: str) -> int: maxi=0 for i in range(1,len(s)): a=s[:i] b=s[i:] maxi=max(a.count('0')+b.count('1'),maxi) return maxi

0.482356

class Solution: def longestPrefix(self, strn: str) -> str: max_prefs = [0]*len(strn) curr = 0 for idx in range(1, len(strn)): while True: if curr == 0: if strn[idx] == strn[0]: curr = 1 max_prefs[idx...

0.481783

from collections import Counter def added_char(s1, s2): return next((Counter(s2) - Counter(s1)).elements())

0.480978

# import sys # sys.stdin = open('in.txt', 'r') _ = input() s = input() t = input() par = [i for i in range(26)] def find(x): if par[x] != x: par[x] = find(par[x]) return par[x] else: return x for i in range(len(s)): a, b = find(ord(s[i])-97), find(ord(t[i])-97) if a != b: ...

0.480542

from sys import stdin,stdout # stdout = open('output.txt', 'w+') # stdin = open('input.txt','r+') from collections import Counter def prefixsuffixmatch(s): pi_table=[0 for i in range(len(s))] for i in range(1,len(s)): y=pi_table[i-1] while s[i]!=s[y] and y!=0: y=pi_table[y-1] if s[i]==s[y]: y+=1 pi_ta...

0.477827

from bisect import bisect HISENTINEL = 10**9 + 1 LOSENTINEL = -HISENTINEL def main(): length = int(input()) a = [int(fld) for fld in input().strip().split()] b = [int(fld) for fld in input().strip().split()] print(countmaxminsubseq(a, b)) def countmaxminsubseq(a, b): leq, lgt = getleftbounds(...

0.477803

class Solution: def getHint(self, secret, guess): """ :type secret: str :type guess: str :rtype: str """ s_count = collections.defaultdict(int) g_count = collections.defaultdict(int) bull_cnt = 0 # first iteration can get bull_cnt imm...

0.47663

Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length ~= 500,000) string, and s is a short string ( A subsequence of a string is a new string which is formed from the original string by del...

class Solution: def isSubsequence(self, s, t): """ :type s: str :type t: str :rtype: bool """ if len(s) > len(t): return False for i in s: if i in t: index = t.find(i) t = t[index + 1:] ...

0.825562

class Solution: def checkInclusion(self, s1, s2): """ :type s1: str :type s2: str :rtype: bool """ if len(s2) < len(s1): return False c1 = [0] * 128 n = 0 for i in s1: c = ord(i) if c1[c] == 0: n...

0.642762

def substring_test(first, second): first = first.lower() second = second.lower() for i in range(len(first) - 2): if first[i:i+2] in second: return True return False

0.626268

class Solution: def numDistinct(self, s, t): """ :type s: str :type t: str :rtype: int """ setOft=set(t) news="" for ch in s: if ch in setOft: news+=ch dp=[[1 for i in range(len(news)+1)] for j in range(l...

0.622351

def scramble(s1,s2): for c in set(s2): if s1.count(c) < s2.count(c): return False return True

0.591946

class Solution: def minWindow(self, s, t): """ :type s: str :type t: str :rtype: str """ left=-1 right = 0 result = "" totalMatch = 0 d = {} for c in t: d[c] = d.get(c, 0) + 1 for right in ran...

0.58463

def has_subpattern(string): return (string * 2).find(string, 1) != len(string)

0.579938

class Solution: def isAnagram(self, s, t): """ :type s: str :type t: str :rtype: bool """ # dic = {} # for item in s: # if item not in dic: # dic[item] = 1 # else: # dic[item] += 1 # ...

0.57909

def is_substitution_cipher(s1, s2): return len(set(s1)) == len(set(s2)) == len(set(zip(s1, s2)))

0.576855

def check_DNA(seq1, seq2): if len(seq1) < len(seq2): seq1, seq2 = seq2, seq1 seq2 = seq2[::-1].replace('C','g').replace('G','c').replace('T','a').replace('A','t').upper() return seq1.find(seq2) >= 0

0.57022

from collections import Counter from functools import reduce from math import gcd def has_subpattern(string): return reduce(gcd, Counter(string).values()) != 1

0.563873

def count_subsequences(needle, haystack): count = [1] + [0] * len(needle) for a in haystack: count = [1] + [count[i] + count[i-1] * (a == b) for i, b in enumerate(needle, 1)] return count[-1] % 10 ** 8

0.5612

class Solution: def isScramble(self, A, B): if len(A) != len(B) or sorted(A) != sorted(B): return False if len(A) == 1 or A == B: return True for i in range(1, len(A)): if self.isScramble(A[:i], B[:i]) and self.isScramble(A[i:], B[i:]): ...

0.560207

class MagicDictionary: def __init__(self): """ Initialize your data structure here. """ self.l = [] def buildDict(self, dict): """ Build a dictionary through a list of words :type dict: List[str] :rtype: void """ sel...

0.556062

from collections import Counter def create_anagram(s, t): return sum((Counter(s) - Counter(t)).values())

0.555932

def is_thue_morse(seq): init_seq = [0] while len(init_seq) < len(seq): init_seq += [1 if n == 0 else 0 for n in init_seq] return init_seq[:len(seq)] == seq

0.555374

def prefix1(a, b): cnt = 0 for i, j in zip(a, b): if i == j: cnt += 1 else: return cnt return cnt def prefix2(a, b, num): for i in range(num, -1, -1): if b.startswith(a[:i]): return i def zfunc(str_): z = [] k = len(str_) for i ...

0.554267

def solve(a, b): if len(a) is 1: return b.count(a) index = [x for x in range(len(b)-1) if b[x] is a[0]] return sum(solve(a[1:], b[x+1:]) for x in index)

0.548627

def string_constructing(a, s): if len(s) == 0: return 0 i = -1 for j, c in enumerate(s): i = a.find(c, i+1) if i < 0 or i == len(a) - 1: break return len(a) - j + (i < 0) + string_constructing(a, s[j + (i >= 0):])

0.547738

class Solution: def repeatedSubstringPattern(self, s): return s in (s + s)[1:-1]

0.546566

class Solution: def findLength(self, A, B): def check(length): seen = {A[i:i+length] for i in range(len(A) - length + 1)} return any(B[j:j+length] in seen for j in range(len(B) - length + 1)) A = ''.join(map(chr, A)) ...

0.535406

def substring(s): r, rm = [], [] for i, x in enumerate(s): if x in r or len(set(r)) < 2: r += x; else: if len(r) > len(rm): rm = r[:] r = [y for y in r[-1::-1] if y == r[-1]] + [x] if len(r) > len(rm): rm = r[:] return ''.join(rm)

0.532101

import re def buy_newspaper(s1, s2): p = re.sub(r"(.)", r"\1?", s1) return -1 if set(s2) - set(s1) else len(re.findall(p, s2)) - 1

0.529644

class Solution: def repeatedStringMatch(self, A, B): """ :type A: str :type B: str :rtype: int """ if not set(B).issubset(set(A)): return -1 max_rep = len(B) // len(A) + 3 A_new = A for i in ...

0.529632

from collections import Counter class Solution: def checkIfCanBreak(self, s1: str, s2: str) -> bool: d1, d2 = Counter(s1), Counter(s2) return self.check(d1, d2) or self.check(d2, d1) def check(self, d1: dict, d2: dict) -> bool: s = 0 for c in 'abcdefghijklmnopqrstuvwxyz'...

0.529016

class Solution: def canConvertString(self, s: str, t: str, k: int) -> bool: if len(s) != len(t): return False c = Counter((ord(c2) - ord(c1)) % 26 for c1, c2 in zip(s, t)) return k >= max( (m + 26 * (count - 1) for m, count in list(c.items()) if m), ...

0.527307

def solve(st): return all(True if ord(x) - ord(y) in [-2, 0, 2] else False for x, y in zip(st, st[::-1]))

0.526079

from fnmatch import fnmatch def solve(a, b): return fnmatch(b, a)

0.525964

def code_for_same_protein(seq1,seq2): if seq1 == seq2: return True lista = [['GCT','GCC','GCA','GCG'],['CGT','CGC','CGA','CGG','AGA','AGG'],['AAT','AAC'],['GAT','GAC'],['AAT','AAC','GAT','GAC'],['TGT','TGC'],['CAA','CAG'],['GAA','GAG'],['CAA','CAG','GAA','GAG'],['GGT','GGC','GGA','GGG'],['CAT','CAC'],['...

0.524564

def step_through_with(s): return any(m == n for m, n in zip(s, s[1:]))

0.523677

def shifted_diff(first, second): return (second + second).find(first) if len(first) == len(second) else - 1;

0.522213

# Enter your code here. Read input from STDIN. Print output to STDOUT s=input() ss=input() cnt=0 len_s=len(s) len_ss=len(ss) for i in range(0,len_s): tmp=s[i:i+len_ss] if(tmp==ss): cnt=cnt+1 print(cnt)

0.520936

class Solution: def longestCommonSubsequence(self, a: str, b: str) -> int: last, current = [0] * (len(b) + 1), [0] * (len(b) + 1) for i in range(len(a) - 1, -1, -1): for j in range(len(b) - 1, -1, -1): if a[i] == b[j]: current[j] = 1 + last[j ...

0.520394

class Solution: def isLongPressedName(self, name: str, typed: str) -> bool: name=list(name) typed= list(typed) while name: i, j=0,0 n=name[0] while name and name[0]==n: i+=1 name.pop(0) while typed and t...

0.519701

class Solution: def hasAllCodes(self, s: str, k: int) -> bool: if len(s) < 2 ** k + k - 1: return False # Cannot be a string, as this is the de brujin length target = 2 ** k seen = set() cur_len = 0 for end in range(k, len(s) + 1): chunk = s[end - k: e...

0.519361

from collections import Counter def added_char(s1, s2): return next((Counter(s2) - Counter(s1)).elements())

0.51822

from collections import Counter from functools import reduce from fractions import gcd def has_subpattern(s): c = Counter(s) m = reduce(gcd, c.values()) return ''.join(sorted(k*(v//m) for k,v in c.items()))

0.516102

class Solution: def isIsomorphic(self, s1, s2): return len(set(zip(s1, s2))) == len(set(s1)) == len(set(s2))

0.51506

class Solution: def strStr(self, haystack, needle): """ :type haystack: str :type needle: str :rtype: int """ if haystack == "" and needle == "": return 0 if needle == "": return 0 if haystack == "" or needle == "" or...

0.513722

class Solution: def isInterleave(self, s1, s2, s3): """ :type s1: str :type s2: str :type s3: str :rtype: bool """ if len(s3) != len(s1) + len(s2): return False if not s1 or not s2: return (s1 or s2) == s3 op...

0.511404

class Solution(object): def findSubstring(self, s, words): """ :type s: str :type words: List[str] :rtype: List[int] """ if not s or words==[]: return [] lenstr=len(s) lenword=len(words[0]) lensubstr=len(words)*lenword ...

0.510746

def lcs(x, y): if len(x) == 0 or len(y) == 0: return '' if x[-1] == y[-1]: return lcs(x[:-1], y[:-1]) + x[-1] else: lcs1 = lcs(x,y[:-1]) lcs2 = lcs(x[:-1],y) if len(lcs1) > len(lcs2): return lcs1 else: return lcs2

0.508001

import sys def dp(s1, s2, i, j, mem): if (i, j) in mem: return mem[(i, j)] elif i >= len(s1) and j >= len(s2): res = '' elif i >= len(s1): res = s2[j:] elif j >= len(s2): res = s1[i:] else: if s1[i] == s2[j]: res = s1[i] + dp(s1, s2, i+1, j+1, mem...

0.506047

def are_similar(a, b): return sorted(a) == sorted(b) and sum(i != j for i, j in zip(a, b)) in [0, 2]

0.505335

class Solution: def minSteps(self, s: str, t: str) -> int: s_count=[s.count(chr(i)) for i in range(97,123)] t_count=[t.count(chr(i)) for i in range(97,123)] diff=[t_count[i]-s_count[i] for i in range(26) if t_count[i]-s_count[i]>0] sum=0 for i in range(len(diff)): ...

0.504452

class Solution: def canConstruct(self, ransomNote, magazine): """ :type ransomNote: str :type magazine: str :rtype: bool """ ransome = set(ransomNote) for i in ransome: if ransomNote.count(i) > magazine.count(i): return Fa...

0.504284

def trouble(x, t): arr = [x[0]] for c in x[1:]: if c + arr[-1] != t: arr.append(c) return arr

0.501801

def solution(s): st=[1 for i in range(1,len(s)) if s[i-1]==s[i]] return sum(st)

0.500104

def string_cnt(s): try: if s.isalpha(): return sum(ord(a) for a in s.upper()) except AttributeError: pass return 0 def compare(s1, s2): return string_cnt(s1) == string_cnt(s2)

0.499647

def letter_check(arr): return set(arr[1].lower()) <= set(arr[0].lower())

0.49816

def main(): a = str(input()) b = str(input()) print(a.count(b)) def __starting_point(): main() __starting_point()

0.496584

def could_be(original, another): if not another.strip(): return False return all(name in original.split() for name in another.split())

0.495933

def is_anagram(test, original): return sorted(original.lower()) == sorted(test.lower())

0.495769

def word_problem(rules: List[Tuple[str, str]], from_str: str, to_str: str, applications: int) -> bool: rec = lambda s,n: s == to_str or n and any(s[i:].startswith(x) and rec(s[:i] + y + s[i+len(x):], n-1) for i in range(len(s)) for x,y in rules) return rec(from_str, applications)

0.494508

def levenshtein(a,b): d = [[0] * (len(b) + 1) for _ in range(len(a) + 1)] d[0][:] = list(range(len(b)+1)) for i in range(1, len(a) + 1): d[i][0] = i for i, x in enumerate(a): for j, y in enumerate(b): d[i+1][j+1] = min(1 + d[i][j+1], 1 + d[i+1][j], d[i][j] + (1 if x != y el...

0.492414

class Solution: def wordBreak(self, s, wordDict): n = len(s) dp = [False for i in range(n+1)] dp[0] = True for i in range(1,n+1): for w in wordDict: if dp[i-len(w)] and s[i-len(w):i]==w: dp[i]=True return dp[-1]

0.490495

def alphabetic(s): return sorted(s) == list(s)

0.490349

class Solution: def findTheDifference(self, s, t): """ :type s: str :type t: str :rtype: str """ sums=sum([ord(i) for i in s]), sum([ord(i) for i in t]) return chr(sum([ord(i) for i in t])-sum([ord(i) for i in s]))

0.490175

class Solution: def countSubstrings(self, s): """ :type s: str :rtype: int """ ret = 0 left, right = 0, 0 while left < len(s): while right < len(s) and s[right] == s[left]: right += 1 ret += self.sum(right - l...

0.489983

class StreamChecker: def __init__(self, words: List[str]): #reverse trie self.trie = {} self.stream = deque([]) for word in set(words): node = self.trie for ch in word[::-1]: if not ch in node: node[ch] = {} ...

0.488197

def check(w, s): j = 0 for i in range(len(s)): while j < len(w) and s[i] != w[j]: j += 1 if j >= len(w) or s[i] != w[j]: return False j += 1 return True n = int(input()) s = input() t = input() st = [] i = 0 while i < n and s[i] == t[i]: st.append(s[i]) ...

0.487206

def spot_diff(s1, s2): return [i for i in range(len(s1)) if s1[i] != s2[i]]

0.485975

def isomorph(a, b): return [a.index(x) for x in a] == [b.index(y) for y in b]

0.485251

class Solution: def equalSubstring(self, s: str, t: str, maxCost: int) -> int: dist = [ abs( ord(s[i]) - ord(t[i]) ) for i in range(len(s))] # i = 0 # cur = 0 # res = 0 # for j in range(len(s)): # cur += dist[j] # while cur>maxCost: # ...

0.485034

def find_nth_occurrence(substring, string, occurrence=1): idx = -1 for i in range(occurrence): idx = string.find(substring, idx + 1) if idx == -1: return -1 return idx

0.484335

def shortest_to_char(s, c): if not s or not c: return [] indexes = [i for i, ch in enumerate(s) if ch == c] if not indexes: return [] return [ min(abs(i - ic) for ic in indexes) for i in range(len(s)) ]

0.480656

def main(): import sys n, t, s1, s2 = sys.stdin.read().split() n, t = int(n), int(t) result = [-1] * n rest = n - t for i in range(n): if rest == 0: break if s1[i] == s2[i]: result[i] = s1[i] rest -= 1 k = rest for i in range(n): ...

0.479092

def locate(seq, value): for s in seq: if s == value or (isinstance(s,list) and locate(s, value)): return True return False

0.477918

class Solution: def backspaceCompare(self, S1, S2): i1 = len(S1) - 1 i2 = len(S2) - 1 while i1 >= 0 or i2 >= 0: c1 = '' c2 = '' if i1 >= 0: c1, i1 = self.getChar(S1, i1) if i2 >= 0: c2, i2 = self.getCha...

0.477433

class Solution(object): def isSubPath(self, h, r0): h_vals = [] while h: h_vals.append(str(h.val)) h = h.next h_str = ('-'.join(h_vals)) + '-' # serialized list st = [(r0, '-')] # DFS stack while st: r, pre = st.pop() if not...

0.476343

from collections import * def go(): n,s,t=int(input()),input(),input() if Counter(s)!=Counter(t): return -1 ans=0 for i in range(n): k=0 for j in range(i,n): while k<n and s[k] != t[j]: k += 1 if k == n: break k += 1 ans = max(ans, j-i+1) return n-ans for _ in range(int(input())): print(go())

0.476216

class Solution: def buddyStrings(self, A: str, B: str) -> bool: if len(A)!=len(B): return False if len(A)<2: return False if A==B: cnt = Counter(A) return bool([v for v in cnt.values() if v>1]) diffs = [] for i, a in enumerate(A...

0.475089

import string def solve(st): return ''.join(sorted(st)) in string.ascii_letters

0.47412

def count_correct_characters(c, g): if len(c) != len(g): raise Exception('Error') return sum(1 for i,j in zip(c,g) if i==j)

0.47405

class Solution: def findLUSlength(self, strs): """ :type strs: List[str] :rtype: int """ def isSubseq(s1, s2): i, m=0, len(s1) for c in s2: if i==m: return True if s1[i]==c: i+=1 return i==m ...

0.474023

def prime_string(s): return (s + s).find(s, 1) == len(s)

0.473301

class Solution: cache = {} def isMatch(self, s, p): """ :type s: str :type p: str :rtype: bool """ if (s, p) in self.cache: return self.cache[(s, p)] if not p: return not s if p[-1] == '*': if self...

0.47325

import sys def input(): return sys.stdin.readline()[:-1] from bisect import bisect def ctoi(c): return ord(c) - ord("a") print(ans) T = int(input()) for _ in range(T): s = input() t = input() if not (set(s) >= set(t)): print(-1) else: alph = [[] for _ in range(26)] for i in range(len(s)): alph[ctoi(s[...

0.473033

class Solution: def kSimilarity(self, A: str, B: str) -> int: a = '' b = '' for i in range(len(A)): if A[i] != B[i]: a+=A[i] b+=B[i] return self.dfs(a,b) def dfs(self,a,b): if not a: ...

0.472471

''' \"aabcaca\" 0123456 x devide conquer 先找到第一个stamp把string分成左右两部分（必须要）（On 然后从长到短用stamp的头match左边的部分，直到match到最头如果不能到最头则退出从长到短用stamp的尾巴match右边，直到match到尾巴，如果不能match到最尾巴则继续找下一个stamp 能把他分成左右这时的左边有个offset了，比如****b** offset是3，只要stamp的长度不超过头且能match上，就可以这个解法可以有nwin*M^2 其中m平方是在用stamp去match的时候最坏能从stamp最长match到1 可以给出最短...

0.470912

import sys import math import bisect import heapq import collections S = input() T = input() lenS = len(S) lenT = len(T) F1 = [False]*26 F2 = [False]*26 alpha = 'abcdefghijklmnopqrstuvwxyz' for i in range(lenS): F1[alpha.index(S[i])] = True for i in range(lenT): F2[alpha.index(T[i])] = True for i in range(26):...

0.469919

def solve(a,b): return [a.count(e) for e in b]

0.469209

class Solution: def isMatch(self, s, p): """ :type s: str :type p: str :rtype: bool """ '''维护两个下标，逐个比较，如果pj为*，则记录*的位置，将*后一个元素与si进行比较，如果不相等，则将i从记录的位置+1，重新比较''' i=0 j=0 star=-1 lenp=len(p) while i<len(s): ...

0.469171

class Solution: def longestSubstring(self, s, k): """ :type s: str :type k: int :rtype: int """ for c in set(s): if s.count(c) < k: return max(self.longestSubstring(sp, k) for sp in s.split(c)) return len(s)

0.468506

def is_in_middle(s): while len(s)>4: s = s[1:-1] return 'abc' in s

0.467709

def main(): T = int(input().strip()) for _ in range(T): s = input().strip() t = input().strip() n = len(s) find = [[n] * 26 for _ in range(n + 2)] for i in range(n - 1, -1, -1): find[i][:] = find[i + 1] find[i][ord(s[i]) - ord("a")] = i ...

0.467132

class Solution: def getMaxRepetitions(self, s1, n1, s2, n2): """ :type s1: str :type n1: int :type s2: str :type n2: int :rtype: int """ if s2=='aac' and n2==100: return 29999 i,j=0,0 l1=len(s1) l2=len(s...

0.466879

class Solution: def getHint(self, secret, guess): """ :type secret: str :type guess: str :rtype: str """ s_count = collections.defaultdict(int) g_count = collections.defaultdict(int) bull_cnt = 0 # first iteration can get bull_cnt imm...

0.465372

def same(arr_a, arr_b): return sorted(map(sorted, arr_a)) == sorted(map(sorted, arr_b))

0.465215

def check(a, x): return x in a

0.464812

from os.path import commonprefix def string_suffix(s): return sum(len(commonprefix([s, s[i:]])) for i in range(len(s)))

0.464405

def similarity(a, b): try: return len(set(a) & set(b)) / len(set(a) | set(b)) except: return 0

0.464273

starts_with = str.startswith

0.464212

class Solution: def validPalindrome(self, s): """ :type s: str :rtype: bool """ if s == s[::-1]: return True r = s[::-1] for i in range(0, len(s)): if r[i] == s[i]: continue else: ...

0.464018

def solved(s): if len(s)&1: s = s[:len(s)//2]+s[len(s)//2+1:] return ''.join(sorted(s))

0.462231

import re def search_substr(full_text, search_text, allow_overlap=True): if not full_text or not search_text: return 0 return len(re.findall(f'(?=({search_text}))' if allow_overlap else search_text, full_text))

0.460211

def word_pattern(pattern, string): x = list(pattern) y = string.split(" ") return (len(x) == len(y) and len(set(x)) == len(set(y)) == len(set(zip(x, y))) )

0.459437

def solve(st,k): for l in sorted(st)[:k]: st=st.replace(l,'',1) return st

0.459405

def diffs(bird1, bird2): return sum(c1 != c2 for c1, c2 in zip(bird1, bird2)) def child(bird1, bird2): return diffs(bird1, bird2) in [1, 2] def grandchild(bird1, bird2): return diffs(bird1, bird2) in [0, 1, 2, 3, 4] if len(bird1) > 1 else bird1 == bird2

0.458938

class Solution: def isValid(self, s: str) -> bool: if not s: return True return self.isValid(s.replace('abc', '')) if s.replace('abc', '') != s else False

0.458415

def shift_left(a, b): r = len(a) + len(b) for i in range(-1, -min(len(a), len(b)) - 1, -1): if a[i] != b[i]: break r -= 2 return r

0.457971

Given a string num representing the digits of a very large integer and an integer k. You are allowed to swap any two adjacent digits of the integer at most k times. Return the minimum integer you can obtain also as a string. Example 1: Input: num = "4321", k = 4 Output: "1342" Explanation: The steps to obtain the mi...

class Solution: def minInteger(self, num: str, k: int) -> str: n=len(num) if k<=0: return num if k>n*(n-1)//2: return ''.join(sorted(list(num))) for i in range(10): idx = num.find(str(i)) if idx>=0 and idx<=k: ...

0.808915

class Solution: def removeKdigits(self, num, k): """ :type num: str :type k: int :rtype: str """ out=[] for digit in num: while k and out and out[-1] > digit: out.pop() k-=1 out.append(digit) ...

0.713981

def solve(st, k): length = len(st) - k return max(int(st[i:i + length]) for i in range(k + 1))

0.707703

class Solution: def maximumSwap(self, num): """ :type num: int :rtype: int """ s = str(num) nums = [int(_) for _ in s] dp = [-1]*len(nums) for i in range(len(nums)-1,-1,-1): if i==len(nums)-1: dp[i] = i ...

0.684405

a, k = input().split() k = int(k) a = [i for i in a] i = 0 while k > 0 and i < len(a): m = a[i : i + k + 1].index(max(a[i : i + k + 1])) if a[i + m] > a[i]: k -= m for j in range(i + m, i, -1): a[j], a[j - 1] = a[j - 1], a[j] i += 1 print("".join(a))

0.674503

from itertools import combinations def solve(n, k): return ''.join(min(combinations(str(n), len(str(n))-k)))

0.661945

class Solution: def orderlyQueue(self, S: str, K: int) -> str: if K >= 2: return ''.join(sorted(S)) length = len(S) S = S + S i, j, k = 0, 1, 0 while j + k < len(S) and k < length: if S[i + k] == S[j + k]: k += 1 ...

0.649629

class Solution(object): def findKthNumber(self, n, k): """ :type n: int :type k: int :rtype: int """ s,nn=0,str(n) while nn: if not k: return s c,m=0,10**(len(nn)-1) mm,p,t=(m-1)//9,int(nn)//m,0 for i...

0.643333

def solve(st,k): for l in sorted(st)[:k]: st=st.replace(l,'',1) return st

0.639319

class Solution: def getLengthOfOptimalCompression(self, s: str, k: int) -> int: n = len(s) def compLen(c): return 1 + len(str(c)) if c > 1 else 1 @lru_cache(None) def dp(i, k): # return {head: (len, -head_count)} if (n - i) <= k: return {} # ...

0.622445

class Solution: def reformat(self, s: str) -> str: n = [str(i) for i in range(0, 10)] a, b = [], [] for i in s: if i in n: b.append(i) else: a.append(i) if abs(len(a) - len(b)) > 1: return '' r = '' i...

0.621333

class Solution: def monotoneIncreasingDigits(self, N): """ :type N: int :rtype: int """ arr = [int(ch) for ch in str(N)] # create array from number 1234 => [1,2,3,4] marker = len(arr) i = len(arr)-2 while i >= 0: ...

0.612742

import sys reader = (s.rstrip() for s in sys.stdin) input = reader.__next__ n,k = list(map(int, input().split())) a = list(map(int, input())) b = a[:k] c = [b[i%k] for i in range(n)] if tuple(a)>tuple(c): d = int("".join(map(str, b))) d += 1 b = list(map(int, str(d))) c = [b[i%k] for i in range(n)] pri...

0.609143

class Solution: def numberOfArrays(self, s: str, k: int) -> int: dp = [-1] * len(s) return self.dfs(s, k, 0, dp) def dfs(self, s: str, k: int, start: int, dp: List[int]) -> int: if start == len(s): return 1 if s[start] == '0': return 0 if dp[s...

0.608539

class Solution: def numsSameConsecDiff(self, n: int, k: int) -> List[int]: # DFS (Depth-First Search) # Time complexity: O(N x 2^N) = O(N x 9 x 2^(N-1)) # Space compleixty: O(2^N) = O(9 x 2^(N-1)) + O(N) # if n == 1: # return [i for i in range(10)] # ans = [] ...

0.605791

S = input() K = int(input()) if len(S) == 1: print(S) else: flg = False while S[0] == '1': S = S[1:] K -= 1 if K == 0: print(1) flg = True break if not flg: if S[0] == '2': if K.bit_length() - 1 >= 5000000000000000: ...

0.601329

class Solution: def largestNumber(self, nums): """ :type nums: List[int] :rtype: str """ nums = [str(n) for n in nums] nums.sort(reverse=True) for i in range(1, len(nums)): if len(nums[i-1]) > len(nums[i]): ...

0.600404

def modify(string, index): if string[index] == '0': key = 0 else: key = 10 - int(string[index]) bad = '' for i in string: bad += str((int(i) + key) % 10) return bad[index:] + bad[:index] x = int(input()) y = input() minx = 'zzzzzzzzz' for i in range(x): minx = min...

0.591829

from itertools import permutations def rearranger(k, *args): perms = permutations(map(str, args), len(args)) divisible_by_k = filter(lambda x: int(''.join(x)) % k == 0, perms) try: rearranged = min(divisible_by_k, key=lambda x: int(''.join(x))) return 'Rearrangement: {} generates: {} divisi...

0.590644

import sys def solve(): n,k, = rv() a, = rl(1) res = 0 count = [0] * 10 for i in range(n): if a[i] < 100: count[10 - (a[i] % 10) - 1] += 1 res += a[i] // 10 for i in range(10): while count[i] > 0 and k >= i + 1: res += 1 count[i] -= 1 ...

0.588448

class Solution: def getWinner(self, arr: List[int], k: int) -> int: win=0 curr = arr[0] mx=0 for i in range(1,len(arr)): if arr[i] > curr: curr=arr[i] win=0 win=win+1 ...

0.587636

from array import array inf = (1 << 30) def main(): (n,k) = [int(x) for x in input().split(' ')] Matrix = [] for i in range(n): Matrix.append(array('b',[ord(x) for x in input()])) dp = [array('l', [inf for j in range(n)]) for i in range(n)] direct = [[ord('d') for j in range(n)] for i in ra...

0.586935

from collections import Counter EXECUTIONS_ORDER = [('Z', Counter("ZERO"), '0'), ('W', Counter("TWO"), '2'), ('U', Counter("FOUR"), '4'), ('X', Counter("SIX"), '6'), ('G', Counter("EIGHT"), '8'), ('O', Counter("O...

0.584251

def abacaba(k): return next(chr(97+i) for i,d in enumerate(f'{k:b}'[::-1]) if d=='1')

0.583903

def max_number(n): return int(''.join(sorted(str(n), reverse=True)))

0.580687

def rec(i): nonlocal a return i import sys from collections import Counter sys.setrecursionlimit(10**6) n=int(input()) #n,m=list(map(int,input().split())) a=[input() for i in range(n)] b=[] a0=set() c0=set() for i in a: c=set() for i0 in range(1,10): for i1 in range(0,10-i0): c.add(i...

0.579028

def solve(n): x = str(n) res = [x] + [str(int(x[:i]) - 1) + '9' * (len(x) - i) for i in range(1, len(x))] return int(max(res, key=lambda x: (sum(map(int, x)), int(x))))

0.578173

import itertools def cal(N, target_num, keta): answer = float('inf') for p in itertools.product(target_num, repeat=keta): temp = 0 for i, num in enumerate(p): temp += num * 10**i if temp >= N: answer = min(answer, temp) return answer def __star...

0.576313

l = {j:i for i,j in enumerate('0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz')} l_ = dict(enumerate('0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz')) is_polydivisible = lambda n, base:next((0 for i in range(1, len(n) + 1) if get_base(n[:i], base) % i),1) get_base = lambda n, base:sum(...

0.573924

def solve(s): s1 = s[::-1] s2 = '' for i in s1: if i.isalpha(): s2 += i elif i.isdigit(): s2 = s2*int(i) return s2[::-1]

0.573272

def next_smaller(n): s = list(str(n)) i = j = len(s) - 1 while i > 0 and s[i - 1] <= s[i]: i -= 1 if i <= 0: return -1 while s[j] >= s[i - 1]: j -= 1 s[i - 1], s[j] = s[j], s[i - 1] s[i:] = reversed(s[i:]) if s[0] == '0': return -1 return int(''.join(s))

0.572998

class Solution: def decodeAtIndex(self, S: str, K: int) -> str: size = 0 # Find size = length of decoded string for c in S: if c.isdigit(): size *= int(c) else: size += 1 for c in reversed(S): K %= size i...

0.572003

import sys # import math as mt # from collections import Counter # from itertools import permutations # from functools import reduce # from heapq import nsmallest, nlargest, heapify, heappop, heappush, heapreplace def get_inpt(): return sys.stdin.readline().strip() def get_int(): return int(sys.stdin.readline().strip(...

0.571699

class Solution: def largestNumber(self, cost: List[int], target: int) -> str: dp = [0] + [-target]*target for t in range(1, target+1): dp[t] = max([dp[t-i] for i in cost if i<=t]+[dp[t]]) + 1 if dp[-1]<=0: return '0' res = '' for i in range(8, -1, -1): ...

0.571576

def min_value(digits): return int("".join(map(str,sorted(set(digits)))))

0.569713

import sys sys.setrecursionlimit(10000) n = input() k = int(input()) m = {} def doit(n, k): if len(n) == 0: return k == 0 d = int(n[0]) if (n, k) not in m: ret = 0 for i in range(d + 1): if i == d: ret += doit(n[1:], k - 1 if i > 0 else k) e...

0.567288

class Solution: def getPermutation(self, n, k): """ :type n: int :type k: int :rtype: str """ nums = list("123456789") k -= 1 factor = 1 for i in range(1, n): factor *= i res = [] for i in reversed(list(...

0.566682

import math from collections import Counter s = list(map(int, input())) substr = input().rstrip() t = list(map(int, substr)) m = len(s) x, y = 0, m z = (x + y) // 2 while z != x: if z + math.floor(math.log10(z)) + 1 <= m: x = z else: y = z z = (x + y)//2 m1 = z k = math.floor(math.log10(m1...

0.566048

import math class Solution: def __init__(self): self.happy_string = '' def getHappyString(self, n: int, k: int) -> str: # determine starting character poss_per_group = 2 ** (n - 1) group_num = math.ceil(k / poss_per_group) - 1 starting_char = '' # c...

0.565474

def basereduct(x): for _ in range(150): x = int(str(x), int(max(str(x))) + 1 + ('9' in str(x))) if x < 10: return x return -1

0.565026

from functools import cmp_to_key cmp = lambda a, b: int('%i%i' % (b, a)) - int('%i%i' % (a, b)) largest_arrangement = lambda n: int(''.join(str(i) for i in sorted(n, key = cmp_to_key(cmp))))

0.563656

def delete_digit(n): s = str(n) return int(max(s[:i] + s[i+1:] for i in range(len(s))))

0.561923

def find_lowest_int(k1): k2, n = k1 + 1, 1 def digits(n): return sorted(str(n)) while digits(n*k1) != digits(n*k2): n += 1 return n

0.561431

import sys stdin=sys.stdin ip=lambda: int(sp()) fp=lambda: float(sp()) lp=lambda:list(map(int,stdin.readline().split())) sp=lambda:stdin.readline().rstrip() yp=lambda:print('Yes') np=lambda:print('No') s=list(sp()) k=ip() ans=set() alpa=list(set(s)) alpa.sort() ch=0 siyou=[] for i in range(len(alpa)): if i<=2: ...

0.561218

N, K = map(int, input().split()) S = input() print("".join(c.lower() if i == K else c for i, c in enumerate(S, 1)))

0.560066

def dfs(ind,m,n,k): if(ind == m): return [""] else: temp = dfs(ind+1,m,n,k) ans = [] if(len(temp)<k): for i in temp: for j in range(97,97+n): ans += [chr(j)+i] else: for i in temp: ans += ["z"+i] return ans n,m,k = list(map(int,input().split())) p = [] mr= [] for _ in range(m): inp = [i...

0.559952

class Solution: def licenseKeyFormatting(self, S, K): """ :type S: str :type K: int :rtype: str """ # count_dash = 0 # for item in S: # if item == '-': # count_dash += 1 # S_len = len(S) - count_...

0.559093

a = list(input()) b = int(input()) a.sort() a = a[::-1] prefix = "" while(len(a) > 0): for i in range(len(a)): num = prefix + a[i] + "".join(sorted(a[:i] + a[i + 1:])) if (int(num) <= b): prefix += a[i] a = a[:i] + a[i+1:] break print(prefix)

0.559039

import sys input = sys.stdin.readline for _ in range(int(input())): a, k = list(map(int, input().split())) for _ in range(k - 1): if '0' in str(a): break a += int(min(list(str(a)))) * int(max(list(str(a)))) print(a)

0.558172

# cook your dish here T = int(input()) for t in range(T): N = int(input()) s = sorted(list(str(input()))) print(s[0])

0.557527

import itertools def next_bigger(n): s = list(str(n)) for i in range(len(s)-2,-1,-1): if s[i] < s[i+1]: t = s[i:] m = min([x for x in t if x>t[0]]) t.remove(m) t.sort() s[i:] = [m] + t return int("".join(s)) return -1

0.556301

k = int(input()) n = input() digit = [0]*10 for c in n: digit[int(c)]+= 1 dsum = sum(i*digit[i] for i in range(10)) i = 0 change = 0 while dsum < k: if digit[i] == 0: i+= 1 continue digit[i]-= 1 digit[9]+= 1 change+= 1 dsum+= 9-i print(change)

0.55499

class Solution: def longestOnes(self, A: List[int], K: int) -> int: hulu = [] cnt = 0 num = A[0] for x in A: if x == num: cnt += 1 else: hulu.append([num,cnt]) cnt = 1 num = x if cnt>0: ...

0.553842

t=int(input()) def reversebinary(bits,n): bStr='' for i in range(bits): if n>0: bStr=bStr+str(n%2) else: bStr=bStr+'0' n=n>>1 return int(bStr,2) for i in range(t): k,msg=input().split() k=int(k) newmsg=[] for j in msg: newmsg.a...

0.553044

k = int(input()) import queue que = queue.Queue() for i in range(1, 10): que.put(i) for i in range(1, k + 1): ans = que.get() keta1 = ans % 10 if keta1 == 0: append_list = [ans * 10, ans * 10 + 1] elif keta1 == 9: append_list = [ans * 10 + 8, ans * 10 + 9] else: appen...

0.551382

# cook your dish here n=int(input()) l=[] for i in range(n): a=int(input()) l.append(a) for i in l: b = list(map(int, str(i))) b.sort(reverse=True) s = [str(i) for i in b] r = int("".join(s)) print(r)

0.549794

n, k = list(map(int, input().split())) s = list(input()) if len(s) == 1 and k: print(0) return if s[0] != '1' and k: k -= 1 s[0] = '1' for i in range(1, len(s)): if s[i] != '0' and k: s[i] = '0' k -= 1 if not k: break print(''.join(s))

0.549786

class Solution: def longestSubstring(self, s, k): """ :type s: str :type k: int :rtype: int """ for c in set(s): if s.count(c) < k: return max(self.longestSubstring(sp, k) for sp in s.split(c)) return len(s)

0.548266

n,k = map(int, input().split()) s = input() ls = sorted(list(set(s))) if k > n: ans = s + ''.join([ls[0] for i in range(k-n)]) print(ans) return c = len(ls) d = {} for i in range(c): d[ls[i]] = i ns = [] for i in range(k-1,-1,-1): ns.append(d[s[i]]) r = 1 ans = [] for i in range(k): ans.append((...

0.547994

tmp = list(map(int,input().split())) n,k = tmp[0],tmp[1] a = list(map(int,input().split())) cur = a[0] w = 0 OK = False for i in range(1,10000): op = a[i] if cur > op: a.append(op) w += 1 else: cur = op a.append(cur) w = 1 if w >= k: OK = True bre...

0.547245

'''input 3 4 aba ''' n, k = map(int, input().split()) t = input() for i in range(1, n): if t[i:] == t[:n-i]: print(t[:i] * k + t[i:]) break else: print(t * k)

0.547084

try: n , k = list(map(int,input().split())) for i in range(k): if n % 10 == 0: n = n/10 else: n -= 1 print(int(n)) except: pass

0.546886

class Solution: def smallestRangeII(self, A: List[int], K: int) -> int: if not A: return 0 nums = sorted([num + K for num in set(A)], reverse=True) max_num = nums[0] min_num = nums[-1] changed_max = max_num - 2 * K res = max_num - min_num for i in ...

0.546061

import math class Solution: def smallestGoodBase(self, n): n = int(n) maxLength = int(math.log(n,2)) for m in range(maxLength, 1, -1): k = int(n**m**-1) if (k**(m+1) - 1)//(k - 1) == n: return str(k) return str(n-1) """ ...

0.545411

num = list(map(int, input())) best = num[:] for i in range(-1, -len(num) - 1, -1): if num[i] == 0: continue num[i] -= 1 for j in range(i + 1, 0): num[j] = 9 if sum(num) > sum(best): best = num[:] s = ''.join(map(str, best)).lstrip('0') print(s)

0.544932

class Solution: def findKthLargest(self, nums, k): """ :type nums: List[int] :type k: int :rtype: int """ nums = sorted(nums, reverse=True) return nums[k - 1]

0.543562

def find(ins): ins += 1 test = [int(i) for i in str(ins)] inlist = [] for i in test: if i in inlist: test = find(ins) break else: inlist.append(i) return ''.join(str(x) for x in test) ins = int(input()) print(find(ins))

0.543486

for _ in range(int(input())): n=input().rstrip() n=[ele for ele in n] l=len(n) m=10**18+8 ini=1 for i in range(l-1,-1,-1): if int(n[i])<=m: if ini==1: m=int(n[i]) else: m=max(m,n[i]) else: m=int(n[i])-1 n[i]=str(m) for j in range(l-1,i,-1): n[j]='9' i=0 while n[i]=='0': i+=1...

0.542835

from collections import Counter, defaultdict from string import ascii_lowercase as al n, k = list(map(int, input().split())) s = list(input()) C = defaultdict(int, Counter(s)) C_ = defaultdict(int) k_ = k for char in al: temp = min(C[char], k_) C_[char] += temp k_ -= temp for i, el in enumerate(s): ...

0.542119

class Solution: def hasAllCodes(self, s: str, k: int) -> bool: if len(s) < 2 ** k + k - 1: return False # Cannot be a string, as this is the de brujin length target = 2 ** k seen = set() cur_len = 0 for end in range(k, len(s) + 1): chunk = s[end - k: e...

0.541845

class Solution: def nearestPalindromic(self, num): """ :type n: str :rtype: str """ K = len(num) candidates = set([10**K + 1, 10**(K-1) - 1]) Prefix = int(num[:(K+1)//2]) for start in map(str, [Prefix-1, Prefix, Prefix+1]): cand...

0.540191

class Solution: def reverseStr(self, s, k): """ :type s: str :type k: int :rtype: str """ for idx in range(0, len(s), 2*k): s = s[:idx] + s[idx:idx+k][::-1] + s[idx+k:] return s

0.539021

k = int(input()) if k<=9: print(k) else: num_arr = [9*(i+1)* 10**i for i in range(11)] index = 0 while True: if k<=num_arr[index]: break else: k -= num_arr[index] index += 1 digit = index+1 k += digit-1 num = k//digit offset = k%d...

0.538887

class Solution: def smallestRangeI(self, A: List[int], K: int) -> int: if len(A) == 1: return 0 _min = min(A) _max = max(A) if _max - K <= _min + K: return 0 return _max - _min - 2*K

0.537899

def reverse(n): m = 0 while n > 0: n, m = n // 10, m * 10 + n % 10 return m

0.535741

def self_converge(number): n, cycle = str(number), set() while n not in cycle: cycle.add(n) s = ''.join(sorted(n)) n = '%0*d' % (len(n), int(s[::-1]) - int(s)) return -1 if not int(n) else len(cycle)

0.534018

from operator import mul from functools import reduce def genSequence(n): yield n while True: n += reduce(mul, [int(d) for d in str(n) if d != '0']) if n > 9 else n yield n def extract(seq, v): return sorted(seq).index(v) def convergence(n): gen1, genN = genSequence(1), genSequence(n)...

0.533984

a,b=[int(_) for _ in input().split()] if b==0: print(a) else: l=[] a=str(a) for i in range(len(a)): l.append(a[i]) for i in range(len(l)): if b==0: break if l[i]=='9': continue else: l[i]='9' b-=1 ...

0.533776

def solution(digits): numlist = [int(digits[i:i+5]) for i in range(0,len(digits)-4)] return max(numlist)

0.533761

n, k = map(int, input().split()) s = sorted(list(map(int, input().split())), reverse = True) print(s[k - 1])

0.533341

class Solution: def removeDuplicates(self, s: str, k: int) -> str: st=[['*',0]] for c in s: if c!=st[-1][0]: st.append([c,1]) else: st[-1][1]+=1 if st[-1][1]==k: st.pop() res='' for c,v in st:...

0.532328

def getIntList(): return list(map(int, input().split())); n, k = getIntList(); p=getIntList(); choosed=[False]*256; left=[i for i in range(256)]; for i, x in enumerate(p): if not choosed[x]: best=x; #print(x-1, max(-1, x-k)); for j in range(x-1, max(-1, x-k), -1): #print('try...

0.530864

n, k = map(int, input().split()) print(('abcdefghijklmnopqrstuvwxyz'[:k] * n)[:n])

0.530494

n, k = list(map(int, input().split())) for i in range(k): if n%10==0: n //= 10 else: n -= 1 print(n)

0.527867

class Solution: def smallestRepunitDivByK(self, K: int) -> int: if K % 2 == 0 or K % 5 == 0: return -1 r = 0 for N in range(1, K + 1): r = (r * 10 + 1) % K if not r: return N

0.527132

import sys readline = sys.stdin.readline T = int(readline()) Ans = [None]*T for qu in range(T): N, K = map(int, readline().split()) S = list(map(lambda x: ord(x)-97, readline().strip())) S.sort() if len(set(S[:K])) != 1: Ans[qu] = chr(97+S[K-1]) continue L = len(set(S[K:])) if L...

0.526692

class Solution: def __init__(self): self.n, self.k = list(map(int, input().split())) self.s = [input() for i in range(0, self.n)] self.state = [ (119, 6), (36, 2), (93, 5), (109, 5), (46, 4), (107, 5), (123, ...

0.524817

class Solution: def nextGreaterElement(self, n): """ :type n: int :rtype: int """ s=[i for i in str(n)] exist=-1 for i in range(len(s)-1,0,-1): if s[i-1]<s[i]: temp=sorted(s[i-1:]) pivot=temp.index(s[i-1])...

0.524423

K = int(input()) S = input() if len(S) <= K: print(S) else: print(S[0:K] + '...')

0.524228

3 import sys def solve(s, k): l = len(s) for i in range(l-1, -1, -1): prev = s[max(i-2, 0):i] z = s[i] + 1 while z in prev: z += 1 if z >= k: continue # Gotcha! ret = s[:i] + [z] while len(ret) < l: prev = ret[max(len...

0.524135

class Solution: def kConcatenationMaxSum(self, arr: List[int], k: int) -> int: oneArrSum = sum(arr) twoArr = arr + arr def findMaxSub(array): if len(array) == 1: return array[0] cur = 0 small = 0 ret = -999...

0.523109

x = input () flag = 0 s = 0 for each_item in x: if each_item == '0': if flag == 0: flag = 1; continue else: print (each_item, end = '') else: if (s == len (x) - 1 and flag == 0) : continue print (each_item, end = '') s = s + 1...

0.521964

from collections import defaultdict k = int(input()) d = defaultdict(list) for i in range(10): d[(1, i)].append(i) mx = 10 pw = 1 for digs in range(2, mx): pw *= 10 for sm in range(11): for curr in range(10): for num in d[(digs-1, sm-curr)]: d[(digs, sm)].append( curr*...

0.521619

# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!! # TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!! # TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!! from sys import stdin, stdout from collections import defaultdict from collections import deque import math import copy #T = int(input()) #N = int(input()) #s1 = input() #s2 = input() N,K = [int(x) for...

0.521015

def main(): N, K = list(map(int, input().split())) S = list(input()) base = S[0] flag = False for i in range(0, N): if K == 0: break if S[i] != base and (not flag): flag = True S[i] = base elif S[i] != base and flag: S[i] = base...

0.520095

def array_equalization(a, k): totals, ends = {}, {} for i, n in enumerate(a): if n not in ends: totals[n], ends[n] = 0, -1 if i < ends[n]: continue count = (i - ends[n] - 1 + k - 1) // k totals[n] += count ends[n] = max(i, ends[n] + count * k) return min(t + (len(a) -...

0.51988

s = list(input()) for i in range(3): if s[i] == '1': s[i] = '9' else: s[i] = '1' t = '' for i in range(3): t += s[i] print(t)

0.51978

# cook your code here n=input() x=len(n) no=list(map(int,n)) temp=[0]*x if (x>2): sum=99 for i in range(3,x): sum=sum+90 sum=sum+10*(int(n[0])-1) sum=sum+int(n[1]) f=int(n[0])%10 s=int(n[1])%10 cd=s-f temp[0]=n[0] temp[1]=n[1] for i in range(2,x): nxt=(s+cd)%10 temp[i]=(chr(nxt+48)) s=nxt temp=...

0.519356

s = input().split() k = int(s[1]) s = s[0] if s.count('0') < k: if s.count('0') > 0: print(len(s) - 1) else: print(len(s)) return have = 0 its = 0 for i in range(len(s) - 1, -1, -1): its += 1 if s[i] == '0': have += 1 if have == k: print(its - have) return

0.519194

from itertools import cycle def swap(s,n): b = cycle(bin(n)[2:]) return "".join(c.swapcase() if c.isalpha() and next(b) == '1' else c for c in s)

0.519079

def least_rotation(S: str) -> int: """Booth's algorithm.""" f = [-1] * len(S) # Failure function k = 0 # Least rotation of string found so far for j in range(1, len(S)): sj = S[j] i = f[j - k - 1] while i != -1 and sj != S[k + i + 1]: if sj < S[k + i + 1]: ...

0.51884

Given a string and a string dictionary, find the longest string in the dictionary that can be formed by deleting some characters of the given string. If there are more than one possible results, return the longest word with the smallest lexicographical order. If there is no possible result, return the empty string. Ex...

class Solution: def findLongestWord(self, s, d): """ :type s: str :type d: List[str] :rtype: str """ result = '' for word in d: lo = 0 for l in word: lo = s.find(l, lo)+1 if lo == 0: ...

0.829807

class Solution: def longestWord(self, words): """ :type words: List[str] :rtype: str """ result = ""; wordSet = set(words); for word in words: if (len(word) > len(result) or len(word) == len(result) and word < result) and all(wor...

0.721448

class Solution: def findLUSlength(self, strs): """ :type strs: List[str] :rtype: int """ def isSubseq(s1, s2): i, m=0, len(s1) for c in s2: if i==m: return True if s1[i]==c: i+=1 return i==m ...

0.676165

import re import itertools from collections import Counter class Task: strings = [] answer = "" def getData(self): numberOfStrings = int(input()) for i in range(0, numberOfStrings): self.strings += [input()] def solve(self): badStrings = set() for current...

0.664312

from collections import defaultdict def find_uniq(a): d = {} c = defaultdict(int) for e in a: t = frozenset(e.strip().lower()) d[t] = e c[t] += 1 return d[next(filter(lambda k: c[k] == 1, c))]

0.659529

def longest(a1, a2): return "".join(sorted(set(a1 + a2)))

0.649135

class Solution: def longestPrefix(self, strn: str) -> str: max_prefs = [0]*len(strn) curr = 0 for idx in range(1, len(strn)): while True: if curr == 0: if strn[idx] == strn[0]: curr = 1 max_prefs[idx...

0.647821

class Solution: def longestCommonPrefix(self, strs): """ :type strs: List[str] :rtype: str """ strs = strs import os return os.path.commonprefix(strs) # for x in strs: # if prefix in x: # print x ...

0.645786

class Solution: def longestDupSubstring(self, S): nums, N = [ord(c) - ord('a') for c in S], len(S) BASE, MOD = 26, 2**32 def check(L): cur_hash, seen = 0, set() for val in nums[:L]: cur_hash = (cur_hash * BASE + val) % MOD seen.add(cur_hash...

0.642655

class Solution: def shortestSuperstring(self, A: List[str]) -> str: A = [a for i, a in enumerate(A) if all(a not in b for j, b in enumerate(A) if i != j)] def memo(f): dic = {} def f_alt(*args): if args not in dic: dic[args] = f(*args) ...

0.640181

def longest_word(letters): try: word_list = [w for w in words if all(w.count(c) <= letters.count(c) for c in w)] largest = sorted([w for w in word_list if len(w) == len(max(word_list, key=len))]) return largest if largest else None except: return None

0.640051

class Solution: def longestStrChain(self, words: List[str]) -> int: by_length = collections.defaultdict(set) for word in words: by_length[len(word)].add(word) longest = 1 seen = {*()} mx = len(by_length) mn = min(by_length) for length in sorted(b...

0.63823

from collections import Counter def most_common(s): count = Counter(s) return ''.join(sorted(s, key=lambda c: -count[c]))

0.630044

class Solution: def lastSubstring(self, s: str) -> str: #mx = \"\" #for i in range(len(s)): # mx = max(mx,s[i:]) #return mx index = {c: i for i, c in enumerate(sorted(set(s)))} cur, radix, max_val, max_i = 0, len(index), 0, 0 for i in range(len(s)-1, -1, -1...

0.627936

def find_longest(xs): return max(xs, key=lambda x: len(str(x)))

0.623729

def solve(st): return sorted((st.find(c) - st.rfind(c), c) for c in set(st))[0][1]

0.618595

class Solution: def replaceWords(self, dt, sentence): """ :type dict: List[str] :type sentence: str :rtype: str """ trie = {} for w in dt: t = trie for c in w: if c not in t: t[c] = {} t = t[...

0.61156

t = eval(input()) for _ in range(t): n = eval(input()) a = input().strip().split() cb, cs = 0, "" for i in range(len(a[0])): for j in range(i+1,len(a[0])+1): al = True s = a[0][i:j] for k in a[1:]: if s not in k: al = False break if al: if j-i>=cb: cb = max(cb, j-i) if len(...

0.610255

from collections import Counter n = int(input()) ss = [input() for _ in range(n)] ss.sort() c = Counter() mc = 0 for s in ss: c[s] += 1 mc = max(mc, c[s]) seen = set() for s in ss: if c[s] == mc and s not in seen: print(s) seen.add(s)

0.608272

class Solution: def removeDuplicateLetters(self, s): """ :type s: str :rtype: str """ rindex = {c: i for i, c in enumerate(s)} result = '' for i, c in enumerate(s): if c not in result: while c < result[-1:] and i < rindex[...

0.604611

def longest(words): return max(map(len, words))

0.599111

class Solution: def maxLength(self, arr: List[str]) -> int: def digit_representation(s): ans = 0 for c in s: ans |= 1<<(ord(c)-ord('a')) return ans A = sorted([(len(s), digit_representation(s)) for s in set(arr) if len(set(s))==len(s)], re...

0.590801

def max_match(s): result = [] while s: for size in range(len(s), 0, -1): word = s[:size] if word in VALID_WORDS: break result.append(word) s = s[size:] return result

0.5888

class Solution: def minDeletionSize(self, A: List[str]) -> int: dp = [(1, 1)] * len(A[0]) for i in range(len(dp)): if i > 0: max_pre = None for pre in range(i - 1, -1, -1): for word in A: if word[pre] > word[i]: ...

0.587696

def find_short(s): return min(len(x) for x in s.split())

0.587188

def lcs(x, y): if len(x) == 0 or len(y) == 0: return '' if x[-1] == y[-1]: return lcs(x[:-1], y[:-1]) + x[-1] else: lcs1 = lcs(x,y[:-1]) lcs2 = lcs(x[:-1],y) if len(lcs1) > len(lcs2): return lcs1 else: return lcs2

0.586552

import sys def dp(s1, s2, i, j, mem): if (i, j) in mem: return mem[(i, j)] elif i >= len(s1) and j >= len(s2): res = '' elif i >= len(s1): res = s2[j:] elif j >= len(s2): res = s1[i:] else: if s1[i] == s2[j]: res = s1[i] + dp(s1, s2, i+1, j+1, mem...

0.584492

def highest_value(a, b): return max(a, b, key=lambda s: sum(map(ord, s)))

0.584009

class Solution: def gcdOfStrings(self, str1: str, str2: str) -> str: contender = '' for i in str1: contender += i if str1.count(contender) * len(contender) == len(str1) and str2.count(contender) * len(contender) == len(str2): break orig = contender ...

0.579733

class Solution: def longestSubstring(self, s, k): """ :type s: str :type k: int :rtype: int """ for c in set(s): if s.count(c) < k: return max(self.longestSubstring(sp, k) for sp in s.split(c)) return len(s)

0.57945

import re reg = re.compile('a*b*c*d*e*f*g*h*i*j*k*l*m*n*o*p*q*r*s*t*u*v*w*x*y*z*') def longest(s): return max(reg.findall(s), key=len)

0.579192

class Solution: def minWindow(self, s, t): """ :type s: str :type t: str :rtype: str """ left=-1 right = 0 result = "" totalMatch = 0 d = {} for c in t: d[c] = d.get(c, 0) + 1 for right in ran...

0.578007

def longer(s): return ' '.join(sorted(s.split(), key=lambda w: (len(w), w)) )

0.576938

def solve(st,k): for l in sorted(st)[:k]: st=st.replace(l,'',1) return st

0.576294

class Solution: def sortString(self, s: str) -> str: sforward = sorted(s) sbackward = sforward[-1] suniq = '' for i in s: if i not in suniq: suniq += i suniq = sorted(suniq) max_count = 0 for i i...

0.575288

def first_non_repeating_letter(string): string_lower = string.lower() for i, letter in enumerate(string_lower): if string_lower.count(letter) == 1: return string[i] return ""

0.571594

class Solution: def nextGreatestLetter(self, letters, target): """ :type letters: List[str] :type target: str :rtype: str """ if ord(letters[-1]) <= ord(target): return letters[0] li = 0 ri = len(letters) - 1 ...

0.571162

class Solution: def orderlyQueue(self, S: str, K: int) -> str: if K >= 2: return ''.join(sorted(S)) length = len(S) S = S + S i, j, k = 0, 1, 0 while j + k < len(S) and k < length: if S[i + k] == S[j + k]: k += 1 ...

0.569312

class Solution: def isvalid(self,C): if len(C)>2: return False if len(C)==1: a = min(C) if a==1 or C[a]==1: # EXPLANATION: # a==1 : All lengths are unitary like A=[1,2,3,4,...], so poping anything is fine # C[a...

0.566597

from collections import Counter from functools import reduce from fractions import gcd def has_subpattern(s): c = Counter(s) m = reduce(gcd, c.values()) return ''.join(sorted(k*(v//m) for k,v in c.items()))

0.564638

def penalty(lst): lst, maxLen = list(map(str, lst)), max(map(len, lst)) return ''.join(sorted(lst, key=lambda s: s.ljust(maxLen, s[-1])))

0.563587

n = int(input()) s = input() for i in range(len(s) - 1): if s[i] > s[i + 1]: print(s[:i] + s[i + 1:len(s)]) return print(s[:len(s) - 1])

0.561661

for _1 in range(int(input())): n=int(input()) s=input().strip() answer=s for i in range(len(s)): c=s[i] string=s[:i]+s[i+1:] for j in range(len(string)+1): answer=min(answer, string[:j]+c+string[j:]) print(answer)

0.561559

from collections import Counter def only_duplicates(string): cs = Counter(string) return ''.join(c for c in string if cs[c] > 1)

0.561033

class Solution: def lengthOfLongestSubstring(self, s): """ :type s: str :rtype: int """ L, res, last = -1, 0, {} for R, char in enumerate(s): if char in last and last[char] > L: L = last[char] elif R-L > res: ...

0.560601

def no_repeat(s): return next(c for c in s if s.count(c) == 1)

0.560441

class MagicDictionary: def __init__(self): """ Initialize your data structure here. """ self.l = [] def buildDict(self, dict): """ Build a dictionary through a list of words :type dict: List[str] :rtype: void """ sel...

0.559493

def find_missing_letter(chars): n = 0 while ord(chars[n]) == ord(chars[n+1]) - 1: n += 1 return chr(1+ord(chars[n]))

0.556742

def high(x): return max(x.split(), key=lambda k: sum(ord(c) - 96 for c in k))

0.556324

def first_dup(s): for x in s: if s.count(x) > 1: return x return None

0.555341

def substring(s): r, rm = [], [] for i, x in enumerate(s): if x in r or len(set(r)) < 2: r += x; else: if len(r) > len(rm): rm = r[:] r = [y for y in r[-1::-1] if y == r[-1]] + [x] if len(r) > len(rm): rm = r[:] return ''.join(rm)

0.555169

from collections import Counter class Solution: def reorganizeString(self, S): """ :type S: str :rtype: str """ if len(S) <= 1: return S chars = [char for char, count in Counter(S).most_common() for _ in range(count)] h = math.ceil(...

0.554702

from collections import Counter from string import ascii_lowercase def missing_alphabets(s): c = Counter(s) m = max(c.values()) return ''.join(letter * (m - c[letter]) for letter in ascii_lowercase)

0.550162

class Solution: def findLength(self, A, B): def check(length): seen = {A[i:i+length] for i in range(len(A) - length + 1)} return any(B[j:j+length] in seen for j in range(len(B) - length + 1)) A = ''.join(map(chr, A)) ...

0.549306

from collections import Counter def highest_rank(arr): if arr: c = Counter(arr) m = max(c.values()) return max(k for k,v in c.items() if v==m)

0.548584

def common_ground(s1,s2): lst = [] for w in s2.split(): if w in s1.split() and w not in lst: lst.append(w) return ' '.join(lst) if lst else "death"

0.547694

#!/usr/bin/env python3 from functools import cmp_to_key def cmpEqLen(a, b): if a < b: return -1 elif a > b: return 1 else: return 0 def compare(a, b): alen = len(a) blen = len(b) if alen == blen: return cmpEqLen(a, b) l = min(alen, blen) c = cmpEqLen(a[:...

0.547352

class Solution: def findLUSlength(self, a, b): """ :type a: str :type b: str :rtype: int """ return max(len(a),len(b)) if a != b else -1

0.546199

def first_non_repeated(s): return next((c for c in s if s.count(c) == 1), None)

0.54502

def find_the_missing_tree(trees): return sorted(trees, key=trees.count)[0]

0.544975

def missing(nums, s): ans = [] s = s.replace(' ','') try: for i in sorted(nums): ans.append(s[i]) return ''.join(ans).lower() except IndexError: return ("No mission today")

0.54434

def the_biggest_search_keys(*keys): L = sorted(keys, key=lambda key: (-len(key), key)) i = next((i for i,key in enumerate(L) if len(key) != len(L[0])), None) return str(L[:i])[1:-1] or "''"

0.542712

def missing(seq): for digits in range(1, len(seq) // 2 + 1): my_seq = last = seq[:digits] n = int(my_seq) missing = None while len(my_seq) < len(seq): n += 1 my_seq += str(n) if not seq.startswith(my_seq): if m...

0.542286

def maxlen(s1, s2): sm, lg = sorted((s1, s2)) return min(max(lg / 3, sm), lg / 2)

0.541891

def solved(s): if len(s)&1: s = s[:len(s)//2]+s[len(s)//2+1:] return ''.join(sorted(s))

0.541394

class Solution: def isSolvable(self, words: List[str], result: str) -> bool: longest_word = max([len(word) for word in words]) if len(result) != longest_word and len(result) != longest_word + 1: return False result_indices = [] acc = 0 all_chars = [] ...

0.541

class Solution: def ladderLength(self, beginWord, endWord, wordList): wordDict = set(wordList) if not endWord in wordDict: return 0 visited = set() beginSet = set() beginSet.add(beginWord) visited.add(beginWord) endSet = set() ...

0.539709

''' Write a function that returns the longest contiguous palindromic substring in s. In the event that there are multiple longest palindromic substrings, return the first to occur. ''' def longest_palindrome(s, sep=" "): # Interpolate some inert character between input characters # so we only hav...

0.537508

def string_constructing(a, s): if len(s) == 0: return 0 i = -1 for j, c in enumerate(s): i = a.find(c, i+1) if i < 0 or i == len(a) - 1: break return len(a) - j + (i < 0) + string_constructing(a, s[j + (i >= 0):])

0.537379

T = int(input()) def call_me(N,A,X): max = 0 ans = '' for i in A: if i.count(X) > max: max = i.count(X) ans = i return ans for i in range(T): N = int(input()) A = list(map(str,input().split())) X = input() print(call_me(N,A,X))

0.537027

class Solution: def firstUniqChar(self, s): """ :type s: str :rtype: int """ if not s: return -1 elif len(s) == 1: return 0 result = len(s) for ch in range(ord('a'), ord('z') + 1): if s.find(chr(ch)) ==...

0.536678

from bisect import bisect_left as bl from bisect import bisect_right as br from heapq import heappush,heappop import math from collections import defaultdict from functools import reduce,cmp_to_key,lru_cache import io, os input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline # import sys # input = sys.stdin.read...

0.536012

class Solution: def maxPower(self, s: str) -> int: n = len(s) count = 0 res = s[0] cur_count = 1 # Traverse string except # last character for i in range(n): # If current character # matches with next ...

0.535531

def codn1(s1,s2,p): c=0 ind=0 for i in range(len(s1)): if s1[i]!=s2[i]: c+=1 ind=i if c>1 or ind==len(s1)-1: return 0 if s1[ind]>s2[ind] and s1[ind] in s2[ind+1:]: p[0]=True if s1[ind]<s2[ind] and s2[ind] in s1[ind+1:]: p[1]=True return 1 def codn2(s1,s2): if len(s1)<len(s2): ...

0.533592

# coding=utf-8 from functools import reduce a = input() b = input() c = input() alen = len(a) blen = len(b) clen = len(c) kmpnext = [0]*(clen+1) i = 1 j = 0 while i < clen: while j > 0 and c[i]!=c[j]: j = kmpnext[j] if c[i] == c[j]: j+=1 kmpnext[i+1] = j i+=1 #print(kmpnext) f = [[[0 for i in range(clen+2)]...

0.533049

x = input().split(" ") y = input() ans = '' l = 1 for i in x: if i!=y and sorted(i) == sorted(y): ans = ans + (str)(l) l=l+1 ans+='.' print("The antidote is found in",ans)

0.532318

def de_nico(key, msg): ll, order, s = len(key), [sorted(key).index(c) for c in key], '' while msg: s, msg = s + ''.join(msg[i] for i in order if i < len(msg)), msg[ll:] return s.strip()

0.532157

def revamp(s): words = [''.join(sorted(word)) for word in s.split()] words.sort(key=lambda word: (sum(map(ord, word)), len(word), word)) return ' '.join(words)

0.530697

def levenshtein(a,b): d = [[0] * (len(b) + 1) for _ in range(len(a) + 1)] d[0][:] = list(range(len(b)+1)) for i in range(1, len(a) + 1): d[i][0] = i for i, x in enumerate(a): for j, y in enumerate(b): d[i+1][j+1] = min(1 + d[i][j+1], 1 + d[i+1][j], d[i][j] + (1 if x != y el...

0.529287

import re def buy_newspaper(s1, s2): p = re.sub(r"(.)", r"\1?", s1) return -1 if set(s2) - set(s1) else len(re.findall(p, s2)) - 1

0.528117

from functools import reduce class Solution: def smallestRange(self, nums): """ :type nums: List[List[int]] :rtype: List[int] """ k = len(nums) idx = [0]*k dic = collections.defaultdict(list) for i in range(k): ...

0.527291

def dominator(arr): for x in set(arr): if arr.count(x) > len(arr)/2.0: return x return -1

0.527033

m= 9999999 word='' p= '' try: s=input().split() for i in s: if(len(i) <= m): m = len(i) word = i p = word for i in s: p+= (' '+i+' '+ word) print(p) except EOFError: pass

0.526791

def sort_string(s): a = iter(sorted((c for c in s if c.isalpha()), key=str.lower)) return ''.join(next(a) if c.isalpha() else c for c in s)

0.52518

import re def word_mesh(arr): common = re.findall(r'(.+) (?=\1)',' '.join(arr)) return ''.join(common) if len(common) + 1 == len(arr) else 'failed to mesh'

0.525079

from collections import defaultdict def shortestPath(gra, srs, des): Q, paths, d = [[0, srs]], [], defaultdict(list) while Q: vrt = Q.pop(0) if vrt[-1] == des: paths.append(vrt) continue for v, c in gra[vrt[-1]].items(): if v not in vrt: ...

0.524906

from itertools import groupby from operator import itemgetter from os.path import commonprefix first = itemgetter(0) def radix_tree(*words): words = [w for w in words if w] result = {} for key, grp in groupby(sorted(words), key=first): lst = list(grp) prefix = commonprefix(lst) res...

0.524774

from string import ascii_lowercase class Solution: def removeDuplicates(self, S: str) -> str: dup = {2*ch for ch in ascii_lowercase} prev_length = -1 while prev_length!=len(S): prev_length = len(S) for d in dup: S = S.replace...

0.524773

n = int(input()) s = input() a = [[0] * 26 for _ in range(26)] for i in range(n -1): a[ord(s[i]) - ord('A')][ord(s[i + 1]) - ord('A')] += 1 mx = -1 for i in range(26): for j in range(26): if a[i][j] > mx: mx = a[i][j] ans = chr(i + ord('A')) + chr(j + ord('A')) print(ans)

0.524715

def sort_string(s, ordering): answer = '' for o in ordering: answer += o * s.count(o) s = s.replace(o,'') return answer + s

0.524047

import string def solve(st): return ''.join(sorted(st)) in string.ascii_letters

0.523957

def least_rotation(S: str) -> int: """Booth's algorithm.""" f = [-1] * len(S) # Failure function k = 0 # Least rotation of string found so far for j in range(1, len(S)): sj = S[j] i = f[j - k - 1] while i != -1 and sj != S[k + i + 1]: if sj < S[k + i + 1]: ...

0.523066

n = int(input()) words = input().split()[:n] p_base = 1543 p_mod = 1300199 current = [c for c in words[0]] for word in words[1:]: cur_hash = 0 word_hash = 0 cur_base = 1 i_matches = [] same_i = 0 biggest_match = None while same_i < len(current) and same_i < len(word): cur_hash *= p...

0.523057

# ひっくりかえすのかとお保ったら180度反転だった n = int(input()) d = [] for _ in range(n): s = list(input()) d.append(s) d = sorted(d, key=lambda dd: len(dd), reverse=True) base = {} for c in d[0]: if c not in base: base[c] = 1 else: base[c] += 1 for s in d[1:]: tmp = {} for c in s: if c no...

0.522968

def longest_slide_down(p): res = p.pop() while p: tmp = p.pop() res = [tmp[i] + max(res[i],res[i+1]) for i in range(len(tmp))] return res.pop()

0.522526

n, m = map(int, input().split()) d = { } for i in range(m): a, b = input().split() d[a] = b if len(b) < len(a) else a for word in input().split(): print(d[word], end=' ') print()

0.521519

def solve(s): return max(map(len, ''.join(c if c in 'aeiou' else ' ' for c in s).split()))

0.52082

#return if sa contains a real prefix: sb def isPrefix( sa , sb ): if len(sa) <= len(sb): return False return sa[0:len(sb)] == sb def getOrder( sa , sb ): for i in range( 0 , min( len(sa) , len(sb) ) ): if sa[i] != sb[i]: return sa[i],sb[i] test = False if test: fp = open("C...

0.520697

def decipher_word(word): i = sum(map(str.isdigit, word)) decoded = chr(int(word[:i])) if len(word) > i + 1: decoded += word[-1] if len(word) > i: decoded += word[i+1:-1] + word[i:i+1] return decoded def decipher_this(string): return ' '.join(map(decipher_word, string.split()))

0.520235

def prefix1(a, b): cnt = 0 for i, j in zip(a, b): if i == j: cnt += 1 else: return cnt return cnt def prefix2(a, b, num): for i in range(num, -1, -1): if b.startswith(a[:i]): return i def zfunc(str_): z = [] k = len(str_) for i ...

0.519955

# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right class Solution: def smallestFromLeaf(self, root: TreeNode) -> str: nonlocal ls ls=[] di={0: 'a', 1: ...

0.518972

Given 3 positives numbers a, b and c. Return the minimum flips required in some bits of a and b to make ( a OR b == c ). (bitwise OR operation). Flip operation consists of change any single bit 1 to 0 or change the bit 0 to 1 in their binary representation. Example 1: Input: a = 2, b = 6, c = 5 Output: 3 Explanation...

class Solution: def minFlips(self, a: int, b: int, c: int) -> int: flips = 0 print(bin(a)) print(bin(b)) print(bin(c)) while a or b or c: # print(a, b, c) if c % 2: if not (a % 2 or b % 2): flips += 1 els...

0.860923

def convert_bits(a,b): return bin(a^b).count("1")

0.71085

class Solution: def getSum(self, a, b): max = 0x7FFFFFFF mask = 0xFFFFFFFF while b != 0: a, b = (a ^ b) & mask, ((a & b) << 1) & mask return a if a <= max else ~(a ^ mask)

0.68806

import collections as col import itertools as its import sys import operator from bisect import bisect_left, bisect_right from copy import copy, deepcopy class Solver: def __init__(self): pass def solve(self): a = int(input()) b = int(input()) c = int(input()) d = ...

0.687486

class Solution: def hammingDistance(self, x, y): """ :type x: int :type y: int :rtype: int """ x = x ^ y y = 0 while (x): y += 1 x &= x-1 return y

0.680835

from collections import Counter def common(a,b,c): return sum((Counter(a) & Counter(b) & Counter(c)).elements())

0.677847

a, b, c = list(map(int, input().split())) x = 2 * (c + min(a, b)) if a != b: x += 1 print(x)

0.655648

n = int(input()) l = list(map(int, input().split())) f1 = l[2] l.sort() f2 = l[0] print(2 + (f1 ^ f2))

0.645147

class Solution: def findMaximumXOR(self, nums): """ :type nums: List[int] :rtype: int """ ans = 0 for bit in range(31, -1, -1) : ans = (ans << 1) + 1 pre = set() for n in nums : p = (n >> bit) & ans ...

0.634731

from collections import Counter def solve(*args): c1, c2 = map(Counter, args) return 2 - any(c1[k]-c2[k] >= 2 and k not in c2 for k in c1)

0.618445

from operator import __or__, __and__, __xor__ from sys import stdin, stdout n, b, c = int(stdin.readline()), 0, 1023 m = {'|': __or__, '&': __and__, '^': __xor__} for i in range(n): t, v = [i for i in stdin.readline().split()] b = m[t](b, int(v)) c = m[t](c, int(v)) x, o, a = 0, 0, 1023 for i in range(10): ...

0.618277

cnt1 = int(input()) cnt2 = int(input()) cnt3 = int(input()) cnt4 = int(input()) if cnt1 != cnt4: print(0) return if (cnt3 != 0 and cnt1 == 0): print(0) return print(1)

0.615468

'''input 6 4 2 ''' def list_input(): return list(map(int,input().split())) def map_input(): return map(int,input().split()) def map_string(): return input().split() def f(n,a,b,left,cnta = 4,cntb = 2): if(cnta == 0 and cntb == 0): return 0 if(cnta < 0 or cntb < 0): return 100000000000000000000 if a <=...

0.613622

A, B, C = list(map(int, input().split())) g = min(A//3,B//2,C//2) A -= g*3 B -= g*2 C -= g*2 L = [0,0,1,2,0,2,1] def calc(today, x): if x[L[today]] == 0: return 0 y = [xx for xx in x] y[L[today]] -= 1 return calc((today+1)%7, y) + 1 ma = 0 for i in range(7): ma = max(ma, calc(i, [A,B,C])...

0.613394

a, b, c = sorted(map(int, input().split())) print(max(0, c - a - b + 1))

0.612046

class Solution: def minOperations(self, nums: List[int]) -> int: return sum(bin(x).count('1') for x in nums)+len(bin(max(nums)))-3

0.611879

import sys l,r=map(int,(sys.stdin.readline().split())) i=64 while i>=0: if ((1<<i)&l!=0 and (1<<i)&r!=0) or ((1<<i)&l==0 and (1<<i)&r==0):i-=1 else:break print((1<<(i+1))-1)

0.610514

from fractions import gcd def binary_gcd(x, y): return bin(gcd(x, y)).count('1')

0.610283

from math import log2 def operation(a,b, n = 0): while log2(a) % 1: n += 1 a //= 2 return n + abs(log2(a/b))

0.609808

from bisect import bisect_left as bl from bisect import bisect_right as br import heapq import math from collections import * from functools import reduce,cmp_to_key import sys input = sys.stdin.readline M = mod = 10**9 + 7 def factors(n):return sorted(set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5)...

0.60454

class Solution: def subarrayBitwiseORs(self, A: List[int]) -> int: res = set() cur = set() for a in A: cur = {a | i for i in cur} cur |= {a} res |= cur return len(res)

0.602199

#!/usr/bin/env python3 def main(): N = int(input()) A = list(map(int, input().split())) B = list(map(int, input().split())) ans = 0 for k in range(30): C = [x & ((1 << (k+1)) - 1) for x in A] D = [x & ((1 << (k+1)) - 1) for x in B] C.sort() D.sort() # print(f...

0.599097

def hamming_distance(a, b): return bin(a ^ b).count('1')

0.596721

'''input 1 2 3 5 ''' n = int(input()) a = int(input()) b = int(input()) c = int(input()) cur = 0 pos = 0 for i in range(n-1): if pos == 0: if a < b: pos = 1 cur += a else: pos = 2 cur += b elif pos == 1: if a < c: pos = 1 ...

0.596267

def l2i(s): return [int(i) for i in s.split()] a, b=l2i(input()) t=0 while (a<=b): a*=3 b*=2 t+=1 print(t)

0.596244

class Solution: def flipgame(self, fronts: List[int], backs: List[int]) -> int: w = set(fronts[i] for i in range(len(fronts)) if fronts[i] == backs[i]) x = set() for a in fronts: if a not in w: x.add(a) for a in backs: if a not in w: ...

0.594127

a, b, c, d = list(map(int, input().split())) s = max(a, c) e = min(b, d) print((e - s if e-s > 0 else 0))

0.591932

class Solution: def mirrorReflection(self, p: int, q: int) -> int: while p % 2 == 0 and q % 2 == 0: p = p // 2 q = q // 2 if p % 2 == 1 and q % 2 == 0: return 0 elif p % 2 == 1 and q % 2 == 1: return 1 else : return 2 ...

0.590599

class Solution: def brokenCalc(self, X: int, Y: int) -> int: res = 0 while X < Y: res += Y % 2 + 1 Y = int((Y + 1) / 2) return res + X - Y

0.58843

def XorWorld(): a, b = list(map(int, input().split())) if a%2 == 0 and b%2 == 0: if ((b-a)//2)%2 == 0: print((0^b)) else: print((1^b)) elif a%2 == 0: if ((b-a+1)//2)%2 == 0: print((0)) else: print((1)) elif b%2 == 0: ...

0.587721

a, b, c = map(int, input().split()) x = c - (a - b) if x >= 0: print(x) else: print(0)

0.586966

t = input() t = t.split() n = int(t[0]) c1 = int(t[1]) c2 = int(t[2]) t = input() d = 0 for i in t: if(i=="1"): d = d+1 min = 10**1488 for i in range(1, d+1): t = c1*i + i*c2*(((n//i)-1)**2) + c2*(n%i)*(2*(n//i)-1) if t<min: min = t print(min)

0.586602

#CF Round 150. Div II Prob. A - Dividing Orange import sys dp = [[[-1 for j in range(3)] for i in range (1 << 10)] for k in range(11)] In = sys.stdin n = In.readline().strip() def go (idx, mask, equal): if dp[idx][mask][equal] != -1: return dp[idx][mask][equal] if bin(mask).count("1") > 2: re...

0.582542

from itertools import permutations n = int(input()) p1, _, p2, _, p3, _, p4 = [input() for _ in range(n)], input(), [input() for _ in range(n)], input(), [input() for _ in range(n)], input(), [input() for _ in range(n)] def count(a,b,c,d): board = [a[i] + b[i] for i in range(n)] + [c[i] + d[i] for i in range(n)]...

0.581946

a, b = list(map(int, input().split(' '))) c, d = list(map(int, input().split(' '))) e, f = list(map(int, input().split(' '))) x=[[a, b],[c,d],[e,f]] x.sort() a, b, c, d, e, f = x[0][0], x[0][1], x[1][0], x[1][1], x[2][0], x[2][1] if (a==c==e or b==d==f): print(1) quit() if a == c: if b<f<d: print(3...

0.57971

import math def csb(n): count = 0 while (n): n &= (n-1) count+= 1 return count def f(ca,cb,i,cf,C,n,dp): if ca<0 or cb<0: return 0 if i==n: if ca==0 and cb==0 and cf==0: return 1 return 0 st=str(ca)+" "+str(cb)+" "+str(cf)+" "+str(i) if dp.get(st)!=None: return dp[st] x=0 if (C&(1<<i))>0:...

0.578861

A=list(map(int,input().split())) A.sort(reverse=True) print((A[0]-A[2]))

0.578674

#!/usr/bin/env python3 a = input() b = input() sumi = 0 for i in range(len(b) - len(a) + 1): if b[i] == '1': sumi += 1 lowest = 0 highest = len(b) - len(a) + 1 total = 0 for i in range(len(a)): if a[i] == '0': total += sumi else: total += highest - lowest - sumi if b[lowest]...

0.57263

A, B, C = map(int, input().split()) print(min(B//A, C))

0.572043

def maximum_xor_secondary(sequence): stack, answer = [], 0 for x in sequence: while stack: answer = max(answer, stack[-1] ^ x) if stack[-1] > x: break else: stack.pop() stack.append(x) return answer size, num = input(), [...

0.571654

n, m = list(map(int, input().split())) a = list(map(int, input().split())) b = list(map(int, input().split())) possible = [[] for i in range(n)] for i in range(n): for j in range(m): possible[i].append(a[i] & b[j]) import sys for answer in range(2 ** 9): answer_flag = 1 for i in range(n): ...

0.571522

a = int(input()) b = int(input()) c = 1+2+3 print((c - (a+b)))

0.569272

def flipping_game(num): current = 0 biggest = 0 for i in num: current = max(0, current - ( i or -1 ) ) biggest = max(biggest, current) return sum(num) + (biggest or -1)

0.565326

def number_of_carries(a, b): ans, carrie = 0, 0 while a > 0 or b > 0: carrie = (a%10 + b%10 + carrie) // 10 ans += [0,1][carrie > 0] a //= 10 b //= 10 return ans

0.563261

class Solution: def singleNumber(self, nums): """ :type nums: List[int] :rtype: int """ a = set(nums) a = sum(a)*3 - sum(nums) return int(a/2)

0.563136

def zero(strx): k = [] str2 = list(strx) for i in range(1, len(str2)): str3 = str2[:] str3[i] = '0' k.append(''.join(str3)) return k a = [] for i in range(1, 64): a += zero('1'*i) ct = 0 x, y = list(map(int, input().split(' '))) for i in a: if x <= int(i, 2) <= y: ...

0.563022

# Python3 program to find XNOR # of two numbers import math def swap(a, b): temp = a a = b b = temp # log(n) solution def xnor(a, b): # Make sure a is larger if (a < b): swap(a, b) if (a == 0 and b == 0): return 1; # for last bit of a a_rem = 0 # for last bit of b b_rem = 0 # counter for count bi...

0.562884

class Solution: def findIntegers(self, num): """ :type num: int :rtype: int """ dp=[1,2] for i in range(2,32): dp.append(dp[i-1]+dp[i-2]) bnum=bin(num)[2:] size=len(bnum) ans=dp[size] for i in range(1,s...

0.561333

import sys input = sys.stdin.readline def solve(ax,ay,bx,by,cx,cy): x = ax+bx+cx y = ay+by+cy x -= x//3+1 y -= y//3+1 if x==y: return x if 0 <= x <= 1 else abs(x)+1 else: return max(abs(x), abs(y)) T = int(input()) for _ in range(T): ax,ay,bx,by,cx,cy = map(int,input().spli...

0.560739

a,b=map(int,input().split()) ans=0 while a>0 and b>0: if max(a,b)>1: ans+=1 if a<b: a+=3 else: b+=3 a-=2;b-=2 print(ans)

0.560705

class Solution: def hammingWeight(self, n: int) -> int: count = 0 while n!=0: n &= (n-1) count += 1 return count

0.560551

class Solution: def minSwap(self, A: List[int], B: List[int]) -> int: n = len(A) if n == 1: return 0 dp = [[float('inf'), float('inf')] for _ in range(n)] dp[0] = [0,1] #[natural, swapped] for i in range(1, n): if A[...

0.559779

def folding(a,b): squares = 1 while a != b: squares += 1 b, a = sorted((a - b, b)) return squares

0.558863

a = list(map(int, input().split())) m = max(a) ans = 0 for i in range(3): if a[i] < m - 1: ans += (m - 1) - a[i] a[i] = m - 1 print(ans)

0.558847

class Solution: def flipLights(self, n, m): """ :type n: int :type m: int :rtype: int """ states = set() for op_odd in [0, 1]: for op_even in [0, 1]: for op_third in [0, 1]: op_all = m - op_odd - op_ev...

0.5588

from functools import reduce from gmpy2 import comb from operator import xor def transform(a, x): return reduce(xor, (comb(n + 1, x + 1) for n in a))

0.558676

def shared_bits(a, b): return bin(a & b).count('1') > 1

0.557235

from collections import defaultdict N,K = list(map(int, input().split())) A = list(map(int, input().split())) BMAX = 40 """ ・K以下の非負整数の範囲で〜：桁DP感ある・XORをとる：桁ごとに確認できる・Xを選んで、f = X xor A1 + X xor A2 + ... + X xor AN 　 -> それぞれのAと毎回 xor 取るのではなく、桁ごとに xor を取ることができる　←　超重要のはず　 -> A1 ~ AN の各桁（2進数の時の）に1が立っているのが何個あるか数えておく遷移 dp...

0.556533

s=input().split() for i in range(3): s[i]=int(s[i]) s.sort() ans=s[0]//3 +s[1]//3 +s[2]//3 x=s[0]%3 y=s[1]%3 z=s[2]%3 if(x==0 and y==z==2 and s[0]!=0): ans+=1 if(y==0 and x==z==2 and s[1]!=0): ans+=1 if(z==0 and y==x==2 and s[2]!=0): ans+=1 ans+=min(x,y,z) print(ans)

0.556184

def three_amigos(numbers): return min( ([a, b, c] for a, b, c in zip(numbers, numbers[1:], numbers[2:]) if a & 1 == b & 1 == c & 1), key=lambda triple: max(triple) - min(triple), default=[])

0.555403

k2, k3, k5, k6 = list(map(int, input().split())) c = min(k2, k5, k6) k2 -= c ans = 256 * c ans += 32 * min(k3, k2) print(ans)

0.555339

from collections import defaultdict, deque, Counter from heapq import heappush, heappop, heapify import math import bisect import random from itertools import permutations, accumulate, combinations, product import sys import string from bisect import bisect_left, bisect_right from math import factorial, ceil, floor fro...

0.554826

class Solution: def minimumOneBitOperations(self, n: int) -> int: s = 0 m = n while m: s += m & 1 m >>= 1 k = 1 while s: s -= bool(n & k) n ^= (s & 1) and k k <<= 1 return n

0.554481

n = int(input()) a_list = sorted([int(x) for x in input().split()]) b_list = sorted([int(x) for x in input().split()]) c_list = sorted([int(x) for x in input().split()]) import bisect sum = 0 for b in b_list: b_num = bisect.bisect_left(a_list,b) c_num = bisect.bisect_right(c_list,b) sum += b_num*(len(c_lis...

0.553854

# coding=utf-8 from functools import reduce a = input() b = input() c = input() alen = len(a) blen = len(b) clen = len(c) kmpnext = [0]*(clen+1) i = 1 j = 0 while i < clen: while j > 0 and c[i]!=c[j]: j = kmpnext[j] if c[i] == c[j]: j+=1 kmpnext[i+1] = j i+=1 #print(kmpnext) f = [[[0 for i in range(clen+2)]...

0.553312

A = input() B = input() C = input() turn = 'a' while True: if turn == 'a': if len(A) == 0: print('A') break turn = A[0] A = A[1:] elif turn == 'b': if len(B) == 0: print('B') break turn = B[0] B = B[1:] else: if len(C) == 0: print('C') break turn...

0.553121

def binary(n): curr=0 while(n>0): if(n%2): curr+=1 n=n//2 return curr l=input().split() n=int(l[0]) k=int(l[1]) l=input().split() li=[int(i) for i in l] arr=[] for i in range(2**15): if(binary(i)==k): arr.append(i) hashi=dict() for i in li: if i in hashi: ...

0.552836

class Solution: def countGoodTriplets(self, arr: List[int], a: int, b: int, c: int) -> int: da = defaultdict(set) db = defaultdict(set) dc = defaultdict(set) for i in range(len(arr)-1): for j in range(i+1,len(arr)): dis = abs(arr[j]-arr[i]) ...

0.551704

N = int(input()) A = [int(i) for i in input().split()] B = [int(i) for i in input().split()] C = [int(i) for i in input().split()] ans = 0 for i in range(N): ans += B[A[i]-1] if(A[i] == A[i-1]+1 and i != 0): ans += C[A[i]-2] print(ans)

0.548586

import sys inp = sys.stdin #inp = open('input.txt', 'r') n = int(inp.readline()) a = list(map(int, inp.readline().split())) best = [0, 0, 0] for i in range(n): nx_best = [0, 0, 0] if a[i] in (1, 3): nx_best[1] = max(best[0], best[2]) + 1 if a[i] in (2, 3): nx_best[2] = max(best[0], best[...

0.547601

a,b=map(int,input().split()) ans=0 for i in range(0,40): for j in range(0,40): if (2**i)*(3**j)>=a and (2**i)*(3**j)<=b: ans+=1 print(ans)

0.546944

a, b = map(int, input().split()) d, c = map(int, input().split()) print(max(abs(a - d), abs(b - c)))

0.545795

n = sum(list(map(int, input().split()))) A = [0 for i in range(n)] DP = [[0 for i in range(3)] for i in range(n)] for i in range(3): for j in map(int, input().split()): A[j - 1] = i DP[0] = [A[0] != i for i in range(3)] for i in range(1, n): DP[i][0] = DP[i - 1][0] + (A[i] != 0) DP[i][1] = min(DP[i - 1][0], D...

0.545417

import sys input = sys.stdin.readline N=int(input()) A=list(map(int,input().split())) XOR=0 for a in A: XOR^=a for i in range(N): A[i] &=~XOR USED=[0]*N for bi in range(60,-1,-1): for i in range(N): if USED[i]==0 and A[i] & (1<<bi)!=0: USED[i]=1 useind=i ...

0.544693

class Solution: def getMax(self, arr, m, n): res = 0 for e in arr: if m >= e[0] and n >= e[1]: res += 1 m -= e[0] n -= e[1] return res def findMaxForm(self, strs, m, n): """ :type strs: List[str]...

0.544367

a, b, c = map(int, input().split()) d = 1073741824 p = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97] t = [{} for i in range(101)] ans = {} for i in p: j = i m = 1 while j < 101: for k in range(j, 101, j): t[k][i] = m j = j * i ...

0.542769

n, x = list(map(int, input().split())) ar = list(map(int, input().split())) cnt = {} ans = 0 for val in ar: cur = val ^ x if cur in cnt: ans += cnt[cur] if val in cnt: cnt[val] += 1 else: cnt[val] = 1 print(ans)

0.542339

n = int(input()) l = list(map(int, input().split())) best = 0 for i in range(n): for j in range(i, n): for k in range(j, n): best = max(best, l[i] | l[j] | l[k]) print(best)

0.541735

a,b,c=list(map(int,input().split())) k=int(input()) x=max(a,b,c) print(((a+b+c)-x+x*(2**k)))

0.541648

# AC import sys sys.setrecursionlimit(1000000) class Main: def __init__(self): self.buff = None self.index = 0 def __next__(self): if self.buff is None or self.index == len(self.buff): self.buff = self.next_line() self.index = 0 val = self.buff[self.ind...

0.541504

class Solution: def integerReplacement(self, n): """ :type n: int :rtype: int """ ''' if n == 1: return 0 if not (n & 1): return self.integerReplacement(n//2) + 1 return min(self.integerReplacement(n+1), self.integerR...

0.540732

n, a, b = list(map(int,input().split())) l = input().split() o = 0 c = 0 for i in l: if i == '2': if b > 0: b -= 1 else: o += 2 if i == '1': if a > 0: a -= 1 elif b > 0: b -= 1 c += 1 elif c > 0: c -=...

0.540606

aa=0 a, b, c, d = (list(map(int, input().split(' ')))) l = list(map(int, input().split(' '))) for i in range(2**a): k = bin(i)[2:] t = 0 k = '0' * (a-len(k)) + k x = [] for j in range(a): if k[j] == '1': x.append(l[j]) t += 1 if t >= 2: if b...

0.540178

def bits_war(numbers): odd, even = 0, 0 for number in numbers: if number % 2 == 0: if number > 0: even += bin(number).count('1') else: even -= bin(number).count('1') else: if number > 0: odd += bin(number).count(...

0.539826

n=int(input()) F = [int(input().replace(" ",""),2) for _ in range(n)] P = [list(map(int,input().split())) for _ in range(n)] total = -10**9 for i in range(1,2**10): pgain = 0 for f,p in zip(F,P): pgain += p[bin(f&i).count("1")] if total < pgain: total = pgain k = i print(total)

0.538896

n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) c = list(map(int, input().split())) fed_left = {0 : a[0]} not_fed_left = {0 : b[0]} for i in range(1, n): fed_left[i] = max(fed_left[i-1] + b[i], not_fed_left[i-1] + a[i]) # max(fed left, fed right) not_fed_left[i] = max(fed_le...

0.537812

a = int(input()) b = int(input()) c = int(input()) x = int(input()) ans = 0 for i in range(a + 1): for j in range(b + 1): maisuuOf50 = (x - i * 500 - j * 100) / 50 if 0 <= maisuuOf50 <= c: ans += 1 print(ans)

0.537574

def xor(a,b): return a != b

0.537275

ii = lambda: int(input()) mi = lambda: list(map(int, input().split())) li = lambda: list(mi()) a, b, c, d = mi() a, b, c = sorted([a, b, c]) ans = max(0, d - (b - a)) + max(0, d - (c - b)) print(ans)

0.537215

n=int(input()) a=int(input()) b=int(input()) c=int(input()) r=n//a if n > c: r=max(r,(r-b+c)//a+1,(n-c)//(b-c)+((n-c)%(b-c)+c)//a) print(r)

0.537178

#!/usr/bin/env python n = int(input()) a = list(map(int, input().split())) k = [None, 4, 8, 15, 16, 23, 42] s = [n, 0, 0, 0, 0, 0, 0] for ai in a: for i in range(6, 0, -1): if ai == k[i] and s[i - 1] > 0: s[i] += 1; s[i - 1] -= 1 break print(n - 6 * s[-1])

0.536258

cij = [list(input()) for _ in range(3)] print(cij[0][0] + cij[1][1] + cij[2][2])

0.536012

n1 = int( input() ) n2 = int( input() ) n3 = int( input() ) print( min( n1 , n2 // 2 , n3 // 4 ) * 7 )

0.535744

# cook your dish here tc=int(input()) for j in range(tc): ip=list(map(int,input().rstrip().split())) x=ip[0] y=ip[1] n=ip[2] cnt=0 if(x==y): print('0') continue ln=bin(x).replace("0b", "") rn=bin(y).replace("0b", "") ll=len(ln) rl=len(rn) #print(ln) #print(rn) if(ll==len(rn)): for i in range(ll): ...

0.535502

a, A = list(map(int,input().split())) b, B = list(map(int,input().split())) c = input() c = int(c[:2]) * 60 + int(c[-2:]) d = 0 for i in range(5 * 60, 24 * 60, b): if i < c + A and i + B > c: d += 1 print(d)

0.534709

L=[] for i in range(5): s=input().split() L.append(list(s)) for i in range(5): for j in range(5): if(L[i][j]=="1"): row=i col=j x=abs(row-2)+abs(col-2) print(x)

0.534684

def my_first_kata(a,b): #your code here if type(a) == int and type(b) == int: return a % b + b % a else: return False

0.53442

a = int(input()) b = int(input()) c = int(input()) d = int(input()) sum = (min(a, b) + min(c, d)) print(sum)

0.534406

def f(m): v = 0 for x in m: v |= x return v input() print(f(map(int, input().split())) + f(map(int, input().split())))

0.534326

t=int(input()) for nt in range(t): a,b,c=map(int,input().split()) print (max(0,abs(a-b)+abs(b-c)+abs(a-c)-4))

0.534123

K,A,B = map(int,input().split()) if A + 2 > B: print(K + 1) return start = A - 1 K -= start ans = K//2 * (B-A) + K%2 + start + 1 print(ans)

0.53402

You are given K eggs, and you have access to a building with N floors from 1 to N. Each egg is identical in function, and if an egg breaks, you cannot drop it again. You know that there exists a floor F with 0 <= F <= N such that any egg dropped at a floor higher than F will break, and any egg dropped at or below floo...

class Solution: def superEggDrop(self, K: int, N: int) -> int: def f(t): a=0 r=1 for i in range(1, K+1): r *= (t-i+1) r//=i a+=r if a>=N: break return a l, h=...

0.775536

class Solution: def arrangeCoins(self, n): """ :type n: int :rtype: int """ #brute force: #m = i (i+1) / 2 #i = 0 #while True: # row = i * (i+1) / 2 # if n - row < 0: # return i - 1 # i += 1...

0.705472

def gg(n,lol): ans = 0 cur = 1 lol2 = lol while(2*lol+1<=n): cur *= 2 ans += cur lol = 2*lol+1 lol2 *= 2 if lol2*2 <= n: ans += n-lol2*2+1 return ans n,k = list(map(int,input().split())) low = 1 high = n//2 res = 1 while low <= high: mid = (low+high)//2 if gg(n,mid) >= k: res = mid low = mid+1 ...

0.687921

from collections import deque def count_ways(n, k): s,d = 1,deque([0]*k) for i in range(n): d.append(s) s = 2*s-d.popleft() return s-d.pop()

0.687132

n, k = map(int, input().split()) res = 1 while (k % 2 == 0): res += 1 k //= 2 print(res)

0.681487

from collections import deque def dbl_linear(n): h = 1; cnt = 0; q2, q3 = deque([]), deque([]) while True: if (cnt >= n): return h q2.append(2 * h + 1) q3.append(3 * h + 1) h = min(q2[0], q3[0]) if h == q2[0]: h = q2.popleft() if h == q3[0]: h = q3.po...

0.677847

# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!! # TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!! # TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!! from sys import stdin, stdout from collections import defaultdict from collections import deque import math import copy #T = int(input()) #N = int(input()) #s1 = input() #s2 = input() N,K = [int(x) for...

0.66987

class Solution: def findMinFibonacciNumbers(self, k: int) -> int: fib = [1, 1] # initializing a Fibonacci table with F[0] and F[1] i = 1 # index that will represent the last filled index of table temp = fib[0] + fib[1] # initial value of values to be appended while temp < k: # we kee...

0.664403

def fun(k): n = 1 + 8*k s = math.floor(n**0.5)-1 s = s//2 return s class Solution: def reachNumber(self, target): """ :type target: int :rtype: int """ if target<0: target *= -1 L = [[3,2,1,1],[1,1,3,2]] k = fun(targe...

0.652753

def find_f1_eq_f2(n,k): s = set(range(k)) while True: n += 1 testn = n while True: f = set(map(int,str(testn))) if f<=s: if f==s: return n break testn += n

0.646429

from math import ceil, log def how_many_measurements(n): return ceil(log(n, 3))

0.645223

class Solution: def integerReplacement(self, n): """ :type n: int :rtype: int """ ''' if n == 1: return 0 if not (n & 1): return self.integerReplacement(n//2) + 1 return min(self.integerReplacement(n+1), self.integerR...

0.641356

R=lambda:list(map(int,input().split())) n,k=R() a=sorted(R()) b=0 for i in a: while i>k+k: k+=k b+=1 k=max(k,i) print(b)

0.640226

from math import log2 def t(n): if n == 0: return 0 k = int(log2(n)) i = n - 2**k if i == 0: return (2**(2*k+1)+1) // 3 else: return t(2**k) + 2*t(i) + t(i+1) - 1 toothpick = t

0.631908

""" Codeforces Good Bye 2016 Contest Problem A Author : chaotic_iak Language: Python 3.5.2 """ ################################################### SOLUTION def main(): n,k = read() avail = 240-k i = 1 while i <= n and avail >= 5*i: avail -= 5*i i += 1 print(i-1) ################...

0.630469

from math import ceil, sqrt def layers(n): return ceil(sqrt(n)) // 2 + 1

0.630048

R=lambda:list(map(int,input().split())) n,k=R() if k==1:print(n) else: i=0 while (1<<i)<=n:i+=1 print((1<<i)-1)

0.629469

from math import ceil def branch(n): if n == 1: return 0 l = int(ceil(n ** 0.5)) // 2 n -= (2 * l - 1) ** 2 + 1 return n // (2*l or 1)

0.628397

n, k = list(map(int, input().split())) ans = 0 while int(n) > 0: n = n // k ans += 1 print(ans)

0.627881

def f(k,n): a = [] for i in range(0,n+1): if i < k: a += [i+1] else: a += [a[-1] + a[i//k]] return a[-1]

0.623727

N,K=input().split() N,K=int(N),int(K) if(N%2==0): if(K<=N//2): print(2*K-1) else: K-=N//2 print(2*K) else: if(K<=N//2+1): print(2*K-1) else: K-=N//2+1 print(2*K)

0.622491

N, K = list(map(int, input().split())) print((K+N-1)//N)

0.621724

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline n=int(input()) ans=1 while 2**ans-1<n: ans+=1 print(ans)

0.62168

from math import log2 def operation(a,b, n = 0): while log2(a) % 1: n += 1 a //= 2 return n + abs(log2(a/b))

0.619958

n, k = map(int, input().split()) a = [] i = 2 while (i * i <= k): if (k % i == 0): a.append([i, 0]) while (k % i == 0): a[len(a) - 1][1] += 1 k //= i i += 1 if (k > 1): a.append([k, 1]) ans = 10 ** 20 for i in a: cnt = 0 x = i[0] while (x <= n): cn...

0.618091

def nck(n, k, cache = {}): if k > n or k < 0: return 0 if k == 0 or k == n: return 1 if k*2 > n: k = n-k if (n, k) in cache: return cache[(n, k)] z = cache[(n, k)] = nck(n-1, k-1) + nck(n-1, k) return z def bits(n): b = 0 while n: if n&1: b += 1 n >>= 1 return b de...

0.61657

#THanks to easter eggs kata ;* def height(n, m): if n >= m: return (2 ** (min(n, m)) - 1) f = 1 res = 0 for i in range(n): f = f * (m - i) // (i + 1) res += f return res def solve(emulator): m = emulator.drops n = emulator.eggs h = 0 tryh = 0 while n and...

0.613333

#!/usr/bin/env python3 import sys sys.setrecursionlimit(10**6) n = int(input()) k = int(input()) ans = 1 for i in range(n): if ans*2 <= (ans+k): ans *= 2 else: ans += k # print(ans) print(ans)

0.612798

class Solution: def bulbSwitch(self, n): """ :type n: int :rtype: int """ if n == 0: return 0 else: return int(n**0.5)

0.60765

# cook your dish here from sys import stdin,stdout from collections import deque,defaultdict from math import ceil,floor,inf,sqrt,factorial,gcd,log from copy import deepcopy ii1=lambda:int(stdin.readline().strip()) is1=lambda:stdin.readline().strip() iia=lambda:list(map(int,stdin.readline().strip().split())) isa=lambd...

0.607015

from sys import stdin as cin from sys import stdout as cout def main(): n = int(cin.readline()) o = 0 for x in range(9, 0, -1): if 10 ** x // 2 <= n: ##print(x) for i in range(9): q = 10 ** x * (i + 1) // 2 - 1 if q <= n: o...

0.60568

from math import sqrt for _ in range(int(input())): n, k = map(int, input().split()) fact,i = [],1 while i<=sqrt(n): if n%i==0: if (n // i != i): fact.append(n//i) fact.append(i) i+=1 tot = (k*(k+1))//2 mx = -1 for i in fact: if i>=tot: mx = max(mx,n//i) print(mx)

0.604906

class Solution: def numSquares(self, n): """ :type n: int :rtype: int """ while(n%4 == 0): n = n/4 if n%8 == 7: return 4; a = int(0) while(a*a <= n): b = int(math.sqrt(n-a*a)) if (a*a+b*b == n): ...

0.602896

n, k = list(map(int, input().split())) def get(x): if x <= k: return x * (x + 1) // 2 res = k * x - k * (k - 1) // 2 sz = x - k - 1 if sz % 2 == 0: cnt = sz // 2 res += (2 + sz) * cnt // 2 else: cnt = sz // 2 + 1 res += (1 + sz) * cnt // 2 return res l...

0.59983

class Solution(object): def findKthNumber(self, n, k): """ :type n: int :type k: int :rtype: int """ s,nn=0,str(n) while nn: if not k: return s c,m=0,10**(len(nn)-1) mm,p,t=(m-1)//9,int(nn)//m,0 for i...

0.599152

from math import ceil n, k = list(map(int, input().split())) print(ceil((8 * n) / k) + ceil((5 * n) / k) + ceil((2 * n) / k))

0.597183

n = int(input()) x = 0 cur = 1 lst = 1 while cur + lst <= n: cur, lst = cur + lst, cur x += 1 print(x)

0.59714

import math class Solution: def smallestGoodBase(self, n): n = int(n) maxLength = int(math.log(n,2)) for m in range(maxLength, 1, -1): k = int(n**m**-1) if (k**(m+1) - 1)//(k - 1) == n: return str(k) return str(n-1) """ ...

0.596006

class Solution: def minOperations(self, n: int) -> int: return (n*n)>>2

0.594948

def find_lowest_int(k1): k2, n = k1 + 1, 1 def digits(n): return sorted(str(n)) while digits(n*k1) != digits(n*k2): n += 1 return n

0.591982

import sys sys.setrecursionlimit(10000) n = input() k = int(input()) m = {} def doit(n, k): if len(n) == 0: return k == 0 d = int(n[0]) if (n, k) not in m: ret = 0 for i in range(d + 1): if i == d: ret += doit(n[1:], k - 1 if i > 0 else k) e...

0.591442

import functools class Solution: @functools.lru_cache() def minDays(self, n: int) -> int: if n <= 1: return n return 1 + min(n%2 + self.minDays(n//2), n%3 + self.minDays(n//3))

0.590901

n=int(input()) if n==2: print(2) else: print(1)

0.588914

import math def count(n): if n is 0: return 0 x = int(math.log(n, 2)) return x * 2 ** (x - 1) + n - 2 ** x + 1 + count(n - 2 ** x) def countOnes(left, right): return count(right) - count(left - 1)

0.586636

def can(n, k): total = n s = 0 while n > 0: cur = min(n, k) s += cur n -= cur n -= n // 10 return s * 2 >= total n = int(input()) le = 0 rg = n while rg - le > 1: mid = (rg + le) // 2 if can(n, mid): rg = mid else: le = mid print(rg)

0.58638

def compute_depth(n): i = 0 digits = set() while len(digits) < 10: i += 1 digits.update(str(n * i)) return i

0.583919

def get_number_of_squares(n): k = 1 while k*(k+1)*(2*k+1)/6 < n: k+=1 return k-1

0.582349

def find_min_num(d, n=1): while div_num(n) != d: n += 1 return n def div_num(n): s = n**0.5 return sum(2 for k in range(1, int(s)+1) if n % k == 0) - (s % 1 == 0)

0.581957

from itertools import islice, count def u1(): a = {1:1, 2:1} yield a[1] yield a[2] for n in count(3): a[n] = a[n-a[n-1]] + a[n-a[n-2]] yield a[n] def length_sup_u_k(n, k): return len(list(filter(lambda x: x >= k, islice(u1(), 1, n)))) def comp(n): return sum(k1 < k0 fo...

0.581472

from scipy.special import comb def multiply(n, k): r, d = 1, 2 while d * d <= n: i = 0 while n % d == 0: i += 1 n //= d r *= comb(i + k - 1, k - 1, exact=True) d += 1 if n > 1: r *= k return r

0.580756

try: n , k = list(map(int,input().split())) for i in range(k): if n % 10 == 0: n = n/10 else: n -= 1 print(int(n)) except: pass

0.580364

def going(n): s = 1.0 for i in range(2, n + 1): s = s/i + 1 return int(s * 1e6) / 1e6

0.57954

def l2i(s): return [int(i) for i in s.split()] a, b=l2i(input()) t=0 while (a<=b): a*=3 b*=2 t+=1 print(t)

0.579084

n,k=map(int,input().split()) low=1 high=n import sys while low<=high: mid=(low+high)//2 if mid*(mid+1)//2 -(n-mid)>k: high=mid-1 elif mid*(mid+1)//2-(n-mid)==k: print(n-mid) return else : low=mid+1

0.578628

print(max(1, 4 * int(int(input()) * 2 ** 0.5)))

0.577369

#!/usr/bin/env python3 n, k = list(map(int, input().split())) ans = max(0, min(n, k - 1) - k // 2) print(ans)

0.577215

class Solution: dp = {0: 0} def racecar(self, target: int) -> int: if target in self.dp: return self.dp[target] n = target.bit_length() if 2**n - 1 == target: self.dp[target] = n else: self.dp[target] = self.racecar(2**n - 1 - target) + n + 1 ...

0.576385

from math import ceil PI_DIGITS_SQUARED = [int(d)**2 for d in "31415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679"] def square_pi(n): return ceil(sum(PI_DIGITS_SQUARED[:n])**0.5)

0.575083

class Solution: def leastOpsExpressTarget(self, x: int, target: int) -> int: def dp(i, j): if i==0: return 2*j # if j==0: return 0 if j==1: return 2 if (i, j) in memo: return memo[(i, j)] base = x**i q, r = divmod(j, base) i...

0.574731

import sys, math def rnd(x): a = int(x) b = x-a if b>=0.5: a+=1 return(a) n = int(input()) print(rnd(n/2))

0.573909

def shortest_steps_to_num(num): steps = 0 while num != 1: if num % 2: num -= 1 else: num //= 2 steps += 1 return steps

0.57348

class Solution: dictionary = {} def climbStairs(self, n): """ :type n: int :rtype: int """ number = 0 if n == 0 or n == 1: return 1 if n in self.dictionary: return self.dictionary[n] else: numb...

0.573369

n,k = map(int,input().split()) ans = 0 for i in range(1,n+1): if i>=k: ans += (1/n) continue x = 1 while 1: i *= 2 if i>=k: break else:x+=1 ans += (1/n)*(1/2)**x print(ans)

0.572349

import sys # B - log import math n = int(input()) i = math.floor(math.sqrt(n*2))-1 while True: total = (2+i) * (i+1) // 2 if total <= n+1: i += 1 else: break print(n-i+1)

0.571991

from math import log def alex_mistakes(n, time): return int(log((time - n * 6) / 5 +1, 2))

0.571211

from math import floor, sqrt import bisect import math def rwh_primes2(n): # https://stackoverflow.com/questions/2068372/fastest-way-to-list-all-primes-below-n-in-python/3035188#3035188 """ Input n>=6, Returns a list of primes, 2 <= p < n """ correction = (n%6>1) n = {0:n,1:n-1,2:n+4,3:n+3,4:n+2,5:n+...

0.570096

def solve(n): def length(n): s = 0 for i in range(20): o = 10 ** i - 1 if o > n: break s += (n - o) * (n - o + 1) // 2 return s def binary_search(k): n = 0 for p in range(63, -1, -1): if length(n + 2 ** p) < k: n += 2 ** p ...

0.569567

n, k = list(map(int, input().split())) result = 10 ** 26 for i in range(1, k): if n % i == 0: t = n // i result = min(result, t * k + i) print(result)

0.568983

N, K = map(int, input().split()) A = list(map(int, input().split())) ans = [] c = 2**30 r = 2**30 while r: r //= 2 l = sum(-(-a//c)-1 for a in A) if l > K: c += r else: ans.append(c) c -= r print(ans and min(ans) or 1)

0.568685

from collections import Counter, defaultdict import itertools import sys def main(): n = int(input()) ans = 1 for k in range(1, 10): v = ((1 << k) - 1) * (1 << (k - 1)) if n % v == 0: ans = v print(ans) main()

0.568341

N = int(input()) ANS = 1 for i in range(1,N-1): ANS += (N-1)//i print(ANS)

0.568017

mod = 1000000007 eps = 10**-9 def main(): import sys input = sys.stdin.readline N, K = list(map(int, input().split())) if K == 1: if N == 1: print((1)) else: print((pow(2, N - 2, mod))) return dp = [[0] * (N+1) for _ in range(K-1)] for j in ra...

0.566892

class Solution: def integerBreak(self, n): """ :type n: int :rtype: int """ if n==2:return 1 if n==3:return 2 res=1 while n>4: n=n-3 res*=3 return res*n

0.566275

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): #print(*args, **kwargs, file=sys.stderr) # in python 3.4 **kwarg...

0.565798

#!/usr/bin/env python3 import sys def solve(N: int): if N >= 64: print((64)) elif N >= 32: print((32)) elif N >= 16: print((16)) elif N >= 8: print((8)) elif N >= 4: print((4)) elif N >= 2: print((2)) else: print((1)) return # G...

0.565787

def read_int(): return int(input()) def read_ints(): return list(map(int, input().split(' '))) t = read_int() for case_num in range(t): n, k = read_ints() i = 1 largest = 1 while i * i <= n: if n % i == 0: if i <= k: largest = max(largest, i) i...

0.564544

for i in range(eval(input())): n,k=input().strip().split() n=int(n) k=int(k) print(int( ((n-k)&(int((k-1)/2)))==0))

0.564426

from math import * def count(n): return ceil(lgamma(n+1)/log(10))

0.563737

s = int(input(), 2) t, ans = 1, 0 while t < s: ans += 1 t *= 4 print(ans)

0.561387

def hamming(n): bases = [2, 3, 5] expos = [0, 0, 0] hamms = [1] for _ in range(1, n): next_hamms = [bases[i] * hamms[expos[i]] for i in range(3)] next_hamm = min(next_hamms) hamms.append(next_hamm) for i in range(3): expos[i] += int(next_hamms[i] == next_hamm)...

0.559393

input = __import__('sys').stdin.readline MIS = lambda: map(int,input().split()) n, k = MIS() prob = list(MIS()) while prob and prob[0] <= k: prob.pop(0) while prob and prob[-1] <= k: prob.pop() print(n - len(prob))

0.559088

class Solution: def monotoneIncreasingDigits(self, N): """ :type N: int :rtype: int """ arr = [int(ch) for ch in str(N)] # create array from number 1234 => [1,2,3,4] marker = len(arr) i = len(arr)-2 while i >= 0: ...

0.558552

h = int(input()) ans = 0 n = 0 while h != 0: ans += 2**n n += 1 h = h//2 print(ans)

0.558344

import heapq n, k = list(map(int, input().split())) s = input() mostRecent = n best = [] for room in range(n-1, -1, -1): if s[room] == '1': mostRecent = room best.append(mostRecent) best = best[::-1] dp = [0] vals = [(0,0)] for room in range(1, n + 1): new = dp[-1] + room if room - k - 1 >...

0.55795

def faro_cycles(n): x, cnt = 2, 1 while x != 1 and n > 3: cnt += 1 x = x*2 % (n-1) return cnt

0.557595

from math import log10 def rocks(n): return (n + 1) * int(log10(n) + 1) - (10 ** int(log10(n) + 1) - 1) // 9

0.554762

class Solution: def clumsy(self, N: int) -> int: if N <= 2: return N if N <= 4: return N + 3 if (N - 4) % 4 == 0: return N + 1 elif (N - 4) % 4 <= 2: return N + 2 else: return N - 1

0.55472

h, n = list(map(int, input().split())) c, m = 0, 2 ** h r = 0 while m > 1: if c == 0: if n > m // 2: r += m - 1 n -= m // 2 c = 1 - c else: if n > m // 2: n -= m // 2 else: r += m - 1 c = 1 - c c = 1 - c r +=...

0.554034

x=int(input()) m=-1000 if 1<=x<=3: print((1)) return else: for b in range(2,x+1): for p in range(2,11): if x>=b**p: m=max(m,b**p) print(m)

0.553032

def collatz(n): step = 1 while n!= 1: n = [n//2, (n*3)+1][n%2] step += 1 return step

0.552939

import math def solution(n): d=0 if n - 0.25< math.floor(n): d=math.floor(n) elif n - 0.75< math.floor(n): d=math.floor(n)+0.5 else: d=math.ceil(n) return d

0.552287

class Solution: def numberOfSteps (self, num: int) -> int: steps = 0 while num > 0: if num % 2 == 0: num /= 2 else: num -= 1 steps += 1 return steps

0.552107

t = int(input()) for _ in range(t): n = int(input()) k = int(input()) num = int(k/n) x = max(n*(1+num) - k, 0) diff = abs(x - (n-x)) if diff == 0: number = 2*x - 1 else: number = min(x, n-x)*2 print(number)

0.551443

import sys def solve(): n,k, = rv() a, = rl(1) res = 0 count = [0] * 10 for i in range(n): if a[i] < 100: count[10 - (a[i] % 10) - 1] += 1 res += a[i] // 10 for i in range(10): while count[i] > 0 and k >= i + 1: res += 1 count[i] -= 1 ...

0.551264

N, K = map(int,input().split()) A = list(map(int,input().split())) if N == K: print(1) else: ans = 1 N -= K while N > 0: ans += 1 N -= (K-1) print(ans)

0.551044

# You lost the game. n,k = map(int, input().split()) r = 0 for i in range(min(k,n//2)): r += (n-2*i-1) + (n-2*i-2) print(r)

0.550432

from sys import * from collections import * from math import * input = stdin.readline tc = int(input()) for tcase in range(tc): n, k = map(int, input().split()) lo = 1 hi = 10 ** 19 ans = -1 while (lo <= hi): mid = (lo + hi) // 2 divi = mid - mid // n if (divi >= k): ans = mid hi = mid - 1 else: ...

0.550315

from collections import defaultdict d = defaultdict(bool) n = int(input()) for i in range(1000000): if d[n]: print((i + 1)) return d[n] = True if n & 1: n = n * 3 + 1 else: n >>= 1

0.550229

def hotpo(n): cnt = 0 while n != 1: n = 3 * n + 1 if n % 2 else n / 2 cnt += 1 return cnt

0.549865

def doors(n): return int(n ** .5)

0.54968

from fractions import gcd from functools import reduce def candies_to_buy(n): return reduce(lambda a,b:a*b//gcd(a,b), range(1,n+1))

0.549221

Given a string s and an integer k. You should construct k non-empty palindrome strings using all the characters in s. Return True if you can use all the characters in s to construct k palindrome strings or False otherwise. Example 1: Input: s = "annabelle", k = 2 Output: true Explanation: You can construct two palind...

from collections import Counter class Solution: def canConstruct(self, s: str, k: int) -> bool: if k > len(s): #return False return False counter = Counter(s) odd_counts = 0 for char in counter: if counter[char] % 2 == 1: odd_counts +=...

0.796013

class Solution: def hasAllCodes(self, s: str, k: int) -> bool: if len(s) < 2 ** k + k - 1: return False # Cannot be a string, as this is the de brujin length target = 2 ** k seen = set() cur_len = 0 for end in range(k, len(s) + 1): chunk = s[end - k: e...

0.721621

def palindrome_rearranging(s): return sum(s.count(c) % 2 for c in set(s)) < 2

0.717067

from functools import lru_cache class Solution: def palindromePartition(self, s: str, k: int) -> int: n = len(s) if n == k: return 0 @lru_cache(None) def cnt(left,right): # cost to make palindrome if left >= right: return 0 return ...

0.689041

def permute_a_palindrome (input): return sum( input.count(c)%2 for c in set(input) ) < 2

0.679778

def solve(s): v = sum(s[i] != s[-1-i] for i in range((len(s))//2) ) return v == 1 or not v and len(s)%2

0.673916

def solve(s): return any(s[i+1:] + s[:i+1] == s[i::-1] + s[:i:-1] for i in range(len(s)))

0.659228

#!/usr/bin/env python3 def __starting_point(): x, k = map(int, input().strip().split()) string = input().strip() if eval(string) == k: print(True) else: print(False) __starting_point()

0.656023

class Solution: def removePalindromeSub(self, s: str) -> int: # 'a' 1 # 'aa' 1 # 'ab' 2 # 'abb' 2 # 'aabb' 2 # 'abba' 1 # 'abaaba' if len(s) == 0: return 0 if s == s[::-1]: return 1 return 2

0.644263

def solve(st): return all(True if ord(x) - ord(y) in [-2, 0, 2] else False for x, y in zip(st, st[::-1]))

0.634766

class Solution: def longestPalindrome(self, s): """ :type s: str :rtype: int """ re = 0 set_s = set(s) flag = False for x in set_s: if s.count(x) % 2 == 0: re += s.count(x) elif s.count(x) >= 3 : ...

0.62967

def check(pali): for i in range(len(pali) // 2): if pali[i] != pali[-i - 1]: return False return True def __starting_point(): s = input() k = int(input()) if len(s) % k != 0: print('NO') return step = len(s) // k for i in range(k): if not chec...

0.627256

from itertools import permutations def solve(s,k): return sum(not v%k for v in map(int, map(''.join, permutations(s.split(),2))))

0.626806

""" *************************************** * O(n) time complexity solution ! * *************************************** """ def longest_palindrome (s): maxPal, tmpPal = 0, 1 count_dct = {} inPal = False for i,l in enumerate(s): count_dct[l] = count_dct.get(l,0) + 1 ...

0.620215

class Solution: def canConvertString(self, s: str, t: str, k: int) -> bool: if len(s) != len(t): return False c = Counter((ord(c2) - ord(c1)) % 26 for c1, c2 in zip(s, t)) return k >= max( (m + 26 * (count - 1) for m, count in list(c.items()) if m), ...

0.618747

class Solution: def validPalindrome(self, s): """ :type s: str :rtype: bool """ if s == s[::-1]: return True r = s[::-1] for i in range(0, len(s)): if r[i] == s[i]: continue else: ...

0.6101

from collections import Counter def longest_palindrome(s): c = Counter(filter(str.isalnum, s.lower())) return sum(v//2*2 for v in c.values()) + any(v%2 for v in c.values())

0.606812

def main(): N, K = list(map(int, input().split())) S = list(input()) base = S[0] flag = False for i in range(0, N): if K == 0: break if S[i] != base and (not flag): flag = True S[i] = base elif S[i] != base and flag: S[i] = base...

0.600151

class Solution: def minCut(self, s): """ :type s: str :rtype: int """ # acceleration if s == s[::-1]: return 0 if any(s[:i] == s[:i][::-1] and s[i:] == s[i:][::-1] for i in range(1, len(s))): return 1 # algorithm cut = [x for x in ran...

0.597735

#credits https://www.geeksforgeeks.org/minimum-steps-to-delete-a-ssing-after-repeated-deletion-of-palindrome-subssings/ n=int(input()) s=input() N = len(s) dp = [[0 for x in range(N + 1)] for y in range(N + 1)] D = [[[] for x in range(N + 1)] for y in range(N + 1)] ss="" re="" for i in range(0,N)...

0.592326

def build_palindrome(s): for n in range(len(s), -1, -1): if s[:n] == s[:n][::-1]: return s[n:][::-1] + s if s[-n:] == s[-n:][::-1]: return s + s[:-n][::-1]

0.589412

from collections import Counter def solve(s): return any(len(set(Counter(s.replace(c, '', 1)).values())) == 1 for c in s)

0.586885

class Solution: def reverseStr(self, s, k): """ :type s: str :type k: int :rtype: str """ for idx in range(0, len(s), 2*k): s = s[:idx] + s[idx:idx+k][::-1] + s[idx+k:] return s

0.585942

class Solution: def maxVowels(self, s: str, k: int) -> int: n = len(s) vowel = set(['a','e','i','o','u']) i=0 res = 0 while i<k: if s[i] in vowel: res+=1 i+=1 j=k i=0 maxV = res while j<n: if ...

0.583477

class Solution: def canArrange(self, arr: List[int], k: int) -> bool: freq = [0] * k for n in arr: freq[n%k] += 1 if freq[0] % 2: return False for i in range(1, (k//2)+1): if freq[i] != freq[k-i]: return False if k%2 is 0: ...

0.583353

n, k = [int(i) for i in input().split()] dic = dict() s = list(input()) i = 0 while i<n: j = 1 while i+j < n and s[i] == s[i+j]: j+=1 if s[i] not in dic: dic[s[i]] = [] dic[s[i]].append(j) i += j ans = 0 for i in list(dic.keys()): ct = 0 for j in dic[i]: ct+=(j//k...

0.58274

s = input() L = input() k = int(input()) '''from datetime import * time1 = datetime.now()''' good = set() string = set() LIST = [chr(i) for i in range(97,123)] for i in range(26): if L[i]=='1': good.add(LIST[i]) t = [s[i] not in good for i in range(len(s))] end = [0]*len(s) badchars = 0 front=0; rear=0 w...

0.582553

def luck_check(string): e0, b1 = len(string) // 2, (len(string) + 1) // 2 return sum(map(int, string[:e0])) == sum(map(int, string[b1:]))

0.58232

def bel(mask, bit): return (mask & (1 << bit)) != 0 read = lambda: map(int, input().split()) n, k = read() f = [0] * 100 for i in range(n): cur = int(''.join(input().split()), 2) cur ^= (1 << k) - 1 f[cur] = 1 ans = 'NO' if k == 1: if f[1]: ans = 'YES' if k == 2: f1 = f2 = 0 for i in...

0.582093

from collections import Counter from functools import reduce from math import gcd def has_subpattern(string): return reduce(gcd, Counter(string).values()) != 1

0.577294

class Solution: def shortestPalindrome(self, s): if len(s)<2: return s if len(s)==40002: return s[20000:][::-1]+s for i in range(len(s)-1,-1,-1): if s[i]==s[0]: j=0 while j<(i+1)//2 and s[i-j]==s[j]: ...

0.576044

def is_palindrome(s): s = s.lower() return s == s[::-1]

0.575002

from collections import Counter def word_square(ls): n = int(len(ls)**0.5) return n*n==len(ls) and sum(i%2 for i in list(Counter(ls).values())) <= n

0.573391

def binarySearch(arr, l, r, x): mid=0 while l <= r: mid = l + (r - l)//2; if arr[mid] == x: return mid+1 elif arr[mid] < x: l = mid + 1 else: r = mid - 1 if mid!=len(arr): if arr[mid]<x: return mid+1 return mid s=input() strt=[] end=[] plc=[] landr=[] l2r=[] lr=[] ans=0 n=len(s) if n!=1:...

0.57309

def build_palindrome(strng): n = 0 while strng[n:] != strng[n:][::-1]: n += 1 return strng + strng[:n][::-1]

0.572069

# class Solution: # def distinctEchoSubstrings(self, text: str) -> int: # ans = set() # for i in range(len(text)-1): # for j in range(i+1, (i+len(text))//2+1): # if text[i:j] == text[j:2*j-i]: ans.add(text[i:j]) # return len(ans) from collectio...

0.570649

def solution(s): st=[1 for i in range(1,len(s)) if s[i-1]==s[i]] return sum(st)

0.569368

class Solution: def isPossibleDivide(self, s: List[int], k: int) -> bool: if len(s) % k != 0: return False ctr = collections.Counter(s) for _ in range(len(s) // k): mn = [] for i in ctr: if mn == [] and ctr[i] > 0: ...

0.569251

class Solution: def countSubstrings(self, s): """ :type s: str :rtype: int """ ret = 0 left, right = 0, 0 while left < len(s): while right < len(s) and s[right] == s[left]: right += 1 ret += self.sum(right - l...

0.564927

from math import * from sys import * from queue import * from decimal import * n,k=(int(z) for z in input().split()) s=input() i=0 while i<len(s) and s[i] not in ["G","T"]: i+=1 i+=k while i<len(s) and s[i] not in ["G","T","#"]: i+=k if i>=len(s) or s[i]=="#": print("NO") else: print("YES")

0.563445

s = input() cur_len = 1 a = [] char = [] for i in range(1, len(s)): if s[i] == s[i-1]: cur_len += 1 else: a.append(cur_len) char.append(s[i-1]) cur_len = 1 a.append(cur_len) char.append(s[len(s)-1]) ans = 0 while len(a) > 1: n = len(a) inner_min = 100000000 for i in range(...

0.559209

class Solution: def longestSubstring(self, s, k): """ :type s: str :type k: int :rtype: int """ for c in set(s): if s.count(c) < k: return max(self.longestSubstring(sp, k) for sp in s.split(c)) return len(s)

0.558282

def is_palindrome(string): return str(string)[::-1] == str(string)

0.557096

class Solution: def isValid(self, s: str) -> bool: if not s: return True return self.isValid(s.replace('abc', '')) if s.replace('abc', '') != s else False

0.554965

# cook your dish here def check_equal(a,b): index=0 for i in a: while index<len(b) and i != b[index]: index+=1 if(index>=len(b)): return False index+=1 return True def Dob_String(n): size=len(n) midpoint=size//2 if(check_equal(n[0:midpoint],n[midpoint:size])): return("YES") elif(size%2!=0 and chec...

0.55305

s=input();n=len(s)-1;print(sum(s[i]!=s[n-i]for i in range(n+1))//2)

0.551269

s=input() result=0 sub=0 last=s[0] for x in s: if x==last: sub+=1 else: if sub%2==0: result+=1 sub=1 last=x if sub%2==0: result+=1 print(result)

0.550769

n, k = map(int, input().split()) s = input() our = set() opened = set() for i in range(ord('A'), ord('Z') + 1): sym = chr(i) if sym in s: our.add(s.rfind(sym)) for i in range(len(s)): if s[i] not in opened: opened.add(s[i]) k -= 1 if k < 0: print('YES') ...

0.548915

s = input() n = len(s) dp = [[0 for i in range(n - le + 1)] for le in range(n + 1)] ans = [0 for i in range(n + 1)] for le in range(1, n + 1): for l in range(0, n - le + 1): r = l + le if s[l] != s[r - 1]: continue if le == 1: dp[1][l] = 1 ans[1] += 1 ...

0.548141

class Solution: def isPalindrome(self, s): """ :type s: str :rtype: bool """ cleanlist = [c for c in s.lower() if c.isalnum()] return cleanlist == cleanlist[::-1]

0.547622

def solve(s): n = len(s) for i in range(n): s2 = s[i:] + s[:i] # print(s2) if s != s2 and s2[::-1] == s2: return 1 for i in range( (n // 2) + 1, n): if s[i] != s[0]: return 2 # print(s[i]) return "Impossible" s = input() print(solve(s))...

0.546717

import sys stdin=sys.stdin ip=lambda: int(sp()) fp=lambda: float(sp()) lp=lambda:list(map(int,stdin.readline().split())) sp=lambda:stdin.readline().rstrip() yp=lambda:print('Yes') np=lambda:print('No') s=list(sp()) k=ip() ans=set() alpa=list(set(s)) alpa.sort() ch=0 siyou=[] for i in range(len(alpa)): if i<=2: ...

0.544571

'''input 3 4 aba ''' n, k = map(int, input().split()) t = input() for i in range(1, n): if t[i:] == t[:n-i]: print(t[:i] * k + t[i:]) break else: print(t * k)

0.544451

def solve(st): return next((n for n in range(len(st)//2, 0, -1) if st[:n] == st[-n:]), 0)

0.543772

import re def double_check(str): return bool(re.search(r"(.)\1", str.lower()))

0.543491

def res(s): if len(s) == 2: if s[0] == s[1]: print("NO") else: print("YES") elif s[0] != s[1]: counte = 0 for i in range(2, len(s)): if i % 2 == 0: if s[i] != s[0]: counte = 1 break else: if s[i] != s[1]: counte = 1 break if counte == 0: print("YES") else: p...

0.542047

def check(s,k): for i in range(k+1): if chr(ord('0')+i) not in s: return False return True n, k = map(int,input().split()) ans = 0 for i in range(n): ss = input() if check(ss,k): ans +=1 print(ans)

0.539694

S = input() x = len(S) for i in range(0, x, 2): y = x - 2 - i if S[:y//2] == S[y//2 : y]: print(len(S[:y])) break

0.538302

def prime_string(s): return (s + s).find(s, 1) == len(s)

0.538249

def gen(a, b): gener = '' for i in range(k): if a[i] == b[i]: gener += a[i] else: if 'S' not in (a[i], b[i]): gener += 'S' elif 'E' not in (a[i], b[i]): gener += 'E' else: gener += 'T' return gene...

0.53682

def solve(st,k): for l in sorted(st)[:k]: st=st.replace(l,'',1) return st

0.536338

def count_pal(n): # No recursion; direct calculation: return [9 * 10**((n-1) // 2), 10**(n // 2) * (13 - 9 * (-1)**n) // 2 - 2]

0.535695

n, k = map(int, input().split()) s = set() st = input() inp = input().split() for x in inp: s.add(x) current, ans = 0, 0 for x in st: if x in s: current += 1 else: ans += (current * (current + 1)) // 2 current = 0 ans += (current * (current + 1)) // 2 print(ans)

0.535038

class Solution(object): def longestPalindrome(self, s): """ :type s: str :rtype: str """ size = len(s) if size <= 1 or s == s[::-1]: return s start, maxlen = 0, 1 for idx in range(1, size): add2 = s[idx - maxlen - 1: ...

0.534639

class Solution: def longestDecomposition(self, text: str) -> int: n = len(text) splits = 0 leftstart, leftend = 0, 0 rightstart, rightend = n-1, n-1 while leftend<rightstart: if text[leftstart:leftend+1] == text[rightstart:rightend+1]: leftstart = ...

0.53442

class Solution: def characterReplacement(self, s, k): """ :type s: str :type k: int :rtype: int """ if s == "": return 0 count = {} lo = 0 hi = 0 max_letter = 0 for hi in range(len(s)): try:...

0.534185

def ispalin(s): ans = True for i in range(len(s)): if s[i] != s[len(s)-1-i]: ans = False break if i > len(s)//2: break return ans for _ in range(int(input())): s = input() k = '' l = '' for j in range(len(s)): if s[j] == s[len(s)-1...

0.53387

s = input() res = set() for i in range(len(s) + 5): s = s[1:] + s[0] res.add(s) print(len(list(res)))

0.533001

class Solution: def numberOfSubarrays(self, nums: List[int], k: int) -> int: # save all even subarray's length which between odds edge = [] res = 0 count = 0 for i in nums: # odd if i % 2: # +1 because range from 0 to count when doing c...

0.532114

class Solution: def getLengthOfOptimalCompression(self, s: str, k: int) -> int: n = len(s) def compLen(c): return 1 + len(str(c)) if c > 1 else 1 @lru_cache(None) def dp(i, k): # return {head: (len, -head_count)} if (n - i) <= k: return {} # ...

0.531723

def powerset(s): n = len(s) masks = [1 << j for j in range(n)] for i in range(2**n): yield [j + 1 for j in range(n) if (masks[j] & i)] def is_power2(num): return num != 0 and ((num & (num - 1)) == 0) def special(l): n = len(l) for i in range(n): lis = [i + 1] yield...

0.531617

n = int(input()) st = input() ans = n now = '' ma = 0 for i in range(n // 2): now += st[i] t = '' for j in range(i + 1, 2 * i + 2): t += st[j] if t == now: ma = i print(ans - ma)

0.530992

def subsets_parity(n, k): return 'EVEN' if ~n & k else 'ODD'

0.529582

class Solution: def repeatedSubstringPattern(self, s): return s in (s + s)[1:-1]

0.528759

def ii(): return int(input()) def mi(): return list(map(int, input().split())) def li(): return list(mi()) n, k = mi() a = li() s = input().strip() ans = 0 i = 0 while i < n: j = i + 1 while j < n and s[j] == s[i]: j += 1 b = sorted(a[i:j]) ans += sum(b[-k:]) i = j print(ans)

0.526369

class Solution: def checkRecord(self, s): count = 0 for i in range(0,len(s)): if s[i] == "A": count += 1 if count == 2: return False elif i >= 2 and s[i] == "L" and s[max(i-1,0)] == "L" and s[max(i-2,0)] == "L": ...

0.525483

alpha = [chr(ord('a')+i) for i in range(26)] n,k = list(map(int,input().split())) s = input() arr = [s.count(alpha[i]) for i in range(26)] print('YES' if max(arr) <= k else 'NO')

0.525329

from collections import Counter from functools import reduce from fractions import gcd def has_subpattern(s): c = Counter(s) m = reduce(gcd, c.values()) return ''.join(sorted(k*(v//m) for k,v in c.items()))

0.525183

# cook your dish here for _ in range(int(input())): g=input() h=g[::-1] if h==g : print(1) else: print(2)

0.524733

import math class Solution: def __init__(self): self.happy_string = '' def getHappyString(self, n: int, k: int) -> str: # determine starting character poss_per_group = 2 ** (n - 1) group_num = math.ceil(k / poss_per_group) - 1 starting_char = '' # c...

0.523926

print('YNeos'[input()+(T:=input())[-1]!=T::2])

0.523072

def checkValidity(s): count = 0 previous = "" for x in s: if count == 0: previous = x count += 1 elif count == 1: count = 0 if previous == x: return "no" return "yes" t = int(input()) for _ in range(t): s = input() print(checkValidity(s))

0.52269

import sys, math from itertools import combinations as c, product as p from collections import deque sys.setrecursionlimit(10**9) INF = float('inf') MOD = 10**9 + 7 #MOD = 998244353 def si(): return input() def ii(): return int(input()) def fi(): return float(input()) def lstr(): return input().split() def lint(): re...

0.522474

k = ''' H He Li Be B C N O F Ne Na Mg Al Si P S Cl Ar K Ca Sc Ti V Cr Mn Fe Co Ni Cu Zn Ga Ge As Se Br Kr 5 Rb Sr Y Zr Nb Mo Tc Ru Rh Pd Ag Cd In Sn Sb Te I Xe Cs Ba La Ce Pr Nd Pm Sm Eu Gd Tb Dy Ho Er Tm Yb Lu Hf Ta W Re Os Ir Pt Au Hg Tl Pb Bi Po At Rn Fr Ra Ac Th Pa U Np Pu Am Cm Bk Cf Es Fm Md No Lr Rf ...

0.522054

def palindrome_pairs(w): return [[i, j] for i in range(len(w)) for j in range(len(w)) if str(w[i])+str(w[j])==(str(w[i])+str(w[j]))[::-1] and i!=j]

0.521729

def palindrome(num): if type(num) != int or num < 0: return "Not valid" s = str(num) for i in range(len(s)-2): if s[i] == s[i+1] or s[i] == s[i+2]: return True return len(s) != 1 and s[-1] == s[-2]

0.521353

string=input() length=len(string) goodbad=[[1, 0, 0, 0] for x in range(length)] #good odd #bad odd #good even #bad even for i in range(length-1): if string[i]==string[i+1]: goodbad[i+1][0]+=goodbad[i][2] goodbad[i+1][2]+=goodbad[i][0] goodbad[i+1][1]+=goodbad[i][3] goodbad[i+1][3]+...

0.521211

import sys n, k = list(map(int, input().split(' '))) s = input() def max_streak(s): result = 0 for i in range(len(s)): j = i while j < len(s) and s[j] == 'N': j += 1 result = max(result, j - i) return result for i in range(n - k + 1): cur = list(s) for j in...

0.519001

t = int(input()) for i in range(t): n = int(input()) s = input() ans = 0 for y in range(1, n): if s[y] == s[y-1]: ans += 1 print((ans + ans % 2) // 2)

0.518186

def main(): import sys input = sys.stdin.readline # 偶数長含めた回文の長さを求める # R[2*i] = L: S[i]を中心とする奇数長の最大回文 # R[2*i+1] = L: S[i:i+2]を中心とする偶数長の最大回文 # ダミー文字を挟むが、各 R[i] は実際の回文の文字列長と一致する def manacher(S): C = [] for a in S: C.append(a) C.append(0) C.pop()...

0.516953

s = input() mx = 0 n = len(s) for l in range(n): for r in range(l, n): if s[l:r+1] != s[l:r+1][::-1]: mx = max(mx, r - l + 1) print(mx)

0.516845

class Solution: def checkInclusion(self, s1, s2): """ :type s1: str :type s2: str :rtype: bool """ if len(s2) < len(s1): return False c1 = [0] * 128 n = 0 for i in s1: c = ord(i) if c1[c] == 0: n...

0.516227

s = input() def is_palinedrome(st): for i in range(len(st)//2): if st[i] != st[-(i+1)]: return False return True s_pali = is_palinedrome(s) sub_pali_left = is_palinedrome(s[:len(s)//2]) sub_pali_right = is_palinedrome(s[len(s)//2+1:]) if s_pali and sub_pali_left and sub_pali_right: ...

0.516129

n, k = map(int, input().split()) a = [0] * n b = ['0'] * n c = [] s = input() for i in range(n): if k != 0: if s[i] == '(': c.append(i) else: d = c.pop() a[i] = 1 a[d] = 1 k -= 2 for i in range(n): if a[i] == 1: print(s[i], end ...

0.515906

def prefix(s): p = [0] for i in range(1, len(s)): j = p[-1] while j > 0 and s[j] != s[i]: j = p[j - 1] if s[i] == s[j]: j += 1 p.append(j) return p s = input() n = len(s) ans = [0] * (n + 1) i = n - 1 while i >= 0: p = prefix(s[i:]) ans[i] =...

0.515851

k=int(input()) L={} s=".123456789" for item in s: L[item]=0 for i in range(4): s=input() for item in s: L[item]+=1 s="123456789" done=True for item in s: if(L[item]>2*k): print("NO") done=False break if(done): print("YES")

0.515675

def doubles(s): cs = [] for c in s: if cs and cs[-1] == c: cs.pop() else: cs.append(c) return ''.join(cs)

0.514681

class Solution: def removeDuplicates(self, s: str, k: int) -> str: st=[['*',0]] for c in s: if c!=st[-1][0]: st.append([c,1]) else: st[-1][1]+=1 if st[-1][1]==k: st.pop() res='' for c,v in st:...

0.514458

from collections import Counter class Solution: def checkIfCanBreak(self, s1: str, s2: str) -> bool: d1, d2 = Counter(s1), Counter(s2) return self.check(d1, d2) or self.check(d2, d1) def check(self, d1: dict, d2: dict) -> bool: s = 0 for c in 'abcdefghijklmnopqrstuvwxyz'...

0.514215

def validate(n): digits = [int(x) for x in str(n)] even = [x*2 if x*2 <= 9 else x*2 - 9 for x in digits[-2::-2]] odd = [x for x in digits[-1::-2]] return (sum(even + odd)%10) == 0

0.514052

import re p = input().strip() range_check = bool(re.match(r'^[1-9][0-9]{5}$',p)) repeat_check = len(re.findall(r'(?=([0-9])[0-9]\1)',p)) print((range_check == True and repeat_check<2))

0.511892

Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get. For example, given n = 2, return 1 (2 = 1 + 1); given n = 10, return 36 (10 = 3 + 3 + 4). Note: You may assume that n is not less than 2 and not l...

class Solution: def integerBreak(self, n): """ :type n: int :rtype: int """ if n==2:return 1 if n==3:return 2 res=1 while n>4: n=n-3 res*=3 return res*n

0.676193

def f(n): res = 1 i = 2 while n != 1: k = 0 while n % i == 0: k += 1 n //= i if k != 0: res *= k * i**(k-1) i += 1 return res

0.6884

from fractions import gcd from functools import reduce def candies_to_buy(n): return reduce(lambda a,b:a*b//gcd(a,b), range(1,n+1))

0.687425

n = int(input()) ans = 1 i = 2 while i * i <= n: if n % i == 0: ans *= i while n % i == 0: n //= i i += 1 ans *= n print(ans)

0.677574

def isPrime(n): return n==2 or n>2 and n&1 and all(n%p for p in range(3,int(n**.5+1),2)) def prime_product(n): return next( (x*(n-x) for x in range(n>>1,1,-1) if isPrime(x) and isPrime(n-x)), 0)

0.655269

def productsum(n): pass # Your code here def productsum(kmax): def prodsum2(p, s, c, start): k = p - s + c # product - sum + number of factors if k < kmax: if p < n[k]: n[k] = p for i in range(start, kmax//p*2 + 1): prodsum2(p*i, s+i, c+1, i) ...

0.649099

def going(n): s = 1.0 for i in range(2, n + 1): s = s/i + 1 return int(s * 1e6) / 1e6

0.644329

def prod_int_part(n, min_=2): total, fac = 0, [] for d in range(min_, int(n ** .5) + 1): if not n % d: count, sub = prod_int_part(n // d, d) total += count + 1 if not count: sub = [n // d] if not fac: fac = [d] + sub return [total, fac]

0.642641

from functools import reduce from operator import mul def maximum_product_of_parts(n): s = str(n) return max(reduce(mul, map(int, (s[:i], s[i:j], s[j:]))) for i in range(1,len(s)-1) for j in range(i+1,len(s)))

0.642403

def square_free_part(n): if type(n) != int or n < 1:return None for i in xrange(2, int(n ** 0.5) + 1): while n % (i ** 2) == 0: n /= i return n

0.639416

from fractions import Decimal, gcd from operator import mul from functools import reduce lcm = lambda a, b=1: a * b // gcd(a, b) def parameter(n): digits = Decimal(n).as_tuple().digits return lcm(sum(digits), reduce(mul, digits))

0.635176

from collections import Counter from math import ceil PRIMES = [2] + [n for n in range(3, 1000, 2) if all(n%d for d in range(3, int(n**0.5) +1, 2))] def get_factors(n): factors = [] for p in PRIMES: if p > n: break while n % p == 0: factors.append(p) n //= p if n > ...

0.630325

def find_part_max_prod(n): if n == 1: return [[1], 1] q, r = divmod(n, 3) if r == 0: return [[3]*q, 3**q] if r == 1: return [[4] + [3]*(q - 1), [3]*(q - 1) + [2, 2], 3**(q - 1) * 2**2] return [[3]*q + [2], 3**q * 2]

0.62764

def solve(n): zoznam = [int(i) for i in range (2,n+1)] res=[1] while zoznam != []: res.append(zoznam[0]) del zoznam[0::zoznam[0]] return sum(res)

0.624396

class Solution: def minSteps(self, n): """ :type n: int :rtype: int """ primeFactors=[] for i in range(2,int(n**.5)+1): while n%i==0: primeFactors.append(i) n=n//i if n>1: primeFactors.append(...

0.623153

class Solution: def consecutiveNumbersSum(self, N: int) -> int: res = 1 # Remove all even factors while N % 2 == 0: N //= 2 # Count all odd factors idx = 3 while idx * idx <= N: count = 0 # fou...

0.622711

import sys a = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8092, 16184, 32368, 64736, 129472, 258944, 517888, 1035776, 2071552, 4143104, 8286208, 16572416, 33144832, 66289664, 132579328, 265158656, 530317312, 1060634624, 2121269248, 4242538496, 8485076992, 16970153984, 33940307968] print(a[int(sys.stdin...

0.618895

def digits_product(product): if product < 10: return 10 + product n = '' for d in range(9, 1, -1): while not product % d: n += str(d) product //= d return int(n[::-1]) if product == 1 else -1

0.617884

from collections import deque def dbl_linear(n): h = 1; cnt = 0; q2, q3 = deque([]), deque([]) while True: if (cnt >= n): return h q2.append(2 * h + 1) q3.append(3 * h + 1) h = min(q2[0], q3[0]) if h == q2[0]: h = q2.popleft() if h == q3[0]: h = q3.po...

0.617474

class Solution: res=[1] idx=[0,0,0] def nthUglyNumber(self, n): """ :type n: int :rtype: int """ if n<=0: return None idx2,idx3,idx5=Solution.idx while len(Solution.res)<n: Solution.res.append(min(Solution.res[idx2]*...

0.617248

class Solution: def largestPalindrome(self, n): """ :type n: int :rtype: int """ A = [0,9,987,123,597,677,1218,877,475] return A[n]

0.616631

from math import ceil PI_DIGITS_SQUARED = [int(d)**2 for d in "31415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679"] def square_pi(n): return ceil(sum(PI_DIGITS_SQUARED[:n])**0.5)

0.615171

def factor_sum(n): while True: i=2 s=0 a=n while i<=n: if n%i==0: s+=i n/=i if n==1: break else: i+=1 if a!=s: n=s else: ...

0.614893

from bisect import bisect memo = {3: [3105, 7425, 30105, 31050, 37125, 42741, 44172, 71253, 72441, 74142, 74250, 74628, 74925, 82755, 85725], 4: [7128, 8712, 67128, 70416, 71208, 71280, 71328, 71928, 72108, 78912, 79128, 80712, 86712, 87120, 87132, 87192, 87912, 95832], 5: [], 6: [8316, 83160, ...

0.614458

class Solution: def numSquares(self, n): """ :type n: int :rtype: int """ while(n%4 == 0): n = n/4 if n%8 == 7: return 4; a = int(0) while(a*a <= n): b = int(math.sqrt(n-a*a)) if (a*a+b*b == n): ...

0.614327

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): #print(*args, **kwargs, file=sys.stderr) # in python 3.4 **kwarg...

0.612007

import math class Solution: def smallestGoodBase(self, n): n = int(n) maxLength = int(math.log(n,2)) for m in range(maxLength, 1, -1): k = int(n**m**-1) if (k**(m+1) - 1)//(k - 1) == n: return str(k) return str(n-1) """ ...

0.610918

def decompose(n): total = 0 answer = [n] while len(answer): temp = answer.pop() total += temp ** 2 for i in range(temp - 1, 0, -1): if total - (i ** 2) >= 0: total -= i ** 2 answer.append(i) if total == 0: ...

0.609617

def largest_power(n): print(n) if n <= 4: if n == 1: return (0, -1) return (1, -1) #num_of_occurances freq = 0 x = [] largest = 0 j = 0 while 2**largest < n: largest += 1 largest -= 1 for i in range(2, largest + 1): while j ** i < ...

0.609069

def per(n): r = [] while n>=10: p=1 for i in str(n): p=p*int(i) r.append(p) n = p return r

0.607897

def solve(n): print('starting with {0}'.format(n), flush=True) def is_prime(p): if p % 2 == 0 : return False for x in range(3,int(p**.5)): if p % x == 0: return False return True #return not any([p%x==0 for x in range(3,int(p**.5))]) ...

0.606646

from math import floor #Pretty sure this is the fastest implementation; only one square root, and sqrt(n) multiplications. #Plus, no booleans, because they're super slow. locker_run = lambda l: [i * i for i in range(1, int(floor(l ** .5)) + 1)]

0.60535

def isqrt(num): '''Compute int(sqrt(n)) for n integer > 0 O(log4(n)) and no floating point operation, no division''' res, bit = 0, 1 while bit <= num: bit <<= 2 bit >>= 2 while bit: if num >= res + bit: num -= res + bit res += bit << 1 res >>= 1 ...

0.603174

def prod_int_partII(n, s, min_=2): total, fac = 0, [] for d in range(min_, int(n ** .5) + 1): if not n % d: count, l, sub = prod_int_partII(n // d, s-1, d) if l == 1: sub = [sub] total += count + 1 fac.extend([d] + x for x in sub) if s == 1: fac = [[n]...

0.603111

digits = lambda x: set(str(x)) def LDTA(n): if digits(n) == digits(n*n): return None seen = [] x = n while len(seen) < 10: for d in str(x): if d not in seen: seen.append(d) x *= n return int(seen[-1])

0.60114

def persistence(n): n = str(n) count = 0 while len(n) > 1: p = 1 for i in n: p *= int(i) n = str(p) count += 1 return count # your code

0.601133

def game(n): return [n * n // 2] if n % 2 == 0 else [n * n, 2]

0.598232

def num_primorial(n): primorial, x, n = 2, 3, n-1 while n: if all(x % d for d in range(3, int(x ** .5) + 1, 2)): primorial *= x n -= 1 x += 2 return primorial

0.594329

import sys read = sys.stdin.read readline = sys.stdin.readline readlines = sys.stdin.readlines #import numpy as np def main(): n = int(input()) if n == 1: print((1)) return r = 0 for i1 in range(1, n + 1): num_of_div = n // i1 r += num_of_div * (num_of_div + 1) // 2 * i1 ...

0.591988

class Solution: def bulbSwitch(self, n): """ :type n: int :rtype: int """ if n == 0: return 0 else: return int(n**0.5)

0.589434

from itertools import count # Couldn't find the pattern of why it's 1 or 8, I'm sad :( def repeat_sequence_len(n): memo = {} for i in count(): if n in memo: return i - memo[n] memo[n] = i n = sum(d*d for d in map(int, str(n)))

0.585523

class Solution: def arrangeCoins(self, n): """ :type n: int :rtype: int """ #brute force: #m = i (i+1) / 2 #i = 0 #while True: # row = i * (i+1) / 2 # if n - row < 0: # return i - 1 # i += 1...

0.584605

def doors(n): return int(n ** .5)

0.584256

series = [0] for a in range(2, 99): for b in range(2, 42): c = a**b if a == sum(map(int, str(c))): series.append(c) power_sumDigTerm = sorted(series).__getitem__

0.583657

def smallest(n): x, y, m = 1, 1, 1 while m <= n: if x % m == 0: m += 1 y = int(x) else: x += y return x

0.582732

def primeFactors(n): factors = [] while n % 2 == 0: n /= 2 factors.append(2) for i in range(3, int(n**.5) + 1,2): while n % i == 0: n /= i factors.insert(0, i) if n > 2: factors.insert(0, int(n)) return facto...

0.580587

def fun(k): n = 1 + 8*k s = math.floor(n**0.5)-1 s = s//2 return s class Solution: def reachNumber(self, target): """ :type target: int :rtype: int """ if target<0: target *= -1 L = [[3,2,1,1],[1,1,3,2]] k = fun(targe...

0.579229

def big_primefac_div(n): bpf, bd = 0, 1 frac = [] if n % 1 != 0: return "The number has a decimal part. No Results" else: n = abs(int(n)) n_copy = n i = 2 while i * i <= n: if n % i == 0: n //= i frac.append(i) else: ...

0.578557

x=int(input()) m=-1000 if 1<=x<=3: print((1)) return else: for b in range(2,x+1): for p in range(2,11): if x>=b**p: m=max(m,b**p) print(m)

0.578421

def simplify(n): for d in range(int(n ** .5), 0, -1): if not n % d ** 2: break if d*d == n: return '%d' % d elif d == 1: return 'sqrt %d' % n else: return '%d sqrt %d' % (d, n // d ** 2) def desimplify(s): x, _, y = s.partition('sqrt') return int(x or '1') ** 2 * int(y or '1')

0.578013

from itertools import islice from functools import reduce def greatest_product(n): numbers=[int(value) for value in n] result=[reduce(lambda x,y: x*y, islice(numbers, i, i+5), 1) for i in range(len(numbers)-4)] return max(result)

0.577655

from sys import stdin for _ in range(int(stdin.readline())): n = int(stdin.readline()) n //= 2 k = 2 * int(n**0.5) print(k)

0.576918

def primeFactors(n): ret = '' for i in range(2, n + 1): num = 0 while(n % i == 0): num += 1 n /= i if num > 0: ret += '({}{})'.format(i, '**%d' % num if num > 1 else '') if n == 1: return ret

0.576136

def max_number(n): return int(''.join(sorted(str(n), reverse=True)))

0.573472

from math import ceil, log, sqrt def isPP(n): for b in range(2, int(sqrt(n)) + 1): e = int(round(log(n, b))) if b ** e == n: return [b, e] return None

0.573134

def get_number_of_squares(n): k = 1 while k*(k+1)*(2*k+1)/6 < n: k+=1 return k-1

0.572737

N = int (input ()) x = 1 while x**2 <= N: x += 1 x -= 1 print (x**2)

0.572467

from sys import stdin as cin from sys import stdout as cout def main(): n = int(cin.readline()) o = 0 for x in range(9, 0, -1): if 10 ** x // 2 <= n: ##print(x) for i in range(9): q = 10 ** x * (i + 1) // 2 - 1 if q <= n: o...

0.571571

def int_rac(n, guess): """Integer Square Root of an Integer""" x = guess cnt = 1 while True: newx = (x + n // x) // 2 if abs(x - newx) < 1: return cnt x = newx cnt += 1

0.570701

def getAllPrimeFactors(n): if n == 0: return [] elif n == 1: return [1] elif type(n) != int: return errora elif n < 0: return errora allfacts = [] current = 2 n_copy = n while current <= n: if n_copy % current == 0: allfacts.append(current) n_copy /= curre...

0.569725

score = lambda sub_gen: lambda n: sum(int(''.join(sub)) for length in range(1, len(str(n)) + 1) for sub in sub_gen(str(n), length)) score1 = score(__import__('itertools').combinations) score2 = score(lambda s, r: (s[i: i+r] for i in range(len(s) - r + 1))) divs = lambda n: set.union(*({d, n // d} for d in range(1, int...

0.56968

from bisect import bisect_left as bisect n = 5000000 sieve, PED, PED_DATA = [0]*((n>>1)+1), [], [] for i in range(3, n+1, 2): if not sieve[i>>1]: for j in range(i**2>>1, (n+1)>>1, i): sieve[j] = 1 s = str(i) nEveD = sum(s.count(d) for d in "02468") if nEveD: PED.append(i...

0.56746

def primeFactor(N): i = 2 ret = {} n = N mrFlg = 0 if n < 0: ret[-1] = 1 n = -n if n == 0: ret[0] = 1 while i**2 <= n: k = 0 while n % i == 0: n //= i k += 1 ret[i] = k if i == 2: i = 3 el...

0.567368

e = [1, 2] for n in range(1, 10 ** 4): for f in 1, 2 * n, 1: e.append(f * e[-1] + e[-2]) convergents_of_e = lambda n: sum(map(int, str(e[n])))

0.567195

def count_squareable(n): return n//4 + (n+1)//2

0.566622

from collections import Counter from itertools import combinations from operator import mul from functools import reduce def largest_palindrom_from(n): digits = sorted(str(n)) singles, pairs = [], [] # group digits to pairs and singles while digits: digit = digits.pop() if digits a...

0.566569

class Solution: def monotoneIncreasingDigits(self, N): """ :type N: int :rtype: int """ arr = [int(ch) for ch in str(N)] # create array from number 1234 => [1,2,3,4] marker = len(arr) i = len(arr)-2 while i >= 0: ...

0.566383

from math import ceil, sqrt def layers(n): return ceil(sqrt(n)) // 2 + 1

0.565911

def fusc(n): assert type(n) == int and n >= 0 if n < 2: return n if n % 2 == 0: return fusc(n//2) else: return fusc(n//2) + fusc(n//2 + 1)

0.565479

def next_perfect_square(n): return n>=0 and (int(n**0.5)+1)**2

0.565315

from itertools import combinations from math import gcd def lcm_cardinality(n): return 1 + sum(1 for a, b in combinations(divisors(n), 2) if lcm(a, b) == n) def divisors(n): d = {1, n} for k in range(2, int(n**0.5) + 1): if n % k == 0: d.add(k) d.add(n // k) re...

0.564921

from math import log def decompose(n): i = 2 result = [] while n >= i*i: k = int(log(n, i)) result.append(k) n -= i ** k i += 1 return [result, n]

0.564839

def count_find_num(primes, limit): base = eval( '*'.join( map(str, primes) ) ) if base > limit: return [] results = [base] for p in primes: for num in results: num *= p while num not in results and num <= limit: results += [num] ...

0.563176

def multiply(n): return n*5**len(str(abs(n)))

0.563014

print(max(1, 4 * int(int(input()) * 2 ** 0.5)))

0.562958

from fractions import gcd def seq(): i, a, g = 1, 7, 1 while 1: yield i, a, g i += 1 g = gcd(i, a) a += g def count_ones(n): return sum(g == 1 for _, (i, a, g) in zip(range(n), seq())) def p(n): seen = set() for i, a, g in seq(): if not n: break if ...

0.562077

from heapq import * def n_linear(ms, n): lst = [1] * (n+1) q = [(1+v,v,1) for v in ms] heapify(q) for i in range(1,n+1): v,x,j = heappop(q) lst[i] = v heappush(q, (lst[j]*x+1, x, j+1) ) while q[0][0]==lst[i]: v,x,j = heappop(q) heappush(q, (lst...

0.56167

from bisect import bisect def sieve(n): sieve, primes = [0]*(n+1), [] for i in range(2, n+1): if not sieve[i]: primes.append(i) for j in range(i**2, n+1, i): sieve[j] = 1 return primes PRIMES = sieve(1000000) def summationOfPrimes(n): return sum(PRIMES[:bisect(PRIMES,...

0.559853

n=int(input()) a,b=2,1 for i in range(n): nxt=a+b a,b=b,nxt print(a)

0.559743

def find_mult10_SF(n): n = 4*n - 1 return (6 ** n + 3 * 2 ** n) / 4

0.559353

from functools import reduce def product(ar): return reduce(lambda x,y:x*y, ar) def something_acci(num_digits): seq = [1, 1, 2, 2, 3, 3] while(len(str(seq[-1])) < num_digits): seq.append(product(seq[-3:]) - product(seq[-6:-3])) return (len(seq), len(str(seq[-1])))

0.55891

score=lambda n:2**n.bit_length()-1

0.55847

from collections import Counter, defaultdict import itertools import sys def main(): n = int(input()) ans = 1 for k in range(1, 10): v = ((1 << k) - 1) * (1 << (k - 1)) if n % v == 0: ans = v print(ans) main()

0.557382

# RWH primes LIMIT = 500000 sieve = [True] * (LIMIT//2) for n in range(3, int(LIMIT**0.5) +1, 2): if sieve[n//2]: sieve[n*n//2::n] = [False] * ((LIMIT-n*n-1)//2//n +1) PRIMES = [2] + [2*i+1 for i in range(1, LIMIT//2) if sieve[i]] def prime_maxlength_chain(val_max): if val_max < 5: return [] ...

0.557178

INITIAL = [0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292] def solve(n): return INITIAL[n] if n < 12 else 292 + (49 * (n-11))

0.556538

from functools import lru_cache @lru_cache(maxsize=None) def rec(n): return 1 + (0 if n==1 else rec(3*n+1) if n&1 else rec(n//2)) memo = [[0, None], [1, 1]] def max_collatz_length(n): if not (type(n) == int and n > 0): return [] while n >= len(memo): x = rec(len(memo)) if x > memo[-1][1]: memo...

0.556453

def find_min_num(d, n=1): while div_num(n) != d: n += 1 return n def div_num(n): s = n**0.5 return sum(2 for k in range(1, int(s)+1) if n % k == 0) - (s % 1 == 0)

0.555861

from operator import mul from functools import reduce def genSequence(n): yield n while True: n += reduce(mul, [int(d) for d in str(n) if d != '0']) if n > 9 else n yield n def extract(seq, v): return sorted(seq).index(v) def convergence(n): gen1, genN = genSequence(1), genSequence(n)...

0.555716

from math import ceil def branch(n): if n == 1: return 0 l = int(ceil(n ** 0.5)) // 2 n -= (2 * l - 1) ** 2 + 1 return n // (2*l or 1)

0.554842

def super_size(n): return int(''.join(sorted(str(n), reverse = True)))

0.554513

from bisect import bisect_left def sieve(n): sieve, primes = [0]*(n+1), [] for i in range(2, n+1): if not sieve[i]: primes.append(i) for j in range(i**2, n+1, i): sieve[j] = 1 return primes PRIMES = sieve(100000) def prime_primes(n): lst = PRIMES[:bisect_left(PRIMES, n...

0.553365

n,forbid = 100000, set("2357") sieve, notPrimes = [0]*(n+1), [1] for i in range(2, n+1): if sieve[i]: if not (forbid & set(str(i))): notPrimes.append(i) else: for j in range(i**2, n+1, i): sieve[j] = 1 def solve(n): return notPrimes[n]

0.55323

from scipy.special import comb def multiply(n, k): r, d = 1, 2 while d * d <= n: i = 0 while n % d == 0: i += 1 n //= d r *= comb(i + k - 1, k - 1, exact=True) d += 1 if n > 1: r *= k return r

0.551855

def all_permuted(n): a,b = 0, 1 for i in range(1,n): a,b = b, (i+1)*(a+b) return a

0.551308

# https://oeis.org/A000108 from math import factorial as fac def solve(n): return fac(2*n)//fac(n)//fac(n+1)

0.550161

def proper_fractions(n): phi = n > 1 and n for p in range(2, int(n ** .5) + 1): if not n % p: phi -= phi // p while not n % p: n //= p if n > 1: phi -= phi // n return phi

0.549333

class Solution: def countArrangement(self, N): """ :type N: int :rtype: int """ d = { 1:1, 2:2, 3:3, 4:8, 5:10, 6:36, 7:41, 8:132, 9:250, 10:700, 11:750, 12:4010, 13:4237, 14:10680, 15:24679 } return d.get(N, N)

0.547694

def one_square(n): return round(n ** .5) ** 2 == n def two_squares(n): while n % 2 == 0: n //= 2 p = 3 while p * p <= n: while n % (p * p) == 0: n //= p * p while n % p == 0: if p % 4 == 3: return False n //= p p += 2 return n % 4 == 1 de...

0.547207

def totient(n): if not isinstance(n,int) or n<1: return 0 phi = n >= 1 and n for p in range(2, int(n ** .5) + 1): if not n % p: phi -= phi // p while not n % p: n //= p if n > 1: phi -= phi // n return phi

0.545851

def compute_depth(n): i = 0 digits = set() while len(digits) < 10: i += 1 digits.update(str(n * i)) return i

0.545074

class Solution: def checkPerfectNumber(self, num): """ :type num: int :rtype: bool """ perfect = set([6, 28, 496, 8128, 33550336, 8589869056]) return num in perfect

0.544284

Given an integer array arr, remove a subarray (can be empty) from arr such that the remaining elements in arr are non-decreasing. A subarray is a contiguous subsequence of the array. Return the length of the shortest subarray to remove. Example 1: Input: arr = [1,2,3,10,4,2,3,5] Output: 3 Explanation: The shortest su...

class Solution: def findLengthOfShortestSubarray(self, arr: List[int]) -> int: n = len(arr) if n<=1: return 0 l,r = n,-1 for i in range(1,n): if arr[i]<arr[i-1]: l = i break # monotonicially increasing ...

0.84737

class Solution: def partitionDisjoint(self, A: List[int]) -> int: biggest = A[0] newbiggest = A[0] lenL = 1 total = 1 for itr in A[1:]: total += 1 if itr < biggest: lenL = total biggest = newbiggest else: ...

0.804088

def lis(a): b = [] for c in a: # if len(b) == 0 or c > b[-1] if len(b) == 0 or c > b[-1]: b.append(c) else: l = 0 r = len(b) while l < r-1: m = l+r>>1 # if b[m] <= c: l = m if b[m] < c: l = m ...

0.777458

n=int(input()) arr=[int(x) for x in input().split()] l=[1]*n if sorted(arr)==arr: print('0') else: for i in range(0,len(arr)): for j in range(i): if arr[i]>=arr[j] and l[i]<l[j]+1: l[i]=l[j]+1 print(n-max(l))

0.753985

from bisect import bisect_right def main(): n = int(input()) a = [int(input()) for _ in range(n)] a.reverse() lis = [a[0]] for i in range(1, n): if a[i] >= lis[-1]: lis.append(a[i]) else: lis[bisect_right(lis, a[i])] = a[i] print((len(lis))) def __star...

0.746344

class Solution: def isvalid(self,C): if len(C)>2: return False if len(C)==1: a = min(C) if a==1 or C[a]==1: # EXPLANATION: # a==1 : All lengths are unitary like A=[1,2,3,4,...], so poping anything is fine # C[a...

0.745214

def prog(): n = int(input()) inp = list(map(int,input().split())) ans = 0 for i in range(len(inp)): x,y = 0 ,0 for j in range(i,len(inp)): x+=inp[j] y+=100 if(x>y): ans = max(ans,(j-i)+1) print(ans) prog()

0.739072

n=int(input()) vec=list(map(int,input().split())) al=[] otrez=[] for x in vec: if len(al)==0: al.append(x) elif(x<=al[-1]): otrez.append(al) al=[x] else: al.append(x) otrez.append(al) maxx=0 if(len(otrez)!=1): for i in range(0,len(otrez)-1): if(len(otrez[i])==1)or...

0.736419

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ cnt, sm, ism = 0, 0, 0 for i, num in enumerate(arr): sm += num ism += i if sm == ism: cnt += 1 return cnt

0.72707

class Solution: def maxTurbulenceSize(self, A: List[int]) -> int: if len(A) == 1: return 1 prev = A[1] maxcount = count = 1 + int(A[0] != A[1]) print(count) lastcomp = A[0] < A[1] for a in A[2:]: comp = prev < a if prev == a: ...

0.726229

class Solution: def maxWidthRamp(self, A: List[int]) -> int: width = 0 icandidate = [0] for i in range(len(A)): if A[i] < A[icandidate[-1]]: icandidate.append(i) for j in range(len(A) - 1, -1, -1): while icandidate and A[icandidate[-1]] <= A[j]...

0.724231

class Solution: def minIncrementForUnique(self, A: List[int]) -> int: if not A: return 0 A.sort() prev = A[0] res = 0 for num in A[1:]: if num <= prev: prev += 1 res += prev-num else: ...

0.722004

n=int(input()) a=list(map(int,input().split())) b=0 a[1:]=sorted(a[1:]) while a[0]<=a[-1]: a[-1]-=1 a[0]+=1 b+=1 a[1:]=sorted(a[1:]) print(b)

0.721336

class Solution: def findUnsortedSubarray(self, nums): """ :type nums: List[int] :rtype: int """ left = 1 size = len(nums) if size == 0: return 0 while left < size and nums[left - 1] <= nums[left]: left += 1 i...

0.717977

n, ar = int(input()), [int(x) for x in input().split()][::-1] ans = 0 for i in range(1, n): if ar[i] > ar[i - 1]: ans = n - i break print(ans)

0.715292

class Solution: def findShortestSubArray(self, nums): diction = {} for i in nums: if i not in diction: diction[i] = 1 else: diction[i] += 1 degree = max(list(diction.values())) ...

0.713875

class Solution: def longestSubarray(self, nums: List[int]) -> int: if not 0 in nums: return len(nums) - 1 ans = 0 tot = 0 prev = 0 for n in nums: if n == 1: tot += 1 else: ans = max(tot+prev, ans) ...

0.709409

n = int(input()) a = [int(x) for x in input().split()] alive = 0 left = n for i in range(n - 1, -1, -1): if i < left: alive += 1 left = min(left, i - a[i]) print(alive)

0.70803

def main(): import sys input = sys.stdin.readline n = int(input()) arr = list(map(int, input().split())) dct = {} for x in arr: dct[x] = 0 i = 0 while i != n and dct[arr[i]] == 0: dct[arr[i]] = 1 i += 1 if i == n: print(0) r...

0.707989

n = input() v = list(map(int, input().split())) best = 1 current = 1 for i in range(1, len(v)): if v[i-1] <= v[i]: current += 1 else: current = 1 best = max(best, current) print(best)

0.707271

n = int(input()) xs = [int(x) for x in input().split()] seen = {} res = 0 while xs: j = xs.index(xs[0], 1) res += j - 1 xs = xs[1:j] + xs[j+1:] print(res)

0.706564

class Solution: def findLengthOfLCIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) < 1: return 0 cur_len = 1 max_len = 1 for i in range(1,len(nums)): if nums[i] > nums[i-1]: cur_...

0.703855

n = int(input()) ans = 0 stk = [] for v in map(int, input().split()): last = 0 while len(stk) and stk[-1][0] < v and stk[-1][1]: last = max(last, stk[-1][1]) del stk[-1] if not len(stk) or stk[-1][0] < v: stk.append((v, 0)) else: stk.append((v, last + 1)); ans = max(ans,...

0.703348

n = int(input()) a = list(map(int, input().split())) maxi = 0 ans = 0 for i in range(n): a[i] -= 1 maxi = max(maxi, a[i]) if maxi == i: ans += 1 print(ans)

0.702712

from heapq import * from collections import Counter class Solution: def minSetSize(self, arr: List[int]) -> int: counter = Counter(arr) size = len(arr) # unique elements (remove half of them) if len(counter) == size: return (size - 1) // 2 + 1 ...

0.701687

for __ in range(int(input())): n = int(input()) ar = list(map(int, input().split())) ar.reverse() ans = n - 1 flag = False for i in range(1, n): if ar[i] < ar[i - 1]: flag = True if flag: if ar[i] > ar[i - 1]: break ans -= 1 pri...

0.701649

N = int(input()) ds = [] mochidan = 0 for i in range(N): ds.append(int(input())) while ds: tmp = max(ds) ds = [j for j in ds if j < tmp] mochidan += 1 print(mochidan)

0.700799

n = int(input()) ar = list(map(int,input().split(' '))) ar.sort() s=[] for i in ar: s.sort(reverse=True) for j in range(len(s)): if i>=s[j]: s[j]+=1 break else: s.append(1) print(len(s))

0.700257

n = int(input()) mass = list(map(int, input().split())) left = [1] * n right = [1] * n for i in range(1, n): if mass[i] > mass[i - 1]: left[i] = left[i - 1] + 1 for i in range(n - 2, -1, -1): if mass[i] < mass[i + 1]: right[i] = right[i + 1] + 1 mx = 1 for i in range(n): if i == 0: m...

0.699656

n = int(input()) A = [int(x) for x in input().split()] mn = min(A) I = [i for i in range(len(A)) if A[i] == mn] mindiff = min(I[i]-I[i-1] for i in range(1,len(I))) print(mindiff)

0.698754

from collections import defaultdict def fix_progression(arr): res = 0 for i in range(len(arr)): D = defaultdict(int) for j in range(i): q, r = divmod(arr[i]-arr[j], i-j) if not r: D[q] += 1 res = max(res, D[q]) return len(arr)-res-1

0.694502

n = int(input()) a = list(map(int, input().split())) mx, cnt = 1, 1 for i in range(1, n): if a[i] > a[i - 1]: cnt += 1 else: cnt = 1 mx = max(mx, cnt) print(mx)

0.694376

def bs(arr, val, key=lambda x:x): l, r = 0, len(arr)-1 if key(arr[l])>val: return l if key(arr[r])<=val: return r+1 while l+1<r: m = (l+r)>>1 v = key(arr[m]) if v<=val: l = m else: r = m return r def bs_left(arr,...

0.69339

def f(n): s = list(map(int, input().split())) low = [] high = [] for i in range(n - 1): low.append(min(s[i], s[i+1])) high.append(max(s[i], s[i+1])) low.sort() high.sort() curr = mx = 0 i = j = 0 n -= 1 while i < n and j < n: if low[i] < high[j]: i += 1 curr += 1 else: j += 1 curr -= 1 ...

0.693098

input() memory = list(map(int, input().split())) proc_data = {p: (-1, -1) for p in memory} for i, c in enumerate(memory): d1, d2 = proc_data[c] if d1 == -1: d1 = i d2 = i proc_data[c] = (d1, d2) try: del proc_data[0] except KeyError: print("0") return data = list(proc_data.values()) data.sor...

0.692664

n = int(input()) a = [0] + list(map(int, input().split())) + [1001] mx = 1 p = 1 for i in range(1, n + 2): if a[i] == a[i - 1] + 1: p += 1 mx = max(p, mx) else: p = 1 print(max(0, mx - 2))

0.692503

from collections import deque class Solution: def longestSubarray(self, nums, limit): maxQ, minQ = deque(), deque() i = 0 res = 0 for j, val in enumerate(nums): while maxQ and val > maxQ[-1]: maxQ.pop() while minQ and val < minQ[-1]: minQ.pop() max...

0.691189

N = int(input()) H = [int(i) for i in input().split()] count = 0 ans = 0 for i in range(N-1): if(H[i] >= H[i+1]): count += 1 else: ans = max(ans,count) count = 0 print(max(ans,count))

0.690258

class Solution: def minDeletionSize(self, A: List[str]) -> int: dp = [(1, 1)] * len(A[0]) for i in range(len(dp)): if i > 0: max_pre = None for pre in range(i - 1, -1, -1): for word in A: if word[pre] > word[i]: ...

0.69015

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ res = 0 temp = sorted(arr) sum1, sum2 = 0, 0 for i in range(0,len(arr)): sum1 += arr[i] sum2 += temp[i] if(sum1 =...

0.689246

t = int(input()) for i in range(t): n = int(input()) arr = [int(x) for x in input().split()] arr.sort(reverse=True) print(min(arr[1] - 1, len(arr) - 2))

0.688425

n = int(input()) a = list(map(int,input().split())) m = max(a) current = 0 longest = 0 for x in a: if x == m: current +=1 else: longest = max(current,longest) current = 0 longest = max(current,longest) print (longest)

0.687346

# cook your dish here n=int(input()) arr=[int(x) for x in input().split()] ans=n-1 while(ans>0 and arr[ans]==arr[ans-1]):ans-=1 print(ans+1)

0.686518

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.68472

class Solution: def minDeletionSize(self, A: List[str]) -> int: def isSorted(arr, i, j): return all(arr[k] <= arr[k+1] for k in range(i, j)) ans = 0 ranges = [[0, len(A)-1]] for col in zip(*A): if not ranges: break if all(isSorted(c...

0.684412

n=eval(input()) a=list(map(int,input().split())) c=m=0 maxi=max(a) for i in range(n): if a[i]==maxi: c+=1 m=max(c,m) else: c=0 print(m)

0.68381

test=int(input()) for _ in range(test): n=int(input()) ls=list(map(int,input().split())) ls.sort() s=0 for i in range(n): if s>=ls[i]: s=s+1 else: break print(s)

0.683171

def main(): n = int(input()) arr = sorted(map(int, input().split())) j = 1 for x in arr: if x >= j: j += 1 print(j - 1) return 0 main()

0.680346

class Solution: def getMaxLen(self, nums: List[int]) -> int: maxx = 0 nums.append(0) # starting position # where we find a 0 i = -1 minusarr = [] for j,n in enumerate(nums): if n == 0: # now figure out previous one...

0.679414

class Solution: def longestMountain(self, A: List[int]) -> int: up=0 down=0 ans=0 for i in range(0,len(A)-1): if A[i]<A[i+1]: if down==0: up+=1 else: up=1 down=0 ...

0.67929

class Solution: def movesToMakeZigzag(self, nums): n = len(nums) res0 = 0 for i in range(0, n, 2): nei = min(nums[j] for j in [i - 1, i + 1] if 0 <= j <= n-1) if nums[i] >= nei: res0 += nums[i] - nei + 1 res1 = 0 for i in range(1, n, 2)...

0.677045

class Solution: def lengthOfLIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 0: return 0 res = [nums[0]] def binarySearch(l,target): left , right = 0 , len(l)-1 while left < right: ...

0.676286

import sys import math input=sys.stdin.readline #sys.setrecursionlimit(1000000) mod=int(1000000007) i=lambda :map(int,input().split()) n=int(input()) a=[int(x) for x in input().split()] t=[[0]*21 for i in range(300005)] for i in range(n): t[i][0]=a[i] def build(n): for j in range(1,20): for i in rang...

0.6734

n = int(input()) a = [int(ai) for ai in input().split()] def solve(x): n = len(x) if sorted(x) == x: return n return max(solve(x[:n//2]), solve(x[n//2:])) print(solve(a))

0.672883

import bisect from functools import lru_cache class Solution: def makeArrayIncreasing(self, A: List[int], B: List[int]) -> int: B = sorted(set(B)) @lru_cache(None) def find_larger_value_in_B(val): if val >= B[-1]: return float('inf') return B[bisect...

0.672159

n=int(input()) p=list(map(int,input().split())) c=1 q=p[0] for i in range(1,n): q=min(q,p[i]) if p[i]<=q: c+=1 print(c)

0.668487

for _ in range(int(input())): n = int(input()) A = list(map(int, input().split())) m = 10 ** 9 c = 0 for i in range(n - 1, -1, -1): if A[i] <= m: m = A[i] else: c += 1 print(c)

0.667922

n=int(input()) C=[0]+list(map(int,input().split())) #n=5000 #C=list(range(n+1)) A=[] for i in range(1,n+1): if C[i]!=C[i-1]: A.append(C[i]) L=len(A) DP=[[[0]*L for i in range(L)] for j in range(2)] #左の色に揃える or 右の色に揃える,左からi～j番目を def color(r,i,j):#i<j if r==1: if A[i]==A[j]: DP[r][...

0.667404

def main(): from sys import stdin, stdout for _ in range(int(stdin.readline())): n = int(stdin.readline()) inp1 = [-1] * (n + 1) inp2 = [-1] * (n + 1) for i, ai in enumerate(map(int, stdin.readline().split())): if inp1[ai] < 0: inp1[ai] = i ...

0.665456

def consecutive(arr): return max(arr) - min(arr) + 1 - len(arr) if arr else 0

0.664443

from sys import stdin n = int(stdin.readline()) a = list(map(int,stdin.readline().split())) a = [0] + a ans = n dp = [float("inf")] * (n+1) dp[0] = 0 for i in range(1,n+1): nmin = float("inf") for j in range(i-1,-1,-1): if a[j] <= nmin: dp[i] = min(dp[i] , dp[j] + max(0,a[i]-a[j]) + (i-...

0.664416

rr = lambda: input().strip() rri = lambda: int(rr()) rrm = lambda: list(map(int, rr().split())) def solve(N, A): ans = 0 prev = float('inf') for x in reversed(A): x = min(x, prev - 1) ans += max(x, 0) prev = x return ans for tc in range(1):#rri()): N = rri() A = rrm() ...

0.663803

import sys num=int(sys.stdin.readline()) s=sys.stdin.readline().split() sky=list(map(int,s)) sky.reverse() cuts=0 change=0 t=False i=1 while i<len(sky): if sky[i]<=sky[i-1]: for j in range(i-1,-1,-1): if sky[j]<=sky[i]-(i-j): break else: change+=sky[j]-(sky[i]-(i-j)) if change>=sky[i]: ...

0.663447

n = int(input()) a = list(map(int, input().split())) e = 1000000 ans = max(min(x - 1, e - x) for x in a) print(ans)

0.661522

n=int(input()) for _ in range(n): i=int(input()) ar=sorted(list(map(int,input().split())))[::-1] mx=0 for e in range(i): mx=max(mx,min(e+1,ar[e])) print(mx)

0.661237

from collections import Counter class Solution: def longestArithSeqLength(self, A: List[int]) -> int: c = dict(Counter(A).most_common()) # print(c) m1 = max(c.values()) # A = list(set(A)) # A.sort() index = {} # for i in range(len(A)): # index[A[i]...

0.659888

x = int(input()) l = list(map(int, input().split(' '))) if min(l) == max(l): print(0) else: print(x-l.count(min(l))-l.count(max(l)))

0.65832

# cook your dish here n = int(input()) l = list(map(int, input().strip().split())) m = 0 f = [] for e in l: if(e != 0): m = m+1 else: f.append(m) m = 0 f.append(m) print(max(f))

0.658004

n,s = map(int,input().split()) A = list(map(int,input().split())) if A[s-1] != 0: per = 1 A[s-1] = 0 else: per = 0 A.sort() maxs = max(A) ans = [0] * (maxs + 1) answer = maxs + 1 o = -1 for j in range(n): if A[j] == 0: o += 1 if ans[A[j]] == 0: ans[A[j]] = 1 answer -= 1 ...

0.657468

x=int(input()) l=list(map(int, input().split(' '))) l.sort() a=1 for i in l: if i>=a: a+=1 print(a)

0.656664

mod = 1000000007 eps = 10**-9 inf = 10**9 def main(): import sys input = sys.stdin.readline class Bit: def __init__(self, n): self.size = n self.tree = [0] * (n + 1) def sum(self, i): s = 0 while i > 0: s += self.tree[i] ...

0.656555

from sys import stdin, stdout n = int(stdin.readline().rstrip()) p = list(map(int,stdin.readline().rstrip().split())) if n==1: print(p[0]) else: removeDict={i:0 for i in range(1,n+1)} l1 = p[0] removeDict[l1]-=1 l2 = 0 for i in range(1,n): if p[i]>l2: if p[i]>l1: ...

0.654204

for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) ans = 1 l1 = l[0] for i in range(1,n): if l[i] <= l1: l1 = l[i] ans = ans + 1 print(ans)

0.653838

import bisect; def getIntList(): return list(map(int, input().split())); def getTransIntList(n): first=getIntList(); m=len(first); result=[[0]*n for _ in range(m)]; for i in range(m): result[i][0]=first[i]; for j in range(1, n): curr=getIntList(); for i in range(m): ...

0.651817

n = int(input()) m = [int(i) for i in input().split()] dm = [0 for i in range(n)] dm[-1] = m[-1] + 1 for i in range(n - 2, -1, -1): dm[i] = max(m[i] + 1, m[i+1], dm[i+1]-1) #print(dm) for i in range(1, n): dm[i] = max(dm[i], dm[i-1]) #print(dm) print(sum([dm[i] - 1 - m[i] for i in range(n)]))

0.651803

l = 0 r = -1 segL, time = [int(x) for x in input().split()] a = [int(x) for x in input().split()] segSum = 0 segments = [] ##while r < segL-1: ## r += 1 ## segSum += a[r] ## if segSum == time: ## segments.append(r+1-l) ## elif segSum > time: ## segments.append(r-l) ## while segSum > ...

0.650375

import sys n=0; inp=[]; tree=[];#stores the index of min in range(i,j) def build(node,i,j): if(i>j): return; if(i==j): tree[node]=int(i); return; mid=int( (i+j)/2 ); build(2*node,i,mid) build(2*node+1,mid+1,j) if( inp[ tree[2*node] ] < inp[ tree[2*node+1] ] ): t...

0.648663

from collections import defaultdict as dd for _ in range(int(input())): n=int(input()) a=list(map(int,input().split())) d=dd(int) for i in a: d[i]+=1 ma=0 r=len(d.keys()) for i in d.keys(): ma=max(ma,min(d[i]-1,r),min(d[i],r-1)) print(ma)

0.648371

N = int(input()) H = list(map(int,input().split())) top = H[0] cnt = 1 for i in range(1,N): if top <= H[i]: cnt += 1 top = H[i] print(cnt)

0.647784

n = int(input()) a = list(map(int, input().split())) dp = [[False] * (n + 1) for i in range(n + 1)] def solve(l, r): if dp[l][r]: return dp[l][r] if r - l == 1: dp[l][r] = (a[l], 1) return dp[l][r] tmp = 10 ** 9 for i in range(l + 1, r): if solve(l, i)[0] == -1 or solve...

0.647656

class Solution: def heightChecker(self, heights: List[int]) -> int: max_val = max(heights) freq = [0] * (max_val + 1) for num in heights: freq[num] += 1 for num in range(1,len(freq)): freq[num] += freq[num-1] places = [0] * len(heights) ...

0.646274

n = int(input()) u = [int(u) for u in input().split()] NMAX = 100005 suma = [0 for _ in range(NMAX)] total = [0 for _ in range(NMAX)] diferentes = 0 sol = 0 maximo = 1 for i, v in enumerate(u): if total[v] == 0: diferentes += 1 else: suma[total[v]] -= 1 total[v] += 1 suma[total[v]] += 1 maximo = max(maxim...

0.645201

from collections import * c=Counter() ans=n=int(input()) s=input() k=len(set(s)) i=j=t=0 while j<n: while len(c)<k and j<n: c[s[j]]+=1; j+=1 while len(c)==k: if j-i<ans: ans=j-i c[s[i]]-=1 if c[s[i]]==0: del c[s[i]] i+=1 print(ans)

0.642949

N, I = list(map(int, input().split())) A = sorted([int(a) for a in input().split()]) B = [] j = 0 for i in range(N): if i == 0 or A[i] == A[i-1]: B.append(j) else: j += 1 B.append(j) def calc(k): K = 1<<k i = 0 j = 0 ma = 0 while j < N: if B[j]-B[i] <= K - 1:...

0.642213

n = int(input()) A = list(map(int, input().split())) A.sort() i = 0 j = 0 ans = 0 while j < len(A): ans = max(ans, j - i) if i == j or A[j] - A[i] <= 5: j += 1 else: i += 1 print(max(ans, j - i))

0.64204

#!/usr/bin/env python3 n = int(input()) a = [int(x) for x in input().split()] sorted_a = sorted(a) dict_a = {} for x in a: if not x in dict_a: dict_a[x] = 1 else: dict_a[x] += 1 sorted_uniq_a = sorted(dict_a.keys()) max_fib_prefix = [a[0], a[1]] for i in range(0, len(sorted_uniq_a)): for...

0.641674

n = int(input()) mas = list(map(int, input().split())) dist = set([0]) res = 1 for i, e in enumerate(mas): time = i + 1 if e in dist: dist.remove(e) else: res += 1 dist.add(time) print(res)

0.641189

def artificial_rain(garden): left,area,record = 0,0,1 for i in range(1,len(garden)): if garden[i] < garden[i-1]: left = i elif garden[i] > garden[i-1]: area = max(area,record) record = i - left record += 1 return max(area,record)

0.640746

class Solution: def jump(self,nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 1: return 0 else: step = 0 pos = 0 while pos != len(nums) - 1: bestStep = -1 bes...

0.640444

from collections import defaultdict class Solution: def longestSubsequence(self, arr: List[int], difference: int) -> int: count_dict = defaultdict(int) for num in arr: count_dict[num] = count_dict[num-difference] + 1 return max(count_dict.values())

0.640179

read = lambda: map(int, input().split()) n = int(input()) a = list(read()) was = [0] * (n + 1) bal = ans = 0 for i in a: if was[i]: bal -= 1 else: bal += 1 was[i] = 1 ans = max(ans, bal) print(ans)

0.638924

def mForMaxSeq(arr, n): eim = dict() for i in range(n): if arr[i] in eim: eim[arr[i]].append(i) else: eim[arr[i]] = [i] keys = sorted(eim.keys()) # print(eim, keys) connected = False count = 0 pI = -1 nKeys = len(keys) ...

0.637705

from collections import defaultdict def calcBinomials(N): nonlocal binom N += 1 binom = [[0]*N for _ in range(N)] for n in range(N): binom[n][0] = binom[n][n] = 1 for k in range(1, n): binom[n][k] = binom[n-1][k] + binom[n-1][k-1] n = int(input()) a = list(map(int, input()....

0.637623

# O(n) time and space # Hashmap and array # Count number then count occurrence: # Count the occurrences of each number using HashMap; # Keep a count of different occurences # From small to big, for each unvisited least frequent element, deduct from k the multiplication with the number of elements of same occurrence, ch...

0.637395

counts = {} rcount = {} input() m = 0 for i, x in enumerate(map(int, input().split())): if x in counts: rcount[counts[x]].remove(x) if not rcount[counts[x]]: del rcount[counts[x]] counts[x] += 1 if counts[x] not in rcount: rcount[counts[x]] = set() rcount[counts[x]].add(x) else: counts[x] = 1 if 1 ...

0.637204

def solve(l): m = l.index(max(l)) if m == 0 or m == len(l) - 1: return 1 return 1 + min(solve(l[0:m]), solve(l[m+1:])) tc = int(input()) for test in range(tc): n = int(input()) l = list(map(int, input().split())) print(solve(l))

0.636694

d, n, t = 0, int(input()), list(map(int, input().split())) p = {a: 0 for a in set(t)} for i in range(n): a = t[i] if not a in p: continue p.pop(a) s = t.count(a) - 1 if 2 * s < d: continue if s > d: d = s k = i + 1 for j in range(k, n): if t[j] == a: for b in set(t[k:...

0.634671

n = int(input()) s = list(map(int,input().split(' '))) a = [] for i in range(max(s)): a.append([]) for i in range(len(s)): a[s[i]-1].append(i) a = list([x for x in a if x != []]) if len(a) > 1: for i in range(1,len(a)): if len(a[i]) > 1: s = a[i-1][-1] if s > a[i][0] and ...

0.634472

n = int(input()) a = [int(x) for x in input().split()] a.sort() num = 0 res = 0 for i in range(n): if int(a[i]) >= num: res += 1 num += int(a[i]) #print(res, a[i]) print(res)

0.633302

def check(l,n): m = 0 for i in range(n-1): x = l[i] c = 0 j = i while (j+2<n and l[j+2]==x) or (j+1<n and l[j+1] == x): if l[j+1] == x: j = j+1 else: j+=2 c+=1 if m<c: m = c return m t = ...

0.631384

# class Solution: # def specialArray(self, nums: List[int]) -> int: # nums.sort(reverse=True) # left, right = 0, len(nums) # while left < right: # mid = left + (right - left) // 2 # if mid < nums[mid]: # left = mid + 1 # else: # ...

0.631173

Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product. Example 1: Input: [2,3,-2,4] Output: 6 Explanation: [2,3] has the largest product 6. Example 2: Input: [-2,0,-1] Output: 0 Explanation: The result cannot be 2, because [-2,-1]...

class Solution: def maxProduct(self, nums): """ :type nums: List[int] :rtype: int """ def prod(nums): #function to calculate product prod = 1 for i in nums: prod*=i return prod def listsplit(l...

0.765634

def maximum_product(arr): if arr.count(0) > 1: return min(arr) neg = [n for n in arr if n < 0] pos = [n for n in arr if n >= 0] if len(neg) % 2: return min(neg) if 0 in arr else max(neg) else: return min(pos) if pos else min(neg)

0.740049

class Solution: def maxProduct(self, nums: List[int]) -> int: if nums[0] > nums[1]: largest = nums[0] second_largest = nums[1] else: largest = nums[1] second_largest = nums[0] for i in range(2,len(nums)): if nums[i] > largest: ...

0.676452

class Solution: def maximumProduct(self, nums): """ :type nums: List[int] :rtype: int """ import heapq a, b = heapq.nlargest(3, nums), heapq.nsmallest(2, nums) return max(a[0]*a[1]*a[2], a[0]*b[0]*b[1])

0.659347

class Solution: def maxSubArray(self, nums): """ :type nums: List[int] :rtype: int """ # i = 0 # i_keep = 0 # j = 1 # j_keep = 1 # max_sum = nums[0]-1 # while j < len(nums) and i < j: # temp_sum = sum(nums[i:j]) ...

0.632767

import heapq def max_product(a): x = heapq.nlargest(2,a) return x[0]*x[1]

0.615287

def adjacent_element_product(array): return max( a*b for a, b in zip(array, array[1:]) )

0.610359

class Solution: def getMaxLen(self, nums: List[int]) -> int: maxx = 0 nums.append(0) # starting position # where we find a 0 i = -1 minusarr = [] for j,n in enumerate(nums): if n == 0: # now figure out previous one...

0.602933

def largest_sum(arr): sum = max_sum = 0 for n in arr: sum = max(sum + n, 0) max_sum = max(sum, max_sum) return max_sum

0.579176

class Solution: def rob(self, nums): """ :type nums: List[int] :rtype: int """ if not nums: return 0 if len(nums)==1: return nums[0] return max(self.helper(nums[1:]), self.helper(nums[:-1])) def helper(self,nums...

0.576831

class Solution: def maxProfit(self, prices): profits = 0 ln = len(prices) if not ln: return 0 elif ln == 2: return (prices[1]-prices[0]) if prices[1] > prices[0] else 0 lastPrice = prices[0] for price in prices: if lastPr...

0.575579

def max_product(lst, n_largest_elements): lst_largest = sorted(lst)[-n_largest_elements:] prod = 1 for number in lst_largest: prod *= number return prod

0.573731

class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ n = len(prices) if n <=1: return 0 else: minprice = prices[0] res = 0 for i in range(1,n): if ...

0.572434

class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ n = len(prices) if n < 2: return 0 sells = [0] * n buys = [0] * n buys[0] = -prices[0] for i in ...

0.561695

class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ tmax_profit = 0 rmax_profits = [0] * len(prices) rmax = -1 for ii in range(len(prices)-2, -1, -1): if (prices[rmax] - prices[ii] > rmax_profi...

0.561581

from itertools import islice from functools import reduce def greatest_product(n): numbers=[int(value) for value in n] result=[reduce(lambda x,y: x*y, islice(numbers, i, i+5), 1) for i in range(len(numbers)-4)] return max(result)

0.558506

class Solution: def productExceptSelf(self, nums): """ :type nums: List[int] :rtype: List[int] """ nums0 = nums.copy() son = 1 if 0 in nums0: nums0.remove(0) for i in nums0: son *= i ...

0.554299

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def currentmax(self,root): leftval = 0 if root.left != None: leftval = self.currentmax(root.left) leftval = 0 if leftv...

0.550944

class Solution: def deleteAndEarn(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums);#count is a dict [3,4,2]--> {2:1,3:1,4:1} prev = None; avoid = using = 0; for k in sorted(count): temp = ma...

0.540671

from functools import reduce from operator import mul def product(numbers): return reduce(mul, numbers) if numbers else None

0.539959

class Solution: def largestRectangleArea(self, heights): """ :type heights: List[int] :rtype: int """ if not heights: return 0 stack = [0] heights.append(0) # print(heights) max_area = 0 for i in range(...

0.539335

class Solution: def PredictTheWinner(self, nums): """ :type nums: List[int] :rtype: bool """ if not nums: return True n = len(nums) if n & 1 == 0: return True dp = [0] * n for i in range(n-1, -1, -1): for j in r...

0.538681

class Solution: def rob(self, nums: List[int]) -> int: if not nums: return 0 if len(nums) < 3: return max(nums) dp = [0] * len(nums) dp[0] = nums[0] dp[1] = max(nums[0], nums[1]) for i in range(2, len(nums)): dp[i] = max(dp...

0.534558

class Solution: def arrayNesting(self, nums): """ :type nums: List[int] :rtype: int """ best = 0 n = len(nums) p = [] for i in range(len(nums)): j = i current = 0 while nums[j] != -1: cur...

0.533077

from functools import reduce from operator import mul def maximum_product_of_parts(n): s = str(n) return max(reduce(mul, map(int, (s[:i], s[i:j], s[j:]))) for i in range(1,len(s)-1) for j in range(i+1,len(s)))

0.531556

def max_profit(prices): m = best = float('-inf') for v in reversed(prices): m, best = max(m, best-v), max(best,v) return m

0.529988

class Solution: def maxSubarraySumCircular(self, A: List[int]) -> int: N = len(A) if(N==0): return 0 curr_max = A[0] global_max = A[0] curr_min = A[0] global_min = A[0] flag = 0 if(A[0]>=0): flag=1 for i in range(1...

0.529278

from functools import reduce def product_sans_n(nums): z = nums.count(0) if z > 1: return [0] * len(nums) p = reduce(int.__mul__, (v for v in nums if v)) return [not v and p for v in nums] if z else [p//v for v in nums]

0.523575

class Solution: def maxProductPath(self, grid: List[List[int]]) -> int: rows = len(grid) if (rows == 0): return -1 cols = len(grid[0]) if (cols == 0): return -1 dp = [(1,1)] * cols for r, col in enumerate(grid): fo...

0.521759

def largest_sum(s): return max(sum(map(int,x)) for x in s.split('0'))

0.520399

def largest_rect(h): st=[]; m=0; i=0 while i<len(h): if len(st)==0 or h[st[-1]]<=h[i]: st.append(i); i+=1 else: l=st.pop(); m=max(m, h[l]*(i if len(st)==0 else i-st[-1]-1)) while len(st)>0: l=st.pop(); m=max(m, h[l]*(i if len(st)==0 else i-st[-1]-1)) return m

0.518903

def flipping_game(num): current = 0 biggest = 0 for i in num: current = max(0, current - ( i or -1 ) ) biggest = max(biggest, current) return sum(num) + (biggest or -1)

0.51872

def calc(a): res = [0] * (len(a) + 1) for k in range(len(a)): res = [2 * max(a[i] + res[i+1], a[i+k] + res[i]) for i in range(len(a) - k)] return res[0]

0.516244

import sys class Solution: def maximumSum(self, arr: List[int]) -> int: ignore=0 not_ignore=0 res=-sys.maxsize for i in arr: if i>=0: ignore+=i not_ignore+=i else: if ignore==0: ignore+=i ...

0.516144

def digits_product(product): if product < 10: return 10 + product n = '' for d in range(9, 1, -1): while not product % d: n += str(d) product //= d return int(n[::-1]) if product == 1 else -1

0.515558

def solve(arr): p, q = 1, 1 for k in arr: x, y = max(k), min(k) a = p * x b = q * x c = p * y d = q * y p = max(a, b, c, d) q = min(a, b, c, d) return max(p, q)

0.513184

def close_to_zero(t): if len(t)==0: return (0) x=t.split(" ") l=[] poz=[] neg=[] for i in x: l.append(int(i)) for i in l: if i == 0: return (0) if i>0: poz.append(i) if i<0: neg.append(i) if 0-min(poz)==...

0.508972

class Solution: def jump(self,nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 1: return 0 else: step = 0 pos = 0 while pos != len(nums) - 1: bestStep = -1 bes...

0.506543

from operator import mul from functools import reduce def product_array(numbers): tot = reduce(mul,numbers) return [tot//n for n in numbers]

0.504198

class Solution: def mctFromLeafValues(self, arr: List[int]) -> int: if not arr: return 0 res = [] while len(arr) > 1: temp_res = [] temp_res = [arr[i]*arr[i+1] for i in range(len(arr)-1)] idx = temp_res.index(min(temp_res)) res.appen...

0.503266

class Solution: def findMaxConsecutiveOnes(self, nums): """ :type nums: List[int] :rtype: int """ if nums == []: return 0 count = 0 countMax =0 for ele in nums: if ele == 1: count += 1 ...

0.493336

def array_operations(a, n): li = [] for i in range(n): m = max(a) a = [m-i for i in a] if a in li: if not n & 1 : return li[-1] return a li.append(a) return a

0.492316

class Solution: def maxArea(self, height): """ :type height: List[int] :rtype: int """ # l = [] # maxH = 0 # for i in range(len(height)-1, -1, -1): # if height[i] > maxH: # maxH = height[i] # l.append((i, ...

0.491589

def longest_slide_down(p): res = p.pop() while p: tmp = p.pop() res = [tmp[i] + max(res[i],res[i+1]) for i in range(len(tmp))] return res.pop()

0.484247

import math class ProductOfNumbers: def __init__(self): self.numbers = [1] self.lastZero = 0 def add(self, num: int) -> None: if num != 0: self.numbers.append(self.numbers[-1] * num) else: self.numbers = [1] def getProduct(self, k: int)...

0.483278

class Solution: def getMaximumGold(self, grid: List[List[int]]) -> int: height = len(grid) width = len(grid[0]) max_path = 0 # generator for legal indices to check def index_gen(index): i,j = index if i > 0 and grid[i-1][j] > 0: ...

0.482306

def replace_zero(arr): m, im, i, lst = 0, -1, -1, ''.join(map(str,arr)).split('0') for a,b in zip(lst,lst[1:]): i += len(a) + 1 candidate = len(a)+len(b)+1 if m <= candidate: im, m = i, candidate return im

0.477245

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.476405

from collections import Counter def obtain_max_number(arr): c = Counter(arr) while 1: find = next((k for k in c if c[k] > 1), None) if not find:return max(c) c[find] -= 2 c[find*2] = c.get(find*2,0) + 1

0.475077

class Solution: def dominantIndex(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) <= 1: return 0 m = max(nums) ind = nums.index(m) del nums[ind] m_2 = max(nums) return ind if m >= 2*m_2 else -...

0.474384

class Solution: def maxDotProduct(self, nums1: List[int], nums2: List[int]) -> int: # DP(a=index of last, b=index of last) = max of: # DP(a-1, b) # DP(a-1, i) + nums1[a] * max_or_min(nums2[i+1:b+1]) # same for b INF = int(1e9) n, m = len(nums1)...

0.474305

def sum_array(arr): if arr == None or len(arr) < 3: return 0 return sum(arr) - max(arr) - min(arr)

0.47258

input() num = list(map(int, input().split())) maxn = 0 l, r = 0, len(num)-1 j1, j2 = num[l], num[r] while l < r: if j1 == j2: maxn = max(j1, maxn) l += 1 j1 += num[l] elif j1 < j2: l += 1 j1 += num[l] else: r -= 1 j2 += num[r] print(maxn)

0.471803

def target_game(values): a = b = 0 for n in values: a, b = b, max(a + n, b) return max(a, b)

0.469328

class Solution: def minStartValue(self, nums: List[int]) -> int: res = 1 for ind,n in enumerate(nums): temp = 1-sum(nums[:ind+1]) if(temp > res): res = temp return res

0.465309

class Solution: def findLengthOfLCIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) < 1: return 0 cur_len = 1 max_len = 1 for i in range(1,len(nums)): if nums[i] > nums[i-1]: cur_...

0.462473

class Solution: def longestSubarray(self, nums: List[int]) -> int: if not 0 in nums: return len(nums) - 1 ans = 0 tot = 0 prev = 0 for n in nums: if n == 1: tot += 1 else: ans = max(tot+prev, ans) ...

0.460436

from functools import reduce def find_min_max_product(arr, k): if k <= len(arr): arr = sorted(arr, key=abs) lasts = arr[-k:] v1 = reduce(int.__mul__, lasts) v0 = reduce(int.__mul__, arr[:k]) first_SameOrOpp = [next((v for v in lasts if...

0.459728

from collections import Counter from itertools import combinations from operator import mul from functools import reduce def largest_palindrom_from(n): digits = sorted(str(n)) singles, pairs = [], [] # group digits to pairs and singles while digits: digit = digits.pop() if digits a...

0.456258

def least_bribes(bribes): mem = {} def s(n1, n2): if n1 >= n2: return 0 if (n1, n2) in mem: return mem[n1, n2] r = min(bribes[i] + max(s(n1, i), s(i + 1, n2)) for i in range(n1, n2)) mem[n1, n2] = r return r return s(0, len(bribes))

0.452036

def array_manip(array): return [min([a for a in array[i+1:] if a > array[i]], default=-1) for i in range(len(array))]

0.451321

class Solution: def splitArray(self, nums, m): """ :type nums: List[int] :type m: int :rtype: int """ accum = [0] N = len(nums) mmm = max(nums) if m >= N: return mmm res = 0 for i in nums: r...

0.448957

class Solution: def maximumGap(self, nums): """ :type nums: List[int] :rtype: int """ if not nums or len(nums) == 1: return 0 sorted_gap=0 nums=list(set(nums)) nums.sort() for curr in range(len(nums[:-1])): g...

0.4478

def dominator(arr): for x in set(arr): if arr.count(x) > len(arr)/2.0: return x return -1

0.446515

def sum_arrays(*args): if all(x == [] for x in args) or all(x == [0] for x in args): return [] elif any(x == [] for x in args): return max(args) else: s = sum(int(''.join(map(str, x))) for x in args) minus = s < 0 return [int(x) * -1 if minus and i == 0 else int(x) ...

0.446476

def expression_matter(a, b, c): return max(a*b*c, a+b+c, (a+b)*c, a*(b+c))

0.44412

class Solution: def maxSizeSlices(self, slices: List[int]) -> int: a,b,n=[slices[0]],[0],len(slices) for i in range(1,n): a.append(max(a[-1],slices[i])) b.append(max(b[-1],slices[i])) for i in range(2,2*n//3,2): aa,bb=[0]*(n-1),[0]*n for j in r...

0.444044

def candies(s): if not s or len(s) == 1: return -1 return len(s) * max(s) - sum(s)

0.443994

class Solution: def maxScoreSightseeingPair(self, A: List[int]) -> int: curmaxsight = A[0] - 1 curmaxpair = 0 for sight in A[1:]: if sight + curmaxsight > curmaxpair: curmaxpair = sight + curmaxsight if sight > curmaxsight: curmaxsight ...

0.443581

from fractions import gcd def min_price(nums): nums.sort() ns = [0] + [float('inf')] * (nums[0] - 1) for c in nums[1:]: d = gcd(nums[0], c) for r in range(d): n = min(ns[r::d], default=float('inf')) if n < float('inf'): for j in range(nums[0] // d): ...

0.443159

class Solution: def maxProfit(self, k, prices): """ :type k: int :type prices: List[int] :rtype: int """ length = len(prices) v = p = 0 pairs, profits = [], [] while p < length: v = p ...

0.441352

""" Codeforces Contest 260 Div 1 Problem A Author : chaotic_iak Language: Python 3.3.4 """ def main(): n, = read() ar = read() a = [0] * 100001 for i in ar: a[i] += 1 dp = [0] * 100001 dp[1] = a[1] for i in range(2, 100001): dp[i] = max(a[i] * i + dp[i-2], dp[i-1]) print(dp[-...

0.441246

def solution(digits): numlist = [int(digits[i:i+5]) for i in range(0,len(digits)-4)] return max(numlist)

0.440172

a,b,c,d=map(int, input().split()) print(max(a*b,c*d))

0.439389

class Solution: def maximalRectangle(self, matrix): """ :type matrix: List[List[str]] :rtype: int """ if not matrix or not matrix[0]: return 0 n = len(matrix[0]) height = [0] * (n + 1) ans = 0 for row in matrix: ...

0.438504

""" Codeforces Contest 264 Div 2 Problem B Author : chaotic_iak Language: Python 3.3.4 """ def main(): n, = read() print(max(read())) ################################### NON-SOLUTION STUFF BELOW def read(mode=2): # 0: String # 1: List of strings # 2: List of integers inputs = input().strip(...

0.438311

class Solution: def largestNumber(self, nums): """ :type nums: List[int] :rtype: str """ nums = [str(n) for n in nums] nums.sort(reverse=True) for i in range(1, len(nums)): if len(nums[i-1]) > len(nums[i]): ...

0.43777

class Solution: def findPeakElement(self, nums): """ :type nums: List[int] :rtype: int """ if not nums: return -1 start = 0 end = len(nums) -1 while start + 1 < end: mid = (start + end) // 2 if ...

0.437086

class Solution: def maximalSquare(self, matrix): """ :type matrix: List[List[str]] :rtype: int """ if not matrix: return 0 m, n = len(matrix), len(matrix[0]) dp = [int(matrix[i][0]) for i in range(m)] vmax = max(dp) ...

0.436392

class Solution: def nextGreaterElement(self, n): """ :type n: int :rtype: int """ s=[i for i in str(n)] exist=-1 for i in range(len(s)-1,0,-1): if s[i-1]<s[i]: temp=sorted(s[i-1:]) pivot=temp.index(s[i-1])...

0.435654

n = int(input()) l = list(map(int,input().split())) curr = 0 best = 0 prevs = [0] * 31 for v in l: curr += v if v >= 0: for i in range(0, v): prevs[i] = curr for i in range(v, 31): best = max(curr - prevs[i] - i, best) else: for i in range(31): pr...

0.435528

def array_leaders(numbers): return [n for (i,n) in enumerate(numbers) if n>sum(numbers[(i+1):])]

0.435126

from functools import reduce from math import gcd def survivor(a): """Round Robin by Bocker & Liptak""" def __residue_table(a): n = [0] + [None] * (a[0] - 1) for i in range(1, len(a)): d = gcd(a[0], a[i]) for r in range(d): try: nn = m...

0.434646

def finding_k(arr): for n in range(max(arr)-1, 0, -1): if len({ x%n for x in arr }) == 1: return n return -1

0.43415

def array_conversion(arr): sign = 0 while len(arr) > 1: sign = 1^sign arr = list(map(lambda x, y: x+y, arr[0::2],arr[1::2]) if sign else map(lambda x, y: x*y, arr[0::2],arr[1::2])) return arr[0]

0.433954

class Solution: def arrayPairSum(self, nums): """ :type nums: List[int] :rtype: int """ nums.sort() return sum(nums[::2])

0.43389

class Solution: def trap(self, height): """ :type height: List[int] :rtype: int """ if not height: return 0 result = 0 left = 0 right = len(height) - 1 while left < right: if height[left] <= height[right]: ...

0.433835

# cook your dish here n = int(input()) l = list(map(int, input().strip().split())) m = 0 f = [] for e in l: if(e != 0): m = m+1 else: f.append(m) m = 0 f.append(m) print(max(f))

0.433249

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): #print(*args, **kwargs, file=sys.stderr) # in python 3.4 **kwarg...

0.431054

class Solution: def maxValueAfterReverse(self, nums: List[int]) -> int: n = len(nums) base = sum([abs(nums[i] - nums[i+1]) for i in range(n - 1)]) if (n <= 2): return base #best = base #for i in range(n-1): # for j in range(i+1, n): # ...

0.430855

def consecutive(arr): return max(arr) - min(arr) + 1 - len(arr) if arr else 0

0.430607

class Solution: def findMaximumXOR(self, nums): """ :type nums: List[int] :rtype: int """ ans = 0 for bit in range(31, -1, -1) : ans = (ans << 1) + 1 pre = set() for n in nums : p = (n >> bit) & ans ...

0.42941

AVAILABLE_METHODS = { 'even' : lambda x: x / 2, 'odd': lambda x: 3 * x + 1 } def generator(x): temp = x temp_num = 0 while temp > 1: if temp % 2 == 0: temp = AVAILABLE_METHODS['even'](temp) else: temp = AVAILABLE_METHODS['odd'](temp) temp_num += 1 ...

0.429167

def maxval(arr): fn = [float('-inf')]*(len(arr)+1) sn = [float('-inf')]*len(arr) tn = [float('-inf')]*(len(arr)-1) fon = [float('-inf')]*(len(arr)-2) for i in reversed(list(range(len(arr)))): fn[i] = max(fn[i + 1], arr[i]) for i in reversed(list(range(len(arr) - 1))): sn[i] = max...

0.427459

a=1 for i in[*open(0)][1].split():a*=int(i);a=[-1,a][0<=a<=10**18] print(a)

0.427189

def diff(arr): r = arr and max(arr, key = lambda x : abs(eval(x))) return bool(arr and eval(r)) and r

0.426526

def find_part_max_prod(n): if n == 1: return [[1], 1] q, r = divmod(n, 3) if r == 0: return [[3]*q, 3**q] if r == 1: return [[4] + [3]*(q - 1), [3]*(q - 1) + [2, 2], 3**(q - 1) * 2**2] return [[3]*q + [2], 3**q * 2]

0.426026

class Solution: def longestConsecutive(self, nums): """ :type nums: List[int] :rtype: int """ longest_streak = 0 num_set = set(nums) for num in num_set: if num - 1 not in num_set: current_num = num current...

0.425705

class Solution: def findKthLargest(self, nums, k): """ :type nums: List[int] :type k: int :rtype: int """ nums = sorted(nums, reverse=True) return nums[k - 1]

0.425467

def infected_zeroes(s): m=0; l=0 for i,n in enumerate(s): if n==0: m=i if l==0 else max(m, (i-l+1)//2); l=i+1 return max(m,len(s)-l)

0.42542

from sys import maxsize # Function to find the maximum contiguous subarray # and print its starting and end index def maxSubArraySum(a,size): max_so_far = -maxsize - 1 max_ending_here = 0 start = 0 end = 0 s = 0 for i in range(0,size): max_ending_here += a[i] if max_so_far < max_ending_here: ma...

0.425361

You are given an integer num. You will apply the following steps exactly two times: Pick a digit x (0 <= x <= 9). Pick another digit y (0 <= y <= 9). The digit y can be equal to x. Replace all the occurrences of x in the decimal representation of num by y. The new integer cannot have any leading zeros, also the new in...

class Solution: def maxDiff(self, num: int) -> int: if num < 10: return 8 a = b = str(num) i = 0 while i < len(a): if a[i] == '9': i += 1 else: a = a.replace(a[i], '9') break if b[0] != '1': ...

0.822539

class Solution: def maximumSwap(self, num): """ :type num: int :rtype: int """ s = str(num) nums = [int(_) for _ in s] dp = [-1]*len(nums) for i in range(len(nums)-1,-1,-1): if i==len(nums)-1: dp[i] = i ...

0.725311

n = int(input()) def p(x): ans = 1 while x > 0: ans *= x % 10 x //= 10 return ans ans = p(n) for i in range(len(str(n))): cans = 9 ** i * p((n // 10 ** i) - 1) ans = max(ans, cans) print(ans)

0.708299

string=input() max_no=0 for i in range(len(string)): var_occur=0 check_no=str() j=i while(j<len(string) and var_occur<2 ): if(string[j].isalpha()): if(var_occur==0): check_no+='9' var_occur+=1 else: var_occur+=1 else: check_no+=string[j] j+=1 #print(check_no) max_no=max(max_no,int(check...

0.707976

def solve(n): x = str(n) res = [x] + [str(int(x[:i]) - 1) + '9' * (len(x) - i) for i in range(1, len(x))] return int(max(res, key=lambda x: (sum(map(int, x)), int(x))))

0.703826

def main(): s = input() n = len(s) t = int(str(int(s[0]) + 1) + '0' * (n - 1)) print(t - int(s)) main()

0.693579

masks = [0] * 10 for i in range(10 ** 4): for c in str(i): masks[int(c)] |= 1 << i def find_num(n): seq, x = 1, 0 for j in range(n): M = seq for m in masks: if x & m: M |= m x = ~M & (M+1) seq |= x return x.bit_length() - 1

0.682115

x=int(input()) def s(a): r=0 while a>0: r+=a%10 a//=10 return r def d(a,b): r=0 for i in range(6): if a%10!=b%10: r += 1 a//=10 b//=10 return r c=6 for i in range(1000000): if s(i%1000)==s(i//1000): c=min(c,d(x,i)) print(c)

0.680802

def delete_digit(n): s = str(n) return int(max(s[:i] + s[i+1:] for i in range(len(s))))

0.678071

import fractions import sys f = sys.stdin if len(sys.argv) > 1: f = open(sys.argv[1], "rt") sum_cache = {} def sum_func(x): if x < 10: return x r = sum_cache.get(x) if r is not None: return r xx = 0 while x > 0: xx += x % 10 x /= 10 r = sum_func(xx) ...

0.668163

MEMO = [] def sum_dif_rev(n): i = MEMO[-1] if MEMO else 0 while len(MEMO) < n: i += 1 r = int(str(i)[::-1]) if i % 10 and r != i and (i + r) % abs(r - i) == 0: MEMO.append(i) return MEMO[n-1]

0.666539

# cook your code here n=input() x=len(n) no=list(map(int,n)) temp=[0]*x if (x>2): sum=99 for i in range(3,x): sum=sum+90 sum=sum+10*(int(n[0])-1) sum=sum+int(n[1]) f=int(n[0])%10 s=int(n[1])%10 cd=s-f temp[0]=n[0] temp[1]=n[1] for i in range(2,x): nxt=(s+cd)%10 temp[i]=(chr(nxt+48)) s=nxt temp=...

0.665615

def find(ins): ins += 1 test = [int(i) for i in str(ins)] inlist = [] for i in test: if i in inlist: test = find(ins) break else: inlist.append(i) return ''.join(str(x) for x in test) ins = int(input()) print(find(ins))

0.664057

from operator import mul from functools import reduce def genSequence(n): yield n while True: n += reduce(mul, [int(d) for d in str(n) if d != '0']) if n > 9 else n yield n def extract(seq, v): return sorted(seq).index(v) def convergence(n): gen1, genN = genSequence(1), genSequence(n)...

0.657735

import re def solve(s): return max(map(int,re.findall(r"(\d+)", s)))

0.657203

def basereduct(x): for _ in range(150): x = int(str(x), int(max(str(x))) + 1 + ('9' in str(x))) if x < 10: return x return -1

0.655355

def max_number(n): return int(''.join(sorted(str(n), reverse=True)))

0.654374

def sum_part(n): m, p, q, r, s = 1, 1, 1, 0, n while n > 9: n, d = divmod(n, 10) r += d * p p *= 10 if d: m = 1 else: m*= 2 s += q*n + m*memo[r] q *= 2 return s from collections import defaultdict qualified = defaultdict(list) memo = {n: n for n in ra...

0.653275

def solution(digits): numlist = [int(digits[i:i+5]) for i in range(0,len(digits)-4)] return max(numlist)

0.65012

n = int(input()) a = int(str(n)[0]) l = len(str(n)) - 1 val1 = a * 10 ** l - 1 val2 = n - val1 def sd(x): return sum(int(d) for d in str(x)) print(sd(val1) + sd(val2))

0.648167

def solve(n): def length(n): s = 0 for i in range(20): o = 10 ** i - 1 if o > n: break s += (n - o) * (n - o + 1) // 2 return s def binary_search(k): n = 0 for p in range(63, -1, -1): if length(n + 2 ** p) < k: n += 2 ** p ...

0.645962

start = input() counter = 0 sInt = int(start) while sInt!=0: sInt-=max([int(c) for c in start]) start=str(sInt) counter+=1 print(counter)

0.645654

from functools import cmp_to_key cmp = lambda a, b: int('%i%i' % (b, a)) - int('%i%i' % (a, b)) largest_arrangement = lambda n: int(''.join(str(i) for i in sorted(n, key = cmp_to_key(cmp))))

0.644908

def find(a,b,n): strng = str(a) + str(b) #there are 10 and 4 long loops if (n > 20): n = n%20+20 while len(strng) <= n: next_ch = int(strng[-1]) + int(strng[-2]) strng = strng + str(next_ch) return int(strng[n])

0.643178

S=input() a=1145141919810 for i in range(len(S)-2): a=min(a,abs(753-int(S[i:i+3]))) print(a)

0.640145

class Solution: def addDigits(self, num): """ :type num: int :rtype: int """ if num == 0: return 0 return 1 + (num - 1) % 9

0.639136

s=int(input()) while(s>0): s-=1 a=input() c=0 for x in a: c+=int(x) if(c<9 and len(a)!=1): print(9-c%9) else: print(min(9-c%9,c%9))

0.637753

l = int(input()) n = input() best = int(n) p = (l - 1) // 2 for i in range(p, -1, -1): if (n[i + 1] == '0'): continue best = min(best, int(n[0:(i + 1)]) + int(n[i + 1:])) break p = l // 2 for i in range(p, l): if (n[i] == '0'): continue best = min(best, int(n[0:i]) + int(n[i:])) break print(best)

0.635522

def self_converge(number): n, cycle = str(number), set() while n not in cycle: cycle.add(n) s = ''.join(sorted(n)) n = '%0*d' % (len(n), int(s[::-1]) - int(s)) return -1 if not int(n) else len(cycle)

0.634782

def solve(n): moves = [] for a, b in ["25", "75", "50", "00"]: s = str(n)[::-1] x = s.find(a) y = s.find(b, x+1 if a == "0" else 0) if x == -1 or y == -1: continue moves.append(x + y - (x > y) - (a == b)) s = s.replace(a, "", 1).replace(b, "", 1) ...

0.634534

class Solution: def binaryGap(self, n: int) -> int: maxDist = 0 currDist = 0 while n: if n & 1 and currDist != 0: maxDist = max(maxDist, currDist) currDist = 1 elif n & 1: currDist = 1 elif not n & 1 and curr...

0.634269

def solve(n): if n < 10: return n a = int((len(str(n)) - 1) * '9') b = n - a return sum([int(i) for i in (list(str(a)) + list(str(b)))])

0.632713

from itertools import count # Couldn't find the pattern of why it's 1 or 8, I'm sad :( def repeat_sequence_len(n): memo = {} for i in count(): if n in memo: return i - memo[n] memo[n] = i n = sum(d*d for d in map(int, str(n)))

0.63231

class Solution: def subtractProductAndSum(self, n: int) -> int: stringInt = str(n) product = 1 sum = 0 for i in stringInt: product *= int(i) sum += int(i) return product - sum

0.630452

class Solution: def monotoneIncreasingDigits(self, N): """ :type N: int :rtype: int """ arr = [int(ch) for ch in str(N)] # create array from number 1234 => [1,2,3,4] marker = len(arr) i = len(arr)-2 while i >= 0: ...

0.627417

s = input() p = sum(map(int, s[1:])) + 9 * s.count('0') + 1 print(p)

0.626068

n = int(input()) t = input() if n == 1: if t == "0": print((10 ** 10)) else: print((2 * 10 ** 10)) elif n == 2: if t == "00": print((0)) elif t == "01": print((10 ** 10 - 1)) elif t == "10": print((10 ** 10)) else: # 11 print((10 ** 10)) else: ...

0.625436

def rec(i): nonlocal a return i import sys from collections import Counter sys.setrecursionlimit(10**6) n=int(input()) #n,m=list(map(int,input().split())) a=[input() for i in range(n)] b=[] a0=set() c0=set() for i in a: c=set() for i0 in range(1,10): for i1 in range(0,10-i0): c.add(i...

0.623391

class Solution: def numDupDigitsAtMostN(self, N: int) -> int: # N -> total numbers less than or equal to N # We will calculate the integers with all different digits (which are less than/equal to N) # Then the answer would be: N - nums_with_different_digits # Calculate the n...

0.622055

from fractions import Decimal, gcd from operator import mul from functools import reduce lcm = lambda a, b=1: a * b // gcd(a, b) def parameter(n): digits = Decimal(n).as_tuple().digits return lcm(sum(digits), reduce(mul, digits))

0.621865

hola = 0 a = int(input()) d = len(str(a)) k = 10**(d-1) for i in range(1, d): hola += i * (10**(i-1)*9) hola += d * (a-k+1) print(hola)

0.621341

from collections import Counter from itertools import combinations from operator import mul from functools import reduce def largest_palindrom_from(n): digits = sorted(str(n)) singles, pairs = [], [] # group digits to pairs and singles while digits: digit = digits.pop() if digits a...

0.62127

class Solution: def reformat(self, s: str) -> str: n = [str(i) for i in range(0, 10)] a, b = [], [] for i in s: if i in n: b.append(i) else: a.append(i) if abs(len(a) - len(b)) > 1: return '' r = '' i...

0.620753

s=input() ans=0 i=1 past=int(s[0]) c=1 ans=1 while(i<len(s)): if(int(s[i])+past==9): c+=1 past=int(s[i]) else: if(c%2==1 and c!=1): ans*=(c//2+1) c=1 past=int(s[i]) i+=1 if(c!=1 and c%2==1): ans*=(c//2+1) print(ans)

0.620677

num = list(map(int, input())) best = num[:] for i in range(-1, -len(num) - 1, -1): if num[i] == 0: continue num[i] -= 1 for j in range(i + 1, 0): num[j] = 9 if sum(num) > sum(best): best = num[:] s = ''.join(map(str, best)).lstrip('0') print(s)

0.620042

from functools import reduce from operator import mul def maximum_product_of_parts(n): s = str(n) return max(reduce(mul, map(int, (s[:i], s[i:j], s[j:]))) for i in range(1,len(s)-1) for j in range(i+1,len(s)))

0.619829

def largest_sum(s): return max(sum(map(int,x)) for x in s.split('0'))

0.619152

T = 1 for test_no in range(T): MAXK = 5000 n = int(input()) cnt = [0] * (MAXK + 1) primeExponential = [[0 for j in range(MAXK + 1)] for i in range(MAXK + 1)] line, num = (input() + ' '), 0 for c in line: if c != ' ': num = num * 10 + (ord(c) - 48) else: cnt[num] += 1 num = 0 for i in range(2, MAXK + ...

0.617632

x = list(input()) for i in range(len(x)): if(i==0 and x[i]=='9'): continue if(int(x[i])>9-int(x[i])): x[i] = str(9-int(x[i])) y=0 for item in x: y*=10 y+=int(item) print(y)

0.615992

n = int(input()) if n >= 0: print(n) else: n = str(n) print(max(int(n[:-1]), int(n[:-2] + n[-1])))

0.615955

def gap(num): s = bin(num)[2:].strip("0") return max(map(len, s.split("1")))

0.615683

def persistence(n): n = str(n) count = 0 while len(n) > 1: p = 1 for i in n: p *= int(i) n = str(p) count += 1 return count # your code

0.615407

digits = lambda x: set(str(x)) def LDTA(n): if digits(n) == digits(n*n): return None seen = [] x = n while len(seen) < 10: for d in str(x): if d not in seen: seen.append(d) x *= n return int(seen[-1])

0.613692

# -*- coding: utf-8 -*- ngoods = { '0': 2, '1': 7, '2': 2, '3': 3, '4': 3, '5': 4, '6': 2, '7': 5, '8': 1, '9': 2 } digits = input().strip() print(ngoods[digits[0]] * ngoods[digits[1]])

0.612958

class Solution: def longestAwesome(self, s: str) -> int: cum = [0] firsts = {0: -1} lasts = {0: -1} for i, c in enumerate(s): cum.append(cum[-1] ^ (1 << (ord(c) - 48))) if cum[-1] not in firsts: firsts[cum[-1]] = i lasts[cum[-1]] = ...

0.611947

def end(x) : if x == 0 : return "1869"; if x == 6 : return "1968"; if x == 5 : return "1689"; if x == 4 : return "6891"; if x == 3 : return "1689"; if x == 2 : return "1986"; if x == 1 : return "1896"; d = [0] * 10; for c in input()...

0.611862

s=input() dp0=[0]*(len(s)+1) dp1=[0]*(len(s)+1) dp1[0]=1 for i in range(1,len(s)+1): n=int(s[i-1:i]) dp0[i]=min(dp0[i-1]+n,dp1[i-1]+10-n) dp1[i]=min(dp0[i-1]+(1 if n+1==10 else n+1),dp1[i-1]+10-n-1) print(dp0[-1])

0.611201

import os import random import sys from typing import List, Dict class Int: def __init__(self, val): self.val = val def get(self): return self.val + 111 class Unique: def __init__(self): self.s = set() def add(self, val : int): self.s.add(val) def __contains__(s...

0.610876

l = {j:i for i,j in enumerate('0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz')} l_ = dict(enumerate('0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz')) is_polydivisible = lambda n, base:next((0 for i in range(1, len(n) + 1) if get_base(n[:i], base) % i),1) get_base = lambda n, base:sum(...

0.609143

def modify(string, index): if string[index] == '0': key = 0 else: key = 10 - int(string[index]) bad = '' for i in string: bad += str((int(i) + key) % 10) return bad[index:] + bad[:index] x = int(input()) y = input() minx = 'zzzzzzzzz' for i in range(x): minx = min...

0.607229

from sys import stdin as cin from sys import stdout as cout def main(): n = int(cin.readline()) o = 0 for x in range(9, 0, -1): if 10 ** x // 2 <= n: ##print(x) for i in range(9): q = 10 ** x * (i + 1) // 2 - 1 if q <= n: o...

0.606019

import re ls = ["Zero","One","Two","Three","Four","Five","Six","Seven","Eight","Nine","Ten","Eleven","Twelve","Thirteen"] def max_consec_zeros(n): return ls[max(map(lambda x:len(x),re.findall(r'0*',bin(int(n))[2:])))]

0.605588

n=int(input()) s=input() pw=[1] last=1 for i in range(70): if (last>1e19): break pw.append(last*n) last=last*n dp=[1e19]*100 for i in range(100): dp[i]=[1e19]*100 dp[len(s)][0]=0 for i in range(len(s),-1,-1): for power in range(0,len(pw)): cur='' for j in range(i-1,-1,-1): ...

0.60415

def flipping_game(num): current = 0 biggest = 0 for i in num: current = max(0, current - ( i or -1 ) ) biggest = max(biggest, current) return sum(num) + (biggest or -1)

0.603514

class Solution: memory = {} largest = [0] trackerForLargest = {} largestSize = [0] numGroups = [0] def countLargestGroup(self, n: int) -> int: if n > self.largest[0]: for num in range(self.largest[0] + 1, n + 1): curr = num currSum = 0 ...

0.603094

def single_digit(n): while n > 9: n = bin(n).count("1") return n

0.602683

n,m=map(int,input().split()) a=list(map(int,input().split())) dp=[0]+[-1]*(9*n) l=[0,2,5,5,4,5,6,3,7,6] for i in range(n): for j in a: if dp[i]>=0: dp[i+l[j]]=max(dp[i+l[j]],dp[i]*10+j) print(dp[n])

0.60225

class Solution: def largestPalindrome(self, n): """ :type n: int :rtype: int """ A = [0,9,987,123,597,677,1218,877,475] return A[n]

0.601252

n=input() rg=[0]*10 for i in n: rg[int(i)]+=1 rl=[] ff=0 for i in range(len(rg)): if rg[i]!=0: rl.append(rg[i]) if i==0: ff=1 fact=[1] fc=1 for i in range(1,20): fc*=i fact.append(fc) rt=[] t=0 def cfs(d): if d==len(rl): nonlocal t,ff jj=fact[sum(rt)] for i in rt:...

0.597955

a,b=[int(_) for _ in input().split()] if b==0: print(a) else: l=[] a=str(a) for i in range(len(a)): l.append(a[i]) for i in range(len(l)): if b==0: break if l[i]=='9': continue else: l[i]='9' b-=1 ...

0.593741

def get_num(n): return sum({'0': 1, '6': 1, '9': 1, '8': 2}.get(d, 0) for d in str(n))

0.593601

s = input() m = int(input()) mn = m ttt = 0 t = 0 ttt = 1 for i in range(1,len(s)): ttt = (ttt * 10) % m for i in range(0,len(s)): t = (t * 10 + ord(s[i]) - ord('0')) % m for i in range(0,len(s)): if s[i] != '0': mn = min(mn,t) t = t - (((ord(s[i])- ord('0')) * ttt) % m) if t < 0: t ...

0.593281

import sys input = sys.stdin.readline from fractions import gcd import numpy as np MOD = 10 ** 9 + 7 S = int(input()) M = 10**4 def type_1(S): cnt = 0 # S 2種の桁数k,k+1からなる。さらにk>=9を仮定する。 # 項数nとすると、kn < S < (k+1)n となる(k,n)の個数を数える # まずk > Mとなるものを数える。このとき1<=n<=Mである。 n = np.arange(1,M+1) k_max = (...

0.593173

def number_of_carries(a, b): ans, carrie = 0, 0 while a > 0 or b > 0: carrie = (a%10 + b%10 + carrie) // 10 ans += [0,1][carrie > 0] a //= 10 b //= 10 return ans

0.592956

#!/bin/pypy3 from itertools import* from timeit import* from typing import Optional S=lambda x:sum(map(int,str(x))) def ceil_s_divisible_a(x:int,a:int) -> Optional[int]: z=S(x)%a if z: z=a-z tail=[] x=list(str(x)) while x: digit=x.pop() diff=min(z,9-int(digit)) z-=diff tail.append(str(int(digit)...

0.592807

N = int(input()) i = N + 1 flag = 0 for i in range(N+1, 987654321): a = str(i) b = list(a) c = set(a) if '0' not in b: if len(b) == len(c): print(i) flag += 1 break if flag < 1: print(0)

0.59167

n = input() x = len(n) n = n.replace('4', '0') n = n.replace('7', '1') tmp = 2 * (2**(x-1) - 1) print(tmp + int(n, 2) + 1)

0.59146

a = int(input()) s = "" for i in range(1, a+1): s += str(i) print(s[a-1])

0.590172

from collections import defaultdict k = int(input()) d = defaultdict(list) for i in range(10): d[(1, i)].append(i) mx = 10 pw = 1 for digs in range(2, mx): pw *= 10 for sm in range(11): for curr in range(10): for num in d[(digs-1, sm-curr)]: d[(digs, sm)].append( curr*...

0.589578

from collections import Counter EXECUTIONS_ORDER = [('Z', Counter("ZERO"), '0'), ('W', Counter("TWO"), '2'), ('U', Counter("FOUR"), '4'), ('X', Counter("SIX"), '6'), ('G', Counter("EIGHT"), '8'), ('O', Counter("O...

0.589564

from operator import mul from functools import reduce def find_middle(s): if not s or not isinstance(s,str): return -1 lstDig = [int(c) for c in s if c.isnumeric()] if not lstDig: return -1 prod = str( reduce(mul,lstDig) ) i = (len(prod) - 1) // 2 return int(prod[i:-i or len(prod)]...

0.588764

def digits_product(product): if product < 10: return 10 + product n = '' for d in range(9, 1, -1): while not product % d: n += str(d) product //= d return int(n[::-1]) if product == 1 else -1

0.588479

import sys import queue INFINITY = 10**10 def main(): n = input() print(solve(n)) def solve(n): if int(n) < 1000: return brute(n) forward = min([calc(str(n), last_digits) for last_digits in ["00", "25", "50", "75"]]) reverse = min([calc(str(n), last_digits) + 1 for last_digits i...

0.588093

import math class Solution: def smallestGoodBase(self, n): n = int(n) maxLength = int(math.log(n,2)) for m in range(maxLength, 1, -1): k = int(n**m**-1) if (k**(m+1) - 1)//(k - 1) == n: return str(k) return str(n-1) """ ...

0.587834

from itertools import permutations def permutation_average(n): perms = [float(''.join(e)) for e in permutations(str(n))] return int(round(sum(perms) / len(perms)))

0.587829

""" Codeforces Contest 264 Div 2 Problem B Author : chaotic_iak Language: Python 3.3.4 """ def main(): n, = read() print(max(read())) ################################### NON-SOLUTION STUFF BELOW def read(mode=2): # 0: String # 1: List of strings # 2: List of integers inputs = input().strip(...

0.586012

# cook your dish here x=input () y=len (x) if y==1: print('1') elif y==2: print('2') elif y==3: print('3') elif y>3: print('More than 3 digits')

0.585544

k = int(input()) n = input() digit = [0]*10 for c in n: digit[int(c)]+= 1 dsum = sum(i*digit[i] for i in range(10)) i = 0 change = 0 while dsum < k: if digit[i] == 0: i+= 1 continue digit[i]-= 1 digit[9]+= 1 change+= 1 dsum+= 9-i print(change)

0.584949

darling = {} x = int(input()) ans = 0 while (x not in darling): darling[x] = 1 ans += 1 x += 1 while (x % 10 == 0): x /= 10 print(ans)

0.583382

from itertools import combinations def digits(num): return list(map(sum, combinations(map(int,str(num)),2)))

0.582978

import itertools def cal(N, target_num, keta): answer = float('inf') for p in itertools.product(target_num, repeat=keta): temp = 0 for i, num in enumerate(p): temp += num * 10**i if temp >= N: answer = min(answer, temp) return answer def __star...

0.582484

for _ in range(int(input())): n=input().rstrip() n=[ele for ele in n] l=len(n) m=10**18+8 ini=1 for i in range(l-1,-1,-1): if int(n[i])<=m: if ini==1: m=int(n[i]) else: m=max(m,n[i]) else: m=int(n[i])-1 n[i]=str(m) for j in range(l-1,i,-1): n[j]='9' i=0 while n[i]=='0': i+=1...

0.582033

k = int(input()) import queue que = queue.Queue() for i in range(1, 10): que.put(i) for i in range(1, k + 1): ans = que.get() keta1 = ans % 10 if keta1 == 0: append_list = [ans * 10, ans * 10 + 1] elif keta1 == 9: append_list = [ans * 10 + 8, ans * 10 + 9] else: appen...

0.58202

s=input();M=10**9+7;o=u=v=0;n=len(s) for i in range(n):c=int(s[i]);u+=v;v=(10*v+c)%M;o+=pow(10,n-i-1,M)*((i*i+i)//2*c+u) print(o%M)

0.581511

def main(): v = { "1" : 2, "2" : 5, "3" : 5, "4" : 4, "5" : 5, "6" : 6, "7" : 3, "8" : 7, "9" : 6, "0" : 6 } a, b = map(int, input().split()) answer = 0 for i in range(a, b + 1): s = str(i) for e in s: ...

0.581406

def min_value(digits): return int("".join(map(str,sorted(set(digits)))))

0.581097

def calc(s): total1 = ''.join(map(lambda c: str(ord(c)), s)) total2 = total1.replace('7', '1') return sum(map(int, total1)) - sum(map(int, total2))

0.580805

x = int(input()) y = input() if x <= 3: print(x) quit() num1 = 0 num0 = 0 for i in y: if i == '1': num1 = max(num1, num0+1) else: num0 = max(num0, num1+1) maxx = max(num1, num0) if '11' not in y and '00' not in y: print(maxx) quit() print(min(maxx+2, x))

0.58044

from itertools import permutations def sc_perm_comb(num): sNum = str(num) return sum({ int(''.join(p)) for d in range(1, len(sNum)+1) for p in permutations(sNum, d) })

0.580228

def sum_digits(number): return sum(map(int, str(abs(number))))

0.579594

from collections import Counter def self_descriptive(num): s = [int(a) for a in str(num)] cnt = Counter(s) return all(cnt[i] == b for i, b in enumerate(s))

0.579456

Given an array of integers arr of even length n and an integer k. We want to divide the array into exactly n / 2 pairs such that the sum of each pair is divisible by k. Return True If you can find a way to do that or False otherwise. Example 1: Input: arr = [1,2,3,4,5,10,6,7,8,9], k = 5 Output: true Explanation: Pair...

class Solution: def canArrange(self, arr: List[int], k: int) -> bool: freq = [0] * k for n in arr: freq[n%k] += 1 if freq[0] % 2: return False for i in range(1, (k//2)+1): if freq[i] != freq[k-i]: return False if k%2 is 0: ...

0.791758

class Solution: def isPossibleDivide(self, s: List[int], k: int) -> bool: if len(s) % k != 0: return False ctr = collections.Counter(s) for _ in range(len(s) // k): mn = [] for i in ctr: if mn == [] and ctr[i] > 0: ...

0.764396

class Solution: def checkSubarraySum(self, nums, k): """ :type nums: List[int] :type k: int :rtype: bool """ if k==0: j=0 for i in range(0,len(nums)): if nums[i]==0: if j<i: ...

0.721323

class Solution: def canPartitionKSubsets(self, nums, k): """ :type nums: List[int] :type k: int :rtype: bool """ target,rem=divmod(sum(nums),k) if rem or max(nums)>target: return False n=len(nums) seen=[0]*n nums.sort(reverse...

0.655104

# Calculate the prefix sum and count it. # In c++ and java, a % K + K takes care of the cases where a < 0. # Python class Solution: def subarraysDivByK(self, A, K): res = 0 prefix = 0 count = [1] + [0] * K for a in A: prefix = (prefix + a) % K res += count[p...

0.644134

class Solution: def numberOfSubarrays(self, nums: List[int], k: int) -> int: # save all even subarray's length which between odds edge = [] res = 0 count = 0 for i in nums: # odd if i % 2: # +1 because range from 0 to count when doing c...

0.632454

class Solution: def kLengthApart(self, nums: List[int], k: int) -> bool: if nums.count(0) == len(nums): return True idx = nums.index(1) ctr = 0 for num in nums[idx+1:]: if num == 1: if ctr < k: return False...

0.61761

class Solution: def checkIfExist(self, arr: List[int]) -> bool: found = {} for num in arr: if num * 2 in found: return True if num % 2 == 0 and num / 2 in found: return True found[num] = True return False

0.613644

import math n, k = map(int, input().split()) a = list(map(int, input().split())) now = [-1] * k t = [0] * k nxt = 0 m = 0 intr = [False for i in range(n)] while m < n: for i in range(k): if now[i] != 1005 and (now[i] == -1 or t[i] == a[now[i]]): if now[i] != -1: m += 1 ...

0.60635

# cook your dish here for _ in range(int(input())): n,k=list(map(int,input().split())) a=list(map(int,input().split())) m=0 for i in range(n): if i%2==0: if m<0: m-=a[i] else: m+=a[i] else: if m<0: m+=a[i] else: m-=a[i] if abs(m)>=k: print(1) else: print(2)

0.605763

import sys def r(): return list(map(int, input().split())) n, k = list(map(int, input().split())) a = r() cnt4 = n cnt2 = 2*n cnt1 = 0 for i in range(k): x = min((a[i]+1)//4, cnt4) cnt4 -= x a[i] = max(0, a[i]-4*x) cnt2 += cnt4 cnt1 += cnt4 for i in range(k): x = min(a[i]//2, cnt2) cnt2 -= x...

0.586572

from itertools import combinations def solve(a, n): return any(sum(c) % n == 0 for i in range(len(a)) for c in combinations(a, i+1))

0.585894

class Solution: def canPartition(self, nums): """ :type nums: List[int] :rtype: bool """ _sum=sum(nums) div,mod=divmod(_sum,2) if mod!=0: return False target=[div]*2 self._len=len(nums) nums.sort(reverse=True) ...

0.579426

def odd_or_even(arr): return 'even' if sum(arr) % 2 == 0 else 'odd'

0.577515

class Solution: def canThreePartsEqualSum(self, A: List[int]) -> bool: # if len(A)<3: # return # i = 1 # j = len(A)-2 # tgtsum = sum(A)/3 # sum1 = sum(A[:i]) # while i<(len(A)-2) and sum1!=tgtsum: # sum1 = sum1 + A[i]...

0.577261

class Solution: def kConcatenationMaxSum(self, arr: List[int], k: int) -> int: oneArrSum = sum(arr) twoArr = arr + arr def findMaxSub(array): if len(array) == 1: return array[0] cur = 0 small = 0 ret = -999...

0.570982

for i in range(eval(input())): n,k=input().strip().split() n=int(n) k=int(k) print(int( ((n-k)&(int((k-1)/2)))==0))

0.567644

class Solution: def findPairs(self, nums, k): """ :type nums: List[int] :type k: int :rtype: int """ # import collections # unique_nums = set(nums) # count = 0 # new_nums = collections.Counter(nums) # if k == 0: # ...

0.567452

class Solution: def subarraySum(self, nums, k): """ :type nums: List[int] :type k: int :rtype: int """ dic = {} numSum = 0 dic[0] = 1 ans = 0 for i in range(len(nums)): numSum += nums[i] if...

0.565972

# 割り切る数は、Aの総和の約数である # 自分自身を除く約数について大きい順にすべて試して、当てはまるものがあれば答え # 8,20を7の倍数に近づけるとき、 # 8 -> mod 7が1であり、-1か+6で7の倍数になる # 20 -> mod 7が6であり、-6か+1で7の倍数になる # -1と+1をペアにすることが出来て、この操作回数1をK = 3から引くと2となり、これが偶数ならOK import sys readline = sys.stdin.readline N,K = map(int,readline().split()) A = list(map(int,readline().split())) all ...

0.564149

def isSubsetSum(arr, n, sum): subset = [ [False for j in range(sum + 1)] for i in range(3) ] for i in range(n + 1): for j in range(sum + 1): if (j == 0):subset[i % 2][j] = True elif (i == 0):subset[i % 2][j] = False elif (arr[i - 1] <= j):subset[i % 2][j] = sub...

0.563901

class Solution: def splitArraySameAverage(self, A): N, S = len(A), sum(A) if N == 1: return False A = [z * N - S for z in A] mid, left, right = N//2, {A[0]}, {A[-1]} if not any((S*size) % N == 0 for size in range(1, mid+1)): return False for i in range(1, mid): le...

0.563446

from math import * from sys import * n, k = map(int, stdin.readline().split(" ")) a = 1; for c in map(int, stdin.readline().split(" ")): a = a * (gcd(k, c)//gcd(a, c)) if a%k == 0: print("Yes") else: print("No")

0.56291

class Solution: def canReach(self, arr: List[int], start: int) -> bool: dq = collections.deque([start]) visited = set([start]) while dq: curr = dq.pop() if arr[curr] == 0: return True ...

0.562179

def subsets_parity(n, k): return 'EVEN' if ~n & k else 'ODD'

0.56054

import queue class Solution: def containsPattern(self, arr: List[int], m: int, k: int) -> bool: streak = 0 for i in range(len(arr)-m): if arr[i] == arr[i+m]: streak +=1 else: streak = 0 if streak == (k-1)*m: ...

0.555493

from collections import Counter class Solution: def canConstruct(self, s: str, k: int) -> bool: if k > len(s): #return False return False counter = Counter(s) odd_counts = 0 for char in counter: if counter[char] % 2 == 1: odd_counts +=...

0.554068

# cook your dish here from itertools import accumulate n, k = map(int, input().split()) lst = list(map(int, input().split())) temp = (10**9)+7 for i in range(k): lst = list(accumulate(lst)) for i in lst: print(i%(temp), end = ' ')

0.553358

n, k = map(int, input().split()) D = list(map(int, input().split())) z = {i: 0 for i in range(k)} for i in range(n): z[D[i] % k] += 1 cnt = z[0] // 2 for q in range(1, k // 2 + k % 2): cnt += min(z[q], z[k - q]) if k % 2 == 0: cnt += z[k // 2] // 2 print(cnt * 2)

0.553124

class Solution: def canReorderDoubled(self, A: List[int]) -> bool: cache=Counter(A) c_list=sorted(list(cache),key=abs) for x in c_list: if cache[x]>cache[2*x]: return False cache[2*x]-=cache[x] return True

0.553071

for _ in range(int(input())): n, k = map(int, input().split()) arr= list(map(int, input().split())) motu, tomu = [], [] for i in range(n): if i%2 == 0: motu.append(arr[i]) else: tomu.append((arr[i])) motu.sort(reverse=True) tomu.sort() for i in range(len(motu)): if len(tomu)-1<i: break if k==0: ...

0.551165

class Solution: def containsNearbyAlmostDuplicate(self, nums, k, t): """ :type nums: List[int] :type k: int :type t: int :rtype: bool """ if len(nums) < 2 or k <= 0 or t < 0: return False if t == 0: visited = set() fo...

0.550077

def divisible_count(x,y,k): return y//k - (x-1)//k

0.549103

import sys import random from fractions import Fraction from math import * def input(): return sys.stdin.readline().strip() def iinput(): return int(input()) def finput(): return float(input()) def tinput(): return input().split() def linput(): return list(input()) def rinput(): return ...

0.546401

class Solution: def divisorGame(self, N: int) -> bool: return N%2 == 0

0.543436

t = int(input()) for _ in range(t): n,k = list(map(int,input().split())) a = list(map(int,input().split())) for i in range(60, -1, -1): m = k ** i for j in range(n): if a[j] >= m: a[j] -= m break if all(i == 0 for i in a): print('YES') ...

0.542737

class Solution: def hasAllCodes(self, s: str, k: int) -> bool: if len(s) < 2 ** k + k - 1: return False # Cannot be a string, as this is the de brujin length target = 2 ** k seen = set() cur_len = 0 for end in range(k, len(s) + 1): chunk = s[end - k: e...

0.542706

import bisect N,K=list(map(int,input().split())) A=list(map(int,input().split())) S=[0 for i in range(N+1)] for i in range(N): S[i+1]=S[i]+A[i] S[i+1]%=K X=[(S[i]-i)%K for i in range(N+1)] D=dict() for i in range(N+1): if X[i] in D: D[X[i]].append(i) else: D[X[i]]=[i] ans=0 for k in D: ...

0.541929

def validate(n): digits = [int(x) for x in str(n)] even = [x*2 if x*2 <= 9 else x*2 - 9 for x in digits[-2::-2]] odd = [x for x in digits[-1::-2]] return (sum(even + odd)%10) == 0

0.537721

import sys input = sys.stdin.readline T = int(input()) for _ in range(T): N, K = list(map(int, input().split())) A = [int(a) for a in input().split()] B = [A[i+K]-A[K] for i in range(N-K)] mi = 10**20 mx = -1 for i in range(N-K): if A[i+K]-A[i] < mi: mi = A[i+K]-A[i] ...

0.536996

from math import sqrt def isprime(n): if (n % 2 == 0 and n > 2) or n == 1: return 0 else: s = int(sqrt(n)) + 1 for i in range(3, s, 2): if n % i == 0: return 0 return 1 def find(N, K): if (N < 2 * K): return 0 if (K == 1): return i...

0.536077

''' Created on Aug 28, 2016 @author: Md. Rezwanul Haque ''' def gcd(a,b): if b == 0: return a return gcd(b, a%b) def extend_euclid(a,b): if b == 0: return 1,0 else: y,x = extend_euclid(b, a%b) y = y - (a//b)*x return x,y n,m,k = map(int,input().split()) a = ...

0.535319

def main(): import sys from collections import defaultdict tokens = [int(i) for i in sys.stdin.read().split()] tokens.reverse() n, k = tokens.pop(), tokens.pop() d1 = defaultdict(int) d2 = defaultdict(int) result = 0 for i in tokens: result += d2[i * k] ...

0.534428

class Solution: def containsNearbyDuplicate(self, nums, k): """ :type nums: List[int] :type k: int :rtype: bool """ s=set(nums) if len(s)==len(nums):return False d=dict() for num in nums: d[num]=d.get(num,0)+1 fo...

0.533352

inp = input().split() n = int(inp[0]) k = int(inp[1]) a = input().split() for i in range(n): a[i] = int(a[i]) # End of Input bank = {} # Preparation for i in range(n): arg = (len(str(a[i])),a[i]%k) #print("Detect:",arg) bank[arg] = bank.get(arg,0)+1 ans = 0 # Query for i in range(n): ten = 1 ...

0.532994

import sys input = lambda: sys.stdin.readline().rstrip() T = int(input()) for _ in range(T): N, K = list(map(int, input().split())) A = [int(a) for a in input().split()] if K not in A: print("no") continue if N == 1 or (A[0] >= K and A[1] >= K): print("yes") continue...

0.532853

def is_very_even_number(n): while len(str(n)) > 1: n = sum(int(x) for x in str(n)) return True if n % 2 == 0 else False

0.532138

#!/usr/bin/env python3 [n, k] = list(map(int, input().strip().split())) ais = list(map(int, input().strip().split())) n1 = ais.count(1) one_serie = [0 for _ in range(n)] for i in reversed(list(range(n))): if ais[i] == 1: one_serie[i] = (0 if i == n - 1 else one_serie[i + 1]) + 1 n1_head = 0 count = 0 for i in ...

0.531514

N, K = map(int, input().split()) A = list(map(int, input().split())) ans = [] c = 2**30 r = 2**30 while r: r //= 2 l = sum(-(-a//c)-1 for a in A) if l > K: c += r else: ans.append(c) c -= r print(ans and min(ans) or 1)

0.531488

n, k = list(map(int, input().split())) A = list(map(int, input().split())) cumsum = [0] for a in A: cumsum.append(cumsum[-1] + a) #print(cumsum) pows = set([k**i for i in range(50)]) cum = dict({}) cum[0] = 1 res = 0 for x in cumsum[1:]: for pow in pows: if (x - pow) in cum: res += cum[x -...

0.530872

n, k = map(int,input().split()) lo = 0#Imposs hi = 10 ** 9#Poss l = list(map(int, input().split())) while hi - lo > 1: test = lo + (hi - lo)//2 odd = 0 skip = False for v in l: if skip: skip = False odd += 1 else: if v <= test: odd...

0.529368

from collections import deque def count_ways(n, k): s,d = 1,deque([0]*k) for i in range(n): d.append(s) s = 2*s-d.popleft() return s-d.pop()

0.528405

k = int(input()) room_number_list = list(map(int,input().split())) room_number_set = set(room_number_list) room_number_list_sum = sum(room_number_list) room_number_set_sum = sum(room_number_set) * k diff = room_number_set_sum - room_number_list_sum for i in room_number_set: if diff == ((k-1)*i): print(i) ...

0.528121

def solve(n,k): maxGcd = 2*n // (k * (k+1)) for gcd in range(maxGcd, 0, -1): last = n-gcd * k*(k-1)//2 if not last % gcd: return [gcd*x if x != k else last for x in range(1,k+1)] return []

0.527474

n, k = list(map(int, input().split())) t = list(map(int, input().split())) d = [0 for _ in range(n)] for _ in range(n): for i in range(n): if i % k != _ % k: d[_] += t[i] print(max(abs(d[_]) for _ in range(n)))

0.526683

#Note that it's python3 Code. Here, we are using input() instead of raw_input(). #You can check on your local machine the version of python by typing "python --version" in the terminal. (n, k) = list(map(int, input().split(' '))) ans = 0 for i in range(n): x = int(input()) if x % k == 0: ans += 1 print(ans)

0.526488

class Solution: def numOfSubarrays(self, arr: List[int], k: int, threshold: int) -> int: if len(arr) < k: return 0 bar = k * threshold total = 0 window = sum(arr[:k]) if window >= bar: total += 1 for i in range(k, len(arr)): window ...

0.525385

def solve(nums,div): return [x + x % div for x in nums]

0.523614

def array_equalization(a, k): totals, ends = {}, {} for i, n in enumerate(a): if n not in ends: totals[n], ends[n] = 0, -1 if i < ends[n]: continue count = (i - ends[n] - 1 + k - 1) // k totals[n] += count ends[n] = max(i, ends[n] + count * k) return min(t + (len(a) -...

0.523156

def f(n): Ans = [] d = 2 while d * d <= n: if n % d == 0: Ans.append(d) n //= d else: d += 1 if n > 1: Ans.append(n) return Ans n, k = list(map(int, input().split())) arr = list(map(int, input().split())) m = {} c = 0 for i in arr: r...

0.522919

for nt in range(int(input())): n,k = map(int,input().split()) if k<n: if n%2==0: if k%2: print (1) else: print (0) continue else: if k%2: print (0) else: print (1) continue print (k-n)

0.521629

def main(): import sys input = sys.stdin.readline n, k = map(int, input().split()) cnt = [0] * k for i in range(n): cnt[int(input()) - 1] += 1 dead = 0 ans = 0 for i in cnt: if i & 1: dead += 1 ans += i - 1 else: ...

0.521264

def is_centered(arr,n): l = int(len(arr)/2) if len(arr)%2==0 else int((len(arr)-1)/2) return any(sum(arr[i:-i])==n for i in range(1, l+1)) or sum(arr)==n

0.521258

class Solution: def hasGroupsSizeX(self, deck: List[int]) -> bool: def findGCD(a,b): if b ==0: return a return findGCD(b, a%b) hash_cards = {} for card in deck: if card in hash_cards: hash_cards[card]+=1 ...

0.520293

class Solution: def threeConsecutiveOdds(self, arr: List[int]) -> bool: flag = False odd = 0 i = 0 while i < len(arr): if arr[i] % 2 == 1: if not flag: flag = True odd += 1 i += 1 ...

0.519821

def is_inertial(arr): mx = max(arr, default=1) miO = min((x for x in arr if x%2==1), default=float("-inf")) miE2 = max((x for x in arr if x%2==0 and x!=mx), default=float("-inf")) return mx%2 == 0 and miE2 < miO

0.519143

(n, k) = map(int, input().split()) a = list(map(int, input().split())) a.sort() cur = 0 idx = 0 for i in range(k): ans = 0 while idx < n: ans = a[idx] - cur idx += 1 if ans != 0: break print(ans) cur += ans

0.518972

def iq_test(numbers): e = [int(i) % 2 == 0 for i in numbers.split()] return e.index(True) + 1 if e.count(True) == 1 else e.index(False) + 1

0.518963

t = int(input()) for _ in range(t): n, k = list(map(int, input().split())) l = list(map(int, input().split())) d = dict() d[0] = 0 for v in l: vv = (k - v) % k if vv: if vv not in d: d[vv] = vv + 1 else: d[vv] += k prin...

0.518055

n, k = map(int, input().split()) print(int(n % k != 0))

0.517735

import numpy as np from numba import njit i8 = np.int64 @njit def solve(a, b, t, K, N): t1 = t // K d = t % K * 2 # b が a から a + d の位置にあれば衝突する x = 0 y = 0 ans = 0 for c in a: while b[x] < c: x += 1 while b[y] <= c + d: y += 1 ...

0.517202

import sys input = sys.stdin.readline n,k=list(map(int,input().split())) if k==0: print(0) return A=sorted(map(int,input().split())) # DP[UL][n][left] # [left*pow(2,n),left*pow(2,n)+pow(2,n))の間のチームで, # ファンのチームが # UL=0: upperでもlowerでも勝ち残っている # UL=1: upperでのみ勝ち残っている # UL=2: lowerでのみ勝ち残っている # ときの、そこまでのファンのチームの試...

0.516365

b,k = map(int, input().split()) a = list(map(int, input().split())) r = 0 for x in a: r = (r*b+x) % 2 if r == 0: print('even') else: print('odd')

0.515592

#!/usr/bin/env python3 def __starting_point(): x, k = map(int, input().strip().split()) string = input().strip() if eval(string) == k: print(True) else: print(False) __starting_point()

0.514584

from collections import Counter def is_zero_balanced(arr): c = Counter(arr) return bool(arr) and all(c[k] == c[-k] for k in c)

0.512608

""" Codeforces Contest 270 Problem B Author : chaotic_iak Language: Python 3.3.4 """ def main(): n,k = read() a = [i-1 for i in read()] a.sort() a.reverse() print(sum(a[::k])*2) ################################### NON-SOLUTION STUFF BELOW def read(mode=2): # 0: String # 1: List of strin...

0.510955

def read_ints(): return [int(i) for i in input().split()] n = read_ints() a = read_ints() if len(a) % 2 and a[0] % 2 and a[-1] % 2: print('Yes') else: print('No')

0.510181

def is_onion_array(a): return all(a[i] + a[-i-1] <= 10 for i in range(len(a) // 2))

0.509389

def bel(mask, bit): return (mask & (1 << bit)) != 0 read = lambda: map(int, input().split()) n, k = read() f = [0] * 100 for i in range(n): cur = int(''.join(input().split()), 2) cur ^= (1 << k) - 1 f[cur] = 1 ans = 'NO' if k == 1: if f[1]: ans = 'YES' if k == 2: f1 = f2 = 0 for i in...

0.508918

def check(pali): for i in range(len(pali) // 2): if pali[i] != pali[-i - 1]: return False return True def __starting_point(): s = input() k = int(input()) if len(s) % k != 0: print('NO') return step = len(s) // k for i in range(k): if not chec...

0.508611

line=input().split() n=int(line[0]) k=int(line[1]) nums=input().split() for i in range(n): nums[i]=int(nums[i]) firstsum = 0 for i in range(k): firstsum+=nums[i] totsum=firstsum for i in range(n-k): firstsum-=nums[i] firstsum+=nums[k+i] totsum+=firstsum print(totsum/(n-k+1))

0.508084

import heapq def sum_sqaure(a, k): q, r = divmod(a, k) return q**2 * (k-r) + (q+1)**2 * r def diff(a, k): return sum_sqaure(a, k+1) - sum_sqaure(a, k) n, k = map(int, input().split()) nums = list(map(int, input().split())) curr = sum(sum_sqaure(a, 1) for a in nums) Q = [(diff(a, 1), a, 1) for a in nums]...

0.507963

## ## ## import sys def line(): return sys.stdin.readline() def numbers(): return list(map(int, line().split())) def number(): return int(line()) adjlist = {} n, k = 0, 0 mark = [False]*2010 edges = [False]*1010 # bfs for "ssph" def bfs(s): i = 0 frontier = [s] while frontier: ...

0.507613

t = int(input()) for _ in range(t): n = int(input()) arr = [int(j) for j in input().split()] flag = 0 for x in arr: if x%2 != arr[0]%2: flag = 1 break if flag == 1: print("NO") else: print("YES")

0.507091

# cook your dish here import sys import math def main(arr): for i in range(1,len(arr)-1): if arr[i]==arr[i-1] and arr[i]==arr[i+1]: return "Yes" return "No" test=int(input()) for _ in range(test): b=int(input()) arr=list(map(int,input().split())) print(main(arr))

0.506801

def convert_to_binary(coef): res = [] n = len(coef) carry = 0 i = 0 while i < n + 1000: if i >= n and not carry: break cur = carry if i < n: cur += coef[i] mod = cur % 2 div = cur // 2 # print(cur, div, mod) res.append(...

0.506476

t=int(input()) for i in range(0,t): n,k=map(int,input().split()) a1,*a=map(int,input().split()) a.insert(0,a1) j=0 while j<n: if a[j]%k==0: print(1,end="") else: print(0,end="") j+=1 print("")

0.504979

def is_madhav_array(arr): nTerms = ((1+8*len(arr))**.5-1)/2 return (len(arr) > 1 and not nTerms%1 and len({ sum(arr[int(i*(i+1)//2):int(i*(i+1)//2)+i+1]) for i in range(int(nTerms))}) == 1)

0.503803

def check(k, aas, bs, a_rem, b_rem): if a_rem + b_rem < k: return False a_lo = k - b_rem a_hi = a_rem rems = set() rems.add(0) for a, b in zip(aas, bs): if a + b < k: continue for i in range(max(0, k - b), min(a, k) + 1): rem = i % k f...

0.503753

IN = input rint = lambda: int(IN()) rmint = lambda: map(int, IN().split()) rlist = lambda: list(rmint()) n, k = rmint() pr = [i for i in range(-1, n - 1)] nx = [i for i in range(+1, n + 1)] ans = [0] * n p = [0] * n i = 0 for g in rlist(): p[n-(g-1)-1] = i i += 1 def dl(x, t): ans[x] = t if nx[x] < n...

0.503372

for _ in range(int(input())): n = int(input()) k = int(input()) if k%n==0: print("YES") else: print("NO")

0.502083

import sys import math def main(arr,k): x=[] y=[] for e in arr: if e%2==0: x.append(e) y.append(0) else: x.append(0) y.append(e) a=[0]*n b=[0]*n a[0]=x[0] b[0]=y[0] for i in range(1,n): if i<k: a[i]=max(x[i],a[i-1]) b[i]=max(y[i],b[i-1]) else: a[i]=max(x[i]+a[i-k-1...

0.501073

def is_even(n): return not n & 1

0.500979

import sys from math import * def minp(): return sys.stdin.readline().strip() def mint(): return int(minp()) def mints(): return list(map(int, minp().split())) n, k = mints() q = list(mints()) for i in range(n): q[i] -= 1 s = list(mints()) a = [i for i in range(1,n+1)] d = [0]*n b = [False]*(k+1) c = [False]*(k...

0.499691

def learn_charitable_game(arr): return sum(arr) % len(arr) == 0 and sum(arr) > 0

0.498574

def is_even(n): return n%2 == 0

0.498381

def check(num1, num2, p, k): v = num1 + num2 v *= num1 * num1 + num2 * num2 v %= p v += p v %= p return v == k % p def __starting_point(): n, p, k = (int(x) for x in input().split()) idx___number = [int(x) for x in input().split()] idx___precount = [((pow(x, 4, p) - k * x) % p + p...

0.497833

#!/usr/bin/env python n = int(input()) a = list(map(int, input().split())) n2 = 0 n4 = 0 for i in range(n): if a[i]%4 == 0: n4 += 1 elif a[i]%2 == 0: n2 += 1 ok = True if n2 == 0: if n4 >= n//2: ok = True else: ok = False else: n1 = n-n2-n4 n1 += 1 nn = n...

0.497825

def consecutive_sum(num): upper_limit = 1 while True: if upper_limit * (upper_limit + 1) // 2 > num: break upper_limit += 1 return sum([1 if i % 2 and not num % i else 1 if not i % 2 and num % i == i//2 else 0 for i in range(1, upper_limit)])

0.497423

def luck_check(string): e0, b1 = len(string) // 2, (len(string) + 1) // 2 return sum(map(int, string[:e0])) == sum(map(int, string[b1:]))

0.497176

""" Codeforces April Fools 2018 Problem C Author : chaotic_iak Language: Python 3.5.2 """ ################################################### SOLUTION def initialize_solution(): pass def main(): n, = read() a = read() for i in range(n-1): if abs(a[i] - a[i+1]) >= 2: return "NO" ...

0.49665

Suppose we abstract our file system by a string in the following manner: The string "dir\n\tsubdir1\n\tsubdir2\n\t\tfile.ext" represents: dir subdir1 subdir2 file.ext The directory dir contains an empty sub-directory subdir1 and a sub-directory subdir2 containing a file file.ext. The string "dir\n\...

class Solution: def lengthLongestPath(self, input): """ :type input: str :rtype: int """ dict={0:0} maxlen=0 line=input.split("\n") for i in line: name=i.lstrip('\t') print(name) print((len(name))) ...

0.728923

def find_longest(st): res,pos=0,[0] for i,b in enumerate(st,1): if b=="(": pos.append(i) else: try:pos.pop();res=max(res,i-pos[-1]) except:pos.append(i) return res

0.527565

# Enter your code here. Read input from STDIN. Print output to STDOUT xml_str="" n=int(input()) for i in range(0,n): tmp_str=input() xml_str=xml_str+tmp_str import xml.etree.ElementTree as etree tree = etree.ElementTree(etree.fromstring(xml_str)) root=tree.getroot() ar=[] def cnt_node(node): return max...

0.510905

from os.path import commonprefix def string_suffix(s): return sum(len(commonprefix([s, s[i:]])) for i in range(len(s)))

0.482501

from itertools import chain class Solution: def regionsBySlashes(self, grid): grid = self.convert_grid(grid) print(*(list(map(str, x)) for x in grid), sep='\ ') return len([self.destroy_island(x, y, grid) for y in range(len(grid)) for x,v in enumerate(grid[y]) if v == 0]) @staticmethod ...

0.472305

class Ddict: def __init__(self): self.dicts={} def add(self,key): d=self.dicts for i in key: if i not in d: d[i]={} d=d[i] d[' ']='' def find(self,key): if key=='': return '','' d=self.dicts q=[] ...

0.471586

from collections import defaultdict from itertools import chain import re PARSE = re.compile(r'[pP]\d+|q') def magic_call_depth_number(prog): def parse(it, p=''): for m in it: if m[0].startswith('p'): parse(it, m[0]) elif m[0]=='q': return else: ...

0.460022

# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right class Solution: def longestZigZag(self, root: TreeNode) -> int: if root == None: return None ...

0.456747

class Solution: def lengthOfLastWord(self, s): """ :type s: str :rtype: int """ x = s.split() return len(x[-1]) if len(x) > 0 else 0

0.4438

class Solution: def minOperations(self, logs: List[str]) -> int: t=0 for i in logs: if i=='../': t=t-1 elif i=='./': t=t else: t=t+1 if t<0: t=0 return t

0.442991

def string_constructing(a, s): if len(s) == 0: return 0 i = -1 for j, c in enumerate(s): i = a.find(c, i+1) if i < 0 or i == len(a) - 1: break return len(a) - j + (i < 0) + string_constructing(a, s[j + (i >= 0):])

0.436568

from re import findall; repeat_adjacent=lambda s: len(findall(r"((.)\2+(?!\2)){2,}",s))

0.434703

import re reg = re.compile('a*b*c*d*e*f*g*h*i*j*k*l*m*n*o*p*q*r*s*t*u*v*w*x*y*z*') def longest(s): return max(reg.findall(s), key=len)

0.432182

# cook your dish here for i in range(int(input())): s = input() m = 0 p = 0 d = 0 l = [] for i in range(len(s)): if(s[i] == "."): m = m+1 elif(s[i] == "#"): l.append(m) m=0 for i in range(len(l)): if(l[i]>p): p = l[i] d = d+1 print(d)

0.430311

def list_depth(l): depths = [1] for x in l: if isinstance(x, list): depths.append(list_depth(x) + 1) return max(depths)

0.429314

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) isdebug = False try : #raise ModuleNotFoundError import pylint import numpy def dprint(*args, **kwargs): #print(*args, **kwargs, file=sys.stderr) # in python 3.4 **kwargs is invalid??? print(*...

0.424557

s = input() res = eval(s) n = len(s) for i in range(-1, n): if i == -1 or s[i] == '*': for j in range(i + 1, n + 1): if j == n or s[j] == '*': new_s = s[0:i + 1] + "(" + s[i + 1:j] + ")" + s[j:n] res = max(res, eval(new_s)) print(res)

0.422972

s=input() dp=[[0,0,0] for i in range(len(s))] for i in range(len(s)): if s[i]=='a': dp[i][0]=dp[i-1][0]+1 dp[i][1]=dp[i-1][1] dp[i][2]=max(dp[i-1][1]+1,dp[i-1][2]+1) else: dp[i][0]=dp[i-1][0] dp[i][1]=max(dp[i-1][0]+1,dp[i-1][1]+1) dp[i][2]=dp[i-1][2] e=len(s)-1 p...

0.42285

class Solution: def maxRepOpt1(self, text: str) -> int: letters = {} for i, char in enumerate(text): if char in letters: letters[char].append(i) else: letters[char] = [i] if len(letters) == 1: return len(text) ...

0.420392

class Solution: def getMaxRepetitions(self, s1, n1, s2, n2): """ :type s1: str :type n1: int :type s2: str :type n2: int :rtype: int """ if s2=='aac' and n2==100: return 29999 i,j=0,0 l1=len(s1) l2=len(s...

0.419595

def peak_height(mountain): M = {(r, c) for r, l in enumerate(mountain) for c in range(len(l)) if l[c] == '^'} h = 0 while M: M -= {(r, c) for r, c in M if {(r, c+1), (r, c-1), (r+1, c), (r-1, c)} - M} h += 1 return h

0.416732

class Solution: def maximalSquare(self, matrix): """ :type matrix: List[List[str]] :rtype: int """ if not matrix: return 0 m, n = len(matrix), len(matrix[0]) dp = [int(matrix[i][0]) for i in range(m)] vmax = max(dp) ...

0.415761

def frequency(s,n): f=[[0 for i in range(26)]for j in range(n+1)] count=0 for i in range(n): if s[i]!="#": f[count][ord(s[i])-97]+=1 else: count+=1 for j in range(26): f[count][j]=f[count-1][j] return (f,count) def solve(s): n=...

0.414822

for _ in range(int(input())): st=input().replace("=","") if not len(st):print(1) else: cu=mx=1 for j in range(1,len(st)): if st[j]==st[j-1]:cu+=1 else:mx=max(mx,cu);cu=1 print(max(mx+1,cu+1))

0.413378

KEYBOARD = "abcde123fghij456klmno789pqrst.@0uvwxyz_/" MAP = {c: (i//8, i%8) for i,c in enumerate(KEYBOARD)} def manhattan(*pts): return sum( abs(z2-z1) for z1,z2 in zip(*pts)) def tv_remote(word): return len(word) + sum( manhattan(MAP[was], MAP[curr]) for was,curr in zip('a'+word, word))

0.412452

class Solution: def simplifyPath(self, path): """ :type path: str :rtype: str """ stack=[] path=[p for p in path.split('/') if p] for f in path: if f == '.': continue elif f == '..': if stack: stack.pop() ...

0.41233

from re import sub def encode(string): return sub(r'(.)\1*', lambda m: str(len(m.group(0))) + m.group(1),string) def decode(string): return sub(r'(\d+)(\D)', lambda m: m.group(2) * int(m.group(1)),string)

0.411974

t=input() s=input() n=len(s) h=[0]*(n+1) h[0]=0 j=0 fa=[0]*(n+1) for i in range(2,n+1) : while j and s[i-1]!=s[j]: #j=fa[j-1]; j=fa[j]; if s[i-1]==s[j]: j+=1 fa[i]=j; #print(fa) l=list() j=fa[n] while(j>0): l.append(j) j=fa[j] tmp=t t=s s=tmp n=len(s) dp=[0]*(n) m=[0]*n ...

0.410601

class Solution: def widthOfBinaryTree(self, root): """ :type root: TreeNode :rtype: int """ if not root: return 0 s=1 a=[[root,1]] while 1: b=[] for p in a: if p[0].left: ...

0.410545

3 import sys s = sys.stdin.readline().strip() k = int(sys.stdin.readline()) s += '*' * k def is_tandem(s): # print(s) n = len(s) // 2 a, b = s[:n], s[n:] for i in range(n): if a[i] == '*' or b[i] == '*': continue if a[i] != b[i]: return False return True l = 0 for i i...

0.409253

class Solution: def maximalRectangle(self, matrix): """ :type matrix: List[List[str]] :rtype: int """ if not matrix or not matrix[0]: return 0 n = len(matrix[0]) height = [0] * (n + 1) ans = 0 for row in matrix: ...

0.407729

class Solution: def longestValidParentheses(self, s: str) -> int: memo ={} n =len(s) def dp(i): if i<=0: return 0 if i in memo: return memo[i] if (s[i-1],s[i])==('(',')'): memo[i]=dp(i-2)+2 elif (...

0.407412

H, W = 6, 8 KEYBOARD = [ "abcde123fghij456klmno789pqrst.@0uvwxyz_/\u000e ", "ABCDE123FGHIJ456KLMNO789PQRST.@0UVWXYZ_/\u000e ", "^~?!'\"()-:;+&%*=<>€£$¥¤\\[]{},.@§#¿¡\u000e\u000e\u000e_/\u000e "] MAP = [ {c: (i//W, i%W) for i,c in enumerate(KEYBOARD[x])} for x in range(len(KEYBOARD)) ]...

0.406999

class Solution: def arrayNesting(self, nums): """ :type nums: List[int] :rtype: int """ best = 0 n = len(nums) p = [] for i in range(len(nums)): j = i current = 0 while nums[j] != -1: cur...

0.403668

class Solution(object): def parse(self,expression,d,i): count = 0 start = i if expression[i] == "(": count += 1 i += 1 while count != 0: if expression[i] == "(": count += 1 elif expression[i] == ")": count -= 1 i += 1 val = self.evaluate(expression[start:i],d) el...

0.403057

def largest_sum(s): return max(sum(map(int,x)) for x in s.split('0'))

0.402063

def codn1(s1,s2,p): c=0 ind=0 for i in range(len(s1)): if s1[i]!=s2[i]: c+=1 ind=i if c>1 or ind==len(s1)-1: return 0 if s1[ind]>s2[ind] and s1[ind] in s2[ind+1:]: p[0]=True if s1[ind]<s2[ind] and s2[ind] in s1[ind+1:]: p[1]=True return 1 def codn2(s1,s2): if len(s1)<len(s2): ...

0.401959

def deep_count(a): result = 0 for i in range(len(a)): if type(a[i]) is list: result += deep_count(a[i]) result += 1 return result

0.401283

class FileMaster(): def __init__(self, filepath): lk = filepath.rfind('.') ls = filepath.rfind('/') self.ext = filepath[lk+1:] self.file = filepath[ls+1:lk] self.path = filepath[:ls+1] def extension(self): return self.ext def filename(self): return sel...

0.400796

def solve(s): t = None while t != s: t, s = s, s.replace('()', '') return -1 if len(s) % 2 else sum(1 + (a == tuple(')(')) for a in zip(*[iter(s)] * 2))

0.400638

class Solution: def maxPower(self, s: str) -> int: n = len(s) count = 0 res = s[0] cur_count = 1 # Traverse string except # last character for i in range(n): # If current character # matches with next ...

0.400019

class Solution: def scoreOfParentheses(self, S: str) -> int: ans, val = 0, 1 for i in range(len(S) - 1): if S[i: i+2] == '((': val *= 2 if S[i: i+2] == '()': ans += val if S[i: i+2] == '))': val //= 2 return ans

0.397498

from sys import stdin, stdout n = int(stdin.readline()) s = stdin.readline().strip() mins = [] packs = [] for i in range(len(s)): if s[i] == '*': mins.append(i) elif s[i] == 'P': packs.append(i) l, r = -1, 2 * len(s) + 1 while r - l > 1: m = (l + r) >> 1 test1 = mins[:] test...

0.397266

class Solution: def countSubstrings(self, s): """ :type s: str :rtype: int """ ret = 0 left, right = 0, 0 while left < len(s): while right < len(s) and s[right] == s[left]: right += 1 ret += self.sum(right - l...

0.395798

class Solution: def maxScore(self, s: str) -> int: maxi=0 for i in range(1,len(s)): a=s[:i] b=s[i:] maxi=max(a.count('0')+b.count('1'),maxi) return maxi

0.395033

import math, re, itertools as it;prime = lambda n: len([i for i in range(2, int(math.sqrt(n) + 1)) if n % i == 0]) == 0;gcd = lambda a, b: gcd(b, a % b) if b else a;fact = lambda x: x * fact(x - 1) if x else 1;bino = lambda n, k: fact(n) / fact(k) / fact(n - k);fib11 = lambda n: 1 if n < 2 else fib11(n - 1) + fib11(n -...

0.393117

def longest_slide_down(p): res = p.pop() while p: tmp = p.pop() res = [tmp[i] + max(res[i],res[i+1]) for i in range(len(tmp))] return res.pop()

0.393085

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def countNodes(self, root): """ :type root: TreeNode :rtype: int """ node = root ...

0.39283

class Solution: def longestDecomposition(self, text: str) -> int: n = len(text) splits = 0 leftstart, leftend = 0, 0 rightstart, rightend = n-1, n-1 while leftend<rightstart: if text[leftstart:leftend+1] == text[rightstart:rightend+1]: leftstart = ...

0.392728

def base_finder(seq): return len(set(''.join(seq)))

0.392626

s = input() n = len(s) ind = -1 f = False for i in range(n): if s[i] == '[': f = True elif s[i] == ':': if f: ind = i break bind = -1 f = False for i in range(n-1,-1,-1): if s[i] == ']': f = True elif s[i] == ':': if f: bind = i ...

0.392057

class Solution: def numSteps(self, s: str) -> int: i, mid_zero = 0 , 0 for j in range(1, len(s)): if s[j] == '1': mid_zero += j -i - 1 i = j if i == 0: return len(s)-1 return mid_zero + 1 + len(s)

0.391166

def infected_zeroes(s): m=0; l=0 for i,n in enumerate(s): if n==0: m=i if l==0 else max(m, (i-l+1)//2); l=i+1 return max(m,len(s)-l)

0.391098

def replace_zero(arr): m, im, i, lst = 0, -1, -1, ''.join(map(str,arr)).split('0') for a,b in zip(lst,lst[1:]): i += len(a) + 1 candidate = len(a)+len(b)+1 if m <= candidate: im, m = i, candidate return im

0.390891

def sum_nested_numbers(a, depth=1): return sum(sum_nested_numbers(e, depth+1) if type(e) == list else e**depth for e in a)

0.390025

import re def timed_reading(max_length, text): return sum(len(i) <= max_length for i in re.findall('\w+', text))

0.389724

'''input 3 aa jj aa ''' def list_input(): return list(map(int,input().split())) def map_input(): return map(int,input().split()) def map_string(): return input().split() n = int(input()) d = {} pos = {} for _ in range(n): s = list(input()) s = s[::-1] for i in range(len(s)): try: d[s[i]] += 10**i...

0.389494

# cook your dish here for _ in range(int(input())): s=input() count=0 i=0 while i<len(s)-1: ch=s[i] j=i+1 while j<len(s) and s[j]==ch: j+=1 l=j-i if i!=0 and j!=len(s) and s[i-1]==s[j] : count+=1 count+=l*(l-1)//2 #print(s[i:j],count) i=j print(count)

0.389369

class Solution: def longestPalindrome(self, s): """ :type s: str :rtype: int """ re = 0 set_s = set(s) flag = False for x in set_s: if s.count(x) % 2 == 0: re += s.count(x) elif s.count(x) >= 3 : ...

0.388651

class Solution: def minDeletionSize(self, A: List[str]) -> int: dp = [(1, 1)] * len(A[0]) for i in range(len(dp)): if i > 0: max_pre = None for pre in range(i - 1, -1, -1): for word in A: if word[pre] > word[i]: ...

0.388615

class Solution: def getMaxLen(self, nums: List[int]) -> int: maxx = 0 nums.append(0) # starting position # where we find a 0 i = -1 minusarr = [] for j,n in enumerate(nums): if n == 0: # now figure out previous one...

0.388451

input() print(max(0, sum(len(s) + 1 for s in ''.join(input().split()).split('0') if s) - 1))

0.388401

# cook your dish here t=int(input()) for j in range(t): s=input() st=[] ans=0 for i in range(len(s)): if(s[i]=='>'): if(len(st)!=0 and st[-1]=='<'): st.pop() if(len(st)==0): ans=i+1 else: break ...

0.38797

# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right class Solution: def maxAncestorDiff(self, root: TreeNode) -> int: self.res = 0 def helper(node, path_max, pa...

0.387898

""" *************************************** * O(n) time complexity solution ! * *************************************** """ def longest_palindrome (s): maxPal, tmpPal = 0, 1 count_dct = {} inPal = False for i,l in enumerate(s): count_dct[l] = count_dct.get(l,0) + 1 ...

0.387678

class Solution: def lengthOfLongestSubstring(self, s): """ :type s: str :rtype: int """ L, res, last = -1, 0, {} for R, char in enumerate(s): if char in last and last[char] > L: L = last[char] elif R-L > res: ...

0.38767

def count_subsequences(needle, haystack): count = [1] + [0] * len(needle) for a in haystack: count = [1] + [count[i] + count[i-1] * (a == b) for i, b in enumerate(needle, 1)] return count[-1] % 10 ** 8

0.387664

# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right class Solution: def maxLevelSum(self, root: TreeNode) -> int: stack = [root] ans = -1000000 result =...

0.387042

class Solution: def findSubstringInWraproundString(self, p): """ :type p: str :rtype: int """ pc = None sl = 0 ll = {} for c in p: if pc and (ord(pc) + 1 == ord(c) or (pc == 'z' and c == 'a')): sl += 1 ...

0.386572

def prefix1(a, b): cnt = 0 for i, j in zip(a, b): if i == j: cnt += 1 else: return cnt return cnt def prefix2(a, b, num): for i in range(num, -1, -1): if b.startswith(a[:i]): return i def zfunc(str_): z = [] k = len(str_) for i ...

0.386067

t = [0] * 26 def get_k(c): return ord(c) - ord('a') def analyze(s): length_of_str = len(s) pos = 0 beauty_table = [0] * 26 for i in range(1, length_of_str): if s[i] != s[pos]: k = get_k(s[pos]) beauty_table[k] = max(beauty_table[k], i - pos) pos = i ...

0.385566

class Solution: def longestStrChain(self, words: List[str]) -> int: by_length = collections.defaultdict(set) for word in words: by_length[len(word)].add(word) longest = 1 seen = {*()} mx = len(by_length) mn = min(by_length) for length in sorted(b...

0.385051

import re from html.parser import HTMLParser class MyHTMLParser(HTMLParser): def handle_starttag(self, tag, attrs): print("Start".ljust(6) + ":", tag) for at in attrs: print("-> {} > {}".format(at[0], at[1])) def handle_endtag(self, tag): print("End".ljust(6) + ":", tag) ...

0.384707

class Solution: def maxLength(self, arr: List[str]) -> int: def digit_representation(s): ans = 0 for c in s: ans |= 1<<(ord(c)-ord('a')) return ans A = sorted([(len(s), digit_representation(s)) for s in set(arr) if len(set(s))==len(s)], re...

0.382653

def longest(words): return max(map(len, words))

0.381983

from collections import defaultdict def count(chessBoard): # Initialize: board = chessBoard.copy() tally = defaultdict(int) # Compute Longest square ending in bottom right corner of each element and tally up: for i, row in enumerate(board): for j, element in enumerate(row): # E...

0.381775

n = int(input()) s = input() l = 0 ans = 0 while l < len(s) and s[l] == '<': ans += 1 l += 1 r = n - 1 while r >= 0 and s[r] == '>': ans += 1 r -= 1 print(ans)

0.380849

def product(s): return s.count("?")*s.count("!")

0.38069

def main(): n = int(input()) a = [input() for i in range(n)] result = 0 for i in range(26): for j in range(i + 1, 26): t = 0 ci = chr(i + ord('a')) cj = chr(j + ord('a')) for s in a: if s.count(ci) + s.count(cj) == len(s): ...

0.380285

import re def find(stg): matches = re.findall(r"(!+|\?+)", stg) return max((f"{a}{b}" for a, b in zip(matches, matches[1:])), key=len, default="")

0.380225

import re H, W = 6, 8 KEYBOARD = "abcde123fghij456klmno789pqrst.@0uvwxyz_/* " MAP = {c: (i//W, i%W) for i,c in enumerate(KEYBOARD)} def manhattan(*pts): dxy = [abs(z2-z1) for z1,z2 in zip(*pts)] return 1 + sum( min(dz, Z-dz) for dz,Z in zip(dxy, (H,W)) ) def toggle(m): ups, end = m.groups() ...

0.379243

class Solution: def longestCommonSubsequence(self, a: str, b: str) -> int: last, current = [0] * (len(b) + 1), [0] * (len(b) + 1) for i in range(len(a) - 1, -1, -1): for j in range(len(b) - 1, -1, -1): if a[i] == b[j]: current[j] = 1 + last[j ...

0.377876

from collections import defaultdict as dd def find(a, b): n = len(a) m = len(b) dp = [[0]*(m+1) for i in range(n+1)] for i in range(n-1,-1, -1): for j in range(m-1, -1, -1): if a[i] == b[j]: dp[i][j] = dp[i+1][j+1] + 1 mx = dd(int) ans = 0 for i in range(n-1, -1, -1): for j in range(m-1, -1, -1): ...

0.377524

class Solution: def findLUSlength(self, strs): """ :type strs: List[str] :rtype: int """ def isSubseq(s1, s2): i, m=0, len(s1) for c in s2: if i==m: return True if s1[i]==c: i+=1 return i==m ...

0.377154

from collections import deque from copy import deepcopy h,w = map(int,input().split()) s = [list(input()) for i in range(h)] t = ((0,1),(1,0),(-1,0),(0,-1)) m = 0 for sy in range(h): for sx in range(w): if s[sy][sx] == "#": continue ss = deepcopy(s) ss[sy][sx] = "#" q = ...

0.376483

from itertools import groupby def main(): N = int(input()) S = input() C = [len(list(x[1])) for x in groupby(S)] M = len(C) dup_idx = [] for i, c in enumerate(C): if c > 1: dup_idx.append(i) dup_idx.reverse() curr = 0 while dup_idx: i = dup_idx[...

0.376112

import re KEYBOARD = "abcde123fghij456klmno789pqrst.@0uvwxyz_/* " MAP = {c: (i//8, i%8) for i,c in enumerate(KEYBOARD)} def manhattan(*pts): return 1 + sum( abs(z2-z1) for z1,z2 in zip(*pts)) def toggle(m): ups, end = m.group(1), m.group(2) off = '*' * bool(end) return f'*{ups.lower()}{off}{end}' ...

0.375937

from sys import stdin,stdout import math,bisect from datetime import date from collections import Counter,deque,defaultdict L=lambda:list(map(int, stdin.readline().strip().split())) M=lambda:list(map(int, stdin.readline().strip().split())) I=lambda:int(stdin.readline().strip()) S=lambda:stdin.readline().strip() C=lambd...

0.375623

from sys import stdin from collections import Counter def func(arr,n,l): count=0 k=l//n if n<len(arr): for ele in arr[0:n]: count+=max(0,k-ele) else: for ele in arr: count+=max(0,ele-k) return count for _ in range(int(stdin.readline())): s=stdin.readline().strip() d=Counter(s) arr=sorted(list(d.val...

0.374973

class Solution: def decodeString(self, s): """ :type s: str :rtype: str """ stack = [] stack.append(["", 1]) num = "" for ch in s: if ch.isdigit(): num += ch elif ch == '[': stack.appen...

0.374867

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def currentmax(self,root): leftval = 0 if root.left != None: leftval = self.currentmax(root.left) leftval = 0 if leftv...

0.374675

points = [0, 40, 100, 300, 1200] def get_score(arr) -> int: cleared = 0 score = 0 for lines in arr: level = cleared // 10 score += (level+1) * points[lines] cleared += lines return score

0.374535

# cook your dish here from sys import stdin, stdout import math # from itertools import permutations, combinations from collections import defaultdict,deque # import bisect # import heapq as hq def bfs(d,n,d1,s): high=[-1 for x in range(n+1)] q=deque([0]) high[0]=0 while q: node=q.popleft() for x in d1[int(s[n...

0.373673

def find_longest(xs): return max(xs, key=lambda x: len(str(x)))

0.373483

class Solution: def getMax(self, arr, m, n): res = 0 for e in arr: if m >= e[0] and n >= e[1]: res += 1 m -= e[0] n -= e[1] return res def findMaxForm(self, strs, m, n): """ :type strs: List[str]...

0.373481

class Solution: def findLUSlength(self, a, b): """ :type a: str :type b: str :rtype: int """ return max(len(a),len(b)) if a != b else -1

0.373383

def candies(s): if not s or len(s) == 1: return -1 return len(s) * max(s) - sum(s)

0.373194

def watch_pyramid_from_the_side(characters): if not characters : return characters baseLen = len(characters)*2-1 return '\n'.join( ' '*(i) + characters[i]*(baseLen-2*i) + ' '*(i) for i in range(len(characters)-1,-1,-1) ) def watch_pyramid_from_above(characters): if not characters : return characters ...

0.372902

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def sumNumbers(self, root): """ :type root: TreeNode :rtype: int """ def dfs(node, c...

0.372889

def maxlen(s1, s2): sm, lg = sorted((s1, s2)) return min(max(lg / 3, sm), lg / 2)

0.372714

n = int(input()) from collections import defaultdict first = defaultdict(int) second = defaultdict(int) for _ in range(n): s = input().strip() count = 0 min_count = 0 for c in s: if c == '(': count += 1 else: count -= 1 min_count = min(count, min_count) if min_count >= 0: f...

0.372291

Given a positive integer n, find the number of non-negative integers less than or equal to n, whose binary representations do NOT contain consecutive ones. Example 1: Input: 5 Output: 5 Explanation: Here are the non-negative integers Note: 1 9

class Solution: def findIntegers(self, num): """ :type num: int :rtype: int """ dp=[1,2] for i in range(2,32): dp.append(dp[i-1]+dp[i-2]) bnum=bin(num)[2:] size=len(bnum) ans=dp[size] for i in range(1,s...

0.778132

import math def count(n): if n is 0: return 0 x = int(math.log(n, 2)) return x * 2 ** (x - 1) + n - 2 ** x + 1 + count(n - 2 ** x) def countOnes(left, right): return count(right) - count(left - 1)

0.776937

def two_count(n): res = 0 while not n & 1: res += 1 n >>= 1 return res

0.710177

def fusc(n): a, b = 1, 0 for i in bin(n)[2:]: if i == '1': b += a else: a += b return b

0.690997

class Solution: def hammingWeight(self, n: int) -> int: count = 0 while n!=0: n &= (n-1) count += 1 return count

0.657516

class Solution: def countBits(self, num): """ :type num: int :rtype: List[int] """ ans = [0] while len(ans) < num + 1: ans += [1 + x for x in ans] # len(ans) > num return ans[:num+1]

0.647492

class Solution: def bulbSwitch(self, n): """ :type n: int :rtype: int """ if n == 0: return 0 else: return int(n**0.5)

0.645354

def single_digit(n): while n > 9: n = bin(n).count("1") return n

0.640179

# cook your dish here test=int(input()) for _ in range(test): n=int(input()) n=list(bin(n)) ans=n.count('1') print(ans-1)

0.639486

for t in range(int(input())): n=int(input()) print(bin(n).count("1"))

0.639391

class Solution: def minimumOneBitOperations(self, n: int) -> int: s = 0 m = n while m: s += m & 1 m >>= 1 k = 1 while s: s -= bool(n & k) n ^= (s & 1) and k k <<= 1 return n

0.639044

masks = [0] * 10 for i in range(10 ** 4): for c in str(i): masks[int(c)] |= 1 << i def find_num(n): seq, x = 1, 0 for j in range(n): M = seq for m in masks: if x & m: M |= m x = ~M & (M+1) seq |= x return x.bit_length() - 1

0.631888

#CF Round 150. Div II Prob. A - Dividing Orange import sys dp = [[[-1 for j in range(3)] for i in range (1 << 10)] for k in range(11)] In = sys.stdin n = In.readline().strip() def go (idx, mask, equal): if dp[idx][mask][equal] != -1: return dp[idx][mask][equal] if bin(mask).count("1") > 2: re...

0.631022

def friends(n): return len(str(bin(n-1)))-3 if n >1 else 0

0.629396

class Solution: def binaryGap(self, n: int) -> int: maxDist = 0 currDist = 0 while n: if n & 1 and currDist != 0: maxDist = max(maxDist, currDist) currDist = 1 elif n & 1: currDist = 1 elif not n & 1 and curr...

0.628867

class Solution: def integerReplacement(self, n): """ :type n: int :rtype: int """ ''' if n == 1: return 0 if not (n & 1): return self.integerReplacement(n//2) + 1 return min(self.integerReplacement(n+1), self.integerR...

0.628607

class Solution: def bitwiseComplement(self, N: int) -> int: return (1 << len(bin(N))-2) - N - 1

0.626892

def count_zeros_n_double_fact(n): if n % 2 != 0: return 0 k = 0 while n >= 10: k += n // 10 n //= 5 return k

0.626845

def plant_doubling(n): return bin(n).count("1")

0.622617

n = int(input()) print(2**(n+1) - 2)

0.617344

LOG = 20 def solve(s): n = len(s) res = 0 z = 0 for t in range(0, n): if s[t] == '0': z += 1 continue for l in range(1, min(LOG, n - t + 1)): x = int(s[t:t+l], 2) # print(l, t, x, l + z) if l + z >= x: res += 1 # print(t, l, x, res, z) z = 0 return res t = int(input()) while t > 0: ...

0.614423

def powers(n): return [1<<i for i, x in enumerate(reversed(bin(n))) if x == "1"]

0.613535

import sys import string from math import gcd import getpass import math from decimal import Decimal def ria(): return [int(i) for i in input().split()] if getpass.getuser() != 'frohenk': filename = 'half' # sys.stdin = open('input.txt') # sys.stdout = open('output.txt', 'w') else: sys.stdin = o...

0.608934

from math import ceil def branch(n): if n == 1: return 0 l = int(ceil(n ** 0.5)) // 2 n -= (2 * l - 1) ** 2 + 1 return n // (2*l or 1)

0.606554

from sys import stdin, stdout input = stdin.readline from collections import defaultdict as dd import math def geti(): return list(map(int, input().strip().split())) def getl(): return list(map(int, input().strip().split())) def gets(): return input() def geta(): return int(input()) def print_s(s): stdout.write...

0.60602

def hamming(n): bases = [2, 3, 5] expos = [0, 0, 0] hamms = [1] for _ in range(1, n): next_hamms = [bases[i] * hamms[expos[i]] for i in range(3)] next_hamm = min(next_hamms) hamms.append(next_hamm) for i in range(3): expos[i] += int(next_hamms[i] == next_hamm)...

0.603411

class Solution: def countDigitOne(self, n): """ :type n: int :rtype: int """ ones, m = 0, 1 while m <= n: ones += (n // m + 8) // 10 * m + (n // m % 10 == 1) * (n % m + 1) m *= 10 return ones

0.599479

from math import log2 def operation(a,b, n = 0): while log2(a) % 1: n += 1 a //= 2 return n + abs(log2(a/b))

0.595927

class Solution: def isPowerOfTwo(self, n): """ :type n: int :rtype: bool """ if n < 0: return False hasOne = False while n > 0: if n & 1: if hasOne == True: return False ...

0.595782

from collections import Counter, defaultdict import itertools import sys def main(): n = int(input()) ans = 1 for k in range(1, 10): v = ((1 << k) - 1) * (1 << (k - 1)) if n % v == 0: ans = v print(ans) main()

0.593255

score=lambda n:2**n.bit_length()-1

0.590795

M = 10 ** 9 + 7 def solve1(x): n = len(x) x = int(x, 2) ans = 0 for a in range(2 ** n): for c in range(2 ** n): b = a ^ x d = c ^ x if a < c and b > d: ans += 1 return ans % M def solve2(x): return int(x, 2) * pow(2, (len(x) - 1), M) %...

0.590431

def halving_sum(n): s=0 while n: s+=n ; n>>=1 return s

0.589063

from math import log2 def t(n): if n == 0: return 0 k = int(log2(n)) i = n - 2**k if i == 0: return (2**(2*k+1)+1) // 3 else: return t(2**k) + 2*t(i) + t(i+1) - 1 toothpick = t

0.588165

from sys import stdin as cin from sys import stdout as cout def main(): n = int(cin.readline()) o = 0 for x in range(9, 0, -1): if 10 ** x // 2 <= n: ##print(x) for i in range(9): q = 10 ** x * (i + 1) // 2 - 1 if q <= n: o...

0.587961

def gap(num): s = bin(num)[2:].strip("0") return max(map(len, s.split("1")))

0.587684

class Solution: def minOperations(self, nums: List[int]) -> int: return sum(bin(x).count('1') for x in nums)+len(bin(max(nums)))-3

0.587526

from math import ceil, log def how_many_measurements(n): return ceil(log(n, 3))

0.585418

def shortest_steps_to_num(num): steps = 0 while num != 1: if num % 2: num -= 1 else: num //= 2 steps += 1 return steps

0.582784

class Solution: def numberOfSteps (self, num: int) -> int: steps = 0 while num > 0: if num % 2 == 0: num /= 2 else: num -= 1 steps += 1 return steps

0.582765

class Solution: def grayCode(self, n): """ :type n: int :rtype: List[int] """ res = [] for i in range(1<<n): res.append(i ^ i >>1) return res

0.582309

class Solution: def baseNeg2(self, N: int) -> str: # res = [] # x = N # while x: # res.append(x & 1) # x = -(x >> 1) # return \"\".join(map(str, res[::-1] or [0])) neg = [1 << i for i in range(1, 33, 2)] for mask in neg: if...

0.581381

h = int(input()) ans = 0 n = 0 while h != 0: ans += 2**n n += 1 h = h//2 print(ans)

0.580339

def true_binary(n): return [(c == '1') * 2 - 1 for c in '1' + bin(n)[2:-1]]

0.579078

class Solution: def numSteps(self, s: str) -> int: i, mid_zero = 0 , 0 for j in range(1, len(s)): if s[j] == '1': mid_zero += j -i - 1 i = j if i == 0: return len(s)-1 return mid_zero + 1 + len(s)

0.578899

class Solution: def hasAlternatingBits(self, n): """ :type n: int :rtype: bool """ if n % 2 == 0: n = n >> 1 cnt = 0 a = n while (a>0): cnt += 1 a = a >> 1 if cnt % ...

0.578458

def power_of_two(x): return x != 0 and ((x & (x - 1)) == 0)

0.57782

print(str(oct(int(input()))).count('1'))

0.576712

# cook your dish here s=input() s1=s[::-1] arr=[] cnt=0 for i in range(len(s1)): arr.append(s1[i]) for i in range(len(arr)): if(arr[i]=="1"): for j in range(i,len(arr)): if(arr[j]=="1"): arr[j]="0" else: arr[j]="1" cnt+=1 print(cnt)

0.576239

from math import factorial MOD = 10**9+7 k = int(input()) bink = list(map(int, bin(k)[2:])) N = len(bink) # dp[i][j][k] = first i bits, j bases, # k = 1 if maxor matches k, 0 else dp = [[[0,0] for j in range(i+2)] for i in range(N+1)] dp[0][0][1] = 1 for i in range(1, N+1): for j in range(i+1): # k = 0 ...

0.57558

def faro_cycles(n): x, cnt = 2, 1 while x != 1 and n > 3: cnt += 1 x = x*2 % (n-1) return cnt

0.574255

def sum_them(n): return 2 ** (n - 1) * (2 ** n - 1)

0.573985

s = int(input(), 2) t, ans = 1, 0 while t < s: ans += 1 t *= 4 print(ans)

0.57393

def count_pal(n): # No recursion; direct calculation: return [9 * 10**((n-1) // 2), 10**(n // 2) * (13 - 9 * (-1)**n) // 2 - 2]

0.569573

from math import floor,log for _ in range(int(input())): n=int(input()) p=(n*(n+1))//2 f=floor(log(n,2)) p-=2*(2**(f+1)-1) print(p)

0.566425

class Solution: def reorderedPowerOf2(self, n: int) -> bool: n_len = len(str(n)) n = Counter(str(n)) p = 1 while len(str(p)) <= n_len: if len(str(p)) == n_len and Counter(str(p)) == n: return True p *= 2 retur...

0.5643

s=input().strip() n=len(s) i=0 k=1 j=0 while i<n: #print(i,j) j=i i+=1 while i<n and s[i]=='0': i+=1 if j>i-j: k+=1 elif j==i-j: if s[:j]>=s[j:i]: k+=1 else: k=1 else: k=1 print(k)

0.561295

class Solution: def numSub(self, s: str) -> int: # 10/6/20 dic = collections.defaultdict(int) n = len(s) left, right = 0, 0 while left < n: if s[left] == '1': right = left while right < n and s[right] == '1': ...

0.561141

def persistence(n): n = str(n) count = 0 while len(n) > 1: p = 1 for i in n: p *= int(i) n = str(p) count += 1 return count # your code

0.560498

def collatz(n): step = 1 while n!= 1: n = [n//2, (n*3)+1][n%2] step += 1 return step

0.560357

n = int(input()) if(n%2==1): print(0) else: print(2**(n//2))

0.559899

class Solution: dp = {0: 0} def racecar(self, target: int) -> int: if target in self.dp: return self.dp[target] n = target.bit_length() if 2**n - 1 == target: self.dp[target] = n else: self.dp[target] = self.racecar(2**n - 1 - target) + n + 1 ...

0.558522

def bin_str(s): return s.count("10") * 2 + (s[-1] == "1")

0.557841

t = int(input()) for _ in range(t): s = input() pref = [0]*len(s) if s[0]=="1": pref[0]+=1 for i in range(1,len(s)): if s[i]=="1": pref[i]+=1 pref[i]=pref[i]+pref[i-1] k=1 cnt=0 while (k+k*k)<=len(s): r = k+k*k i=r-1 while i<len(s): if (i-r)>=0: if pref[i]-pref[i-r]==k: cnt+=1 i+=...

0.555805

def hamming_weight(x):return bin(x).count('1')

0.55568

def hotpo(n): cnt = 0 while n != 1: n = 3 * n + 1 if n % 2 else n / 2 cnt += 1 return cnt

0.554434

class Solution: def trailingZeroes(self, n): """ :type n: int :rtype: int """ n_fives = 0 while n > 0: n = n // 5 n_fives += n return n_fives

0.553595

import sys input = sys.stdin.readline for _ in range(int(input())): n = int(input()) ans = 0 f = 0 i = n while n: ans += i // 2**f n //= 2 f += 1 print(ans)

0.553181

def consecutive_sum(num): upper_limit = 1 while True: if upper_limit * (upper_limit + 1) // 2 > num: break upper_limit += 1 return sum([1 if i % 2 and not num % i else 1 if not i % 2 and num % i == i//2 else 0 for i in range(1, upper_limit)])

0.552674

def convert_bits(a,b): return bin(a^b).count("1")

0.551501

def nth_chandos_number(n): return int((bin(n)+"0")[2:], 5)

0.551081

class Solution: def countNumbersWithUniqueDigits(self, n): """ :type n: int :rtype: int """ ls = [1,10,91] mul = 9 res = 0 for i in range(8): mul = 9 m = 9 for j in range(i+2): ...

0.547344

# https://oeis.org/A000108 from math import factorial as fac def solve(n): return fac(2*n)//fac(n)//fac(n+1)

0.546945

from collections import deque def dbl_linear(n): h = 1; cnt = 0; q2, q3 = deque([]), deque([]) while True: if (cnt >= n): return h q2.append(2 * h + 1) q3.append(3 * h + 1) h = min(q2[0], q3[0]) if h == q2[0]: h = q2.popleft() if h == q3[0]: h = q3.po...

0.545785

S, SS, SUM = [0], {0}, [0] def rec(n): while len(S)<=n: v = S[-1] - len(S) if v<= 0 or v in SS: v += 2*len(S) S.append(v) SS.add(v) SUM.append(SUM[-1]+v) return SUM[n-1]

0.542866

a = [0] cur = 1 while(cur < 10 ** 13): x = a[-1] a.append(x * 2 + cur) cur *= 2 n = int(input()) n -= 1 ans = 0 i = 1 cur = 1 while(n > 0): x = n % 2 n = n // 2 if(x > 0): ans += cur + a[i - 1] i += 1 cur *= 2 print(ans)

0.542738

def f(n): return n - m(f(n-1)) if n else 1 def m(n): return n - f(m(n-1)) if n else 0

0.54112

import sys in1 = sys.stdin.readlines() N = int(in1[0]) #N = 10 ** 18 #N = 2 """ 0 + 0 = 0 0 x 0 = 0 1 + 0 = 1 1 x 0 = 1 2 + 0 = 2 2 x 0 = 2 1 + 1 = 2 1 x 1 = 0 3 + 0 = 3 3 x 0 = 3 2 + 1 = 3 2 x 1 = 3 """ p = 10 ** 9 + 7 def f(n): if n in d: return d[n] d[n] = f(n // 2) + f((n - 1) // 2) + f((n - 2)...

0.540832

t = input() j = t[0] d, s = 0, int(j) for i in t[1: ]: if j != i: if d == 1: d, s = 0, s + 1 else: d = 1 j = i else: d = 1 print(s + (d and j == '1'))

0.53888

from math import log2 def consecutive_ducks(n): return not log2(n).is_integer()

0.538705

t= int(input()) while(t>0): n = int(input()) m=0 m=n//(2**11) n%=(2**11) while(n>0): num=n%2 m+=num n//=2 print(m) t-=1

0.538657

def find(r): return sum(2**i for i in r)

0.537472

def zeros(n): """ No factorial is going to have fewer zeros than the factorial of a smaller number. Each multiple of 5 adds a 0, so first we count how many multiples of 5 are smaller than `n` (`n // 5`). Each multiple of 25 adds two 0's, so next we add another 0 for each multiple of 25 sma...

0.536361

def f(n): return [2**i for i in range(n+1)]+[(2**(n+1))-1]

0.53591

from collections import deque def count_ways(n, k): s,d = 1,deque([0]*k) for i in range(n): d.append(s) s = 2*s-d.popleft() return s-d.pop()

0.535303

t = int(input()) def conv(n): k = bin(n) k = k[2:] z = len(k) c = '1'*z if c == k: return False def find(n): x = bin(n)[2:] str = '' for i in x[::-1]: if i == '0': str+='1' break else: str+='0' return int(str[::-1],2) for i in range(t): n = ...

0.534492

from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf,comb from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement from collections import deque,defaultdict,Counter from bisect import bisect_left,bisect_right from operator ...

0.53422

f=lambda a:(a+1)%2 n=int(input()) a=list(map(int, bin(n)[2:].zfill(4)[::-1])) a[3]=f(a[3]) if (a[3]): a[2]=f(a[2]) if a[3] and a[2]: a[1]=f(a[1]) if a[3] and a[2] and a[1]: a[0]=f(a[0]) print (int("".join(map(str, a))[::-1], 2))

0.533714

import sys def get_max_kvazi(n): s = str(n) ans = '' for c in s: if c == '0': ans = ans + '0' else: ans = ans + '1' return int(ans) fin = sys.stdin fout = sys.stdout #fin = open("input.txt", 'r') #fout = open("output.txt", 'w') n = int(fin.readline()) ans = []...

0.533617

from functools import lru_cache @lru_cache(maxsize=None) def make_sequences(n): return 1 + sum(map(make_sequences, range(1, n//2+1)))

0.533307

n, t = map(int, input().split()) s = bin(n + 2)[2:] l = len(s) if t & (t - 1): ans = 0 else: t = t.bit_length() f = [[0] * (l + 1) for i in range(l + 1)] for i in range(l + 1): f[i][0] = f[i][i] = 1 for j in range(1, i): f[i][j] = f[i - 1][j - 1] + f[i - 1][j] ans = c =...

0.532998

class Solution: def numWays(self, s: str) -> int: n = s.count('1') if n % 3 != 0: return 0 if n == 0: return (((len(s) - 1) * (len(s) - 2)) // 2) % (10**9 + 7) m = n // 3 L = s.split('1') return ((len(L[m]) + 1) * (len(L[2*m]) + 1)) % (10**9 + 7)

0.532906

from fractions import Fraction as frac def ber(): res, m = [], 0 while True: res.append(frac(1, m+1)) for j in range(m, 0, -1): res[j-1] = j*(res[j-1] - res[j]) yield res[0] m += 1 def bernoulli_number(n): if n == 1: return Fraction(-1, 2) if n % 2 == 1: retu...

0.532733

def colorful(number): base_result = [] for x in str(number): base_result.append(int(x)) for y in range(len(base_result) - 1): temp = base_result[y] * base_result[y + 1] base_result.append(temp) # Should you really eval the last value ? :shrug: If so, would use eval return len...

0.531663

def to_binary(n): return "{:0b}".format(n & 0xffffffff)

0.531595

def count_squareable(n): return n//4 + (n+1)//2

0.53127

import sys import math from collections import defaultdict from itertools import combinations from itertools import permutations input = lambda : sys.stdin.readline().rstrip() read = lambda : list(map(int, input().split())) def write(*args, sep="\n"): for i in args: sys.stdout.write("{}".format(i) + sep) INF = fl...

0.530981

class Solution: def countArrangement(self, N): """ :type N: int :rtype: int """ d = { 1:1, 2:2, 3:3, 4:8, 5:10, 6:36, 7:41, 8:132, 9:250, 10:700, 11:750, 12:4010, 13:4237, 14:10680, 15:24679 } return d.get(N, N)

0.530581

# cook your dish here for _ in range(int(input(''))): n=int(input('')) x=bin(n) x=len(x)-2 if n==(2**(x-1)): print(n) else: print(2**x)

0.530553

def circle_slash(n): return int(bin(n)[3:]+'1', 2)

0.530233

def partitions(n): c = [[1]] for x in range(1, n + 1): c.append([0]) for m in range(1, x + 1): c[x].append(c[x][m - 1] + c[x - m][min(m, x - m)]) return c[n][n]

0.530198

Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representation of s1 = "great": great / \ gr eat / \ / \ g r e at / \ a t To scramble the string, we may choose any non-leaf node...

class Solution: def isScramble(self, A, B): if len(A) != len(B) or sorted(A) != sorted(B): return False if len(A) == 1 or A == B: return True for i in range(1, len(A)): if self.isScramble(A[:i], B[:i]) and self.isScramble(A[i:], B[i:]): ...

0.804082

def scramble(s1,s2): for c in set(s2): if s1.count(c) < s2.count(c): return False return True

0.772649

from collections import Counter class Solution: def checkIfCanBreak(self, s1: str, s2: str) -> bool: d1, d2 = Counter(s1), Counter(s2) return self.check(d1, d2) or self.check(d2, d1) def check(self, d1: dict, d2: dict) -> bool: s = 0 for c in 'abcdefghijklmnopqrstuvwxyz'...

0.666139

class Solution: def isIsomorphic(self, s1, s2): return len(set(zip(s1, s2))) == len(set(s1)) == len(set(s2))

0.658374

def work_on_strings(a, b): new_a = [letter if b.lower().count(letter.lower()) % 2 == 0 else letter.swapcase() for letter in a] new_b = [letter if a.lower().count(letter.lower()) % 2 == 0 else letter.swapcase() for letter in b] return ''.join(new_a) + ''.join(new_b)

0.647264

class Solution: def isAnagram(self, s, t): """ :type s: str :type t: str :rtype: bool """ # dic = {} # for item in s: # if item not in dic: # dic[item] = 1 # else: # dic[item] += 1 # ...

0.630937

def solve(st): return all(True if ord(x) - ord(y) in [-2, 0, 2] else False for x, y in zip(st, st[::-1]))

0.628834

class Solution: def checkInclusion(self, s1, s2): """ :type s1: str :type s2: str :rtype: bool """ if len(s2) < len(s1): return False c1 = [0] * 128 n = 0 for i in s1: c = ord(i) if c1[c] == 0: n...

0.612526

def is_substitution_cipher(s1, s2): return len(set(s1)) == len(set(s2)) == len(set(zip(s1, s2)))

0.611055

def string_cnt(s): try: if s.isalpha(): return sum(ord(a) for a in s.upper()) except AttributeError: pass return 0 def compare(s1, s2): return string_cnt(s1) == string_cnt(s2)

0.601683

def are_similar(a, b): return sorted(a) == sorted(b) and sum(i != j for i, j in zip(a, b)) in [0, 2]

0.598306

class Solution: def buddyStrings(self, A: str, B: str) -> bool: if len(A)!=len(B): return False if len(A)<2: return False if A==B: cnt = Counter(A) return bool([v for v in cnt.values() if v>1]) diffs = [] for i, a in enumerate(A...

0.595997

from collections import Counter def create_anagram(s, t): return sum((Counter(s) - Counter(t)).values())

0.590596

def substring_test(first, second): first = first.lower() second = second.lower() for i in range(len(first) - 2): if first[i:i+2] in second: return True return False

0.580733

def mix(s1, s2): hist = {} for ch in "abcdefghijklmnopqrstuvwxyz": val1, val2 = s1.count(ch), s2.count(ch) if max(val1, val2) > 1: which = "1" if val1 > val2 else "2" if val2 > val1 else "=" hist[ch] = (-max(val1, val2), which + ":" + ch * max(val1, val2)) return "/"...

0.578657

class Solution: def isInterleave(self, s1, s2, s3): """ :type s1: str :type s2: str :type s3: str :rtype: bool """ if len(s3) != len(s1) + len(s2): return False if not s1 or not s2: return (s1 or s2) == s3 op...

0.578094

def is_anagram(test, original): return sorted(original.lower()) == sorted(test.lower())

0.577846

def isomorph(a, b): return [a.index(x) for x in a] == [b.index(y) for y in b]

0.577207

def same(arr_a, arr_b): return sorted(map(sorted, arr_a)) == sorted(map(sorted, arr_b))

0.572746

def same_encryption(s1, s2): return (s1[0], s1[-1], len(s1) % 9) == (s2[0], s2[-1], len(s2) % 9)

0.569054

def sc(strng): seen = set(strng) return ''.join(a for a in strng if a.swapcase() in seen)

0.564429

def scramble(string, array): return "".join(v for _, v in sorted(zip(array, string)))

0.563682

class Solution: # def canTransform(self, start, end): # """ # :type start: str # :type end: str # :rtype: bool # """ def canTransform(self, start, end): # For (i, x) and (j, y) in enumerate(start), enumerate(end) # where x != 'X' and y != 'X', ...

0.563002

def check_DNA(seq1, seq2): if len(seq1) < len(seq2): seq1, seq2 = seq2, seq1 seq2 = seq2[::-1].replace('C','g').replace('G','c').replace('T','a').replace('A','t').upper() return seq1.find(seq2) >= 0

0.560854

def letter_check(arr): return set(arr[1].lower()) <= set(arr[0].lower())

0.554913

class Solution: def canConvertString(self, s: str, t: str, k: int) -> bool: if len(s) != len(t): return False c = Counter((ord(c2) - ord(c1)) % 26 for c1, c2 in zip(s, t)) return k >= max( (m + 26 * (count - 1) for m, count in list(c.items()) if m), ...

0.554383

def mutate_my_strings(s1,s2): return '\n'.join( [s1] + [s2[:i]+s1[i:] for i,(a,b) in enumerate(zip(s1,s2),1) if a != b ]) + '\n'

0.553747

def solve(s): return any(s[i+1:] + s[:i+1] == s[i::-1] + s[:i:-1] for i in range(len(s)))

0.551105

class Solution: def numDistinct(self, s, t): """ :type s: str :type t: str :rtype: int """ setOft=set(t) news="" for ch in s: if ch in setOft: news+=ch dp=[[1 for i in range(len(news)+1)] for j in range(l...

0.549626

import re def reverse(s): return re.sub(r'(.)\1+', lambda m: m.group().swapcase(), s)

0.546558

def shorter_reverse_longer(a,b): if len(a) < len(b): a, b = b, a return b+a[::-1]+b

0.546323

import string def solve(st): return ''.join(sorted(st)) in string.ascii_letters

0.545252

class Solution: def validPalindrome(self, s): """ :type s: str :rtype: bool """ if s == s[::-1]: return True r = s[::-1] for i in range(0, len(s)): if r[i] == s[i]: continue else: ...

0.542889

def count_correct_characters(c, g): if len(c) != len(g): raise Exception('Error') return sum(1 for i,j in zip(c,g) if i==j)

0.542288

from collections import Counter def added_char(s1, s2): return next((Counter(s2) - Counter(s1)).elements())

0.541712

class MagicDictionary: def __init__(self): """ Initialize your data structure here. """ self.l = [] def buildDict(self, dict): """ Build a dictionary through a list of words :type dict: List[str] :rtype: void """ sel...

0.539574

def code_for_same_protein(seq1,seq2): if seq1 == seq2: return True lista = [['GCT','GCC','GCA','GCG'],['CGT','CGC','CGA','CGG','AGA','AGG'],['AAT','AAC'],['GAT','GAC'],['AAT','AAC','GAT','GAC'],['TGT','TGC'],['CAA','CAG'],['GAA','GAG'],['CAA','CAG','GAA','GAG'],['GGT','GGC','GGA','GGG'],['CAT','CAC'],['...

0.537017

class Solution: def backspaceCompare(self, S1, S2): i1 = len(S1) - 1 i2 = len(S2) - 1 while i1 >= 0 or i2 >= 0: c1 = '' c2 = '' if i1 >= 0: c1, i1 = self.getChar(S1, i1) if i2 >= 0: c2, i2 = self.getCha...

0.536655

class Solution: def isSubsequence(self, s, t): """ :type s: str :type t: str :rtype: bool """ if len(s) > len(t): return False for i in s: if i in t: index = t.find(i) t = t[index + 1:] ...

0.53632

class Solution: def wordPattern(self, pattern, str): """ :type pattern: str :type str: str :rtype: bool """ # d['a'] = word #pattern_arr = list(pattern) str_arr = str.split() pattern_dict = {} str_dict = {} ...

0.535929

def solved(s): if len(s)&1: s = s[:len(s)//2]+s[len(s)//2+1:] return ''.join(sorted(s))

0.53077

def alphabetic(s): return sorted(s) == list(s)

0.528848

def solve(a,b): s = set(a)&set(b) return ''.join(c for c in a+b if c not in s)

0.528633

import re def buy_newspaper(s1, s2): p = re.sub(r"(.)", r"\1?", s1) return -1 if set(s2) - set(s1) else len(re.findall(p, s2)) - 1

0.527672

def palindrome_rearranging(s): return sum(s.count(c) % 2 for c in set(s)) < 2

0.525799

from functools import lru_cache def failure(pat): i, target, n = 1, 0, len(pat) res = [0] while i < n: if pat[i] == pat[target]: target += 1 res.append(target) i+=1 elif target: target = res[target-1] else: res.append(0) ...

0.525482

I=input;a,b=I(),I();print("YNEOS"[len(a)!=len(b)or"1"in set(a)^set(b)::2])

0.523303

def are_equally_strong(your_left, your_right, friends_left, friends_right): return sorted([your_left, your_right]) == sorted([friends_left, friends_right])

0.521873

def is_palindrome(s): s = s.lower() return s == s[::-1]

0.519796

class Solution: def kSimilarity(self, A: str, B: str) -> int: a = '' b = '' for i in range(len(A)): if A[i] != B[i]: a+=A[i] b+=B[i] return self.dfs(a,b) def dfs(self,a,b): if not a: ...

0.518424

def check(w, s): j = 0 for i in range(len(s)): while j < len(w) and s[i] != w[j]: j += 1 if j >= len(w) or s[i] != w[j]: return False j += 1 return True n = int(input()) s = input() t = input() st = [] i = 0 while i < n and s[i] == t[i]: st.append(s[i]) ...

0.514819

def word_pattern(pattern, string): x = list(pattern) y = string.split(" ") return (len(x) == len(y) and len(set(x)) == len(set(y)) == len(set(zip(x, y))) )

0.514273

def sort_my_string(s): return '{} {}'.format(s[::2], s[1::2])

0.513444

class Solution: def repeatedSubstringPattern(self, s): return s in (s + s)[1:-1]

0.512133

def fat_fingers(s): if not s: return s swap = [False] return ''.join( c.swapcase() if swap[0] else c for c in s if c not in "aA" or swap.__setitem__(0, not swap[0]) )

0.511546

def comp(array1, array2): try: return sorted([i ** 2 for i in array1]) == sorted(array2) except: return False

0.511545

class Solution: def canBeEqual(self, target: List[int], arr: List[int]) -> bool: return sorted(target) == sorted(arr)

0.511472

import sys def dp(s1, s2, i, j, mem): if (i, j) in mem: return mem[(i, j)] elif i >= len(s1) and j >= len(s2): res = '' elif i >= len(s1): res = s2[j:] elif j >= len(s2): res = s1[i:] else: if s1[i] == s2[j]: res = s1[i] + dp(s1, s2, i+1, j+1, mem...

0.511057

import re def scramble_words(words): def sort_letters(match): s = match.group() letters = iter(sorted(filter(str.isalpha, s[1:-1]))) return s[0] + "".join(next(letters) if c.isalpha() else c for c in s[1:-1]) + s[-1] return re.sub(r'[a-z][^\s]*[a-z]', sort_letters, words)

0.510585

def lcs(x, y): if len(x) == 0 or len(y) == 0: return '' if x[-1] == y[-1]: return lcs(x[:-1], y[:-1]) + x[-1] else: lcs1 = lcs(x,y[:-1]) lcs2 = lcs(x[:-1],y) if len(lcs1) > len(lcs2): return lcs1 else: return lcs2

0.51024

import sys def joseph(k, n=6): if k==0: k = 1 x = 0 for i in range(2,n+1): x = (x+k)%i return x FLAMES = ['FRIENDS', 'LOVE', 'ADORE', 'MARRIAGE', 'ENEMIES', 'SISTER'] nCase = int(sys.stdin.readline()) for _ in range(nCase): a = ''.join(sys.stdin.readline().split()) b = ''.join(sys.stdin.readline().split())...

0.509684

from collections import defaultdict as dd def find(a, b): n = len(a) m = len(b) dp = [[0]*(m+1) for i in range(n+1)] for i in range(n-1,-1, -1): for j in range(m-1, -1, -1): if a[i] == b[j]: dp[i][j] = dp[i+1][j+1] + 1 mx = dd(int) ans = 0 for i in range(n-1, -1, -1): for j in range(m-1, -1, -1): ...

0.508872

class Solution: def findLength(self, A, B): def check(length): seen = {A[i:i+length] for i in range(len(A) - length + 1)} return any(B[j:j+length] in seen for j in range(len(B) - length + 1)) A = ''.join(map(chr, A)) ...

0.508855

class Solution: def isLongPressedName(self, name: str, typed: str) -> bool: name=list(name) typed= list(typed) while name: i, j=0,0 n=name[0] while name and name[0]==n: i+=1 name.pop(0) while typed and t...

0.508585

def swap(st): tr = str.maketrans('aeiou', 'AEIOU') return st.translate(tr);

0.508366

import itertools def transpose_two_strings(arr): return '\n'.join( ' '.join(elt) for elt in itertools.zip_longest(arr[0],arr[1],fillvalue=' ') )

0.508272

def spoonerize(words): a, b = words.split() return '{}{} {}{}'.format(b[0], a[1:], a[0], b[1:])

0.5055

class Solution: def minimumSwap(self, s1: str, s2: str) -> int: xy_pair = 0 yx_pair = 0 for c1, c2 in zip(s1, s2): if c1 == 'x' and c2 == 'y': xy_pair += 1 elif c1 == 'y' and c2 == 'x': yx_pair += 1 if (xy_pair...

0.504699

from itertools import combinations def strings_crossover(arr, result): return sum(1 for s1,s2 in combinations(arr,2) if all(r in (x,y) for x,y,r in zip(s1,s2,result)))

0.504402

from time import time opposite = { 'N': 'S', 'S': 'N', 'E': 'W', 'W': 'E' } otr = str.maketrans(opposite) bits = { 'N': 0, 'S': 1, 'E': 2, 'W': 3, } Q = 4294967291 def combine(h, v, q): return (h<<2 | v) % q def combinel(h, v, q, s): return (v*s + h) % q def flip(s): ...

0.502025

def could_be(original, another): if not another.strip(): return False return all(name in original.split() for name in another.split())

0.500499

s, t = input(), input() sx, tx = str(sorted(s)), str(sorted(t)) def subset(s, t): i = 0 for c in s: if c == t[i]: i += 1 if i == len(t): break return i == len(t) if sx == tx: print("array") elif subset(s, t): print("automaton") elif subset(sx, tx): print("both") else: print...

0.500391

def switcheroo(s): return s.translate(str.maketrans('ab','ba'))

0.499878

class Solution: def smallestStringWithSwaps(self, s: str, pairs: List[List[int]]) -> str: pr=[i for i in range(len(s))] def union(x,y): p1=find(x) p2=find(y) if p1!=p2: pr[p1]=p2 def find(x): while pr[x]!=x: pr[x...

0.499671

def palindrome_pairs(w): return [[i, j] for i in range(len(w)) for j in range(len(w)) if str(w[i])+str(w[j])==(str(w[i])+str(w[j]))[::-1] and i!=j]

0.499614

def solve(s,a,b): return s[:a]+s[a:b+1][::-1]+s[b+1:]

0.499218

def is_palindrome(string): return str(string)[::-1] == str(string)

0.499031

def swap(string_): return string_.swapcase()

0.498349

def jumbled_string(s, n): iterations = [s] while True: s = s[::2] + s[1::2] if s == iterations[0]: break iterations.append(s) return iterations[n % len(iterations)]

0.497924

def main(): a = list(input()) b = list(input()) n = len(a) k = n while k % 2 == 0: k = k // 2 while k != n: pairs = n // (k * 2) for i in range(0, pairs * 2, 2): if a[k * i:k * (i + 1)] > a[k * (i + 1):k * (i + 2)]: a[k * i:k * (i + 1)], a[k ...

0.497922

def diffs(bird1, bird2): return sum(c1 != c2 for c1, c2 in zip(bird1, bird2)) def child(bird1, bird2): return diffs(bird1, bird2) in [1, 2] def grandchild(bird1, bird2): return diffs(bird1, bird2) in [0, 1, 2, 3, 4] if len(bird1) > 1 else bird1 == bird2

0.497882

def prefix1(a, b): cnt = 0 for i, j in zip(a, b): if i == j: cnt += 1 else: return cnt return cnt def prefix2(a, b, num): for i in range(num, -1, -1): if b.startswith(a[:i]): return i def zfunc(str_): z = [] k = len(str_) for i ...

0.497636

class Solution: def canConstruct(self, ransomNote, magazine): """ :type ransomNote: str :type magazine: str :rtype: bool """ ransome = set(ransomNote) for i in ransome: if ransomNote.count(i) > magazine.count(i): return Fa...

0.495408

import re def double_check(str): return bool(re.search(r"(.)\1", str.lower()))

0.494444

def interweave(s1, s2): s = [''] * (len(s1) + len(s2)) s[::2], s[1::2] = s1, s2 return ''.join(c for c in s if not c.isdigit()).strip()

0.492264

def permute_a_palindrome (input): return sum( input.count(c)%2 for c in set(input) ) < 2

0.49217

from itertools import cycle def swap(s,n): b = cycle(bin(n)[2:]) return "".join(c.swapcase() if c.isalpha() and next(b) == '1' else c for c in s)

0.491226

class Solution: def isAlienSorted(self, words: List[str], order: str) -> bool: char_map = {char: i for i, char in enumerate(order)} for j in range(1, len(words)): prev, curr = words[j - 1], words[j] k = 0 while k < min(len(prev), len(curr)): if pr...

0.490217

def esrever(s): return s[:-1][::-1] + s[-1] if s else ''

0.487959

def greek_comparator(lhs, rhs): greek_alphabet = [ 'alpha', 'beta', 'gamma', 'delta', 'epsilon', 'zeta', 'eta', 'theta', 'iota', 'kappa', 'lambda', 'mu', 'nu', 'xi', 'omicron', 'pi', 'rho', 'sigma', 'tau', 'upsilon', 'phi', 'chi', 'psi', 'omega'] l = len(greek_alphabet) k = 0...

0.487775

def solve(a,b): return [a.count(e) for e in b]

0.487672

import re import unicodedata NAME = re.compile("[\w-]+") def decompose(name): standarized = unicodedata.normalize('NFKD', name.lower()) \ .encode('ascii', 'ignore') if type(name) != str \ else name.lower() return re.findall(NAME, standarized) def could_be(original, another): if not anothe...

0.487197

def string_hash(s): a = sum(ord(c) for c in s) b = sum(ord(b) - ord(a) for a, b in zip(s, s[1:])) c = (a | b) & (~a << 2) return c ^ (32 * (s.count(" ") + 1))

0.487064

from fnmatch import fnmatch def solve(a, b): return fnmatch(b, a)

0.486661

def similarity(a, b): try: return len(set(a) & set(b)) / len(set(a) | set(b)) except: return 0

0.486488

class Solution: def findTheDifference(self, s, t): """ :type s: str :type t: str :rtype: str """ sums=sum([ord(i) for i in s]), sum([ord(i) for i in t]) return chr(sum([ord(i) for i in t])-sum([ord(i) for i in s]))

0.485988

class Solution: def minSteps(self, s: str, t: str) -> int: s_count=[s.count(chr(i)) for i in range(97,123)] t_count=[t.count(chr(i)) for i in range(97,123)] diff=[t_count[i]-s_count[i] for i in range(26) if t_count[i]-s_count[i]>0] sum=0 for i in range(len(diff)): ...

0.484543

def spot_diff(s1, s2): return [i for i in range(len(s1)) if s1[i] != s2[i]]

0.484064

def grabscrab(said, possible_words): return [ word for word in possible_words if sorted(word) == sorted(said) ]

0.482856

def xor(a,b): return a != b

0.482815

def add(s1, s2): return sum(ord(x) for x in s1+s2)

0.482565

Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). Example: Input: S = "ADOBECODEBANC", T = "ABC" Output: "BANC" Note: If there is no such window in S that covers all characters in T, return the empty string "". If there is s...

class Solution: def minWindow(self, s, t): """ :type s: str :type t: str :rtype: str """ left=-1 right = 0 result = "" totalMatch = 0 d = {} for c in t: d[c] = d.get(c, 0) + 1 for right in ran...

0.811712

class Solution: def numDistinct(self, s, t): """ :type s: str :type t: str :rtype: int """ setOft=set(t) news="" for ch in s: if ch in setOft: news+=ch dp=[[1 for i in range(len(news)+1)] for j in range(l...

0.632404

def string_constructing(a, s): if len(s) == 0: return 0 i = -1 for j, c in enumerate(s): i = a.find(c, i+1) if i < 0 or i == len(a) - 1: break return len(a) - j + (i < 0) + string_constructing(a, s[j + (i >= 0):])

0.613104

class Solution: def findLength(self, A, B): def check(length): seen = {A[i:i+length] for i in range(len(A) - length + 1)} return any(B[j:j+length] in seen for j in range(len(B) - length + 1)) A = ''.join(map(chr, A)) ...

0.611201

class Solution: def isSubsequence(self, s, t): """ :type s: str :type t: str :rtype: bool """ if len(s) > len(t): return False for i in s: if i in t: index = t.find(i) t = t[index + 1:] ...

0.607294

import sys def dp(s1, s2, i, j, mem): if (i, j) in mem: return mem[(i, j)] elif i >= len(s1) and j >= len(s2): res = '' elif i >= len(s1): res = s2[j:] elif j >= len(s2): res = s1[i:] else: if s1[i] == s2[j]: res = s1[i] + dp(s1, s2, i+1, j+1, mem...

0.606446

def prefix1(a, b): cnt = 0 for i, j in zip(a, b): if i == j: cnt += 1 else: return cnt return cnt def prefix2(a, b, num): for i in range(num, -1, -1): if b.startswith(a[:i]): return i def zfunc(str_): z = [] k = len(str_) for i ...

0.597252

class Solution: def minSteps(self, s: str, t: str) -> int: s_count=[s.count(chr(i)) for i in range(97,123)] t_count=[t.count(chr(i)) for i in range(97,123)] diff=[t_count[i]-s_count[i] for i in range(26) if t_count[i]-s_count[i]>0] sum=0 for i in range(len(diff)): ...

0.58014

def shortest_to_char(s, c): if not s or not c: return [] indexes = [i for i, ch in enumerate(s) if ch == c] if not indexes: return [] return [ min(abs(i - ic) for ic in indexes) for i in range(len(s)) ]

0.576859

class Solution: def equalSubstring(self, s: str, t: str, maxCost: int) -> int: dist = [ abs( ord(s[i]) - ord(t[i]) ) for i in range(len(s))] # i = 0 # cur = 0 # res = 0 # for j in range(len(s)): # cur += dist[j] # while cur>maxCost: # ...

0.575886

class Solution: def removeDuplicateLetters(self, s): """ :type s: str :rtype: str """ rindex = {c: i for i, c in enumerate(s)} result = '' for i, c in enumerate(s): if c not in result: while c < result[-1:] and i < rindex[...

0.573578

class Solution: def gcdOfStrings(self, str1: str, str2: str) -> str: contender = '' for i in str1: contender += i if str1.count(contender) * len(contender) == len(str1) and str2.count(contender) * len(contender) == len(str2): break orig = contender ...

0.572583

class Solution: def longestDupSubstring(self, S): nums, N = [ord(c) - ord('a') for c in S], len(S) BASE, MOD = 26, 2**32 def check(L): cur_hash, seen = 0, set() for val in nums[:L]: cur_hash = (cur_hash * BASE + val) % MOD seen.add(cur_hash...

0.571036

class Solution: def shortestSuperstring(self, A: List[str]) -> str: A = [a for i, a in enumerate(A) if all(a not in b for j, b in enumerate(A) if i != j)] def memo(f): dic = {} def f_alt(*args): if args not in dic: dic[args] = f(*args) ...

0.570997

from collections import Counter from functools import reduce from fractions import gcd def has_subpattern(s): c = Counter(s) m = reduce(gcd, c.values()) return ''.join(sorted(k*(v//m) for k,v in c.items()))

0.570651

def solve(st): return sorted((st.find(c) - st.rfind(c), c) for c in set(st))[0][1]

0.566699

class Solution: def repeatedStringMatch(self, A, B): """ :type A: str :type B: str :rtype: int """ if not set(B).issubset(set(A)): return -1 max_rep = len(B) // len(A) + 3 A_new = A for i in ...

0.566177

class Solution: def lengthOfLongestSubstring(self, s): """ :type s: str :rtype: int """ L, res, last = -1, 0, {} for R, char in enumerate(s): if char in last and last[char] > L: L = last[char] elif R-L > res: ...

0.564782

class Solution(object): def findSubstring(self, s, words): """ :type s: str :type words: List[str] :rtype: List[int] """ if not s or words==[]: return [] lenstr=len(s) lenword=len(words[0]) lensubstr=len(words)*lenword ...

0.562696

def levenshtein(a,b): d = [[0] * (len(b) + 1) for _ in range(len(a) + 1)] d[0][:] = list(range(len(b)+1)) for i in range(1, len(a) + 1): d[i][0] = i for i, x in enumerate(a): for j, y in enumerate(b): d[i+1][j+1] = min(1 + d[i][j+1], 1 + d[i+1][j], d[i][j] + (1 if x != y el...

0.562174

def lcs(x, y): if len(x) == 0 or len(y) == 0: return '' if x[-1] == y[-1]: return lcs(x[:-1], y[:-1]) + x[-1] else: lcs1 = lcs(x,y[:-1]) lcs2 = lcs(x[:-1],y) if len(lcs1) > len(lcs2): return lcs1 else: return lcs2

0.561798

from collections import Counter def create_anagram(s, t): return sum((Counter(s) - Counter(t)).values())

0.561465

def check(w, s): j = 0 for i in range(len(s)): while j < len(w) and s[i] != w[j]: j += 1 if j >= len(w) or s[i] != w[j]: return False j += 1 return True n = int(input()) s = input() t = input() st = [] i = 0 while i < n and s[i] == t[i]: st.append(s[i]) ...

0.560176

def substring(s): r, rm = [], [] for i, x in enumerate(s): if x in r or len(set(r)) < 2: r += x; else: if len(r) > len(rm): rm = r[:] r = [y for y in r[-1::-1] if y == r[-1]] + [x] if len(r) > len(rm): rm = r[:] return ''.join(rm)

0.559978

class Solution: def checkInclusion(self, s1, s2): """ :type s1: str :type s2: str :rtype: bool """ if len(s2) < len(s1): return False c1 = [0] * 128 n = 0 for i in s1: c = ord(i) if c1[c] == 0: n...

0.558013

from collections import * def go(): n,s,t=int(input()),input(),input() if Counter(s)!=Counter(t): return -1 ans=0 for i in range(n): k=0 for j in range(i,n): while k<n and s[k] != t[j]: k += 1 if k == n: break k += 1 ans = max(ans, j-i+1) return n-ans for _ in range(int(input())): print(go())

0.555391

import re def buy_newspaper(s1, s2): p = re.sub(r"(.)", r"\1?", s1) return -1 if set(s2) - set(s1) else len(re.findall(p, s2)) - 1

0.555331

class Solution: def findTheDifference(self, s, t): """ :type s: str :type t: str :rtype: str """ sums=sum([ord(i) for i in s]), sum([ord(i) for i in t]) return chr(sum([ord(i) for i in t])-sum([ord(i) for i in s]))

0.555298

import sys import math import bisect import heapq import collections S = input() T = input() lenS = len(S) lenT = len(T) F1 = [False]*26 F2 = [False]*26 alpha = 'abcdefghijklmnopqrstuvwxyz' for i in range(lenS): F1[alpha.index(S[i])] = True for i in range(lenT): F2[alpha.index(T[i])] = True for i in range(26):...

0.553291

class Solution: def longestCommonSubsequence(self, a: str, b: str) -> int: last, current = [0] * (len(b) + 1), [0] * (len(b) + 1) for i in range(len(a) - 1, -1, -1): for j in range(len(b) - 1, -1, -1): if a[i] == b[j]: current[j] = 1 + last[j ...

0.552684

def solve(a, b): if len(a) is 1: return b.count(a) index = [x for x in range(len(b)-1) if b[x] is a[0]] return sum(solve(a[1:], b[x+1:]) for x in index)

0.552527

def find_short(s): return min(len(x) for x in s.split())

0.551801

t = eval(input()) for _ in range(t): n = eval(input()) a = input().strip().split() cb, cs = 0, "" for i in range(len(a[0])): for j in range(i+1,len(a[0])+1): al = True s = a[0][i:j] for k in a[1:]: if s not in k: al = False break if al: if j-i>=cb: cb = max(cb, j-i) if len(...

0.551764

class Solution: def longestSubstring(self, s, k): """ :type s: str :type k: int :rtype: int """ for c in set(s): if s.count(c) < k: return max(self.longestSubstring(sp, k) for sp in s.split(c)) return len(s)

0.55106

def solve(a,b): s = set(a)&set(b) return ''.join(c for c in a+b if c not in s)

0.54999

def solve(st,k): for l in sorted(st)[:k]: st=st.replace(l,'',1) return st

0.546449

def main(): import sys n, t, s1, s2 = sys.stdin.read().split() n, t = int(n), int(t) result = [-1] * n rest = n - t for i in range(n): if rest == 0: break if s1[i] == s2[i]: result[i] = s1[i] rest -= 1 k = rest for i in range(n): ...

0.5463

class Solution: def strStr(self, haystack, needle): """ :type haystack: str :type needle: str :rtype: int """ if haystack == "" and needle == "": return 0 if needle == "": return 0 if haystack == "" or needle == "" or...

0.542543

class Solution: def findMinStep(self, board, hand): """ :type board: str :type hand: str :rtype: int """ res=float("inf") hmap=collections.defaultdict(int) for c in hand: hmap[c]+=1 res=self.helper(board,hmap) if...

0.537696

''' \"aabcaca\" 0123456 x devide conquer 先找到第一个stamp把string分成左右两部分（必须要）（On 然后从长到短用stamp的头match左边的部分，直到match到最头如果不能到最头则退出从长到短用stamp的尾巴match右边，直到match到尾巴，如果不能match到最尾巴则继续找下一个stamp 能把他分成左右这时的左边有个offset了，比如****b** offset是3，只要stamp的长度不超过头且能match上，就可以这个解法可以有nwin*M^2 其中m平方是在用stamp去match的时候最坏能从stamp最长match到1 可以给出最短...

0.537679

# import sys # sys.stdin = open('in.txt', 'r') _ = input() s = input() t = input() par = [i for i in range(26)] def find(x): if par[x] != x: par[x] = find(par[x]) return par[x] else: return x for i in range(len(s)): a, b = find(ord(s[i])-97), find(ord(t[i])-97) if a != b: ...

0.536758

from collections import Counter from string import ascii_lowercase def missing_alphabets(s): c = Counter(s) m = max(c.values()) return ''.join(letter * (m - c[letter]) for letter in ascii_lowercase)

0.536733

# coding=utf-8 from functools import reduce a = input() b = input() c = input() alen = len(a) blen = len(b) clen = len(c) kmpnext = [0]*(clen+1) i = 1 j = 0 while i < clen: while j > 0 and c[i]!=c[j]: j = kmpnext[j] if c[i] == c[j]: j+=1 kmpnext[i+1] = j i+=1 #print(kmpnext) f = [[[0 for i in range(clen+2)]...

0.53609

import sys from math import * def minp(): return sys.stdin.readline().strip() def mint(): return int(minp()) def mints(): return map(int, minp().split()) def add(a,b): return (a+b)%1000000007 def sub(a,b): return (a+1000000007-b)%1000000007 def mul(a,b): return (a*b)%1000000007 p = 102367 s = list(map(int,...

0.536075

class Solution: def kSimilarity(self, A: str, B: str) -> int: a = '' b = '' for i in range(len(A)): if A[i] != B[i]: a+=A[i] b+=B[i] return self.dfs(a,b) def dfs(self,a,b): if not a: ...

0.535413

class Solution: def minDeletionSize(self, A: List[str]) -> int: dp = [(1, 1)] * len(A[0]) for i in range(len(dp)): if i > 0: max_pre = None for pre in range(i - 1, -1, -1): for word in A: if word[pre] > word[i]: ...

0.531309

s = input() t = input() m = 1000 for i in range(len(s) - len(t) + 1): c = 0 for j in range(len(t)): if s[i + j] != t[j]: c += 1 m = min(m, c) print(m)

0.531165

def shifted_diff(first, second): return (second + second).find(first) if len(first) == len(second) else - 1;

0.530954

class Solution: def characterReplacement(self, s, k): """ :type s: str :type k: int :rtype: int """ if s == "": return 0 count = {} lo = 0 hi = 0 max_letter = 0 for hi in range(len(s)): try:...

0.530781

import re import itertools from collections import Counter class Task: strings = [] answer = "" def getData(self): numberOfStrings = int(input()) for i in range(0, numberOfStrings): self.strings += [input()] def solve(self): badStrings = set() for current...

0.52986

T = int(input()) def call_me(N,A,X): max = 0 ans = '' for i in A: if i.count(X) > max: max = i.count(X) ans = i return ans for i in range(T): N = int(input()) A = list(map(str,input().split())) X = input() print(call_me(N,A,X))

0.529127

class MagicDictionary: def __init__(self): """ Initialize your data structure here. """ self.l = [] def buildDict(self, dict): """ Build a dictionary through a list of words :type dict: List[str] :rtype: void """ sel...

0.528748

class Solution: def isAnagram(self, s, t): """ :type s: str :type t: str :rtype: bool """ # dic = {} # for item in s: # if item not in dic: # dic[item] = 1 # else: # dic[item] += 1 # ...

0.527086

class Solution: def minCost(self, s: str, cost: List[int]) -> int: delete_cost = 0 last = 0 for i in range(1, len(s)): if s[last] == s[i]: if cost[last] < cost[i]: delete_cost += cost[last] last = i else: ...

0.526406

S = input() T = input() base = 998244353 dp = [[0 for _ in range(len(S) + 1)] for _ in range(len(S) + 1)] for j in range(1, len(S) + 1): if (j > len(T)) or (S[0] == T[j - 1]): dp[1][j] = 2 for i in range(2, len(S) + 1): for j in range(1, len(S) - i + 1 + 1): if (j > len(T)) or (S[i - 1] == T[j -...

0.525355

import sys input = sys.stdin.readline s = input() t = input() l, r = [0]*len(t), [0]*len(t) li, ri = 0, len(s) - 1 for i in range(len(t)): while s[ li ] != t[ i ]: li += 1 while s[ ri ] != t[ - i - 1 ]: ri -= 1 l[ i ] = li r[ -i -1 ] = ri li += 1 ri -= 1 print( max( [ r[ 0 ], le...

0.525065

class Solution: def longestPrefix(self, strn: str) -> str: max_prefs = [0]*len(strn) curr = 0 for idx in range(1, len(strn)): while True: if curr == 0: if strn[idx] == strn[0]: curr = 1 max_prefs[idx...

0.524764

from collections import Counter class Solution: def reorganizeString(self, S): """ :type S: str :rtype: str """ if len(S) <= 1: return S chars = [char for char, count in Counter(S).most_common() for _ in range(count)] h = math.ceil(...

0.524218

class Solution: def firstUniqChar(self, s): """ :type s: str :rtype: int """ if not s: return -1 elif len(s) == 1: return 0 result = len(s) for ch in range(ord('a'), ord('z') + 1): if s.find(chr(ch)) ==...

0.523775

def longest(a1, a2): return "".join(sorted(set(a1 + a2)))

0.523348

# Enter your code here. Read input from STDIN. Print output to STDOUT s=input() ss=input() cnt=0 len_s=len(s) len_ss=len(ss) for i in range(0,len_s): tmp=s[i:i+len_ss] if(tmp==ss): cnt=cnt+1 print(cnt)

0.522918

from sys import stdin,stdout # stdout = open('output.txt', 'w+') # stdin = open('input.txt','r+') from collections import Counter def prefixsuffixmatch(s): pi_table=[0 for i in range(len(s))] for i in range(1,len(s)): y=pi_table[i-1] while s[i]!=s[y] and y!=0: y=pi_table[y-1] if s[i]==s[y]: y+=1 pi_ta...

0.521352

import sys input = sys.stdin.readline sys.setrecursionlimit(10 ** 7) import numpy as np # 適当な素数と原始根でrolling hash MOD = 10 ** 9 + 993 base = 123450 S = np.array([ord(x) for x in input().rstrip()],dtype=np.int64) T = np.array([ord(x) for x in input().rstrip()],dtype=np.int64) # Sの方が長くする LS = len(S) LT = len(T) n = (L...

0.521336

def shift_left(a, b): r = len(a) + len(b) for i in range(-1, -min(len(a), len(b)) - 1, -1): if a[i] != b[i]: break r -= 2 return r

0.521088

class Solution: def getHint(self, secret, guess): """ :type secret: str :type guess: str :rtype: str """ s_count = collections.defaultdict(int) g_count = collections.defaultdict(int) bull_cnt = 0 # first iteration can get bull_cnt imm...

0.520638

import sys def input(): return sys.stdin.readline()[:-1] from bisect import bisect def ctoi(c): return ord(c) - ord("a") print(ans) T = int(input()) for _ in range(T): s = input() t = input() if not (set(s) >= set(t)): print(-1) else: alph = [[] for _ in range(26)] for i in range(len(s)): alph[ctoi(s[...

0.520236

class Solution: def longestCommonPrefix(self, strs): """ :type strs: List[str] :rtype: str """ strs = strs import os return os.path.commonprefix(strs) # for x in strs: # if prefix in x: # print x ...

0.519855

def find_missing_letter(chars): n = 0 while ord(chars[n]) == ord(chars[n+1]) - 1: n += 1 return chr(1+ord(chars[n]))

0.517612

t=input() s=input() n=len(s) h=[0]*(n+1) h[0]=0 j=0 fa=[0]*(n+1) for i in range(2,n+1) : while j and s[i-1]!=s[j]: #j=fa[j-1]; j=fa[j]; if s[i-1]==s[j]: j+=1 fa[i]=j; #print(fa) l=list() j=fa[n] while(j>0): l.append(j) j=fa[j] tmp=t t=s s=tmp n=len(s) dp=[0]*(n) m=[0]*n ...

0.517313

def trouble(x, t): arr = [x[0]] for c in x[1:]: if c + arr[-1] != t: arr.append(c) return arr

0.517062

def count_subsequences(needle, haystack): count = [1] + [0] * len(needle) for a in haystack: count = [1] + [count[i] + count[i-1] * (a == b) for i, b in enumerate(needle, 1)] return count[-1] % 10 ** 8

0.516297

from collections import Counter def only_duplicates(string): cs = Counter(string) return ''.join(c for c in string if cs[c] > 1)

0.51613

def solve(s,t): hash_s = [False] * 256 hash_t = [False] * 256 arr = [] n = len(s) for c in s: hash_s[ord(c)] = True for c in t: hash_t[ord(c)] = True for i in range(256): if not hash_s[i] and hash_t[i]: print(-1) return rev = s[::-1] i,...

0.515952

from string import ascii_lowercase class Solution: def removeDuplicates(self, S: str) -> str: dup = {2*ch for ch in ascii_lowercase} prev_length = -1 while prev_length!=len(S): prev_length = len(S) for d in dup: S = S.replace...

0.514916

class Solution: def countSubstrings(self, s): """ :type s: str :rtype: int """ ret = 0 left, right = 0, 0 while left < len(s): while right < len(s) and s[right] == s[left]: right += 1 ret += self.sum(right - l...

0.513891

from collections import Counter from functools import reduce from math import gcd def has_subpattern(string): return reduce(gcd, Counter(string).values()) != 1

0.513182

def solve(st): return next((n for n in range(len(st)//2, 0, -1) if st[:n] == st[-n:]), 0)

0.512027

n, m = map(int, input().split()) mi = 100000000000000 ts = "" def num_d(a, b): t = 0 for x in range(len(a)): if a[x] != b[x]: t += 1 return t s, t = input(), input() for x in range(m-n+1): d = num_d(s, t[x:x+n]) if d < mi: mi = d ts = t[x:x+n] print(mi) for x in range(n): if s[x] != ts[x]:...

0.511124

from collections import Counter def added_char(s1, s2): return next((Counter(s2) - Counter(s1)).elements())

0.510979

class Solution: def findSubstringInWraproundString(self, p): """ :type p: str :rtype: int """ pc = None sl = 0 ll = {} for c in p: if pc and (ord(pc) + 1 == ord(c) or (pc == 'z' and c == 'a')): sl += 1 ...

0.510558

class Solution: def shortestPalindrome(self, s): if len(s)<2: return s if len(s)==40002: return s[20000:][::-1]+s for i in range(len(s)-1,-1,-1): if s[i]==s[0]: j=0 while j<(i+1)//2 and s[i-j]==s[j]: ...

0.509791

class Solution: def getMaxRepetitions(self, s1, n1, s2, n2): """ :type s1: str :type n1: int :type s2: str :type n2: int :rtype: int """ if s2=='aac' and n2==100: return 29999 i,j=0,0 l1=len(s1) l2=len(s...

0.509234

class Solution: def lastSubstring(self, s: str) -> str: #mx = \"\" #for i in range(len(s)): # mx = max(mx,s[i:]) #return mx index = {c: i for i, c in enumerate(sorted(set(s)))} cur, radix, max_val, max_i = 0, len(index), 0, 0 for i in range(len(s)-1, -1, -1...

0.507185

from collections import Counter def solve(A,B): a = Counter(A) b = Counter(B) ans = 0 for i in a: if i in b: ans += min(a[i],b[i]) return ans t = int(input()) for _ in range(t): A = input() B = input() print(solve(A,B))

0.506899

class Solution: def findLongestWord(self, s, d): """ :type s: str :type d: List[str] :rtype: str """ result = '' for word in d: lo = 0 for l in word: lo = s.find(l, lo)+1 if lo == 0: ...

0.50655

for _1 in range(int(input())): n=int(input()) s=input().strip() answer=s for i in range(len(s)): c=s[i] string=s[:i]+s[i+1:] for j in range(len(string)+1): answer=min(answer, string[:j]+c+string[j:]) print(answer)

0.506434

from collections import defaultdict as dd def find(a, b): n = len(a) m = len(b) dp = [[0]*(m+1) for i in range(n+1)] for i in range(n-1,-1, -1): for j in range(m-1, -1, -1): if a[i] == b[j]: dp[i][j] = dp[i+1][j+1] + 1 mx = dd(int) ans = 0 for i in range(n-1, -1, -1): for j in range(m-1, -1, -1): ...

0.505808

def scramble(s1,s2): for c in set(s2): if s1.count(c) < s2.count(c): return False return True

0.505601

s = input() t = input() l, r = [0]*len(t), [0]*len(t) li, ri = 0, len(s) - 1 for i in range(len(t)): while s[ li ] != t[ i ]: li += 1 while s[ ri ] != t[ - i - 1 ]: ri -= 1 l[ i ] = li r[ -i -1 ] = ri li += 1 ri -= 1 print( max( [ r[ 0 ], len(s) - l[ -1 ] - 1 ] + [ max( 0, r[ i ...

0.504851

class Solution: def findLUSlength(self, strs): """ :type strs: List[str] :rtype: int """ def isSubseq(s1, s2): i, m=0, len(s1) for c in s2: if i==m: return True if s1[i]==c: i+=1 return i==m ...

0.504706

import sys reader = (s.rstrip() for s in sys.stdin) input = reader.__next__ def solve(): s,c = input().split() # i,jでjが複数あるとき n = len(s) for i in range(n-1): prev = s[i] pos = i for j in range(i+1, n): if s[j]<prev: prev = s[j] pos = j...

0.502969

s = list(input()) t = list(input()) cnt = 0 for i in range(3): if s[i] == t[i]: cnt += 1 print(cnt)

0.500553

from collections import Counter def most_common(s): count = Counter(s) return ''.join(sorted(s, key=lambda c: -count[c]))

0.499123

for _ in range(eval(input())): S1=input() m1=len(S1)/2 S2=input() m2=len(S2)/2 d1={} d2={} for i in range(len(S1)): c=S1[i] v=abs(m1-i) if c in d1: if v<d1[c][0]: d1[c]=[v,i] else: d1[c]=[v,i] for i in range(len(S2)...

0.499115

t=int(input()) no_of_chars = 256 # Function to find smallest window # containing all characters of 'pat' def findSubString(string, pat): len1 = len(string) len2 = len(pat) if len1 < len2: return 0 hash_pat = [0] * no_of_chars hash_str = [0] * no_of_chars for i in...

0.497822

class Solution: def maxFreq(self, s: str, maxLetters: int, minSize: int, maxSize: int) -> int: n = len(s) count = collections.Counter(s[i : i + minSize] for i in range(0, n - minSize + 1)) res = 0 for k, v in count.items(): if len(set(k)) <= maxLetters: ...

0.497224

def first_non_repeating_letter(string): string_lower = string.lower() for i, letter in enumerate(string_lower): if string_lower.count(letter) == 1: return string[i] return ""

0.497175

s, p = input(), input() n, m = len(s) + 1, len(p) d = [[0] * n for t in range(n)] for x in range(1, n): i, j = x, m while i and j: j -= s[i - 1] == p[j - 1] i -= 1 if not j: for y in range(i + 1): d[x][y + x - i - m] = d[i][y] + 1 for y in range(x): d[x][y] = max(d[x][y], d[x - 1...

0.496158

def no_repeat(s): return next(c for c in s if s.count(c) == 1)

0.496097

class Solution: def maxPower(self, s: str) -> int: n = len(s) count = 0 res = s[0] cur_count = 1 # Traverse string except # last character for i in range(n): # If current character # matches with next ...

0.495644

def maxlen(s1, s2): sm, lg = sorted((s1, s2)) return min(max(lg / 3, sm), lg / 2)

0.495374

Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Input: [10,9,2,5,3,7,101,18] Output: 4 Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4. Note: There may be more than one LIS combination, it is only necessary for yo...

class Solution: def lengthOfLIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 0: return 0 res = [nums[0]] def binarySearch(l,target): left , right = 0 , len(l)-1 while left < right: ...

0.712197

def bs(arr, val, key=lambda x:x): l, r = 0, len(arr)-1 if key(arr[l])>val: return l if key(arr[r])<=val: return r+1 while l+1<r: m = (l+r)>>1 v = key(arr[m]) if v<=val: l = m else: r = m return r def bs_left(arr,...

0.698053

class Solution: def findLengthOfLCIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) < 1: return 0 cur_len = 1 max_len = 1 for i in range(1,len(nums)): if nums[i] > nums[i-1]: cur_...

0.688204

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ cnt, sm, ism = 0, 0, 0 for i, num in enumerate(arr): sm += num ism += i if sm == ism: cnt += 1 return cnt

0.59288

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ res = 0 temp = sorted(arr) sum1, sum2 = 0, 0 for i in range(0,len(arr)): sum1 += arr[i] sum2 += temp[i] if(sum1 =...

0.591651

def count_inversions(array): inv_count = 0 for i in range(len(array)): for j in range(i, len(array)): if array[i] > array[j]: inv_count += 1 return inv_count

0.584491

def smaller(arr): # Good Luck! return [len([a for a in arr[i:] if a < arr[i]]) for i in range(0, len(arr))]

0.580729

def count_inversion(nums): return sum(a > b for i, a in enumerate(nums) for b in nums[i + 1:])

0.571751

from collections import Counter class Solution: def longestArithSeqLength(self, A: List[int]) -> int: c = dict(Counter(A).most_common()) # print(c) m1 = max(c.values()) # A = list(set(A)) # A.sort() index = {} # for i in range(len(A)): # index[A[i]...

0.571626

class Solution: def arrayNesting(self, nums): """ :type nums: List[int] :rtype: int """ best = 0 n = len(nums) p = [] for i in range(len(nums)): j = i current = 0 while nums[j] != -1: cur...

0.555625

class Solution: def longestConsecutive(self, nums): """ :type nums: List[int] :rtype: int """ longest_streak = 0 num_set = set(nums) for num in num_set: if num - 1 not in num_set: current_num = num current...

0.550472

class Solution: def findUnsortedSubarray(self, nums): """ :type nums: List[int] :rtype: int """ left = 1 size = len(nums) if size == 0: return 0 while left < size and nums[left - 1] <= nums[left]: left += 1 i...

0.545465

def longest_slide_down(p): res = p.pop() while p: tmp = p.pop() res = [tmp[i] + max(res[i],res[i+1]) for i in range(len(tmp))] return res.pop()

0.538687

AVAILABLE_METHODS = { 'even' : lambda x: x / 2, 'odd': lambda x: 3 * x + 1 } def generator(x): temp = x temp_num = 0 while temp > 1: if temp % 2 == 0: temp = AVAILABLE_METHODS['even'](temp) else: temp = AVAILABLE_METHODS['odd'](temp) temp_num += 1 ...

0.536641

class Solution: def findLUSlength(self, strs): """ :type strs: List[str] :rtype: int """ def isSubseq(s1, s2): i, m=0, len(s1) for c in s2: if i==m: return True if s1[i]==c: i+=1 return i==m ...

0.533689

class Solution: def findLongestChain(self, pairs): """ :type pairs: List[List[int]] :rtype: int """ pairs = sorted(pairs,key=lambda x:x[1]) res = 1 first = pairs[0] for i in pairs[1:]: if first[-1] < i[0]: res += ...

0.533409

class Solution: def partitionDisjoint(self, A: List[int]) -> int: biggest = A[0] newbiggest = A[0] lenL = 1 total = 1 for itr in A[1:]: total += 1 if itr < biggest: lenL = total biggest = newbiggest else: ...

0.527577

class Solution: def wiggleMaxLength(self, arr): """ :type nums: List[int] :rtype: int """ n = len(arr) if n < 2: return n wsl = [0]*n wsl[0] = 1 for cur in range(1, n): prev = cur - 1 ...

0.526422

def consecutive(arr): return max(arr) - min(arr) + 1 - len(arr) if arr else 0

0.526364

class Solution: def maxTurbulenceSize(self, A: List[int]) -> int: if len(A) == 1: return 1 prev = A[1] maxcount = count = 1 + int(A[0] != A[1]) print(count) lastcomp = A[0] < A[1] for a in A[2:]: comp = prev < a if prev == a: ...

0.526238

from sys import stdin tt = int(stdin.readline()) for loop in range(tt): n = int(stdin.readline()) a = list(map(int,stdin.readline().split())) lis = [ [1] ] now = [] tmp = 0 for i in range(1,n): if len(now) == 0: now.append(a[i]) tmp = 1 elif now[-1] ...

0.525259

def list_depth(l): depths = [1] for x in l: if isinstance(x, list): depths.append(list_depth(x) + 1) return max(depths)

0.523935

class Solution: def lenLongestFibSubseq(self, A: List[int]) -> int: def getFS(x1, x2): F = [x1, x2] while F[-1] <= 1000000000: F.append(F[-2] + F[-1]) return F C1 = getFS(1, 0) C2 = C1[1:] def getLLFS(x1, x2): ...

0.523565

class Solution: def findLHS(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums) ret = 0 for i in count: if i+1 in count: ret = max(ret, count[i]+count[i+1]) return ret...

0.522231

class Solution: def countSmaller(self, nums): """ :type nums: List[int] :rtype: List[int] """ s = sorted(nums) c = [] for n in nums: p = bisect.bisect_left(s, n) c.append(p) s.pop(p) return c

0.522089

def length_of_sequence(arr, n): if arr.count(n) != 2: return 0 a = arr.index(n) b = arr.index(n, a + 1) return b - a + 1

0.51997

from functools import lru_cache @lru_cache(maxsize=None) def rec(n): return 1 + (0 if n==1 else rec(3*n+1) if n&1 else rec(n//2)) memo = [[0, None], [1, 1]] def max_collatz_length(n): if not (type(n) == int and n > 0): return [] while n >= len(memo): x = rec(len(memo)) if x > memo[-1][1]: memo...

0.517957

class Solution: def jump(self,nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 1: return 0 else: step = 0 pos = 0 while pos != len(nums) - 1: bestStep = -1 bes...

0.516048

def segment_cover(A, L): n=1 s=min(A) for i in sorted(A): if s+L<i: s=i n+=1 return n

0.51578

def calc(a): res = [0] * (len(a) + 1) for k in range(len(a)): res = [2 * max(a[i] + res[i+1], a[i+k] + res[i]) for i in range(len(a) - k)] return res[0]

0.513192

def bubble(l): ret = [] for i in range(len(l) - 1, 0, -1): for j in range(i): if l[j] > l[j + 1]: l[j], l[j + 1] = l[j + 1], l[j] ret.append(l[:]) return ret

0.513007

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.504054

def rank_of_element(arr,i): return sum(x <= arr[i] if n < i else x < arr[i] for n,x in enumerate(arr))

0.503737

class Solution: def findMaxConsecutiveOnes(self, nums): """ :type nums: List[int] :rtype: int """ if nums == []: return 0 count = 0 countMax =0 for ele in nums: if ele == 1: count += 1 ...

0.503339

def lis(a): b = [] for c in a: # if len(b) == 0 or c > b[-1] if len(b) == 0 or c > b[-1]: b.append(c) else: l = 0 r = len(b) while l < r-1: m = l+r>>1 # if b[m] <= c: l = m if b[m] < c: l = m ...

0.499467

def array_operations(a, n): li = [] for i in range(n): m = max(a) a = [m-i for i in a] if a in li: if not n & 1 : return li[-1] return a li.append(a) return a

0.499367

def CeilIndex(A, l, r, key): while (r - l > 1): m = l + (r - l)//2 if (A[m] >= key): r = m else: l = m return r def LongestIncreasingSubsequenceLength(A, size): # Add boundary case, # when array size is one tailTable = [0...

0.498965

def hop_across(lst): def one_side(lst): i = 0 steps = 0 while i < len(lst): i += lst[i] steps += 1 return steps return one_side(lst) + one_side(lst[::-1])

0.495763

def ranks(a): sortA = sorted(a, reverse=True) return [sortA.index(s) + 1 for s in a]

0.494455

def order_type(arr): if not arr : return 'Constant' arr = list( map(len, [str(elt) if type(elt)==int else elt for elt in arr] )) cmp =sorted(arr) if arr == [arr[0]]*len(arr) : s='Constant' elif arr == cmp : s='Increasing' elif arr == cmp[::-1] : s='Decreasing' else : ...

0.493606

def almost_increasing_sequence(sequence): save, first = -float('inf'), True for i,x in enumerate(sequence): if x > save: save = x elif first: if i == 1 or x > sequence[i-2]: save = x first = False else: return False return True

0.492476

def find_longest(xs): return max(xs, key=lambda x: len(str(x)))

0.489208

def artificial_rain(garden): left,area,record = 0,0,1 for i in range(1,len(garden)): if garden[i] < garden[i-1]: left = i elif garden[i] > garden[i-1]: area = max(area,record) record = i - left record += 1 return max(area,record)

0.488705

# Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next class Solution: def nextLargerNodes(self, head: ListNode) -> List[int]: if head==None: return 0 temp=head arr=[] stack=[]...

0.488704

def find(seq): return (min(seq)+max(seq))*(len(seq)+1)/2-sum(seq)

0.487951

class Solution: def candy(self, ratings): """ :type ratings: List[int] :rtype: int """ if not ratings: return 0 total, pre, decrease = 1, 1, 0 for i in range(1, len(ratings)): if ratings[i] >= ratings[i-1]: ...

0.486479

from math import sqrt class Solution: def largestDivisibleSubset(self, nums): """ :type nums: List[int] :rtype: List[int] """ nums.sort() l, prev = {}, {} # length, previous number(largest divisor in nums) max_l, end_number = 0, None ...

0.483938

def deep_count(a): result = 0 for i in range(len(a)): if type(a[i]) is list: result += deep_count(a[i]) result += 1 return result

0.483624

def mForMaxSeq(arr, n): eim = dict() for i in range(n): if arr[i] in eim: eim[arr[i]].append(i) else: eim[arr[i]] = [i] keys = sorted(eim.keys()) # print(eim, keys) connected = False count = 0 pI = -1 nKeys = len(keys) ...

0.48343

def descriptions(arr): return 2**sum(a+1==b for a,b in zip(arr,arr[1:]))

0.482958

'''Author- Akshit Monga''' from sys import stdin, stdout input = stdin.readline t=int(input()) for _ in range(t): n=int(input()) a=[int(x) for x in input().split()] ans=0 dp=[-1 for i in range(0,n+1)] for i in a: var1=dp[i] var2=ans ans=max(ans,var1+1) dp[i]=max(dp[i],var2+1) print(n-ans)

0.482923

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...

0.482318

def folding(a,b): squares = 1 while a != b: squares += 1 b, a = sorted((a - b, b)) return squares

0.481963

def solve(l): m = l.index(max(l)) if m == 0 or m == len(l) - 1: return 1 return 1 + min(solve(l[0:m]), solve(l[m+1:])) tc = int(input()) for test in range(tc): n = int(input()) l = list(map(int, input().split())) print(solve(l))

0.479915

class Node(object): def __init__(self, data): self.data = data self.next = None def length(node): leng = 0 while node: leng += 1 node = node.next return leng def count(node, data): c = 0 while node: if node.data==data: c += 1 no...

0.476402

class Solution: def findShortestSubArray(self, nums): diction = {} for i in nums: if i not in diction: diction[i] = 1 else: diction[i] += 1 degree = max(list(diction.values())) ...

0.473379

class Solution: def isvalid(self,C): if len(C)>2: return False if len(C)==1: a = min(C) if a==1 or C[a]==1: # EXPLANATION: # a==1 : All lengths are unitary like A=[1,2,3,4,...], so poping anything is fine # C[a...

0.473026

class Solution: def longestMountain(self, A: List[int]) -> int: up=0 down=0 ans=0 for i in range(0,len(A)-1): if A[i]<A[i+1]: if down==0: up+=1 else: up=1 down=0 ...

0.472905

class Solution: def lengthLongestPath(self, input): """ :type input: str :rtype: int """ dict={0:0} maxlen=0 line=input.split("\n") for i in line: name=i.lstrip('\t') print(name) print((len(name))) ...

0.471615

def cut_the_ropes(arr): results = [len(arr)] while arr: m = min(arr) arr = [elem - m for elem in arr if elem != m] results.append(len(arr)) return results[:-1]

0.471214

def sequence_classifier(arr): if all(arr[i] == arr[i+1] for i in range(len(arr)-1)): return 5 if all(arr[i] < arr[i+1] for i in range(len(arr)-1)): return 1 if all(arr[i] <= arr[i+1] for i in range(len(arr)-1)): return 2 if all(arr[i] > arr[i+1] for i in range(len(arr)-1)): return 3 if all(arr[i] ...

0.470097

def luxhouse(houses): return [max(0, max(houses[i:]) - h + 1) for i, h in enumerate(houses[:-1], 1)] + [0]

0.469908

def bubblesort_once(l): l = l[:] for i in range(len(l)-1): if l[i] > l[i+1]: l[i], l[i+1] = l[i+1], l[i] return l

0.46932

def array_leaders(numbers): return [n for (i,n) in enumerate(numbers) if n>sum(numbers[(i+1):])]

0.468972

def collatz(n): step = 1 while n!= 1: n = [n//2, (n*3)+1][n%2] step += 1 return step

0.468957

from collections import Counter def exchange_sort(sequence): """Greedy algorithm based on permutation cycle decomposition: 1. Search for transposition placing TWO elements correctly. 2. Search iteratively for transposition placing ONE elements correctly.""" swaps, cnt = 0, Counter() for a, b in zip...

0.467817

def sort_number(a): a = sorted(a) return [1]+a if a.pop()!=1 else a+[2]

0.467168

def robot_walk(a): i=3 while(i<len(a) and a[i] < a[i-2]): i+=1 return i<len(a)

0.464573

class Solution: def leastBricks(self, wall): """ :type wall: List[List[int]] :rtype: int """ d = {} for i in wall: suma = 0 for j in range(len(i)-1): suma += i[j] if suma in d: d[s...

0.464348

def largest_rect(h): st=[]; m=0; i=0 while i<len(h): if len(st)==0 or h[st[-1]]<=h[i]: st.append(i); i+=1 else: l=st.pop(); m=max(m, h[l]*(i if len(st)==0 else i-st[-1]-1)) while len(st)>0: l=st.pop(); m=max(m, h[l]*(i if len(st)==0 else i-st[-1]-1)) return m

0.464188

def amidakuji(ar): numbers = list(range(len(ar[0])+1)) for line in ar: for i, swap in enumerate(line): if swap == '1': numbers[i], numbers[i+1] = numbers[i+1], numbers[i] return numbers

0.463395

class Solution: def findLengthOfShortestSubarray(self, arr: List[int]) -> int: n = len(arr) if n<=1: return 0 l,r = n,-1 for i in range(1,n): if arr[i]<arr[i-1]: l = i break # monotonicially increasing ...

0.461922

def least_bribes(bribes): mem = {} def s(n1, n2): if n1 >= n2: return 0 if (n1, n2) in mem: return mem[n1, n2] r = min(bribes[i] + max(s(n1, i), s(i + 1, n2)) for i in range(n1, n2)) mem[n1, n2] = r return r return s(0, len(bribes))

0.46149

class Solution(object): def hIndex(self, citations): """ :type citations: List[int] :rtype: int """ n=len(citations) if n>0: citations.sort() citations.reverse() ...

0.461288

def compute_depth(n): i = 0 digits = set() while len(digits) < 10: i += 1 digits.update(str(n * i)) return i

0.460994

def longest(words): return max(map(len, words))

0.460232

for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) ans = 1 l1 = l[0] for i in range(1,n): if l[i] <= l1: l1 = l[i] ans = ans + 1 print(ans)

0.459756

def base_finder(seq): return len(set(''.join(seq)))

0.459483

def find_missing(sequence): t = sequence return (t[0] + t[-1]) * (len(t) + 1) / 2 - sum(t)

0.459073

def est_subsets(arr): return 2**len(set(arr)) - 1

0.458719

def longer(s): return ' '.join(sorted(s.split(), key=lambda w: (len(w), w)) )

0.457872

def hotpo(n): cnt = 0 while n != 1: n = 3 * n + 1 if n % 2 else n / 2 cnt += 1 return cnt

0.456754

def largest(n, xs): "Find the n highest elements in a list" return sorted(xs)[-n:];

0.45632

def solve(arr): r = [] for v in arr[::-1]: if not r or r[-1] < v: r.append(v) return r[::-1]

0.455683

class Solution: def numberOfArithmeticSlices(self, A): curr, sum = 0, 0 for i in range(2,len(A)): if A[i]-A[i-1] == A[i-1]-A[i-2]: curr += 1 sum += curr else: curr = 0 return sum # solution = 0 # ...

0.455271

score=lambda n:2**n.bit_length()-1

0.455036

def save(sizes, hd): for i,s in enumerate(sizes): if hd < s: return i hd -= s return len(sizes)

0.454516

def increasing_numbers(d): s = 1 for i in range(1,10): s=s*(i+d)//i return s

0.454334

def find_dup(arr): return sum(arr) - len(arr)*(len(arr)-1)/2 #your code here

0.454325

class Solution: def fallingSquares(self, positions): """ :type positions: List[List[int]] :rtype: List[int] """ height = [0] pos = [0] res = [] max_h = 0 for left, side in positions: i = bisect.bisect_right(pos, left) ...

0.4538

class Solution: def largestRectangleArea(self, heights): """ :type heights: List[int] :rtype: int """ if not heights: return 0 stack = [0] heights.append(0) # print(heights) max_area = 0 for i in range(...

0.453019

from bisect import bisect_left as keep_order

0.452783

def find_longest(st): res,pos=0,[0] for i,b in enumerate(st,1): if b=="(": pos.append(i) else: try:pos.pop();res=max(res,i-pos[-1]) except:pos.append(i) return res

0.452016

import bisect from functools import lru_cache class Solution: def makeArrayIncreasing(self, A: List[int], B: List[int]) -> int: B = sorted(set(B)) @lru_cache(None) def find_larger_value_in_B(val): if val >= B[-1]: return float('inf') return B[bisect...

0.451123

from sys import stdin for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) id = list(zip(l,list(range(n)))) id.sort() val, pos = zip(*id) blok = [] cur = [pos[0]] for i in range(1,n): if val[i] == val[i-1]: cur.append(pos[i]) else:...

0.450043

# Definition for an interval. # class Interval: # def __init__(self, s=0, e=0): # self.start = s # self.end = e class Solution: def eraseOverlapIntervals(self, intervals): """ :type intervals: List[Interval] :rtype: int """ intervals = sorted(...

0.449833

class Solution: def movesToMakeZigzag(self, nums): n = len(nums) res0 = 0 for i in range(0, n, 2): nei = min(nums[j] for j in [i - 1, i + 1] if 0 <= j <= n-1) if nums[i] >= nei: res0 += nums[i] - nei + 1 res1 = 0 for i in range(1, n, 2)...

0.44973

def find_dup(arr): return sum(arr) - sum(range(1, max(arr)+1))

0.449703

class Solution: def maxWidthRamp(self, A: List[int]) -> int: width = 0 icandidate = [0] for i in range(len(A)): if A[i] < A[icandidate[-1]]: icandidate.append(i) for j in range(len(A) - 1, -1, -1): while icandidate and A[icandidate[-1]] <= A[j]...

0.449137

S, SS, SUM = [0], {0}, [0] def rec(n): while len(S)<=n: v = S[-1] - len(S) if v<= 0 or v in SS: v += 2*len(S) S.append(v) SS.add(v) SUM.append(SUM[-1]+v) return SUM[n-1]

0.448997

def cut_log(p, n): log = [0] for _ in range(n): log.append(max(pi + li for pi, li in zip(p[1:], log[::-1]))) return log[n]

0.448966

Run-length encoding is a string compression method that works by replacing consecutive identical characters (repeated 2 or more times) with the concatenation of the character and the number marking the count of the characters (length of the run). For example, to compress the string "aabccc" we replace "aa" by "a2" and ...

class Solution: def getLengthOfOptimalCompression(self, s: str, k: int) -> int: n = len(s) def compLen(c): return 1 + len(str(c)) if c > 1 else 1 @lru_cache(None) def dp(i, k): # return {head: (len, -head_count)} if (n - i) <= k: return {} # ...

0.804149

class Solution: def characterReplacement(self, s, k): """ :type s: str :type k: int :rtype: int """ if s == "": return 0 count = {} lo = 0 hi = 0 max_letter = 0 for hi in range(len(s)): try:...

0.700377

class Solution: def longestSubstring(self, s, k): """ :type s: str :type k: int :rtype: int """ for c in set(s): if s.count(c) < k: return max(self.longestSubstring(sp, k) for sp in s.split(c)) return len(s)

0.692985

n, k = [int(i) for i in input().split()] dic = dict() s = list(input()) i = 0 while i<n: j = 1 while i+j < n and s[i] == s[i+j]: j+=1 if s[i] not in dic: dic[s[i]] = [] dic[s[i]].append(j) i += j ans = 0 for i in list(dic.keys()): ct = 0 for j in dic[i]: ct+=(j//k...

0.676843

def solve(st, k): length = len(st) - k return max(int(st[i:i + length]) for i in range(k + 1))

0.648359

def ii(): return int(input()) def mi(): return list(map(int, input().split())) def li(): return list(mi()) n, k = mi() a = li() s = input().strip() ans = 0 i = 0 while i < n: j = i + 1 while j < n and s[j] == s[i]: j += 1 b = sorted(a[i:j]) ans += sum(b[-k:]) i = j print(ans)

0.640076

class Solution: def longestOnes(self, A: List[int], K: int) -> int: hulu = [] cnt = 0 num = A[0] for x in A: if x == num: cnt += 1 else: hulu.append([num,cnt]) cnt = 1 num = x if cnt>0: ...

0.638236

class Solution: def maxVowels(self, s: str, k: int) -> int: n = len(s) vowel = set(['a','e','i','o','u']) i=0 res = 0 while i<k: if s[i] in vowel: res+=1 i+=1 j=k i=0 maxV = res while j<n: if ...

0.63344

class Solution: def minDeletionSize(self, A: List[str]) -> int: dp = [(1, 1)] * len(A[0]) for i in range(len(dp)): if i > 0: max_pre = None for pre in range(i - 1, -1, -1): for word in A: if word[pre] > word[i]: ...

0.62714

class Solution: def maxPower(self, s: str) -> int: n = len(s) count = 0 res = s[0] cur_count = 1 # Traverse string except # last character for i in range(n): # If current character # matches with next ...

0.622688

from functools import lru_cache class Solution: def palindromePartition(self, s: str, k: int) -> int: n = len(s) if n == k: return 0 @lru_cache(None) def cnt(left,right): # cost to make palindrome if left >= right: return 0 return ...

0.605115

class Solution: def longestAwesome(self, s: str) -> int: cum = [0] firsts = {0: -1} lasts = {0: -1} for i, c in enumerate(s): cum.append(cum[-1] ^ (1 << (ord(c) - 48))) if cum[-1] not in firsts: firsts[cum[-1]] = i lasts[cum[-1]] = ...

0.599467

def string_constructing(a, s): if len(s) == 0: return 0 i = -1 for j, c in enumerate(s): i = a.find(c, i+1) if i < 0 or i == len(a) - 1: break return len(a) - j + (i < 0) + string_constructing(a, s[j + (i >= 0):])

0.598457

class Solution: def minCost(self, s: str, cost: List[int]) -> int: delete_cost = 0 last = 0 for i in range(1, len(s)): if s[last] == s[i]: if cost[last] < cost[i]: delete_cost += cost[last] last = i else: ...

0.589031

def main(): N, K = list(map(int, input().split())) S = list(input()) base = S[0] flag = False for i in range(0, N): if K == 0: break if S[i] != base and (not flag): flag = True S[i] = base elif S[i] != base and flag: S[i] = base...

0.58435

def solve(st,k): for l in sorted(st)[:k]: st=st.replace(l,'',1) return st

0.583954

s = input() L = input() k = int(input()) '''from datetime import * time1 = datetime.now()''' good = set() string = set() LIST = [chr(i) for i in range(97,123)] for i in range(26): if L[i]=='1': good.add(LIST[i]) t = [s[i] not in good for i in range(len(s))] end = [0]*len(s) badchars = 0 front=0; rear=0 w...

0.583856

class Solution: def lengthOfLongestSubstring(self, s): """ :type s: str :rtype: int """ L, res, last = -1, 0, {} for R, char in enumerate(s): if char in last and last[char] > L: L = last[char] elif R-L > res: ...

0.580662

ans = 1000000000 n, k = [int(i) for i in input().split()] s = input() l = len(s) d = [k // 2, (k + 1) // 2] nearl = [0] * n nearr = [0] * n last = 1000000000 for i in range(n): if s[i] == '0': last = i nearl[i] = last for i in range(n - 1, -1, -1): if s[i] == '0': last = i nearr[i] = las...

0.577779

class Solution: def maxRepOpt1(self, text: str) -> int: letters = {} for i, char in enumerate(text): if char in letters: letters[char].append(i) else: letters[char] = [i] if len(letters) == 1: return len(text) ...

0.576002

s = input().split() k = int(s[1]) s = s[0] if s.count('0') < k: if s.count('0') > 0: print(len(s) - 1) else: print(len(s)) return have = 0 its = 0 for i in range(len(s) - 1, -1, -1): its += 1 if s[i] == '0': have += 1 if have == k: print(its - have) return

0.57549

def check(s,k): for i in range(k+1): if chr(ord('0')+i) not in s: return False return True n, k = map(int,input().split()) ans = 0 for i in range(n): ss = input() if check(ss,k): ans +=1 print(ans)

0.575022

class Solution: def hasAllCodes(self, s: str, k: int) -> bool: if len(s) < 2 ** k + k - 1: return False # Cannot be a string, as this is the de brujin length target = 2 ** k seen = set() cur_len = 0 for end in range(k, len(s) + 1): chunk = s[end - k: e...

0.574239

from itertools import permutations def solve(s,k): return sum(not v%k for v in map(int, map(''.join, permutations(s.split(),2))))

0.574211

# import sys # sys.setrecursionlimit(10 ** 6) # import bisect # from collections import deque # from decorator import stop_watch # # # @stop_watch def solve(N, K, S): S = [int(s) for s in S] point_l = 0 point_r = 0 # decision r num_0 = 0 if S[0] == 1 else 1 flg = S[0] for i in range(N): ...

0.573088

from collections import * c=Counter() ans=n=int(input()) s=input() k=len(set(s)) i=j=t=0 while j<n: while len(c)<k and j<n: c[s[j]]+=1; j+=1 while len(c)==k: if j-i<ans: ans=j-i c[s[i]]-=1 if c[s[i]]==0: del c[s[i]] i+=1 print(ans)

0.572312

class Solution: def orderlyQueue(self, S: str, K: int) -> str: if K >= 2: return ''.join(sorted(S)) length = len(S) S = S + S i, j, k = 0, 1, 0 while j + k < len(S) and k < length: if S[i + k] == S[j + k]: k += 1 ...

0.57122

class Solution: def longestCommonSubsequence(self, a: str, b: str) -> int: last, current = [0] * (len(b) + 1), [0] * (len(b) + 1) for i in range(len(a) - 1, -1, -1): for j in range(len(b) - 1, -1, -1): if a[i] == b[j]: current[j] = 1 + last[j ...

0.57048

n, k = map(int, input().split()) s = set() st = input() inp = input().split() for x in inp: s.add(x) current, ans = 0, 0 for x in st: if x in s: current += 1 else: ans += (current * (current + 1)) // 2 current = 0 ans += (current * (current + 1)) // 2 print(ans)

0.567803

s=input() dp=[[0,0,0] for i in range(len(s))] for i in range(len(s)): if s[i]=='a': dp[i][0]=dp[i-1][0]+1 dp[i][1]=dp[i-1][1] dp[i][2]=max(dp[i-1][1]+1,dp[i-1][2]+1) else: dp[i][0]=dp[i-1][0] dp[i][1]=max(dp[i-1][0]+1,dp[i-1][1]+1) dp[i][2]=dp[i-1][2] e=len(s)-1 p...

0.565961

class Solution: def minSubArrayLen(self, k, nums): """ :type k: int :type nums: List[int] :rtype: int """ if not nums: return 0 _min = float('inf') _sum = 0 j = 0 for i ,n in enumerate(nums): _su...

0.565915

n, k = map(int,input().split()) s = input() maxi = 0 a = 0 b = 0 st = 0 for i in range(0, n): if s[i] == 'a': a += 1 else: b+=1 if min(a, b) > k: if s[st] == 'a': a-=1 else: b-=1 st += 1 else: maxi += 1 print(maxi)

0.56478

# O(n) time and space # Hashmap and array # Count number then count occurrence: # Count the occurrences of each number using HashMap; # Keep a count of different occurences # From small to big, for each unvisited least frequent element, deduct from k the multiplication with the number of elements of same occurrence, ch...

0.564301

import sys inf = 1 << 30 def solve(): def check(mid): tot = 1 line = 0 buf = 0 for ch in s: buf += 1 if ch == ' ' or ch == '-': if line + buf > mid: tot += 1 if tot > k or buf > mid: ...

0.562762

n, m, k = input().split(' ') n = int(n) m = int(m) k = int(k) ind = [] pre = [] for _ in range(n): s = input() ind.append([]) for i, c in enumerate(s): if c == '1': ind[-1].append(i) for i in range(n): pre.append([]) for j in range(k + 1): pre[i].append([]) if l...

0.559552

class Solution: def maxLength(self, arr: List[str]) -> int: def digit_representation(s): ans = 0 for c in s: ans |= 1<<(ord(c)-ord('a')) return ans A = sorted([(len(s), digit_representation(s)) for s in set(arr) if len(set(s))==len(s)], re...

0.559253

3 import sys s = sys.stdin.readline().strip() k = int(sys.stdin.readline()) s += '*' * k def is_tandem(s): # print(s) n = len(s) // 2 a, b = s[:n], s[n:] for i in range(n): if a[i] == '*' or b[i] == '*': continue if a[i] != b[i]: return False return True l = 0 for i i...

0.558846

class Solution: def removeDuplicates(self, s: str, k: int) -> str: st=[['*',0]] for c in s: if c!=st[-1][0]: st.append([c,1]) else: st[-1][1]+=1 if st[-1][1]==k: st.pop() res='' for c,v in st:...

0.556414

from collections import Counter n, k = list(map(int, input().split())) c = Counter(input()) ans = min(c[chr(ord('A') + i)] for i in range(k)) print(k * ans)

0.55603

class Solution: def minDeletionSize(self, A: List[str]) -> int: def isSorted(arr, i, j): return all(arr[k] <= arr[k+1] for k in range(i, j)) ans = 0 ranges = [[0, len(A)-1]] for col in zip(*A): if not ranges: break if all(isSorted(c...

0.555585

from collections import defaultdict class Solution: def subarraysWithKDistinct(self, A: List[int], K: int) -> int: start_k = 0 start = 0 elem_dict = defaultdict(int) ans = 0 for elem in A: elem_dict[elem] += 1 if...

0.553234

s = input().strip() k = int(input()) w = list(map(int, input().split())) f = 0 m = max(w) for i in range(len(s)): f += (i + 1) * w[ord(s[i]) - ord('a')] for i in range(len(s), len(s) + k): f += (i + 1) * m print(f)

0.551429

s = input() cur_len = 1 a = [] char = [] for i in range(1, len(s)): if s[i] == s[i-1]: cur_len += 1 else: a.append(cur_len) char.append(s[i-1]) cur_len = 1 a.append(cur_len) char.append(s[len(s)-1]) ans = 0 while len(a) > 1: n = len(a) inner_min = 100000000 for i in range(...

0.551234

class Solution: def longestDecomposition(self, text: str) -> int: n = len(text) splits = 0 leftstart, leftend = 0, 0 rightstart, rightend = n-1, n-1 while leftend<rightstart: if text[leftstart:leftend+1] == text[rightstart:rightend+1]: leftstart = ...

0.550821

def ii(): return int(input()) def mi(): return list(map(int, input().split())) def li(): return list(mi()) # B. The Fair Nut and Strings n, k = mi() s = input().strip() t = input().strip() ans = 0 jj = 0 for i in range(n): if s[i] == t[i]: ans += 1 jj = i + 1 else: break c...

0.550631

class Solution: def maxUniqueSplit(self, s: str) -> int: self.x, n = 0, len(s) def maxUniqueSplit_(i=0, S=set()): if s[i:] not in S: self.x = max(self.x, len(S) + 1) for j in range(i + 1, n): if s[i : j] not in S and len(S) + 1 + n...

0.549691

t = int(input()) def gcd(a,b): if b == 0: return a return gcd(b,a%b) for _ in range(t): n,k = map(int,input().split()) s = input() occ = [0] * 26 for i in s: occ[ord(i)-97] += 1 occ.sort() occ.reverse() for l in range(1,n+1): cycle = gcd(l,k) need = l/...

0.54969

'''input abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxy...

0.548029

class Solution: def minInteger(self, num: str, k: int) -> str: n=len(num) if k<=0: return num if k>n*(n-1)//2: return ''.join(sorted(list(num))) for i in range(10): idx = num.find(str(i)) if idx>=0 and idx<=k: ...

0.546955

from collections import Counter, defaultdict from string import ascii_lowercase as al n, k = list(map(int, input().split())) s = list(input()) C = defaultdict(int, Counter(s)) C_ = defaultdict(int) k_ = k for char in al: temp = min(C[char], k_) C_[char] += temp k_ -= temp for i, el in enumerate(s): ...

0.545319

import heapq n, k = list(map(int, input().split())) s = input() mostRecent = n best = [] for room in range(n-1, -1, -1): if s[room] == '1': mostRecent = room best.append(mostRecent) best = best[::-1] dp = [0] vals = [(0,0)] for room in range(1, n + 1): new = dp[-1] + room if room - k - 1 >...

0.543658

class Solution: def kSimilarity(self, A: str, B: str) -> int: a = '' b = '' for i in range(len(A)): if A[i] != B[i]: a+=A[i] b+=B[i] return self.dfs(a,b) def dfs(self,a,b): if not a: ...

0.540054

class Solution: def maxScore(self, s: str) -> int: maxi=0 for i in range(1,len(s)): a=s[:i] b=s[i:] maxi=max(a.count('0')+b.count('1'),maxi) return maxi

0.538971

class Solution: def isvalid(self,C): if len(C)>2: return False if len(C)==1: a = min(C) if a==1 or C[a]==1: # EXPLANATION: # a==1 : All lengths are unitary like A=[1,2,3,4,...], so poping anything is fine # C[a...

0.538854

read = lambda: map(int, input().split()) s = input() k = int(input()) if len(s) < k: print('impossible') else: print(max(0, k - len(set(s))))

0.538838

class Solution: def maxFreq(self, s: str, maxLetters: int, minSize: int, maxSize: int) -> int: n = len(s) count = collections.Counter(s[i : i + minSize] for i in range(0, n - minSize + 1)) res = 0 for k, v in count.items(): if len(set(k)) <= maxLetters: ...

0.538171

def sol(a,k): n=len(a) if(k==0):return 1 if(k==1): v=set() for x in a: v.add(x) return len(v) if(n<k or n<1 or k<1): return 0 if(n==k): return 1 sz=max(3000,n) v1=[0]*sz v2=[0]*sz v3=[0]*sz v2[n-1]=1 v3[a[n-1]-1]=1 for i...

0.538029

def array_equalization(a, k): totals, ends = {}, {} for i, n in enumerate(a): if n not in ends: totals[n], ends[n] = 0, -1 if i < ends[n]: continue count = (i - ends[n] - 1 + k - 1) // k totals[n] += count ends[n] = max(i, ends[n] + count * k) return min(t + (len(a) -...

0.535388

class Solution: def smallestRangeII(self, A: List[int], K: int) -> int: if not A: return 0 nums = sorted([num + K for num in set(A)], reverse=True) max_num = nums[0] min_num = nums[-1] changed_max = max_num - 2 * K res = max_num - min_num for i in ...

0.535132

from sys import stdin,stdout import math,bisect from datetime import date from collections import Counter,deque,defaultdict L=lambda:list(map(int, stdin.readline().strip().split())) M=lambda:list(map(int, stdin.readline().strip().split())) I=lambda:int(stdin.readline().strip()) S=lambda:stdin.readline().strip() C=lambd...

0.53489

class Solution: def numSplits(self, s: str) -> int: left = [0]*len(s) unique = set() n_distinct = 0 for i, l in enumerate(s): if l not in unique: unique.add(l) n_distinct += 1 left[i] = n_distinct count...

0.534441

import sys INF = 10**20 MOD = 10**9 + 7 I = lambda:list(map(int,input().split())) from math import gcd from math import ceil from collections import defaultdict as dd, Counter from bisect import bisect_left as bl, bisect_right as br def solve(): n, k = I() s = input() ans = 0 last = -INF for i in range(n): ...

0.532039

class Solution: def numberOfArrays(self, s: str, k: int) -> int: dp = [-1] * len(s) return self.dfs(s, k, 0, dp) def dfs(self, s: str, k: int, start: int, dp: List[int]) -> int: if start == len(s): return 1 if s[start] == '0': return 0 if dp[s...

0.531624

class Solution: def minFlipsMonoIncr(self, S: str) -> int: onesSoFar = 0 partial = 0 for n in S: if n == '0': partial = min(onesSoFar, partial+1) else: onesSoFar += 1 return partial

0.529738

# # abc096 b # import sys from io import StringIO import unittest from collections import Counter class TestClass(unittest.TestCase): def assertIO(self, input, output): stdout, stdin = sys.stdout, sys.stdin sys.stdout, sys.stdin = StringIO(), StringIO(input) resolve() sys.stdout.se...

0.529281

n, m, k = map(int, input().split()) s, t = input(), input() n += 1 m += 1 p = [i for i in range(n * m - n) if (i + 1) % n] r = p[::-1] d = [0] * n * m for i in p: if s[i % n] == t[i // n]: d[i] = d[i - n - 1] + 1 f = d[:] for y in range(k - 1): for i in p: f[i] = max(f[i], f[i - 1], f[i - n]) for i in...

0.528789

class Solution: def maxSumAfterPartitioning(self, arr, k): res = [0] for idx, val in enumerate(arr): max_val, cur_val = 0, 0 for i in range(max(0, idx-k+1), idx+1)[::-1]: if arr[i] > max_val: max_val =...

0.528317

n, k = map(int, input().split()) s = sorted(list(input())) prev = 0 w = 0 for el in s: if k == 0: break if ord(el) >= prev + 2: k -= 1 w += ord(el) - ord('a') + 1 prev = ord(el) if k == 0: print(w) else: print(-1)

0.525871

class Solution: def longestDupSubstring(self, S): nums, N = [ord(c) - ord('a') for c in S], len(S) BASE, MOD = 26, 2**32 def check(L): cur_hash, seen = 0, set() for val in nums[:L]: cur_hash = (cur_hash * BASE + val) % MOD seen.add(cur_hash...

0.523672

class Solution: def findTheLongestSubstring(self, s: str) -> int: s = s + 'a' bits, dp = {'a':0,'e':1,'i':2,'o':3,'u':4}, {0:-1} res = 0 key = 0 for i, char in enumerate(s): if char in bits: if key in dp: res = m...

0.523558

N=int(input()) S=input() ans=S[0] for s in S: if ans[-1]!=s: ans+=s print(len(ans))

0.523001

from itertools import groupby def run_length_encoding(s): return [[sum(1 for _ in g), c] for c, g in groupby(s)]

0.521767

from sys import stdin import math rgb = 'RGB' for query in range(int(stdin.readline())): n, k = list(map(int, stdin.readline().split())) s = stdin.readline() ans = math.inf for start in range(3): dp = [0 for i in range(n + 1)] for i in range(n): cur = rgb[(start + i) % le...

0.520944

class Solution: def decodeAtIndex(self, S: str, K: int) -> str: size = 0 # Find size = length of decoded string for c in S: if c.isdigit(): size *= int(c) else: size += 1 for c in reversed(S): K %= size i...

0.520639

import sys def solve(): n,k, = rv() a, = rl(1) res = 0 count = [0] * 10 for i in range(n): if a[i] < 100: count[10 - (a[i] % 10) - 1] += 1 res += a[i] // 10 for i in range(10): while count[i] > 0 and k >= i + 1: res += 1 count[i] -= 1 ...

0.52048

class Solution: def minDeletionSize(self, A: List[str]) -> int: return sum([list(col) != sorted(col) for col in zip(*A)])

0.520195

# cook your dish here import bisect for _ in range(int(input())): w,k=map(str, input().split()) k=int(k) n=len(w) w=list(w) w.sort() w.append('0') c=1 l=0 l1=[] l2=[] for i in range(1, n+1): if w[i]==w[i-1]: c+=1 else: a=bisect.bisect_left(l1, c) if a==l: l1.append(c) l2.append(1) l...

0.51921

class Solution: def findSubstringInWraproundString(self, p): """ :type p: str :rtype: int """ pc = None sl = 0 ll = {} for c in p: if pc and (ord(pc) + 1 == ord(c) or (pc == 'z' and c == 'a')): sl += 1 ...

0.519062

s = input() d = dict() d['V'] = 'K' d['K'] = 'V' m = s.count('VK') s = list(s) for i in range(len(s)): s[i] = d[s[i]] m = max(m,''.join(s).count('VK')) s[i] = d[s[i]] print(m)

0.518345

n, k = list(map(int, input().split())) a = list(map(int, input().split())) library = [] money = 0 for i in range(len(a)): if a[i] not in library: money += 1 if len(library) < k: library.append(a[i]) else: curmin = n curindex = 0 found = [n] * l...

0.517891

class Solution: def getMaxRepetitions(self, s1, n1, s2, n2): """ :type s1: str :type n1: int :type s2: str :type n2: int :rtype: int """ if s2=='aac' and n2==100: return 29999 i,j=0,0 l1=len(s1) l2=len(s...

0.517261

n, k = map(int, input().split()) arr = [0] * 26 s = input() aux = ord('A') for i in range(len(s)): arr[ord(s[i]) - aux] += 1 arr.sort(reverse = True) i = 0 sum = 0 while k > 0: if arr[i] >= k: sum += k ** 2 k = 0 else: k -= arr[i] sum += arr[i] ** 2 i += 1 print(sum)

0.517256

import sys input = sys.stdin.readline from collections import defaultdict class Unionfind: def __init__(self, n): self.par = [-1]*n self.rank = [1]*n def root(self, x): r = x while not self.par[r]<0: r = self.par[r] t = x ...

0.517021

n, k = map(int, input().split()) s = input() l, r = int(-1), int(n) while r - l > 1: m = (l+r)//2 c, p = 1, 0 cond = True while p < n and c < k: i = p + m + 1 while i >= p and (i >= n or s[i] == '1'): i = i - 1; if (i == p): break c = c + 1 ...

0.516602

class Solution: def numSteps(self, s: str) -> int: i, mid_zero = 0 , 0 for j in range(1, len(s)): if s[j] == '1': mid_zero += j -i - 1 i = j if i == 0: return len(s)-1 return mid_zero + 1 + len(s)

0.515629

class Solution: def longestStrChain(self, words: List[str]) -> int: by_length = collections.defaultdict(set) for word in words: by_length[len(word)].add(word) longest = 1 seen = {*()} mx = len(by_length) mn = min(by_length) for length in sorted(b...

0.515205

n = int(input()) s = input() j = 1 result = [] for i in range(n): while (j < n-1) and (s[i:j] in s[j:]): j += 1 result.append(j-i-1) print(max(result))

0.514854

class Solution: def longestPalindrome(self, s): """ :type s: str :rtype: int """ re = 0 set_s = set(s) flag = False for x in set_s: if s.count(x) % 2 == 0: re += s.count(x) elif s.count(x) >= 3 : ...

0.513717

t = [0] * 26 def get_k(c): return ord(c) - ord('a') def analyze(s): length_of_str = len(s) pos = 0 beauty_table = [0] * 26 for i in range(1, length_of_str): if s[i] != s[pos]: k = get_k(s[pos]) beauty_table[k] = max(beauty_table[k], i - pos) pos = i ...

0.511896

import sys import heapq from collections import namedtuple Record = namedtuple('Record', ['index', 'book_id']) l1 = sys.stdin.readline() l2 = sys.stdin.readline() n, k = list(map(int, l1.split(' '))) books = list(map(int, l2.split(' '))) cost = 0 cache = set() prev = dict() # book_id -> index next = [n+1] * n # ind...

0.511608

n, k = map(int, input().split()) a = list(map(int, input().split())) cnt = {} for elem in a: if elem in cnt: cnt[elem] += 1 else: cnt[elem] = 1 cnt = sorted(list(cnt.items())) for i in range(len(cnt)): cnt[i] = list(cnt[i]) left = 0 right = len(cnt) - 1 while k > 0: if k < cnt[left][1] ...

0.51116

from sys import stdin input = stdin.readline n = int(input()) s = list(input().strip()) for i in range(26): char = chr(ord('z') - i) prev = chr(ord('z') - i - 1) updated = True while updated: updated = False for idx in range(len(s)-1, -1, -1): if s[idx] == char: ...

0.510759

class Solution: def countSubstrings(self, s): """ :type s: str :rtype: int """ ret = 0 left, right = 0, 0 while left < len(s): while right < len(s) and s[right] == s[left]: right += 1 ret += self.sum(right - l...

0.510488

class Solution: def findLengthOfShortestSubarray(self, arr: List[int]) -> int: n = len(arr) if n<=1: return 0 l,r = n,-1 for i in range(1,n): if arr[i]<arr[i-1]: l = i break # monotonicially increasing ...

0.510202

class Solution: def removeKdigits(self, num, k): """ :type num: str :type k: int :rtype: str """ out=[] for digit in num: while k and out and out[-1] > digit: out.pop() k-=1 out.append(digit) ...

0.508615

def find_short(s): return min(len(x) for x in s.split())

0.508329

from collections import Counter class Solution: def canConstruct(self, s: str, k: int) -> bool: if k > len(s): #return False return False counter = Counter(s) odd_counts = 0 for char in counter: if counter[char] % 2 == 1: odd_counts +=...

0.508233

class Solution: def minNumberOfFrogs(self, croakOfFrogs: str) -> int: # valid string? can be seperated into full croaks: ### dict of letters. c, r, o, a, k should all be equal, nothing else in if len(croakOfFrogs)%5!=0 or croakOfFrogs[0]!='c' or croakOfFrogs[-1]!='k': return -1 ...

0.507997

from itertools import groupby def replace(s): queue, rle = {}, [[i, k, len(list(g))] for i, (k, g) in enumerate(groupby(s))] for i, k, l in reversed(rle): if l not in queue: queue[l] = {} queue[l].setdefault(k, []).append(i) for l in queue: while sum(map(bool, queue[l].values())) > ...

0.507874

class Solution: def findLength(self, A, B): def check(length): seen = {A[i:i+length] for i in range(len(A) - length + 1)} return any(B[j:j+length] in seen for j in range(len(B) - length + 1)) A = ''.join(map(chr, A)) ...

0.50751

def f(x): z=[0 for i in range(len(x))] l=0 r=0 for i in range(1,len(x)): if i<=r: z[i]=min(z[i-l],r-i+1) while i+z[i]<len(x) and x[z[i]]==x[i+z[i]]: z[i]+=1 if i+z[i]-1>r: l,r=i,i+z[i]-1 return z a=list(map(int,input('').split())) n,a,b=a[0...

0.50517

A car travels from a starting position to a destination which is target miles east of the starting position. Along the way, there are gas stations. Each station[i] represents a gas station that is station[i][0] miles east of the starting position, and has station[i][1] liters of gas. The car starts with an infinite ta...

class Solution: def minRefuelStops(self, target: int, startFuel: int, stations: List[List[int]]) -> int: if startFuel >= target: return 0 heap = [] #record the reachable gas for now stop = 0 #total stops dist = startFuel #reachable distance for d, g in stations: i...

0.855577

class Solution: def canCompleteCircuit(self, gas, cost): """ :type gas: List[int] :type cost: List[int] :rtype: int """ if sum(gas) < sum(cost): return -1 Rest = 0 index = 0 for i in range(len(gas)): Rest += ...

0.712406

import re,sys def isCirlePossible(juices,distances): if juices == [] or distances == []: return -1; total_juice_consumed = 0 juice_consumed = 0 start=0 for i in range(0,len(juices)): diff = juices[i] - distances[i] if juice_consumed >= 0: juice_consumed += diff else: juice_consumed = diff start = ...

0.650768

from collections import deque class Solution: def minJumps(self, arr: list) -> int: if len(arr) == 1: return 0 graph = {} for i, n in enumerate(arr): if n in graph: graph[n].append(i) else: graph[n] = [i] c...

0.621273

destination, max_gas_tank_volume, gas_prices_number = list(map(int, input().split())) start_point = 0 gas_prices = {start_point:0} for i in range(gas_prices_number): coordinate, price = list(map(int, input().split())) gas_prices[coordinate] = price points = sorted(list(gas_prices.keys()), reverse = True) curren...

0.613988

class Solution: def minSumOfLengths(self, arr: List[int], target: int) -> int: i, window, result = 0, 0, float('inf') premin = [float('inf')]*len(arr) for j, num in enumerate(arr): window += num while window > target: window -= arr[i] i...

0.60985

class Solution: def minTaps(self, n: int, ranges: List[int]) -> int: for i,r in enumerate(ranges): l = max(0,i-r) ranges[l] = max(i+r, ranges[l]) res = lo = hi = 0 while hi < n: lo, hi = hi, max(ranges[lo:hi+1]) if hi =...

0.607803

class Solution: def minOperationsMaxProfit(self, customers: List[int], boardingCost: int, runningCost: int) -> int: if runningCost >= 4 * boardingCost: return -1 result = sum(customers) // 4 if (sum(customers) % 4) * boardingCost > runningCost: result += 1 for...

0.604561

from collections import defaultdict class Solution: def numBusesToDestination(self, routes: List[List[int]], S: int, T: int) -> int: if S == T: return 0 # sequence_to_route_id dict # if when adding sequence ids to this dict, they are part of another route, # merge them ...

0.595392

import itertools import math import random import time def timer(f): def tmp(*args, **kwargs): t = time.time() res = f(*args, **kwargs) print("Время выполнения функции: %f" % (time.time()-t)) return res return tmp def genArray(length, lower, upper): return [random.randint(...

0.586746

class Solution: def findMinMoves(self, machines): """ :type machines: List[int] :rtype: int """ if sum(machines) % len(machines) != 0: return -1 mean = sum(machines) // len(machines) cum, step = 0, 0 for x in machines: ...

0.586601

class Solution: def coinChange(self, coins: List[int], amount: int) -> int: coins.sort(reverse=True) n, res = len(coins), amount + 1 def dfs(index, target, cnt): nonlocal res if cnt + (target + coins[index] - 1) // coins[index] >= res: return ...

0.574653

class Solution: def minCost(self, houses: List[int], Cost: List[List[int]], m: int, n: int, target: int) -> int: @lru_cache(None) def dfs(i, j, k): if i == len(houses): if j == target: return 0 else: return float('in...

0.573525

n, k = list(map(int, input().split())) x = list(map(int, input().split())) ro = list(x[i] - x[i - 1] for i in range(1, n)) if max(x[i] - x[i - 1] for i in range(1, n)) > k: print(-1) else: ans = 1 r = 0 for el in ro: r += el if r > k: ans += 1 r = el pri...

0.565723

class Solution: def videoStitching(self, clips: List[List[int]], T: int) -> int: clips.sort(key=lambda x: [x[0], -x[1]]) res = 0 r = 0 new_r = 0 # print(clips) for s, e in clips: if s <= r: new_r = max(new_r, e) elif...

0.564242

# Question B. Road to Cinema import sys def roadToCinema(V, S, T, stations): # O(M) """ V : volume of fuel tank S : total distance T : time limit stations: fuel stations' locations rtype : boolean, whether this aircraft can travel within the time limit """ m = len(s...

0.562862

# import collections, atexit, math, sys from functools import cmp_to_key #key=cmp_to_key(lambda x,y: 1 if x not in y else -1 ) sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) import bisect try : #raise ModuleNotFoundError import numpy def dprint(*args...

0.562698

from collections import defaultdict, deque n = int(input()) adj = [[] for _ in range(n)] v = [0] * n l = list(map(int, input().split())) for i, f in enumerate(l): adj[f - 1].append(i + 1) s = list(map(int, input().split())) Q = deque([(0, s[0], s[0])]) ans = 0 flag = False possible = True while Q and possible: ...

0.562193

rd = lambda: list(map(int, input().split())) n, s, t = rd() p = rd() for i in range(n): if s == t : print(i); return s = p[s-1] print(-1)

0.560514

def floo(num, k): return (num - 1) // k + 1 def main(): n, m = map(int, input().split()) low = 1 high = 10**9 if (m == 0): if (n == 1): print(1) else: print(-1) return for i in range(m): k, f = map(int, input().split()) low = max(low, (k + f - 1) // f) if (f > 1): high = min(high, (k - 1) ...

0.55899

def main(): n = int(input()) a = list(map(int, (x for x in input()))) b = list(map(int, (x for x in input()))) x = [0] * (n - 1) x[0] = b[0] - a[0] for i in range(1, n - 1): x[i] = b[i] - a[i] - x[i - 1] if a[n - 1] + x[n - 2] != b[n - 1]: print(-1) return cnt = s...

0.558071

# import collections, atexit, math, sys from functools import cmp_to_key #key=cmp_to_key(lambda x,y: 1 if x not in y else -1 ) sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) import bisect try : #raise ModuleNotFoundError import numpy def dprint(*args...

0.558046

""" Codeforces Round 251 Div 2 Problem A Author : chaotic_iak Language: Python 3.3.4 """ def read(mode=2): # 0: String # 1: List of strings # 2: List of integers inputs = input().strip() if mode == 0: return inputs if mode == 1: return inputs.split() if mode == 2: ...

0.5562

def solve(arr): res = [] for first in (arr[0]-1, arr[0], arr[0]+1): for second in (arr[1]-1, arr[1], arr[1]+1): val, step, count = second, second-first, abs(arr[0]-first) + abs(arr[1]-second) for current in arr[2:]: val += step if abs(val-current) ...

0.554513

k = int(input().split()[1]) a = [int(s) for s in input().split()] b = [int(s) for s in input().split()] ambk = [(a[i], a[i] - b[i]*k) for i in range(len(a))] ambk.sort(key=lambda a:-a[1]) ts = [0]*(100*100) keys = [0] atras = list(range(100*100 -1, -1, -1)) adelante = list(range(100*100)) for i in range(len(a)): for...

0.553774

#!/bin/python n, k = list(map(int, input().split())) p = list(map(int, input().split())) a, b = 0, 0 for i in range(n): a += p[i] x = min(8, a) b += x a -= x if b >= k: print(i+1) break else: print(-1)

0.553574

H, n = list(map(int, input().split())) d = list(map(int, input().split())) t = 0 miPt = H for a in d: t += 1 H += a miPt = min(miPt, H) if H <= 0: print(t) return if sum(d) >= 0: print(-1) return jump = max(0, miPt // -sum(d) - 2) H -= jump * -sum(d) t += n * jump for i in range(10000000000000000...

0.550836

r = open('input.txt') w = open('output.txt', mode='w') f = lambda: map(int, r.readline().split()) f() a, b = f() if a > b: a, b = b, a n = 40001 u, v = [n] * n, [n] * n x = s = 0 u[0] = v[0] = 0 for y in f(): s += y p = [] h = min(x, y) for d in range(min(s, a), max(0, s - b - y) - 1, -1): t ...

0.550787

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): print(*args, **kwargs, file=sys.stderr) dprint('debug mode') except ...

0.550525

# class Solution: # def specialArray(self, nums: List[int]) -> int: # nums.sort(reverse=True) # left, right = 0, len(nums) # while left < right: # mid = left + (right - left) // 2 # if mid < nums[mid]: # left = mid + 1 # else: # ...

0.550157

class Solution: def findBestValue(self, arr: List[int], target: int) -> int: arr.sort() n = len(arr) for i in range(n): sol = round(target / n) if arr[i] >= sol: return sol target -= arr[i] n -= 1 return arr[-1]

0.549307

def doit(): xx = input().split() n = int(xx[0]) s = int(xx[1]) v = [int(k) for k in input().split()] S = sum(v) newS = S - s if newS < 0: return -1 return min(newS//n, min(v)) print(doit())

0.548709

from collections import defaultdict n, m = list(map(int, input().split())) ns = list(map(int, input().split())) ms = list(map(int, input().split())) summs = sum(ms) target = { i: m for i, m in enumerate(ms, 1) } remain = set(i for i, m in list(target.items()) if m != 0) count = defaultdict(int) a = 0 b = ...

0.547313

import sys import math import bisect import heapq import collections S = input() T = input() lenS = len(S) lenT = len(T) F1 = [False]*26 F2 = [False]*26 alpha = 'abcdefghijklmnopqrstuvwxyz' for i in range(lenS): F1[alpha.index(S[i])] = True for i in range(lenT): F2[alpha.index(T[i])] = True for i in range(26):...

0.545813

class Solution: def minSubarray(self, nums: List[int], p: int) -> int: need = sum(nums) % p if need == 0: return 0 pos = {0: -1} total = 0 ans = float('inf') for i, num in enumerate(nums): total = (total + num) % p target = (total -...

0.545484

n, m = [int(x) for x in input().split()] a = [int(x) for x in input().split()] a.sort(reverse=True) def check(d): s=0 for i in range(len(a)): s+=max(0,a[i]-i//d) return s>=m if sum(a)<m: print(-1) else: l, r = 1,n mid = l+r>>1 while l<r: if check(mid): r=mid ...

0.543752

from functools import reduce from math import gcd def survivor(a): """Round Robin by Bocker & Liptak""" def __residue_table(a): n = [0] + [None] * (a[0] - 1) for i in range(1, len(a)): d = gcd(a[0], a[i]) for r in range(d): try: nn = m...

0.541106

def peak(arr): for i, val in enumerate(arr): if sum(arr[:i]) == sum(arr[i+1:]): return i return -1

0.538309

n = int(input()) T = input().split(' ') for i in range(n): T[i] = int(T[i]) m = n+1 if n == 1: print(0) else: for a in range(-1, 2): for b in range(-1, 2): c = True p = (T[1]+b) - (T[0]+a) tot = 0 if a!=0: tot+=1 if b!=0: ...

0.537322

n,m = list(map(int,input().split())) A = list(map(int,input().split())) B = list(map(int,input().split())) sums = sum(B)+len(B) last = [-1] * m cou = 0 ans = 0 per = 0 for j in range(n): if A[j] == 0: cou +=1 else: if last[A[j]-1] == -1: if j >= B[A[j]-1]: ...

0.53689

def total_kilometers(cons, petrol): return round(100*petrol/cons, 2) def check_distance(dist, cons, petrol): return ("You will need to refuel" if dist > total_kilometers(cons, petrol) else [ [n*100, dist-100*n, round(petrol-cons*n, 2)] for n in range(dist//100+1)])

0.533043

n=int(input()) a=[list(map(int,input().split())) for i in range(n)] solved=[0 for i in range(5)] score=[0 for i in range(5)] for i in range(n): for j in range(5): solved[j]+=int(a[i][j]>-1) for k in range(31*n+1): for i in range(5): tot=n+k cur=solved[i] if a[0][i]>-1 and a[1][i]>-1 and a[0][i]>a[1][i]: cu...

0.532516

from math import inf n=int(input()) a = input() a= [int(i) for i in a.split()] s =input() s = [int(i) for i in s.split()] ans = inf for j in range(1 , n-1): ll , lr = inf , inf for q in range(j+1,n): if a[j]<a[q]: lr = min(lr , s[q]) for q in range(j): if a[j]>a[q]: ...

0.531762

class Solution: def dominantIndex(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) <= 1: return 0 m = max(nums) ind = nums.index(m) del nums[ind] m_2 = max(nums) return ind if m >= 2*m_2 else -...

0.530947

n, s, k = list(map(int, input().split())) amounts = list(map(int, input().split())) colors = list(input()) dp = [[-1 for j in range(k + 1)] for i in range(n)] def getAns(nth, left): if left <= 0: return 0 if dp[nth][left] >= 0: return dp[nth][left] ret = 999999999 for i in range(n...

0.530389

# AC import sys class Main: def __init__(self): self.buff = None self.index = 0 def __next__(self): if self.buff is None or self.index == len(self.buff): self.buff = sys.stdin.readline().split() self.index = 0 val = self.buff[self.index] self.in...

0.530345

n, d = map(int, input().split()) line = list(map(int, input().split())) pref = [0] * n maxx = 0 for i in range(n): pref[i] = pref[max(i - 1, 0)] + line[i] maxx = max(maxx, pref[i]) maxr = [0] * n for i in range(n - 1, -1, -1): if i == n - 1: maxr[i] = pref[i] else: maxr[i] = max(maxr[i +...

0.530333

for _ in range(int(input())): lasts = {} ans = n = int(input()) for i, a in enumerate(input().split()): if a in lasts: ans = min(ans, i - lasts[a]) lasts[a] = i ans += 1 if ans > n: ans = -1 print(ans)

0.529619

def mini(arr, n, k): lo = [0 for i in range(n + 1)] o = -1 for i in range(n): if (arr[i] == 1): o = i lo[i] = o a= 0; i = 0 while(i < n): pos = lo[min(i + k - 1, n - 1)] if (pos == -1 or pos + k <= i): return -1 i = pos + k a+= 1 return a n,k=list(map(int,input().split())) arr=[int(i)...

0.529116

#!/usr/bin/env python3 def solve(): n, k = list(map(int, input().split())) temps = list(map(int, input().split())) summer_seqs = [] winter_seqs = [] cur_season = 1 cur_len = 0 for t in temps: # print("Handling", t) if cur_season * t > 0 or (t == 0 and cur_season == 1): ...

0.528969

def list_input(): return list(map(int,input().split())) def map_input(): return map(int,input().split()) def map_string(): return input().split() a,b,f,k = map_input() tot = a*k s = 2*a-f cur = 0 cnt = b go = 0 ans = 0 while cur < tot: go = 1-go if(go == 1): if cnt < s and cnt < tot-cur: if(cnt ...

0.528905

from fractions import gcd def min_price(nums): nums.sort() ns = [0] + [float('inf')] * (nums[0] - 1) for c in nums[1:]: d = gcd(nums[0], c) for r in range(d): n = min(ns[r::d], default=float('inf')) if n < float('inf'): for j in range(nums[0] // d): ...

0.526928

from collections import deque class Solution: def minCost(self, grid: List[List[int]]) -> int: right, left, down, up = (0, 1), (0, -1), (1, 0), (-1, 0) direction_map = { 1: right, 2: left, 3: down, 4: up } directions ...

0.525105

n = int(input()) a = list(map(int, input().split())) m = int(input()) b = list(map(int, input().split())) ptra = 1 ptrb = 1 sa = a[0] sb = b[0] ans = 0 while ptra != n and ptrb != m: if sa == sb: ans += 1 sa = a[ptra] sb = b[ptrb] ptra += 1 ptrb += 1 continue ...

0.524191

class Solution: def searchRange(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] """ start = self.firstGreaterEqaul(nums, target) if start==len(nums) or nums[start]!=target: return [-1, -1] return...

0.522407

__author__ = 'Pavel Mavrin' n, m = [int(x) for x in input().split()] a = [] for i in range(m): a.append([int(x) - 1 for x in input().split()]) a.sort(key=lambda x: x[0] * n + x[1]) a.append([n - 1, n]) d = [[0, 1]] r = 0 i = 0 while i < len(a): if a[i][0] == r: dd = [] j = 0 while i <...

0.521824

n = int(input()) a = list(map(int, input().split())) mx = -1 for step, elem in enumerate(a): if elem > mx + 1: print(step + 1) return else: mx = max(mx, elem) print(-1)

0.521656

## ## ## import sys def line(): return sys.stdin.readline() def numbers(): return list(map(int, line().split())) def number(): return int(line()) adjlist = {} n, k = 0, 0 mark = [False]*2010 edges = [False]*1010 # bfs for "ssph" def bfs(s): i = 0 frontier = [s] while frontier: ...

0.520203

import collections class Solution: def shortestSubarray(self, A: List[int], K: int) -> int: cum_sum = 0 queue = collections.deque([(-1, 0)]) result = len(A) + 1 for i, v in enumerate(A): cum_sum += v if v > 0: # find any matches and remove...

0.520096

# O(M*N*K) class Solution: def shortestPath(self, grid: List[List[int]], k: int) -> int: rows, cols = len(grid), len(grid[0]) steps, min_steps = 0, rows + cols - 2 if k >= min_steps - 1: return min_steps visited = [[-1] * cols for _ in range(rows)] visited[0][0] ...

0.519424

class Solution: def maxNonOverlapping(self, nums: List[int], target: int) -> int: sum_set = set() sum_set.add(0) temp = 0 count = 0 for num in nums: temp += num if temp - target in sum_set: count += 1 sum_set.clear() ...

0.519188

class Solution: def distanceBetweenBusStops(self, distance: List[int], start: int, destination: int) -> int: if start > destination: start, destination = destination, start sum1 = sum(distance[start:destination]) sum2 = sum(distance) - sum1 ...

0.517472

class Solution: def jump(self,nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 1: return 0 else: step = 0 pos = 0 while pos != len(nums) - 1: bestStep = -1 bes...

0.517313

import sys import itertools inputs = sys.stdin.read().split() len_string = int(inputs[0]) desired_size = int(inputs[1]) string = inputs[2] size = 0 cost = 0 cur_set = set() cur_set.add(string) for i in range(len_string, -1, -1): cur_size = len(cur_set) if size+cur_size >= desired_size: cost += (desire...

0.516158

class Solution: def search(self, nums, target): """ :type nums: List[int] :type target: int :rtype: int """ # left = 0 # right = len(nums) - 1 # while left <= right: # mid = int((left + right)/2) # if nums[mid] == ta...

0.515964

def finding_k(arr): for n in range(max(arr)-1, 0, -1): if len({ x%n for x in arr }) == 1: return n return -1

0.515721

class Solution: def frogPosition(self, n: int, edges: List[List[int]], t: int, target: int) -> float: tree = dict() for i, j in edges: if i > j: i, j = j, i tree.setdefault(i - 1, []).append(j - 1) queue, time = [(0, 1)], 0 # node-prob while queue and time <= t: # bfs tmp = [] ...

0.515205

class Solution: def carFleet(self, target: int, position: List[int], speed: List[int]) -> int: if not position: return 0 posToSpeed = {position[i]: speed[i] for i in range(len(position))} position.sort() leaderTime = (target - position[-1]) / posToSpeed[...

0.514576

import sys from collections import defaultdict input = lambda : sys.stdin.readline().strip() write = lambda x: sys.stdout.write(x) n = int(input()) arr = sorted([(j, i + 1) for i, j in enumerate(map(int, input().split()))]) if n <= 3: print(arr[0][1]) return a1, a2, a3 = arr[0][0], arr[1][0], arr[2][0] c1, c2,...

0.514067

from math import inf n, p = [int(x) for x in input().split()] l = [] for i in range(n): a, b = [int(x) for x in input().split()] l.append((a, b, b/a)) l.sort(key=lambda x: x[2]) asum = 0 bsum = 0 sumt = 0 for i in range(n): a0, b0, _ = l[i] c1 = inf if i == n-1 else l[i+1][2] asum += a0 bsum += ...

0.513951

from heapq import heapify, heappush, heappop class DinnerPlates: # index * cap -> access start of stack at index # index * cap + (cap - 1) -> access last element of stack at index def __init__(self, capacity: int): self.stack = [] # just one array to simulate all the stacks ...

0.513702

'''input 4 2 1001 ''' def list_input(): return list(map(int,input().split())) def map_input(): return map(int,input().split()) def map_string(): return input().split() n,d = map_input() s = input() cur = 0 cnt = 0 while cur < n-1: j = -1 for i in range(cur+1,min(cur+d+1,n)): if s[i] == '1': j = i ...

0.512818

from math import ceil def mega_mind(hp, dps, shots, regen): if dps*shots >= hp: return ceil(hp / dps) if dps*shots <= regen: return -1 number_of_regenerations = ceil((hp - dps*shots) / (dps*shots - regen)) return ceil((hp + regen*number_of_regenerations) / dps)

0.512396

n = int(input()) k1 = list(map(int, input().split()[1:])) k2 = list(map(int, input().split()[1:])) i = 0 while True: if len(k1) == 0 or len(k2) == 0: break if i > 10000: break if k1[0] > k2[0]: k1 = k1[1:] + k2[0:1] + k1[0:1] k2 = k2[1:] else: k2 = k2[1:] + k1[0:...

0.511399

n = int(input()) a = list(map(int, input().split())) mn = 10000000000 ans = -1 from math import ceil for i in range(n): b = a[i] - i c = int(ceil(b / n)) cc = n*c if n*c < mn: mn = n*c ans = i+1 print(ans)

0.511298

t, sx, sy, ex, ey = map(int, input().split()) d = {'W':max(0, sx - ex), 'E':max(0, ex - sx), 'N':max(0, ey - sy), 'S':max(0, sy - ey)} for (i, c) in enumerate(input(), 1): if d[c] > 0: d[c] -= 1 if any(d.values()) == False: print(i) break else: print(-1)

0.51045

N=int(input()) a=list(map(int,input().split())) cnt=0 for i in range(N): if cnt+1==a[i]: cnt+=1 if cnt==0: print((-1)) else: print((N-cnt))

0.509191

class Solution: def maxDistToClosest(self, seats: List[int]) -> int: ans = 0 for seat, group in itertools.groupby(seats): if not seat: k = len(list(group)) ans = max(ans, (k+1)//2) return max(ans, seats.index(1),seats[::-1].index(1))

0.508322

n = int(input()) c = list(map(int, input().split(" "))) nodes = dict() nodes[""] = 0 # print(nodes) depth = 0 while depth < n: # expand new_nodes = dict() s = input() for node in nodes.keys(): if s >= node: # not reverse if s in new_nodes: new_nodes[s] = min(new_nodes[s], nodes[node]) else: new...

0.508187

def check(n, casas): #print('n:',n) nonlocal T,N,street current = n time = T need = 0 last_house = 0 for ind, i in enumerate(street): time -= 1 if i == 'S': current += 1 elif i == 'H': need += 1 if need =...

0.507797

def solve(n, l, s, www, children): ans = 0 dp = [{} for _ in range(n)] for v in range(n - 1, -1, -1): cv = children[v] if not cv: dp[v][1] = www[v] continue ans += len(cv) - 1 wv = www[v] if wv > s: return -1 dv = dp[v] ...

0.506836

n = int(input()) s = sum(list(map(int, input().split()))) m = int(input()) for i in range(m): l, r = list(map(int, input().split())) s = max(s, l) if l <= s <= r: print(s) return print(-1)

0.505599

n,k,a = map(int,input().split()) m = int(input()) x = [int(y) for y in input().split()] def check(K): used = [0]*(n+1) for i in range(K): used[x[i]] = 1 for i in range(1,n+1): used[i]+=used[i-1] have = 0 i = a while i<n+1: if used[i]-used[i-a]==0: have+=1 ...

0.505271

import heapq from collections import defaultdict def shortest(N, edge): ver, inf = defaultdict(list), 10**10 for e in edge: ver[e[0]].append(e[1:]) dist = {i:inf for i in range(N)} dist[0], pq = 0, [] heapq.heappush(pq, [dist[0], 0]) while pq: u_dis, u_node = heapq.heappop(pq) ...

0.503932

from collections import defaultdict class RobotRapping(): def __init__(self, n, m, battles): self.n, self.m = n, m self.battles = battles def generate_graph(self, k): edge_map = defaultdict(list) rev_map = defaultdict(list) for i in range(k): edge_map[self....

0.503364

import re import itertools from collections import Counter, deque class Task: a = [] d = 0 answer = 0 def getData(self): n, m, self.d = [int(x) for x in input().split(' ')] for _ in range(n): self.a += [int(x) for x in input().split(' ')] #inFile = open('input.txt'...

0.501815

def outOfIndex(boys,girls,COST): if COST == 0: return len(boys) else: total_cost = [ abs(x-y) for x,y in zip(boys,girls)] total_cost = sum(total_cost) return total_cost for _ in range(int(input())): COST = int(input()) queue = input() B = queue.count('B') G = queue.count('G') boys=[] girls = [] if (ab...

0.501521

def main(): N, K = list(map(int, input().split())) Apples = [int(x) for x in input().split()] time = 0 # answer # Apples_encountered = [None] # Binary Search Tree distinct_apples_condition = None if K & 1 else K >> 1 already_found = [False] * K for i in range((N >> 1) + 1): time += 1 for k in ...

0.500421

l = 0 r = -1 segL, time = [int(x) for x in input().split()] a = [int(x) for x in input().split()] segSum = 0 segments = [] ##while r < segL-1: ## r += 1 ## segSum += a[r] ## if segSum == time: ## segments.append(r+1-l) ## elif segSum > time: ## segments.append(r-l) ## while segSum > ...

0.500334

for _ in range(int(input())): n, x = list(map(int, input().split())) A = [] for _1 in range(n): d, h = list(map(int, input().split())) A.append([d, h]) A.sort(reverse=True) if A[0][0] >= x: print(1) else: x -= A[0][0] mz = 0 for d, h in A: ...

0.500093

from sys import stdin from heapq import heappop,heappush def main(): n,k = map(int,stdin.readline().split()) X = list(map(int,stdin.readline().split())) A = int(stdin.readline().strip()) C = list(map(int,stdin.readline().split())) l = list() i = 0;g = k;ans = 0;flag = True while i < n and flag: heappush(l,C[i...

0.499647

class Solution: def pivotIndex(self, nums): """ :type nums: List[int] :rtype: int """ left, right = 0, sum(nums) for index, num in enumerate(nums): right -= num if left == right: return index left += num ...

0.499606

class Solution: def minSwaps(self, grid: List[List[int]]) -> int: start=1 swap=0 n=len(grid) zeros_ingrid=n-1 while zeros_ingrid>0: swapped_grid=False for i in range(len(grid)): if sum(grid[i][start:])==0: swap+=i ...

0.499285

class Solution: def minPushBox(self, grid: List[List[str]]) -> int: m, n, g = len(grid), len(grid[0]), collections.defaultdict(list) for i in range(m): for j in range(n): g[grid[i][j]] += [complex(i, j)] def f(b, s): nonlocal time ...

0.498554

import sys input = sys.stdin.readline sys.setrecursionlimit(10 ** 7) import numpy as np # 適当な素数と原始根でrolling hash MOD = 10 ** 9 + 993 base = 123450 S = np.array([ord(x) for x in input().rstrip()],dtype=np.int64) T = np.array([ord(x) for x in input().rstrip()],dtype=np.int64) # Sの方が長くする LS = len(S) LT = len(T) n = (L...

0.498065

import numpy as np def f(b, n): s = 0 while n > 0: s += n % b n //= b return s INF = 10**15 def solve(n, s): if n == s: return n+1 m = int(np.sqrt(n)) + 1 for b in range(2, m+1): if f(b, n) == s: return b best = INF for p in range(1, m+10): ...

0.497561

class Solution: def findLatestStep(self, arr: List[int], m: int) -> int: A = arr if m == len(A): return m length = [0] * (len(A) + 2) res = -1 for i, a in enumerate(A): left, right = length[a - 1], length[a + 1] if left == m or right == m:...

0.496988

m = 301000 ns = [0] * m es = [0] * m c = [0] * m b = [0] * m t = [0] * m P = 0 def add(b, k): k = t[k] while k: e = es[k] if b[-1] > e: b[-1] = e b[e] += 1 k = ns[k] def delete(b): for i in range(b[m - 1], m + 1): if b[i]: b[i] -= 1 b[-1] = i ...

0.495798

def Solve(x,B): if((X,x,B) in Mem): return Mem[(X,x,B)] if(len(B)>X): return False if(x==len(L)): return True if(Form(L[x],B)): A=list(B) for e in range(len(B)): r=A[e] A[e]=L[x] if(Solve(x+1,tuple(sorted(A)))): ...

0.495365

from collections import defaultdict from bisect import bisect_left, bisect_right class MajorityChecker: def __init__(self, arr: List[int]): self.num_idx_dict = defaultdict(list) for idx, number in enumerate(arr): self.num_idx_dict[number].append(idx) self.candidates = sorted(se...

0.494712

from heapq import * from itertools import starmap from collections import deque, namedtuple Army = namedtuple('Army', 'i,q') Soldier = namedtuple('Soldier', 'i,speed') def queue_battle(d, *args): armies = [ Army(i, deque(starmap(Soldier,enumerate(q))) ) for i,q in enumerate(args)] bullets = [[] for _ in ...

0.492382

Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times) with the following restrictions: You may not engage in multiple...

class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ n = len(prices) if n < 2: return 0 sells = [0] * n buys = [0] * n buys[0] = -prices[0] for i in ...

0.743172

class Solution: def maxProfit(self, prices): profits = 0 ln = len(prices) if not ln: return 0 elif ln == 2: return (prices[1]-prices[0]) if prices[1] > prices[0] else 0 lastPrice = prices[0] for price in prices: if lastPr...

0.734602

class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ tmax_profit = 0 rmax_profits = [0] * len(prices) rmax = -1 for ii in range(len(prices)-2, -1, -1): if (prices[rmax] - prices[ii] > rmax_profi...

0.711299

class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ n = len(prices) if n <=1: return 0 else: minprice = prices[0] res = 0 for i in range(1,n): if ...

0.70236

def max_profit(prices): m = best = float('-inf') for v in reversed(prices): m, best = max(m, best-v), max(best,v) return m

0.664561

class Solution: def maxProfit(self, k, prices): """ :type k: int :type prices: List[int] :rtype: int """ length = len(prices) v = p = 0 pairs, profits = [], [] while p < length: v = p ...

0.626756

class Solution: def deleteAndEarn(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums);#count is a dict [3,4,2]--> {2:1,3:1,4:1} prev = None; avoid = using = 0; for k in sorted(count): temp = ma...

0.600428

class Solution: def rob(self, nums): """ :type nums: List[int] :rtype: int """ if not nums: return 0 if len(nums)==1: return nums[0] return max(self.helper(nums[1:]), self.helper(nums[:-1])) def helper(self,nums...

0.597058

def calc(a): res = [0] * (len(a) + 1) for k in range(len(a)): res = [2 * max(a[i] + res[i+1], a[i+k] + res[i]) for i in range(len(a) - k)] return res[0]

0.580407

class Solution: def maxSubArray(self, nums): """ :type nums: List[int] :rtype: int """ # i = 0 # i_keep = 0 # j = 1 # j_keep = 1 # max_sum = nums[0]-1 # while j < len(nums) and i < j: # temp_sum = sum(nums[i:j]) ...

0.575812

class Solution: def PredictTheWinner(self, nums): """ :type nums: List[int] :rtype: bool """ if not nums: return True n = len(nums) if n & 1 == 0: return True dp = [0] * n for i in range(n-1, -1, -1): for j in r...

0.565895

class Solution: def rob(self, nums: List[int]) -> int: if not nums: return 0 if len(nums) < 3: return max(nums) dp = [0] * len(nums) dp[0] = nums[0] dp[1] = max(nums[0], nums[1]) for i in range(2, len(nums)): dp[i] = max(dp...

0.549293

class Solution: def getMaxLen(self, nums: List[int]) -> int: maxx = 0 nums.append(0) # starting position # where we find a 0 i = -1 minusarr = [] for j,n in enumerate(nums): if n == 0: # now figure out previous one...

0.544303

def longest_slide_down(p): res = p.pop() while p: tmp = p.pop() res = [tmp[i] + max(res[i],res[i+1]) for i in range(len(tmp))] return res.pop()

0.540144

def array_operations(a, n): li = [] for i in range(n): m = max(a) a = [m-i for i in a] if a in li: if not n & 1 : return li[-1] return a li.append(a) return a

0.533021

def largest_sum(arr): sum = max_sum = 0 for n in arr: sum = max(sum + n, 0) max_sum = max(sum, max_sum) return max_sum

0.531617

def maximum_product(arr): if arr.count(0) > 1: return min(arr) neg = [n for n in arr if n < 0] pos = [n for n in arr if n >= 0] if len(neg) % 2: return min(neg) if 0 in arr else max(neg) else: return min(pos) if pos else min(neg)

0.515461

def least_bribes(bribes): mem = {} def s(n1, n2): if n1 >= n2: return 0 if (n1, n2) in mem: return mem[n1, n2] r = min(bribes[i] + max(s(n1, i), s(i + 1, n2)) for i in range(n1, n2)) mem[n1, n2] = r return r return s(0, len(bribes))

0.508035

class StockSpanner: def __init__(self): self.s=[] def next(self, price: int) -> int: stk=self.s curr_span=1 while stk and stk[-1][0]<=price: #curr_price is > stack[-1][0] prev_price,prev_span=stk.pop() curr_span+=prev_span stk.a...

0.50777

def flipping_game(num): current = 0 biggest = 0 for i in num: current = max(0, current - ( i or -1 ) ) biggest = max(biggest, current) return sum(num) + (biggest or -1)

0.50455

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def currentmax(self,root): leftval = 0 if root.left != None: leftval = self.currentmax(root.left) leftval = 0 if leftv...

0.502392

from functools import * class Solution: def stoneGameII(self, arr): a =[] s=0 n = len(arr) for i in arr[::-1]: s+=i a.append(s) a=a[::-1] @lru_cache(None) def fun(i,m): if i+2*m>=n:return a[i] mn = inf ...

0.502047

class Solution: def maxProduct(self, nums): """ :type nums: List[int] :rtype: int """ def prod(nums): #function to calculate product prod = 1 for i in nums: prod*=i return prod def listsplit(l...

0.499731

def adjacent_element_product(array): return max( a*b for a, b in zip(array, array[1:]) )

0.496861

class Solution: def jump(self,nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 1: return 0 else: step = 0 pos = 0 while pos != len(nums) - 1: bestStep = -1 bes...

0.495766

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.489879

class Solution: def findMaxConsecutiveOnes(self, nums): """ :type nums: List[int] :rtype: int """ if nums == []: return 0 count = 0 countMax =0 for ele in nums: if ele == 1: count += 1 ...

0.487308

class Solution: def findLengthOfLCIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) < 1: return 0 cur_len = 1 max_len = 1 for i in range(1,len(nums)): if nums[i] > nums[i-1]: cur_...

0.484743

class Solution: def arrayPairSum(self, nums): """ :type nums: List[int] :rtype: int """ nums.sort() return sum(nums[::2])

0.483394

class Solution: def largestRectangleArea(self, heights): """ :type heights: List[int] :rtype: int """ if not heights: return 0 stack = [0] heights.append(0) # print(heights) max_area = 0 for i in range(...

0.481958

def target_game(values): a = b = 0 for n in values: a, b = b, max(a + n, b) return max(a, b)

0.481173

class Solution: def maxValueAfterReverse(self, nums: List[int]) -> int: n = len(nums) base = sum([abs(nums[i] - nums[i+1]) for i in range(n - 1)]) if (n <= 2): return base #best = base #for i in range(n-1): # for j in range(i+1, n): # ...

0.478824

class Solution: def trap(self, height): """ :type height: List[int] :rtype: int """ if not height: return 0 result = 0 left = 0 right = len(height) - 1 while left < right: if height[left] <= height[right]: ...

0.476409

class Solution: def minStartValue(self, nums: List[int]) -> int: res = 1 for ind,n in enumerate(nums): temp = 1-sum(nums[:ind+1]) if(temp > res): res = temp return res

0.475218

class Solution: def maxSubarraySumCircular(self, A: List[int]) -> int: N = len(A) if(N==0): return 0 curr_max = A[0] global_max = A[0] curr_min = A[0] global_min = A[0] flag = 0 if(A[0]>=0): flag=1 for i in range(1...

0.472566

class Solution: def jobScheduling(self, startTime: List[int], endTime: List[int], profit: List[int]) -> int: # max profit ending at time t dp = [(0,0)] task = [(startTime[i], endTime[i], profit[i]) for i in range(len(startTime))] task = sorted(task, key = lambda x: ...

0.472284

class Solution: def maxScoreSightseeingPair(self, A: List[int]) -> int: curmaxsight = A[0] - 1 curmaxpair = 0 for sight in A[1:]: if sight + curmaxsight > curmaxpair: curmaxpair = sight + curmaxsight if sight > curmaxsight: curmaxsight ...

0.470142

def largest_sum(s): return max(sum(map(int,x)) for x in s.split('0'))

0.469826

class Solution: def wiggleMaxLength(self, arr): """ :type nums: List[int] :rtype: int """ n = len(arr) if n < 2: return n wsl = [0]*n wsl[0] = 1 for cur in range(1, n): prev = cur - 1 ...

0.469487

from itertools import accumulate def tram(stops, descending, onboarding): return max(accumulate(o - d for d, o in zip(descending[:stops], onboarding)))

0.468546

class Solution: def arrayNesting(self, nums): """ :type nums: List[int] :rtype: int """ best = 0 n = len(nums) p = [] for i in range(len(nums)): j = i current = 0 while nums[j] != -1: cur...

0.46851

def sum_array(arr): if arr == None or len(arr) < 3: return 0 return sum(arr) - max(arr) - min(arr)

0.464294

def array_manip(array): return [min([a for a in array[i+1:] if a > array[i]], default=-1) for i in range(len(array))]

0.463762

class Solution: def maxSumAfterPartitioning(self, arr, k): res = [0] for idx, val in enumerate(arr): max_val, cur_val = 0, 0 for i in range(max(0, idx-k+1), idx+1)[::-1]: if arr[i] > max_val: max_val =...

0.462037

class Solution: def candy(self, ratings): """ :type ratings: List[int] :rtype: int """ if not ratings: return 0 total, pre, decrease = 1, 1, 0 for i in range(1, len(ratings)): if ratings[i] >= ratings[i-1]: ...

0.461404

def luxhouse(houses): return [max(0, max(houses[i:]) - h + 1) for i, h in enumerate(houses[:-1], 1)] + [0]

0.45995

class Solution: def minimumTotal(self, triangle): """ :type triangle: List[List[int]] :rtype: int """ length = len(triangle) for i in range(length - 1, 0, -1): for j in range(1, len(triangle[i])): if triangle[i][j] < triangle[i][j-...

0.456624

class Solution: def lengthOfLIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 0: return 0 res = [nums[0]] def binarySearch(l,target): left , right = 0 , len(l)-1 while left < right: ...

0.455479

def can_jump(arr): if arr[0] == 0 or len(arr) == 1: return False if arr[0] >= len(arr): return True for jump in range(1, arr[0] +1): if can_jump(arr[jump:]): return True return False

0.455471

# returns answer to the subproblem with interval range [start, end], # but with a total of "extra" additional stuff on the end # that must be deleted last. memo = {} def f(dat, rewards, start, end, extra): curr = (start, end, extra) if curr in memo: return memo[curr] if start > end: re...

0.453937

def bs(arr, val, key=lambda x:x): l, r = 0, len(arr)-1 if key(arr[l])>val: return l if key(arr[r])<=val: return r+1 while l+1<r: m = (l+r)>>1 v = key(arr[m]) if v<=val: l = m else: r = m return r def bs_left(arr,...

0.453203

def queue_time(customers, n): l=[0]*n for i in customers: l[l.index(min(l))]+=i return max(l)

0.452494

def maxval(arr): fn = [float('-inf')]*(len(arr)+1) sn = [float('-inf')]*len(arr) tn = [float('-inf')]*(len(arr)-1) fon = [float('-inf')]*(len(arr)-2) for i in reversed(list(range(len(arr)))): fn[i] = max(fn[i + 1], arr[i]) for i in reversed(list(range(len(arr) - 1))): sn[i] = max...

0.451346

def cut_log(p, n): log = [0] for _ in range(n): log.append(max(pi + li for pi, li in zip(p[1:], log[::-1]))) return log[n]

0.451024

from collections import Counter class Solution: def longestArithSeqLength(self, A: List[int]) -> int: c = dict(Counter(A).most_common()) # print(c) m1 = max(c.values()) # A = list(set(A)) # A.sort() index = {} # for i in range(len(A)): # index[A[i]...

0.450062

def max_sum(arr, ranges): return max( sum(arr[start:stop+1]) for start, stop in ranges )

0.448611

import sys class Solution: def maximumSum(self, arr: List[int]) -> int: ignore=0 not_ignore=0 res=-sys.maxsize for i in arr: if i>=0: ignore+=i not_ignore+=i else: if ignore==0: ignore+=i ...

0.448589

class Solution: def maximumGap(self, nums): """ :type nums: List[int] :rtype: int """ if not nums or len(nums) == 1: return 0 sorted_gap=0 nums=list(set(nums)) nums.sort() for curr in range(len(nums[:-1])): g...

0.446522

class Solution: def maxWidthRamp(self, A: List[int]) -> int: width = 0 icandidate = [0] for i in range(len(A)): if A[i] < A[icandidate[-1]]: icandidate.append(i) for j in range(len(A) - 1, -1, -1): while icandidate and A[icandidate[-1]] <= A[j]...

0.446071

def pick_peaks(arr): pos = [] prob_peak = False for i in range(1, len(arr)): if arr[i] > arr[i-1]: prob_peak = i elif arr[i] < arr[i-1] and prob_peak: pos.append(prob_peak) prob_peak = False return {'pos':pos, 'peaks':[arr[i] for i in pos]}

0.443795

def replace_zero(arr): m, im, i, lst = 0, -1, -1, ''.join(map(str,arr)).split('0') for a,b in zip(lst,lst[1:]): i += len(a) + 1 candidate = len(a)+len(b)+1 if m <= candidate: im, m = i, candidate return im

0.443697

class Solution: def findLHS(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums) ret = 0 for i in count: if i+1 in count: ret = max(ret, count[i]+count[i+1]) return ret...

0.443238

def buy_or_sell(pairs, harvested_fruit): currentFruit = harvested_fruit actions = list() for pair in pairs: if currentFruit not in pair: return 'ERROR' if currentFruit == pair[0]: actions.append('buy') currentFruit = pair[1] ...

0.442837

from collections import Counter def obtain_max_number(arr): c = Counter(arr) while 1: find = next((k for k in c if c[k] > 1), None) if not find:return max(c) c[find] -= 2 c[find*2] = c.get(find*2,0) + 1

0.442165

def consecutive(arr): return max(arr) - min(arr) + 1 - len(arr) if arr else 0

0.44199

class Solution: def maxProduct(self, nums: List[int]) -> int: if nums[0] > nums[1]: largest = nums[0] second_largest = nums[1] else: largest = nums[1] second_largest = nums[0] for i in range(2,len(nums)): if nums[i] > largest: ...

0.441739

def close_to_zero(t): if len(t)==0: return (0) x=t.split(" ") l=[] poz=[] neg=[] for i in x: l.append(int(i)) for i in l: if i == 0: return (0) if i>0: poz.append(i) if i<0: neg.append(i) if 0-min(poz)==...

0.441717

class Solution: def findPoisonedDuration(self, timeSeries, duration): """ :type timeSeries: List[int] :type duration: int :rtype: int """ if not timeSeries: return 0 prev = timeSeries[0] ret = 0 count = 0 for t i...

0.441523

def largest_rect(h): st=[]; m=0; i=0 while i<len(h): if len(st)==0 or h[st[-1]]<=h[i]: st.append(i); i+=1 else: l=st.pop(); m=max(m, h[l]*(i if len(st)==0 else i-st[-1]-1)) while len(st)>0: l=st.pop(); m=max(m, h[l]*(i if len(st)==0 else i-st[-1]-1)) return m

0.441421

def artificial_rain(garden): left,area,record = 0,0,1 for i in range(1,len(garden)): if garden[i] < garden[i-1]: left = i elif garden[i] > garden[i-1]: area = max(area,record) record = i - left record += 1 return max(area,record)

0.440346

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def rob(self, root): """ :type root: TreeNode :rtype: int """ def superrob(node): ...

0.439571

class Solution: def minFallingPathSum(self, A: List[List[int]]) -> int: dp = [A[0][:], [0 for _ in A[0]]] for i in range(1, len(A)): for j in range(len(A[i])): dp[i & 1][j] = min([dp[(i - 1) & 1][j + k] for k in (-1, 0, 1) if 0 <= j + k < len(A[i])]) + A[i][j] ret...

0.438814

def array_conversion(arr): sign = 0 while len(arr) > 1: sign = 1^sign arr = list(map(lambda x, y: x+y, arr[0::2],arr[1::2]) if sign else map(lambda x, y: x*y, arr[0::2],arr[1::2])) return arr[0]

0.438758

class Solution: def maxArea(self, height): """ :type height: List[int] :rtype: int """ # l = [] # maxH = 0 # for i in range(len(height)-1, -1, -1): # if height[i] > maxH: # maxH = height[i] # l.append((i, ...

0.437041

class Solution: def movesToMakeZigzag(self, nums): n = len(nums) res0 = 0 for i in range(0, n, 2): nei = min(nums[j] for j in [i - 1, i + 1] if 0 <= j <= n-1) if nums[i] >= nei: res0 += nums[i] - nei + 1 res1 = 0 for i in range(1, n, 2)...

0.436609

from collections import deque class Solution: def constrainedSubsetSum(self, nums, k): N, queue = len(nums), deque() dp = [val for val in nums] for i, val in enumerate(nums): if queue and (i - queue[0] > k): queue.popleft() if queue and dp[queue[0]] > ...

0.436448

#taken from https://stackoverflow.com/questions/30698441/optimal-way-to-find-sums-of-all-contiguous-sub-arrays-max-difference def max_sums(d): stack = [(-1, float('inf'))] sum_ = 0 for i, x in enumerate(d): while x > stack[-1][1]: prev_i, prev_x = stack.pop() prev_prev_i, pr...

0.435268

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ cnt, sm, ism = 0, 0, 0 for i, num in enumerate(arr): sm += num ism += i if sm == ism: cnt += 1 return cnt

0.435165

def peak(arr): for i, val in enumerate(arr): if sum(arr[:i]) == sum(arr[i+1:]): return i return -1

0.434842

def profitLoss(records): return round(sum(price - price / (1 + profit / 100) for (price, profit) in records), 2)

0.434138

from heapq import heappop, heappush def comb(fruits): total, heap = 0, sorted(fruits) while len(heap) > 1: cost = heappop(heap) + heappop(heap) heappush(heap, cost) total += cost return total

0.433918

AVAILABLE_METHODS = { 'even' : lambda x: x / 2, 'odd': lambda x: 3 * x + 1 } def generator(x): temp = x temp_num = 0 while temp > 1: if temp % 2 == 0: temp = AVAILABLE_METHODS['even'](temp) else: temp = AVAILABLE_METHODS['odd'](temp) temp_num += 1 ...

0.433309

def array_leaders(numbers): return [n for (i,n) in enumerate(numbers) if n>sum(numbers[(i+1):])]

0.433147

class Solution: def maxSatisfaction(self, satisfaction: List[int]) -> int: satisfaction.sort() total, res = 0,0 while satisfaction and satisfaction[-1]+total > 0: total += satisfaction.pop() res += total return res

0.432939

class Solution: def minFallingPathSum(self, arr: List[List[int]]) -> int: dp = [0] * len(arr[0]) for r, row in enumerate(arr): minNb = min(dp) min1 = dp.index(minNb) dp[min1] = float('inf') min2 = dp.index(min(dp)) dp[min1] = minNb ...

0.432871

def martingale(bank, outcomes): stake = 100 for i in outcomes: if i == 0: bank -= stake stake *= 2 else: bank += stake stake = 100 return bank

0.432779

class Solution: def avoidFlood(self, rains: List[int]) -> List[int]: fullLake = {} dry = {} for day, lake in enumerate(rains): if lake not in fullLake: if lake: fullLake[lake]=day else: if lake: ...

0.432592

class Solution: def maxProfitAssignment(self, difficulty: List[int], profit: List[int], worker: List[int]) -> int: ws = sorted(worker, reverse=True) dp = sorted(zip(difficulty, profit), key=lambda x: x[1], reverse=True) # print(list(dp)) i = 0 total = 0 for w...

0.431672

class Solution: def maxTurbulenceSize(self, A: List[int]) -> int: if len(A) == 1: return 1 prev = A[1] maxcount = count = 1 + int(A[0] != A[1]) print(count) lastcomp = A[0] < A[1] for a in A[2:]: comp = prev < a if prev == a: ...

0.431187

from collections import defaultdict def fix_progression(arr): res = 0 for i in range(len(arr)): D = defaultdict(int) for j in range(i): q, r = divmod(arr[i]-arr[j], i-j) if not r: D[q] += 1 res = max(res, D[q]) return len(arr)-res-1

0.427652

class Solution: def longestSubarray(self, nums: List[int]) -> int: if not 0 in nums: return len(nums) - 1 ans = 0 tot = 0 prev = 0 for n in nums: if n == 1: tot += 1 else: ans = max(tot+prev, ans) ...

0.427367

from math import sqrt class NumArray(object): def __init__(self, nums): """ :type nums: List[int] """ if nums: k=int(sqrt(len(nums))) add,i=[],0 while i<=len(nums)-k: add.append(sum(nums[i:i+k])) i+=k ...

0.427172

rr = lambda: input().strip() rri = lambda: int(rr()) rrm = lambda: list(map(int, rr().split())) def solve(N, A): ans = 0 prev = float('inf') for x in reversed(A): x = min(x, prev - 1) ans += max(x, 0) prev = x return ans for tc in range(1):#rri()): N = rri() A = rrm() ...

0.426473

class Solution: def mctFromLeafValues(self, arr: List[int]) -> int: if not arr: return 0 res = [] while len(arr) > 1: temp_res = [] temp_res = [arr[i]*arr[i+1] for i in range(len(arr)-1)] idx = temp_res.index(min(temp_res)) res.appen...

0.426321

class Solution: def maxSizeSlices(self, slices: List[int]) -> int: a,b,n=[slices[0]],[0],len(slices) for i in range(1,n): a.append(max(a[-1],slices[i])) b.append(max(b[-1],slices[i])) for i in range(2,2*n//3,2): aa,bb=[0]*(n-1),[0]*n for j in r...

0.426261

import sys input = sys.stdin.readline t = int(input()) for _ in range(t): n = int(input()) a = list(map(int, input().split())) ans = 0 for i in range(n - 1): diff = a[i] - a[i + 1] if diff <= 0: continue else: ans = max(len(bin(diff)) - 2, ans) ...

0.426066

n = int(input()) a = [0] * n a = list(map(int, input().split())) for i in range(1, len(a)): a[i] += a[i - 1] ans = a[-1] for i in range(n - 2, 0, -1): ans = max(ans, a[i] - ans) print(ans)

0.426007

from sys import stdin n = int(stdin.readline()) a = list(map(int,stdin.readline().split())) a = [0] + a ans = n dp = [float("inf")] * (n+1) dp[0] = 0 for i in range(1,n+1): nmin = float("inf") for j in range(i-1,-1,-1): if a[j] <= nmin: dp[i] = min(dp[i] , dp[j] + max(0,a[i]-a[j]) + (i-...

0.425649

class Solution: def partitionDisjoint(self, A: List[int]) -> int: biggest = A[0] newbiggest = A[0] lenL = 1 total = 1 for itr in A[1:]: total += 1 if itr < biggest: lenL = total biggest = newbiggest else: ...

0.425424

def sum_arrays(*args): if all(x == [] for x in args) or all(x == [0] for x in args): return [] elif any(x == [] for x in args): return max(args) else: s = sum(int(''.join(map(str, x))) for x in args) minus = s < 0 return [int(x) * -1 if minus and i == 0 else int(x) ...

0.424754

def greatest_distance(arr): return max(i - arr.index(x) for i,x in enumerate(arr))

0.423965

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. Thanks Marcos for cont...

class Solution: def trap(self, height): """ :type height: List[int] :rtype: int """ if not height: return 0 result = 0 left = 0 right = len(height) - 1 while left < right: if height[left] <= height[right]: ...

0.743134

class Solution: def largestRectangleArea(self, heights): """ :type heights: List[int] :rtype: int """ if not heights: return 0 stack = [0] heights.append(0) # print(heights) max_area = 0 for i in range(...

0.597517

def artificial_rain(garden): left,area,record = 0,0,1 for i in range(1,len(garden)): if garden[i] < garden[i-1]: left = i elif garden[i] > garden[i-1]: area = max(area,record) record = i - left record += 1 return max(area,record)

0.588598

class Solution: def maxArea(self, height): """ :type height: List[int] :rtype: int """ # l = [] # maxH = 0 # for i in range(len(height)-1, -1, -1): # if height[i] > maxH: # maxH = height[i] # l.append((i, ...

0.578294

def largest_rect(h): st=[]; m=0; i=0 while i<len(h): if len(st)==0 or h[st[-1]]<=h[i]: st.append(i); i+=1 else: l=st.pop(); m=max(m, h[l]*(i if len(st)==0 else i-st[-1]-1)) while len(st)>0: l=st.pop(); m=max(m, h[l]*(i if len(st)==0 else i-st[-1]-1)) return m

0.568519

import sys num=int(sys.stdin.readline()) s=sys.stdin.readline().split() sky=list(map(int,s)) sky.reverse() cuts=0 change=0 t=False i=1 while i<len(sky): if sky[i]<=sky[i-1]: for j in range(i-1,-1,-1): if sky[j]<=sky[i]-(i-j): break else: change+=sky[j]-(sky[i]-(i-j)) if change>=sky[i]: ...

0.548746

def bs(arr, val, key=lambda x:x): l, r = 0, len(arr)-1 if key(arr[l])>val: return l if key(arr[r])<=val: return r+1 while l+1<r: m = (l+r)>>1 v = key(arr[m]) if v<=val: l = m else: r = m return r def bs_left(arr,...

0.526982

class Solution: def candy(self, ratings): """ :type ratings: List[int] :rtype: int """ if not ratings: return 0 total, pre, decrease = 1, 1, 0 for i in range(1, len(ratings)): if ratings[i] >= ratings[i-1]: ...

0.523721

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ cnt, sm, ism = 0, 0, 0 for i, num in enumerate(arr): sm += num ism += i if sm == ism: cnt += 1 return cnt

0.519827

class Solution: def swimInWater(self, grid): """ :type grid: List[List[int]] :rtype: int """ N = len(grid) if N == 1: return 0 eleD = {} for i in range(N): for j in range(N): eleD[grid[i][j]...

0.516326

class Solution: def movesToMakeZigzag(self, nums): n = len(nums) res0 = 0 for i in range(0, n, 2): nei = min(nums[j] for j in [i - 1, i + 1] if 0 <= j <= n-1) if nums[i] >= nei: res0 += nums[i] - nei + 1 res1 = 0 for i in range(1, n, 2)...

0.51448

def find_dup(arr): return sum(arr) - len(arr)*(len(arr)-1)/2 #your code here

0.512259

class Solution: def maximalRectangle(self, matrix): """ :type matrix: List[List[str]] :rtype: int """ if not matrix or not matrix[0]: return 0 n = len(matrix[0]) height = [0] * (n + 1) ans = 0 for row in matrix: ...

0.511175

class Solution: def leastBricks(self, wall): """ :type wall: List[List[int]] :rtype: int """ d = {} for i in wall: suma = 0 for j in range(len(i)-1): suma += i[j] if suma in d: d[s...

0.510888

import sys n=0; inp=[]; tree=[];#stores the index of min in range(i,j) def build(node,i,j): if(i>j): return; if(i==j): tree[node]=int(i); return; mid=int( (i+j)/2 ); build(2*node,i,mid) build(2*node+1,mid+1,j) if( inp[ tree[2*node] ] < inp[ tree[2*node+1] ] ): t...

0.50921

class Solution: def deleteAndEarn(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums);#count is a dict [3,4,2]--> {2:1,3:1,4:1} prev = None; avoid = using = 0; for k in sorted(count): temp = ma...

0.50807

class Solution: def findLHS(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums) ret = 0 for i in count: if i+1 in count: ret = max(ret, count[i]+count[i+1]) return ret...

0.501863

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ res = 0 temp = sorted(arr) sum1, sum2 = 0, 0 for i in range(0,len(arr)): sum1 += arr[i] sum2 += temp[i] if(sum1 =...

0.499417

def count_inversions(array): inv_count = 0 for i in range(len(array)): for j in range(i, len(array)): if array[i] > array[j]: inv_count += 1 return inv_count

0.496029

class Solution: def longestMountain(self, A: List[int]) -> int: up=0 down=0 ans=0 for i in range(0,len(A)-1): if A[i]<A[i+1]: if down==0: up+=1 else: up=1 down=0 ...

0.495395

import sys input=sys.stdin.readline for _ in range(int(input())): N=int(input()) e=list(map(int,input().split())) e.sort() ans=0 val=0 g=0 for i in range(0,N): g+=1 val=e[i] if g>=val: ans+=1 g=0 val=0 print(ans)

0.495131

class Solution: def findMaxConsecutiveOnes(self, nums): """ :type nums: List[int] :rtype: int """ if nums == []: return 0 count = 0 countMax =0 for ele in nums: if ele == 1: count += 1 ...

0.494243

def count_inversion(nums): return sum(a > b for i, a in enumerate(nums) for b in nums[i + 1:])

0.494187

a=eval(input()) while(a): x=eval(input()) b=list(map(int,input().split())) z=[0]*100 k=1 j=0 c=0 for i in b: if i==0: z.insert(i,k) else: if z[z.index(i)+1]==0: z.insert(j,k) else: m=z.index(i) n=m+1 p=(len(z)-z.count(0))-n c=c+min(n,p) z.insert(m+1,...

0.491016

t = int(input()) while(t): n = int(input()) ar = list(map(int,input().strip().split(" "))) print(len([x for x in ar[1:len(ar)] if ar[0]<x])) t-=1

0.490123

def calc(a): res = [0] * (len(a) + 1) for k in range(len(a)): res = [2 * max(a[i] + res[i+1], a[i+k] + res[i]) for i in range(len(a) - k)] return res[0]

0.487637

class Solution: def maxSubArray(self, nums): """ :type nums: List[int] :rtype: int """ # i = 0 # i_keep = 0 # j = 1 # j_keep = 1 # max_sum = nums[0]-1 # while j < len(nums) and i < j: # temp_sum = sum(nums[i:j]) ...

0.486271

class Solution: def findLengthOfLCIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) < 1: return 0 cur_len = 1 max_len = 1 for i in range(1,len(nums)): if nums[i] > nums[i-1]: cur_...

0.48578

class Solution: def maxWidthRamp(self, A: List[int]) -> int: width = 0 icandidate = [0] for i in range(len(A)): if A[i] < A[icandidate[-1]]: icandidate.append(i) for j in range(len(A) - 1, -1, -1): while icandidate and A[icandidate[-1]] <= A[j]...

0.484435

from sys import stdin def gt(num): if num: return num return 0 for __ in range(int(stdin.readline().split()[0])): n = int(stdin.readline().split()[0]) a = list(map(int, stdin.readline().split())) cnta = dict() cnta.setdefault(0) cntb = dict() cntb.setdefault(0) for i in a: cnta[i] = gt(cnta.get(i)) + 1 as...

0.484147

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.483364

def rank_of_element(arr,i): return sum(x <= arr[i] if n < i else x < arr[i] for n,x in enumerate(arr))

0.48322

class Solution: def oddEvenJumps(self, A: List[int]) -> int: def findNextHighestIdx(B: List[int]) -> List[int]: next_idx_list = [None] * len(B) stack = [] for i in B: while stack and stack[-1] < i: next_idx_list[stack.pop()] = i ...

0.483

from sys import stdin tt = 1 for loop in range(tt): dic = {} dic[0] = 1 n = int(stdin.readline()) a = list(map(int,stdin.readline().split())) now = 0 ans = 0 for i in a: now += i if now in dic: ans += 1 dic = {} dic[0] = 1 ...

0.482154

def find(seq): return (min(seq)+max(seq))*(len(seq)+1)/2-sum(seq)

0.481278

from sys import stdin tt = int(stdin.readline()) for loop in range(tt): n = int(stdin.readline()) a = list(map(int,stdin.readline().split())) lis = [ [1] ] now = [] tmp = 0 for i in range(1,n): if len(now) == 0: now.append(a[i]) tmp = 1 elif now[-1] ...

0.478587

from heapq import * def add_all(lst): heapify(lst) total = 0 while len(lst) > 1: s = heappop(lst) + heappop(lst) total += s heappush(lst, s) return total

0.47825

from functools import * class Solution: def stoneGameII(self, arr): a =[] s=0 n = len(arr) for i in arr[::-1]: s+=i a.append(s) a=a[::-1] @lru_cache(None) def fun(i,m): if i+2*m>=n:return a[i] mn = inf ...

0.477837

def sum_of_intervals(intervals): s, top = 0, float("-inf") for a,b in sorted(intervals): if top < a: top = a if top < b: s, top = s+b-top, b return s

0.474052

n = int(input()) v = [0] + [int(e) for e in input().split()] ans = 0 for a, b in zip(v[:-1], v[1:]): if a < b: ans += (b-a)*(n-b+1) else: ans += b*(a-b) print(ans)

0.473094

class Solution: def jump(self,nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 1: return 0 else: step = 0 pos = 0 while pos != len(nums) - 1: bestStep = -1 bes...

0.472356

def main(): N = int(input()) L = [int(l) for l in input().split(" ")] L.sort() m = len(L) cnt = 0 for i in range(m): k = m - 1 for j in range(i + 1, m): while m + i - j < k: if L[m + i - j] + L[i] <= L[k]: k -= 1 else: cnt += k - m - i + j break print(cnt) main()

0.472321

from itertools import combinations_with_replacement def find(arr,n): return sum( sum(c) == n for x in range(1,len(arr)+1) for c in combinations_with_replacement(arr, x) )

0.47091

pos = {"L4":0, "L3":1, "L2":2, "L1":3, "L0":4, "R0":4, "R1":5, "R2":6, "R3":7, "R4":8} def tetris(arr): current, res = [0]*9, 0 for x in arr: p = pos[x[1:]] current[p] += int(x[0]) if current[p] >= 30: break y = min(current) if y: current, res = [v-y for v in current], r...

0.470276

for _ in range(int(input())): n = int(input()) arr = list(map(int,input().split())) a,b = 0,0 arr.sort() for i in arr: if a==i: a+=1 elif b==i: b+=1 print(a+b)

0.469631

def check(l,n): m = 0 for i in range(n-1): x = l[i] c = 0 j = i while (j+2<n and l[j+2]==x) or (j+1<n and l[j+1] == x): if l[j+1] == x: j = j+1 else: j+=2 c+=1 if m<c: m = c return m t = ...

0.468873

def sum_array(arr): if arr == None or len(arr) < 3: return 0 return sum(arr) - max(arr) - min(arr)

0.468053

def solve(arr): return sum( y-x == z-y for i,x in enumerate(arr[:-2]) for j,y in enumerate(arr[i+1:-1]) for _,z in enumerate(arr[j+1:]))

0.467219

def main(): from sys import stdin, stdout for _ in range(int(stdin.readline())): n = int(stdin.readline()) inp1 = [-1] * (n + 1) inp2 = [-1] * (n + 1) for i, ai in enumerate(map(int, stdin.readline().split())): if inp1[ai] < 0: inp1[ai] = i ...

0.467077

test=int(input()) for _ in range(test): n=int(input()) ls=list(map(int,input().split())) ls.sort() s=0 for i in range(n): if s>=ls[i]: s=s+1 else: break print(s)

0.467012

from itertools import combinations def counting_triangles(v): v.sort() return sum(a+b>c for a,b,c in combinations(v,3))

0.466846

def find_dup(arr): return sum(arr) - sum(range(1, max(arr)+1))

0.466171

import sys n = int(sys.stdin.readline().strip()) a = list(map(int, sys.stdin.readline().strip().split())) M = [[0 for i in range (0, 21)] for j in range (0, 21)] F = [0 for i in range (0, 21)] for i in range (0, n): x = int(a[i]) for j in range (0, 21): if j != x: M[j][x] = M[j][x] + F[j] ...

0.465058

def solve(l): m = l.index(max(l)) if m == 0 or m == len(l) - 1: return 1 return 1 + min(solve(l[0:m]), solve(l[m+1:])) tc = int(input()) for test in range(tc): n = int(input()) l = list(map(int, input().split())) print(solve(l))

0.464898

n = int(input()) r = 0 for i in range(n): a = list(map(int, input().split(' '))) r += (a[2] - a[0] + 1) * (a[3] - a[1] + 1) print(r)

0.464396

class Solution: def getMaxLen(self, nums: List[int]) -> int: maxx = 0 nums.append(0) # starting position # where we find a 0 i = -1 minusarr = [] for j,n in enumerate(nums): if n == 0: # now figure out previous one...

0.464369

class Solution: def partitionDisjoint(self, A: List[int]) -> int: biggest = A[0] newbiggest = A[0] lenL = 1 total = 1 for itr in A[1:]: total += 1 if itr < biggest: lenL = total biggest = newbiggest else: ...

0.464318

class Solution: def minMoves2(self, nums): """ :type nums: List[int] :rtype: int """ aa = sorted(nums) median = aa[len(nums)//2] return sum([abs(i-median) for i in aa])

0.463432

class Solution: def findPoisonedDuration(self, timeSeries, duration): """ :type timeSeries: List[int] :type duration: int :rtype: int """ if not timeSeries: return 0 prev = timeSeries[0] ret = 0 count = 0 for t i...

0.463402

def hop_across(lst): def one_side(lst): i = 0 steps = 0 while i < len(lst): i += lst[i] steps += 1 return steps return one_side(lst) + one_side(lst[::-1])

0.462088

class Solution: def rob(self, nums): """ :type nums: List[int] :rtype: int """ if not nums: return 0 if len(nums)==1: return nums[0] return max(self.helper(nums[1:]), self.helper(nums[:-1])) def helper(self,nums...

0.461996

# encoding: utf-8 from sys import stdin def solve(a): # root node of tries denotes empty stack stack = [None] node_stack = [[1, {}]] trie = node_stack[-1] counter = 0 for i in range(len(a)): el = a[i] if len(stack) == 0 or stack[-1] != el: current_node = node_sta...

0.460797

from operator import itemgetter import sys input = sys.stdin.readline MAX_A = 200 t = int(input()) for _ in range(t): n = int(input()) a = list(map(int, input().split())) ruiseki = [[0] * MAX_A for i in range(n + 1)] for i in range(n): for j in range(MAX_A): ruiseki[i + 1][j] ...

0.460642

class Solution: def countSmaller(self, nums): """ :type nums: List[int] :rtype: List[int] """ s = sorted(nums) c = [] for n in nums: p = bisect.bisect_left(s, n) c.append(p) s.pop(p) return c

0.460362

class Solution: def minMoves(self, nums): """ :type nums: List[int] :rtype: int """ minx=min(nums) sums=sum(nums) return sums-len(nums)*minx

0.460132

def smaller(arr): # Good Luck! return [len([a for a in arr[i:] if a < arr[i]]) for i in range(0, len(arr))]

0.459853

class Solution: def minNumberOperations(self, target: List[int]) -> int: prev = -1 ans = 0 for num in target: if prev == -1: prev = num ans += num continue if num > prev: ans += (num - prev) #...

0.459417

import sys import math input=sys.stdin.readline #sys.setrecursionlimit(1000000) mod=int(1000000007) i=lambda :map(int,input().split()) n=int(input()) a=[int(x) for x in input().split()] t=[[0]*21 for i in range(300005)] for i in range(n): t[i][0]=a[i] def build(n): for j in range(1,20): for i in rang...

0.457904

def flipping_game(num): current = 0 biggest = 0 for i in num: current = max(0, current - ( i or -1 ) ) biggest = max(biggest, current) return sum(num) + (biggest or -1)

0.457738

def solve(arr): return sum(set(arr))

0.457218

class Solution: def maxNonOverlapping(self, nums: List[int], target: int) -> int: sum_set = set() sum_set.add(0) temp = 0 count = 0 for num in nums: temp += num if temp - target in sum_set: count += 1 sum_set.clear() ...

0.456787

class Solution: def minimumTotal(self, triangle): """ :type triangle: List[List[int]] :rtype: int """ length = len(triangle) for i in range(length - 1, 0, -1): for j in range(1, len(triangle[i])): if triangle[i][j] < triangle[i][j-...

0.456717

import sys import math import heapq import bisect import re from collections import deque from decimal import * from fractions import gcd def YES_NO(flag): if flag: print("AWW") else: print("WAW") def main(): # q = [int(i) for i in sys.stdin.readline().split()] n = int(sys.stdin.re...

0.455017

def elevator_distance(array): return sum(abs(a - b) for a, b in zip(array, array[1:]))

0.454403

import sys import math from collections import defaultdict from itertools import combinations from itertools import permutations input = lambda : sys.stdin.readline().rstrip() read = lambda : list(map(int, input().split())) def write(*args, sep="\n"): for i in args: sys.stdout.write("{}".format(i) + sep) INF = fl...

0.45417

from math import sqrt class NumArray(object): def __init__(self, nums): """ :type nums: List[int] """ if nums: k=int(sqrt(len(nums))) add,i=[],0 while i<=len(nums)-k: add.append(sum(nums[i:i+k])) i+=k ...

0.453558

rr = lambda: input().strip() rri = lambda: int(rr()) rrm = lambda: list(map(int, rr().split())) def solve(N, A): ans = 0 prev = float('inf') for x in reversed(A): x = min(x, prev - 1) ans += max(x, 0) prev = x return ans for tc in range(1):#rri()): N = rri() A = rrm() ...

0.453521

class Solution: def arrayPairSum(self, nums): """ :type nums: List[int] :rtype: int """ nums.sort() return sum(nums[::2])

0.453275

def f(a,n): l,r,s1,s2 = [0]*n, [0]*n, [], [] for i in range(n): count = 1 while(len(s1)>0 and a[i]<s1[-1][0]): count += s1[-1][1] s1.pop() s1.append((a[i],count)) l[i] = count for i in range(n-1,-1,-1): count = 1 while(len(s2)>0 and a[i]<=s2[-1][0]): count...

0.451747

def infected_zeroes(s): m=0; l=0 for i,n in enumerate(s): if n==0: m=i if l==0 else max(m, (i-l+1)//2); l=i+1 return max(m,len(s)-l)

0.451325

# cook your dish here t=int(input()) for i in range(t): n=int(input()) ar=list(map(int,input().split())) tot=0 st=0 for j in range(1,n): if(ar[j-1]>ar[j]): si=j-st c=(si*(si+1))//2 tot+=c st=j si=n-st c=(si*(si+1))//2 tot+=c print(tot)

0.451143

import sys input = sys.stdin.readline Q = int(input()) for _ in range(Q): N = int(input()) A = [int(a) for a in input().split()] X = {} for a in A: if a in X: X[a] += 1 else: X[a] = 1 Y = [] for x in X: Y.append(X[x]) Y = sorted(Y)[::-1] p...

0.450955

from sys import * T = int(stdin.readline()) t = [int(s) for s in stdin.readline().split(' ')] a = [] for i in range(T - 1, -1, -1): if i % 2 == 0: a += [(e[0], -e[1]) for e in a] a = [(e[0] - t[i], e[1]) for e in a] a += [(- x - 1, 0) for x in range(t[i])] a = list(set(a)) if...

0.450825

# cook your dish here # cook your dish here from math import log2; import sys; sys.setrecursionlimit(10 ** 7) from collections import defaultdict inf = float("inf") def find_height(node): nodes[node]=1 for i in graph[node]: nodes[node]+=find_height(i) return nodes[node] def find_sum(node): sum...

0.450492

def peak_height(mountain): M = {(r, c) for r, l in enumerate(mountain) for c in range(len(l)) if l[c] == '^'} h = 0 while M: M -= {(r, c) for r, c in M if {(r, c+1), (r, c-1), (r+1, c), (r-1, c)} - M} h += 1 return h

0.450186

""" Codeforces Contest 260 Div 1 Problem A Author : chaotic_iak Language: Python 3.3.4 """ def main(): n, = read() ar = read() a = [0] * 100001 for i in ar: a[i] += 1 dp = [0] * 100001 dp[1] = a[1] for i in range(2, 100001): dp[i] = max(a[i] * i + dp[i-2], dp[i-1]) print(dp[-...

0.449408

#python33 def program(): a=[] t=0 n=int(input()) for i in range(n): a.append(int(input())) t=a[0]+1 for j in range(1,len(a)): t+=abs(a[j]-a[j-1])+2 print (t) program()

0.44802

MAX_N = 100000 def maxi(a, b): if a[0] > b[0]: return a else: return b class Segment_Tree: def init(self, left, right, data, leftbound, rightbound): self.data = data self.left = left self.right = right self.leftbound = leftbound self.rightbound = rig...

0.447789

def descriptions(arr): return 2**sum(a+1==b for a,b in zip(arr,arr[1:]))

0.446723

n = int(input()) a = [int(x) for x in input().split()] a.sort() num = 0 res = 0 for i in range(n): if int(a[i]) >= num: res += 1 num += int(a[i]) #print(res, a[i]) print(res)

0.445898

def minimum_steps(arr, n): arr = sorted(arr) s = 0 for i,v in enumerate(arr): s += v if s >= n: return i

0.445616

# cook your dish here test_case = int(input()) while test_case : n_people = int(input()) array = list(map(int, input().strip().split())) sums =[0 for i in range(n_people)] sums[0] = array[0] for i in range(1, n_people) : sums[i] = sums[i-1] + array[i] # print(sums) k = 1 count = 0 i = 0 while(k < ...

0.445593

class Solution: def numTimesAllBlue(self, light: List[int]) -> int: right = 0 ans = 0 for i in range(len(light)): if (light[i] > right): right = light[i] if (i + 1 == right): ans += 1 return ans

0.445063

# Python3 program to count inversions using # Binary Indexed Tree # Returns sum of arr[0..index]. This function # assumes that the array is preprocessed and # partial sums of array elements are stored # in BITree[]. def getSum( BITree, index): sum = 0 # Initialize result # Traverse anc...

0.444365

points = [0, 40, 100, 300, 1200] def get_score(arr) -> int: cleared = 0 score = 0 for lines in arr: level = cleared // 10 score += (level+1) * points[lines] cleared += lines return score

0.444243

n = int(input()) A = list(map(int, input().split())) A.sort() prev = -1 res = 0 for x in A: if x > prev: prev = x else: prev = prev + 1 res += prev - x print(res)

0.443923

def queue(queuers,pos): return sum(min(queuer, queuers[pos] - (place > pos)) for place, queuer in enumerate(queuers))

0.443616

class Solution: def numSubmat(self, mat: List[List[int]]) -> int: n, m = len(mat), len(mat[0]) heights = [0] * m res = 0 for i in range(0, n): stack = [] count = 0 for j in range(0, m): if mat[i][j] == 1: heights...

0.443021

def queue_time(customers, n): l=[0]*n for i in customers: l[l.index(min(l))]+=i return max(l)

0.442912

from sys import stdin for _ in range(int(input())): n = int(input()) l = list(map(int,input().split())) id = list(zip(l,list(range(n)))) id.sort() val, pos = zip(*id) blok = [] cur = [pos[0]] for i in range(1,n): if val[i] == val[i-1]: cur.append(pos[i]) else:...

0.442858

def duplicates(arr): return sum(arr.count(i)//2 for i in set(arr))

0.442783

Given two arrays nums1 and nums2. Return the maximum dot product between non-empty subsequences of nums1 and nums2 with the same length. A subsequence of a array is a new array which is formed from the original array by deleting some (can be none) of the characters without disturbing the relative positions of the remai...

class Solution: def maxDotProduct(self, nums1: List[int], nums2: List[int]) -> int: # DP(a=index of last, b=index of last) = max of: # DP(a-1, b) # DP(a-1, i) + nums1[a] * max_or_min(nums2[i+1:b+1]) # same for b INF = int(1e9) n, m = len(nums1)...

0.808621

def min_dot(a, b): return sum(x * y for (x, y) in zip(sorted(a), sorted(b, reverse = True)))

0.669447

from sys import stdin, stdout n, m = map(int, stdin.readline().split()) first = list(map(int, stdin.readline().split())) second = list(map(int, stdin.readline().split())) ans = float('inf') for i in range(n): cnt = float('-inf') for j in range(m): for z in range(n): if z == i: ...

0.629736

class Solution: def numTriplets(self, nums1: List[int], nums2: List[int]) -> int: def triplets(nums1, nums2): sq = collections.Counter(x * x for x in nums1) num = collections.Counter(nums2) res = 0 keys = sorted(num.keys()) fo...

0.612671

import numpy np_ar1 = numpy.array(list(map(int,input().split()))) np_ar2 = numpy.array(list(map(int,input().split()))) print((numpy.inner(np_ar1,np_ar2))) print((numpy.outer(np_ar1,np_ar2)))

0.612078

def adjacent_element_product(array): return max( a*b for a, b in zip(array, array[1:]) )

0.608944

# https://leetcode.com/problems/maximum-of-absolute-value-expression/discuss/340075/c%2B%2B-beats-100-(both-time-and-memory)-with-algorithm-and-image class Solution: def maxAbsValExpr(self, arr1: List[int], arr2: List[int]) -> int: N = len(arr1) a = [arr1[i] + arr2[i] + i for i in range(N)] ...

0.607635

class Solution: def maxProduct(self, nums: List[int]) -> int: if nums[0] > nums[1]: largest = nums[0] second_largest = nums[1] else: largest = nums[1] second_largest = nums[0] for i in range(2,len(nums)): if nums[i] > largest: ...

0.605426

class Solution: def maxSum(self, nums1: List[int], nums2: List[int]) -> int: d2 = {nums2[i]:i for i in range(len(nums2))} _nums1 = [] _nums2 = [] prev_i, prev_j = 0, 0 for i in range(len(nums1)): if nums1[i] in d2: _nums1.append(sum(nums1[prev_i:i]...

0.604944

def check_exam(arr1, arr2): return max(0, sum(4 if a == b else -1 for a, b in zip(arr1, arr2) if b))

0.597693

class Solution: def largestOverlap(self, A, B) -> int: leng = len(A[0]) # convert A, B to binary a = 0 b = 0 for i in range(0, leng * leng): row = int(i % leng) col = int(i / leng) a = (a << 1) + A[col][row] b = (b << 1) + B[co...

0.596594

import numpy n = int(input()) ar1 = [] ar2 = [] for i in range(n): tmp = list(map(int,input().split())) ar1.append(tmp) np_ar1 = numpy.array(ar1) for i in range(n): tmp = list(map(int,input().split())) ar2.append(tmp) np_ar2 = numpy.array(ar2) print((numpy.dot(np_ar1,np_ar2)))

0.590376

# cook your dish here for tc in range(int(input())): n = int(input()) li1 = list(map(int,input().split(' '))) li2 = list(map(int,input().split(' '))) walk = 0 sum1 = 0 sum2 = 0 for i in range(n): if li1[i] == li2[i] and sum1 == sum2: walk += li1[i] sum1 += li1[i] sum2 += li2[i] print(walk)

0.571763

def mapt(fn, *args): return tuple(map(fn, *args)) def Input(): return mapt(int, input().split(" ")) def main(): n = int(input()) a_1 = Input() a_2 = Input() ans = 0 for i in range(n): ans = max(ans, sum(a_1[:i+1])+sum(a_2[i:n])) print(ans) main()

0.568409

def ii(): return int(input()) def mi(): return list(map(int, input().split())) def li(): return list(mi()) # A. Company Merging n = ii() c = [] for i in range(n): a = li()[1:] c.append(a) mx = max(max(e) for e in c) ans = sum((mx - max(e)) * len(e) for e in c) print(ans)

0.561675

n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) c = [0] * n stk = [0] for i in range(1, n): while len(stk) > 1 and c[stk[1]] - c[stk[0]] <= a[i] * (b[stk[0]] - b[stk[1]]): del stk[0] c[i] = c[stk[0]] + a[i] * b[stk[0]] while len(stk) > 1 and ((c[s...

0.55954

import heapq def max_product(a): x = heapq.nlargest(2,a) return x[0]*x[1]

0.558634

class Solution: def mctFromLeafValues(self, arr: List[int]) -> int: if not arr: return 0 res = [] while len(arr) > 1: temp_res = [] temp_res = [arr[i]*arr[i+1] for i in range(len(arr)-1)] idx = temp_res.index(min(temp_res)) res.appen...

0.558114

def min_sum(arr): arr = sorted(arr) return sum(arr[i]*arr[-i-1] for i in range(len(arr)//2))

0.555815

class Solution: def maxProduct(self, nums): """ :type nums: List[int] :rtype: int """ def prod(nums): #function to calculate product prod = 1 for i in nums: prod*=i return prod def listsplit(l...

0.554568

class Solution: def deleteAndEarn(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums);#count is a dict [3,4,2]--> {2:1,3:1,4:1} prev = None; avoid = using = 0; for k in sorted(count): temp = ma...

0.553948

from numpy import prod def find_difference(a, b): return abs(prod(a) - prod(b))

0.553885

import itertools n = int(input()) Tako = list(map(int, input().split())) ans = 0 for x,y in itertools.combinations(Tako,2): ans += x*y print(ans)

0.547309

n = [ int(i) for i in input().split() ] p = [ int(i) for i in input().split() ] p = sorted(p) val = sum( p[:n[1]] ) print(val)

0.546307

for _ in range(int(input())): n=int(input()) a=list(map(int,input().split())) b=list(map(int,input().split())) a.sort() b.sort() s=0 for i in range(n): s+=min(a[i],b[i]) print(s)

0.542093

# -*- coding: utf-8 -*- """ Created on Thu Sep 10 11:20:10 2020 @author: liang """ N = int(input()) A = [int(i) for i in input().split()] B = [int(i) for i in input().split()] ans = 0 for i in range(N): ans += min(B[i], A[i]+A[i+1]) if B[i] > A[i]: A[i+1] -= B[i] - A[i] if A[i+1] < 0: A[i...

0.540601

def sum_arrays(*args): if all(x == [] for x in args) or all(x == [0] for x in args): return [] elif any(x == [] for x in args): return max(args) else: s = sum(int(''.join(map(str, x))) for x in args) minus = s < 0 return [int(x) * -1 if minus and i == 0 else int(x) ...

0.540112

n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) def f(l): s = sum(l) sume = [s for i in range(n)] s3 = [0 for i in range(n)] ts = 0 for i in range(1, n): sume[i] = sume[i - 1] - l[i - 1] ts += i * l[i] s3[n - i - 1] = s3[n - i] + i *...

0.538379

def maximum_product(arr): if arr.count(0) > 1: return min(arr) neg = [n for n in arr if n < 0] pos = [n for n in arr if n >= 0] if len(neg) % 2: return min(neg) if 0 in arr else max(neg) else: return min(pos) if pos else min(neg)

0.53749

def max_and_min(arr1,arr2): diffs = [abs(x-y) for x in arr1 for y in arr2] return [max(diffs), min(diffs)]

0.537379

class Solution: def diagonalSum(self, mat: List[List[int]]) -> int: rows = len(mat) columns = len(mat[0]) sum_ = 0 for r, c1, c2 in zip(list(range(rows)), list(range(columns)), list(range(columns - 1, -1, -1))): sum_ += mat[r][c1] if c1 != c2: ...

0.536788

from bisect import bisect HISENTINEL = 10**9 + 1 LOSENTINEL = -HISENTINEL def main(): length = int(input()) a = [int(fld) for fld in input().strip().split()] b = [int(fld) for fld in input().strip().split()] print(countmaxminsubseq(a, b)) def countmaxminsubseq(a, b): leq, lgt = getleftbounds(...

0.536741

n, m = list(map(int, input().split())) prices = list(map(int, input().split())) auci = list(map(int, input().split())) scores = 0 # m auc # n - m default for i in range(len(prices)): if (i+1) not in auci: scores += prices[i] prices[i] = 0 ra = [] for i in prices: if i != 0: ra.appe...

0.534544

class Solution: def arrayPairSum(self, nums): """ :type nums: List[int] :rtype: int """ nums.sort() return sum(nums[::2])

0.533611

t = int(input()) for _ in range(t): n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) ma = min(a) mb = min(b) ops = 0 for xa, xb in zip(a, b): da = xa - ma db = xb - mb ops += max(da, db) print(ops)

0.533572

def main(): import sys from array import array input = sys.stdin.readline class Bit: def __init__(self, n): self.size = n self.size_bit_length = n.bit_length() self.tree = array('h', [0] * (n+1)) def reset(self): self.tree = array('h', [0...

0.53357

def array_conversion(arr): sign = 0 while len(arr) > 1: sign = 1^sign arr = list(map(lambda x, y: x+y, arr[0::2],arr[1::2]) if sign else map(lambda x, y: x*y, arr[0::2],arr[1::2])) return arr[0]

0.528262

import sys n_discounts = int(sys.stdin.readline()) discount_values = [int(x) for x in sys.stdin.readline().split()] n_items = int(sys.stdin.readline()) item_values = [int(x) for x in sys.stdin.readline().split()] min_discount_req = 10000000 for discount_value in discount_values: min_discount_req = min(min_discoun...

0.527561

from collections import Counter tc=int(input()) for k in range(tc): n=int(input()) a=list(map(int, input().rstrip().split())) b= list(map(int, input().rstrip().split())) cc=sorted(a+b) #print('cc = ',cc) p=[] q=[] #print('len(cc) = ',len(cc)) #print('len = ',(2*n)) #rx=0 for i in range(0,(2*n),2): p.append...

0.526832

def total(arr): while len(arr) > 1: arr = [x+y for x,y in zip(arr,arr[1:])] return arr[0]

0.525744

import sys import math def solve(): k, n = list(map(int, input().split())) D = {} for line in sys.stdin: s, a = line.split() if s in D: D[s].append(int(a)) else: D[s] = [int(a)] res = 0 center = 0 for s in D: revs = s[::-1] if not...

0.525456

def calc(a): res = [0] * (len(a) + 1) for k in range(len(a)): res = [2 * max(a[i] + res[i+1], a[i+k] + res[i]) for i in range(len(a) - k)] return res[0]

0.525371

import numpy n,m=list(map(int,input().split())) ar = [] for i in range(n): tmp = list(map(int,input().split())) ar.append(tmp) np_ar = numpy.array(ar) s = numpy.sum(np_ar,axis=0) print((numpy.prod(s)))

0.524133

import sys n,m=list(map(int,sys.stdin.readline().split())) A=list(map(int,sys.stdin.readline().split())) B=list(map(int,sys.stdin.readline().split())) A.sort(reverse=True) B.sort(reverse=True) a=sum(A) b=sum(B) ans=0 left=0 for i in range(n): left+=A[i] temp=b*(i+1)+a-left if(ans==0): ...

0.521894

class Solution: def multiply(self,num1, num2): """ :type num1: str :type num2: str :rtype: str """ a=['0','1','2','3','4','5','6','7','8','9'] z=0 x=0 for i,element in enumerate(num1): for j in range(10): ...

0.521781

maxn = 100100 ar = [1 for i in range(maxn)] ar[0], ar[1] = 0, 0 for i in range(2, maxn): if ar[i]: for j in range(i, (maxn - 1) // i + 1): ar[i * j] = 0 dst = maxn d = [dst for i in range(maxn)] for i in reversed(list(range(maxn))): if ar[i]: dst = 0 d[i] = min(d[i], dst) dst += 1 n, m = list(map(...

0.52166

n=int(input()) a=[*map(int,input().split())] b=[*map(int,input().split())] print(sum(sorted(a+b)[::-2])-sum(b))

0.521602

class Solution: def maxSubArray(self, nums): """ :type nums: List[int] :rtype: int """ # i = 0 # i_keep = 0 # j = 1 # j_keep = 1 # max_sum = nums[0]-1 # while j < len(nums) and i < j: # temp_sum = sum(nums[i:j]) ...

0.516761

# cook your dish here n=int(input()) x=[] y=[] for _ in range(n): s=input().split(' ') x.append(int(s[0])) y.append(int(s[1])) q=x[0] w=y[0] for t in range(n-1): x[t]=(x[t]+x[t+1])/2 y[t]=(y[t]+y[t+1])/2 x[n-1]=(x[n-1]+q)/2 y[n-1]=(y[n-1]+w)/2 i=0 a=0 while(i<n-1): a+=(x[i]*y[i+1]-y[i]*x[i+1])/2 i+=1 a+=(x[i...

0.516025

def diagonal_sum(array): return sum(row[i] for i, row in enumerate(array))

0.513029

def solve(arr): p, q = 1, 1 for k in arr: x, y = max(k), min(k) a = p * x b = q * x c = p * y d = q * y p = max(a, b, c, d) q = min(a, b, c, d) return max(p, q)

0.512997

def poly_multiply(p1, p2): if not p1 or not p2: return [] n = len(p1) + len(p2) - 1 p = [0]*n for i,a in enumerate(p1): for j,b in enumerate(p2): p[i + j] += a*b return p

0.51181

def bitadd(a,w,bit): x = a while x <= (len(bit)-1): bit[x] += w x += x & (-1 * x) def bitsum(a,bit): ret = 0 x = a while x > 0: ret += bit[x] x -= x & (-1 * x) return ret n = int(input()) x = list(map(int,input().split())) v = list(map(int,input().split(...

0.510894

n = int(input()) vlst = list(map(int, input().split())) clst = list(map(int, input().split())) ans = 0 for v, c in zip(vlst, clst): ans += max(0, v - c) print(ans)

0.510457

def matrixScore(A): """ :type A: List[List[int]] :rtype: int """ m,n = len(A),len(A[0]) # 行变换 for i in range(m): if A[i][0] == 1: continue for j in range(n): A[i][j] = 1 - A[i][j] # 列变换 res = 0 ...

0.509162

import numpy as np def getMatrixProduct(a, b): try: return np.matmul(a, b).tolist() except: return - 1

0.50905

class Solution: def matrixScore(self, A: List[List[int]]) -> int: def bitFlip(row): for i,r in enumerate(row): row[i] = 1-r return row # [print(a) for a in A] #For any rows with a leading 0 flip them ...

0.507087

def array_plus_array(arr1,arr2): return sum(arr1+arr2)

0.506519

class Solution: def maxScoreSightseeingPair(self, A: List[int]) -> int: curmaxsight = A[0] - 1 curmaxpair = 0 for sight in A[1:]: if sight + curmaxsight > curmaxpair: curmaxpair = sight + curmaxsight if sight > curmaxsight: curmaxsight ...

0.50486

from numpy import matrix def matrix_mult(a, b): return ( matrix(a) * matrix(b) ).tolist()

0.504816

class Solution: def maximumProduct(self, nums): """ :type nums: List[int] :rtype: int """ import heapq a, b = heapq.nlargest(3, nums), heapq.nsmallest(2, nums) return max(a[0]*a[1]*a[2], a[0]*b[0]*b[1])

0.504185

import sys input = sys.stdin.readline t = int(input()) for test in range(t): if test: input() n, m = list(map(int, input().split())) a = [-1] * m b = [-1] * m for i in range(m): a[i], b[i] = list(map(int, input().split())) l = [(a[i],0,i) for i in range(m)] + [(b[i],1,i) for i...

0.503169

class Solution: def maxUncrossedLines(self, A, B): # Optimization #commons = set(A).intersection(set(B)) # or commons = set(A) & set(B) #A = [x for x in A if x in commons] #B = [x for x in B if x in commons] N1, N2 = len(A), len(B) dp = [[0 for _ in range(N2+1)] for ...

0.501182

from sys import stdin n,m=list(map(int,stdin.readline().strip().split())) s=[] for i in range(n): s.append(list(map(ord,list(stdin.readline().strip())))) for j in range(m): s[-1][j]=s[-1][j]-97 ct=[tuple(map(int,stdin.readline().strip().split())) for i in range(n)] mc=[[0 for i in range(22)] for j in ra...

0.501018

def prod2sum(a, b, c, d): e = sorted([abs(a*d-b*c), abs(a*c+b*d)]) f = sorted([abs(a*c-b*d), abs(a*d+b*c)]) if e == f: return [e] else: return sorted([e, f])

0.500859

inp = input().split(' ') val=[]; totNums = int(inp[0]); totOpt = int(inp[1]); inp = input().split(' '); #assert(len(inp) == totNums); for it in inp: val.append(int(it)) dp = [[0.0 for _ in range(0,totNums)] for __ in range(0,totNums)] for i in range(0,totNums): for j in range(0,totNums): if val[i]>val[j]:...

0.500375

rnd_mod = 1234567890133 rnd_x = 987654321098 def rnd(): nonlocal rnd_x rnd_x = rnd_x**2 % rnd_mod return (rnd_x>>5) % (1<<20) def randrange(a): return rnd() % a T = int(input()) for _ in range(T): N, M = list(map(int, input().split())) X = [] for __ in range(N): X.append([int(a) for...

0.499435

def score_matrix(matrix): return sum((-1) ** (i+j) * matrix[i][j] for i in range(len(matrix)) for j in range(len(matrix[i])))

0.499429

from fractions import gcd def sum_differences_between_products_and_LCMs(pairs): return sum(a*b - a*b//gcd(a,b) for a, b in pairs if a and b)

0.498833

class Solution: def maxProductPath(self, grid: List[List[int]]) -> int: rows = len(grid) if (rows == 0): return -1 cols = len(grid[0]) if (cols == 0): return -1 dp = [(1,1)] * cols for r, col in enumerate(grid): fo...

0.497347

def main(): n, m = list(map(int, input().split())) aa = [] for _ in range(n): row = list(map(int, input().split())) row.append(0) aa.append(row) aa.append([0] * (m + 1)) d1, d2, d3, d4 = ([[0] * (m + 1) for _ in range(n + 1)] for _ in (1, 2, 3, 4)) for i in range(n): ...

0.496009

from collections import defaultdict as dd def find(a, b): n = len(a) m = len(b) dp = [[0]*(m+1) for i in range(n+1)] for i in range(n-1,-1, -1): for j in range(m-1, -1, -1): if a[i] == b[j]: dp[i][j] = dp[i+1][j+1] + 1 mx = dd(int) ans = 0 for i in range(n-1, -1, -1): for j in range(m-1, -1, -1): ...

0.495209

from functools import reduce from operator import mul def product(numbers): return reduce(mul, numbers) if numbers else None

0.495055

for _ in range(eval(input())): S1=input() m1=len(S1)/2 S2=input() m2=len(S2)/2 d1={} d2={} for i in range(len(S1)): c=S1[i] v=abs(m1-i) if c in d1: if v<d1[c][0]: d1[c]=[v,i] else: d1[c]=[v,i] for i in range(len(S2)...

0.494651

def find_dup(arr): return sum(arr) - len(arr)*(len(arr)-1)/2 #your code here

0.494077

import sys readline = sys.stdin.readline def ceil(a, b): return -(-a//b) def main(): N = int(readline()) inp = [tuple(map(int, readline().rstrip().split())) for _ in range(N)] scr_t, scr_a = 0, 0 for t, a in inp: if t >= scr_t and a >= scr_a: scr_t = t scr_a = a ...

0.493869

import numpy as np for _ in range(int(input())): ans = np.float('inf') n, m = (int(x) for x in input().split()) sig = np.zeros((n,m)) img = np.zeros((3*n,3*m)) for row in range(n): sig[row,:] = np.array([int(x) for x in input()]) for row in range(n): img[row+n,m:2*m] = np.array([int(x) for x in input()]) for...

0.493858

n = int(input()) a = [[], []] a[0] = list(map(int, input().split())) a[1] = list(map(int, input().split())) b = list(map(int, input().split())) ans = float('+inf') for i in range(n): for j in range(n): if i == j: continue cur = sum(a[1][i:]) + sum(a[0][:i]) + sum(a[0][:j]) + sum(a[1][j:]) + b[i] + b[j] ans =...

0.492403

def combs(a, b): return min(mesh(a, b), mesh(b, a)) def mesh(a, b): for i in range(len(a)): for j, k in zip(a[i:], b): if j + k == '**': break else: return max(i + len(b), len(a)) return len(a) + len(b)

0.492041

""" Codeforces Round 251 Div 2 Problem D Author : chaotic_iak Language: Python 3.3.4 """ def read(mode=2): # 0: String # 1: List of strings # 2: List of integers inputs = input().strip() if mode == 0: return inputs if mode == 1: return inputs.split() if mode == 2: ...

0.491563

t=eval(input()) for i in range(0,t): x=input() nm=x.split(' ') nm[0]=int(nm[0]) nm[1]=int(nm[1]) csoint=[] lsoint=[] csofloat=[] lsofloat=[] for j in range(0,nm[0]): a=input() b=a.split(' ') b[0]=int(b[0]) b[1]=int(b[1]) csoint.append(b[0]) ...

0.491332

class Cashier: def __init__(self, n: int, discount: int, products: List[int], prices: List[int]): self.n = n self.count = 0 self.discount = discount self.products = {} for i in range(0, len(products)): self.products[products[i]] = p...

0.490507

n,m=map(int,input().split()) b=list(map(int,input().split())) g=list(map(int,input().split())) if max(b)>min(g): print(-1) else: maxi=0 maxi2=0 for guy in b: if guy>maxi: maxi2,maxi=maxi,guy elif guy>maxi2: maxi2=guy sumi=m*sum(b)+sum(g)-m*maxi+maxi-maxi2 ...

0.488311

import collections import math input() a = list(map(int, input().split())) b = list(map(int, input().split())) counts = collections.defaultdict(int) arbitrary = 0 for ai, bi in zip(a, b): if ai == 0: if bi == 0: arbitrary += 1 else: if bi == 0: counts[(0, 0)] += 1 ...

0.487526

n=eval(input()) grades=list(map(int,input().split())) m=eval(input()) for df in range(m): x,y=list(map(int,input().split())) arr=[] arr=grades[x-1:y] arr.sort() sum=0 #arr.append(1000000) for nh in range(0,len(arr)-1,1): sum=sum+(arr[nh+1]-arr[nh])**2 #print sum,len(arr),nh+1,nh print(sum)

0.487112

from itertools import islice from functools import reduce def greatest_product(n): numbers=[int(value) for value in n] result=[reduce(lambda x,y: x*y, islice(numbers, i, i+5), 1) for i in range(len(numbers)-4)] return max(result)

0.486748

def array_madness(a,b): return sum(x ** 2 for x in a) > sum(x **3 for x in b)

0.485613

def check(M): sm = 0 for i in range(n): if a[i] > M: sm += b[i] return sm <= M gans = [] for _ in range(int(input())): n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) L = 0 R = max(a) while R - L > 1: M = (L + R) ...

0.485042

from heapq import * def add_all(lst): heapify(lst) total = 0 while len(lst) > 1: s = heappop(lst) + heappop(lst) total += s heappush(lst, s) return total

0.484632

class Solution: def getSum(self, a, b): max = 0x7FFFFFFF mask = 0xFFFFFFFF while b != 0: a, b = (a ^ b) & mask, ((a & b) << 1) & mask return a if a <= max else ~(a ^ mask)

0.484031

n = int(input()) a = [int(x) for x in input().strip()] b = [int(x) for x in input().strip()] p, q, r, s = 0, 0, 0, 0 for i in range(n): if a[i] * 2 + b[i] == 0: p += 1 if a[i] * 2 + b[i] == 1: q += 1 if a[i] * 2 + b[i] == 2: r += 1 if a[i] * 2 + b[i] == 3: s += 1 print(p*...

0.483343

class Solution: def minFallingPathSum(self, A: List[List[int]]) -> int: dp = [A[0][:], [0 for _ in A[0]]] for i in range(1, len(A)): for j in range(len(A[i])): dp[i & 1][j] = min([dp[(i - 1) & 1][j + k] for k in (-1, 0, 1) if 0 <= j + k < len(A[i])]) + A[i][j] ret...

0.483056

from operator import mul from functools import reduce def product_array(numbers): tot = reduce(mul,numbers) return [tot//n for n in numbers]

0.483035

from collections import Counter n, m = map(int, input().split()) l = [input() for _ in range(n)] v = [*map(int, input().split())] res = 0 for i in range(m): res += v[i] * max(Counter(s[i] for s in l).values()) print(res)

0.482643

class Solution: def findMedianSortedArrays(self, nums1, nums2): """ :type nums1: List[int] :type nums2: List[int] :rtype: float """ nums = nums1 + nums2 nums.sort() if len(nums) % 2 == 1: return float(nums[len(nums)//2]) ...

0.481429

class Solution: def maxValueAfterReverse(self, nums: List[int]) -> int: n = len(nums) base = sum([abs(nums[i] - nums[i+1]) for i in range(n - 1)]) if (n <= 2): return base #best = base #for i in range(n-1): # for j in range(i+1, n): # ...

0.481374

n = int(input()) h1 = list(map(int, input().split())) h2 = list(map(int, input().split())) r1 = r2 = 0 for i in range(n): r1, r2 = max(r1, r2 + h1[i]), max(r2, r1 + h2[i]) print(max(r1, r2))

0.48125

def find_dup(arr): return sum(arr) - sum(range(1, max(arr)+1))

0.481123

def paperwork(n, m): return n * m if n > 0 and m > 0 else 0

0.480878

class Solution: def numSubmat(self, mat: List[List[int]]) -> int: n, m = len(mat), len(mat[0]) heights = [0] * m res = 0 for i in range(0, n): stack = [] count = 0 for j in range(0, m): if mat[i][j] == 1: heights...

0.480868

class Solution: def minFallingPathSum(self, arr: List[List[int]]) -> int: dp = [0] * len(arr[0]) for r, row in enumerate(arr): minNb = min(dp) min1 = dp.index(minNb) dp[min1] = float('inf') min2 = dp.index(min(dp)) dp[min1] = minNb ...

0.480648

Given a string text, we are allowed to swap two of the characters in the string. Find the length of the longest substring with repeated characters. Example 1: Input: text = "ababa" Output: 3 Explanation: We can swap the first 'b' with the last 'a', or the last 'b' with the first 'a'. Then, the longest repeated charac...

class Solution: def maxRepOpt1(self, text: str) -> int: letters = {} for i, char in enumerate(text): if char in letters: letters[char].append(i) else: letters[char] = [i] if len(letters) == 1: return len(text) ...

0.733203

class Solution: def lengthOfLongestSubstring(self, s): """ :type s: str :rtype: int """ L, res, last = -1, 0, {} for R, char in enumerate(s): if char in last and last[char] > L: L = last[char] elif R-L > res: ...

0.717053

class Solution: def maxPower(self, s: str) -> int: n = len(s) count = 0 res = s[0] cur_count = 1 # Traverse string except # last character for i in range(n): # If current character # matches with next ...

0.677923

class Solution: def longestDecomposition(self, text: str) -> int: n = len(text) splits = 0 leftstart, leftend = 0, 0 rightstart, rightend = n-1, n-1 while leftend<rightstart: if text[leftstart:leftend+1] == text[rightstart:rightend+1]: leftstart = ...

0.675576

class Solution: def maxUniqueSplit(self, s: str) -> int: self.x, n = 0, len(s) def maxUniqueSplit_(i=0, S=set()): if s[i:] not in S: self.x = max(self.x, len(S) + 1) for j in range(i + 1, n): if s[i : j] not in S and len(S) + 1 + n...

0.664169

class Solution: def longestAwesome(self, s: str) -> int: cum = [0] firsts = {0: -1} lasts = {0: -1} for i, c in enumerate(s): cum.append(cum[-1] ^ (1 << (ord(c) - 48))) if cum[-1] not in firsts: firsts[cum[-1]] = i lasts[cum[-1]] = ...

0.657185

class Solution: def longestDupSubstring(self, S): nums, N = [ord(c) - ord('a') for c in S], len(S) BASE, MOD = 26, 2**32 def check(L): cur_hash, seen = 0, set() for val in nums[:L]: cur_hash = (cur_hash * BASE + val) % MOD seen.add(cur_hash...

0.656081

class Solution: def longestPalindrome(self, s): """ :type s: str :rtype: int """ re = 0 set_s = set(s) flag = False for x in set_s: if s.count(x) % 2 == 0: re += s.count(x) elif s.count(x) >= 3 : ...

0.651644

""" *************************************** * O(n) time complexity solution ! * *************************************** """ def longest_palindrome (s): maxPal, tmpPal = 0, 1 count_dct = {} inPal = False for i,l in enumerate(s): count_dct[l] = count_dct.get(l,0) + 1 ...

0.647084

class Solution: def minDeletionSize(self, A: List[str]) -> int: dp = [(1, 1)] * len(A[0]) for i in range(len(dp)): if i > 0: max_pre = None for pre in range(i - 1, -1, -1): for word in A: if word[pre] > word[i]: ...

0.645515

class Solution: def maxLength(self, arr: List[str]) -> int: def digit_representation(s): ans = 0 for c in s: ans |= 1<<(ord(c)-ord('a')) return ans A = sorted([(len(s), digit_representation(s)) for s in set(arr) if len(set(s))==len(s)], re...

0.644622

# # abc096 b # import sys from io import StringIO import unittest from collections import Counter class TestClass(unittest.TestCase): def assertIO(self, input, output): stdout, stdin = sys.stdout, sys.stdin sys.stdout, sys.stdin = StringIO(), StringIO(input) resolve() sys.stdout.se...

0.641864

s=input() dp=[[0,0,0] for i in range(len(s))] for i in range(len(s)): if s[i]=='a': dp[i][0]=dp[i-1][0]+1 dp[i][1]=dp[i-1][1] dp[i][2]=max(dp[i-1][1]+1,dp[i-1][2]+1) else: dp[i][0]=dp[i-1][0] dp[i][1]=max(dp[i-1][0]+1,dp[i-1][1]+1) dp[i][2]=dp[i-1][2] e=len(s)-1 p...

0.64068

# class Solution: # def distinctEchoSubstrings(self, text: str) -> int: # ans = set() # for i in range(len(text)-1): # for j in range(i+1, (i+len(text))//2+1): # if text[i:j] == text[j:2*j-i]: ans.add(text[i:j]) # return len(ans) from collectio...

0.634831

class Solution: def findSubstringInWraproundString(self, p): """ :type p: str :rtype: int """ pc = None sl = 0 ll = {} for c in p: if pc and (ord(pc) + 1 == ord(c) or (pc == 'z' and c == 'a')): sl += 1 ...

0.631219

class Solution: def findTheLongestSubstring(self, s: str) -> int: s = s + 'a' bits, dp = {'a':0,'e':1,'i':2,'o':3,'u':4}, {0:-1} res = 0 key = 0 for i, char in enumerate(s): if char in bits: if key in dp: res = m...

0.630596

'''input abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxy...

0.627423

class Solution: def longestStrChain(self, words: List[str]) -> int: by_length = collections.defaultdict(set) for word in words: by_length[len(word)].add(word) longest = 1 seen = {*()} mx = len(by_length) mn = min(by_length) for length in sorted(b...

0.623313

class Solution: def countSubstrings(self, s): """ :type s: str :rtype: int """ ret = 0 left, right = 0, 0 while left < len(s): while right < len(s) and s[right] == s[left]: right += 1 ret += self.sum(right - l...

0.620908

n = int(input()) arr = input() final = len(arr) arr = arr.split() lens = [0 for x in range(n)] visit = [0 for x in range(n)] cnt = 0 ans = 0 for i in range(n): if visit[i]: continue lens[cnt] = len(arr[i]) for j in range(i+1,n): if arr[j]==arr[i]: arr[j] = cnt visit[j] = 1 arr[i] = cnt cnt...

0.619545

def main(): n = int(input()) a = [input() for i in range(n)] result = 0 for i in range(26): for j in range(i + 1, 26): t = 0 ci = chr(i + ord('a')) cj = chr(j + ord('a')) for s in a: if s.count(ci) + s.count(cj) == len(s): ...

0.612957

t = [0] * 26 def get_k(c): return ord(c) - ord('a') def analyze(s): length_of_str = len(s) pos = 0 beauty_table = [0] * 26 for i in range(1, length_of_str): if s[i] != s[pos]: k = get_k(s[pos]) beauty_table[k] = max(beauty_table[k], i - pos) pos = i ...

0.611732

from collections import Counter def longest_palindrome(s): c = Counter(filter(str.isalnum, s.lower())) return sum(v//2*2 for v in c.values()) + any(v%2 for v in c.values())

0.610786

class Solution: def longestSubstring(self, s, k): """ :type s: str :type k: int :rtype: int """ for c in set(s): if s.count(c) < k: return max(self.longestSubstring(sp, k) for sp in s.split(c)) return len(s)

0.607917

class Solution: def longestCommonSubsequence(self, a: str, b: str) -> int: last, current = [0] * (len(b) + 1), [0] * (len(b) + 1) for i in range(len(a) - 1, -1, -1): for j in range(len(b) - 1, -1, -1): if a[i] == b[j]: current[j] = 1 + last[j ...

0.60492

s = input() cur_len = 1 a = [] char = [] for i in range(1, len(s)): if s[i] == s[i-1]: cur_len += 1 else: a.append(cur_len) char.append(s[i-1]) cur_len = 1 a.append(cur_len) char.append(s[len(s)-1]) ans = 0 while len(a) > 1: n = len(a) inner_min = 100000000 for i in range(...

0.603023

class Solution: def numSplits(self, s: str) -> int: left = [0]*len(s) unique = set() n_distinct = 0 for i, l in enumerate(s): if l not in unique: unique.add(l) n_distinct += 1 left[i] = n_distinct count...

0.599868

n = int(input()) s = input() j = 1 result = [] for i in range(n): while (j < n-1) and (s[i:j] in s[j:]): j += 1 result.append(j-i-1) print(max(result))

0.594019

N=int(input()) S=input() ans=S[0] for s in S: if ans[-1]!=s: ans+=s print(len(ans))

0.589007

from itertools import groupby def count_repeats(s): return len(s) - len(list(groupby(s)))

0.588654

# cook your dish here st=input().strip() b=[] for i in range(len(st)): for j in range(i+1,len(st)): if st[i]!=st[j]: z=abs(i-j) b.append(z) print(max(b))

0.584189

class Solution: def removePalindromeSub(self, s: str) -> int: # 'a' 1 # 'aa' 1 # 'ab' 2 # 'abb' 2 # 'aabb' 2 # 'abba' 1 # 'abaaba' if len(s) == 0: return 0 if s == s[::-1]: return 1 return 2

0.580974

str = input() l = len(str) a = [0] * (2 * l) pos = [[] for i in range(26)] for i, c in enumerate(str): t = ord(c) - ord('a') a[i] = t a[i + l] = t pos[t].append(i) ans = 0 for c in range(26): cur = 0 for k in range(1, l): cnt = [0] * 26 for i in pos[c]: cnt[a[i + k]] ...

0.580749

from collections import * c=Counter() ans=n=int(input()) s=input() k=len(set(s)) i=j=t=0 while j<n: while len(c)<k and j<n: c[s[j]]+=1; j+=1 while len(c)==k: if j-i<ans: ans=j-i c[s[i]]-=1 if c[s[i]]==0: del c[s[i]] i+=1 print(ans)

0.579167

def list_input(): return list(map(int,input().split())) def map_input(): return map(int,input().split()) def map_string(): return input().split() n = int(input()) a = list(input()) ans = 0 for i in range(n): for j in range(i,n): b = a[i:j+1] for k in b: if k.lower() != k: break else: ...

0.578953

def solve(s): return max(map(len, ''.join(c if c in 'aeiou' else ' ' for c in s).split()))

0.578341

from sys import stdin,stdout import math,bisect from datetime import date from collections import Counter,deque,defaultdict L=lambda:list(map(int, stdin.readline().strip().split())) M=lambda:list(map(int, stdin.readline().strip().split())) I=lambda:int(stdin.readline().strip()) S=lambda:stdin.readline().strip() C=lambd...

0.576431

class Solution: def getMaxRepetitions(self, s1, n1, s2, n2): """ :type s1: str :type n1: int :type s2: str :type n2: int :rtype: int """ if s2=='aac' and n2==100: return 29999 i,j=0,0 l1=len(s1) l2=len(s...

0.57379

def solve(st): return next((n for n in range(len(st)//2, 0, -1) if st[:n] == st[-n:]), 0)

0.572165

def solution(s): st=[1 for i in range(1,len(s)) if s[i-1]==s[i]] return sum(st)

0.571196

class Solution: def isvalid(self,C): if len(C)>2: return False if len(C)==1: a = min(C) if a==1 or C[a]==1: # EXPLANATION: # a==1 : All lengths are unitary like A=[1,2,3,4,...], so poping anything is fine # C[a...

0.570591

class Solution: def characterReplacement(self, s, k): """ :type s: str :type k: int :rtype: int """ if s == "": return 0 count = {} lo = 0 hi = 0 max_letter = 0 for hi in range(len(s)): try:...

0.569115

#credits https://www.geeksforgeeks.org/minimum-steps-to-delete-a-ssing-after-repeated-deletion-of-palindrome-subssings/ n=int(input()) s=input() N = len(s) dp = [[0 for x in range(N + 1)] for y in range(N + 1)] D = [[[] for x in range(N + 1)] for y in range(N + 1)] ss="" re="" for i in range(0,N)...

0.564855

s = input() n = len(s) dp = [[0 for i in range(n - le + 1)] for le in range(n + 1)] ans = [0 for i in range(n + 1)] for le in range(1, n + 1): for l in range(0, n - le + 1): r = l + le if s[l] != s[r - 1]: continue if le == 1: dp[1][l] = 1 ans[1] += 1 ...

0.564453

def string_constructing(a, s): if len(s) == 0: return 0 i = -1 for j, c in enumerate(s): i = a.find(c, i+1) if i < 0 or i == len(a) - 1: break return len(a) - j + (i < 0) + string_constructing(a, s[j + (i >= 0):])

0.563408

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline mii=lambda:list(map(int,input().split())) s=input().strip() d=[0]*1000 e=[0]*1000 hist=[0]*26 for i in s: j=ord(i)-ord('a') for k in range(26): e[k*26+j]+=hist[k] hist[j]+=1 d[j]+=1 print(max(d+e))

0.563365

def binarySearch(arr, l, r, x): mid=0 while l <= r: mid = l + (r - l)//2; if arr[mid] == x: return mid+1 elif arr[mid] < x: l = mid + 1 else: r = mid - 1 if mid!=len(arr): if arr[mid]<x: return mid+1 return mid s=input() strt=[] end=[] plc=[] landr=[] l2r=[] lr=[] ans=0 n=len(s) if n!=1:...

0.561285

class Solution: def maxScore(self, s: str) -> int: maxi=0 for i in range(1,len(s)): a=s[:i] b=s[i:] maxi=max(a.count('0')+b.count('1'),maxi) return maxi

0.560058

def duplicate_count(s): return len([c for c in set(s.lower()) if s.lower().count(c)>1])

0.559495

class Solution(object): def longestPalindrome(self, s): """ :type s: str :rtype: str """ size = len(s) if size <= 1 or s == s[::-1]: return s start, maxlen = 0, 1 for idx in range(1, size): add2 = s[idx - maxlen - 1: ...

0.556033

# cook your dish here n = int(input()) s = [i for i in input()] count = 0 for i in range(1,n): if s[i] == s[i-1]: count += 1 else: continue print(count)

0.55585

n = int(input()) s = input() r = 0 for i in range(1, n): if s[i] == s[i - 1]: r += 1 print(r)

0.552091

class Solution: def uniqueLetterString(self, s: str) -> int: chrLoc = defaultdict(list) ct = 0 md = 1000000007 l = len(s) for i, c in enumerate(s): chrLoc[c].append(i) for c in chrLoc: locs = [-1] + chrLoc[c] + [l] loc_ct =...

0.550413

class Solution: def findShortestSubArray(self, nums): diction = {} for i in nums: if i not in diction: diction[i] = 1 else: diction[i] += 1 degree = max(list(diction.values())) ...

0.548528

class Solution: def numSpecialEquivGroups(self, A: List[str]) -> int: return len(set(''.join(sorted(s[0::2])) + ''.join(sorted(s[1::2])) for s in A))

0.546711

class Solution: def findLUSlength(self, strs): """ :type strs: List[str] :rtype: int """ def isSubseq(s1, s2): i, m=0, len(s1) for c in s2: if i==m: return True if s1[i]==c: i+=1 return i==m ...

0.54465

# cook your dish here for _ in range(int(input())): s=input() count=0 i=0 while i<len(s)-1: ch=s[i] j=i+1 while j<len(s) and s[j]==ch: j+=1 l=j-i if i!=0 and j!=len(s) and s[i-1]==s[j] : count+=1 count+=l*(l-1)//2 #print(s[i:j],count) i=j print(count)

0.542148

alp = "abcdefghijklmnopqrstuvwxyz" dic = {} for i,s in enumerate(alp): dic[s] = i lis = [0] * 27 n = int(input()) S = input() ans = [] for i,s in enumerate(S): ind = dic[s] ans.append(max(lis[ind+1:]) + 1) lis[ind] = ans[-1] print(max(ans)) print(" ".join(map(str,ans)))

0.540778

def longest(words): return max(map(len, words))

0.539958

from itertools import groupby def main(): N = int(input()) S = input() C = [len(list(x[1])) for x in groupby(S)] M = len(C) dup_idx = [] for i, c in enumerate(C): if c > 1: dup_idx.append(i) dup_idx.reverse() curr = 0 while dup_idx: i = dup_idx[...

0.53993

class Solution: def minDeletionSize(self, A: List[str]) -> int: def isSorted(arr, i, j): return all(arr[k] <= arr[k+1] for k in range(i, j)) ans = 0 ranges = [[0, len(A)-1]] for col in zip(*A): if not ranges: break if all(isSorted(c...

0.539716

def solve(a, b): if len(a) is 1: return b.count(a) index = [x for x in range(len(b)-1) if b[x] is a[0]] return sum(solve(a[1:], b[x+1:]) for x in index)

0.539414

class Solution: def distinctSubseqII(self, s: str) -> int: n = len(s) MOD = 10**9 + 7 seen = dict() a = 1 for i in range(n): char = s[i] b = 2 * a if char in seen: b -= seen[char] b %= MOD ...

0.538947

s = input() mx = 0 n = len(s) for l in range(n): for r in range(l, n): if s[l:r+1] != s[l:r+1][::-1]: mx = max(mx, r - l + 1) print(mx)

0.538397

s = input() res = set() for i in range(len(s) + 5): s = s[1:] + s[0] res.add(s) print(len(list(res)))

0.537668

def prefix1(a, b): cnt = 0 for i, j in zip(a, b): if i == j: cnt += 1 else: return cnt return cnt def prefix2(a, b, num): for i in range(num, -1, -1): if b.startswith(a[:i]): return i def zfunc(str_): z = [] k = len(str_) for i ...

0.537484

for _ in range(int(input())): st=input().replace("=","") if not len(st):print(1) else: cu=mx=1 for j in range(1,len(st)): if st[j]==st[j-1]:cu+=1 else:mx=max(mx,cu);cu=1 print(max(mx+1,cu+1))

0.537059

t = int(input()) for j in range(0, t): n = int(input()) m = 100 for i in range(0, n): str = input() p = min(str.count("a",0,len(str)),str.count("b",0,len(str))) if (m > p): m = p print(m) t = t-1

0.537035

class Solution: def findLength(self, A, B): def check(length): seen = {A[i:i+length] for i in range(len(A) - length + 1)} return any(B[j:j+length] in seen for j in range(len(B) - length + 1)) A = ''.join(map(chr, A)) ...

0.536314

class Solution: def lastSubstring(self, s: str) -> str: #mx = \"\" #for i in range(len(s)): # mx = max(mx,s[i:]) #return mx index = {c: i for i, c in enumerate(sorted(set(s)))} cur, radix, max_val, max_i = 0, len(index), 0, 0 for i in range(len(s)-1, -1, -1...

0.535872

n = int(input()) d = {} for i in range(n): s = input() if s in d: d[s] += 1 else: d[s] = 1 print(d[max(d,key=d.get)])

0.532709

''' Write a function that returns the longest contiguous palindromic substring in s. In the event that there are multiple longest palindromic substrings, return the first to occur. ''' def longest_palindrome(s, sep=" "): # Interpolate some inert character between input characters # so we only hav...

0.532163

class Solution: def maxUncrossedLines(self, A, B): # Optimization #commons = set(A).intersection(set(B)) # or commons = set(A) & set(B) #A = [x for x in A if x in commons] #B = [x for x in B if x in commons] N1, N2 = len(A), len(B) dp = [[0 for _ in range(N2+1)] for ...

0.53062

class Solution: def kSimilarity(self, A: str, B: str) -> int: a = '' b = '' for i in range(len(A)): if A[i] != B[i]: a+=A[i] b+=B[i] return self.dfs(a,b) def dfs(self,a,b): if not a: ...

0.528546

class Solution: def minDeletionSize(self, A: List[str]) -> int: return sum([list(col) != sorted(col) for col in zip(*A)])

0.528277

n = int(input()) st = input() ans = n i = 1 while i < n: if st[i - 1] != st[i]: ans -= 1 i += 1 i += 1 print(ans)

0.527727

from sys import stdin input = stdin.readline n = int(input()) s = list(input().strip()) for i in range(26): char = chr(ord('z') - i) prev = chr(ord('z') - i - 1) updated = True while updated: updated = False for idx in range(len(s)-1, -1, -1): if s[idx] == char: ...

0.52755

from collections import defaultdict as dd def find(a, b): n = len(a) m = len(b) dp = [[0]*(m+1) for i in range(n+1)] for i in range(n-1,-1, -1): for j in range(m-1, -1, -1): if a[i] == b[j]: dp[i][j] = dp[i+1][j+1] + 1 mx = dd(int) ans = 0 for i in range(n-1, -1, -1): for j in range(m-1, -1, -1): ...

0.526866

def solve(st): return sorted((st.find(c) - st.rfind(c), c) for c in set(st))[0][1]

0.526685

from collections import Counter class Solution: def longestArithSeqLength(self, A: List[int]) -> int: c = dict(Counter(A).most_common()) # print(c) m1 = max(c.values()) # A = list(set(A)) # A.sort() index = {} # for i in range(len(A)): # index[A[i]...

0.525867

from sys import stdin from heapq import heappop, heappush, heapify def main(): n = int(stdin.readline()) a = stdin.readline().split() q = [] p = 0 c = 0 l = [0] * (n + 1) r = [0] * (n + 1) k = [0] * (n + 1) pa = [0] * (n + 1) for i, x in enumerate(a): if x == a[p]: ...

0.525502

from collections import Counter def only_duplicates(string): cs = Counter(string) return ''.join(c for c in string if cs[c] > 1)

0.525331

w=list(input());n=len(w);t=-1 def Z(s): m=len(s);z=[0]*m;c=0;f=[1]*m; for i in range(1,m): if i+z[i-c]<c+z[c]:z[i]=z[i-c] else: j=max(0,c+z[c]-i) while i+j<n and s[j]==s[i+j]:j=j+1 z[i]=j;c=i for p in range(1,m): for k in range(2,z[p]//p+2):f[k*p-1...

0.524719

import re def solve(s): return max(sum(ord(c)-96 for c in subs) for subs in re.split('[aeiou]+', s))

0.523786

class Solution: def getLengthOfOptimalCompression(self, s: str, k: int) -> int: n = len(s) def compLen(c): return 1 + len(str(c)) if c > 1 else 1 @lru_cache(None) def dp(i, k): # return {head: (len, -head_count)} if (n - i) <= k: return {} # ...

0.523384

def codn1(s1,s2,p): c=0 ind=0 for i in range(len(s1)): if s1[i]!=s2[i]: c+=1 ind=i if c>1 or ind==len(s1)-1: return 0 if s1[ind]>s2[ind] and s1[ind] in s2[ind+1:]: p[0]=True if s1[ind]<s2[ind] and s2[ind] in s1[ind+1:]: p[1]=True return 1 def codn2(s1,s2): if len(s1)<len(s2): ...

0.522381

g = "ACTG" def dist(a, b): p = abs(ord(a) - ord(b)) return min(p, 26 - p) def price(s): return sum(dist(x, y) for x, y in zip(g, s)) n = int(input()) s = input() ans = 100000 for i in range(len(s) - 3): ans = min(ans, price(s[i:i+4])) print(ans)

0.521918

class Solution: def longestPrefix(self, strn: str) -> str: max_prefs = [0]*len(strn) curr = 0 for idx in range(1, len(strn)): while True: if curr == 0: if strn[idx] == strn[0]: curr = 1 max_prefs[idx...

0.521058

import sys input = sys.stdin.readline n=int(input()) s=list(input().strip()) ANS=0 for i in range(0,n,2): if s[i]==s[i+1]: ANS+=1 if s[i]=="a": s[i]="b" else: s[i]="a" print(ANS) print("".join(s))

0.520872

import sys from math import * def minp(): return sys.stdin.readline().strip() def mint(): return int(minp()) def mints(): return map(int, minp().split()) def add(a,b): return (a+b)%1000000007 def sub(a,b): return (a+1000000007-b)%1000000007 def mul(a,b): return (a*b)%1000000007 p = 102367 s = list(map(int,...

0.520286

n,pos= (int(x) for x in input('').split()) s = input('') def dis(a, b): a=ord(a) b=ord(b) return min(abs(a - b), abs(a+26-b), abs(b+26-a)) d = [dis(s[i], s[len(s)-i-1]) for i in range((len(s) + 1)//2)] pos -= 1 if pos >= (len(s) + 1) // 2: pos = len(s) - pos - 1 #print(pos) #print(d) for rightmost, ...

0.52028

from re import findall; repeat_adjacent=lambda s: len(findall(r"((.)\2+(?!\2)){2,}",s))

0.519522

def levenshtein(a,b): d = [[0] * (len(b) + 1) for _ in range(len(a) + 1)] d[0][:] = list(range(len(b)+1)) for i in range(1, len(a) + 1): d[i][0] = i for i, x in enumerate(a): for j, y in enumerate(b): d[i+1][j+1] = min(1 + d[i][j+1], 1 + d[i+1][j], d[i][j] + (1 if x != y el...

0.519224

from os.path import commonprefix def string_suffix(s): return sum(len(commonprefix([s, s[i:]])) for i in range(len(s)))

0.518003

class Solution: def minCost(self, s: str, cost: List[int]) -> int: delete_cost = 0 last = 0 for i in range(1, len(s)): if s[last] == s[i]: if cost[last] < cost[i]: delete_cost += cost[last] last = i else: ...

0.517576

from string import ascii_lowercase class Solution: def removeDuplicates(self, S: str) -> str: dup = {2*ch for ch in ascii_lowercase} prev_length = -1 while prev_length!=len(S): prev_length = len(S) for d in dup: S = S.replace...

0.517227

n = int(input()) s = input() tab = [] count = 1 for i in range(1, n): if s[i] == s[i-1]: count += 1 else: if count > 0: tab.append(count) count = 1 if count > 0: tab.append(count) dis = 0 k = len(tab) if k == 0 or k == 1: dis = 0 else: dis += tab[1] dis += tab[-2] dis -= (k-1) for i in range(1, k - 1):...

0.516479

from operator import mul from functools import reduce from collections import Counter from math import factorial as fact def uniq_count(s): return fact(len(s)) // reduce(mul, map(fact, Counter(s.lower()).values()), 1)

0.515642

import sys readline = sys.stdin.readline readlines = sys.stdin.readlines ns = lambda: readline().rstrip() ni = lambda: int(readline().rstrip()) nm = lambda: map(int, readline().split()) nl = lambda: list(map(int, readline().split())) prn = lambda x: print(*x, sep='\n') def solve(): n = ni() s = nl() dp =...

0.514779

class Solution: def findLUSlength(self, a, b): """ :type a: str :type b: str :rtype: int """ return max(len(a),len(b)) if a != b else -1

0.514548

from collections import Counter class Solution: def reorganizeString(self, S): """ :type S: str :rtype: str """ if len(S) <= 1: return S chars = [char for char, count in Counter(S).most_common() for _ in range(count)] h = math.ceil(...

0.514505

Given a binary string s and an integer k. Return True if every binary code of length k is a substring of s. Otherwise, return False. Example 1: Input: s = "00110110", k = 2 Output: true Explanation: The binary codes of length 2 are "00", "01", "10" and "11". They can be all found as substrings at indicies 0, 1, 3 and...

class Solution: def hasAllCodes(self, s: str, k: int) -> bool: if len(s) < 2 ** k + k - 1: return False # Cannot be a string, as this is the de brujin length target = 2 ** k seen = set() cur_len = 0 for end in range(k, len(s) + 1): chunk = s[end - k: e...

0.830288

from collections import Counter class Solution: def canConstruct(self, s: str, k: int) -> bool: if k > len(s): #return False return False counter = Counter(s) odd_counts = 0 for char in counter: if counter[char] % 2 == 1: odd_counts +=...

0.739199

class Solution: def kLengthApart(self, nums: List[int], k: int) -> bool: if nums.count(0) == len(nums): return True idx = nums.index(1) ctr = 0 for num in nums[idx+1:]: if num == 1: if ctr < k: return False...

0.694392

#!/usr/bin/env python3 def __starting_point(): x, k = map(int, input().strip().split()) string = input().strip() if eval(string) == k: print(True) else: print(False) __starting_point()

0.69046

def bel(mask, bit): return (mask & (1 << bit)) != 0 read = lambda: map(int, input().split()) n, k = read() f = [0] * 100 for i in range(n): cur = int(''.join(input().split()), 2) cur ^= (1 << k) - 1 f[cur] = 1 ans = 'NO' if k == 1: if f[1]: ans = 'YES' if k == 2: f1 = f2 = 0 for i in...

0.670907

import sys input = sys.stdin.readline rInt = lambda: int(input()) mInt = lambda: map(int, input().split()) rLis = lambda: list(map(int, input().split())) outs = [] t = rInt() for _ in range(t): n, k = mInt() s = input() pref = [0] for c in s: if c == '1': pref.append(pref[-1] + 1)...

0.656795

import sys INF = 10**20 MOD = 10**9 + 7 I = lambda:list(map(int,input().split())) from math import gcd from math import ceil from collections import defaultdict as dd, Counter from bisect import bisect_left as bl, bisect_right as br def solve(): n, k = I() s = input() ans = 0 last = -INF for i in range(n): ...

0.653938

n, k = list(map(int, input().split())) s = list(input()) if len(s) == 1 and k: print(0) return if s[0] != '1' and k: k -= 1 s[0] = '1' for i in range(1, len(s)): if s[i] != '0' and k: s[i] = '0' k -= 1 if not k: break print(''.join(s))

0.644974

from itertools import permutations def solve(s,k): return sum(not v%k for v in map(int, map(''.join, permutations(s.split(),2))))

0.643338

def main(): N, K = list(map(int, input().split())) S = list(input()) base = S[0] flag = False for i in range(0, N): if K == 0: break if S[i] != base and (not flag): flag = True S[i] = base elif S[i] != base and flag: S[i] = base...

0.642621

class Solution: def longestOnes(self, A: List[int], K: int) -> int: hulu = [] cnt = 0 num = A[0] for x in A: if x == num: cnt += 1 else: hulu.append([num,cnt]) cnt = 1 num = x if cnt>0: ...

0.638341

class Solution: def isPossibleDivide(self, s: List[int], k: int) -> bool: if len(s) % k != 0: return False ctr = collections.Counter(s) for _ in range(len(s) // k): mn = [] for i in ctr: if mn == [] and ctr[i] > 0: ...

0.6285

class Solution: def findKthBit(self, n: int, k: int) -> str: i = n - 1 invert = False while i > 0: half_len = (2**(i + 1) - 1) // 2 if k == half_len + 1: return '1' if not invert else '0' if k > half_len: k = h...

0.627251

class Solution: def numberOfArrays(self, s: str, k: int) -> int: dp = [-1] * len(s) return self.dfs(s, k, 0, dp) def dfs(self, s: str, k: int, start: int, dp: List[int]) -> int: if start == len(s): return 1 if s[start] == '0': return 0 if dp[s...

0.626154

def bin_str(s): return s.count("10") * 2 + (s[-1] == "1")

0.61751

class Solution: def queryString(self, S: str, N: int) -> bool: for i in range(1,N+1): b = bin(i).replace('0b','') if b not in S: return False return True

0.617268

def check(pali): for i in range(len(pali) // 2): if pali[i] != pali[-i - 1]: return False return True def __starting_point(): s = input() k = int(input()) if len(s) % k != 0: print('NO') return step = len(s) // k for i in range(k): if not chec...

0.612543

def check(s,k): for i in range(k+1): if chr(ord('0')+i) not in s: return False return True n, k = map(int,input().split()) ans = 0 for i in range(n): ss = input() if check(ss,k): ans +=1 print(ans)

0.610924

# import sys # sys.setrecursionlimit(10 ** 6) # import bisect # from collections import deque # from decorator import stop_watch # # # @stop_watch def solve(N, K, S): S = [int(s) for s in S] point_l = 0 point_r = 0 # decision r num_0 = 0 if S[0] == 1 else 1 flg = S[0] for i in range(N): ...

0.610475

s = input().split() k = int(s[1]) s = s[0] if s.count('0') < k: if s.count('0') > 0: print(len(s) - 1) else: print(len(s)) return have = 0 its = 0 for i in range(len(s) - 1, -1, -1): its += 1 if s[i] == '0': have += 1 if have == k: print(its - have) return

0.606875

ans = 1000000000 n, k = [int(i) for i in input().split()] s = input() l = len(s) d = [k // 2, (k + 1) // 2] nearl = [0] * n nearr = [0] * n last = 1000000000 for i in range(n): if s[i] == '0': last = i nearl[i] = last for i in range(n - 1, -1, -1): if s[i] == '0': last = i nearr[i] = las...

0.606646

from functools import lru_cache class Solution: def palindromePartition(self, s: str, k: int) -> int: n = len(s) if n == k: return 0 @lru_cache(None) def cnt(left,right): # cost to make palindrome if left >= right: return 0 return ...

0.606104

S = input() K = int(input()) if len(S) == 1: print(S) else: flg = False while S[0] == '1': S = S[1:] K -= 1 if K == 0: print(1) flg = True break if not flg: if S[0] == '2': if K.bit_length() - 1 >= 5000000000000000: ...

0.600756

class Solution: def canConvertString(self, s: str, t: str, k: int) -> bool: if len(s) != len(t): return False c = Counter((ord(c2) - ord(c1)) % 26 for c1, c2 in zip(s, t)) return k >= max( (m + 26 * (count - 1) for m, count in list(c.items()) if m), ...

0.592688

class Solution: def longestSubstring(self, s, k): """ :type s: str :type k: int :rtype: int """ for c in set(s): if s.count(c) < k: return max(self.longestSubstring(sp, k) for sp in s.split(c)) return len(s)

0.591372

s = input() L = input() k = int(input()) '''from datetime import * time1 = datetime.now()''' good = set() string = set() LIST = [chr(i) for i in range(97,123)] for i in range(26): if L[i]=='1': good.add(LIST[i]) t = [s[i] not in good for i in range(len(s))] end = [0]*len(s) badchars = 0 front=0; rear=0 w...

0.591346

import queue class Solution: def containsPattern(self, arr: List[int], m: int, k: int) -> bool: streak = 0 for i in range(len(arr)-m): if arr[i] == arr[i+m]: streak +=1 else: streak = 0 if streak == (k-1)*m: ...

0.590673

class Solution: def getLengthOfOptimalCompression(self, s: str, k: int) -> int: n = len(s) def compLen(c): return 1 + len(str(c)) if c > 1 else 1 @lru_cache(None) def dp(i, k): # return {head: (len, -head_count)} if (n - i) <= k: return {} # ...

0.589946

n, k = [int(i) for i in input().split()] dic = dict() s = list(input()) i = 0 while i<n: j = 1 while i+j < n and s[i] == s[i+j]: j+=1 if s[i] not in dic: dic[s[i]] = [] dic[s[i]].append(j) i += j ans = 0 for i in list(dic.keys()): ct = 0 for j in dic[i]: ct+=(j//k...

0.587926

def solve(st, k): length = len(st) - k return max(int(st[i:i + length]) for i in range(k + 1))

0.587338

q=int(input()) for t in range(q): n,k=map(int,input().split()) a=input() ko=0 used=[0]*n ans='' g=True for i in range(n): if a[i]=='1': ko+=1 else: if ko<=k: k-=ko ans=ans+'0' else: for j in r...

0.585881

def ii(): return int(input()) def mi(): return list(map(int, input().split())) def li(): return list(mi()) n, k = mi() a = li() s = input().strip() ans = 0 i = 0 while i < n: j = i + 1 while j < n and s[j] == s[i]: j += 1 b = sorted(a[i:j]) ans += sum(b[-k:]) i = j print(ans)

0.584275

def convert_to_binary(coef): res = [] n = len(coef) carry = 0 i = 0 while i < n + 1000: if i >= n and not carry: break cur = carry if i < n: cur += coef[i] mod = cur % 2 div = cur // 2 # print(cur, div, mod) res.append(...

0.579275

class Solution: def numberOfSubarrays(self, nums: List[int], k: int) -> int: # save all even subarray's length which between odds edge = [] res = 0 count = 0 for i in nums: # odd if i % 2: # +1 because range from 0 to count when doing c...

0.578793

t = int(input()) for _ in range(t): s = input() pref = [0]*len(s) if s[0]=="1": pref[0]+=1 for i in range(1,len(s)): if s[i]=="1": pref[i]+=1 pref[i]=pref[i]+pref[i-1] k=1 cnt=0 while (k+k*k)<=len(s): r = k+k*k i=r-1 while i<len(s): if (i-r)>=0: if pref[i]-pref[i-r]==k: cnt+=1 i+=...

0.578073

n, m, k = input().split(' ') n = int(n) m = int(m) k = int(k) ind = [] pre = [] for _ in range(n): s = input() ind.append([]) for i, c in enumerate(s): if c == '1': ind[-1].append(i) for i in range(n): pre.append([]) for j in range(k + 1): pre[i].append([]) if l...

0.577234

LOG = 20 def solve(s): n = len(s) res = 0 z = 0 for t in range(0, n): if s[t] == '0': z += 1 continue for l in range(1, min(LOG, n - t + 1)): x = int(s[t:t+l], 2) # print(l, t, x, l + z) if l + z >= x: res += 1 # print(t, l, x, res, z) z = 0 return res t = int(input()) while t > 0: ...

0.568295

from math import * from sys import * from queue import * from decimal import * n,k=(int(z) for z in input().split()) s=input() i=0 while i<len(s) and s[i] not in ["G","T"]: i+=1 i+=k while i<len(s) and s[i] not in ["G","T","#"]: i+=k if i>=len(s) or s[i]=="#": print("NO") else: print("YES")

0.56689

n = int(input()) s = input() if s == '0': print(0) else: print('1'+'0'*s.count('0'))

0.565068

class Solution: def maxVowels(self, s: str, k: int) -> int: n = len(s) vowel = set(['a','e','i','o','u']) i=0 res = 0 while i<k: if s[i] in vowel: res+=1 i+=1 j=k i=0 maxV = res while j<n: if ...

0.564216

'''input 3 4 aba ''' n, k = map(int, input().split()) t = input() for i in range(1, n): if t[i:] == t[:n-i]: print(t[:i] * k + t[i:]) break else: print(t * k)

0.563901

n, k = map(int, input().split()) a = [0] * n b = ['0'] * n c = [] s = input() for i in range(n): if k != 0: if s[i] == '(': c.append(i) else: d = c.pop() a[i] = 1 a[d] = 1 k -= 2 for i in range(n): if a[i] == 1: print(s[i], end ...

0.563242

def solve(s): v = sum(s[i] != s[-1-i] for i in range((len(s))//2) ) return v == 1 or not v and len(s)%2

0.561941

class Solution: def isOneBitCharacter(self, bits): """ :type bits: List[int] :rtype: bool """ """ i = 0 while i < len(bits)-1: if bits[i] == 1: i += 2 else: # bits[i] is 0 ...

0.559485

import sys input = sys.stdin.readline t = int(input()) for _ in range(t): n, k = list(map(int, input().split())) s = input() l = ['']*k works = True for i in range(n): c = s[i] if c != '?': if l[i%k] == c or l[i%k] == '': l[i%k] = c else: ...

0.558969

class Solution: def canArrange(self, arr: List[int], k: int) -> bool: freq = [0] * k for n in arr: freq[n%k] += 1 if freq[0] % 2: return False for i in range(1, (k//2)+1): if freq[i] != freq[k-i]: return False if k%2 is 0: ...

0.558539

n,k=list(map(int,input().split())) x=(n-(k-1)+1)//2 STR="0"*(x-1)+"1" ANS=STR*(n//x+1) print(ANS[:n])

0.557402

n, k = map(int, input().split()) s = input() l, r = int(-1), int(n) while r - l > 1: m = (l+r)//2 c, p = 1, 0 cond = True while p < n and c < k: i = p + m + 1 while i >= p and (i >= n or s[i] == '1'): i = i - 1; if (i == p): break c = c + 1 ...

0.557083

import math n, k = map(int, input().split()) a = list(map(int, input().split())) now = [-1] * k t = [0] * k nxt = 0 m = 0 intr = [False for i in range(n)] while m < n: for i in range(k): if now[i] != 1005 and (now[i] == -1 or t[i] == a[now[i]]): if now[i] != -1: m += 1 ...

0.555153

from sys import stdin import math rgb = 'RGB' for query in range(int(stdin.readline())): n, k = list(map(int, stdin.readline().split())) s = stdin.readline() ans = math.inf for start in range(3): dp = [0 for i in range(n + 1)] for i in range(n): cur = rgb[(start + i) % le...

0.55504

class Solution: def reverseStr(self, s, k): """ :type s: str :type k: int :rtype: str """ for idx in range(0, len(s), 2*k): s = s[:idx] + s[idx:idx+k][::-1] + s[idx+k:] return s

0.553753

n = int(input()) a = list(map(int, input().split())) k = input() pref = [a[0]] for i in range(1, n): pref.append(pref[-1] + a[i]) cur = 0 ans = 0 for i in range(n - 1, -1, -1): if k[i] == '0': continue if cur + (pref[i - 1] if i > 0 else 0) > ans: ans = cur + (pref[i - 1] if i > 0 else 0) ...

0.553656

class Solution: def removeDuplicates(self, s: str, k: int) -> str: st=[['*',0]] for c in s: if c!=st[-1][0]: st.append([c,1]) else: st[-1][1]+=1 if st[-1][1]==k: st.pop() res='' for c,v in st:...

0.55295

def solve(st,k): for l in sorted(st)[:k]: st=st.replace(l,'',1) return st

0.552181

class Solution: def minKBitFlips(self, A: List[int], K: int) -> int: n = len(A) record = [0] * n flip = 0 ans = 0 for i in range(n): if i >= K: flip -= record[i-K] if A[i] == (flip % 2): if i > n - K: return -1 ans += 1 ...

0.552155

import sys input = sys.stdin.readline from collections import defaultdict class Unionfind: def __init__(self, n): self.par = [-1]*n self.rank = [1]*n def root(self, x): r = x while not self.par[r]<0: r = self.par[r] t = x ...

0.552152

class Solution: def numSub(self, s: str) -> int: # 10/6/20 dic = collections.defaultdict(int) n = len(s) left, right = 0, 0 while left < n: if s[left] == '1': right = left while right < n and s[right] == '1': ...

0.549196

(lambda R:(lambda N:(lambda n:any((lambda z,r:all((lambda p:all(p==k for k in n[j:j+i]))(n[j])for j in range(0,N,i))and all(all((lambda q:q==z or q==r)(j[k:k+i])for k in range(0,N,i))for j in n)and[print(i)])('0'*i,'1'*i)for i in range(N,0,-1)if N%i==0))([bin(int(R(),16))[2:].zfill(N)for i in range(N)]))(int(R())))(__i...

0.549112

#coding gbk #!usr/bin/ENV cin =lambda : list(map(int,input().split())) n, k = cin() c=list(cin()) dp = [0]*(k+1) dp[0]=1 for i in c: tmp = dp[:] for x in range(k,i-1,-1): tmp[x] |= dp[x-i]|(dp[x-i]<<i) dp = tmp b = bin(dp[-1]) ans = [i for i in range(k + 1) if b[-i - 1] == '1'] print(len(ans)) print...

0.548978

n, k = map(int, input().split()) s = set() st = input() inp = input().split() for x in inp: s.add(x) current, ans = 0, 0 for x in st: if x in s: current += 1 else: ans += (current * (current + 1)) // 2 current = 0 ans += (current * (current + 1)) // 2 print(ans)

0.548625

## ## ## import sys def line(): return sys.stdin.readline() def numbers(): return list(map(int, line().split())) def number(): return int(line()) adjlist = {} n, k = 0, 0 mark = [False]*2010 edges = [False]*1010 # bfs for "ssph" def bfs(s): i = 0 frontier = [s] while frontier: ...

0.54828

for i in range(eval(input())): n,k=input().strip().split() n=int(n) k=int(k) print(int( ((n-k)&(int((k-1)/2)))==0))

0.547733

n, k = map(int, input().split()) j = 0 for i in input(): if i == '.': j = 0 else: j += 1 if j >= k: print("NO") break else: print("YES")

0.547732

class Solution: def numSteps(self, s: str) -> int: i, mid_zero = 0 , 0 for j in range(1, len(s)): if s[j] == '1': mid_zero += j -i - 1 i = j if i == 0: return len(s)-1 return mid_zero + 1 + len(s)

0.546884

#!/usr/bin/env python3 [n, k] = list(map(int, input().strip().split())) ais = list(map(int, input().strip().split())) n1 = ais.count(1) one_serie = [0 for _ in range(n)] for i in reversed(list(range(n))): if ais[i] == 1: one_serie[i] = (0 if i == n - 1 else one_serie[i + 1]) + 1 n1_head = 0 count = 0 for i in ...

0.545483

t = int(input()) for _ in range(t): s = input() n = len(s) if s.count('1') == n or s.count('1') == 0: print(s) else: odp = [0,1]*n for i in range(n): if i < n-1: print("01", end = "") else: print("01")

0.544038

T= int(input()); for i in range(T): n,k = list(map(int,input().split())); s=list(map(int,input())); if k==1: s_0 ={}; s_1={}; c0=0; c1=0; for j in range(n): if(j%2==0): s_1[j]=1; s_0[j]=0; else: s_1[j]=0; s_0[j]=1; for j in range(n): if(s_0[j]-s[j]!=0): c0+=1; if(s_1[j]-...

0.538108

import sys n, k = list(map(int, input().split(' '))) s = input() def max_streak(s): result = 0 for i in range(len(s)): j = i while j < len(s) and s[j] == 'N': j += 1 result = max(result, j - i) return result for i in range(n - k + 1): cur = list(s) for j in...

0.536047

n, k = list(map(int, input().split())) plain = list() for i in range(n): plain.append(list(input())) fr = { "0": list(), "1": list(), "2": list(), } for i in range(n): for j in range(12): if plain[i][j] != ".": continue st = 0 if j > 0 and plain[i][j - 1] == "S...

0.53576

def solution(s): st=[1 for i in range(1,len(s)) if s[i-1]==s[i]] return sum(st)

0.53555

inp = input().split() n = int(inp[0]) k = int(inp[1]) a = input().split() for i in range(n): a[i] = int(a[i]) # End of Input bank = {} # Preparation for i in range(n): arg = (len(str(a[i])),a[i]%k) #print("Detect:",arg) bank[arg] = bank.get(arg,0)+1 ans = 0 # Query for i in range(n): ten = 1 ...

0.535511

import sys def count(n, k, field): blank = 0 cnt = [[0] * (n - k + 1) for _ in range(n)] for i, row in enumerate(field): l = row.find('B') r = row.rfind('B') if l == r == -1: blank += 1 continue if r - l + 1 > k: continue kl = max...

0.533734

# cook your dish here def decode(L,S): str_2="" lst=[] for i in range(L//4): str_1 = "abcdefghijklmnop" S_1=S[(i*4):(4*(i+1))] for j in range(4): if(S_1[j]=="1"): str_1=str_1[len(str_1)//2:len(str_1)] else: str_1 = str_1[0:len(str_1) // 2] str_2=str_2+str_1 print(str_2) T=int(input()) for i i...

0.533585

class Solution: def numWays(self, s: str) -> int: n = s.count('1') if n % 3 != 0: return 0 if n == 0: return (((len(s) - 1) * (len(s) - 2)) // 2) % (10**9 + 7) m = n // 3 L = s.split('1') return ((len(L[m]) + 1) * (len(L[2*m]) + 1)) % (10**9 + 7)

0.53327

import heapq n, k = list(map(int, input().split())) s = input() mostRecent = n best = [] for room in range(n-1, -1, -1): if s[room] == '1': mostRecent = room best.append(mostRecent) best = best[::-1] dp = [0] vals = [(0,0)] for room in range(1, n + 1): new = dp[-1] + room if room - k - 1 >...

0.533177

class Solution: def characterReplacement(self, s, k): """ :type s: str :type k: int :rtype: int """ if s == "": return 0 count = {} lo = 0 hi = 0 max_letter = 0 for hi in range(len(s)): try:...

0.532489

def gen(a, b): gener = '' for i in range(k): if a[i] == b[i]: gener += a[i] else: if 'S' not in (a[i], b[i]): gener += 'S' elif 'E' not in (a[i], b[i]): gener += 'E' else: gener += 'T' return gene...

0.532048

class Solution: def minFlipsMonoIncr(self, S: str) -> int: onesSoFar = 0 partial = 0 for n in S: if n == '0': partial = min(onesSoFar, partial+1) else: onesSoFar += 1 return partial

0.53152

from collections import defaultdict N,K = list(map(int, input().split())) A = list(map(int, input().split())) BMAX = 40 """ ・K以下の非負整数の範囲で〜：桁DP感ある・XORをとる：桁ごとに確認できる・Xを選んで、f = X xor A1 + X xor A2 + ... + X xor AN 　 -> それぞれのAと毎回 xor 取るのではなく、桁ごとに xor を取ることができる　←　超重要のはず　 -> A1 ~ AN の各桁（2進数の時の）に1が立っているのが何個あるか数えておく遷移 dp...

0.530829

class Solution: def __init__(self): self.n, self.k = list(map(int, input().split())) self.s = [input() for i in range(0, self.n)] self.state = [ (119, 6), (36, 2), (93, 5), (109, 5), (46, 4), (107, 5), (123, ...

0.529779

for z in range(int(input())): s = input() n = len(s) i = 0 while i<n and s[i]=='1': i+=1 if i==0: print(0) else: k = 0 while i<n and s[i]=='0': i+=1 k+=1 print(k)

0.529421

import math class Solution: def __init__(self): self.happy_string = '' def getHappyString(self, n: int, k: int) -> str: # determine starting character poss_per_group = 2 ** (n - 1) group_num = math.ceil(k / poss_per_group) - 1 starting_char = '' # c...

0.528745

from functools import reduce def main(): from sys import stdin from operator import xor from functools import reduce x, res = reduce(xor, (input()[i] == '1' for i in range(0, int(input()) * 2, 2))), [] input() for s in stdin.read().splitlines(): if s == '3': res.append("01"[x...

0.527897

for i in range(int(input())): n,k=map(int,input().split()) m=[] for j in range(n): l=list(input()) m.append(l) a=0 for k in range(k): b=0 for p in range(n): if m[p][k]=='1': b+=1 if b>1: a+=((b*(b-1))//2) print(a)

0.527849

n, k = map(int, input().split()) A = list(map(int, input().split())) ans = 0 for i in range(k): c1 = c2 = 0 for j in range(i, n, k): if A[j] == 1: c1 += 1 else: c2 += 1 ans += min(c1, c2) print(ans)

0.527816

from sys import setrecursionlimit setrecursionlimit(10 * 9) def solve(i): if i + k >= n: return 1 if i in dp: return dp[i] mini = float('inf') for j in range(i+1, min(n, i+k+1)): if i == -1 or a[i] == a[j]: mini = min(mini, solve(j) + 1) dp[i] =...

0.527739

class Solution: def maxScore(self, s: str) -> int: maxi=0 for i in range(1,len(s)): a=s[:i] b=s[i:] maxi=max(a.count('0')+b.count('1'),maxi) return maxi

0.527135

from collections import Counter from functools import reduce from math import gcd def has_subpattern(string): return reduce(gcd, Counter(string).values()) != 1

0.526871

n=int(input()) s=[c=='1' for c in input()] m=len(s) z=[[0,0]] for c in s: ind = z[-1][c] z[-1][c] = len(z) z.append(z[ind][:]) assert(len(z) == m+1) z[m][0] = z[m][1] = m # make it sticky # how many things match directly dp = [0 for _ in range(m+1)] dp[0] = 1 for i in range(n): ndp = [0 for _ in range(m+1)] for i...

0.526133

def luck_check(string): e0, b1 = len(string) // 2, (len(string) + 1) // 2 return sum(map(int, string[:e0])) == sum(map(int, string[b1:]))

0.525799

import numpy as np def solve(n,k,a,l,r): shape = (n,n) mat = np.zeros(shape, dtype=np.int64) for i in range(n): for j in range(l[i], r[i]): mat[i][j]=1 ans = np.eye(n,n, dtype=np.int64) while(k>0): if k%2 == 1: ans = np.matmul(mat, ans) ...

0.52527

t = int(input()) for _ in range(t): n,k = list(map(int,input().split())) a = list(map(int,input().split())) for i in range(60, -1, -1): m = k ** i for j in range(n): if a[j] >= m: a[j] -= m break if all(i == 0 for i in a): print('YES') ...

0.524433

n = int(input()) k = input() amount = 0 for elem in k: amount += 1 if elem == '0': break print(amount)

0.524212

class Solution: def minInteger(self, num: str, k: int) -> str: n=len(num) if k<=0: return num if k>n*(n-1)//2: return ''.join(sorted(list(num))) for i in range(10): idx = num.find(str(i)) if idx>=0 and idx<=k: ...

0.52384

class Solution: def checkSubarraySum(self, nums, k): """ :type nums: List[int] :type k: int :rtype: bool """ if k==0: j=0 for i in range(0,len(nums)): if nums[i]==0: if j<i: ...

0.523836

def dfs(x, y): vis.append((x, y)) y += 1 nonlocal flag if flag or str.isalpha(grid[x][y]): return if y >= n - 1: flag = True return # stay idle if not str.isalpha(grid[x][y + 1]) and not str.isalpha(grid[x][y + 2]) and (x, y + 2) not in vis: dfs(x, y + 2)...

0.522169

s = input() pref = [] cnt1 = s.count('1') s = s.replace('1', '') i = 0 while i < len(s) and s[i] != '2': i += 1 end = '' if i != len(s): end = s[i:] s = s[:i] + '1' * cnt1 + end print(s)

0.521636

print('YES' if input().count('1')+1>>1<<1 >= input().count('1') else 'NO')

0.518459

def outcome(n, s, k): if n == 1: return 1 if 0 < k <= s else 0 return sum(outcome(n - 1, s, k - j - 1) for j in range(s)) if k > 0 else 0

0.518091

try: t=int(input()) for i in range(t): n,k=map(int,input().split()) s=input() l=[-1]*len(s) numb=s.count('b') x=numb for j in range(len(s)): if(s[j]=='a'): l[j]=numb if(s[j]=='b'): numb=numb-1 ...

0.518025

#code snippet reference:http://www.geeksforgeeks.org/searching-for-patterns-set -2-kmp-algorithm/ def KMPMatch(pattern, string): M = len(pattern) N = len(string) nonlocal ans lps = [0]*M j = 0 LPSCompute(pattern, M, lps) i = 0 while i < N: if pattern[j] == string[i]: i+=1 j+=1 if j==M: ans+...

0.517939

Given an array of integers cost and an integer target. Return the maximum integer you can paint under the following rules: The cost of painting a digit (i+1) is given by cost[i] (0 indexed). The total cost used must be equal to target. Integer does not have digits 0. Since the answer may be too large, return it as st...

class Solution: def largestNumber(self, cost: List[int], target: int) -> str: dp = [0] + [-target]*target for t in range(1, target+1): dp[t] = max([dp[t-i] for i in cost if i<=t]+[dp[t]]) + 1 if dp[-1]<=0: return '0' res = '' for i in range(8, -1, -1): ...

0.853717

num = list(map(int, input())) best = num[:] for i in range(-1, -len(num) - 1, -1): if num[i] == 0: continue num[i] -= 1 for j in range(i + 1, 0): num[j] = 9 if sum(num) > sum(best): best = num[:] s = ''.join(map(str, best)).lstrip('0') print(s)

0.649651

def solve(n): x = str(n) res = [x] + [str(int(x[:i]) - 1) + '9' * (len(x) - i) for i in range(1, len(x))] return int(max(res, key=lambda x: (sum(map(int, x)), int(x))))

0.644108

def find(ins): ins += 1 test = [int(i) for i in str(ins)] inlist = [] for i in test: if i in inlist: test = find(ins) break else: inlist.append(i) return ''.join(str(x) for x in test) ins = int(input()) print(find(ins))

0.638819

#!/bin/pypy3 from itertools import* from timeit import* from typing import Optional S=lambda x:sum(map(int,str(x))) def ceil_s_divisible_a(x:int,a:int) -> Optional[int]: z=S(x)%a if z: z=a-z tail=[] x=list(str(x)) while x: digit=x.pop() diff=min(z,9-int(digit)) z-=diff tail.append(str(int(digit)...

0.637374

# cook your code here n=input() x=len(n) no=list(map(int,n)) temp=[0]*x if (x>2): sum=99 for i in range(3,x): sum=sum+90 sum=sum+10*(int(n[0])-1) sum=sum+int(n[1]) f=int(n[0])%10 s=int(n[1])%10 cd=s-f temp[0]=n[0] temp[1]=n[1] for i in range(2,x): nxt=(s+cd)%10 temp[i]=(chr(nxt+48)) s=nxt temp=...

0.634426

""" Codeforces Contest 289 Div 2 Problem C Author : chaotic_iak Language: Python 3.4.2 """ ################################################### SOLUTION def printing(num): arr = num[:] while len(arr) > 1 and arr[-1] == 0: arr.pop() print("".join(map(str, reversed(arr)))) def main(): n, = read() ...

0.63228

n,m=map(int,input().split()) a=list(map(int,input().split())) dp=[0]+[-1]*(9*n) l=[0,2,5,5,4,5,6,3,7,6] for i in range(n): for j in a: if dp[i]>=0: dp[i+l[j]]=max(dp[i+l[j]],dp[i]*10+j) print(dp[n])

0.632091

from functools import cmp_to_key cmp = lambda a, b: int('%i%i' % (b, a)) - int('%i%i' % (a, b)) largest_arrangement = lambda n: int(''.join(str(i) for i in sorted(n, key = cmp_to_key(cmp))))

0.626548

def modify(string, index): if string[index] == '0': key = 0 else: key = 10 - int(string[index]) bad = '' for i in string: bad += str((int(i) + key) % 10) return bad[index:] + bad[:index] x = int(input()) y = input() minx = 'zzzzzzzzz' for i in range(x): minx = min...

0.622938

class Solution: def maximumSwap(self, num): """ :type num: int :rtype: int """ s = str(num) nums = [int(_) for _ in s] dp = [-1]*len(nums) for i in range(len(nums)-1,-1,-1): if i==len(nums)-1: dp[i] = i ...

0.618856

def max_number(n): return int(''.join(sorted(str(n), reverse=True)))

0.615099

l = {j:i for i,j in enumerate('0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz')} l_ = dict(enumerate('0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz')) is_polydivisible = lambda n, base:next((0 for i in range(1, len(n) + 1) if get_base(n[:i], base) % i),1) get_base = lambda n, base:sum(...

0.613303

class Solution: def largestNumber(self, nums): """ :type nums: List[int] :rtype: str """ nums = [str(n) for n in nums] nums.sort(reverse=True) for i in range(1, len(nums)): if len(nums[i-1]) > len(nums[i]): ...

0.611918

def solve(n): def length(n): s = 0 for i in range(20): o = 10 ** i - 1 if o > n: break s += (n - o) * (n - o + 1) // 2 return s def binary_search(k): n = 0 for p in range(63, -1, -1): if length(n + 2 ** p) < k: n += 2 ** p ...

0.610938

from collections import Counter EXECUTIONS_ORDER = [('Z', Counter("ZERO"), '0'), ('W', Counter("TWO"), '2'), ('U', Counter("FOUR"), '4'), ('X', Counter("SIX"), '6'), ('G', Counter("EIGHT"), '8'), ('O', Counter("O...

0.610299

def end(x) : if x == 0 : return "1869"; if x == 6 : return "1968"; if x == 5 : return "1689"; if x == 4 : return "6891"; if x == 3 : return "1689"; if x == 2 : return "1986"; if x == 1 : return "1896"; d = [0] * 10; for c in input()...

0.609121

def sum_part(n): m, p, q, r, s = 1, 1, 1, 0, n while n > 9: n, d = divmod(n, 10) r += d * p p *= 10 if d: m = 1 else: m*= 2 s += q*n + m*memo[r] q *= 2 return s from collections import defaultdict qualified = defaultdict(list) memo = {n: n for n in ra...

0.606143

class Solution: def minInteger(self, num: str, k: int) -> str: n=len(num) if k<=0: return num if k>n*(n-1)//2: return ''.join(sorted(list(num))) for i in range(10): idx = num.find(str(i)) if idx>=0 and idx<=k: ...

0.605937

import math from collections import Counter s = list(map(int, input())) substr = input().rstrip() t = list(map(int, substr)) m = len(s) x, y = 0, m z = (x + y) // 2 while z != x: if z + math.floor(math.log10(z)) + 1 <= m: x = z else: y = z z = (x + y)//2 m1 = z k = math.floor(math.log10(m1...

0.60492

class Solution: def reformat(self, s: str) -> str: n = [str(i) for i in range(0, 10)] a, b = [], [] for i in s: if i in n: b.append(i) else: a.append(i) if abs(len(a) - len(b)) > 1: return '' r = '' i...

0.603698

a = list(input()) b = int(input()) a.sort() a = a[::-1] prefix = "" while(len(a) > 0): for i in range(len(a)): num = prefix + a[i] + "".join(sorted(a[:i] + a[i + 1:])) if (int(num) <= b): prefix += a[i] a = a[:i] + a[i+1:] break print(prefix)

0.603249

import re ls = ["Zero","One","Two","Three","Four","Five","Six","Seven","Eight","Nine","Ten","Eleven","Twelve","Thirteen"] def max_consec_zeros(n): return ls[max(map(lambda x:len(x),re.findall(r'0*',bin(int(n))[2:])))]

0.602874

class Solution: def monotoneIncreasingDigits(self, N): """ :type N: int :rtype: int """ arr = [int(ch) for ch in str(N)] # create array from number 1234 => [1,2,3,4] marker = len(arr) i = len(arr)-2 while i >= 0: ...

0.601095

def rec(i): nonlocal a return i import sys from collections import Counter sys.setrecursionlimit(10**6) n=int(input()) #n,m=list(map(int,input().split())) a=[input() for i in range(n)] b=[] a0=set() c0=set() for i in a: c=set() for i0 in range(1,10): for i1 in range(0,10-i0): c.add(i...

0.597119

def basereduct(x): for _ in range(150): x = int(str(x), int(max(str(x))) + 1 + ('9' in str(x))) if x < 10: return x return -1

0.595975

a,b=[int(_) for _ in input().split()] if b==0: print(a) else: l=[] a=str(a) for i in range(len(a)): l.append(a[i]) for i in range(len(l)): if b==0: break if l[i]=='9': continue else: l[i]='9' b-=1 ...

0.595899

def solve(n): moves = [] for a, b in ["25", "75", "50", "00"]: s = str(n)[::-1] x = s.find(a) y = s.find(b, x+1 if a == "0" else 0) if x == -1 or y == -1: continue moves.append(x + y - (x > y) - (a == b)) s = s.replace(a, "", 1).replace(b, "", 1) ...

0.592819

import itertools def cal(N, target_num, keta): answer = float('inf') for p in itertools.product(target_num, repeat=keta): temp = 0 for i, num in enumerate(p): temp += num * 10**i if temp >= N: answer = min(answer, temp) return answer def __star...

0.591312

from operator import mul from functools import reduce def genSequence(n): yield n while True: n += reduce(mul, [int(d) for d in str(n) if d != '0']) if n > 9 else n yield n def extract(seq, v): return sorted(seq).index(v) def convergence(n): gen1, genN = genSequence(1), genSequence(n)...

0.587351

class Solution: def largestMultipleOfThree(self, digits: List[int]) -> str: counts = Counter(digits) m = sum(digits) % 3 if m: if counts[m] + counts[m+3] + counts[m+6]: counts[min([m+i for i in [0,3,6] if counts[m+i]])] -= 1 else: count...

0.586241

import re def solve(s): return max(map(int,re.findall(r"(\d+)", s)))

0.585258

S=input() a=1145141919810 for i in range(len(S)-2): a=min(a,abs(753-int(S[i:i+3]))) print(a)

0.584854

def solution(digits): numlist = [int(digits[i:i+5]) for i in range(0,len(digits)-4)] return max(numlist)

0.583301

from math import ceil def pay_cheese(arr): return f'L{ceil(sum(arr) / 100) * 35}'

0.578185

MEMO = [] def sum_dif_rev(n): i = MEMO[-1] if MEMO else 0 while len(MEMO) < n: i += 1 r = int(str(i)[::-1]) if i % 10 and r != i and (i + r) % abs(r - i) == 0: MEMO.append(i) return MEMO[n-1]

0.576336

from collections import Counter fib = [0, 1] def around_fib(n): while len(fib) <= n: fib.append(fib[-1] + fib[-2]) f = str(fib[n]) val = max((v, -int(k)) for k,v in Counter(f).items()) last = f[-(len(f)%25 or 25):] return f"Last chunk {last}; Max is {val[0]} for digit {-val[1]}"

0.573259

def largest_sum(s): return max(sum(map(int,x)) for x in s.split('0'))

0.572183

class Solution: def findBestValue(self, arr: List[int], target: int) -> int: arr.sort() n = len(arr) for i in range(n): sol = round(target / n) if arr[i] >= sol: return sol target -= arr[i] n -= 1 return arr[-1]

0.571877

import sys n = int(input()) c = list(map(int, input().split())) cc = ord('a') ans = "" cur = n - 1 if 1: cur = n - 1 while cur >= 0: while c[cur] > 0: if chr(cc) > 'z': cc = ord('a') ans += chr(cc) * (cur + 1) c[cur] -= 1 for i in range(cu...

0.571087

class Solution(object): def findKthNumber(self, n, k): """ :type n: int :type k: int :rtype: int """ s,nn=0,str(n) while nn: if not k: return s c,m=0,10**(len(nn)-1) mm,p,t=(m-1)//9,int(nn)//m,0 for i...

0.569615

array = [1, 10, 9, 12, 3, 4] def thirt(n): total = sum([int(c) * array[i % 6] for i, c in enumerate(reversed(str(n)))]) if n == total: return total return thirt(total)

0.569513

n=int(input()) s=input() pw=[1] last=1 for i in range(70): if (last>1e19): break pw.append(last*n) last=last*n dp=[1e19]*100 for i in range(100): dp[i]=[1e19]*100 dp[len(s)][0]=0 for i in range(len(s),-1,-1): for power in range(0,len(pw)): cur='' for j in range(i-1,-1,-1): ...

0.568677

for _ in range(int(input())): n=input().rstrip() n=[ele for ele in n] l=len(n) m=10**18+8 ini=1 for i in range(l-1,-1,-1): if int(n[i])<=m: if ini==1: m=int(n[i]) else: m=max(m,n[i]) else: m=int(n[i])-1 n[i]=str(m) for j in range(l-1,i,-1): n[j]='9' i=0 while n[i]=='0': i+=1...

0.567994

# cook your dish here T = int(input()) for t in range(T): N = int(input()) s = sorted(list(str(input()))) print(s[0])

0.567521

string=input() max_no=0 for i in range(len(string)): var_occur=0 check_no=str() j=i while(j<len(string) and var_occur<2 ): if(string[j].isalpha()): if(var_occur==0): check_no+='9' var_occur+=1 else: var_occur+=1 else: check_no+=string[j] j+=1 #print(check_no) max_no=max(max_no,int(check...

0.567157

def target_game(values): a = b = 0 for n in values: a, b = b, max(a + n, b) return max(a, b)

0.563423

def delete_digit(n): s = str(n) return int(max(s[:i] + s[i+1:] for i in range(len(s))))

0.561849

n = int(input()) def p(x): ans = 1 while x > 0: ans *= x % 10 x //= 10 return ans ans = p(n) for i in range(len(str(n))): cans = 9 ** i * p((n // 10 ** i) - 1) ans = max(ans, cans) print(ans)

0.561542

x = list(input()) for i in range(len(x)): if(i==0 and x[i]=='9'): continue if(int(x[i])>9-int(x[i])): x[i] = str(9-int(x[i])) y=0 for item in x: y*=10 y+=int(item) print(y)

0.560073

import fractions import sys f = sys.stdin if len(sys.argv) > 1: f = open(sys.argv[1], "rt") sum_cache = {} def sum_func(x): if x < 10: return x r = sum_cache.get(x) if r is not None: return r xx = 0 while x > 0: xx += x % 10 x /= 10 r = sum_func(xx) ...

0.559865

s="" for i in range(10000): s+=str(i) print(s[int(input())])

0.559628

import re NEG, DOT, _, *DIGS = "负点零一二三四五六七八九" POWS = " 十百千万".split(' ') NUMS = {str(i):c for i,c in enumerate(DIGS)} for n in range(10): NUMS[str(n+10)] = POWS[1] + DIGS[n]*bool(n) def to_chinese_numeral(n): ss = str(abs(n)).split('.') return NEG*(n<0) + parse(ss[0]) + (len(ss)>1 and decimals(ss[1]) or '...

0.55934

N = int(input()) list_ = [111,222,333,444,555,666,777,888,999] for i in list_: if i >= N: print(i) return

0.559284

class Solution: def largestPalindrome(self, n): """ :type n: int :rtype: int """ A = [0,9,987,123,597,677,1218,877,475] return A[n]

0.557237

s = list(input()) for i in range(3): if s[i] == '1': s[i] = '9' else: s[i] = '1' t = '' for i in range(3): t += s[i] print(t)

0.555596

def solution(n): roman_numerals = {1000:'M', 900: 'CM', 500: 'D', 400: 'CD', 100: 'C', 90: 'XC', 50: 'L', 40: 'XL', 10: 'X', ...

0.55558

def solve(n): if n < 10: return n a = int((len(str(n)) - 1) * '9') b = n - a return sum([int(i) for i in (list(str(a)) + list(str(b)))])

0.554915

import sys def read_int(): return int(sys.stdin.readline()) def read_ints(): return list(map(int, sys.stdin.readline().split(' '))) t = read_int() for case_num in range(t): n, s = read_ints() a = [0] + [int(i) for i in str(n)] ds = sum(a) cost = 0 idx = len(a) - 1 radix = 1 whi...

0.554355

def simplify(n): output = [] exp = 0 while n: n, r = divmod(n, 10) if r: output.append(f"{r}*{10**exp}" if exp else f"{r}") exp += 1 return "+".join(output[::-1])

0.553485

def solve(s): s1 = s[::-1] s2 = '' for i in s1: if i.isalpha(): s2 += i elif i.isdigit(): s2 = s2*int(i) return s2[::-1]

0.553429

# cook your dish here n=int(input()) l=[] for i in range(n): a=int(input()) l.append(a) for i in l: b = list(map(int, str(i))) b.sort(reverse=True) s = [str(i) for i in b] r = int("".join(s)) print(r)

0.552696

class Solution: def leastOpsExpressTarget(self, x: int, target: int) -> int: def dp(i, j): if i==0: return 2*j # if j==0: return 0 if j==1: return 2 if (i, j) in memo: return memo[(i, j)] base = x**i q, r = divmod(j, base) i...

0.552539

hola = 0 a = int(input()) d = len(str(a)) k = 10**(d-1) for i in range(1, d): hola += i * (10**(i-1)*9) hola += d * (a-k+1) print(hola)

0.552396

import math class Solution: def smallestGoodBase(self, n): n = int(n) maxLength = int(math.log(n,2)) for m in range(maxLength, 1, -1): k = int(n**m**-1) if (k**(m+1) - 1)//(k - 1) == n: return str(k) return str(n-1) """ ...

0.552295

n = int(input()) a = sorted([list(map(int, input().split())) for i in range(n)]) import itertools for x in range(1,10**n): good = False s = str(x) for p in itertools.permutations(a, len(s)): good |= all([int(s[i]) in v for i, v in enumerate(p)]) if not good: print(x-1) return print((10**n)-1)

0.551467

import itertools def next_bigger(n): s = list(str(n)) for i in range(len(s)-2,-1,-1): if s[i] < s[i+1]: t = s[i:] m = min([x for x in t if x>t[0]]) t.remove(m) t.sort() s[i:] = [m] + t return int("".join(s)) return -1

0.550685

def find(a,b,n): strng = str(a) + str(b) #there are 10 and 4 long loops if (n > 20): n = n%20+20 while len(strng) <= n: next_ch = int(strng[-1]) + int(strng[-2]) strng = strng + str(next_ch) return int(strng[n])

0.55063

from sys import stdin, stdout, exit mod = 998244353 n = int(stdin.readline()) a = list(map(int, stdin.readline().split())) ans = 0 def l(x): if x == 0: return 0 return 1 + l(x//10) lens = [0]*15 for x in a: lens[l(x)] += 1 def space_out(x, l): ans = [] for i,c in enumerate(reversed(str...

0.548623

MOD = 10**9+7 s = input() n = int(input()) qs = [['',s]]+[input().split('->') for i in range(n)] ds = {} for i in range(10): ds[str(i)] = (10,i) for i in range(n,-1,-1): out = 0 mul = 1 for d in qs[i][1]: out = (out * ds[d][0] + ds[d][1]) % MOD mul = (mul * ds[d][0]) % MOD ds[qs[i...

0.547574

s = input() m = int(input()) mn = m ttt = 0 t = 0 ttt = 1 for i in range(1,len(s)): ttt = (ttt * 10) % m for i in range(0,len(s)): t = (t * 10 + ord(s[i]) - ord('0')) % m for i in range(0,len(s)): if s[i] != '0': mn = min(mn,t) t = t - (((ord(s[i])- ord('0')) * ttt) % m) if t < 0: t ...

0.547531

def min_value(digits): return int("".join(map(str,sorted(set(digits)))))

0.547505

from fractions import Decimal, gcd from operator import mul from functools import reduce lcm = lambda a, b=1: a * b // gcd(a, b) def parameter(n): digits = Decimal(n).as_tuple().digits return lcm(sum(digits), reduce(mul, digits))

0.547355

def solve(st, k): length = len(st) - k return max(int(st[i:i + length]) for i in range(k + 1))

0.546679

l = int(input()) n = input() best = int(n) p = (l - 1) // 2 for i in range(p, -1, -1): if (n[i + 1] == '0'): continue best = min(best, int(n[0:(i + 1)]) + int(n[i + 1:])) break p = l // 2 for i in range(p, l): if (n[i] == '0'): continue best = min(best, int(n[0:i]) + int(n[i:])) break print(best)

0.545825

d, polydivisible, arr = 1, [], list(range(1, 10)) while arr: d += 1 polydivisible.extend(arr) arr = [n for x in arr for n in range(-(-x*10 // d) * d, (x+1) * 10, d)] def next_num(n): from bisect import bisect idx = bisect(polydivisible, n) if idx < len(polydivisible): return ...

0.544977

s=int(input()) while(s>0): s-=1 a=input() c=0 for x in a: c+=int(x) if(c<9 and len(a)!=1): print(9-c%9) else: print(min(9-c%9,c%9))

0.544909

from itertools import combinations def solve(n, k): return ''.join(min(combinations(str(n), len(str(n))-k)))

0.543941

# cook your dish here def getAns(num): if num<10:return 2 last=int(str(num)[0]);rem=int(str(num)[1:]);steps=2;p=len(str(num))-1 while True: steps+=rem//last+1;rem=rem%last if last>0:rem=rem+10**p-last last=last-1 if last==0: p=p-1;last=9 if(len(str(rem))==1):rem=0 els...

0.543473

def digits_product(product): if product < 10: return 10 + product n = '' for d in range(9, 1, -1): while not product % d: n += str(d) product //= d return int(n[::-1]) if product == 1 else -1

0.543267

class Solution: def removeKdigits(self, num, k): """ :type num: str :type k: int :rtype: str """ out=[] for digit in num: while k and out and out[-1] > digit: out.pop() k-=1 out.append(digit) ...

0.542997

# Why do we fall ? So we can learn to pick ourselves up. t = int(input()) for _ in range(0,t): n = int(input()) abc = [int(i) for i in input().split()] i = 0 lst = [n] for _ in range(0,100): k = str(lst[-1]/abc[i%3]).split('.') if int(k[1][0]) > 0: ...

0.542799

k = int(input()) if k<=9: print(k) else: num_arr = [9*(i+1)* 10**i for i in range(11)] index = 0 while True: if k<=num_arr[index]: break else: k -= num_arr[index] index += 1 digit = index+1 k += digit-1 num = k//digit offset = k%d...

0.542691

n = int(input()) if n == 0: print('zero') elif n == 1: print('one') elif n == 2: print('two') elif n == 3: print('three') elif n == 4: print('four') elif n == 5: print('five') elif n == 6: print('six') elif n == 7: print('seven') elif n == 8: print('eight') elif n == 9: print('nine') elif n == 10: print('ten...

0.542682

import math def nth_perm(n,d): digits = [str(i) for i in range(d)] out = '' for i in range(1, d): cycles = math.ceil(n/math.factorial(d-i)) out += digits.pop((cycles % (d-i+1)) - 1) return out + digits.pop()

0.541178

s = input() p = sum(map(int, s[1:])) + 9 * s.count('0') + 1 print(p)

0.540496

a = int(input()) s = "" for i in range(1, a+1): s += str(i) print(s[a-1])

0.53925

T = 1 for test_no in range(T): MAXK = 5000 n = int(input()) cnt = [0] * (MAXK + 1) primeExponential = [[0 for j in range(MAXK + 1)] for i in range(MAXK + 1)] line, num = (input() + ' '), 0 for c in line: if c != ' ': num = num * 10 + (ord(c) - 48) else: cnt[num] += 1 num = 0 for i in range(2, MAXK + ...

0.538688

def penalty(lst): lst, maxLen = list(map(str, lst)), max(map(len, lst)) return ''.join(sorted(lst, key=lambda s: s.ljust(maxLen, s[-1])))

0.538477

def self_converge(number): n, cycle = str(number), set() while n not in cycle: cycle.add(n) s = ''.join(sorted(n)) n = '%0*d' % (len(n), int(s[::-1]) - int(s)) return -1 if not int(n) else len(cycle)

0.537593

from collections import Counter from itertools import combinations from operator import mul from functools import reduce def largest_palindrom_from(n): digits = sorted(str(n)) singles, pairs = [], [] # group digits to pairs and singles while digits: digit = digits.pop() if digits a...

0.537201

def solve(n): if n%10: return -1 c, billet = 0, iter((500,200,100,50,20,10)) while n: x, r = divmod(n, next(billet)) c, n = c+x, r return c

0.537059

def subsets(collection): if len(collection) == 1: yield [collection] return first = collection[0] for smaller in subsets(collection[1:]): yield [first] + smaller for n, subset in enumerate(smaller): yield smaller[:n] + [first + subset] + smaller[n+1:] def bucke...

0.536828

from collections import defaultdict k = int(input()) d = defaultdict(list) for i in range(10): d[(1, i)].append(i) mx = 10 pw = 1 for digs in range(2, mx): pw *= 10 for sm in range(11): for curr in range(10): for num in d[(digs-1, sm-curr)]: d[(digs, sm)].append( curr*...

0.536506

n = int(input()) out = [] MOD = 998244353 for i in range(1, n + 1): if i == n: out.append(10) else: nex = 2 * 9 * pow(10, n - i - 1, MOD) * 10 if i < n - 1: nex += (n - 1 - i) * 9 * 9 * pow(10, n - i - 2, MOD) * 10 out.append(nex % MOD) print(' '.join(map...

0.536381

#!/usr/local/bin/python3.3 -tt import sys def __starting_point(): def _(f): for l in f: for i in l.split(): yield int(i) g = _(sys.stdin) v = next(g) ar = [] for i in range(9): ar.append((next(g), i + 1)) dominant = min(ar, key=lambda t: (t[0], -...

0.536352

digits = 'zero one two three four five six seven eight nine'.split() def f(n): return ''.join(map(digits.__getitem__, map(int, str(n)))) def numbers_of_letters(n): result = [f(n)] print(n, result) while result[-1] != 'four': result.append(f(len(result[-1]))) return result

0.535721

masks = [0] * 10 for i in range(10 ** 4): for c in str(i): masks[int(c)] |= 1 << i def find_num(n): seq, x = 1, 0 for j in range(n): M = seq for m in masks: if x & m: M |= m x = ~M & (M+1) seq |= x return x.bit_length() - 1

0.535607

test=int(input()) for i in range(test): N=input() X=[] list2=[] for x in N: X.append(x) list1=[] list1=list(set(X)) output='' for x in list1: for y in X: if int(x)>=6: n=int(x)*10+int(y) list2.append(n) for j in list1: if int(j)>=6: m=int(j)*10+int(j) list2.remove(m) list2.sort() if le...

0.535583

from functools import reduce from operator import mul def maximum_product_of_parts(n): s = str(n) return max(reduce(mul, map(int, (s[:i], s[i:j], s[j:]))) for i in range(1,len(s)-1) for j in range(i+1,len(s)))

0.534825

l = [0] def count(size): nums = (10**size - 10**(size - 1)) small = l[size-1] + size large = l[size-1] + nums * size if len(l) <= size: l.append(large) return (nums * (small + large))//2 def test(minSize, size, val): out = minSize * val + size * ((val + 1) * val)//2 return out q ...

0.534703

You are the operator of a Centennial Wheel that has four gondolas, and each gondola has room for up to four people. You have the ability to rotate the gondolas counterclockwise, which costs you runningCost dollars. You are given an array customers of length n where customers[i] is the number of new customers arriving j...

class Solution: def minOperationsMaxProfit(self, customers: List[int], boardingCost: int, runningCost: int) -> int: if runningCost >= 4 * boardingCost: return -1 result = sum(customers) // 4 if (sum(customers) % 4) * boardingCost > runningCost: result += 1 for...

0.877498

n = int(input()) c = list(map(int, input().split(" "))) nodes = dict() nodes[""] = 0 # print(nodes) depth = 0 while depth < n: # expand new_nodes = dict() s = input() for node in nodes.keys(): if s >= node: # not reverse if s in new_nodes: new_nodes[s] = min(new_nodes[s], nodes[node]) else: new...

0.613141

class Solution: def canCompleteCircuit(self, gas, cost): """ :type gas: List[int] :type cost: List[int] :rtype: int """ if sum(gas) < sum(cost): return -1 Rest = 0 index = 0 for i in range(len(gas)): Rest += ...

0.598847

def queue_time(customers, n): l=[0]*n for i in customers: l[l.index(min(l))]+=i return max(l)

0.59352

n = int(input()) def func(v): res = 0 if "A" in v: res |= 1 if "B" in v: res |= 2 if "C" in v: res |= 4 return res cost = [10 ** 10] * 8 cost[0] = 0 for _ in range(n): c, v = input().split() c = int(c) v = func(v) for i in range(8): cost[i | v] = min(cost[i | v], cost[i] + ...

0.59291

n=int(input()) a=[list(map(int,input().split())) for i in range(n)] solved=[0 for i in range(5)] score=[0 for i in range(5)] for i in range(n): for j in range(5): solved[j]+=int(a[i][j]>-1) for k in range(31*n+1): for i in range(5): tot=n+k cur=solved[i] if a[0][i]>-1 and a[1][i]>-1 and a[0][i]>a[1][i]: cu...

0.592399

class Solution: def findMinMoves(self, machines): """ :type machines: List[int] :rtype: int """ if sum(machines) % len(machines) != 0: return -1 mean = sum(machines) // len(machines) cum, step = 0, 0 for x in machines: ...

0.587797

from functools import reduce from math import gcd def survivor(a): """Round Robin by Bocker & Liptak""" def __residue_table(a): n = [0] + [None] * (a[0] - 1) for i in range(1, len(a)): d = gcd(a[0], a[i]) for r in range(d): try: nn = m...

0.584013

def main(): n, ma, mb, *L = list(map(int, open(0).read().split())) M = 1 << 30 dp = [[M] * 420 for _ in range(420)] dp[0][0] = 0 ua = ub = 15 for a, b, c in zip(*[iter(L)] * 3): for i in range(ua, -1, -1): for j in range(ub, -1, -1): t = dp[i][j] + c if dp[i + a][j + b] > t: dp[i + a][j + b] = t...

0.580297

import itertools import math import random import time def timer(f): def tmp(*args, **kwargs): t = time.time() res = f(*args, **kwargs) print("Время выполнения функции: %f" % (time.time()-t)) return res return tmp def genArray(length, lower, upper): return [random.randint(...

0.574526

import re,sys def isCirlePossible(juices,distances): if juices == [] or distances == []: return -1; total_juice_consumed = 0 juice_consumed = 0 start=0 for i in range(0,len(juices)): diff = juices[i] - distances[i] if juice_consumed >= 0: juice_consumed += diff else: juice_consumed = diff start = ...

0.573821

from collections import deque class Solution: def minCost(self, grid: List[List[int]]) -> int: right, left, down, up = (0, 1), (0, -1), (1, 0), (-1, 0) direction_map = { 1: right, 2: left, 3: down, 4: up } directions ...

0.57246

class Solution: def minTaps(self, n: int, ranges: List[int]) -> int: for i,r in enumerate(ranges): l = max(0,i-r) ranges[l] = max(i+r, ranges[l]) res = lo = hi = 0 while hi < n: lo, hi = hi, max(ranges[lo:hi+1]) if hi =...

0.570868

def outOfIndex(boys,girls,COST): if COST == 0: return len(boys) else: total_cost = [ abs(x-y) for x,y in zip(boys,girls)] total_cost = sum(total_cost) return total_cost for _ in range(int(input())): COST = int(input()) queue = input() B = queue.count('B') G = queue.count('G') boys=[] girls = [] if (ab...

0.570235

from heapq import heapify, heappush, heappop class DinnerPlates: # index * cap -> access start of stack at index # index * cap + (cap - 1) -> access last element of stack at index def __init__(self, capacity: int): self.stack = [] # just one array to simulate all the stacks ...

0.568154

class Solution: def minRefuelStops(self, target: int, startFuel: int, stations: List[List[int]]) -> int: if startFuel >= target: return 0 heap = [] #record the reachable gas for now stop = 0 #total stops dist = startFuel #reachable distance for d, g in stations: i...

0.567741

destination, max_gas_tank_volume, gas_prices_number = list(map(int, input().split())) start_point = 0 gas_prices = {start_point:0} for i in range(gas_prices_number): coordinate, price = list(map(int, input().split())) gas_prices[coordinate] = price points = sorted(list(gas_prices.keys()), reverse = True) curren...

0.567202

def main(): trips, reg, cheap, cards, card_cost = list(map(int, input().split())) costs = [] indexes = {} total = 0 last = "" for i in range(trips): a, b = input().split() pair = (min(a, b), max(a, b)) if pair in indexes: index = indexes[pair] else: costs.append(0) index...

0.565286

speeds = [1000000] overtakes = [True] count = 0 speed = 0 n = int(input()) for e in range(n): inp = list(map(int, input().split())) # print(inp) if inp[0] == 4: overtakes.append(True) elif inp[0] == 6: overtakes.append(False) elif inp[0] == 5: speeds.append(1000000) elif inp[0] == 3: speeds....

0.561016

it = lambda: list(map(int, input().strip().split())) INF = float('inf') def solve(): N = int(input()) S = [] R = [] C = [] for _ in range(N): s, c = input().strip().split() S.append(s) R.append(s[::-1]) C.append(int(c)) vis = set() mem = dict() def...

0.561009

H, n = list(map(int, input().split())) d = list(map(int, input().split())) t = 0 miPt = H for a in d: t += 1 H += a miPt = min(miPt, H) if H <= 0: print(t) return if sum(d) >= 0: print(-1) return jump = max(0, miPt // -sum(d) - 2) H -= jump * -sum(d) t += n * jump for i in range(10000000000000000...

0.560902

class Solution: def minCost(self, houses: List[int], Cost: List[List[int]], m: int, n: int, target: int) -> int: @lru_cache(None) def dfs(i, j, k): if i == len(houses): if j == target: return 0 else: return float('in...

0.559906

class Solution: def coinChange(self, coins: List[int], amount: int) -> int: coins.sort(reverse=True) n, res = len(coins), amount + 1 def dfs(index, target, cnt): nonlocal res if cnt + (target + coins[index] - 1) // coins[index] >= res: return ...

0.557075

import sys from math import ceil n, m, k = list(map(int, sys.stdin.readline().split())) places = [True for _ in range(n)] for x in map(int, sys.stdin.readline().split()): places[x] = False costs = list(map(int, sys.stdin.readline().split())) if not places[0]: print(-1) return prev = [i for i in range(n)] ...

0.555306

import sys n, k = list(map(int, sys.stdin.readline().strip().split())) L = [] R = [] A = [] for i in range (0, n): x = list(map(int, sys.stdin.readline().strip().split())) L.append(x[0]) R.append(x[1]) A.append(x[2]) L.append(R[-1]) i = n-1 x = 0 y = 0 ans = 0 v = True N = [0 for i in range (0, n)] whi...

0.551468

INF = 10 ** 18 MX_SZ = 112 dp = [[[INF for k in range (MX_SZ)] for j in range (MX_SZ)] for i in range (MX_SZ)] best = [[[(INF, INF) for k in range (MX_SZ)] for j in range (MX_SZ)] for i in range (MX_SZ)] def read(): return [int(x) for x in input().split()] n, m, k_res = read() arr = read() cost = [] for i in rang...

0.546642

import sys input = lambda: sys.stdin.readline().rstrip() from collections import deque N = int(input()) C, Y = [], [] for _ in range(N): a, b, c = list(map(int, input().split())) C.append(a) Y.append(c - b) if sum(Y): print(-1) return X = [[] for i in range(N)] for i in range(N-1): x, y = list...

0.545754

import sys readline = sys.stdin.readline read = sys.stdin.read ns = lambda: readline().rstrip() ni = lambda: int(readline().rstrip()) nm = lambda: map(int, readline().split()) nl = lambda: list(map(int, readline().split())) prn = lambda x: print(*x, sep='\n') def solve(): a, b, c, d = nm() if a <= b: ...

0.545118

k = int(input().split()[1]) a = [int(s) for s in input().split()] b = [int(s) for s in input().split()] ambk = [(a[i], a[i] - b[i]*k) for i in range(len(a))] ambk.sort(key=lambda a:-a[1]) ts = [0]*(100*100) keys = [0] atras = list(range(100*100 -1, -1, -1)) adelante = list(range(100*100)) for i in range(len(a)): for...

0.543947

N,M,K = map(int,input().split()) INF = 10**6+1 from collections import defaultdict incoming = defaultdict(list) outgoing = defaultdict(list) for _ in range(M): d,f,t,c = map(int,input().split()) if t == 0: incoming[d].append((c,f-1)) if f == 0: outgoing[d].append((c,t-1)) incoming_dates = sorted(incom...

0.543714

# Question B. Road to Cinema import sys def roadToCinema(V, S, T, stations): # O(M) """ V : volume of fuel tank S : total distance T : time limit stations: fuel stations' locations rtype : boolean, whether this aircraft can travel within the time limit """ m = len(s...

0.543139

'''Well I found the bug, but I don't understand why it was doing that. I mean, as far as I can tell, it shouldn't be a bug! Note to self: deleting from (supposedly) local lists through recursion is dangerous!''' class Group(object): def __init__(self,size,start,end,value): self.size = size self.sta...

0.542267

r = open('input.txt') w = open('output.txt', mode='w') f = lambda: map(int, r.readline().split()) f() a, b = f() if a > b: a, b = b, a n = 40001 u, v = [n] * n, [n] * n x = s = 0 u[0] = v[0] = 0 for y in f(): s += y p = [] h = min(x, y) for d in range(min(s, a), max(0, s - b - y) - 1, -1): t ...

0.541801

import sys, math n=int(input()) s=input() z=list(map(int,input().split())) best = 10**9 for i in range(len(s)-1): if s[i]=='R' and s[i+1]=='L': best=min(best, z[i+1]-(z[i]+z[i+1])//2) if best != 10**9: print(best) else: print(-1)

0.540978

from itertools import accumulate def tram(stops, descending, onboarding): return max(accumulate(o - d for d, o in zip(descending[:stops], onboarding)))

0.539878

from fractions import gcd def min_price(nums): nums.sort() ns = [0] + [float('inf')] * (nums[0] - 1) for c in nums[1:]: d = gcd(nums[0], c) for r in range(d): n = min(ns[r::d], default=float('inf')) if n < float('inf'): for j in range(nums[0] // d): ...

0.539791

# returns answer to the subproblem with interval range [start, end], # but with a total of "extra" additional stuff on the end # that must be deleted last. memo = {} def f(dat, rewards, start, end, extra): curr = (start, end, extra) if curr in memo: return memo[curr] if start > end: re...

0.539669

n,k = list(map(int, input().split())) b = list(map(int,input().split())) SSSSSSSSSS = input() INF = 1000*1000*1000+123 RRRR = []; WWWWWWW = []; OOOOOOOOO = []; for i in range(n): if SSSSSSSSSS[i] == 'R': RRRR.append(b[i]) elif SSSSSSSSSS[i] == 'W': WWWWWWW.append(b[i]) else: OOOOO...

0.537564

def solve(arr): res = [] for first in (arr[0]-1, arr[0], arr[0]+1): for second in (arr[1]-1, arr[1], arr[1]+1): val, step, count = second, second-first, abs(arr[0]-first) + abs(arr[1]-second) for current in arr[2:]: val += step if abs(val-current) ...

0.536256

#!/usr/bin/env python3 def solve(): n, k = list(map(int, input().split())) temps = list(map(int, input().split())) summer_seqs = [] winter_seqs = [] cur_season = 1 cur_len = 0 for t in temps: # print("Handling", t) if cur_season * t > 0 or (t == 0 and cur_season == 1): ...

0.534079

import sys from collections import defaultdict input = lambda : sys.stdin.readline().strip() write = lambda x: sys.stdout.write(x) n = int(input()) arr = sorted([(j, i + 1) for i, j in enumerate(map(int, input().split()))]) if n <= 3: print(arr[0][1]) return a1, a2, a3 = arr[0][0], arr[1][0], arr[2][0] c1, c2,...

0.533968

def least_bribes(bribes): mem = {} def s(n1, n2): if n1 >= n2: return 0 if (n1, n2) in mem: return mem[n1, n2] r = min(bribes[i] + max(s(n1, i), s(i + 1, n2)) for i in range(n1, n2)) mem[n1, n2] = r return r return s(0, len(bribes))

0.533306

class CustomStack: def __init__(self, maxSize: int): self.stack = [] self.add = [] self.limit = maxSize def push(self, x: int) -> None: if len(self.stack) < self.limit: self.stack.append(x) self.add.append(0) def pop(self) -> int: if len(sel...

0.531091

import sys # sys.stdin = open('in.txt') s = sys.stdin.read().split() p = 0 def getSm(k, a, b, c, d): return (k + 1) * a - (k * (k + 1) >> 1) * b * d t = int(s[p]) p += 1 res = [] for _ in range(t): a = int(s[p]) p += 1 b = int(s[p]) p += 1 c = int(s[p]) p += 1 d = int(s[p]) p...

0.528928

for _ in range(int(input())): n, x = list(map(int, input().split())) A = [] for _1 in range(n): d, h = list(map(int, input().split())) A.append([d, h]) A.sort(reverse=True) if A[0][0] >= x: print(1) else: x -= A[0][0] mz = 0 for d, h in A: ...

0.528476

import math import sys arrival, departure, time_per_client = [int(x) for x in input().split()] num_clients = int(input()) if num_clients > 0: clients_arrival = [int(x) for x in input().split()] else: print(arrival) return best_time = None current_time = arrival clients_at_queue = 0 client_to_arrive = 0 client_wa...

0.527521

def fish(shoal): eaten, size, target = 0, 1, 4 for f in sorted(map(int, shoal)): if f > size: break eaten += f if eaten >= target: size += 1 target += 4 * size return size

0.527322

import sys a,m,n=list(map(int,input().split())) aux=[0]*(a+1) inf=10**15 dp=[aux.copy() for i in range(n+1)] m1=10**12 m2=10**12 for i in range(m): l,r=list(map(int,input().split())) if l<m1: m1=l for j in range(l,r): dp[0][j+1]=inf s=[] for i in range(1,n+1): x,w=list(map(int,input().sp...

0.52716

from sys import stdin from heapq import heappop,heappush def main(): n,k = map(int,stdin.readline().split()) X = list(map(int,stdin.readline().split())) A = int(stdin.readline().strip()) C = list(map(int,stdin.readline().split())) l = list() i = 0;g = k;ans = 0;flag = True while i < n and flag: heappush(l,C[i...

0.52703

def floo(num, k): return (num - 1) // k + 1 def main(): n, m = map(int, input().split()) low = 1 high = 10**9 if (m == 0): if (n == 1): print(1) else: print(-1) return for i in range(m): k, f = map(int, input().split()) low = max(low, (k + f - 1) // f) if (f > 1): high = min(high, (k - 1) ...

0.526456

q = int(input()) for query in range(q): k, n, a, b = list(map(int,input().split())) if n * b > k: print(-1) else: print(min(n, (k-n*b-1)//(a-b)))

0.525806

def f(x, y, a, b, n): return a + (x - a) * cos[n] - (y - b) * sin[n], b + (x - a) * sin[n] + (y - b) * cos[n] def check(p): d = {} for i in range(len(p) - 1): for j in range(i + 1, len(p)): dist = (p[i][0] - p[j][0]) ** 2 + (p[i][1] - p[j][1]) ** 2 d[dist] = d.get(dist, 0) ...

0.524417

import sys input = sys.stdin.readline from itertools import permutations, accumulate import heapq import bisect from operator import itemgetter def dijkstra(start, edge): n = len(edge) dist = [0]*n que = [(0, start)] while que: d, v = heapq.heappop(que) if dist[v] < d: conti...

0.524172

for _ in range(int(input())): lasts = {} ans = n = int(input()) for i, a in enumerate(input().split()): if a in lasts: ans = min(ans, i - lasts[a]) lasts[a] = i ans += 1 if ans > n: ans = -1 print(ans)

0.524061

import sys MAXV = 100010 d = [0] * MAXV a, b, h, w, n = list(map(int,input().split())) arr = input().split() for it in range(n): arr[it] = int(arr[it]) # print(arr) # print(a, b, h, w, n) def solve(a, b, h, w, z, product, it): # print(">", a, b, h, w, z, product, it) k = 0 if a % h: k = ...

0.522654

def solve(n): if n%10: return -1 c, billet = 0, iter((500,200,100,50,20,10)) while n: x, r = divmod(n, next(billet)) c, n = c+x, r return c

0.52255

class Solution: def mergeStones(self, stones: List[int], K: int) -> int: n = len(stones) if (n - 1) % (K - 1) != 0: return -1 prefix = [0] for s in stones: prefix.append(prefix[-1] + s) @lru_cache(None) def dp(i, j): if j - i + 1 < ...

0.522136

m = 301000 ns = [0] * m es = [0] * m c = [0] * m b = [0] * m t = [0] * m P = 0 def add(b, k): k = t[k] while k: e = es[k] if b[-1] > e: b[-1] = e b[e] += 1 k = ns[k] def delete(b): for i in range(b[m - 1], m + 1): if b[i]: b[i] -= 1 b[-1] = i ...

0.521419

from sys import stdin n,k = list(map(int, stdin.readline().strip().split(' '))) AB = [] A = [] B = [] for i in range(n): t,a,b = list(map(int, stdin.readline().strip().split(' '))) if a == 1 and b == 1: AB.append(t) elif a == 1: A.append(t) elif b == 1: B.append(t) AB.sort() ...

0.519601

# import collections, atexit, math, sys from functools import cmp_to_key #key=cmp_to_key(lambda x,y: 1 if x not in y else -1 ) sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) import bisect try : #raise ModuleNotFoundError import numpy def dprint(*args...

0.519296

def candies(s): if not s or len(s) == 1: return -1 return len(s) * max(s) - sum(s)

0.519212

class Solution: def mincostTickets(self, days: List[int], costs: List[int]) -> int: dp = [0] + [-1 for i in range(days[-1])] for day in days: dp[day] = 0 for i in range(1, len(dp)): if dp[i] == -1: dp[i] = dp[i-1] ...

0.519043

n, d = map(int, input().split()) line = list(map(int, input().split())) pref = [0] * n maxx = 0 for i in range(n): pref[i] = pref[max(i - 1, 0)] + line[i] maxx = max(maxx, pref[i]) maxr = [0] * n for i in range(n - 1, -1, -1): if i == n - 1: maxr[i] = pref[i] else: maxr[i] = max(maxr[i +...

0.517765

class Solution: def maxProductPath(self, grid: List[List[int]]) -> int: rows = len(grid) if (rows == 0): return -1 cols = len(grid[0]) if (cols == 0): return -1 dp = [(1,1)] * cols for r, col in enumerate(grid): fo...

0.517185

from math import gcd def lcm(a, b): return a * b // gcd(a, b) for _ in range(int(input())): n = int(input()) P = list(map(int, input().split())) x, a = map(int, input().split()) y, b = map(int, input().split()) k = int(input()) P.sort(reverse=True) l = 0 r = n + 1 while r - l > 1...

0.516722

class Solution: def videoStitching(self, clips: List[List[int]], T: int) -> int: clips.sort(key=lambda x: [x[0], -x[1]]) res = 0 r = 0 new_r = 0 # print(clips) for s, e in clips: if s <= r: new_r = max(new_r, e) elif...

0.516717

def Solve(x,B): if((X,x,B) in Mem): return Mem[(X,x,B)] if(len(B)>X): return False if(x==len(L)): return True if(Form(L[x],B)): A=list(B) for e in range(len(B)): r=A[e] A[e]=L[x] if(Solve(x+1,tuple(sorted(A)))): ...

0.516208

n, k = list(map(int, input().split())) x = list(map(int, input().split())) ro = list(x[i] - x[i - 1] for i in range(1, n)) if max(x[i] - x[i - 1] for i in range(1, n)) > k: print(-1) else: ans = 1 r = 0 for el in ro: r += el if r > k: ans += 1 r = el pri...

0.515551

n, s, k = list(map(int, input().split())) amounts = list(map(int, input().split())) colors = list(input()) dp = [[-1 for j in range(k + 1)] for i in range(n)] def getAns(nth, left): if left <= 0: return 0 if dp[nth][left] >= 0: return dp[nth][left] ret = 999999999 for i in range(n...

0.51529

import decimal; from decimal import *; def solve(a, b, min1, min2, min3, min4, x, y): if a > b: return []; solMin1 = (a/y+b)/(y-1/y); solMin2 = (b/y+a)/(y-1/y); solMin1 *= (x*y); solMin2 *= (x*y); if solMin1 >= min1 and solMin1 <= min2 and solMin2 >= min3 and solMin2 <= min4: # Solution found return [a, s...

0.514293

def reachable(es, source): ret = {source} Q = [source] while Q: cur = Q.pop() for nxt in es[cur]: if nxt not in ret: Q.append(nxt) ret.add(nxt) return ret def BellmanFord(V:int, es:list, source=0): INF = float("inf") D = [INF]*V D[source] = 0 for _ in range(V): upd = False for f, t, c in es:...

0.514005

import bisect import collections def solve(inp, *args): n, x = list(map(int, inp.split(" ", 1))) travels_by_len = collections.defaultdict(list) travels_by_len_processed = {} for travel in args: l, r, cost = list(map(int, travel.split(" ", 2))) travels_by_len[r - l + 1].append((l, r, co...

0.513882

from functools import lru_cache class Solution: def tallestBillboard(self, rods: List[int]) -> int: rods = sorted(rods)[::-1] n = len(rods) psum = rods.copy() for i in range(n-1)[::-1]: psum[i] += psum[i+1] @lru_cache(None) def dfs(idx, diff): ...

0.513808

from math import inf n, p = [int(x) for x in input().split()] l = [] for i in range(n): a, b = [int(x) for x in input().split()] l.append((a, b, b/a)) l.sort(key=lambda x: x[2]) asum = 0 bsum = 0 sumt = 0 for i in range(n): a0, b0, _ = l[i] c1 = inf if i == n-1 else l[i+1][2] asum += a0 bsum += ...

0.513153

def list_input(): return list(map(int,input().split())) def map_input(): return map(int,input().split()) def map_string(): return input().split() a,b,f,k = map_input() tot = a*k s = 2*a-f cur = 0 cnt = b go = 0 ans = 0 while cur < tot: go = 1-go if(go == 1): if cnt < s and cnt < tot-cur: if(cnt ...

0.512701

import collections class Solution: def shortestSubarray(self, A: List[int], K: int) -> int: cum_sum = 0 queue = collections.deque([(-1, 0)]) result = len(A) + 1 for i, v in enumerate(A): cum_sum += v if v > 0: # find any matches and remove...

0.51262

n, w = list(map(int, input().split())) Cup = list(map(int, input().split())) Water = [] for a in Cup: Water.append((a + 1) // 2) res = w - sum(Water) if res < 0: print(-1) else: while res > 0: i = Cup.index(max(Cup)) num = min(res, Cup[i] - Water[i]) Water[i] += num res -= nu...

0.512136

class Solution: def jobScheduling(self, startTime: List[int], endTime: List[int], profit: List[int]) -> int: # max profit ending at time t dp = [(0,0)] task = [(startTime[i], endTime[i], profit[i]) for i in range(len(startTime))] task = sorted(task, key = lambda x: ...

0.510584

n = int(input()) s = sum(list(map(int, input().split()))) m = int(input()) for i in range(m): l, r = list(map(int, input().split())) s = max(s, l) if l <= s <= r: print(s) return print(-1)

0.510248

import math leftpeople = set() rightpeople = set() n, vl = list(map(int, input().split())) def leftinterval(x0, v0, t): if x0 / v0 <= t: return (0, 10**6) if x0 / (vl + v0) > t: return (-1, -2) leftbound = x0 rightbound = (vl * vl - v0 * v0) * t + x0 * v0 rightbound /= vl right...

0.509262

class Solution: def minDifficulty(self, jobDifficulty: List[int], d: int) -> int: N = len(jobDifficulty) if N < d: return -1 dp = [jobDifficulty[0]] for j in jobDifficulty[1:]: dp.append(max(dp[-1], j)) for i in range(1, d): ...

0.50849

from collections import defaultdict, deque n = int(input()) adj = [[] for _ in range(n)] v = [0] * n l = list(map(int, input().split())) for i, f in enumerate(l): adj[f - 1].append(i + 1) s = list(map(int, input().split())) Q = deque([(0, s[0], s[0])]) ans = 0 flag = False possible = True while Q and possible: ...

0.507944

import numpy as np N, C = list(map(int, input().split())) xv = [(0, 0)] for i in range(N): x, v = list(map(float, input().split())) xv.append((x, v)) sumA = np.zeros(N+2, dtype=float) sumB = np.zeros(N+2, dtype=float) xv.sort(key=lambda tup:tup[0]) xv.append((C,0)) for i in range(N+1): sumA[i+1] = sumA[...

0.507326

from math import ceil def mega_mind(hp, dps, shots, regen): if dps*shots >= hp: return ceil(hp / dps) if dps*shots <= regen: return -1 number_of_regenerations = ceil((hp - dps*shots) / (dps*shots - regen)) return ceil((hp + regen*number_of_regenerations) / dps)

0.50633

def main(): N, K = list(map(int, input().split())) Apples = [int(x) for x in input().split()] time = 0 # answer # Apples_encountered = [None] # Binary Search Tree distinct_apples_condition = None if K & 1 else K >> 1 already_found = [False] * K for i in range((N >> 1) + 1): time += 1 for k in ...

0.505358

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.505055

from math import inf n=int(input()) a = input() a= [int(i) for i in a.split()] s =input() s = [int(i) for i in s.split()] ans = inf for j in range(1 , n-1): ll , lr = inf , inf for q in range(j+1,n): if a[j]<a[q]: lr = min(lr , s[q]) for q in range(j): if a[j]>a[q]: ...

0.503952

def next_smaller(n): s = list(str(n)) i = j = len(s) - 1 while i > 0 and s[i - 1] <= s[i]: i -= 1 if i <= 0: return -1 while s[j] >= s[i - 1]: j -= 1 s[i - 1], s[j] = s[j], s[i - 1] s[i:] = reversed(s[i:]) if s[0] == '0': return -1 return int(''.join(s))

0.503771

#This code is dedicated to Vlada S. class Course: def __init__(self, reqs, number): self.reqs = list(map(int, reqs.split()[1:])) self.available = False self.in_stack = False self.number = number n, k = list(map(int, input().split())) requirements = list(map(int, input().split())) courses = {} answer = "" f...

0.503741

#!/usr/local/bin/python3.3 -tt import sys def __starting_point(): def _(f): for l in f: for i in l.split(): yield int(i) g = _(sys.stdin) v = next(g) ar = [] for i in range(9): ar.append((next(g), i + 1)) dominant = min(ar, key=lambda t: (t[0], -...

0.503144

class Solution: def largestNumber(self, cost: List[int], target: int) -> str: dp = [0] + [-target]*target for t in range(1, target+1): dp[t] = max([dp[t-i] for i in cost if i<=t]+[dp[t]]) + 1 if dp[-1]<=0: return '0' res = '' for i in range(8, -1, -1): ...

0.503

def doit(): xx = input().split() n = int(xx[0]) s = int(xx[1]) v = [int(k) for k in input().split()] S = sum(v) newS = S - s if newS < 0: return -1 return min(newS//n, min(v)) print(doit())

0.501603

n, q = list(map(int, input().split())) servers = [0] * n for _ in range(q): t, k, d = list(map(int, input().split())) # free = [i for i, x in enumerate(servers) if x < t] free = [] for sn in range(n): if servers[sn] < t: free.append(sn) if len(free) == k: break ...

0.501358

import sys import itertools inputs = sys.stdin.read().split() len_string = int(inputs[0]) desired_size = int(inputs[1]) string = inputs[2] size = 0 cost = 0 cur_set = set() cur_set.add(string) for i in range(len_string, -1, -1): cur_size = len(cur_set) if size+cur_size >= desired_size: cost += (desire...

0.500909

""" Codeforces Round 251 Div 2 Problem A Author : chaotic_iak Language: Python 3.3.4 """ def read(mode=2): # 0: String # 1: List of strings # 2: List of integers inputs = input().strip() if mode == 0: return inputs if mode == 1: return inputs.split() if mode == 2: ...

0.500736

class Solution: def minSubarray(self, nums: List[int], p: int) -> int: need = sum(nums) % p if need == 0: return 0 pos = {0: -1} total = 0 ans = float('inf') for i, num in enumerate(nums): total = (total + num) % p target = (total -...

0.499316

import sys from collections import defaultdict input = sys.stdin.readline sys.setrecursionlimit(1000000) arr=[int(x) for x in input().split()] if arr[0]==1: print(0) return p=[None] for i in range(1,arr[0]+1): p.append(arr[i]) a=[None] for i in range(arr[0]+1,2*arr[0]+1): a.appe...

0.499101

3 n = int(input()) a = [0] + list(map(int, input().split())) if len(a) < 3 or n % 2 == 0: print(-1) else: ans = 0 for x in range(n // 2, 0, -1): d = max(0, a[2 * x], a[2 * x + 1]) ans += d a[x] -= d print(ans + max(0, a[1]))

0.498928

class Solution: def balancedString(self, s: str) -> int: # minimum window so that outside is possible if len(s) //4 != len(s) / 4: return -1 ans, lb, n_cnt = len(s), 0, collections.Counter(s) i = 0 while i < len(s): n_cnt[s[i]] -= 1 while lb < ...

0.49862

# import collections, atexit, math, sys from functools import cmp_to_key #key=cmp_to_key(lambda x,y: 1 if x not in y else -1 ) sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) import bisect try : #raise ModuleNotFoundError import numpy def dprint(*args...

0.498374

def finding_k(arr): for n in range(max(arr)-1, 0, -1): if len({ x%n for x in arr }) == 1: return n return -1

0.498336

Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1. Example 1: Input: 123 Output: "One Hundred Twenty Three" Example 2: Input: 12345 Output: "Twelve Thousand Three Hundred Forty Five" Example 3: Input: 1234567 Output: "One Million Two Hundred ...

class Solution: V1 = ["", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Eleven", "Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen", "Seventeen", "Eighteen", "Nineteen"] V2 = ["", "", "Twenty", "Thirty", "Forty", "Fifty", "Sixty", "Seventy", "Eighty", "Ninety"]...

0.672904

words = "zero one two three four five six seven eight nine" + \ " ten eleven twelve thirteen fourteen fifteen sixteen seventeen eighteen nineteen twenty" + \ " thirty forty fifty sixty seventy eighty ninety" words = words.split(" ") def number2words(n): if n < 20: return words[n] elif n < 100: ...

0.691786

def int_to_word(num): d = { 0 : 'zero', 1 : 'one', 2 : 'two', 3 : 'three', 4 : 'four', 5 : 'five', 6 : 'six', 7 : 'seven', 8 : 'eight', 9 : 'nine', 10 : 'ten', 11 : 'eleven', 12 : 'twelve', 13 : 'thirteen', 14 : 'fourteen', 15 : 'fifteen', 16 : 'sixteen', 17 : 'seventeen', 18 : 'eighte...

0.63902

WORDS = ( (90, 'ninety'), (80, 'eighty'), (70, 'seventy'), (60, 'sixty'), (50, 'fifty'), (40, 'forty'), (30, 'thirty'), (20, 'twenty'), (19, 'nineteen'), (18, 'eighteen'), (17, 'seventeen'), (16, 'sixteen'), (15, 'fifteen'), (14, 'fourteen'), (13, 'thirteen'), (12, 'twelve'), (11, 'eleven'), (10, 't...

0.636988

words = {w: n for n, w in enumerate('zero one two three four five six seven eight nine ten eleven twelve thirteen fourteen fifteen sixteen seventeen eighteen nineteen'.split())} words.update({w: 10 * n for n, w in enumerate('twenty thirty forty fifty sixty seventy eighty ninety hundred'.split(), 2)}) thousands = {w: 10...

0.584536

def new_numeral_system(n): a = [c for c in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' if c <= n] return ['{} + {}'.format(a[i], a[-1-i]) for i in range((len(a) + 1) // 2)]

0.576554

import re NEG, DOT, _, *DIGS = "负点零一二三四五六七八九" POWS = " 十百千万".split(' ') NUMS = {str(i):c for i,c in enumerate(DIGS)} for n in range(10): NUMS[str(n+10)] = POWS[1] + DIGS[n]*bool(n) def to_chinese_numeral(n): ss = str(abs(n)).split('.') return NEG*(n<0) + parse(ss[0]) + (len(ss)>1 and decimals(ss[1]) or '...

0.56727

def super_size(n): return int(''.join(sorted(str(n), reverse = True)))

0.540109

import re ls = ["Zero","One","Two","Three","Four","Five","Six","Seven","Eight","Nine","Ten","Eleven","Twelve","Thirteen"] def max_consec_zeros(n): return ls[max(map(lambda x:len(x),re.findall(r'0*',bin(int(n))[2:])))]

0.538799

from math import * DIGS = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ' def converter(n, decimals=0, base=pi): lst,n = ['-'*(n<0)], abs(n) pMax = max(0, n and int(log(n,base))) for p in reversed(range(-decimals,pMax+1)): if p==-1: lst.append('.') p = base**p d,n = n/p, n%p ...

0.538257

ANSWERS = { 0: 1, 1: 1, 2: 2, 3: 3, 4: 5, 5: 7, 6: 11, 7: 15, 8: 22, 9: 30, 10: 42, 11: 56, 12: 77, 13: 101, 14: 135, 15: 176, 16: 231, 17: 297, 18: 385, 19: 490, 20: 627, 21: 792, 22: 1002, 23: 1255, 24: 1575, 25: 1...

0.537796

def champernowne_digit(n): if not type(n) is int or n < 1: return float("NaN") i, l = 1, 11 while l <= n: i, l = i + 1, l + 9 * (i + 1) * 10**i return ((n - l) // (i * 10**(i - 1 - (n - l) % i))) % 10 champernowneDigit = champernowne_digit

0.53326

from collections import Counter EXECUTIONS_ORDER = [('Z', Counter("ZERO"), '0'), ('W', Counter("TWO"), '2'), ('U', Counter("FOUR"), '4'), ('X', Counter("SIX"), '6'), ('G', Counter("EIGHT"), '8'), ('O', Counter("O...

0.52919

class Solution: def largestPalindrome(self, n): """ :type n: int :rtype: int """ A = [0,9,987,123,597,677,1218,877,475] return A[n]

0.527846

def b(n): if not n: return '0' r = [] while n: r.append(n % 2) n = (n - n % 2) / -2 return ''.join(str(c) for c in r[::-1]) def d(n): r = 0 for c in n: r = -2 * r + int(c) return r def skrzat(base, n): if base == 'b': return 'From binary: %s is %d' % (n, d(n)) if ba...

0.520511

def per(n): r = [] while n>=10: p=1 for i in str(n): p=p*int(i) r.append(p) n = p return r

0.51994

hidden=lambda n: "".join("oblietadnm"[int(d)] for d in str(n))

0.518534

l = {j:i for i,j in enumerate('0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz')} l_ = dict(enumerate('0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz')) is_polydivisible = lambda n, base:next((0 for i in range(1, len(n) + 1) if get_base(n[:i], base) % i),1) get_base = lambda n, base:sum(...

0.515787

n = int(input()) if n == 0: print('zero') elif n == 1: print('one') elif n == 2: print('two') elif n == 3: print('three') elif n == 4: print('four') elif n == 5: print('five') elif n == 6: print('six') elif n == 7: print('seven') elif n == 8: print('eight') elif n == 9: print('nine') elif n == 10: print('ten...

0.515354

class Solution: def monotoneIncreasingDigits(self, N): """ :type N: int :rtype: int """ arr = [int(ch) for ch in str(N)] # create array from number 1234 => [1,2,3,4] marker = len(arr) i = len(arr)-2 while i >= 0: ...

0.513924

FRACTIONS = " . : :. :: :.: S S. S: S:. S:: S:.:".split(" ") UNITS = " I II III IV V VI VII VIII IX" .split(" ") TENS = " X XX XXX XL L LX LXX LXXX XC" .split(" ") HUNDREDS = " C CC CCC CD D DC DCC DCCC CM" .split(" ") THOUSANDS = " M MM MMM MMMM MMMMM" .split(" ") def roman...

0.513614

import math class Solution: def smallestGoodBase(self, n): n = int(n) maxLength = int(math.log(n,2)) for m in range(maxLength, 1, -1): k = int(n**m**-1) if (k**(m+1) - 1)//(k - 1) == n: return str(k) return str(n-1) """ ...

0.513429

import string from collections import OrderedDict class RomanNumerals: @classmethod def to_roman(self, num): conversions = OrderedDict([('M',1000), ('CM',900), ('D', 500), ('CD',400), ('C',100), ('XC',90), ('L',50), ('XL',40), ('X',10), ('IX',9), ('V',5), ('IV',4), ('I',1)]) ...

0.512999

from math import ceil numbers = {0:"zero", 1: "one", 2: "two", 3: "three", 4: "four", 5: "five", 6: "six", 7: "seven", 8: "eight", 9: "nine", 10: "ten", 11:"eleven", 12: "twelve", 13: "thirteen", 14: "fourteen", 15: "fifteen", 16:"sixteen", 17:"seventeen", 18: "eighteen", 19: "nineteen", 20: "twenty"} def wallpaper...

0.512904

def expanded_form(num): num = list(str(num)) return ' + '.join(x + '0' * (len(num) - y - 1) for y,x in enumerate(num) if x != '0')

0.512319

def trotter(n): i, numStr, numList =0,'',['0','1','2','3','4','5','6','7','8','9'] if n==0: return('INSOMNIA') while all([i in numStr for i in numList])!=True: i+=1 numStr = numStr+str(n*i) return(i*n)

0.510034

def digitize(n): return [int(x) for x in str(n)[::-1]]

0.509925

def colorful(number): base_result = [] for x in str(number): base_result.append(int(x)) for y in range(len(base_result) - 1): temp = base_result[y] * base_result[y + 1] base_result.append(temp) # Should you really eval the last value ? :shrug: If so, would use eval return len...

0.509759

digits = 'zero one two three four five six seven eight nine'.split() def f(n): return ''.join(map(digits.__getitem__, map(int, str(n)))) def numbers_of_letters(n): result = [f(n)] print(n, result) while result[-1] != 'four': result.append(f(len(result[-1]))) return result

0.508574

class Solution: def convertToBase7(self, num): """ :type num: int :rtype: str """ if num < 0: return '-' + str(self.convertToBase7(-num)) elif num < 7: return str(num) else: return str(self.convertToBase7(num//7))...

0.508066

def max_number(n): return int(''.join(sorted(str(n), reverse=True)))

0.504903

def simplify(n): output = [] exp = 0 while n: n, r = divmod(n, 10) if r: output.append(f"{r}*{10**exp}" if exp else f"{r}") exp += 1 return "+".join(output[::-1])

0.503529

def switch_it_up(n): return ['Zero','One','Two','Three','Four','Five','Six','Seven','Eight','Nine'][n]

0.503196

def ordering_beers(beers): assert 0 <= beers < 100 units = ["", "jeden", "dwa", "trzy", "cztery", "piec", "szesc" , "siedem", "osiem", "dziewiec", "dziesiec", "jedenascie", "dwanascie", "trzynascie", "czternascie", "pietnascie", "szesnascie", "siedemnascie", "osiemnascie", "dziewietnascie"] ...

0.50269

class Solution: def convertToTitle(self, n): """ :type n: int :rtype: str """ ans = '' a = 0 while n>0: if a>0: n = n//26 p = n%26 if p==0: p=26 ans += ch...

0.50227

def sort_number(a): a = sorted(a) return [1]+a if a.pop()!=1 else a+[2]

0.501903

def solution(n): roman_numerals = {1000:'M', 900: 'CM', 500: 'D', 400: 'CD', 100: 'C', 90: 'XC', 50: 'L', 40: 'XL', 10: 'X', ...

0.501041

def hoop_count(n): return "Keep at it until you get it" if n <10 else "Great, now move on to tricks"

0.500399

def digitize(n): return [int(d) for d in str(n)]

0.499036

class Solution: def originalDigits(self, s): """ :type s: str :rtype: str """ dmap={} dmap[0]=s.count('z') dmap[2]=s.count('w') dmap[4]=s.count('u') dmap[6]=s.count('x') dmap[8]=s.count('g') dmap[1]=s.count('o')-dmap...

0.49732

BASE = [r.split('|') for r in '''\ ### | | ### | ### | | ### | ### | ### | ### | ### | # # | # | # | # | # # | # | # | # | # # | # # | # # | # | # | # | # # | # | # | # | # # | # # | # # | # | ...

0.495284

def reverse(n): m = 0 while n > 0: n, m = n // 10, m * 10 + n % 10 return m

0.494555

from collections import Counter fib = [0, 1] def around_fib(n): while len(fib) <= n: fib.append(fib[-1] + fib[-2]) f = str(fib[n]) val = max((v, -int(k)) for k,v in Counter(f).items()) last = f[-(len(f)%25 or 25):] return f"Last chunk {last}; Max is {val[0]} for digit {-val[1]}"

0.493546

def decode(number): return ', '.join( str(int(w, 2)) if i % 2 else ''.join( chr(int(w[x:x+3])-4) for x in range(0, len(w), 3) ) for i, w in enumerate( str(number).strip('98').split('98') ) )

0.492302

def how_many_dalmatians(n): dogs = ["Hardly any", "More than a handful!", "Woah that's a lot of dogs!", "101 DALMATIONS!!!"] return dogs[0] if n <= 10 else dogs[1] if n <=50 else dogs[3] if n == 101 else dogs[2]

0.490848

def dollar_to_speech(value): if "-" in value: return "No negative numbers are allowed!" d, c = (int(n) for n in value.replace("$", "").split(".")) dollars = "{} dollar{}".format(str(d), "s" if d != 1 else "") if d or not c else "" link = " and " if (d and c) else "" cents = "{} cent{}".forma...

0.489462

def self_converge(number): n, cycle = str(number), set() while n not in cycle: cycle.add(n) s = ''.join(sorted(n)) n = '%0*d' % (len(n), int(s[::-1]) - int(s)) return -1 if not int(n) else len(cycle)

0.489398

def number_format(n): return f'{n:,}'

0.489247

def basereduct(x): for _ in range(150): x = int(str(x), int(max(str(x))) + 1 + ('9' in str(x))) if x < 10: return x return -1

0.488995

def increment_string(strng): head = strng.rstrip('0123456789') tail = strng[len(head):] if tail == "": return strng+"1" return head + str(int(tail) + 1).zfill(len(tail))

0.488984

def group_by_commas(n): return '{:,}'.format(n)

0.487571

def numericals(s): dictio = {} t = "" for i in s: dictio[i] = dictio.get(i,0) + 1 t += str(dictio[i]) return t

0.486418

def int_to_negabinary(i): ds = [] while i != 0: ds.append(i & 1) i = -(i >> 1) return ''.join(str(d) for d in reversed(ds)) if ds else '0' def negabinary_to_int(s): i = 0 for c in s: i = -(i << 1) + int(c) return i

0.485335

N = ['zero','one','two','three','four','five','six','seven','eight','nine'] def average_string(s): try: return N[sum(N.index(w) for w in s.split()) // len(s.split())] except (ZeroDivisionError, ValueError): return 'n/a'

0.484887

def is_incrementing(number): return str(number) in '1234567890' def is_decrementing(number): return str(number) in '9876543210' def is_palindrome(number): return str(number) == str(number)[::-1] def is_round(number): return set(str(number)[1:]) == set('0') def is_interesting(number, awesome_phrases): test...

0.483017

def title_to_number(title): ret = 0 for i in title: ret = ret*26 + ord(i) - 64 return ret

0.482718

def string_expansion(s): m,n = '',1 for j in s: if j.isdigit(): n = int(j) else: m += j*n return m

0.481996

def print_nums(*arr): if not arr: return '' ln = len(str(max(arr))) return '\n'.join(str(c).zfill(ln) for c in arr)

0.479558

def solution(value): return "Value is %05d" % value

0.479222

class Solution: def nextGreaterElement(self, n): """ :type n: int :rtype: int """ s=[i for i in str(n)] exist=-1 for i in range(len(s)-1,0,-1): if s[i-1]<s[i]: temp=sorted(s[i-1:]) pivot=temp.index(s[i-1])...

0.476263

def convert_my_dollars(usd, currency): curs = { 'Ar':478, 'Ba':82, 'Cr':6, 'Cz':21, 'Do':48, 'Ph':50, 'Uz':10000, 'Ha':64, 'Gu':7, 'Ta':32, 'Ro':4, 'Eg':18, 'Vi':22573, 'In':63, 'Ni':31, 'Ve':10, 'No':8, 'Ja':111, 'Sa':3, 'Th':32, 'Ke':102, 'So':1059} return f"You now have {usd*c...

0.475472

import math import re from fractions import Fraction class Task: table = ['111111101010101111100101001111111\n', '100000100000000001010110001000001\n', '101110100110110000011010001011101\n', '101110101011001001111101001011101\n', '101110101100011000111100101011101\n', '100000101010101011010000101000001\n', '111111...

0.475327

TABLE = str.maketrans('0123456789','9876543210') def code(*args): return sum(map(lambda n:int(str(n).translate(TABLE)), args))

0.474581

from math import ceil, log10 def graceful_tipping(bill): bill *= 1.15 if bill < 10: return ceil(bill) e = int(log10(bill)) unit = (10 ** e) / 2 return ceil(bill / unit) * unit

0.473873

0.473254

def persistence(n): n = str(n) count = 0 while len(n) > 1: p = 1 for i in n: p *= int(i) n = str(p) count += 1 return count # your code

0.473112

def womens_age(n): return f"{n}? That's just {20+n%2}, in base {n//2}!"

0.472986

tr=str.maketrans('56789','45678') def faulty_odometer(n): return int(str(n).translate(tr),9)

0.471748

def meters(x): #your code here arr = ['','k','M','G','T','P','E','Z','Y'] count=0 while x>=1000 : x /=1000.00 count+=1 if int(x)==x: x=int(x) return str(x)+arr[count]+'m'

0.47137

sequence=lambda n:int(format(n,'b'),3)

0.471307

L = ( (' #### ', ' ## ', ' #### ', ' #### ', '## ##', '######', ' ## ', '######', ' #### ', ' #### ').__getitem__, ('## ##', ' ### ', '## ##', '## ##', '## ##', '## ', ' ## ', '## ##', '## ##', '## ##').__getitem__, ('## ##', '# ## ', ' ## ', ' ## ', '## ##', '##### ', ' #### ', ...

0.471092

def computer_to_phone(numbers): return "".join([str({0:0, 1:7, 2:8, 3:9, 4:4, 5:5, 6:6, 7:1, 8:2, 9:3}[int(n)]) for n in numbers])

0.470827

for _ in range(int(input())): n=input().rstrip() n=[ele for ele in n] l=len(n) m=10**18+8 ini=1 for i in range(l-1,-1,-1): if int(n[i])<=m: if ini==1: m=int(n[i]) else: m=max(m,n[i]) else: m=int(n[i])-1 n[i]=str(m) for j in range(l-1,i,-1): n[j]='9' i=0 while n[i]=='0': i+=1...

0.470311

class Solution: def countAndSay(self, n): s = '1' for _ in range(n-1): let, temp, count = s[0], "", 0 for l in s: if let == l: count += 1 else: temp += str(count) + let ...

0.470151

def create_number_class(alphabet): n = len(alphabet) class Number(object): def __init__(self, s): if isinstance(s, str): v = 0 for c in s: v = v * n + alphabet.index(c) else: v = s self.value = v ...

0.469261

def pattern(n): nums = '1234567890' str_nums = nums*(n//10) + nums[:n%10] return '\n'.join(' '*(n - i - 1) + str_nums + ' '*i for i in range(n))

0.467146

TOME = {'a':1, 'b':2, 'c':3, 'd':4, 'e':5, 'f':6, 'g':7, 'h':8, 'i':9, 'k':10, 'l':20, 'm':30, 'n':40, 'o':50, 'p':60, 'q':70, 'r':80, 's':90, 't':100, 'u':200, 'x':300, 'y':400, 'z':500, 'j':600, 'v':700, 'w':900} def gematria(s): return sum(TOME.get(c,0) for c in s.lower())

0.466164

def solve(n): def length(n): s = 0 for i in range(20): o = 10 ** i - 1 if o > n: break s += (n - o) * (n - o + 1) // 2 return s def binary_search(k): n = 0 for p in range(63, -1, -1): if length(n + 2 ** p) < k: n += 2 ** p ...

0.46533

def transform(num, base): digits = [] while num > 0: num, remainder = divmod(num, base) digits.append( remainder if remainder < 10 else "x" ) return digits def fouriest(i): max_fours, base, best = 0, 5, [None, None] while i >= base**(max_fours): digits = tran...

0.465274

def tongues(code): AsT = "" for i in code: if i == "i": AsT = AsT + "o" elif i == "t": AsT = AsT + "n" elif i == "a": AsT = AsT + "e" elif i == "d": AsT = AsT + "r" elif i == "f": AsT = AsT + "g" elif i =...

0.464919

def fibfusc(n, num_digits=None): if n < 2: return (1 - n, n) b = bin(n)[2:] x, y = fibfusc(int(b[0])) for bit in b[1:]: if bit == "1": x, y = (-y*(2*x + 3*y), (x + 2*y)*(x + 4*y)) else: x, y = ((x + y) * (x - y), y * (2*x + 3*y)) if num_digits: ...

0.464637

def count_me(data): if not data.isdigit(): return '' result = [] count = 1 last = data[0] for char in data[1:]: if char == last: count += 1 else: result.append(str(count) + last) last = char count = 1 result.a...

0.46462

d, polydivisible, arr = 1, [], list(range(1, 10)) while arr: d += 1 polydivisible.extend(arr) arr = [n for x in arr for n in range(-(-x*10 // d) * d, (x+1) * 10, d)] def next_num(n): from bisect import bisect idx = bisect(polydivisible, n) if idx < len(polydivisible): return ...

0.46398

class Solution: def largestNumber(self, nums): """ :type nums: List[int] :rtype: str """ nums = [str(n) for n in nums] nums.sort(reverse=True) for i in range(1, len(nums)): if len(nums[i-1]) > len(nums[i]): ...

0.463422

def special_number(n): return "Special!!" if max(str(n)) <= "5" else "NOT!!"

0.463034

def convert(number): return ''.join(chr(int(number[a:a + 2])) for a in range(0, len(number), 2))

0.462161

def digits_product(product): if product < 10: return 10 + product n = '' for d in range(9, 1, -1): while not product % d: n += str(d) product //= d return int(n[::-1]) if product == 1 else -1

0.461951

def dig_pow(n, p): s = 0 for i,c in enumerate(str(n)): s += pow(int(c),p+i) return s/n if s%n==0 else -1

0.461651

from math import ceil def b91decode(strng): ret = '' base91_alphabet = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't'...

0.461517

score=lambda n:2**n.bit_length()-1

0.461123

def binary_array_to_number(arr): return int("".join(map(str, arr)), 2)

0.460106

def multiply(n): return n*5**len(str(abs(n)))

0.460001

def billboard(name, price=30): return sum(price for letter in name)

0.459946

class Solution: def titleToNumber(self, s): """ :type s: str :rtype: int """ r, t = 0, 1 for i in s: r = r*26 +(ord(i)-64) #t *= 26 return r

0.458705

lst=[1, 2, 4, 8, 13, 21, 31, 45, 66, 81, 97, 123, 148, 182, 204, 252, 290, 361, 401, 475, 565, 593, 662, 775, 822, 916, 970, 1016, 1159, 1312, 1395, 1523, 1572, 1821, 1896, 2029, 2254, 2379, 2510, 2780, 2925, 3155, 3354, 3591, 3797, 3998, 4297, 4433, 4779, 4851, 5123, 5243, 5298, 5751, 5998, 6374, 6801, 6925, 7460, 754...

0.458199

import math def nth_perm(n,d): digits = [str(i) for i in range(d)] out = '' for i in range(1, d): cycles = math.ceil(n/math.factorial(d-i)) out += digits.pop((cycles % (d-i+1)) - 1) return out + digits.pop()

0.458199

def reverse_number(n): """ Reverse a number, preserve negative sign """ s = str(n) ret = int("-{}".format(s[:0:-1]) if "-" in s else s[::-1]) return ret

0.45804

def dlog(x, n): bigMod = 5 ** n ans = [None, 0, 1, 3, 2][x % 5] val = 2 ** ans % bigMod mod, phi = 5, 4 phiVal = 2 ** phi % bigMod for i in range(2, n + 1): nextMod = mod * 5 while val % nextMod != x % nextMod: val = val * phiVal % bigMod ans += phi phi *= 5 phiVal = (phiVal * ...

0.457789

def get_num(n): return sum({'0': 1, '6': 1, '9': 1, '8': 2}.get(d, 0) for d in str(n))

0.457458

from math import factorial from string import digits, ascii_uppercase DIGITS = digits + ascii_uppercase FACTORIALS = [1, 1] f = 1 for i in range(2, 36): f *= i FACTORIALS.append(f) def dec2FactString(nb): ret = [] for f in reversed(FACTORIALS): (d, nb) = divmod(nb, f) if d or ret: ...

0.456626

def zeroes (base, number): pzeros = [] for p in range(2, base+1): e = 0 while base % p == 0: base /= p e += 1 if e: f, m = 0, number while m: m /= p f += m pzeros.append(f / e) return min(pzer...

0.45597

You are given a list of preferences for n friends, where n is always even. For each person i, preferences[i] contains a list of friends sorted in the order of preference. In other words, a friend earlier in the list is more preferred than a friend later in the list. Friends in each list are denoted by integers from 0 t...

class Solution: def preferences_to_scores(self, preferences): scores = {} for u, up in enumerate(preferences): for s, v in enumerate(up): scores[(u, v)] = s return scores def unhappy_friends(self, scores, a, b): ret = set() for ai, aa in e...

0.797719

class Solution: def possibleBipartition(self, N: int, dislikes: List[List[int]]) -> bool: if not dislikes: return True group = [None] * (N + 1) group[dislikes[0][0]] = 1 group[dislikes[0][1]] = -1 group1 = set([1]) group2 = set() counter = 2 ...

0.659681

import sys from collections import defaultdict class BIT(): def __init__(self, n): self.n = n self.tree = [0] * n def _get_sum(self, r): ''' sum on interval [0, r) ''' result = 0 while r > 0: result += self.tree[r-1] r &= (r ...

0.608797

import sys import heapq nnode,nedge,source,dest=list(map(int,sys.stdin.readline().split())) source-=1;dest-=1 adjl=[[] for _ in range(nnode)] for _ in range(nedge): u,v=list(map(int,sys.stdin.readline().split())) u-=1;v-=1 adjl[u].append(v) adjl[v].append(u) # why not BFS? >.< def dijkstra_from(source): pq=[] ...

0.601311

import sys n = int(input()) a = [int(t) for t in input().split(' ')] mx = [[] for _ in range(n)] lines = sys.stdin.readlines() for i in range(n-1): v1, v2 = (int(t) - 1 for t in lines[i].split(' ')) mx[v1].append(v2) mx[v2].append(v1) count = [[0, 0] for _ in range(n)] total = [a.count(1), a.count(2)] ...

0.59745

l=input().strip().split(" "); n=int(l[0]); m=int(l[1]); t=m; v=[]; for i in range(n+1): v.append([]); while t>0: l=input().strip().split(" "); a=int(l[0]); b=int(l[1]); v[a].append(b); t-=1; ans=0 ; for p in range(1,n+1): gp={}; for ch in range(1,n+1): gp[ch]=0; for u in v[p]: for x in v[u...

0.594325

from math import * def r1(t): return t(input()) def r2(t): return [t(i) for i in input().split()] for _ in range(r1(int)): n = r1(int) a = r2(int) g = True for i in range(n): if a[i] != i + 1: g = False break if g: print(0) continue g =...

0.586313

'''input 1 3 1 2 1 3 1 2 3 ''' import sys sys.setrecursionlimit(1000000) for _ in range(eval(input())): C=[] n=eval(input()) for i in range(n): C.append([]) for i in range(n-1): a,b=[int(x)-1 for x in input().split()] C[a].append(b) C[b].append(a) cnt=0 Co=[bin(int(x)).count("1") for x in input().split()]...

0.582597

import time n, m =map(int, input().split()) names={None:0} count={i:0 for i in range(1, m+1)} a=[0]*(n+1) for i in range(n): l=list(input().split()) if l[0]=='2': if l[1] not in names: names[l[1]]=len(names) a[i]=names[l[1]] count[a[i]]=count[a[i]]+1 # else a[i] stay...

0.580556

import sys from collections import defaultdict # 再帰制限を緩和するおまじない sys.setrecursionlimit(10**6) def sum(n):return n*(n+1)//2 # 部分木のサイズと、「色iを封鎖したときに到達できない頂点の個数」を持つ辞書を返す def dfs(v,p): ret=defaultdict(int) size=1 for vv in g[v]: if vv==p: continue ss,d=dfs(vv,v) size+=ss ...

0.57776

import sys readline = sys.stdin.readline class UnionFind(object): def __init__(self, n): self._par = list(range(n)) self.size = [1]*n def root(self, v): if self._par[v] == v: return v self._par[v] = self.root(self._par[v]) return self._par[v] def un...

0.576677

import sys sys.setrecursionlimit(10 ** 7) def input() : return sys.stdin.readline().strip() def INT() : return int(input()) def MAP() : return map(int,input().split()) def LIST() : return list(MAP()) def NIJIGEN(H): return [list(input()) for i in range(H)] def dfs(j): if j not in finish: finish.add(j) fo...

0.576336

def main(): def countchildren(graph,vert,memo,pard=None): dumi=0 for child in graph[vert]: if child!=pard: if len(graph[child])==1: memo[child]=0 else: memo[child]=countchildren(graph,child,memo,vert)[0] ...

0.575576

# cook your dish here try: X=list(map(int, input().split())) except: X=[0,0] ch=[] chnew=[] par={} par[1]=0 for i in range(X[0]+1): ch.append([]) chnew.append([]) for i in range(X[0]-1): Y=list(map(int, input().split())) #par[Y[1]]=[Y[0],Y[2]] ch[Y[0]].append([Y[1],Y[2]]) ch[Y[1]].append...

0.574227

import sys input = lambda: sys.stdin.readline().rstrip() N, M = list(map(int, input().split())) D = [{} for _ in range(N)] for _ in range(M): a, b = list(map(int, input().split())) a -= 1 b -= 1 D[a][b] = 1 D[b][a] = 1 L = [i-1 for i in range(N)] R = [i+1 for i in range(N)] F = [0] * N for i in r...

0.572954

n = int( input().split()[0] ) answer = 0 h = [] a = [] for i in range( 0, n ): team = input().split() h.append( int( team[0] ) ) a.append( int( team[1] ) ) for i in range( 0, n ): for j in range( 0, n ): if i == j: continue if h[i] == a[j]: answer += 1 print( answer )

0.571707

N = int(input()) ab = [list(map(int, input().split())) for _ in range(N)] cd = [list(map(int, input().split())) for _ in range(N)] ab.sort() cd.sort() g = [[] for _ in range(N)] for i, pab in enumerate(ab): for j, pcd in enumerate(cd): if pab[0] < pcd[0] and pab[1] < pcd[1]: g[j].append([pab[1...

0.569431

N = int(input()) cnt = [0] * N for n in range(N - 1): u, v = list(map(int, input().split())) cnt[u - 1] += 1 cnt[v - 1] += 1 print(sum(x == 1 for x in cnt))

0.568743

from collections import defaultdict, deque class DSU: def __init__(self, n): self.parents = [i for i in range(n)] self.ranks = [0 for i in range(n)] def find_parent(self, v): if self.parents[v] == v: return v self.parents[v] = self.find_parent(self.parents[v]) ...

0.568249

from collections import defaultdict import sys sys.setrecursionlimit(10 ** 6) def main(): N = int(input()) V = 100005 to = defaultdict(list) for _ in range(N): X, Y = map(int, input().split()) Y += V to[X].append(Y) to[Y].append(X) visited = [0] * (2 * V) cnt ...

0.568019

import sys input = sys.stdin.readline n=int(input()) P=[list(map(int,input().split())) for i in range(n-1)] Group=[i for i in range(n+1)] def find(x): while Group[x] != x: x=Group[x] return x def Union(x,y): if find(x) != find(y): Group[find(y)]=Group[find(x)]=min(find(y),find(x)) ANS=[[...

0.566804

a=input().split() n=int(a[0]) m=int(a[1]) p = [] rnk = [] def init(s): nonlocal p nonlocal rnk for i in range(0,s): p.append(i) rnk = [1]*s def fs(v): nonlocal p if p[v]==v: return v ans = fs(p[v]) p[v]=ans return ans def us(a,b): nonlocal p nonlocal rnk ...

0.56678

def pairs(ar): count = 0 for i in range(0, len(ar), 2): try: a, b = ar[i], ar[i+1] except IndexError: return count if abs(a-b) == 1: count +=1 return count

0.566544

n = int(input()) A = list(map(int, input().split())) maxDist = [0] * n G = [[] for _ in range(n)] for v in range(1, n): u, d = tuple(map(int, input().split())) u -= 1 G[v].append((u, d)) G[u].append((v, d)) seen = [False] * n seen[0] = True q = [0] to_remove = [] while q: v = q.pop(); for...

0.565572

class Solution: def findLongestChain(self, pairs): """ :type pairs: List[List[int]] :rtype: int """ pairs = sorted(pairs,key=lambda x:x[1]) res = 1 first = pairs[0] for i in pairs[1:]: if first[-1] < i[0]: res += ...

0.565137

n = int(input()) d = n * [0] for i in range(n - 1): a, b = list(map(int, input().split())) d[a - 1] += 1 d[b - 1] += 1 cnt = 0 for i in d: cnt += (i * (i - 1)) // 2 print(cnt)

0.56231

n = int(input()) T = [int(x) for x in input().split()] C = [int(x) for x in input().split()] T_inv = [[] for _ in range(n)] for i in range(n - 1): T_inv[T[i] - 1] += [i + 1] result = 1 #for i in range(n): # print(T_inv[i]) for i in range(n): for child in T_inv[i]: if C[i] != C[child]: ...

0.562223

n = int(input()) bs = [] for _ in range(n): bs.append(list(map(int, input().split()))) ans = 0 for i in range(n): for j in range(n): if i != j and bs[i][0] == bs[j][1]: ans += 1 break print(n - ans)

0.561684

class Solution: def shortestAlternatingPaths(self, n: int, red_edges: List[List[int]], blue_edges: List[List[int]]) -> List[int]: G = [[[], []] for i in range(n)] for i, j in red_edges: G[i][0].append(j) for i, j in blue_edges: G[i][1].append(j) res = [[0, 0]] + [[n...

0.55713

def main(): n = int(input()) if n % 2 != 0: print(-1) return links = [[1, set()] for i in range(1, n+1)] W = 0 L = 1 i = 0 while i < n-1: i += 1 [a, b] = [int(x) for x in input().split()] links[a-1][L].add(b-1) links[b-1][L].add(a-1) count = 0 sear = 0 cur = 0 while sea...

0.55667

from sys import stdin n = int(stdin.readline()) g = dict() for i in range(n-1): u,v = map(int,stdin.readline().split()) g.setdefault(u-1,[]).append(v-1) g.setdefault(v-1, []).append(u-1) st = [0] rank = [0]*n tree = [0]*n msk = [0]*n rd = dict() while len(st)>0: top = st.pop() msk[top] = 1 for c...

0.555807

import sys from collections import deque sys.setrecursionlimit(20000000) input = sys.stdin.readline n = int(input()) a = list(map(int,input().split())) b = list(map(int,input().split())) g = [[] for i in range(n)] for i in range(n-1): g[b[i]-1].append(i+1) ha = 0 for i in range(n): if len(g[i]) == 0: ha...

0.554773

from sys import stdin,stdout input=stdin.readline n=int(input()) a=[[] for i in range(n)] for i in range(n-1): u,v=map(int,input().split()) a[u-1].append(v-1) a[v-1].append(u-1) b=[0]*n vis=[0]*n st=[(0,0)] vis[0]=1 pa=[0]*n while st: x,y=st.pop() b[x]=y for i in a[x]: i...

0.553693

import sys fin = sys.stdin n = int(fin.readline()) ut = [-1] * n vc = [[] for i in range(0, n)] cvc = [[] for i in range(0, n)] nr = [0] * n for i in range(0, n - 1): a, b = [int(number) for number in fin.readline().split()] a -= 1 b -= 1 vc[a].append(b) cvc[b].append(a) nr[a] += 1 size = [0] * ...

0.552623

import sys input = sys.stdin.readline import time from collections import deque def main(): t1 = time.time() n = int(input()) a = [[int(i) for i in input().split()] for j in range(n)] check = [0]*n used = [False]*n d = deque() for i in reversed(range(n)): if us...

0.549864

from collections import defaultdict n, flower, bee = list(map(int, input().split())) roads = {} for _ in range(n-1): x, y = list(map(int, input().split())) if x not in roads: roads[x] = [y] else: roads[x].append(y) if y not in roads: roads[y] = [x] else: roads[y].appe...

0.548662

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): #print(*args, **kwargs, file=sys.stderr) # in python 3.4 **kwarg...

0.547112

def connected_components(neighbors): seen = set() def component(node): nodes = set([node]) while nodes: node = nodes.pop() seen.add(node) nodes |= neighbors[node] - seen yield node for node in neighbors: if node not in seen: ...

0.546556

class Solution: def maxNumEdgesToRemove(self, n: int, edges: List[List[int]]) -> int: if len(edges) == 0: return 0 if n == 0 else -1 p = [i for i in range(n)] def getP(ind): nonlocal p if p[ind] == ind: return ind else: ...

0.545048

from bisect import bisect_left as bl from bisect import bisect_right as br from heapq import heappush,heappop,heapify import math from collections import * from functools import reduce,cmp_to_key import sys input = sys.stdin.readline M = mod = 998244353 def factors(n):return sorted(set(reduce(list.__add__, ([i, n//i] f...

0.544978

rd = lambda: list(map(int, input().split())) def root(x): if f[x]!=x: f[x] = root(f[x]) return f[x] n, m = rd() N = list(range(n)) f = list(N) lang = [0]*n for i in N: lang[i] = set(rd()[1:]) for i in N: for j in N[:i]: rj = root(j) if lang[rj].intersection(lang[i]): f[rj] = i lang[i] = lang...

0.544314

import sys import os import random import math #nonlocal defs n, m, p = list(map(int, input().split())) arr = [dict() for _ in range(n)] for _ in range(p): i,j = list(map(int,input().split())) i -= 1 j -= 1 if j not in arr[i]: arr[i][j] = j+1 else: arr[i][j] += 1 def chefbm(arr,i): for (e,f) in arr[i].items(...

0.543659

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline d={} n=int(input()) for _ in range(n): i,j=map(int,input().split()) d[i]=j m=int(input()) for _ in range(m): i,j=map(int,input().split()) if i in d and d[i]>j: continue d[i]=j ans=0 for i,j in d.items(): ans+=j print(ans)

0.543613

class Solution: def findCircleNum(self, M): N = len(M) students = set() for i in range(N): students.add(i) num_grp = 0 while students: num_grp += 1 stack = [students.pop()] while stack and students: ...

0.543186

class UnionFind: def __init__(self, n): self.par = [i for i in range(n + 1)] self.rank = [0] * (n + 1) self.size = [1] * (n + 1) def find(self, x): if self.par[x] == x: return x else: self.par[x] = self.find(self.par[x]) return self.pa...

0.540472

from collections import defaultdict N, M = list(map(int, input().split())) d = defaultdict(list) for _ in range(M): a, b = list(map(int, input().split())) d[a].append(b) d[b].append(a) def dfs(n, path): count = 0 path.append(n) if len(path) == N: count += 1 return count fo...

0.539989

from sys import stdin from decimal import Decimal as D input = stdin.readline n = int(input()) adj = [[] for i in range(n+1)] tree = [[] for i in range(n+1)] visit = [-1]*(n+1) length = [-1]*(n+1) for i in range(n-1): a, b = map(int,input().split()) adj[a].append(b) adj[b].append(a) bfsord = [] from collec...

0.539456

n, m = map(int, input().split()) d = [0 for i in range(7)] g = [[] for i in range(7)] for i in range(m): x, y = map(int, input().split()) x -= 1 y -= 1 d[x] += 1 d[y] += 1 g[x].append(y) g[y].append(x) mn = min(d) for i in range(7): for j in range(i): cnt = 0 for k in range(7): if((k in g[i]) and (...

0.53848

from heapq import heappush, heappop queue = [] degree = [] s = [] ans = [] n = int(input()) used = [False for i in range(n)] for i in range(n): a, b = list(map(int, input().split())) degree.append(a) s.append(b) heappush(queue, (a, i)) while queue: el = heappop(queue) vert = el[1] if used[ve...

0.538207

import sys,math,collections,itertools input = sys.stdin.readline class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * n def find(self, x): if self.parents[x] < 0: return x else: self.parents[x] = self.find(self.parents[x]) ...

0.537608

import sys input = sys.stdin.readline n = int(input()) adj = [[] for i in range(n)] for _ in range(n - 1): u, v = list(map(int, input().split())) adj[u-1].append(v-1) adj[v-1].append(u-1) depth = [-1] * n depth[0] = 0 odd = 0 even = 1 q = [0] while q: nex = q.pop() for v in adj[nex]: ...

0.537344

import sys readline = sys.stdin.readline N, M = map(int, readline().split()) Edge = [[] for _ in range(N)] for _ in range(M): a, b = map(int, readline().split()) a -= 1 b -= 1 Edge[a].append(b) Edge[b].append(a) used = set() ans = 0 mp = -1 for i in range(N): if i in used: continue ...

0.537066

import sys from collections import deque def diameter(n, links): q = deque([(0, -1)]) v = 0 while q: v, p = q.popleft() q.extend((u, v) for u in links[v] if u != p) q = deque([(v, -1)]) w = 0 parents = [-1] * n while q: w, p = q.popleft() parents[w] = p ...

0.536015

3 def solve(N, A): cnt = [0] * (N + 1) evd = {} xs = [] for a, b in A: if a not in evd: evd[a] = [0, 0] xs.append(a) if b not in evd: evd[b] = [0, 0] xs.append(b) evd[a][0] += 1 evd[b][1] += 1 xs.sort() px = xs[...

0.535893

n = int(input()) edges = [[] for i in range(n)] for i in range(n-1): u, v = map(int, input().split()) edges[u-1].append(v-1) edges[v-1].append(u-1) colors = [-1 for i in range(n)] dfs = [(0,0)] while len(dfs) > 0: node, color = dfs.pop() colors[node] = color for neighbor in edges[node]: ...

0.535483

from sys import stdin from math import ceil, gcd # Input data #stdin = open("input", "r") def dfs(src, visit): visit[src] = 1 for nbr in d[src]: if visit[nbr] == 0: dfs(nbr, visit) for _ in range(int(stdin.readline())): n, m = list(map(int, stdin.readline().split())) ...

0.534926

from collections import defaultdict n=int(input()) d=defaultdict(dict) for i in range(n): x=input() x=x.split() if i==0: P = x q=int(input()) Con=[] for j in range(q): Con.append(input().split()) if i!=n-1: input() d[x[0]][x[1]]=Con ver=[P] ans={} while ver: ...

0.534617

# cook your dish here import numpy as np tests = int(input()) for _ in range(tests): n = int(input()) weights = [int(j) for j in input().split()] edges = [[0] for _ in range(n-1)] for i in range(n-1): edges[i] = [int(j)-1 for j in input().split()] vertex_set = [[] for _ in range(n)] for i in ran...

0.534554

import sys input = sys.stdin.readline from collections import deque def read(): N = int(input().strip()) P = list(map(int, input().strip().split())) return N, P def solve(N, P): ans = 0 p = deque(P) q = deque() q.append(p.popleft()) for i in range(1, N): if i == q[-1]: ...

0.533475

class UnionFind: def __init__(self, N): self.par = [i for i in range(N)] self.rank = [1 for i in range(N)] self.rank[0] = 0 def union(self, x, y): if not self.is_same_set(x, y): par_x = self.find_par(x) par_y = self.find_par(y) if self.rank[pa...

0.532698

#!/usr/bin/env python3 # -*- coding: utf-8 -*- # AUTHOR: haya14busa import sys import io from collections import defaultdict from itertools import combinations def solve(n, m, pairs): # return: minimum possible sum of their recognitions assert 3 <= n <= 4000 # number of warioor assert 0 <= m <= 4000 # ...

0.52819

def main(): n, m = list(map(int, input().split())) n += 1 cluster, dest, ab = list(range(n)), [0] * n, [[] for _ in range(n)] def root(x): if x != cluster[x]: cluster[x] = x = root(cluster[x]) return x for _ in range(m): a, b = list(map(int, input().split())) ...

0.527975

def codn1(s1,s2,p): c=0 ind=0 for i in range(len(s1)): if s1[i]!=s2[i]: c+=1 ind=i if c>1 or ind==len(s1)-1: return 0 if s1[ind]>s2[ind] and s1[ind] in s2[ind+1:]: p[0]=True if s1[ind]<s2[ind] and s2[ind] in s1[ind+1:]: p[1]=True return 1 def codn2(s1,s2): if len(s1)<len(s2): ...

0.527879

class Solution: def numEquivDominoPairs(self, dominoes: List[List[int]]) -> int: set1={} sum1=0 for i in dominoes: ri=list(reversed(i)) i=tuple(i) ri=tuple(ri) if i in set1.keys(): sum1+=set1[i] set1[i]...

0.527371

import sys def solve(): n = int(input()) partner = [0]*(2*n) pacani = [] for line in sys.stdin: pacan, telka = [int(x) - 1 for x in line.split()] partner[pacan] = telka partner[telka] = pacan pacani.append(pacan) khavka = [None]*(2*n) for i in range(2*n): ...

0.527006

from collections import deque class Solution: def minMalwareSpread(self, graph: List[List[int]], initial: List[int]) -> int: def bfs(graph, seed, removed): queue = deque(seed) visited = seed while len(queue) > 0: node = queue.popleft...

0.525781

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time sys.setrecursionlimit(10**7) inf = 10**20 mod = 10**9 + 7 def LI(): return list(map(int, input().split())) def II(): return int(input()) def LS(): return input().split() def S(): return input() def main(): n = II() d = ...

0.525756

n=int(input()) ki=[[] for _ in range(n)] ans=0 for i in range(1,n+1): ans+=i*(n-i+1) for _ in range(n-1): u,v=map(int,input().split()) if u>v:u,v=v,u ans-=u*(n-v+1) print(ans)

0.525647

n, m = list(map(int, input().split())) line = list(map(int, input().split())) pairs = set() for i in range(m): a, b = list(map(int, input().split())) pairs.add((a,b)) req = [line.pop()] out = 0 while line != []: nex = line.pop() works = True for pers in req: if not (nex, pers) in pairs: ...

0.525003

n = int(input()) h = [False] * n v = [False] * n result = [ ] for i in range(n * n): a, b = list(map(int, input().split())) a -= 1 b -= 1 if not h[a] and not v[b]: h[a] = v[b] = True result.append(i + 1) print(' '.join(map(str, result)))

0.524684

""" #this code is a precomputation part. #it takes about 2 hours. class Graph: def __init__(self,n): self.edge=[[0 for j in xrange(n)] for i in xrange(n)] self.n=n def addedge(self,i,j,m=1): assert i!=j and 0<=i<self.n and 0<=j<self.n self.edge[i][j]+=m self.edge[j][i]+=m def deledge(self,i...

0.52348

def check_relative(i,j): if is_relative[i]:return if len(land[i].intersection(land[j]))>=k: is_relative[i]=True for ii in range(n): check_relative(ii,i) n,k=map(int,input().split()) land=[] is_relative=[True]+[False]*(n-1) for i in range(n): p,*q=input().split() land.append(...

0.521205

maxn=50+10 g=[None]*maxn dp=[None]*maxn c=[None]*maxn size=[0]*maxn for i in range(0,maxn): c[i]=[0]*maxn c[i][0]=1 for j in range(1,i+1): c[i][j]=c[i-1][j-1]+c[i-1][j] n=int(input()) for i in range(1,n+1): g[i]=[] for i in range(1,n): u,v=input().split() u=int(u) v=int(v) g[u]...

0.521194

import sys def dfs(tree, root, priv_root, cur_lvl, priv_lvl, diff, pick_list): if not tree: return stack = [(root, priv_root, cur_lvl, priv_lvl)] while stack: (root, priv_root, cur_lvl, priv_lvl) = stack.pop() if cur_lvl ^ diff[root]: cur_lvl ^= 1 pick_list.a...

0.521056

n, p = int(input()), list(map(int, input().split())) a, c, v = [0] * n, 1, 1 for i, pi in enumerate(p): a[pi - 1] = i for i in range(n - 1): if a[i] < a[i + 1]: c += 1 if c > v: v = c else: c = 1 print(n - v)

0.520768

from collections import deque n,m = [int(x) for x in input().split()] adj = [[] for x in range(n+1)] for _ in range(1,n): a,b = [int(x) for x in input().split()] adj[a].append(b) adj[b].append(a) chaos = [int(x) for x in input().split()] s = chaos[0] chaos = set(chaos) cc = [0]*(n+1) st = deque() st.append((s,-1)) w...

0.52075

from sys import stdin input = stdin.readline q = int(input()) for rwerew in range(q): n = int(input()) p = list(map(int,input().split())) c = list(map(int,input().split())) for i in range(n): p[i] -= 1 przyn = [0] * n grupa = [] i = 0 while i < n: if przyn[i] == 1: i += 1 else: nowa_grupa = [i] j...

0.52047

from collections import deque from sys import stdin n, x = map(int, stdin.readline().split()) leafs = set(range(n)) graph = [[] for i in range(n)] count = [False for i in range(n)] for i in range(n - 1): a, b = map(int, stdin.readline().split()) graph[a - 1].append(b - 1) graph[b - 1].append(a - 1) if ...

0.520434

def main(): from sys import stdin n, m = list(map(int, input().split())) n += 1 aa, pos, duo = [0] * n, [0] * n, [0] * n for i, a in enumerate(map(int, input().split()), 1): aa[i] = a pos[a] = i for s in stdin.read().splitlines(): x, y = list(map(int, s.split())) ...

0.519665

import collections N, M, K = map(int, input().split()) friend = [[] for i in range(N)] block = [[] for i in range(N)] graph = [-1] * N for i in range(M): a, b = map(int, input().split()) friend[a-1].append(b-1) friend[b-1].append(a-1) for i in range(K): c, d = map(int, input().split()) block[c-1].append(d-...

0.518453

n, m = (int(x) for x in input().strip().split()) coproc = [int(x) for x in input().strip().split()] edges = [] for _ in range(m): edges.append((int(x) for x in input().strip().split())) inorder = [0] * n adj = [[] for _ in range(n)] for u, v in edges: adj[v].append(u) inorder[u] += 1 queue0 = [u for u in r...

0.517873

class Solution: def numIdenticalPairs(self, nums: List[int]) -> int: my_count = 0 my_dict = {} for n in nums: my_count += my_dict.get(n,0) my_dict[n] = my_dict.get(n,0) +1 return my_count

0.517534

import collections class Graph: def __init__(self, n, dir): self.node_cnt = n self.__directed = dir self.__adjList = [] for i in range(n): self.__adjList.append([]) def addEdge(self, u, v): self.__adjList[u].append(v) if not self.__directed: self.__adjList[v].append(u) def getDistances(self, start, e...

0.517098

def coloring(i, ancestors, color): while i != 0 and color[ancestors[i - 1]] is None: color[ancestors[i - 1]] = not color[i] i = ancestors[i - 1] def main(): n = int(input()) a = list(map(int, input().split())) ancestors = list([int(x) - 1 for x in input().split()]) descendants = [[...

0.515223

import sys sys.setrecursionlimit(10**6) ans = 0 def solve(): n = int(input()) Adj = [[] for i in range(n)] for i in range(n - 1): ai, bi, ci = map(int, sys.stdin.readline().split()) Adj[ai].append((bi, ci)) Adj[bi].append((ai, ci)) dfs(n, Adj, -1, 0, 0) print(ans) def ...

0.515031

n = int(input()) A = list(map(int, input().split())) cnt = 0 for i in range(n): cnt += (A[i] == i) if cnt == n: print(n) else: ind = False for i in range(n): ind |= (A[i] != i and A[A[i]] == i) if ind: print(cnt + 2) else: print(cnt + 1)

0.514929

# cook your dish here from collections import defaultdict d=defaultdict(list) def dfs(i): p=0 nonlocal v e=[i] while(e!=[]): p+=1 x=e.pop(0) v[x]=1 for i in d[x]: if v[i]==-1: v[i]=1 e.append(i) return p n,...

0.514522

def sol(): n = int(input()) st = list(map(int, input().split(' '))) d = {} for x in range(n): d[x] = [] st = [(st[i], i) for i in range(len(st))] st = sorted(st) for a0 in range(n - 1): u, v = map(int, input().split(' ')) u, v = u - 1, v - 1 d[u].append(v) ...

0.513193

inp = input().split(' ') val=[]; totNums = int(inp[0]); totOpt = int(inp[1]); inp = input().split(' '); #assert(len(inp) == totNums); for it in inp: val.append(int(it)) dp = [[0.0 for _ in range(0,totNums)] for __ in range(0,totNums)] for i in range(0,totNums): for j in range(0,totNums): if val[i]>val[j]:...

0.512882

""" #If FastIO not needed, used this and don't forget to strip #import sys, math #input = sys.stdin.readline """ import os import sys from io import BytesIO, IOBase import heapq as h from bisect import bisect_left, bisect_right from types import GeneratorType BUFSIZE = 8192 class FastIO(IOBase): newlines = 0 ...

0.511548

def met(x,y): if x*y>0:return 0 if (x+y)%2==0:return 1 return 2 def main0(n,a0,a1): ret=[0]*3 mat=[[0]*n for _ in range(n)] for i in range(1,n): mat[0][i]=a0[i] mat[i][0]=a1[i-1] ret[a1[i-1]]+=1 ret[a0[i]]+=1 mat[0][0]=a0[0] ret[a0[0]]+=1 for j in range(1,n): for i in range(1,n): ...

0.510657

N = int(input()) X = [i for i in range(N+1)] Y = [[] for _ in range(N)] B, W = [], [] ans = 0 for i in range(2 * N): c, a = input().split() a = int(a) - 1 if c == "B": X = [X[i] + 1 if i <= a else X[i] - 1 for i in range(N+1)] B.append(a) ans += len([b for b in B if b > a]) else:...

0.510647

#ABC147　C　やってる途中 n=int(input()) l=[] for i in range(n): a=int(input()) l_=[] for j in range(a): xy=list(map(int,input().split())) l_.append(xy) l.append(l_) ans=0 for i in range(2**n): table=[0]*n flag=False for j in range(n): if (i>>j)&1: table[j]=1 for j in range(n): for k in l[j...

0.510573

for _ in range(int(input())): n=int(input()) a=[] l=0 for i in range(n): a.append(list(map(int,input().split()))) for i in range(n-1,0,-1): r=a[i][i-1]+1 if a[i][i]!=r: l+=1 n=i+1 for j in range(n): for k in range(j,n): a[j][k],a[k][j]=a[k][j],a[j][k] print(l)

0.509373

from collections import defaultdict def dfs(s, t): visited = 0 q = [(s, 0)] while q: v, used = q.pop() if v == t: return used visited |= used for lb, u in graph[v]: if lb & visited: continue q.append((u, used | lb)) n = ...

0.50909

import sys n = int(input()) p = [int(i) for i in input().split()] b = [int(i) for i in input().split()] ans = 0 num_cycles = 0 checked = set() for i in range(n): if i in checked: continue checked.add(i) nxt = p[i] - 1 while nxt != i: checked.add(nxt) nxt = p[nxt] - 1 n...

0.509001

import sys input=sys.stdin.readline n,m=list(map(int,input().split())) a=[int(x) for x in input().split()] s=[set() for i in range(m+1)] for i in range(n): s[a[i]].add(i+1) f=[0]*(m+2) for i in range(m+1): f[i]=i def fin(x): if f[x]==x: return x f[x]=fin(f[x]) return f[x] ans=0 for i in ...

0.508372

from sys import stdout n = int(input()) class Person: num = n - 1 def __init__(self, rel): self.relationship = int(rel, 2) def __getitem__(self, k): return (self.relationship >> Person.num - k) & 1 rel = [Person(input()) for _ in range(n)] dp = [[0] * n for _ in range(1 << n)] for ...

0.508187

#Bhargey Mehta (Sophomore) #DA-IICT, Gandhinagar import sys, math, queue #sys.stdin = open("input.txt", "r") MOD = 10**9+7 n = int(input()) p = [] for i in range(n): x, y = map(int, input().split()) p.append((x, y)) d = {} for i in range(n): x1, y1 = p[i] for j in range(i+1, n): x2, y2 = p[j]...

0.507722

def read_data(): n, m = list(map(int, input().split())) Es = [[] for v in range(n)] for e in range(m): a, b = list(map(int, input().split())) a -= 1 b -= 1 Es[a].append(b) Es[b].append(a) return n, m, Es def solve(n, m, Es): if m == 0: return 3, n * (...

0.50747

class Solution: def sumOfDistancesInTree(self, N: int, edges: List[List[int]]) -> List[int]: tree = [[] for _ in range(N)] for i, j in edges: tree[i].append(j) tree[j].append(i) cnt = [1] * N res = [0] * N def post_order(node, parent)...

0.50746

Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays. Example 1: Input: A: [1,2,3,2,1] B: [3,2,1,4,7] Output: 3 Explanation: The repeated subarray with maximum length is [3, 2, 1]. Note: 1 0

class Solution: def findLength(self, A, B): def check(length): seen = {A[i:i+length] for i in range(len(A) - length + 1)} return any(B[j:j+length] in seen for j in range(len(B) - length + 1)) A = ''.join(map(chr, A)) ...

0.730227

class Solution: def maxUncrossedLines(self, A, B): # Optimization #commons = set(A).intersection(set(B)) # or commons = set(A) & set(B) #A = [x for x in A if x in commons] #B = [x for x in B if x in commons] N1, N2 = len(A), len(B) dp = [[0 for _ in range(N2+1)] for ...

0.723432

class Solution: def longestCommonSubsequence(self, a: str, b: str) -> int: last, current = [0] * (len(b) + 1), [0] * (len(b) + 1) for i in range(len(a) - 1, -1, -1): for j in range(len(b) - 1, -1, -1): if a[i] == b[j]: current[j] = 1 + last[j ...

0.721173

class Solution: def largestOverlap(self, A, B) -> int: leng = len(A[0]) # convert A, B to binary a = 0 b = 0 for i in range(0, leng * leng): row = int(i % leng) col = int(i / leng) a = (a << 1) + A[col][row] b = (b << 1) + B[co...

0.658688

class Solution: def findLUSlength(self, a, b): """ :type a: str :type b: str :rtype: int """ return max(len(a),len(b)) if a != b else -1

0.637734

def prefix1(a, b): cnt = 0 for i, j in zip(a, b): if i == j: cnt += 1 else: return cnt return cnt def prefix2(a, b, num): for i in range(num, -1, -1): if b.startswith(a[:i]): return i def zfunc(str_): z = [] k = len(str_) for i ...

0.632541

def solve(a, b): if len(a) is 1: return b.count(a) index = [x for x in range(len(b)-1) if b[x] is a[0]] return sum(solve(a[1:], b[x+1:]) for x in index)

0.623991

class Solution: def kSimilarity(self, A: str, B: str) -> int: a = '' b = '' for i in range(len(A)): if A[i] != B[i]: a+=A[i] b+=B[i] return self.dfs(a,b) def dfs(self,a,b): if not a: ...

0.605055

def shift_left(a, b): r = len(a) + len(b) for i in range(-1, -min(len(a), len(b)) - 1, -1): if a[i] != b[i]: break r -= 2 return r

0.601391

from collections import defaultdict as dd def find(a, b): n = len(a) m = len(b) dp = [[0]*(m+1) for i in range(n+1)] for i in range(n-1,-1, -1): for j in range(m-1, -1, -1): if a[i] == b[j]: dp[i][j] = dp[i+1][j+1] + 1 mx = dd(int) ans = 0 for i in range(n-1, -1, -1): for j in range(m-1, -1, -1): ...

0.60019

def levenshtein(a,b): d = [[0] * (len(b) + 1) for _ in range(len(a) + 1)] d[0][:] = list(range(len(b)+1)) for i in range(1, len(a) + 1): d[i][0] = i for i, x in enumerate(a): for j, y in enumerate(b): d[i+1][j+1] = min(1 + d[i][j+1], 1 + d[i+1][j], d[i][j] + (1 if x != y el...

0.59932

from collections import Counter def solve(a,b): return 0 if Counter(b) - Counter(a) else len(a) - len(b)

0.594895

class Solution: def getMaxRepetitions(self, s1, n1, s2, n2): """ :type s1: str :type n1: int :type s2: str :type n2: int :rtype: int """ if s2=='aac' and n2==100: return 29999 i,j=0,0 l1=len(s1) l2=len(s...

0.594635

def combs(a, b): return min(mesh(a, b), mesh(b, a)) def mesh(a, b): for i in range(len(a)): for j, k in zip(a[i:], b): if j + k == '**': break else: return max(i + len(b), len(a)) return len(a) + len(b)

0.594397

def longest(a1, a2): return "".join(sorted(set(a1 + a2)))

0.592272

for _ in range(eval(input())): S1=input() m1=len(S1)/2 S2=input() m2=len(S2)/2 d1={} d2={} for i in range(len(S1)): c=S1[i] v=abs(m1-i) if c in d1: if v<d1[c][0]: d1[c]=[v,i] else: d1[c]=[v,i] for i in range(len(S2)...

0.592184

class Solution: def repeatedStringMatch(self, A, B): """ :type A: str :type B: str :rtype: int """ if not set(B).issubset(set(A)): return -1 max_rep = len(B) // len(A) + 3 A_new = A for i in ...

0.590088

def maxlen(s1, s2): sm, lg = sorted((s1, s2)) return min(max(lg / 3, sm), lg / 2)

0.580683

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools sys.setrecursionlimit(10**7) inf = 10**20 eps = 1.0 / 10**10 mod = 10**9+7 dd = [(-1,0),(0,1),(1,0),(0,-1)] ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)] def LI(): return list(map(int, sys.stdin.readline().spli...

0.57803

def max_and_min(arr1,arr2): diffs = [abs(x-y) for x in arr1 for y in arr2] return [max(diffs), min(diffs)]

0.577339

from collections import Counter def solve(A,B): a = Counter(A) b = Counter(B) ans = 0 for i in a: if i in b: ans += min(a[i],b[i]) return ans t = int(input()) for _ in range(t): A = input() B = input() print(solve(A,B))

0.576352

from bisect import bisect HISENTINEL = 10**9 + 1 LOSENTINEL = -HISENTINEL def main(): length = int(input()) a = [int(fld) for fld in input().strip().split()] b = [int(fld) for fld in input().strip().split()] print(countmaxminsubseq(a, b)) def countmaxminsubseq(a, b): leq, lgt = getleftbounds(...

0.57487

n = int(input()) for i in range(n): count = 0 k = input() x = list(k) kk = input() y = list(kk) for j in y: for jj in x: if(j==jj): count = count+1 break print(count)

0.571203

def lcs(x, y): if len(x) == 0 or len(y) == 0: return '' if x[-1] == y[-1]: return lcs(x[:-1], y[:-1]) + x[-1] else: lcs1 = lcs(x,y[:-1]) lcs2 = lcs(x[:-1],y) if len(lcs1) > len(lcs2): return lcs1 else: return lcs2

0.569086

class Solution: def intersectionSizeTwo(self, intervals): """ :type intervals: List[List[int]] :rtype: int """ intervals.sort(key=lambda x: x[1]) if len(intervals) <= 1: return len(intervals[0]) s = set() prev_e = None in...

0.568621

from collections import Counter class Solution: def longestArithSeqLength(self, A: List[int]) -> int: c = dict(Counter(A).most_common()) # print(c) m1 = max(c.values()) # A = list(set(A)) # A.sort() index = {} # for i in range(len(A)): # index[A[i]...

0.56459

class Solution: def minSwap(self, A: List[int], B: List[int]) -> int: n = len(A) if n == 1: return 0 dp = [[float('inf'), float('inf')] for _ in range(n)] dp[0] = [0,1] #[natural, swapped] for i in range(1, n): if A[...

0.562764

class Solution: def flipgame(self, fronts: List[int], backs: List[int]) -> int: w = set(fronts[i] for i in range(len(fronts)) if fronts[i] == backs[i]) x = set() for a in fronts: if a not in w: x.add(a) for a in backs: if a not in w: ...

0.559831

class Solution: def findLUSlength(self, strs): """ :type strs: List[str] :rtype: int """ def isSubseq(s1, s2): i, m=0, len(s1) for c in s2: if i==m: return True if s1[i]==c: i+=1 return i==m ...

0.557665

import re def buy_newspaper(s1, s2): p = re.sub(r"(.)", r"\1?", s1) return -1 if set(s2) - set(s1) else len(re.findall(p, s2)) - 1

0.55686

# Enter your code here. Read input from STDIN. Print output to STDOUT s=input() ss=input() cnt=0 len_s=len(s) len_ss=len(ss) for i in range(0,len_s): tmp=s[i:i+len_ss] if(tmp==ss): cnt=cnt+1 print(cnt)

0.554337

def folding(a,b): squares = 1 while a != b: squares += 1 b, a = sorted((a - b, b)) return squares

0.551511

import bisect from functools import lru_cache class Solution: def makeArrayIncreasing(self, A: List[int], B: List[int]) -> int: B = sorted(set(B)) @lru_cache(None) def find_larger_value_in_B(val): if val >= B[-1]: return float('inf') return B[bisect...

0.549196

def solve(a,b): return [a.count(e) for e in b]

0.547211

class Solution: def findLongestChain(self, pairs): """ :type pairs: List[List[int]] :rtype: int """ pairs = sorted(pairs,key=lambda x:x[1]) res = 1 first = pairs[0] for i in pairs[1:]: if first[-1] < i[0]: res += ...

0.547047

class Solution: def gcdOfStrings(self, str1: str, str2: str) -> str: contender = '' for i in str1: contender += i if str1.count(contender) * len(contender) == len(str1) and str2.count(contender) * len(contender) == len(str2): break orig = contender ...

0.545687

class Solution: def minDeletionSize(self, A: List[str]) -> int: dp = [(1, 1)] * len(A[0]) for i in range(len(dp)): if i > 0: max_pre = None for pre in range(i - 1, -1, -1): for word in A: if word[pre] > word[i]: ...

0.545194

class Solution: def findShortestSubArray(self, nums): diction = {} for i in nums: if i not in diction: diction[i] = 1 else: diction[i] += 1 degree = max(list(diction.values())) ...

0.539325

class Solution: def findLHS(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums) ret = 0 for i in count: if i+1 in count: ret = max(ret, count[i]+count[i+1]) return ret...

0.535004

# AC import sys sys.setrecursionlimit(1000000) class Main: def __init__(self): self.buff = None self.index = 0 def __next__(self): if self.buff is None or self.index == len(self.buff): self.buff = self.next_line() self.index = 0 val = self.buff[self.ind...

0.533107

class Solution: def isvalid(self,C): if len(C)>2: return False if len(C)==1: a = min(C) if a==1 or C[a]==1: # EXPLANATION: # a==1 : All lengths are unitary like A=[1,2,3,4,...], so poping anything is fine # C[a...

0.530436

def main(): a = str(input()) b = str(input()) print(a.count(b)) def __starting_point(): main() __starting_point()

0.528089

def consecutive(arr): return max(arr) - min(arr) + 1 - len(arr) if arr else 0

0.526894

from collections import defaultdict def fix_progression(arr): res = 0 for i in range(len(arr)): D = defaultdict(int) for j in range(i): q, r = divmod(arr[i]-arr[j], i-j) if not r: D[q] += 1 res = max(res, D[q]) return len(arr)-res-1

0.52603

class Solution: def maxLength(self, arr: List[str]) -> int: def digit_representation(s): ans = 0 for c in s: ans |= 1<<(ord(c)-ord('a')) return ans A = sorted([(len(s), digit_representation(s)) for s in set(arr) if len(set(s))==len(s)], re...

0.523944

class Solution: def partitionDisjoint(self, A: List[int]) -> int: biggest = A[0] newbiggest = A[0] lenL = 1 total = 1 for itr in A[1:]: total += 1 if itr < biggest: lenL = total biggest = newbiggest else: ...

0.523558

class Solution: def lengthOfLongestSubstring(self, s): """ :type s: str :rtype: int """ L, res, last = -1, 0, {} for R, char in enumerate(s): if char in last and last[char] > L: L = last[char] elif R-L > res: ...

0.523124

from itertools import combinations def strings_crossover(arr, result): return sum(1 for s1,s2 in combinations(arr,2) if all(r in (x,y) for x,y,r in zip(s1,s2,result)))

0.519512

#scott http://codeforces.com/problemset/problem/265/A new problem RO = input() # darn i don't know how to read string ins = input() #scott n = 0 for x in range (len(ins)): #scott yeah that looks fine #print (x) if ins[x] == RO[n]: n += 1 #scott print(n+1)

0.519158

n=int(input()) l1=list(map(int,input().split())) l2=list(map(int,input().split())) fined=0 i=0 j=0 d1={} while i<n and j<n: if l1[i] in d1: i+=1 continue if l1[i]==l2[j]: i+=1 j+=1 else : while j<n and l2[j]!=l1[i]: d1[l2[j]]=1 j+=1 ...

0.517691

class Solution: def getHint(self, secret, guess): """ :type secret: str :type guess: str :rtype: str """ s_count = collections.defaultdict(int) g_count = collections.defaultdict(int) bull_cnt = 0 # first iteration can get bull_cnt imm...

0.516498

from collections import Counter n = int(input()) a = [int(x) for x in input().split()] b = [int(x) for x in input().split()] aidx = [-1]*n bidx = [-1]*n for i, (ai, bi) in enumerate(zip(a, b)): aidx[ai-1] = i bidx[bi-1] = i diffs = [(aidx[i] - bidx[i]) % n for i in range(n)] print(max(Counter(diffs).values(...

0.514854

def find_dup(arr): return sum(arr) - len(arr)*(len(arr)-1)/2 #your code here

0.514071

class Solution: def numDistinct(self, s, t): """ :type s: str :type t: str :rtype: int """ setOft=set(t) news="" for ch in s: if ch in setOft: news+=ch dp=[[1 for i in range(len(news)+1)] for j in range(l...

0.51378

n = int(input()) a = list(input()) b = list(input()) a = [int(i) for i in a] b = [int(i) for i in b] a.sort() b.sort() c = a[::] d = b[::] ans1 = 0 ans2 = 0 for i in a: for j in range(len(b)): if b[j] > i: del b[j] ans2 += 1 break for i in c: for j in range(len(d)): ...

0.513578

t1 = map(int,input().strip()) t2 = map(int,input().strip()) ar1 = [0] * 10 ar2 = [0]*10 for j in t1: ar1[j]+=1 for j in t2: ar2[j]+=1 ar1[2]+=ar1[5] ar1[6]+=ar1[9] ar1[5]=ar1[9]=0 ar2[2]+=ar2[5] ar2[6]+=ar2[9] ar2[5]=ar2[9]=0 print(int(min(map(lambda x:ar2[x]/ar1[x] if ar1[x]!=0 else 100500 ,range(10)))))

0.513047

def string_constructing(a, s): if len(s) == 0: return 0 i = -1 for j, c in enumerate(s): i = a.find(c, i+1) if i < 0 or i == len(a) - 1: break return len(a) - j + (i < 0) + string_constructing(a, s[j + (i >= 0):])

0.513039

def vector_affinity(a, b): longer = len(a) if len(a) > len(b) else len(b) return len([i for i, j in zip(a, b) if i == j]) / float(longer) if longer > 0 else 1.0

0.510362

def find_dup(arr): return sum(arr) - sum(range(1, max(arr)+1))

0.508558

from operator import mul from functools import reduce def solve(arr): return reduce(mul, map(len, map(set, arr)), 1)

0.507417

def solve(arr): p, q = 1, 1 for k in arr: x, y = max(k), min(k) a = p * x b = q * x c = p * y d = q * y p = max(a, b, c, d) q = min(a, b, c, d) return max(p, q)

0.50621

def similarity(a, b): try: return len(set(a) & set(b)) / len(set(a) | set(b)) except: return 0

0.505685

from collections import Counter def create_anagram(s, t): return sum((Counter(s) - Counter(t)).values())

0.504442

import sys def dp(s1, s2, i, j, mem): if (i, j) in mem: return mem[(i, j)] elif i >= len(s1) and j >= len(s2): res = '' elif i >= len(s1): res = s2[j:] elif j >= len(s2): res = s1[i:] else: if s1[i] == s2[j]: res = s1[i] + dp(s1, s2, i+1, j+1, mem...

0.504409

from collections import Counter MV = 400020 a = [0] * MV for i in range(MV): a[i] = set() n ,m = list(map(int , input().split())) first = list(map(int , input().split())) second = list(map(int , input().split())) for fid, f in enumerate(first): for sid, s in enumerate(second): a[f+s].add(fid + MV) ...

0.504173

def check_exam(arr1, arr2): return max(0, sum(4 if a == b else -1 for a, b in zip(arr1, arr2) if b))

0.50397

class Solution: def lenLongestFibSubseq(self, A: List[int]) -> int: def getFS(x1, x2): F = [x1, x2] while F[-1] <= 1000000000: F.append(F[-2] + F[-1]) return F C1 = getFS(1, 0) C2 = C1[1:] def getLLFS(x1, x2): ...

0.503871

def merge_arrays(a, b): out = [] for n in a+b: if n in a and n in b: if a.count(n) == b.count(n): out.append(n) else: out.append(n) return sorted(set(out))

0.503332

t = int(input()) for j in range(0, t): n = int(input()) m = 100 for i in range(0, n): str = input() p = min(str.count("a",0,len(str)),str.count("b",0,len(str))) if (m > p): m = p print(m) t = t-1

0.501958

""" Codeforces Contest 281 Div 2 Problem C Author : chaotic_iak Language: Python 3.3.4 """ def main(): n, = read() a = read() res = [(i,0) for i in a] m, = read() b = read() res.extend((i,1) for i in b) res.sort() mxa = 3*n mnb = 3*m cra = 3*n crb = 3*m for _,i in res:...

0.501518

""" Codeforces Round 251 Div 2 Problem D Author : chaotic_iak Language: Python 3.3.4 """ def read(mode=2): # 0: String # 1: List of strings # 2: List of integers inputs = input().strip() if mode == 0: return inputs if mode == 1: return inputs.split() if mode == 2: ...

0.501153

for t in range(int(input())): s = input() r = input() diff = list() index = list() cnt = 0 for i in range(len(s)): if s[i] != r[i]: cnt += 1 index.append(i) for i in range(1, len(index)): diff.append(index[i] - index[i - 1] - 1) diff.sort() fmin = cnt ** 2 oper = cnt ; moves = cnt for i in diff: ...

0.500688

class Solution: def getMax(self, arr, m, n): res = 0 for e in arr: if m >= e[0] and n >= e[1]: res += 1 m -= e[0] n -= e[1] return res def findMaxForm(self, strs, m, n): """ :type strs: List[str]...

0.499954

# cook your dish here try: a,b,da=list(input()),input(),list(map(int,input().split())) print(len(a)-len(b)) except: pass

0.499295

from collections import defaultdict def repeat_sum(l): count = defaultdict(int) for l1 in l: for val in set(l1): count[val] += 1 return sum(k for k,v in list(count.items()) if v > 1)

0.498538

from numpy import prod def find_difference(a, b): return abs(prod(a) - prod(b))

0.498177

from fractions import gcd def binary_gcd(x, y): return bin(gcd(x, y)).count('1')

0.498

class Solution: def findLengthOfLCIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) < 1: return 0 cur_len = 1 max_len = 1 for i in range(1,len(nums)): if nums[i] > nums[i-1]: cur_...

0.497956

def count_subsequences(needle, haystack): count = [1] + [0] * len(needle) for a in haystack: count = [1] + [count[i] + count[i-1] * (a == b) for i, b in enumerate(needle, 1)] return count[-1] % 10 ** 8

0.497265

from collections import * import itertools import sys def main(): a, b = input().split() ans = a + b n = len(a) m = len(b) for i in range(1, n + 1): for j in range(1, m + 1): c = a[:i] + b[:j] # print(c) ans = min(ans, c) print(ans) main()

0.49627

def length_of_sequence(arr, n): if arr.count(n) != 2: return 0 a = arr.index(n) b = arr.index(n, a + 1) return b - a + 1

0.494658

n=int(input()) a=sorted(map(int,input().split())) m=int(input()) b=sorted(map(int,input().split())) c=0 for i in range(n): for j in range(m): if abs(a[i]-b[j]) <= 1: b[j]=-10 c+=1 break print(c)

0.494653

def find_longest(xs): return max(xs, key=lambda x: len(str(x)))

0.49461

def min_dot(a, b): return sum(x * y for (x, y) in zip(sorted(a), sorted(b, reverse = True)))

0.494218

def ii(): return int(input()) def mi(): return list(map(int, input().split())) def li(): return list(mi()) # B. The Fair Nut and Strings n, k = mi() s = input().strip() t = input().strip() ans = 0 jj = 0 for i in range(n): if s[i] == t[i]: ans += 1 jj = i + 1 else: break c...

0.493622

import sys input = sys.stdin.readline s = input() t = input() l, r = [0]*len(t), [0]*len(t) li, ri = 0, len(s) - 1 for i in range(len(t)): while s[ li ] != t[ i ]: li += 1 while s[ ri ] != t[ - i - 1 ]: ri -= 1 l[ i ] = li r[ -i -1 ] = ri li += 1 ri -= 1 print( max( [ r[ 0 ], le...

0.493417

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.493365

import sys input = lambda: sys.stdin.readline().rstrip() T = int(input()) for _ in range(T): N = int(input()) A = [ord(a) - 97 for a in input()] B = [ord(a) - 97 for a in input()] X = [[0] * 20 for _ in range(20)] for a, b in zip(A, B): X[a][b] = 1 if a > b: print(-1) ...

0.492854

def main(): from sys import stdin k, n = map(int, stdin.readline().split()) a = list(map(int, stdin.readline().split())) b = list(map(int, stdin.readline().split())) res = set() for i in range(k): # putting b[0] on place i our = set() curr = b[0] for j in range(i,...

0.492639

# Definition for an interval. # class Interval: # def __init__(self, s=0, e=0): # self.start = s # self.end = e class Solution: def eraseOverlapIntervals(self, intervals): """ :type intervals: List[Interval] :rtype: int """ intervals = sorted(...

0.492346

class Solution: def equalSubstring(self, s: str, t: str, maxCost: int) -> int: dist = [ abs( ord(s[i]) - ord(t[i]) ) for i in range(len(s))] # i = 0 # cur = 0 # res = 0 # for j in range(len(s)): # cur += dist[j] # while cur>maxCost: # ...

0.491228

def hamming_distance(a, b): return sum(c != d for c, d in zip(a, b))

0.491126

class Solution: def repeatedNTimes(self, A: List[int]) -> int: dict_ = dict() for a in A: if a in dict_: return a else: dict_[a] = 1

0.490695

class Solution: def longestDupSubstring(self, S): nums, N = [ord(c) - ord('a') for c in S], len(S) BASE, MOD = 26, 2**32 def check(L): cur_hash, seen = 0, set() for val in nums[:L]: cur_hash = (cur_hash * BASE + val) % MOD seen.add(cur_hash...

0.490689

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): print(*args, **kwargs, file=sys.stderr) dprint('debug mode') except ...

0.489952

from collections import defaultdict class Solution: def longestSubsequence(self, arr: List[int], difference: int) -> int: count_dict = defaultdict(int) for num in arr: count_dict[num] = count_dict[num-difference] + 1 return max(count_dict.values())

0.488844

s = input() t = input() l, r = [0]*len(t), [0]*len(t) li, ri = 0, len(s) - 1 for i in range(len(t)): while s[ li ] != t[ i ]: li += 1 while s[ ri ] != t[ - i - 1 ]: ri -= 1 l[ i ] = li r[ -i -1 ] = ri li += 1 ri -= 1 print( max( [ r[ 0 ], len(s) - l[ -1 ] - 1 ] + [ max( 0, r[ i ...

0.488455

class Solution: def findMaxConsecutiveOnes(self, nums): """ :type nums: List[int] :rtype: int """ if nums == []: return 0 count = 0 countMax =0 for ele in nums: if ele == 1: count += 1 ...

0.487684

def resolve(): n = int(input()) blue_cards = list() for i in range(n): card = input() blue_cards.append(card) blue_cards = sorted(blue_cards) m = int(input()) red_cards = list() for i in range(m): card = input() red_cards.append(card) red_cards = sorted(re...

0.487264

from fractions import gcd from functools import reduce def solution(a): return reduce(gcd, a) * len(a)

0.487201

class Solution: def leastBricks(self, wall): """ :type wall: List[List[int]] :rtype: int """ d = {} for i in wall: suma = 0 for j in range(len(i)-1): suma += i[j] if suma in d: d[s...

0.486896

Given an array of digits, you can write numbers using each digits[i] as many times as we want. For example, if digits = ['1','3','5'], we may write numbers such as '13', '551', and '1351315'. Return the number of positive integers that can be generated that are less than or equal to a given integer n. Example 1: Inp...

class Solution: def atMostNGivenDigitSet(self, digits: List[str], n: int) -> int: count = 0 length = 1 n_str = str(n) while length < len(n_str): count+= len(digits)**length length+=1 digits_sorted = sorted(digits) ## now length shou...

0.808784

class Solution: def numDupDigitsAtMostN(self, N: int) -> int: # N -> total numbers less than or equal to N # We will calculate the integers with all different digits (which are less than/equal to N) # Then the answer would be: N - nums_with_different_digits # Calculate the n...

0.791364

class Solution: def countNumbersWithUniqueDigits(self, n): """ :type n: int :rtype: int """ ls = [1,10,91] mul = 9 res = 0 for i in range(8): mul = 9 m = 9 for j in range(i+2): ...

0.786814

from math import factorial as fact def sum_arrangements(n): s = str(n) perms = fact(len(s)-1) coefAll = int('1'*len(s)) return coefAll*perms*sum(map(int,s))

0.721887

from operator import mul from math import factorial from functools import reduce from collections import Counter def perms(inp): return factorial(len(str(inp))) // reduce(mul, map(factorial, Counter(str(inp)).values()), 1)

0.696831

def persistence(n): n = str(n) count = 0 while len(n) > 1: p = 1 for i in n: p *= int(i) n = str(p) count += 1 return count # your code

0.69269

def nb_dig(n, d): return sum(str(i*i).count(str(d)) for i in range(n+1))

0.688578

n=input() rg=[0]*10 for i in n: rg[int(i)]+=1 rl=[] ff=0 for i in range(len(rg)): if rg[i]!=0: rl.append(rg[i]) if i==0: ff=1 fact=[1] fc=1 for i in range(1,20): fc*=i fact.append(fc) rt=[] t=0 def cfs(d): if d==len(rl): nonlocal t,ff jj=fact[sum(rt)] for i in rt:...

0.686505

from math import factorial from string import digits, ascii_uppercase DIGITS = digits + ascii_uppercase FACTORIALS = [1, 1] f = 1 for i in range(2, 36): f *= i FACTORIALS.append(f) def dec2FactString(nb): ret = [] for f in reversed(FACTORIALS): (d, nb) = divmod(nb, f) if d or ret: ...

0.679624

class Solution: def countDigitOne(self, n): """ :type n: int :rtype: int """ ones, m = 0, 1 while m <= n: ones += (n // m + 8) // 10 * m + (n // m % 10 == 1) * (n % m + 1) m *= 10 return ones

0.679472

def subsets(collection): if len(collection) == 1: yield [collection] return first = collection[0] for smaller in subsets(collection[1:]): yield [first] + smaller for n, subset in enumerate(smaller): yield smaller[:n] + [first + subset] + smaller[n+1:] def bucke...

0.677268

def get_num(n): return sum({'0': 1, '6': 1, '9': 1, '8': 2}.get(d, 0) for d in str(n))

0.673014

def single_digit(n): while n > 9: n = bin(n).count("1") return n

0.672629

n=int(input()) s=input() pw=[1] last=1 for i in range(70): if (last>1e19): break pw.append(last*n) last=last*n dp=[1e19]*100 for i in range(100): dp[i]=[1e19]*100 dp[len(s)][0]=0 for i in range(len(s),-1,-1): for power in range(0,len(pw)): cur='' for j in range(i-1,-1,-1): ...

0.663751

import math def nth_perm(n,d): digits = [str(i) for i in range(d)] out = '' for i in range(1, d): cycles = math.ceil(n/math.factorial(d-i)) out += digits.pop((cycles % (d-i+1)) - 1) return out + digits.pop()

0.656732

masks = [0] * 10 for i in range(10 ** 4): for c in str(i): masks[int(c)] |= 1 << i def find_num(n): seq, x = 1, 0 for j in range(n): M = seq for m in masks: if x & m: M |= m x = ~M & (M+1) seq |= x return x.bit_length() - 1

0.654924

def sel_number(n, d): cnt = 0 for a in range(12, n + 1): nums = list(map(int, str(a))) if nums == sorted(set(nums)) and \ all(c - b <= d for b, c in zip(nums[:-1], nums[1:])): cnt += 1 return cnt

0.65228

def look_and_say_and_sum(N): l=[1] for n in range(N-1): result = [1,l[0]] for i in range(1,len(l)): if l[i]==result[-1]: result[-2] += 1 else: result += [1,l[i]] l=result return sum(l)

0.650678

import sys sys.setrecursionlimit(10000) n = input() k = int(input()) m = {} def doit(n, k): if len(n) == 0: return k == 0 d = int(n[0]) if (n, k) not in m: ret = 0 for i in range(d + 1): if i == d: ret += doit(n[1:], k - 1 if i > 0 else k) e...

0.648124

# precalculate results results = {} n, digits = 1, 0 while digits <= 1000: digits = len(str(sum( x**(n-x+1) for x in range(1, n) ))) if digits not in results: results[digits] = n n += 1 def min_length_num(digits, max_num): n = results.get(digits, 0) return [True, n+1] if n and n < max_num...

0.644375

def per(n): r = [] while n>=10: p=1 for i in str(n): p=p*int(i) r.append(p) n = p return r

0.639998

from itertools import permutations def sc_perm_comb(num): sNum = str(num) return sum({ int(''.join(p)) for d in range(1, len(sNum)+1) for p in permutations(sNum, d) })

0.63954

class Solution: dp = [[1] * 10] def knightDialer(self, n: int) -> int: MOD = 10 ** 9 + 7 jump = [[4, 6], [6, 8], [7, 9], [4, 8], [3, 9, 0], [], [0, 1, 7], [2, 6], [1, 3], [2, 4]] for i in range(len(self.dp), n): new = [0] * 10 for j in range(10): n...

0.638658

class Solution: memory = {} largest = [0] trackerForLargest = {} largestSize = [0] numGroups = [0] def countLargestGroup(self, n: int) -> int: if n > self.largest[0]: for num in range(self.largest[0] + 1, n + 1): curr = num currSum = 0 ...

0.636911

n = int(input()) def p(x): ans = 1 while x > 0: ans *= x % 10 x //= 10 return ans ans = p(n) for i in range(len(str(n))): cans = 9 ** i * p((n // 10 ** i) - 1) ans = max(ans, cans) print(ans)

0.636754

s=input() ans=0 i=1 past=int(s[0]) c=1 ans=1 while(i<len(s)): if(int(s[i])+past==9): c+=1 past=int(s[i]) else: if(c%2==1 and c!=1): ans*=(c//2+1) c=1 past=int(s[i]) i+=1 if(c!=1 and c%2==1): ans*=(c//2+1) print(ans)

0.636648

def sum_part(n): m, p, q, r, s = 1, 1, 1, 0, n while n > 9: n, d = divmod(n, 10) r += d * p p *= 10 if d: m = 1 else: m*= 2 s += q*n + m*memo[r] q *= 2 return s from collections import defaultdict qualified = defaultdict(list) memo = {n: n for n in ra...

0.636173

from re import findall def f(num): if num == 0: return 1 else: return num*f(num-1) dic = {1: [0,1,2,3,53,52],2: [4,5,6,7,50,51],3: [8,9,10,11,48,49], 4: [12,13,14,15,47,46], 5: [16,17,18,19,44,45],6:[20,21,22,23,42,43], 7:[24,25,26,27,40,41],8:[28,29,30,31,38,39],9:[32,33,34,35,36,37]} def test(): nonlocal i...

0.635605

from math import log10 def rocks(n): return (n + 1) * int(log10(n) + 1) - (10 ** int(log10(n) + 1) - 1) // 9

0.635521

#cook your recipe from math import factorial test_cases = int(input()) for _ in range(test_cases): n = int(input()) sum1 = 0 final_sum = 0 num = list(map(int, input().split())) rep_time = factorial(n - 1) rep_count = dict() for i in num: if i in rep_count: rep_count[i] +=1 else...

0.635331

def hamming(n): bases = [2, 3, 5] expos = [0, 0, 0] hamms = [1] for _ in range(1, n): next_hamms = [bases[i] * hamms[expos[i]] for i in range(3)] next_hamm = min(next_hamms) hamms.append(next_hamm) for i in range(3): expos[i] += int(next_hamms[i] == next_hamm)...

0.63429

def digits(n): return len(str(n))

0.634067

import fractions import sys f = sys.stdin if len(sys.argv) > 1: f = open(sys.argv[1], "rt") sum_cache = {} def sum_func(x): if x < 10: return x r = sum_cache.get(x) if r is not None: return r xx = 0 while x > 0: xx += x % 10 x /= 10 r = sum_func(xx) ...

0.633902

def count_pal(n): # No recursion; direct calculation: return [9 * 10**((n-1) // 2), 10**(n // 2) * (13 - 9 * (-1)**n) // 2 - 2]

0.633741

T = 1 for test_no in range(T): MAXK = 5000 n = int(input()) cnt = [0] * (MAXK + 1) primeExponential = [[0 for j in range(MAXK + 1)] for i in range(MAXK + 1)] line, num = (input() + ' '), 0 for c in line: if c != ' ': num = num * 10 + (ord(c) - 48) else: cnt[num] += 1 num = 0 for i in range(2, MAXK + ...

0.632263

from functools import reduce def product(ar): return reduce(lambda x,y:x*y, ar) def something_acci(num_digits): seq = [1, 1, 2, 2, 3, 3] while(len(str(seq[-1])) < num_digits): seq.append(product(seq[-3:]) - product(seq[-6:-3])) return (len(seq), len(str(seq[-1])))

0.626971

def solve(s): return sum(i+1 for i,d in enumerate(list(s)) if d in '13579')

0.625

def dlog(x, n): bigMod = 5 ** n ans = [None, 0, 1, 3, 2][x % 5] val = 2 ** ans % bigMod mod, phi = 5, 4 phiVal = 2 ** phi % bigMod for i in range(2, n + 1): nextMod = mod * 5 while val % nextMod != x % nextMod: val = val * phiVal % bigMod ans += phi phi *= 5 phiVal = (phiVal * ...

0.624507

from operator import mul from functools import reduce def genSequence(n): yield n while True: n += reduce(mul, [int(d) for d in str(n) if d != '0']) if n > 9 else n yield n def extract(seq, v): return sorted(seq).index(v) def convergence(n): gen1, genN = genSequence(1), genSequence(n)...

0.624037

def solve(n): def length(n): s = 0 for i in range(20): o = 10 ** i - 1 if o > n: break s += (n - o) * (n - o + 1) // 2 return s def binary_search(k): n = 0 for p in range(63, -1, -1): if length(n + 2 ** p) < k: n += 2 ** p ...

0.622566

def compute_depth(n): i = 0 digits = set() while len(digits) < 10: i += 1 digits.update(str(n * i)) return i

0.622425

class Solution: def monotoneIncreasingDigits(self, N): """ :type N: int :rtype: int """ arr = [int(ch) for ch in str(N)] # create array from number 1234 => [1,2,3,4] marker = len(arr) i = len(arr)-2 while i >= 0: ...

0.62221

from fractions import Decimal, gcd from operator import mul from functools import reduce lcm = lambda a, b=1: a * b // gcd(a, b) def parameter(n): digits = Decimal(n).as_tuple().digits return lcm(sum(digits), reduce(mul, digits))

0.620332

n = int(input()) t = input() if n == 1: if t == "0": print((10 ** 10)) else: print((2 * 10 ** 10)) elif n == 2: if t == "00": print((0)) elif t == "01": print((10 ** 10 - 1)) elif t == "10": print((10 ** 10)) else: # 11 print((10 ** 10)) else: ...

0.618781

def solve(n): if n < 10: return n a = int((len(str(n)) - 1) * '9') b = n - a return sum([int(i) for i in (list(str(a)) + list(str(b)))])

0.61799

def solve(n): moves = [] for a, b in ["25", "75", "50", "00"]: s = str(n)[::-1] x = s.find(a) y = s.find(b, x+1 if a == "0" else 0) if x == -1 or y == -1: continue moves.append(x + y - (x > y) - (a == b)) s = s.replace(a, "", 1).replace(b, "", 1) ...

0.61514

class Solution: def countAndSay(self, n): s = '1' for _ in range(n-1): let, temp, count = s[0], "", 0 for l in s: if let == l: count += 1 else: temp += str(count) + let ...

0.614079

# cook your code here n=input() x=len(n) no=list(map(int,n)) temp=[0]*x if (x>2): sum=99 for i in range(3,x): sum=sum+90 sum=sum+10*(int(n[0])-1) sum=sum+int(n[1]) f=int(n[0])%10 s=int(n[1])%10 cd=s-f temp[0]=n[0] temp[1]=n[1] for i in range(2,x): nxt=(s+cd)%10 temp[i]=(chr(nxt+48)) s=nxt temp=...

0.612959

digits = lambda x: set(str(x)) def LDTA(n): if digits(n) == digits(n*n): return None seen = [] x = n while len(seen) < 10: for d in str(x): if d not in seen: seen.append(d) x *= n return int(seen[-1])

0.612811

class Solution: def findIntegers(self, num): """ :type num: int :rtype: int """ dp=[1,2] for i in range(2,32): dp.append(dp[i-1]+dp[i-2]) bnum=bin(num)[2:] size=len(bnum) ans=dp[size] for i in range(1,s...

0.612128

'''input 3 aa jj aa ''' def list_input(): return list(map(int,input().split())) def map_input(): return map(int,input().split()) def map_string(): return input().split() n = int(input()) d = {} pos = {} for _ in range(n): s = list(input()) s = s[::-1] for i in range(len(s)): try: d[s[i]] += 10**i...

0.611959

hola = 0 a = int(input()) d = len(str(a)) k = 10**(d-1) for i in range(1, d): hola += i * (10**(i-1)*9) hola += d * (a-k+1) print(hola)

0.611666

# ========== //\\ //|| ||====//|| # || // \\ || || // || # || //====\\ || || // || # || // \\ || || // || # ========== // \\ ======== ||//====|| # code def solve(): x = int(input()) ans = 0 ok = 0 ...

0.610753

class Solution: def findNthDigit(self, n): """ :type n: int :rtype: int """ i=count=9 while count < n: i *= 10 count += i * len(str(i)) div, mod = divmod(n-(count-i*len(str(i))), len(str(i))) print(i, count, div, mod)...

0.610162

n = int(input()) out = [] MOD = 998244353 for i in range(1, n + 1): if i == n: out.append(10) else: nex = 2 * 9 * pow(10, n - i - 1, MOD) * 10 if i < n - 1: nex += (n - 1 - i) * 9 * 9 * pow(10, n - i - 2, MOD) * 10 out.append(nex % MOD) print(' '.join(map...

0.609804

from operator import mul from functools import reduce def unique_digit_products(nums): return len({reduce(mul, (int(a) for a in str(num))) for num in nums})

0.60889

def digits_product(product): if product < 10: return 10 + product n = '' for d in range(9, 1, -1): while not product % d: n += str(d) product //= d return int(n[::-1]) if product == 1 else -1

0.608715

N = int(input()) keep = [[0 for i in range(10)] for j in range(10)] ans = 0 for i in range(1, N + 1): first = int(str(i)[0]) end = int(str(i)[-1]) keep[first - 1][end - 1] += 1 for i in range(9): for j in range(9): ans += (keep[i][j] * keep[j][i]) print(ans)

0.608169

import math def gta(limit, *args): return sum_up(limit, make_pattern(limit, *args)) def binomial_coeff(n, k): """N choose K""" return math.factorial(n) / math.factorial(n-k) def sum_up(limit, items): """ Basic Idea: The number of cominations is simply N choose K. We calcuate this n-tim...

0.605862

from itertools import count # Couldn't find the pattern of why it's 1 or 8, I'm sad :( def repeat_sequence_len(n): memo = {} for i in count(): if n in memo: return i - memo[n] memo[n] = i n = sum(d*d for d in map(int, str(n)))

0.605667

l = {j:i for i,j in enumerate('0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz')} l_ = dict(enumerate('0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz')) is_polydivisible = lambda n, base:next((0 for i in range(1, len(n) + 1) if get_base(n[:i], base) % i),1) get_base = lambda n, base:sum(...

0.605392

class Solution: def countArrangement(self, N): """ :type N: int :rtype: int """ d = { 1:1, 2:2, 3:3, 4:8, 5:10, 6:36, 7:41, 8:132, 9:250, 10:700, 11:750, 12:4010, 13:4237, 14:10680, 15:24679 } return d.get(N, N)

0.603377

def solve(n): x = str(n) res = [x] + [str(int(x[:i]) - 1) + '9' * (len(x) - i) for i in range(1, len(x))] return int(max(res, key=lambda x: (sum(map(int, x)), int(x))))

0.603322

def count_zeros_n_double_fact(n): if n % 2 != 0: return 0 k = 0 while n >= 10: k += n // 10 n //= 5 return k

0.602514

from itertools import combinations_with_replacement def find_all(sum_dig, digs): combs = combinations_with_replacement(list(range(1, 10)), digs) target = [''.join(str (x) for x in list(comb)) for comb in combs if sum(comb) == sum_dig] if not target: return [] return [len(target), int(target[0])...

0.602325

from scipy.special import comb def almost_everywhere_zero(n, k): if k == 0: return 1 first, *rest = str(n) l = len(rest) return 9**k*comb(l, k, exact=True) +\ (int(first)-1)*9**(k-1)*comb(l, k-1, exact=True) +\ almost_everywhere_zero(int("".join(rest) or 0), k-1)

0.602052

from collections import Counter def fib_digits(n): a, b = 0, 1 for i in range(n): a, b = b, a+b return sorted(((b, int(a)) for a, b in Counter(str(a)).items()), reverse=True)

0.601362

def nth_chandos_number(n): return int((bin(n)+"0")[2:], 5)

0.600867

def increasing_numbers(d): s = 1 for i in range(1,10): s=s*(i+d)//i return s

0.599896

def self_converge(number): n, cycle = str(number), set() while n not in cycle: cycle.add(n) s = ''.join(sorted(n)) n = '%0*d' % (len(n), int(s[::-1]) - int(s)) return -1 if not int(n) else len(cycle)

0.599385

class Solution: def numDecodings(self, s): """ :type s: str :rtype: int """ if not s: return 0 def num_decode(i): # Number of ways to decode s[i:] if i == len(s): return 1 ...

0.598691

def champernowne_digit(n): if not type(n) is int or n < 1: return float("NaN") i, l = 1, 11 while l <= n: i, l = i + 1, l + 9 * (i + 1) * 10**i return ((n - l) // (i * 10**(i - 1 - (n - l) % i))) % 10 champernowneDigit = champernowne_digit

0.597767

def solve(n): a,b = '01' for _ in range(n): a,b = a+b,a return a

0.597695

d, polydivisible, arr = 1, [], list(range(1, 10)) while arr: d += 1 polydivisible.extend(arr) arr = [n for x in arr for n in range(-(-x*10 // d) * d, (x+1) * 10, d)] def next_num(n): from bisect import bisect idx = bisect(polydivisible, n) if idx < len(polydivisible): return ...

0.59657

from itertools import product def operator_insertor(n): result = [] for ops in product(["+", "-", ""], repeat=8): expression = "".join(a+b for a, b in zip("123456789", list(ops) + [""])) res = eval(expression) if res == n: result.append(len(expression) - 9) ret...

0.593718

def pattern(n): nums = '1234567890' str_nums = nums*(n//10) + nums[:n%10] return '\n'.join(' '*(n - i - 1) + str_nums + ' '*i for i in range(n))

0.59369

from math import * def count(n): return ceil(lgamma(n+1)/log(10))

0.591401

def colorful(number): base_result = [] for x in str(number): base_result.append(int(x)) for y in range(len(base_result) - 1): temp = base_result[y] * base_result[y + 1] base_result.append(temp) # Should you really eval the last value ? :shrug: If so, would use eval return len...

0.590738

#!/usr/bin/env python def main(): N = int(input()) C = 0 for n in range(N): S = input().strip() Pi = S.split()[-1] L = [Pi.count(k) for k in map(str, list(range(10)))] if L[8] >= L[5] and L[5] >= L[3] and \ L[0] == 0 and L[1] == 0 and \ L[2] == 0 and L[4] == 0 and \ L[6] == 0 and L[7] == 0 and \ ...

0.590524

def zeros(n): """ No factorial is going to have fewer zeros than the factorial of a smaller number. Each multiple of 5 adds a 0, so first we count how many multiples of 5 are smaller than `n` (`n // 5`). Each multiple of 25 adds two 0's, so next we add another 0 for each multiple of 25 sma...

0.590191

def fusc(n): a, b = 1, 0 for i in bin(n)[2:]: if i == '1': b += a else: a += b return b

0.590177

def digitize(n): return [int(d) for d in str(n)]

0.588614

def get_sum_of_digits(num): return sum(map(int, str(num)))

0.58856

#CF Round 150. Div II Prob. A - Dividing Orange import sys dp = [[[-1 for j in range(3)] for i in range (1 << 10)] for k in range(11)] In = sys.stdin n = In.readline().strip() def go (idx, mask, equal): if dp[idx][mask][equal] != -1: return dp[idx][mask][equal] if bin(mask).count("1") > 2: re...

0.588387

def find(a,b,n): strng = str(a) + str(b) #there are 10 and 4 long loops if (n > 20): n = n%20+20 while len(strng) <= n: next_ch = int(strng[-1]) + int(strng[-2]) strng = strng + str(next_ch) return int(strng[n])

0.586539

def dig_pow(n, p): s = 0 for i,c in enumerate(str(n)): s += pow(int(c),p+i) return s/n if s%n==0 else -1

0.586435

def max_number(n): return int(''.join(sorted(str(n), reverse=True)))

0.586156

import itertools def cal(N, target_num, keta): answer = float('inf') for p in itertools.product(target_num, repeat=keta): temp = 0 for i, num in enumerate(p): temp += num * 10**i if temp >= N: answer = min(answer, temp) return answer def __star...

0.584944

class Solution: def trailingZeroes(self, n): """ :type n: int :rtype: int """ n_fives = 0 while n > 0: n = n // 5 n_fives += n return n_fives

0.584731

class Solution: def numTilePossibilities(self, tiles: str) -> int: res = 0 freqs = [f + 1 for f in Counter(tiles).values()] for t in itertools.product(*map(range, freqs)): n = sum(t) subtotal = math.factorial(n) for freq in t: subtotal //= ...

0.584607

''' // There are n! / (i+1)! * i permutations with decreasing seq length i (i+1 changes) for i <= n! // There are n! / (i+1)! permutations for each 1 <= j <= i of position of moved one // All nonempty things + n*n! * (n*n! + 1) / 2 // Subtract off everything inside one of them - n! * n * (n+1) / 2 // Subtract off ev...

0.583947

for _ in range(int(input())): n = int(input()) s = input() d = {0: 1} summa, cnt = 0, 0 ans = 0 for i in s: summa += int(i) cnt += 1 k = cnt - summa if k not in d: d[k] = 0 ans += d[k] d[k] += 1 print(ans)

0.583827

s=input()[::-1] alist=[0]*2019 num1=0 num2=1/10 lens=len(s) for i in range(lens): num2=int(((num2)*10)%2019) num1=(num1+int(s[i])*(num2))%2019 alist[num1]+=1 alist[0]+=1 ans=0 for i in range(2019): ans+=alist[i]*(alist[i]-1)//2 print(ans)

0.583727

import sys input = sys.stdin.readline from fractions import gcd import numpy as np MOD = 10 ** 9 + 7 S = int(input()) M = 10**4 def type_1(S): cnt = 0 # S 2種の桁数k,k+1からなる。さらにk>=9を仮定する。 # 項数nとすると、kn < S < (k+1)n となる(k,n)の個数を数える # まずk > Mとなるものを数える。このとき1<=n<=Mである。 n = np.arange(1,M+1) k_max = (...

0.582226

# -*- coding: utf-8 -*- ngoods = { '0': 2, '1': 7, '2': 2, '3': 3, '4': 3, '5': 4, '6': 2, '7': 5, '8': 1, '9': 2 } digits = input().strip() print(ngoods[digits[0]] * ngoods[digits[1]])

0.581497

res = 1 started = False seen = set() codes = set(['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J']) for ch in input(): if ch == '?': if started: res *= 10 else: res *= 9 elif (ch in codes) and (ch not in seen): if not started: res *= len(codes) - len(seen) - 1 else: res *= len(codes) - len(seen) ...

0.580847

class Solution: def largestPalindrome(self, n): """ :type n: int :rtype: int """ A = [0,9,987,123,597,677,1218,877,475] return A[n]

0.578678

import re ls = ["Zero","One","Two","Three","Four","Five","Six","Seven","Eight","Nine","Ten","Eleven","Twelve","Thirteen"] def max_consec_zeros(n): return ls[max(map(lambda x:len(x),re.findall(r'0*',bin(int(n))[2:])))]

0.578019

import sys readline = sys.stdin.readline MOD = 10**9+7 S = readline().strip().split('1') if len(S) == 1: print(len(S[0])) else: S = [len(s)+1 for s in S] ans = S[0]*S[-1] S = S[1:-1] dp = [0]*(max(S)+2) dp[0] = 1 for ai in S: res = 0 rz = 0 for i in range(ai+1):...

0.577547

n = int(input()) mod = 10**9 + 7 all09 = ((2 * 10**n) % mod - (2 * 9**n) % mod) % mod of09 = ((10**n) % mod - 8**n % mod) % mod print((all09-of09)%mod)

0.577015

MOD = 10**9+7 s = input() n = int(input()) qs = [['',s]]+[input().split('->') for i in range(n)] ds = {} for i in range(10): ds[str(i)] = (10,i) for i in range(n,-1,-1): out = 0 mul = 1 for d in qs[i][1]: out = (out * ds[d][0] + ds[d][1]) % MOD mul = (mul * ds[d][0]) % MOD ds[qs[i...

0.576969

There are 3n piles of coins of varying size, you and your friends will take piles of coins as follows: In each step, you will choose any 3 piles of coins (not necessarily consecutive). Of your choice, Alice will pick the pile with the maximum number of coins. You will pick the next pile with maximum number of coins. Y...

class Solution: def maxCoins(self, piles: List[int]) -> int: piles.sort() i = 0 j = len(piles) - 1 max_coins = 0 for i in range(len(piles) // 3, len(piles), 2): max_coins += piles[i] return max_coins

0.847372

class Solution: def maxSizeSlices(self, slices: List[int]) -> int: a,b,n=[slices[0]],[0],len(slices) for i in range(1,n): a.append(max(a[-1],slices[i])) b.append(max(b[-1],slices[i])) for i in range(2,2*n//3,2): aa,bb=[0]*(n-1),[0]*n for j in r...

0.756575

#5:09 ''' nums = [3,6,5,1,8] sum_nums = 23 mod3_sum_nums = 2 mod3_dict = {0:[3,6], 1:[1], 2:[5,8]} helper([5,8], [1]) -> 5 ''' from collections import defaultdict class Solution: def helper(self, l1, l2): if len(l1) < 1 and len(l2) <2: sum_remove = 0 elif len(l1) < 1: s...

0.712662

# cook your dish here n=int(input()) l=list(map(int,input().split())) temp=[] for item in l: temp.append(item) if(n<=3): print(sum(temp)) else: for i in range(3,n): temp[i]=l[i]+min(temp[i-1],temp[i-2],temp[i-3]) res=sum(l)-min(temp[n-1],temp[n-2],temp[n-3]) print(res)

0.706409

n = int(input()) l = list(map(int, input().split())) best = 0 for i in range(n): for j in range(i, n): for k in range(j, n): best = max(best, l[i] | l[j] | l[k]) print(best)

0.702258

import math n = int(input()) a=list(map(int,input().split())) dp = [0 for x in range(n)] dp[0] = a[0] dp[1] = a[1] dp[2] = a[2] for x in range(3,n): dp[x] = a[x] + min(dp[x-1],dp[x-2],dp[x-3]) print(min(dp[-3:]))

0.701131

from operator import attrgetter, itemgetter n = int(input()); arr = [[int(x) for x in input().split(' ')] for y in range(n)]; arr = sorted(arr, key=itemgetter(1,0,2), reverse=True); dp = [0 for x in range(n)]; s = []; for i in range(n): while (s != [] and arr[s[-1]][0] >= arr[i][1]): s.pop(); if (s != []): dp[i] ...

0.700091

input() num = list(map(int, input().split())) maxn = 0 l, r = 0, len(num)-1 j1, j2 = num[l], num[r] while l < r: if j1 == j2: maxn = max(j1, maxn) l += 1 j1 += num[l] elif j1 < j2: l += 1 j1 += num[l] else: r -= 1 j2 += num[r] print(maxn)

0.696025

r = lambda: map(int, input().split()) import heapq def main(): n, = r() a = list(r()) if len(a) % 2 == 0: a.append(0) heapq.heapify(a) ret = 0 while len(a) > 1: x = heapq.heappop(a) y = heapq.heappop(a) z = heapq.heappop(a) ret += x + y + z heapq.heappush(a, x + y + z) print(ret) main()

0.692138

def max_tri_sum(numbers): return sum(sorted(set(numbers))[-3:])

0.688592

a=input().split() a.sort(reverse=True) if len(set(a))==1: print(12*int(a[0])) else: ans=int(a[0]+a[1])+int(a[2]) print(ans)

0.680864

cards = list(map(int, input().split())) result = sum(cards) for i in range(5): cnt = cards.count(cards[i]) cnt = min(cnt, 3) if cnt not in [2, 3]: continue result = min(result, sum(cards) - cnt * cards[i]) print(result)

0.678331

from functools import lru_cache class Solution: def tallestBillboard(self, rods: List[int]) -> int: rods = sorted(rods)[::-1] n = len(rods) psum = rods.copy() for i in range(n-1)[::-1]: psum[i] += psum[i+1] @lru_cache(None) def dfs(idx, diff): ...

0.677336

# -*- coding: utf-8 -*- """ Created on Sun Apr 2 22:42:34 2017 @author: Sean38 """ n = int(input().rstrip()) s = input() a = [int(ch) for ch in s.split()] a = a[0:n] a.sort() def check_num(p, i): # i = ap + b(p+1) # min(a+b) <=> max(b) # b(p+1) <= i # b == i (mod p) max_b = (i // (p + 1)) b...

0.668883

a = list(map(int, input().split())) m = max(a) ans = 0 for i in range(3): if a[i] < m - 1: ans += (m - 1) - a[i] a[i] = m - 1 print(ans)

0.666745

def solve(xs): m = 0 for x in sorted(xs): if x > m + 1: break m += x return m + 1

0.662938

3 # Copyright (C) 2017 Sayutin Dmitry. # # This program is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License as # published by the Free Software Foundation; version 3 # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY;...

0.66285

s=input().split() for i in range(3): s[i]=int(s[i]) s.sort() ans=s[0]//3 +s[1]//3 +s[2]//3 x=s[0]%3 y=s[1]%3 z=s[2]%3 if(x==0 and y==z==2 and s[0]!=0): ans+=1 if(y==0 and x==z==2 and s[1]!=0): ans+=1 if(z==0 and y==x==2 and s[2]!=0): ans+=1 ans+=min(x,y,z) print(ans)

0.662507

n = input() s = [] a = 0 for i in map(int, input().split()): while len(s) > 1 and min(s[-2], i)>=s[-1]: a += min(i, s[-2]) del(s[-1]) s.append(i) s.sort() print(a + sum(s[0: -2])) # Made By Mostafa_Khaled

0.660303

n = int(input()) l = list(map(int,input().split())) curr = 0 best = 0 prevs = [0] * 31 for v in l: curr += v if v >= 0: for i in range(0, v): prevs[i] = curr for i in range(v, 31): best = max(curr - prevs[i] - i, best) else: for i in range(31): pr...

0.65978

n = int(input()) a = sorted(list(map(int, input().split()))) ans = 0 if n == 1: ans = a[0] else: mult = 2 for i in range(n - 1): ans += mult * a[i] mult += 1 ans += (mult - 1) * a[-1] print(ans)

0.659698

#解説参照 a = list(map(int, input().split( ))) a.sort(reverse = True) ans = 0 ans += a[0]-a[1] a[1]+=ans a[2] += ans ans += (a[0]-a[2])//2 ans += ((a[0]-a[2])%2)*2###これ print(ans)

0.657093

import copy def solve(): n = int(input()) a = [int(c)-1 for c in input().split(' ')] nextcard = [[-1 for i in range(8)] for j in range(n)] for i in range(n-2, -1, -1): nextcard[i] = copy.copy(nextcard[i+1]) nextcard[i][a[i+1]] = i+1 jump = [[-1 for i in range(n+1)] for j in range(...

0.656935

class Solution: def deleteAndEarn(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums);#count is a dict [3,4,2]--> {2:1,3:1,4:1} prev = None; avoid = using = 0; for k in sorted(count): temp = ma...

0.655485

from heapq import * def add_all(lst): heapify(lst) total = 0 while len(lst) > 1: s = heappop(lst) + heappop(lst) total += s heappush(lst, s) return total

0.655023

from collections import Counter def obtain_max_number(arr): c = Counter(arr) while 1: find = next((k for k in c if c[k] > 1), None) if not find:return max(c) c[find] -= 2 c[find*2] = c.get(find*2,0) + 1

0.654857

n = int(input()) A = list(map(int, input().split())) A.sort(reverse=True) A2 = [A[0]] for a in A[1:]: A2.extend([a, a]) ans = 0 for a in A2[:n-1]: ans += a print(ans)

0.65484

# cook your dish here #Moony and ICPC team T = int(input()) for i in range(T): N,data = int(input()),list(map(int,input().split())) if(N==3): print(sum(data)) else: best = data[0]+data[1]+data[2] overall = best k=len(data) for i in range(1,k-2): ...

0.653713

class Solution: def largestPerimeter(self, A: List[int]) -> int: A.sort(reverse=True) la=len(A) for i in range(la-2): if A[i]<A[i+1]+A[i+2]: return A[i]+A[i+1]+A[i+2] return 0

0.653143

n = int(input()) *A, = list(map(int, input().split())) seq = [] cur = 1; cnt = 0 for a in A: if cur == a: cnt += 1 else: seq.append(cnt) cur = a; cnt = 1 if cnt > 0: seq.append(cnt) ans = max(seq) l = len(seq) dp = [[0]*4 for i in range(l+1)] for i in range(l): one = i % 2 #12 ...

0.64993

def dfs(i): if i >= 2 ** n: return 0, 0 x1, m1 = dfs(i * 2) x2, m2 = dfs(i * 2 + 1) if m1 + a[i * 2] < m2 + a[i * 2 + 1]: return x1 + x2 + m2 + a[i * 2 + 1] - m1 - a[i * 2], m2 + a[i * 2 + 1] return x1 + x2 + m1 + a[i * 2] - m2 - a[i * 2 + 1], m1 + a[i * 2] n = int(input()) a = [0, 0...

0.64984

from functools import * class Solution: def stoneGameII(self, arr): a =[] s=0 n = len(arr) for i in arr[::-1]: s+=i a.append(s) a=a[::-1] @lru_cache(None) def fun(i,m): if i+2*m>=n:return a[i] mn = inf ...

0.645997

'''input 1 2 3 5 ''' n = int(input()) a = int(input()) b = int(input()) c = int(input()) cur = 0 pos = 0 for i in range(n-1): if pos == 0: if a < b: pos = 1 cur += a else: pos = 2 cur += b elif pos == 1: if a < c: pos = 1 ...

0.64169

import heapq data = int(input()) array = [int(_) for _ in input().split()] X = array[0:data] B = array[data:2*data] Y = [-_ for _ in array[2*data:3*data]] heapq.heapify(X) heapq.heapify(Y) x = [sum(X)] y = [sum(Y)] for i in range(data): x += [B[i] - heapq.heappushpop(X, B[i])] y += [-B[-1-i] - heapq.heappu...

0.63531

class Solution: def maximumProduct(self, nums): """ :type nums: List[int] :rtype: int """ import heapq a, b = heapq.nlargest(3, nums), heapq.nsmallest(2, nums) return max(a[0]*a[1]*a[2], a[0]*b[0]*b[1])

0.63527

from heapq import heappop, heappush def comb(fruits): total, heap = 0, sorted(fruits) while len(heap) > 1: cost = heappop(heap) + heappop(heap) heappush(heap, cost) total += cost return total

0.634365

""" Codeforces Contest 260 Div 1 Problem A Author : chaotic_iak Language: Python 3.3.4 """ def main(): n, = read() ar = read() a = [0] * 100001 for i in ar: a[i] += 1 dp = [0] * 100001 dp[1] = a[1] for i in range(2, 100001): dp[i] = max(a[i] * i + dp[i-2], dp[i-1]) print(dp[-...

0.634049

def solve(xs): x, y, z = sorted(xs) return min(x + y, (x + y + z) // 2)

0.633431

def main(): input() l = list(map(int, input().split())) n = max(l) aa = [0] * (n + 1) for x in l: aa[x] += 1 f, x = [0] * n, 0 for a in reversed(aa): x += a f.append(x) f.reverse() res = [] for i, a in enumerate(aa): if a: tot, a = 0, f...

0.631939

def largest_sum(arr): sum = max_sum = 0 for n in arr: sum = max(sum + n, 0) max_sum = max(sum, max_sum) return max_sum

0.629992

# !/bin/env python3 # coding: UTF-8 # ✪ H4WK3yE乡 # Mohd. Farhan Tahir # Indian Institute Of Information Technology and Management,Gwalior # Question Link # https://codeforces.com/problemset/problem/392/B # # ///==========Libraries, Constants and Functions=============/// import sys inf = float("inf") mod = 10000...

0.629666

import sys num=int(sys.stdin.readline()) s=sys.stdin.readline().split() sky=list(map(int,s)) sky.reverse() cuts=0 change=0 t=False i=1 while i<len(sky): if sky[i]<=sky[i-1]: for j in range(i-1,-1,-1): if sky[j]<=sky[i]-(i-j): break else: change+=sky[j]-(sky[i]-(i-j)) if change>=sky[i]: ...

0.629285

n = int(input()) a = list(map(int, input().split())) r = n-2 for d in a: r += d print(max(max(a), r//(n-1)))

0.627727

n = int(input()) B = list(map(int, input().split())) pp = {} for i in range(n): if B[i] - (i + 1) not in pp: pp[B[i] - (i + 1)] = 0 pp[B[i] - (i + 1)] += B[i] ans = 0 for c in pp: ans = max(ans, pp[c]) print(ans)

0.627046

n = int(input()) a = list(map(int,input().split())) s = sum(a) for k in range(max(a), 999999): vote = sum(k-x for x in a) if vote > s: print(k); break

0.626907

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): #print(*args, **kwargs, file=sys.stderr) # in python 3.4 **kwarg...

0.626493

def f(a, ind): if a[ind] == 0: return -1 k = a[ind] // 14 x = a[ind] % 14 b = a[:] b[ind] = 0 for j in range(14): b[j] += k for j in range(ind + 1, ind + x + 1): j1 = j % 14 b[j1] += 1 res = 0 for j in range(14): if b[j] % 2 == 0: r...

0.626298

n=int(input()) a=[int(i) for i in input().split()] a.sort() count=0 def get_num(a): count=1 taishou = a.pop() while a!=[]: second=a.pop() if taishou==second: count+=1 else: a.append(second) break if count==1: return taishou,0 e...

0.625999

class Solution: def rob(self, nums: List[int]) -> int: if not nums: return 0 if len(nums) < 3: return max(nums) dp = [0] * len(nums) dp[0] = nums[0] dp[1] = max(nums[0], nums[1]) for i in range(2, len(nums)): dp[i] = max(dp...

0.625507

def calc(a): res = [0] * (len(a) + 1) for k in range(len(a)): res = [2 * max(a[i] + res[i+1], a[i+k] + res[i]) for i in range(len(a) - k)] return res[0]

0.624221

def dp(): dparr = [0] * len(sections) for i in range(len(sections) - 1, -1, -1): _, curend, curcomfort = sections[i] nextsection = i + 1 try: while sections[nextsection][0] <= curend: nextsection += 1 except IndexError: # Loop til end inc = curcomfort else: inc = curcomfort + dparr[nextsecti...

0.621424

a = int(input()) b = int(input()) c = int(input()) print(max(a*b*c, a+b*c, a*b+c, a*(b+c), (a+b)*c, a+b+c))

0.620837

from sys import maxsize # Function to find the maximum contiguous subarray # and print its starting and end index def maxSubArraySum(a,size): max_so_far = -maxsize - 1 max_ending_here = 0 start = 0 end = 0 s = 0 for i in range(0,size): max_ending_here += a[i] if max_so_far < max_ending_here: ma...

0.620724

class Solution: def thirdMax(self, nums): """ :type nums: List[int] :rtype: int """ nums = sorted(list(set(nums))) if len(nums)<3: return max(nums) else: return nums[-3]

0.620565

# cook your dish here while True: try: n=int(input()) lis=[] for i in range(n): k=list(map(int,input().split())) k.append(k[1]+k[2]) lis.append(k) #print(lis) p=sorted(lis,key=lambda x:x[3],reverse=True) #print(p) m...

0.617642

# returns answer to the subproblem with interval range [start, end], # but with a total of "extra" additional stuff on the end # that must be deleted last. memo = {} def f(dat, rewards, start, end, extra): curr = (start, end, extra) if curr in memo: return memo[curr] if start > end: re...

0.617583

def solve(arr): p, q = 1, 1 for k in arr: x, y = max(k), min(k) a = p * x b = q * x c = p * y d = q * y p = max(a, b, c, d) q = min(a, b, c, d) return max(p, q)

0.617199

class Solution: def splitArray(self, nums, m): """ :type nums: List[int] :type m: int :rtype: int """ accum = [0] N = len(nums) mmm = max(nums) if m >= N: return mmm res = 0 for i in nums: r...

0.615863

import os import sys if os.getenv("LOCAL"): sys.stdin = open("_in.txt", "r") sys.setrecursionlimit(2147483647) INF = float("inf") N = int(sys.stdin.readline()) S = list(map(int, sys.stdin.readline().split())) def count_max(diff): # 左右対称に diff 間隔でとるときの最大 b = 0 a = N - 1 ret = 0 cumsum = 0 ...

0.610723

# cook your dish here for _ in range(int(input())): d=dict() ls=[] for i in range(int(input())): ls=list(map(int,input().split())) if ls[0] in d: d[ls[0]]=max(ls[1],d[ls[0]]) else: d[ls[0]]=ls[1] # print(d) if len(d)<3: print(0) else: kd=list(d.values()) kd.sort() # print(kd) print(kd[-1]+kd...

0.610185

n = int(input()) seq = sorted(list(map(int, input().split()))) #Left (inc), Right(exc), bit to check, value to add queue = [(0,n,30,0)] best = 2 ** 30 while queue: l, r, b, v = queue.pop() if b >= 0: mask = 1 << b if not mask & seq[l] and mask & seq[r - 1]: for i in range(...

0.609463

q=list(map(int,input().split())) a=[] s=[] for i in range(0,q[0]): s+=[min(list(map(int,input().split())))] print(max(s))

0.609241

import bisect,collections,copy,heapq,itertools,math,string import sys def I(): #1 line 1 int return int(sys.stdin.readline().rstrip()) def LI(): #1 line n int return list(map(int,sys.stdin.readline().rstrip().split())) def S(): #1 line 1 string return sys.stdin.readline().rstrip() def LS(): ...

0.608784

import sys import math import cProfile DEBUG = False def log(s): if DEBUG and False: print(s) def calc_dmg(num, arr): maximum = 0 if num - len(arr) < 0: maximum = max(arr) return sum(arr) + maximum if DEBUG: sys.stdin = open('input.txt') pr = cProfile.Profile() pr....

0.60835

def main(): import sys import numpy as np def input(): return sys.stdin.readline().rstrip() n = int(input()) a = list(map(int, input().split())) inf = 1e18 k = n%2 + 1 dp = np.full((n+1, k+2), -inf, dtype=int) dp[0,0] = 0 for i in range(n): for j in range(k+1): ...

0.608337

n=int(input()) a=list(map(int,input().split())) a=sorted(a) if(n>65): print(sum(a)-n) elif(n==1 or n==2): print(a[0]-1) else: ans=10**20 for i in range(1,50000): now=1 ta=0 for j in a: ta+=abs(now-j) now*=i ans=min(ans,ta) print(ans)

0.608328

for i in range(int(input())): n=int(input()) c=[int(z) for z in input().split()] c.sort() c.reverse() b1,b2=0,0 for i in range(n): if b1<b2: b1+=c[i] elif b2<b1: b2+=c[i] else: b1+=c[i] print(max(b1,b2))

0.608221

n = int(input()) l = list(map(int, input().split())) total = sum(l) gap = 0 for rod in l: gap = max(gap, rod - (total - rod)) print(gap + 1)

0.608215

n = int(input()) arr = list(map(float, input().split())) if n == 1: print(int(arr[0])) return arr.sort(reverse = True) res = 0 while arr: res += sum(arr) arr = arr[:len(arr)//4] print(int(res))

0.607565

N = int(input()) A = [int(s) for s in input().split(" ")] ABI = sorted(((a, i) for i, a in enumerate(A, 1)), reverse=True) prev = [0] for k, (a,i) in enumerate(ABI): curr = [0]*(k+2) for l in range(k+1): curr[l] = max(curr[l], prev[l]+abs(N-i-k+l)*a) curr[l+1] = prev[l]+abs(i-l-1)*a prev = curr pri...

0.607426

import sys inp = sys.stdin #inp = open('input.txt', 'r') n = int(inp.readline()) a = list(map(int, inp.readline().split())) best = [0, 0, 0] for i in range(n): nx_best = [0, 0, 0] if a[i] in (1, 3): nx_best[1] = max(best[0], best[2]) + 1 if a[i] in (2, 3): nx_best[2] = max(best[0], best[...

0.607115

class Solution: def maxSatisfaction(self, satisfaction: List[int]) -> int: satisfaction.sort() total, res = 0,0 while satisfaction and satisfaction[-1]+total > 0: total += satisfaction.pop() res += total return res

0.605544

def main(): p = [] sum_cost = 0 n = int(input()) for i in range(n): p.append(int(input())) max_p = max(p) p[p.index(max_p)] = max_p / 2 print((int(sum(p)))) def __starting_point(): main() __starting_point()

0.605508

import bisect; def getIntList(): return list(map(int, input().split())); def getTransIntList(n): first=getIntList(); m=len(first); result=[[0]*n for _ in range(m)]; for i in range(m): result[i][0]=first[i]; for j in range(1, n): curr=getIntList(); for i in range(m): ...

0.60497

r, g, b = map(int, input().split()) maxi = (r + g + b) // 3 print(min(maxi, r + g, r + b, g + b))

0.604382

def flipping_game(num): current = 0 biggest = 0 for i in num: current = max(0, current - ( i or -1 ) ) biggest = max(biggest, current) return sum(num) + (biggest or -1)

0.604213

rr = lambda: input().strip() rri = lambda: int(rr()) rrm = lambda: list(map(int, rr().split())) def solve(N, A): ans = 0 prev = float('inf') for x in reversed(A): x = min(x, prev - 1) ans += max(x, 0) prev = x return ans for tc in range(1):#rri()): N = rri() A = rrm() ...

0.603939

T = int(input()) for _ in range(T): n = int(input()) arr = list(map(int, input().split())) a = [0 for _ in range(max(arr)+1)] star_val = [] for i in range(len(arr)): j = 1 val = 0 while j*arr[i] <= len(a): val += a[j*arr[i]-1] j += 1 star_val.append(val) a[arr[i]-1] += 1 print(max(star_val))

0.603773

""" Codeforces Contest 264 Div 2 Problem B Author : chaotic_iak Language: Python 3.3.4 """ def main(): n, = read() print(max(read())) ################################### NON-SOLUTION STUFF BELOW def read(mode=2): # 0: String # 1: List of strings # 2: List of integers inputs = input().strip(...

0.603342

def maxval(arr): fn = [float('-inf')]*(len(arr)+1) sn = [float('-inf')]*len(arr) tn = [float('-inf')]*(len(arr)-1) fon = [float('-inf')]*(len(arr)-2) for i in reversed(list(range(len(arr)))): fn[i] = max(fn[i + 1], arr[i]) for i in reversed(list(range(len(arr) - 1))): sn[i] = max...

0.602547

n, t = list(map(int, input().split())) a = [int(x) for x in input().split()] otv = 0 def rec(t, a): nonlocal otv s = 0 for c in a: s += c kol = t // s kol = max(kol, 0) otv += (kol * len(a)) octat = t - kol * s res = [] su = 0 for c in a: if su + c <= octat: res.append(c) su += c if su == 0: pr...

0.602503

n = int(input()) arr = list(map(int, input().split())) arr.sort() arr = arr[::-1] ans = [arr[0]] for i in range(1, n): if(arr[i] < ans[-1]): ans.append(arr[i]) else: ans.append(max(0, ans[-1] - 1)) print(sum(ans))

0.602391

n=int(input()) a=list(map(int,input().split())) tmp=0 ca=[0] for ai in a: tmp+=ai ca.append(tmp) from bisect import bisect_right,bisect_left ans=float('inf') # 数列をまず半分に区切る。左i個と右n-i個 2<=i,n-i f,g=1,3 for i in range(2,n-1): while abs(ca[i]-ca[f]-ca[f])>abs(ca[i]-ca[f+1]-ca[f+1]): f+=1 while abs((ca[-1]-ca[g]...

0.602146

from heapq import heappush, heappop N = int(input()) A = [int(a) for a in input().split()] for i in range(N): if A[i] < 0: k = i break A = [0] + [0 if i < k else A[i] for i in range(N) if i != k] ans = A.pop() H = [] while N > 2: N //= 2 for i in range(N): heappush(H, A.pop()) a...

0.602109

import sys input = sys.stdin.readline q=int(input()) for testcase in range(q): n=int(input()) A=sorted(set(map(int,input().split())),reverse=True) L=len(A) #print(A) ANS=A[0] for i in range(L): NOW0=A[i] NOW1=0 flag=0 for j in range(i+1,L): if NOW0%...

0.60152

# Python3 program to count inversions using # Binary Indexed Tree # Returns sum of arr[0..index]. This function # assumes that the array is preprocessed and # partial sums of array elements are stored # in BITree[]. def getSum( BITree, index): sum = 0 # Initialize result # Traverse anc...

0.601445

import sys readline = sys.stdin.readline from collections import Counter def getpar(Edge, p): N = len(Edge) par = [0]*N par[0] = -1 par[p] -1 stack = [p] visited = set([p]) while stack: vn = stack.pop() for vf in Edge[vn]: if vf in visited: con...

0.600877

from itertools import combinations def closest_sum(ints, num): return sum(min(combinations(ints, 3), key=lambda a: abs(num - sum(a))))

0.600742

def target_game(values): a = b = 0 for n in values: a, b = b, max(a + n, b) return max(a, b)

0.600717

rooms=int(input()) money=list(map(int,input().split())) keys=int(input()) rev=-1 a,b=0,-1 tot=[] #print(money[-3:-1]) x=0 for i in range(keys): #print(money[b:-1],money[0:a]) x=sum(money[b:])+sum(money[0:keys-abs(b)]) tot.append(x) b-=1 print(max(tot))

0.600389

n = int(input()) a = list(map(int, input().split())) cutoff = 15 for x in a: if x > cutoff: break cutoff = x + 15 print(min(90, cutoff))

0.600044

class Solution: def maxSubArray(self, nums): """ :type nums: List[int] :rtype: int """ # i = 0 # i_keep = 0 # j = 1 # j_keep = 1 # max_sum = nums[0]-1 # while j < len(nums) and i < j: # temp_sum = sum(nums[i:j]) ...

0.599914

n=int(input()) l=list(map(int,input().split())) ans=l[0]+l[n-2] for i in range(n-2): ans+=min(l[i],l[i+1]) print(ans)

0.599913

import sys input = sys.stdin.readline def main(): n, m, k = map(int, input().split()) half = m // 2 se_s = [] for i in range(n): lst = list(map(int, input().split())) lst.sort(reverse = True) total_sub = sum(lst[:half]) dp = [[0 for _ in range(k)] for _ in range(half + 1...

0.599551

def fish(shoal): eaten, size, target = 0, 1, 4 for f in sorted(map(int, shoal)): if f > size: break eaten += f if eaten >= target: size += 1 target += 4 * size return size

0.598246

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.59807

n=int(input()) a=list(map(int,input().split())) print(n*max(a)-sum(a))

0.597699

for t in range(int(input())): l1=list(map(int,input().split())) l2=list(map(int,input().split())) l3=list(map(int,input().split())) max=0 g=l1[0]+l2[0]+l3[0] y=l1[1]+l2[1]+l3[1] r=l1[2]+l2[2]+l3[2] if g%2==0: g-=1 if y%2==0: y-=1 if r%2==0: r-=1 if max<g: max=g if max<r: max=r i...

0.597059

n = int(input()) nums = [int(x) for x in input().split()] ans = 10 ** 12 for idx, num in enumerate(nums): dist = max(idx, n - idx - 1) curr = num // dist ans = min(ans, curr) print(ans)

0.596956

import sys input = sys.stdin.readline from bisect import bisect_right bin_s = [1] while bin_s[-1] <= 10 ** 9: bin_s.append(bin_s[-1] * 2) def main(): n, q = map(int, input().split()) alst = list(map(int, input().split())) dp = [[-1, -1] for _ in range(n)] dp[0] = [alst[0], 0] for i, a in enum...

0.596494

def main(): input() aa = sorted(map(int, input().split())) maxa = max(aa) m = [False] * (maxa + 1) x = [] b = 0 for a in aa: if b != a: m[a] = True for i in range(b, a): x.append(b) b = a x.append(b) ans = 0 for i in ran...

0.595901

Given an array arr. You can choose a set of integers and remove all the occurrences of these integers in the array. Return the minimum size of the set so that at least half of the integers of the array are removed. Example 1: Input: arr = [3,3,3,3,5,5,5,2,2,7] Output: 2 Explanation: Choosing {3,7} will make the new ...

from heapq import * from collections import Counter class Solution: def minSetSize(self, arr: List[int]) -> int: counter = Counter(arr) size = len(arr) # unique elements (remove half of them) if len(counter) == size: return (size - 1) // 2 + 1 ...

0.848044

n = int(input()) a = [int(ai) for ai in input().split()] def solve(x): n = len(x) if sorted(x) == x: return n return max(solve(x[:n//2]), solve(x[n//2:])) print(solve(a))

0.699003

input() a = list(map(int, input().split())) b = [] i = j = 0 while i < len(a): while j < len(a) and a[j] == a[i]: j += 1 if (j - i) % 2 == 1: b += [a[i]] i = j - (j - i) // 2 for k in range(i, j): a[k] += 1 print(b[-1] - len(b) + 1)

0.698754

# -*- coding: utf-8 -*- from time import perf_counter from sys import stdin def run(n, s): m = 0 small = n // 2 for big in range(n-1, (n+1)//2-1, -1): while small >= 0 and s[small] > s[big] / 2: small -= 1 if small == -1: break #print(small, big) smal...

0.684334

d, n, t = 0, int(input()), list(map(int, input().split())) p = {a: 0 for a in set(t)} for i in range(n): a = t[i] if not a in p: continue p.pop(a) s = t.count(a) - 1 if 2 * s < d: continue if s > d: d = s k = i + 1 for j in range(k, n): if t[j] == a: for b in set(t[k:...

0.683316

# O(n) time and space # Hashmap and array # Count number then count occurrence: # Count the occurrences of each number using HashMap; # Keep a count of different occurences # From small to big, for each unvisited least frequent element, deduct from k the multiplication with the number of elements of same occurrence, ch...

0.680004

counts = {} rcount = {} input() m = 0 for i, x in enumerate(map(int, input().split())): if x in counts: rcount[counts[x]].remove(x) if not rcount[counts[x]]: del rcount[counts[x]] counts[x] += 1 if counts[x] not in rcount: rcount[counts[x]] = set() rcount[counts[x]].add(x) else: counts[x] = 1 if 1 ...

0.676379

class Solution: def isvalid(self,C): if len(C)>2: return False if len(C)==1: a = min(C) if a==1 or C[a]==1: # EXPLANATION: # a==1 : All lengths are unitary like A=[1,2,3,4,...], so poping anything is fine # C[a...

0.675993

from collections import defaultdict maxn = 2000000000 mk = [] bs = 1 while bs <= maxn: mk.append(bs) bs *= 2 n = int(input()) ls = [int(i) for i in input().split()] dic = defaultdict(int) for i in ls: dic[i] += 1 cnt = 0 for i in ls: dic[i] -= 1 flag = False for j in mk: if dic[j - ...

0.673239

from collections import Counter n = int(input()) a = [int(_) for _ in input().split()] f = Counter(a) N = 10 ** 5 + 10 p = [0 for i in range(N)] ans = Counter() for i in range(2, N): if p[i]: continue for j in range(i, N, i): p[j] = 1 ans[i] += f[j] print(max(1, ans.most_common(1)[0][1])...

0.672195

mi = lambda: [int(i) for i in input().split()] n = int(input()) t = mi() a = [] v = 0 c = 0 for i in t: if i == v: c += 1 else: if c != 0: a.append(c) c = 1 v = i a.append(c) r = 0 for k in range(1, len(a)): r = max(r, min(a[k - 1], a[k]) * 2) print(r)

0.668755

mod = 1000000007 eps = 10**-9 inf = 10**9 def main(): import sys input = sys.stdin.readline class Bit: def __init__(self, n): self.size = n self.tree = [0] * (n + 1) def sum(self, i): s = 0 while i > 0: s += self.tree[i] ...

0.667429

class Solution: def findShortestSubArray(self, nums): diction = {} for i in nums: if i not in diction: diction[i] = 1 else: diction[i] += 1 degree = max(list(diction.values())) ...

0.663925

def lamps(a): n = sum(1 for i, x in enumerate(a) if x != i % 2) return min(n, len(a) - n)

0.662539

def main(): import sys input = sys.stdin.readline n = int(input()) arr = list(map(int, input().split())) dct = {} for x in arr: dct[x] = 0 i = 0 while i != n and dct[arr[i]] == 0: dct[arr[i]] = 1 i += 1 if i == n: print(0) r...

0.660585

import sys from bisect import * sys.stdin = open('input.txt', 'r') sys.stdout = open('output.txt', 'w') ans=n=int(input()) a=sorted(map(int,sys.stdin.readline().split())) for i in range(n):ans=min(ans,n-bisect_right(a,a[i]*2)+i) print(ans)

0.658204

from collections import Counter def obtain_max_number(arr): c = Counter(arr) while 1: find = next((k for k in c if c[k] > 1), None) if not find:return max(c) c[find] -= 2 c[find*2] = c.get(find*2,0) + 1

0.653467

n=eval(input()) a=list(map(int,input().split())) c=m=0 maxi=max(a) for i in range(n): if a[i]==maxi: c+=1 m=max(c,m) else: c=0 print(m)

0.652758

class Solution: def partitionDisjoint(self, A: List[int]) -> int: biggest = A[0] newbiggest = A[0] lenL = 1 total = 1 for itr in A[1:]: total += 1 if itr < biggest: lenL = total biggest = newbiggest else: ...

0.651472

from collections import defaultdict def calcBinomials(N): nonlocal binom N += 1 binom = [[0]*N for _ in range(N)] for n in range(N): binom[n][0] = binom[n][n] = 1 for k in range(1, n): binom[n][k] = binom[n-1][k] + binom[n-1][k-1] n = int(input()) a = list(map(int, input()....

0.651064

read = lambda: map(int, input().split()) n = int(input()) a = list(read()) was = [0] * (n + 1) bal = ans = 0 for i in a: if was[i]: bal -= 1 else: bal += 1 was[i] = 1 ans = max(ans, bal) print(ans)

0.650636

# cook your dish here n=int(input()) l=[int(i) for i in input().split()] xors=[] for i in range(n): for j in range(i+1,n): xors.append([l[i]^l[j],(i,j)]) xors.sort() #print(xors) upto=[0]*n for i in range(len(xors)): #a=xors[i][0] b,c=xors[i][1][0],xors[i][1][1] upto[c]=max(upto[c],upto[b]+1) #...

0.650013

import sys import math input=sys.stdin.readline #sys.setrecursionlimit(1000000) mod=int(1000000007) i=lambda :map(int,input().split()) n=int(input()) a=[int(x) for x in input().split()] t=[[0]*21 for i in range(300005)] for i in range(n): t[i][0]=a[i] def build(n): for j in range(1,20): for i in rang...

0.643955

n = int(input()) a = list(map(int, input().split())) maxi = 0 ans = 0 for i in range(n): a[i] -= 1 maxi = max(maxi, a[i]) if maxi == i: ans += 1 print(ans)

0.641618

n = int(input()) a = list(map(int, input().split())) MAX = 10 ** 6 + 5 cnt = [0] * MAX ok = [True] * MAX for x in a: cnt[x] += 1 ans = 0 for i in range(1, MAX): if cnt[i] > 0: for j in range(i * 2, MAX, i): ok[j] = False if ok[i] and cnt[i] == 1: ans += 1 print(ans...

0.640586

from collections import defaultdict def fix_progression(arr): res = 0 for i in range(len(arr)): D = defaultdict(int) for j in range(i): q, r = divmod(arr[i]-arr[j], i-j) if not r: D[q] += 1 res = max(res, D[q]) return len(arr)-res-1

0.637557

n = int(input()) a = [int(x) for x in input().split()] l = [0] * (10**6 + 100) for x in a: l[x] += 1 cur = 0 ans = 0 for x in l: cur += x if cur % 2: ans += 1 cur //= 2 print(ans)

0.636501

from bisect import bisect_right def main(): n = int(input()) a = [int(input()) for _ in range(n)] a.reverse() lis = [a[0]] for i in range(1, n): if a[i] >= lis[-1]: lis.append(a[i]) else: lis[bisect_right(lis, a[i])] = a[i] print((len(lis))) def __star...

0.635397

def lis(a): b = [] for c in a: # if len(b) == 0 or c > b[-1] if len(b) == 0 or c > b[-1]: b.append(c) else: l = 0 r = len(b) while l < r-1: m = l+r>>1 # if b[m] <= c: l = m if b[m] < c: l = m ...

0.635283

n, _q = map(int, input().split()) mni = [-1] * 200001 mxi = [-1] * 200001 cnt = [0] * 200001 nd = 0 a = list(map(int, input().split())) for i, v in enumerate(a): if mni[v] == -1: mni[v] = i; nd += 1 mxi[v] = i cnt[v] += 1 r = 0 z = 0 currmax = 0 for i, v in enumerate(a): if i == mni[v]: z += 1 if i ...

0.634642

x=int(input()) l=list(map(int, input().split(' '))) l.sort() a=1 for i in l: if i>=a: a+=1 print(a)

0.633037

class Solution: def minCostToMoveChips(self, position: List[int]) -> int: d = {} a = 0 b = 0 for i in position: if i not in d: d[i]=1 else: d[i]+=1 for i in d: if i%2==0: a +=d[i] ...

0.632758

class Solution: def majorityElement(self, nums): """ :type nums: List[int] :rtype: int """ n=len(nums) if n==1 : return nums[0] if n%2 : find = set(nums[0:(n//2)+1]) & set(nums[n//2:]) else: find = set(nu...

0.632062

n = int(input()) ar = list(map(int,input().split(' '))) ar.sort() s=[] for i in ar: s.sort(reverse=True) for j in range(len(s)): if i>=s[j]: s[j]+=1 break else: s.append(1) print(len(s))

0.630868

from collections import defaultdict n = int(input()) A = [int(x) for x in input().split()] D = defaultdict(int) for a in A: D[a] += 1 S = set(D.keys()) ans = len(S) - 1 while S: for k in D: D[k] -= 1 if D[k] <= 0 and k in S: S.remove(k) ans += len(S) - 1 print(ans + 1)

0.630145

n=int(input()) C=[0]+list(map(int,input().split())) #n=5000 #C=list(range(n+1)) A=[] for i in range(1,n+1): if C[i]!=C[i-1]: A.append(C[i]) L=len(A) DP=[[[0]*L for i in range(L)] for j in range(2)] #左の色に揃える or 右の色に揃える,左からi～j番目を def color(r,i,j):#i<j if r==1: if A[i]==A[j]: DP[r][...

0.629553

def duplicates(arr): return sum(arr.count(i)//2 for i in set(arr))

0.629053

n=int(input()) a=list(map(int,input().split())) b=0 a[1:]=sorted(a[1:]) while a[0]<=a[-1]: a[-1]-=1 a[0]+=1 b+=1 a[1:]=sorted(a[1:]) print(b)

0.628905

n = int(input()) mas = list(map(int, input().split())) dist = set([0]) res = 1 for i, e in enumerate(mas): time = i + 1 if e in dist: dist.remove(e) else: res += 1 dist.add(time) print(res)

0.626091

# cook your dish here n=int(input()) lst=list(map(int,input().split())) dict1={}.fromkeys(lst,0) for key in lst: dict1[key]+=1 sum1=0 for key in dict1: sum1+=dict1[key]//2 if(dict1[key]%2==1): sum1+=1 print(sum1)

0.626086

n = int(input()) A = list(map(int, input().split())) for i in range(n): A[i] %= 2 print(min(n - A.count(0), A.count(0)))

0.626023

n=int(input()) arr=[int(x) for x in input().split()] l=[1]*n if sorted(arr)==arr: print('0') else: for i in range(0,len(arr)): for j in range(i): if arr[i]>=arr[j] and l[i]<l[j]+1: l[i]=l[j]+1 print(n-max(l))

0.62602

n = input() v = list(map(int, input().split())) best = 1 current = 1 for i in range(1, len(v)): if v[i-1] <= v[i]: current += 1 else: current = 1 best = max(best, current) print(best)

0.625711

n = int(input()) d = list(map(int, input().split())) s = {i:0 for i in set(d)} for i in d: s[i] += 1 print(max(s.values()))

0.624354

class Solution: def minOperations(self, nums: List[int]) -> int: return sum(bin(x).count('1') for x in nums)+len(bin(max(nums)))-3

0.623864

def main(): n, l = int(input()), list(map(int, input().split())) if not (n & 1): l.append(0) l.append(150001) i, b, c, fails0, fails1 = 0, 0, 150001, [], [] try: while True: a, b, c = b, c, l[i] if a >= b or b <= c: if len(fails0) + len(fails1)...

0.623131

n = int(input()) d = list(map(int, input().split())) s = {i:0 for i in [1, 2]} for i in d: s[i] += 1 if s[2] >= s[1]: print(s[1]) else: print(s[2] + (s[1] - s[2]) // 3)

0.623127

n = int(input()) a = list(map(int, input().split())) ans = [1] t = 1 for i in range(n - 1): if a[i + 1] / a[i] <= 2: t += 1 else: t = 1 ans.append(t) print(max(ans))

0.622805

n = int(input()) C = list(map(int, input().split())) dp = [[0]*n for _ in range(n)] for i in range(n) : dp[i][i] = 1 for i in range(n-2, -1, -1) : for j in range(i+1, n) : dp[i][j] = 1 + dp[i+1][j] if C[i] == C[i+1] : dp[i][j] = min( dp[i][j], 1 + (dp[i+2][j] if i+2 < n else 0) ) for k...

0.622661

n = int(input()) a = list(map(int, input().split())) b = [] for i in range(len(a)): b.append(a[i]) for i in range(len(a)): b.append(a[i]) q = 0 r = set() for i in b: if i: q += 1 else: r.add(q) q = 0 print(max(r))

0.62237

class Solution: def findSpecialInteger(self, arr: List[int]) -> int: count = 0 num = arr[0] for x in arr: if x == num: count = count+ 1 elif x != num and ((count / len(arr))>0.25): return num else: num = x ...

0.621843

def check(l,n): m = 0 for i in range(n-1): x = l[i] c = 0 j = i while (j+2<n and l[j+2]==x) or (j+1<n and l[j+1] == x): if l[j+1] == x: j = j+1 else: j+=2 c+=1 if m<c: m = c return m t = ...

0.619335

def mi(): return map(int, input().split()) from collections import Counter n = list(mi())[0] a = Counter(list(mi())) ma= -1 for i in a: if a[i]>ma: ma = a[i] print (ma)

0.619245

n = int(input()) nums = (abs(int(x)) for x in input().split()) nums = list(sorted(nums)) left = 0 right = 0 ans = 0 while left < n: while right < n and nums[right] <= 2 * nums[left]: right += 1 ans += right - left - 1 left += 1 print(ans)

0.619228

class Solution: def longestSubarray(self, nums: List[int]) -> int: if not 0 in nums: return len(nums) - 1 ans = 0 tot = 0 prev = 0 for n in nums: if n == 1: tot += 1 else: ans = max(tot+prev, ans) ...

0.61855

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ cnt, sm, ism = 0, 0, 0 for i, num in enumerate(arr): sm += num ism += i if sm == ism: cnt += 1 return cnt

0.618083

n = int(input()) a = [int(x) for x in input().split()] alive = 0 left = n for i in range(n - 1, -1, -1): if i < left: alive += 1 left = min(left, i - a[i]) print(alive)

0.617585

n = int(input()) mass = list(map(int, input().split())) left = [1] * n right = [1] * n for i in range(1, n): if mass[i] > mass[i - 1]: left[i] = left[i - 1] + 1 for i in range(n - 2, -1, -1): if mass[i] < mass[i + 1]: right[i] = right[i + 1] + 1 mx = 1 for i in range(n): if i == 0: m...

0.617258

t = {} for i, c in enumerate(input()): if c not in t: t[c] = (i, 1) elif (t[c][0] - i) & 1: t[c] = (i, t[c][1] + 1) print(max(b for a, b in t.values()))

0.616649

class Solution: def findLHS(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums) ret = 0 for i in count: if i+1 in count: ret = max(ret, count[i]+count[i+1]) return ret...

0.616484

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools sys.setrecursionlimit(10**7) inf = 10**20 eps = 1.0 / 10**10 mod = 10**9+7 dd = [(-1,0),(0,1),(1,0),(0,-1)] ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)] def LI(): return list(map(int, sys.stdin.readline().spli...

0.615998

input() memory = list(map(int, input().split())) proc_data = {p: (-1, -1) for p in memory} for i, c in enumerate(memory): d1, d2 = proc_data[c] if d1 == -1: d1 = i d2 = i proc_data[c] = (d1, d2) try: del proc_data[0] except KeyError: print("0") return data = list(proc_data.values()) data.sor...

0.615934

class Solution: def findLengthOfShortestSubarray(self, arr: List[int]) -> int: n = len(arr) if n<=1: return 0 l,r = n,-1 for i in range(1,n): if arr[i]<arr[i-1]: l = i break # monotonicially increasing ...

0.615316

#!/usr/bin/env python3 n = int(input()) a = [int(x) for x in input().split()] sorted_a = sorted(a) dict_a = {} for x in a: if not x in dict_a: dict_a[x] = 1 else: dict_a[x] += 1 sorted_uniq_a = sorted(dict_a.keys()) max_fib_prefix = [a[0], a[1]] for i in range(0, len(sorted_uniq_a)): for...

0.614601

n=int(input()) p=list(map(int,input().split())) c=1 q=p[0] for i in range(1,n): q=min(q,p[i]) if p[i]<=q: c+=1 print(c)

0.613987

# -*- coding: utf-8 -*- """ Created on Sun Apr 2 22:42:34 2017 @author: Sean38 """ n = int(input().rstrip()) s = input() a = [int(ch) for ch in s.split()] a = a[0:n] a.sort() def check_num(p, i): # i = ap + b(p+1) # min(a+b) <=> max(b) # b(p+1) <= i # b == i (mod p) max_b = (i // (p + 1)) b...

0.613705

#!/usr/bin/env python3 from collections import Counter n = int(input()) h_u = tuple(map(int, input().split())) h_s = sorted(h_u) i = 0 a = Counter() b = Counter() num_partitions = 0 for i in range(n): a[h_u[i]] += 1 b[h_s[i]] += 1 if (a == b): num_partitions += 1 a = Counter() b = Counter() pri...

0.613284

class Solution: def minMoves2(self, nums): """ :type nums: List[int] :rtype: int """ aa = sorted(nums) median = aa[len(nums)//2] return sum([abs(i-median) for i in aa])

0.612882

n = int(input()) a = list(map(int, input().split())) dp = [[False] * (n + 1) for i in range(n + 1)] def solve(l, r): if dp[l][r]: return dp[l][r] if r - l == 1: dp[l][r] = (a[l], 1) return dp[l][r] tmp = 10 ** 9 for i in range(l + 1, r): if solve(l, i)[0] == -1 or solve...

0.611841

class Solution: def maxDistToClosest(self, seats: List[int]) -> int: ans = 0 for seat, group in itertools.groupby(seats): if not seat: k = len(list(group)) ans = max(ans, (k+1)//2) return max(ans, seats.index(1),seats[::-1].index(1))

0.611759

import bisect; def getIntList(): return list(map(int, input().split())); def getTransIntList(n): first=getIntList(); m=len(first); result=[[0]*n for _ in range(m)]; for i in range(m): result[i][0]=first[i]; for j in range(1, n): curr=getIntList(); for i in range(m): ...

0.609509

class Solution: def minIncrementForUnique(self, A: List[int]) -> int: if not A: return 0 A.sort() prev = A[0] res = 0 for num in A[1:]: if num <= prev: prev += 1 res += prev-num else: ...

0.609154

n=int(input()) vec=list(map(int,input().split())) al=[] otrez=[] for x in vec: if len(al)==0: al.append(x) elif(x<=al[-1]): otrez.append(al) al=[x] else: al.append(x) otrez.append(al) maxx=0 if(len(otrez)!=1): for i in range(0,len(otrez)-1): if(len(otrez[i])==1)or...

0.60819

class Solution: def numTimesAllBlue(self, light: List[int]) -> int: right = 0 ans = 0 for i in range(len(light)): if (light[i] > right): right = light[i] if (i + 1 == right): ans += 1 return ans

0.606384

def solve(a): seen = set() for i in range(len(a)): c = 0 for j in range(i+2,len(a)): c += a[j-1] if a[i]^a[j] == c: seen.add((i,j)) if c >= 2*a[i]: break for i in range(len(a)-1,-1,-1): c = 0 for j in ra...

0.605845

def prog(): n = int(input()) inp = list(map(int,input().split())) ans = 0 for i in range(len(inp)): x,y = 0 ,0 for j in range(i,len(inp)): x+=inp[j] y+=100 if(x>y): ans = max(ans,(j-i)+1) print(ans) prog()

0.603979

def dominator(arr): for x in set(arr): if arr.count(x) > len(arr)/2.0: return x return -1

0.603009

import collections N=int(input()) L=list(map(int,input().split())) L=sorted(L) C=collections.Counter(L) D=list(C.keys()) E=list(C.values()) K=len(C) ans=0 for i in range(K): if D[i]==E[i]: ans+=0 if D[i]>E[i]: ans+=E[i] if D[i]<E[i]: ans+=(E[i]-D[i]) print(ans)

0.602762

n=int(input()) arr=list(map(int,input().split())) arr=sorted(arr) s=set() for val in arr: if val!=1 and val-1 not in s: s.add(val-1) elif val not in s: s.add(val) elif val+1 not in s: s.add(val+1) print(len(s))

0.602541

n = int(input()) a = list(map(int,input().split())) m = max(a) current = 0 longest = 0 for x in a: if x == m: current +=1 else: longest = max(current,longest) current = 0 longest = max(current,longest) print (longest)

0.602339

n=int(input()) l=[0]*n for i in range(n): l[i]=int(input()) l.sort() s=0 i=n-1 while i>=0: x=2*l[i] if l[-1]>=x: j=i while j<len(l): if l[j]>=x: l.pop(j) l.pop(i) s+=1 break j+=1 i-=...

0.600639

def f(n): s = list(map(int, input().split())) low = [] high = [] for i in range(n - 1): low.append(min(s[i], s[i+1])) high.append(max(s[i], s[i+1])) low.sort() high.sort() curr = mx = 0 i = j = 0 n -= 1 while i < n and j < n: if low[i] < high[j]: i += 1 curr += 1 else: j += 1 curr -= 1 ...

0.599745

N = int(input()) ds = [] mochidan = 0 for i in range(N): ds.append(int(input())) while ds: tmp = max(ds) ds = [j for j in ds if j < tmp] mochidan += 1 print(mochidan)

0.599521

from collections import Counter n = int(input()) a = list(map(int, input().split())) c = Counter(a) res = 0 cur = 0 for i in sorted(c.keys()): d = min(c[i], cur) cur -= d res += d cur += c[i] print(res)

0.599174

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ res = 0 temp = sorted(arr) sum1, sum2 = 0, 0 for i in range(0,len(arr)): sum1 += arr[i] sum2 += temp[i] if(sum1 =...

0.598122

n = int(input()) a = 0 b = 0 for x in input().split(): x = int(x) if x % 2 == 0: a += 1 else: b += 1 res = b if a < b: res = a + (b-a)//3 print(res)

0.597622

N, I = list(map(int, input().split())) A = sorted([int(a) for a in input().split()]) B = [] j = 0 for i in range(N): if i == 0 or A[i] == A[i-1]: B.append(j) else: j += 1 B.append(j) def calc(k): K = 1<<k i = 0 j = 0 ma = 0 while j < N: if B[j]-B[i] <= K - 1:...

0.597248

# cook your dish here n=int(input()) arr=[int(x) for x in input().split()] ans=n-1 while(ans>0 and arr[ans]==arr[ans-1]):ans-=1 print(ans+1)

0.597156

from sys import stdin from heapq import heappop, heappush, heapify def main(): n = int(stdin.readline()) a = stdin.readline().split() q = [] p = 0 c = 0 l = [0] * (n + 1) r = [0] * (n + 1) k = [0] * (n + 1) pa = [0] * (n + 1) for i, x in enumerate(a): if x == a[p]: ...

0.596562

n = int(input()) sweets = [int(x) for x in input().strip().split(" ")] dict = {} for i in range(n - 1): for j in range(i + 1, n): sum = sweets[i] + sweets[j] if sum in dict: dict[sum] += 1 else: dict[sum] = 1 print(max(dict.values()))

0.596236

def main(): n = int(input()) arr = sorted(map(int, input().split())) j = 1 for x in arr: if x >= j: j += 1 print(j - 1) return 0 main()

0.593867

n = int(input()) a = list(map(int, input().split())) mx, cnt = 1, 1 for i in range(1, n): if a[i] > a[i - 1]: cnt += 1 else: cnt = 1 mx = max(mx, cnt) print(mx)

0.59253

n = int(input()) a = list(map(int,input().split())) cnt = 0 for i in range(n): while True: if a[i]%2==0: a[i]=a[i]//2 cnt +=1 else: break print(cnt)

0.59194

# class Solution: # def specialArray(self, nums: List[int]) -> int: # nums.sort(reverse=True) # left, right = 0, len(nums) # while left < right: # mid = left + (right - left) // 2 # if mid < nums[mid]: # left = mid + 1 # else: # ...

0.591555

n = int(input()) A = list(map(int, input().split())) A.sort() i = 0 j = 0 ans = 0 while j < len(A): ans = max(ans, j - i) if i == j or A[j] - A[i] <= 5: j += 1 else: i += 1 print(max(ans, j - i))

0.591527

class Solution: def oddEvenJumps(self, A: List[int]) -> int: def findNextHighestIdx(B: List[int]) -> List[int]: next_idx_list = [None] * len(B) stack = [] for i in B: while stack and stack[-1] < i: next_idx_list[stack.pop()] = i ...

0.591232

import sys def solve(): n = int(sys.stdin.readline()) a = [0] + [int(i) for i in sys.stdin.readline().split()] dp = [[0]*(n + 1) for i in range(n + 1)] ans = 0 maxnum = [0] * (10**5 + 2) maxmod = [0] * 7 for y in range(n + 1): maxmod = [0] * 7 for ai in a: ma...

0.590977

n = int(input()) a = [int(x) for x in input().split()] a.sort() num = 0 res = 0 for i in range(n): if int(a[i]) >= num: res += 1 num += int(a[i]) #print(res, a[i]) print(res)

0.590909

def dp(): dparr = [0] * len(sections) for i in range(len(sections) - 1, -1, -1): _, curend, curcomfort = sections[i] nextsection = i + 1 try: while sections[nextsection][0] <= curend: nextsection += 1 except IndexError: # Loop til end inc = curcomfort else: inc = curcomfort + dparr[nextsecti...

0.590893

def ii(): return int(input()) def mi(): return map(int, input().split()) def li(): return list(mi()) n = ii() a = li() ans = 0 cnt = [0] * (10 ** 5 + 10) cur = set() for ai in a: cnt[ai] = len(cur) cur.add(ai) ans = sum(cnt) print(ans)

0.589867

class Solution: def totalFruit(self, tree: List[int]) -> int: prior_fruit = tree[0] prior_fruit_counter = 0 fruits_in_basket = [tree[0]] fruits_in_basket_counter = 0 max_fib = -1 for fruit in tree: if prior_fruit == fruit: prior_fruit_coun...

0.589823

Given an array of integers nums and a positive integer k, find whether it's possible to divide this array into k non-empty subsets whose sums are all equal. Example 1: Input: nums = [4, 3, 2, 3, 5, 2, 1], k = 4 Output: True Explanation: It's possible to divide it into 4 subsets (5), (1, 4), (2,3), (2,3) with equal su...

class Solution: def canPartitionKSubsets(self, nums, k): """ :type nums: List[int] :type k: int :rtype: bool """ target,rem=divmod(sum(nums),k) if rem or max(nums)>target: return False n=len(nums) seen=[0]*n nums.sort(reverse...

0.794403

class Solution: def isPossibleDivide(self, s: List[int], k: int) -> bool: if len(s) % k != 0: return False ctr = collections.Counter(s) for _ in range(len(s) // k): mn = [] for i in ctr: if mn == [] and ctr[i] > 0: ...

0.757581

class Solution: def checkSubarraySum(self, nums, k): """ :type nums: List[int] :type k: int :rtype: bool """ if k==0: j=0 for i in range(0,len(nums)): if nums[i]==0: if j<i: ...

0.718633

# Calculate the prefix sum and count it. # In c++ and java, a % K + K takes care of the cases where a < 0. # Python class Solution: def subarraysDivByK(self, A, K): res = 0 prefix = 0 count = [1] + [0] * K for a in A: prefix = (prefix + a) % K res += count[p...

0.706854

class Solution: def canArrange(self, arr: List[int], k: int) -> bool: freq = [0] * k for n in arr: freq[n%k] += 1 if freq[0] % 2: return False for i in range(1, (k//2)+1): if freq[i] != freq[k-i]: return False if k%2 is 0: ...

0.668491

class Solution: def subarraySum(self, nums, k): """ :type nums: List[int] :type k: int :rtype: int """ dic = {} numSum = 0 dic[0] = 1 ans = 0 for i in range(len(nums)): numSum += nums[i] if...

0.664669

def array_equalization(a, k): totals, ends = {}, {} for i, n in enumerate(a): if n not in ends: totals[n], ends[n] = 0, -1 if i < ends[n]: continue count = (i - ends[n] - 1 + k - 1) // k totals[n] += count ends[n] = max(i, ends[n] + count * k) return min(t + (len(a) -...

0.649863

class Solution: def canPartition(self, nums): """ :type nums: List[int] :rtype: bool """ _sum=sum(nums) div,mod=divmod(_sum,2) if mod!=0: return False target=[div]*2 self._len=len(nums) nums.sort(reverse=True) ...

0.616012

import sys import random from fractions import Fraction from math import * def input(): return sys.stdin.readline().strip() def iinput(): return int(input()) def finput(): return float(input()) def tinput(): return input().split() def linput(): return list(input()) def rinput(): return ...

0.615275

class Solution: def splitArraySameAverage(self, A): N, S = len(A), sum(A) if N == 1: return False A = [z * N - S for z in A] mid, left, right = N//2, {A[0]}, {A[-1]} if not any((S*size) % N == 0 for size in range(1, mid+1)): return False for i in range(1, mid): le...

0.608428

# O(n) time and space # Hashmap and array # Count number then count occurrence: # Count the occurrences of each number using HashMap; # Keep a count of different occurences # From small to big, for each unvisited least frequent element, deduct from k the multiplication with the number of elements of same occurrence, ch...

0.606546

def isSubsetSum(arr, n, sum): subset = [ [False for j in range(sum + 1)] for i in range(3) ] for i in range(n + 1): for j in range(sum + 1): if (j == 0):subset[i % 2][j] = True elif (i == 0):subset[i % 2][j] = False elif (arr[i - 1] <= j):subset[i % 2][j] = sub...

0.602807

class Solution: def findPairs(self, nums, k): """ :type nums: List[int] :type k: int :rtype: int """ # import collections # unique_nums = set(nums) # count = 0 # new_nums = collections.Counter(nums) # if k == 0: # ...

0.602062

class Solution: def canThreePartsEqualSum(self, A: List[int]) -> bool: # if len(A)<3: # return # i = 1 # j = len(A)-2 # tgtsum = sum(A)/3 # sum1 = sum(A[:i]) # while i<(len(A)-2) and sum1!=tgtsum: # sum1 = sum1 + A[i]...

0.600782

from itertools import combinations def solve(a, n): return any(sum(c) % n == 0 for i in range(len(a)) for c in combinations(a, i+1))

0.592058

import math n, k = map(int, input().split()) a = list(map(int, input().split())) now = [-1] * k t = [0] * k nxt = 0 m = 0 intr = [False for i in range(n)] while m < n: for i in range(k): if now[i] != 1005 and (now[i] == -1 or t[i] == a[now[i]]): if now[i] != -1: m += 1 ...

0.578027

class Solution: def makesquare(self, nums): """ :type nums: List[int] :rtype: bool """ if len(nums) < 4: return False length = sum(nums) if length % 4: return False length = (int) (length / 4) ...

0.574611

class Solution: def kLengthApart(self, nums: List[int], k: int) -> bool: if nums.count(0) == len(nums): return True idx = nums.index(1) ctr = 0 for num in nums[idx+1:]: if num == 1: if ctr < k: return False...

0.573079

class Solution: def containsNearbyAlmostDuplicate(self, nums, k, t): """ :type nums: List[int] :type k: int :type t: int :rtype: bool """ if len(nums) < 2 or k <= 0 or t < 0: return False if t == 0: visited = set() fo...

0.571434

class Solution: def containsNearbyDuplicate(self, nums, k): """ :type nums: List[int] :type k: int :rtype: bool """ s=set(nums) if len(s)==len(nums):return False d=dict() for num in nums: d[num]=d.get(num,0)+1 fo...

0.570959

class Solution: def findTargetSumWays(self, nums, S): """ :type nums: List[int] :type S: int :rtype: int """ c = [0]*1001 c[0] = 1 T = sum(nums) A = T+S if T<S or A&1: return 0 A>>=1 nums = sort...

0.568709

from collections import deque class Solution: def constrainedSubsetSum(self, nums, k): N, queue = len(nums), deque() dp = [val for val in nums] for i, val in enumerate(nums): if queue and (i - queue[0] > k): queue.popleft() if queue and dp[queue[0]] > ...

0.565155

def f(k,n): a = [] for i in range(0,n+1): if i < k: a += [i+1] else: a += [a[-1] + a[i//k]] return a[-1]

0.554929

class Solution: def maxSumAfterPartitioning(self, arr, k): res = [0] for idx, val in enumerate(arr): max_val, cur_val = 0, 0 for i in range(max(0, idx-k+1), idx+1)[::-1]: if arr[i] > max_val: max_val =...

0.550101

import itertools def choose_best_sum(t, k, ls): try: return max(sum(i) for i in itertools.combinations(ls,k) if sum(i)<=t) except: return None

0.541669

from collections import defaultdict class Solution: def subarraysWithKDistinct(self, A: List[int], K: int) -> int: start_k = 0 start = 0 elem_dict = defaultdict(int) ans = 0 for elem in A: elem_dict[elem] += 1 if...

0.541453

def divisible_count(x,y,k): return y//k - (x-1)//k

0.539684

class Solution: def minSubArrayLen(self, k, nums): """ :type k: int :type nums: List[int] :rtype: int """ if not nums: return 0 _min = float('inf') _sum = 0 j = 0 for i ,n in enumerate(nums): _su...

0.534796

class Solution: def numOfSubarrays(self, arr: List[int], k: int, threshold: int) -> int: if len(arr) < k: return 0 bar = k * threshold total = 0 window = sum(arr[:k]) if window >= bar: total += 1 for i in range(k, len(arr)): window ...

0.53099

import math as ma import sys from decimal import Decimal as dec from itertools import permutations def li(): return list(map(int , input().split())) def num(): return map(int , input().split()) def nu(): return int(input()) t=nu() for it in range(t): k=nu() a=li() s=sum(a) zz=[] for i in range(7): pp=...

0.528878

class Solution: def largestSumOfAverages(self, A: List[int], K: int) -> float: #if not A: return 0 #if len(A)==1: return A[0] # Real Run Time is a little bit UNSTABLE N = len(A) P = [0] * (N+1) for i in range(1,N+1): P[i] = P[i-1] + A[i-1] # Table[a] ...

0.528238

from itertools import islice, count def u1(): a = {1:1, 2:1} yield a[1] yield a[2] for n in count(3): a[n] = a[n-a[n-1]] + a[n-a[n-2]] yield a[n] def length_sup_u_k(n, k): return len(list(filter(lambda x: x >= k, islice(u1(), 1, n)))) def comp(n): return sum(k1 < k0 fo...

0.528101

class Solution: def numberOfSubarrays(self, nums: List[int], k: int) -> int: # save all even subarray's length which between odds edge = [] res = 0 count = 0 for i in nums: # odd if i % 2: # +1 because range from 0 to count when doing c...

0.526825

class Solution: def hasAllCodes(self, s: str, k: int) -> bool: if len(s) < 2 ** k + k - 1: return False # Cannot be a string, as this is the de brujin length target = 2 ** k seen = set() cur_len = 0 for end in range(k, len(s) + 1): chunk = s[end - k: e...

0.526495

class Solution: def combinationSum4(self, nums, target): """ :type nums: List[int] :type target: int :rtype: int """ cache = {} def f(val): if val == target: return 1 total = 0 remain = target - val ...

0.526145

t = int(input()) for _ in range(t): n, k = list(map(int, input().split())) l = list(map(int, input().split())) d = dict() d[0] = 0 for v in l: vv = (k - v) % k if vv: if vv not in d: d[vv] = vv + 1 else: d[vv] += k prin...

0.525349

n, k = list(map(int, input().split())) A = list(map(int, input().split())) cumsum = [0] for a in A: cumsum.append(cumsum[-1] + a) #print(cumsum) pows = set([k**i for i in range(50)]) cum = dict({}) cum[0] = 1 res = 0 for x in cumsum[1:]: for pow in pows: if (x - pow) in cum: res += cum[x -...

0.524875

class Solution: def kConcatenationMaxSum(self, arr: List[int], k: int) -> int: oneArrSum = sum(arr) twoArr = arr + arr def findMaxSub(array): if len(array) == 1: return array[0] cur = 0 small = 0 ret = -999...

0.523238

from itertools import combinations_with_replacement def find(arr,n): return sum( sum(c) == n for x in range(1,len(arr)+1) for c in combinations_with_replacement(arr, x) )

0.519747

def consecutive_sum(num): upper_limit = 1 while True: if upper_limit * (upper_limit + 1) // 2 > num: break upper_limit += 1 return sum([1 if i % 2 and not num % i else 1 if not i % 2 and num % i == i//2 else 0 for i in range(1, upper_limit)])

0.517024

## ## ## import sys def line(): return sys.stdin.readline() def numbers(): return list(map(int, line().split())) def number(): return int(line()) adjlist = {} n, k = 0, 0 mark = [False]*2010 edges = [False]*1010 # bfs for "ssph" def bfs(s): i = 0 frontier = [s] while frontier: ...

0.514305

import queue class Solution: def containsPattern(self, arr: List[int], m: int, k: int) -> bool: streak = 0 for i in range(len(arr)-m): if arr[i] == arr[i+m]: streak +=1 else: streak = 0 if streak == (k-1)*m: ...

0.513604

class Solution: def mergeStones(self, stones: List[int], K: int) -> int: n = len(stones) if (n - 1) % (K - 1) != 0: return -1 prefix = [0] for s in stones: prefix.append(prefix[-1] + s) @lru_cache(None) def dp(i, j): if j - i + 1 < ...

0.512859

def main(): from sys import stdin k, n = map(int, stdin.readline().split()) a = list(map(int, stdin.readline().split())) b = list(map(int, stdin.readline().split())) res = set() for i in range(k): # putting b[0] on place i our = set() curr = b[0] for j in range(i,...

0.511933

def main(): import sys from collections import defaultdict tokens = [int(i) for i in sys.stdin.read().split()] tokens.reverse() n, k = tokens.pop(), tokens.pop() d1 = defaultdict(int) d2 = defaultdict(int) result = 0 for i in tokens: result += d2[i * k] ...

0.510144

def getInput(): N_k = input().split() N =int(N_k[0]) k =int(N_k[1]) list = [] output = [] count = 0 for i in range(0,k): val = input() if(val!="CLOSEALL"): val=val.split() val = int (val[1]) if val not in list: count= count +1 list.append(val) else: list.remove(val) count= count -...

0.508084

def f(n): Ans = [] d = 2 while d * d <= n: if n % d == 0: Ans.append(d) n //= d else: d += 1 if n > 1: Ans.append(n) return Ans n, k = list(map(int, input().split())) arr = list(map(int, input().split())) m = {} c = 0 for i in arr: r...

0.507782

def p(t,k,n,l=1): if t<l: pass elif k==1 and t!=n: yield [t] else: yield from ([m]+s for m in range(l,t-l+1) for s in p(t-m,k-1,n,m) if m!=n) def part_const(t,k,n): return sum(1 for _ in p(t,k,n))

0.507613

from scipy.special import comb def almost_everywhere_zero(n, k): if k == 0: return 1 first, *rest = str(n) l = len(rest) return 9**k*comb(l, k, exact=True) +\ (int(first)-1)*9**(k-1)*comb(l, k-1, exact=True) +\ almost_everywhere_zero(int("".join(rest) or 0), k-1)

0.506964

def outcome(n, s, k): if n == 1: return 1 if 0 < k <= s else 0 return sum(outcome(n - 1, s, k - j - 1) for j in range(s)) if k > 0 else 0

0.506341

def is_madhav_array(arr): nTerms = ((1+8*len(arr))**.5-1)/2 return (len(arr) > 1 and not nTerms%1 and len({ sum(arr[int(i*(i+1)//2):int(i*(i+1)//2)+i+1]) for i in range(int(nTerms))}) == 1)

0.50462

class Solution: def hasGroupsSizeX(self, deck: List[int]) -> bool: def findGCD(a,b): if b ==0: return a return findGCD(b, a%b) hash_cards = {} for card in deck: if card in hash_cards: hash_cards[card]+=1 ...

0.503964

from math import * from sys import * n, k = map(int, stdin.readline().split(" ")) a = 1; for c in map(int, stdin.readline().split(" ")): a = a * (gcd(k, c)//gcd(a, c)) if a%k == 0: print("Yes") else: print("No")

0.503136

def learn_charitable_game(arr): return sum(arr) % len(arr) == 0 and sum(arr) > 0

0.50015

#Note that it's python3 Code. Here, we are using input() instead of raw_input(). #You can check on your local machine the version of python by typing "python --version" in the terminal. (n, k) = list(map(int, input().split(' '))) ans = 0 for i in range(n): x = int(input()) if x % k == 0: ans += 1 print(ans)

0.499929

# cook your dish here from sys import stdin,stdout a0=0 a1=1 n,k=stdin.readline().strip().split(' ') n,k=int(n),int(k) arr=list(map(int,stdin.readline().strip().split(' '))) def solve(n,k,arr): sol=[] l=0;u=k; while l!=u: sol.append(arr[l:min(len(arr),u)]) l=min(l+k,len(arr)) u=min(u+k,len(arr)) ...

0.497833

# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!! # TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!! # TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!! from sys import stdin, stdout from collections import defaultdict from collections import deque import math import copy #T = int(input()) #N = int(input()) #s1 = input() #s2 = input() N,K = [int(x) for...

0.497387

def is_centered(arr,n): l = int(len(arr)/2) if len(arr)%2==0 else int((len(arr)-1)/2) return any(sum(arr[i:-i])==n for i in range(1, l+1)) or sum(arr)==n

0.497288

from collections import Counter def is_zero_balanced(arr): c = Counter(arr) return bool(arr) and all(c[k] == c[-k] for k in c)

0.49726

import math t = int(input()) for test in range(t): n,k = map(int,input().split()) A = list(map(int,input().split())) A.sort() ans = 0 for i in range(1,n): if(A[i]>k): ans = 0 break rem = k-A[i] ans+=rem//A[0] print(ans)

0.496443

class Solution: def canReach(self, arr: List[int], start: int) -> bool: dq = collections.deque([start]) visited = set([start]) while dq: curr = dq.pop() if arr[curr] == 0: return True ...

0.496065

def solve(n,k): maxGcd = 2*n // (k * (k+1)) for gcd in range(maxGcd, 0, -1): last = n-gcd * k*(k-1)//2 if not last % gcd: return [gcd*x if x != k else last for x in range(1,k+1)] return []

0.495941

from bisect import insort from math import ceil for _ in range(int(input())): n,k=list(map(int,input().split( ))) array=list(map(int,input().split( ))) ans=0 index=[] for i in range(1,n+1): index.append(ceil(k/(ceil(k/i)))) for i in range(n): count=[0]*(2001) temp=[] for j in range(i,n): count[array[j]...

0.495898

# Definition for singly-linked list. # class ListNode(object): # def __init__(self, x): # self.val = x # self.next = None class Solution(object): def splitListToParts(self, root, k): """ :type root: ListNode :type k: int :rtype: List[ListNode] ...

0.495112

class Solution: def canReorderDoubled(self, A: List[int]) -> bool: cache=Counter(A) c_list=sorted(list(cache),key=abs) for x in c_list: if cache[x]>cache[2*x]: return False cache[2*x]-=cache[x] return True

0.4951

def count(a, t, x): return sum(not (t-v)%x if x else t==v for v in a)

0.494673

class Solution: def smallestDistancePair(self, nums, k): """ :type nums: List[int] :type k: int :rtype: int """ nums.sort() l, r = 0, nums[-1] - nums[0] while l < r: m = l + (r - l) // 2 count = 0 ...

0.494638

class Solution: def splitArray(self, nums, m): """ :type nums: List[int] :type m: int :rtype: int """ accum = [0] N = len(nums) mmm = max(nums) if m >= N: return mmm res = 0 for i in nums: r...

0.492544

#!/usr/bin/env python3 [n, k] = list(map(int, input().strip().split())) ais = list(map(int, input().strip().split())) n1 = ais.count(1) one_serie = [0 for _ in range(n)] for i in reversed(list(range(n))): if ais[i] == 1: one_serie[i] = (0 if i == n - 1 else one_serie[i + 1]) + 1 n1_head = 0 count = 0 for i in ...

0.49235

from itertools import permutations for _ in range(int(input())): N,K=list(map(int,input().split())) arr=list(map(int,input().split())) arr1=[] arr2=[] for i in range(1,len(arr)+1): arr1.append(i) indexzero=[] for i in range(0,len(arr)): if(arr[i]==0): indexzero.append(i) else: arr2.append(arr[i]) #...

0.492095

class Solution: def combinationSum3(self, k, n): """ :type k: int :type n: int :rtype: List[List[int]] """ to_return = [] self.backtrack(to_return, [], k, n, 1) return to_return def backtrack(self, to_return, temp, k, n, start): ...

0.490145

import sys import math def main(arr,k): ans=0 for i in range(len(arr)): curr_min=float('inf') for j in range(i,len(arr)): curr_min=min(curr_min,arr[j]) if curr_min==k: ans+=1 return ans n=int(input()) arr=list(map(int,inpu...

0.48973

def find_dup(arr): return sum(arr) - len(arr)*(len(arr)-1)/2 #your code here

0.489489

import sys input = sys.stdin.readline n,k=list(map(int,input().split())) if k==0: print(0) return A=sorted(map(int,input().split())) # DP[UL][n][left] # [left*pow(2,n),left*pow(2,n)+pow(2,n))の間のチームで, # ファンのチームが # UL=0: upperでもlowerでも勝ち残っている # UL=1: upperでのみ勝ち残っている # UL=2: lowerでのみ勝ち残っている # ときの、そこまでのファンのチームの試...

0.488963

def is_onion_array(a): return all(a[i] + a[-i-1] <= 10 for i in range(len(a) // 2))

0.487326

def finding_k(arr): for n in range(max(arr)-1, 0, -1): if len({ x%n for x in arr }) == 1: return n return -1

0.486487

n, k = map(int, input().split()) t = list(map(int, input().split())) if k == 1: print(len(set(t))) else: p = [set() for i in range(30)] for i in t: j = 0 while i % k == 0: i //= k j += 1 p[j].add(i) for j in range(1, 30): p[j] -= p[j - 1] print(sum...

0.484762

def find_dup(arr): return sum(arr) - sum(range(1, max(arr)+1))

0.484347

class Solution: def maxNonOverlapping(self, nums: List[int], target: int) -> int: sum_set = set() sum_set.add(0) temp = 0 count = 0 for num in nums: temp += num if temp - target in sum_set: count += 1 sum_set.clear() ...

0.483907

def productsum(n): pass # Your code here def productsum(kmax): def prodsum2(p, s, c, start): k = p - s + c # product - sum + number of factors if k < kmax: if p < n[k]: n[k] = p for i in range(start, kmax//p*2 + 1): prodsum2(p*i, s+i, c+1, i) ...

0.482697

n, k = [int(i) for i in input().split()] w = [int(i) for i in input().split()] tot = 0 for wi in w: tot += (wi+k-1)//k ans = (tot+1)//2 print(ans)

0.482549

class Solution: def getWinner(self, arr: List[int], k: int) -> int: win=0 curr = arr[0] mx=0 for i in range(1,len(arr)): if arr[i] > curr: curr=arr[i] win=0 win=win+1 ...

0.482144

line=input().split() n=int(line[0]) k=int(line[1]) nums=input().split() for i in range(n): nums[i]=int(nums[i]) firstsum = 0 for i in range(k): firstsum+=nums[i] totsum=firstsum for i in range(n-k): firstsum-=nums[i] firstsum+=nums[k+i] totsum+=firstsum print(totsum/(n-k+1))

0.48194

from itertools import groupby def sum_groups(arr): newarr = [sum(j) for i,j in groupby(arr, key = lambda x: x % 2 == 0)] return len(newarr) if newarr == arr else sum_groups(newarr)

0.481763

def elections_winners(votes, k): m = max(votes) return sum(x + k > m for x in votes) or votes.count(m) == 1

0.48163

import sys def r(): return list(map(int, input().split())) n, k = list(map(int, input().split())) a = r() cnt4 = n cnt2 = 2*n cnt1 = 0 for i in range(k): x = min((a[i]+1)//4, cnt4) cnt4 -= x a[i] = max(0, a[i]-4*x) cnt2 += cnt4 cnt1 += cnt4 for i in range(k): x = min(a[i]//2, cnt2) cnt2 -= x...

0.48159

import numpy as np from numba import njit i8 = np.int64 @njit def solve(a, b, t, K, N): t1 = t // K d = t % K * 2 # b が a から a + d の位置にあれば衝突する x = 0 y = 0 ans = 0 for c in a: while b[x] < c: x += 1 while b[y] <= c + d: y += 1 ...

0.480624

def find_combinations(list, sum): if not list: if sum == 0: return [[]] return [] return find_combinations(list[1:], sum) + \ [[list[0]] + tail for tail in find_combinations(list[1:], sum - list[0])] for tc in range(int(input())): n,k=list(map(int,input().split())) a=list(map(int,input().split())) a.so...

0.480525

from itertools import permutations def solve(s,k): return sum(not v%k for v in map(int, map(''.join, permutations(s.split(),2))))

0.480193

group=lambda arr: [[n]*arr.count(n) for n in sorted(set(arr), key=arr.index)]

0.479965

def est_subsets(arr): return 2**len(set(arr)) - 1

0.479788

# cook your dish here from math import floor, sqrt try:long except NameError:long = int def fac(n): step,maxq,d = lambda x: 1 + (x<<2) - ((x>>1)<<1),long(floor(sqrt(n))),1 q = n % 2 == 0 and 2 or 3 while q <= maxq and n % q != 0: q = step(d) d += 1 return q <= maxq and [q] + fac(n//q) or [n]...

0.479644

def is_keith_number(n): numList = [int(i) for i in str(n)] # int array if len(numList) > 1: # min 2 digits itr = 0 while numList[0] <= n: # replace array entries by its sum: numList[itr % len(numList)] = sum(numList) itr += 1 if n in numList: # ...

0.479634

(n, k) = map(int, input().split()) a = list(map(int, input().split())) a.sort() cur = 0 idx = 0 for i in range(k): ans = 0 while idx < n: ans = a[idx] - cur idx += 1 if ans != 0: break print(ans) cur += ans

0.479258

import sys import heapq as hq readline = sys.stdin.readline ns = lambda: readline().rstrip() ni = lambda: int(readline().rstrip()) nm = lambda: map(int, readline().split()) nl = lambda: list(map(int, readline().split())) eps = 10**-7 def solve(): n, k = nm() a = nl() ans = [0]*n ok = 10**9; ng = -4*...

0.47793

N = int(input()) A = list(map(int,input().split())) from collections import Counter from bisect import bisect vs = list(Counter(A).values()) vs.sort() cums = [0] for v in vs: cums.append(cums[-1] + v) def is_ok(k,m): j = bisect(vs,m) z = cums[j] + m*(len(vs)-j) return z >= m*k ans = [] for k in range(...

0.477176

def solve(nums,div): return [x + x % div for x in nums]

0.476891

#CF Round 150. Div II Prob. A - Dividing Orange import sys In = sys.stdin n, k = [int(x) for x in In.readline().split()] arr, s, cnt = [int(x) for x in In.readline().split()], set(), 1; s.update(arr) for i in range(k): c = [arr[i]] for j in range(n - 1): while (cnt in s): cnt += 1; ...

0.476209

def aks_test(p): lst = [] for i in range(2, p+1): for j in lst: if i % j == 0: break else: lst.append(i) if p in lst: return True else: return False

0.475761

from collections import Counter class Solution: def canConstruct(self, s: str, k: int) -> bool: if k > len(s): #return False return False counter = Counter(s) odd_counts = 0 for char in counter: if counter[char] % 2 == 1: odd_counts +=...

0.475532

# cook your dish here from itertools import accumulate n, k = map(int, input().split()) lst = list(map(int, input().split())) temp = (10**9)+7 for i in range(k): lst = list(accumulate(lst)) for i in lst: print(i%(temp), end = ' ')

0.475404

Given an array of integers A, find the number of triples of indices (i, j, k) such that: 0 <= i < A.length 0 <= j < A.length 0 <= k < A.length A[i] & A[j] & A[k] == 0, where & represents the bitwise-AND operator. Example 1: Input: [2,1,3] Output: 12 Explanation: We could choose the following i, j, k triples: (i=0, ...

class Solution: def countTriplets(self, A: List[int]) -> int: counters = [0] * (1 << 16) counters[0] = len(A) for num in A: mask = (~num) & ((1 << 16) - 1) sm = mask while sm != 0: counters[sm] += 1 sm = (sm - 1) & mask ...

0.739158

class Solution: def countTriplets(self, arr: List[int]) -> int: n = len(arr) res = xors = 0 freq = collections.defaultdict(int, {0:1}) _sum = collections.defaultdict(int) for i in range(n): xors ^= arr[i] res += freq[xors] * i - _sum[xors] ...

0.676681

#CF Round 150. Div II Prob. A - Dividing Orange import sys dp = [[[-1 for j in range(3)] for i in range (1 << 10)] for k in range(11)] In = sys.stdin n = In.readline().strip() def go (idx, mask, equal): if dp[idx][mask][equal] != -1: return dp[idx][mask][equal] if bin(mask).count("1") > 2: re...

0.674901

class Solution: def subarrayBitwiseORs(self, A: List[int]) -> int: res = set() cur = set() for a in A: cur = {a | i for i in cur} cur |= {a} res |= cur return len(res)

0.666507

import sys from copy import copy input = sys.stdin.readline n = int(input()) l = [int(a) for a in input().split()] x = [] for i in range(0, 20): res = 0 for a in l: if a & (1 << i): res += 1 x.append(res) res = 0 for i in range(n): a = 0 for j in range(20): if i < x[j]...

0.644519

class Solution: def minOperations(self, nums: List[int]) -> int: return sum(bin(x).count('1') for x in nums)+len(bin(max(nums)))-3

0.641896

from collections import Counter def common(a,b,c): return sum((Counter(a) & Counter(b) & Counter(c)).elements())

0.630683

n = sum(list(map(int, input().split()))) A = [0 for i in range(n)] DP = [[0 for i in range(3)] for i in range(n)] for i in range(3): for j in map(int, input().split()): A[j - 1] = i DP[0] = [A[0] != i for i in range(3)] for i in range(1, n): DP[i][0] = DP[i - 1][0] + (A[i] != 0) DP[i][1] = min(DP[i - 1][0], D...

0.614991

def count(a, t, x): return sum(not (t-v)%x if x else t==v for v in a)

0.606443

from functools import reduce def product_sans_n(nums): z = nums.count(0) if z > 1: return [0] * len(nums) p = reduce(int.__mul__, (v for v in nums if v)) return [not v and p for v in nums] if z else [p//v for v in nums]

0.600605

class Solution: def minFlips(self, a: int, b: int, c: int) -> int: flips = 0 print(bin(a)) print(bin(b)) print(bin(c)) while a or b or c: # print(a, b, c) if c % 2: if not (a % 2 or b % 2): flips += 1 els...

0.598805

class Solution: def findIntegers(self, num): """ :type num: int :rtype: int """ dp=[1,2] for i in range(2,32): dp.append(dp[i-1]+dp[i-2]) bnum=bin(num)[2:] size=len(bnum) ans=dp[size] for i in range(1,s...

0.596516

import sys input = sys.stdin.readline N=int(input()) A=list(map(int,input().split())) XOR=0 for a in A: XOR^=a for i in range(N): A[i] &=~XOR USED=[0]*N for bi in range(60,-1,-1): for i in range(N): if USED[i]==0 and A[i] & (1<<bi)!=0: USED[i]=1 useind=i ...

0.594903

class Solution: def singleNumber(self, nums): """ :type nums: List[int] :rtype: int """ a = set(nums) a = sum(a)*3 - sum(nums) return int(a/2)

0.594043

from functools import reduce from gmpy2 import comb from operator import xor def transform(a, x): return reduce(xor, (comb(n + 1, x + 1) for n in a))

0.591752

def magic_sum(arr): return arr and sum(x for x in arr if x%2 and '3' in str(x)) or 0

0.590715

n = int(input()) a = [int(i) for i in input().split()] def isp2(x): return (x >= 1) and ((x & (x - 1)) == 0) p2 = [2 ** i for i in range(33)] d = {} for i in a: if i in d: d[i] += 1 else: d[i] = 1 k = 0 for i in d: for p in p2: j = p - i if j > i: break; if j in d: if i == j: k += d[i] * (d[...

0.590409

t = int(input()) for _ in range(t): n = int(input()) a = list(map(int, input().split())) counts = [0] * 32 for x in a: counts[len(bin(x))-2] += 1 total = 0 for count in counts: total += count * (count-1) // 2 print(total)

0.590122

def solve(arr): return sum( y-x == z-y for i,x in enumerate(arr[:-2]) for j,y in enumerate(arr[i+1:-1]) for _,z in enumerate(arr[j+1:]))

0.588122

class Solution: def flipLights(self, n, m): """ :type n: int :type m: int :rtype: int """ states = set() for op_odd in [0, 1]: for op_even in [0, 1]: for op_third in [0, 1]: op_all = m - op_odd - op_ev...

0.587914

def descriptions(arr): return 2**sum(a+1==b for a,b in zip(arr,arr[1:]))

0.587376

x = int(input()) y = list(map(int, input().split(' '))) if y == [0] * x: print(0) quit() for i in range(x): if y[i] == 1: y = y[i:] break y.reverse() for i in range(len(y)): if y[i] == 1: y = y[i:] break y.reverse() l = [] ct = 0 for i in y: if i == 0: ct+=...

0.585298

from operator import mul from functools import reduce def solve(arr): return reduce(mul, map(len, map(set, arr)), 1)

0.581276

def calc(a): return sum( x**(1 + (x>=0)) * (1 + 2*(not i%3)) * (-1)**(not i%5) for i,x in enumerate(a,1))

0.578692

n = int(input()) a = [2, 3 ,5, 7] ans = 0 import operator import itertools import functools for i in range(1, 5): for p in itertools.combinations(a, i): x = functools.reduce(operator.mul, p) ans += (-1) ** (i + 1) * (n // x) print(n - ans)

0.578481

import sys input = sys.stdin.readline n = int(input()) a = list(map(int, input().split())) b = a ans = 0 for k in range(29): a0 = [] a1 = [] a0a = a0.append a1a = a1.append b0 = [] b1 = [] b0a = b0.append b1a = b1.append for i in a: if i&(1<<k): a1a(i) else: ...

0.571536

import numpy as np def products(n, min_divisor, max_divisor): if n == 1: yield [] for divisor in range(min_divisor, max_divisor+1): if n % divisor == 0: for product in products(n // divisor, divisor, max_divisor): yield product + [divisor] def eq_dice(set): ...

0.569976

class Solution: def numberWays(self, hats: List[List[int]]) -> int: # assign hat to people n = len(hats) dic = collections.defaultdict(list) for i,hat in enumerate(hats): for h in hat: dic[h].append(i) # mask for people: ways bfs =...

0.568713

import math def csb(n): count = 0 while (n): n &= (n-1) count+= 1 return count def f(ca,cb,i,cf,C,n,dp): if ca<0 or cb<0: return 0 if i==n: if ca==0 and cb==0 and cf==0: return 1 return 0 st=str(ca)+" "+str(cb)+" "+str(cf)+" "+str(i) if dp.get(st)!=None: return dp[st] x=0 if (C&(1<<i))>0:...

0.567819

class Solution: def numSquarefulPerms(self, A: List[int]) -> int: A.sort() self.ans = 0 def check(A, i, path): return int((A[i] + path[-1])**0.5 + 0.0)**2 == A[i] + path[-1] def dfs(A, path): if not A: self.ans += 1 return ...

0.567343

def binary(n): curr=0 while(n>0): if(n%2): curr+=1 n=n//2 return curr l=input().split() n=int(l[0]) k=int(l[1]) l=input().split() li=[int(i) for i in l] arr=[] for i in range(2**15): if(binary(i)==k): arr.append(i) hashi=dict() for i in li: if i in hashi: ...

0.566015

def est_subsets(arr): return 2**len(set(arr)) - 1

0.565725

TASK = "stars" # FIN = open(TASK + ".in") # FOUT = open(TASK + ".out", "w") a = [1, 0, 0, 0, 1, 0, 1, 0, 2, 1, 1, 2, 0, 1, 0, 0] ans = 0 n = int(input()) if n == 0: print(1) return while (n > 0): tmp = n % 16 ans += a[tmp] n //= 16 print(ans) # FIN.close() # FOUT.close()

0.56516

#!/usr/bin/env python3 import sys def rint(): return list(map(int, sys.stdin.readline().split())) #lines = stdin.readlines() def get_num1(i): cnt = 0 while i: if i%2: cnt +=1 i //=2 return cnt n = int(input()) a = list(rint()) b = [get_num1(aa) for aa in a] ans = 0 #S0[...

0.564251

class Solution: def numOfSubarrays(self, arr: List[int]) -> int: mod = 10**9+7 odd_presum_cnt = 0 par = 0 for a in arr: par ^= a & 1 if par: odd_presum_cnt += 1 return odd_presum_cnt * (len(arr)+1 - odd_presum_cnt)%mod

0.563603

n = int(input()) l = list(map(int, input().split())) f1 = l[2] l.sort() f2 = l[0] print(2 + (f1 ^ f2))

0.562981

from functools import lru_cache @lru_cache(maxsize=None) def three_details(n): if n <= 3: return n==3 q, r = divmod(n, 2) return three_details(q) + three_details(q+r)

0.56135

from itertools import permutations n = int(input()) p1, _, p2, _, p3, _, p4 = [input() for _ in range(n)], input(), [input() for _ in range(n)], input(), [input() for _ in range(n)], input(), [input() for _ in range(n)] def count(a,b,c,d): board = [a[i] + b[i] for i in range(n)] + [c[i] + d[i] for i in range(n)]...

0.559666

import sys T = int(sys.stdin.readline().strip()) for t in range(T): sys.stdin.readline().strip() st = '0'+sys.stdin.readline().strip()+'0' res = 0 for i in range(1,len(st)-1): if st[i] == st[i-1] == st[i+1] == '0': res+=1 print(res)

0.55928

from itertools import combinations def counting_triangles(v): v.sort() return sum(a+b>c for a,b,c in combinations(v,3))

0.559115

from itertools import combinations def isRect(a,b,c): X,Y,Z = sorted( sum( (q-p)**2 for p,q in zip(p1,p2)) for p1,p2 in [(a,b), (a,c), (b,c)] ) return X+Y == Z def count_rect_triang(points): return sum( isRect(*c) for c in combinations(set(map(tuple, points)), 3) )

0.558992

from bisect import bisect_left as bl from bisect import bisect_right as br import heapq import math from collections import * from functools import reduce,cmp_to_key import sys input = sys.stdin.readline M = mod = 10**9 + 7 def factors(n):return sorted(set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5)...

0.55765

def convert_bits(a,b): return bin(a^b).count("1")

0.557469

import math def count(n): if n is 0: return 0 x = int(math.log(n, 2)) return x * 2 ** (x - 1) + n - 2 ** x + 1 + count(n - 2 ** x) def countOnes(left, right): return count(right) - count(left - 1)

0.557076

n = int(input()) ans = 0 for i in range(1, n + 1): for j in range(i, n + 1): if 0 = j: ans += 1 print(ans)

0.556129

import sys inp = sys.stdin #inp = open('input.txt', 'r') n = int(inp.readline()) a = list(map(int, inp.readline().split())) best = [0, 0, 0] for i in range(n): nx_best = [0, 0, 0] if a[i] in (1, 3): nx_best[1] = max(best[0], best[2]) + 1 if a[i] in (2, 3): nx_best[2] = max(best[0], best[...

0.55569

from itertools import permutations def find_mult_3(num): num_list = tuple(map(int, str(num))) poss = set() for i in range(1, len(num_list)+1): poss |= set(permutations(num_list, i)) res = set() for p in poss: if p[0] != 0 and sum(p) % 3 == 0: res.add(p) re...

0.554165

import sys import math import heapq import bisect import re from collections import deque from decimal import * from fractions import gcd def YES_NO(flag): if flag: print("AWW") else: print("WAW") def main(): # q = [int(i) for i in sys.stdin.readline().split()] n = int(sys.stdin.re...

0.553984

#!/usr/bin/env python n = int(input()) a = list(map(int, input().split())) k = [None, 4, 8, 15, 16, 23, 42] s = [n, 0, 0, 0, 0, 0, 0] for ai in a: for i in range(6, 0, -1): if ai == k[i] and s[i - 1] > 0: s[i] += 1; s[i - 1] -= 1 break print(n - 6 * s[-1])

0.552455

import collections solved_boards = {((1,2,3),(4,5,0)): 0} class Solution: def slidingPuzzle(self, board): """ :type board: List[List[int]] :rtype: int """ asked = tuple(tuple(row) for row in board) queue = collections.deque([((1,2,3),(4,5,0))]) whi...

0.549155

#!/usr/bin/env python # -*- coding: utf-8 -*- from collections import defaultdict n = int(input()) A = list(map(int,input().split())) pattern = set() for a in A: p = [] while a > 0: if a in pattern: break p.append(a) a = a//2 pattern |= set(p) def check(v): ret = 0 ...

0.549077

n = int(input()) l = list(map(int, input().split())) inv = 0 out = 0 mult = 1 for i in range(32): curr = dict() opp = 0 same = 0 for v in l: if v ^ 1 in curr: if v & 1: opp += curr[v ^ 1] else: same += curr[v ^ 1] if ...

0.548497

from collections import defaultdict N, = list(map(int, input().split())) def normal(xs): return tuple(min((xs[j:] + xs[:j] for j in range(1, 5)))) dd = defaultdict(int) cc = dict() norm = dict() ss = [] for _ in range(N): xs = list(map(int, input().split())) cnd = [tuple(xs[j:] + xs[:j]) for j in range(1,...

0.547333

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools sys.setrecursionlimit(10**7) inf = 10**20 eps = 1.0 / 10**10 mod = 10**9+7 dd = [(-1,0),(0,1),(1,0),(0,-1)] ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)] def LI(): return list(map(int, sys.stdin.readline().spli...

0.547304

n=input() ls='' t=0 for i in range(len(n)): if int(n[i])%3==0: ls='' t+=1 else: ls+=n[i] for j in range(0,len(ls)): if int(ls[j:])%3==0: t+=1 ls='' break print(t) ''' //////////////// ////// /////// ...

0.54471

def solve(a): return sum(1 if v % 2 == 0 else -1 for v in a if type(v) == int)

0.544695

n = int(input()) a = list(map(int, input().split())) c = 0 l = 0 b = 0 while c < len(a) and a[c] == 0: c += 1 b += 1 if c == len(a): print(0) return d = len(a) - 1 while a[d] != 1: d -= 1 b += 1 while c <= d: if a[c] == 0: l += 1 else: if l > 1: b += l ...

0.543579

n = int(input()) l = list(map(int,input().split())) cnt = 0 for i in range(0,n-2): for j in range(i+1,n-1): for k in range(j+1,n): x = [l[i],l[j],l[k]] ma = sorted(x)[2] _ma = sorted(x)[0] + sorted(x)[1] if l[i] != l[j] and l[i] != l[k] and l[j] != l[k] and ma...

0.543554

# cook your dish here n = int(input()) count = 0 for _ in range(n): L = list(map(int, input().split())) if (L.count(1)>=2): count+=1 print(count)

0.543337

from operator import mul from functools import reduce def unique_digit_products(nums): return len({reduce(mul, (int(a) for a in str(num))) for num in nums})

0.54298

a, b, c = map(int, input().split()) d = 1073741824 p = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97] t = [{} for i in range(101)] ans = {} for i in p: j = i m = 1 while j < 101: for k in range(j, 101, j): t[k][i] = m j = j * i ...

0.541288

#!/usr/bin/env python def main(): N = int(input()) C = 0 for n in range(N): S = input().strip() Pi = S.split()[-1] L = [Pi.count(k) for k in map(str, list(range(10)))] if L[8] >= L[5] and L[5] >= L[3] and \ L[0] == 0 and L[1] == 0 and \ L[2] == 0 and L[4] == 0 and \ L[6] == 0 and L[7] == 0 and \ ...

0.54016

class Solution: def numEnclaves(self, A: List[List[int]]) -> int: def dfs(i, j): if not (0<=i<len(A) and 0<=j<len(A[i])): return if A[i][j]==0: return A[i][j]=0 dfs(i-1, j) dfs(i+1, j) dfs(i, j-1) ...

0.539902

M = 10 ** 9 + 7 def solve1(x): n = len(x) x = int(x, 2) ans = 0 for a in range(2 ** n): for c in range(2 ** n): b = a ^ x d = c ^ x if a < c and b > d: ans += 1 return ans % M def solve2(x): return int(x, 2) * pow(2, (len(x) - 1), M) %...

0.539861

__author__ = 'Pavel Mavrin' n = int(input()) a = [int(x) for x in input().split()] s = 0 res = 0 for i in a: if i == 0: res += s else: s += 1 print(res)

0.539469

N=100001 fac=[0 for i in range(N)] for i in range(1,N): for j in range(i,N,i): fac[j]+=1 def gcd(a,b): if a<b: a,b=b,a while b>0: a,b=b,a%b return a def ctt(A,B,C): la=fac[A] lb=fac[B] lc=fac[C] ab=gcd(A,B) ac=gcd(A,C) bc=gcd(B,C) a...

0.536793

t=int(input()) count=[] for i in range(t) : s = input() a,b,c,n = s.split() n=int(n) d = int(a+b*n+c,2) count.append(0) while(d>0) : d=(d&(d+1))-1 count[i]+=1 for i in range(t) : print(count[i])

0.536535

""" Codeforces Contest 266 Div 2 Problem C Author : chaotic_iak Language: Python 3.3.4 """ def main(): n, = read() a = read() s = sum(a) if s%3: print(0) return s //= 3 t = 0 ct = 0 res = 0 for i in range(n-1): t += a[i] if t == 2*s: res...

0.535206

def infected_zeroes(s): m=0; l=0 for i,n in enumerate(s): if n==0: m=i if l==0 else max(m, (i-l+1)//2); l=i+1 return max(m,len(s)-l)

0.53467

def three_amigos(numbers): return min( ([a, b, c] for a, b, c in zip(numbers, numbers[1:], numbers[2:]) if a & 1 == b & 1 == c & 1), key=lambda triple: max(triple) - min(triple), default=[])

0.534061

class Solution: def numRabbits(self, answers): cnts = collections.Counter(answers) return sum(-v % (k+1) + v for k, v in cnts.items())

0.533549

from collections import defaultdict def repeat_sum(l): count = defaultdict(int) for l1 in l: for val in set(l1): count[val] += 1 return sum(k for k,v in list(count.items()) if v > 1)

0.533407

class Solution: def numWays(self, s: str) -> int: n = s.count('1') if n % 3 != 0: return 0 if n == 0: return (((len(s) - 1) * (len(s) - 2)) // 2) % (10**9 + 7) m = n // 3 L = s.split('1') return ((len(L[m]) + 1) * (len(L[2*m]) + 1)) % (10**9 + 7)

0.533115

def find(r): return sum(2**i for i in r)

0.532483

from itertools import combinations def strings_crossover(arr, result): return sum(1 for s1,s2 in combinations(arr,2) if all(r in (x,y) for x,y,r in zip(s1,s2,result)))

0.53127

a=list(map(int,input().split())) print(len(set(a)))

0.531045

for i in range(int(input())): n=int(input()) l1=list(map(int,input().split())) type1=0 type2=0 ans=0 for item in l1: if item%3==0: ans+=1 elif item%3==1: type1+=1 else : type2+=1 x=min(type1,type2) ans+=x type1-=x type2-...

0.529853

def check(l, r, a, b): if a < 0 or b >= 2 * N: return 0 def val(p): if p in [a, b]: return '0' if l <= p and p < r: return '1' return '-1' for i in range(K): x, y = val(A[i]), val(C[i]) if A[i] in [a, b] or C[i] in [a, b]: if not eval(x + B[i] + y)...

0.529731

ii = lambda: int(input()) mi = lambda: map(int, input().split()) li = lambda: list(mi()) from collections import Counter as C n = ii() a = li() oe = [C(), C()] oe[1][0] = 1 x = 0 ans = 0 for i in range(n): x ^= a[i] ans += oe[i % 2][x] oe[i % 2][x] += 1 print(ans)

0.529306

from collections import deque import math num = int(input()) x = tuple(map(int, list(input()))) #if x == "0"*num: print(num); return integer = 0 dic = dict() for i in range(1,num+1): a = math.gcd(i,num) if a in dic: integer += dic[a] else: lijst = [0]*a for j in range(n...

0.529013

from operator import __or__, __and__, __xor__ from sys import stdin, stdout n, b, c = int(stdin.readline()), 0, 1023 m = {'|': __or__, '&': __and__, '^': __xor__} for i in range(n): t, v = [i for i in stdin.readline().split()] b = m[t](b, int(v)) c = m[t](c, int(v)) x, o, a = 0, 0, 1023 for i in range(10): ...

0.528964

LOG = 20 def solve(s): n = len(s) res = 0 z = 0 for t in range(0, n): if s[t] == '0': z += 1 continue for l in range(1, min(LOG, n - t + 1)): x = int(s[t:t+l], 2) # print(l, t, x, l + z) if l + z >= x: res += 1 # print(t, l, x, res, z) z = 0 return res t = int(input()) while t > 0: ...

0.528891

def summ(number, d): n = (number - 1) // d return n * (n + 1) * d // 2 def solution(number): return summ(number, 3) + summ(number, 5) - summ(number, 15)

0.528773

def two_count(n): res = 0 while not n & 1: res += 1 n >>= 1 return res

0.528518

# cook your dish here import math; from math import gcd,sqrt,floor,factorial,ceil from bisect import bisect_left,bisect_right import bisect; import sys; from sys import stdin,stdout import os sys.setrecursionlimit(pow(10,7)) import collections from collections import defaultdict,Counter from statistics import median # ...

0.528144

def solve(a): seen = set() for i in range(len(a)): c = 0 for j in range(i+2,len(a)): c += a[j-1] if a[i]^a[j] == c: seen.add((i,j)) if c >= 2*a[i]: break for i in range(len(a)-1,-1,-1): c = 0 for j in ra...

0.527995

X = [[], ['0', '1'], ['00', '01', '10', '11'], ['001', '010', '011', '100', '101', '110'], ['0010', '0011', '0100', '0101', '0110', '1001', '1010', '1011', '1100', '1101'], ['00100', '00101', '00110', '01001', '01011', '01100', '01101', '10010', '10011', '10100', '10110', '11001', '11010', '11011'], ['001001', '001011'...

0.52756

# 1390. Four Divisors # version 2, with optimized prime-finding. import math def remove (lst, index): assert lst tail = len (lst) - 1 lst[index], lst[tail] = lst[tail], lst[index] lst.pop () def swap_min (lst): if not lst: return argmin = min (range (len (lst)), key = lambda i: lst[i]) ls...

0.525557

def main(): N=int(input()) A=list(map(int,input().split())) mod=10**9+7 ans=0 for i in range(60): a=0 for x in A: if x>>i&1: a+=1 ans+=a*(N-a)*pow(2,i,mod) ans%=mod print(ans) def __starting_point(): main() __starting_point()

0.524743

def coloring(i, ancestors, color): while i != 0 and color[ancestors[i - 1]] is None: color[ancestors[i - 1]] = not color[i] i = ancestors[i - 1] def main(): n = int(input()) a = list(map(int, input().split())) ancestors = list([int(x) - 1 for x in input().split()]) descendants = [[...

0.524579

import itertools class Solution: def numSpecial(self, mat: List[List[int]]) -> int: rr = [i for i, r in enumerate(mat) if sum(r) == 1] cc = [i for i, c in enumerate(zip(*mat)) if sum(c) == 1] return sum(1 for i, j in itertools.product(rr, cc) if mat[i][j] == 1)

0.524378

n =int(input()) w=[] h=[] c=[] cntw={} cnth={} gcdC=0 cntC=0 def insert1(a,b,c): if not a in b : b[a]=c else : b[a]=b[a]+c def gcd(a,b): if a % b == 0 : return b else : return gcd(b,a%b) for i in range(0, n): a,b,d = map(int,input().split()) w.append(a) h.append(b) c.append(d) insert1(a,cntw,d) ins...

0.524029

class Solution: def hammingWeight(self, n: int) -> int: count = 0 while n!=0: n &= (n-1) count += 1 return count

0.523723

from math import gcd n, k = list(map(int, input().split())) a = [] for i in range(k): try: a += list(map(int, input().split())) except: pass ans = n for i in range(1, 2**k): b = bin(i)[2:].rjust(k, "0") c = [] for j in range(k): if(b[j] == '1'): c.ap...

0.523111

from itertools import combinations def solve(a, n): return any(sum(c) % n == 0 for i in range(len(a)) for c in combinations(a, i+1))

0.522825

# cook your dish here # cook your dish here test=int(input()) for _ in range(test): n=int(input()) a=[(bin(int(x))[2:][::-1]+("0")*32)for x in input().split()] res="" mysum=0 for i in range(32): mycount=0 for j in range(n): if(a[j][i]=="0"): mycount+=1 if(mycount==n): break if(mycount>(n//2)): ...

0.522707

from sys import stdin, stdout input = stdin.readline from collections import defaultdict as dd import math def geti(): return list(map(int, input().strip().split())) def getl(): return list(map(int, input().strip().split())) def gets(): return input() def geta(): return int(input()) def print_s(s): stdout.write...

0.522705

s=input().split() for i in range(3): s[i]=int(s[i]) s.sort() ans=s[0]//3 +s[1]//3 +s[2]//3 x=s[0]%3 y=s[1]%3 z=s[2]%3 if(x==0 and y==z==2 and s[0]!=0): ans+=1 if(y==0 and x==z==2 and s[1]!=0): ans+=1 if(z==0 and y==x==2 and s[2]!=0): ans+=1 ans+=min(x,y,z) print(ans)

0.521805

for _ in range(int(input())): a,b,c,x,y,z = list(map(int,input().split())) if a == 0 and b == 0 and c == 0 and x == 0 and y == 0 and z == 0: print(0) continue ans = 0 if a == 0 and b == 0 and c == 0: st = set((abs(x-a)%2,abs(y-b)%2,abs(z-c)%2)) if st == {0,1}: ans = 1 else...

0.521383

def hamming_weight(x):return bin(x).count('1')

0.521372

_ = input() S = input() print((S.count("ABC")))

0.520937

Given a circular array C of integers represented by A, find the maximum possible sum of a non-empty subarray of C. Here, a circular array means the end of the array connects to the beginning of the array. (Formally, C[i] = A[i] when 0 <= i < A.length, and C[i+A.length] = C[i] when i >= 0.) Also, a subarray may only in...

class Solution: def maxSubarraySumCircular(self, A: List[int]) -> int: N = len(A) if(N==0): return 0 curr_max = A[0] global_max = A[0] curr_min = A[0] global_min = A[0] flag = 0 if(A[0]>=0): flag=1 for i in range(1...

0.74709

class Solution: def maxSubArray(self, nums): """ :type nums: List[int] :rtype: int """ # i = 0 # i_keep = 0 # j = 1 # j_keep = 1 # max_sum = nums[0]-1 # while j < len(nums) and i < j: # temp_sum = sum(nums[i:j]) ...

0.747357

def largest_sum(arr): sum = max_sum = 0 for n in arr: sum = max(sum + n, 0) max_sum = max(sum, max_sum) return max_sum

0.701036

import sys class Solution: def maximumSum(self, arr: List[int]) -> int: ignore=0 not_ignore=0 res=-sys.maxsize for i in arr: if i>=0: ignore+=i not_ignore+=i else: if ignore==0: ignore+=i ...

0.692715

from sys import maxsize # Function to find the maximum contiguous subarray # and print its starting and end index def maxSubArraySum(a,size): max_so_far = -maxsize - 1 max_ending_here = 0 start = 0 end = 0 s = 0 for i in range(0,size): max_ending_here += a[i] if max_so_far < max_ending_here: ma...

0.683131

def calc(a): res = [0] * (len(a) + 1) for k in range(len(a)): res = [2 * max(a[i] + res[i+1], a[i+k] + res[i]) for i in range(len(a) - k)] return res[0]

0.681975

import sys import itertools sys.setrecursionlimit(10 ** 8) ini = lambda: int(sys.stdin.readline()) inl = lambda: [int(x) for x in sys.stdin.readline().split()] ins = lambda: sys.stdin.readline().rstrip() debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw)) N = ini() A = inl() def...

0.661663

def maxval(arr): fn = [float('-inf')]*(len(arr)+1) sn = [float('-inf')]*len(arr) tn = [float('-inf')]*(len(arr)-1) fon = [float('-inf')]*(len(arr)-2) for i in reversed(list(range(len(arr)))): fn[i] = max(fn[i + 1], arr[i]) for i in reversed(list(range(len(arr) - 1))): sn[i] = max...

0.650262

n = int(input()) a = [0] * n a = list(map(int, input().split())) for i in range(1, len(a)): a[i] += a[i - 1] ans = a[-1] for i in range(n - 2, 0, -1): ans = max(ans, a[i] - ans) print(ans)

0.649708

input() num = list(map(int, input().split())) maxn = 0 l, r = 0, len(num)-1 j1, j2 = num[l], num[r] while l < r: if j1 == j2: maxn = max(j1, maxn) l += 1 j1 += num[l] elif j1 < j2: l += 1 j1 += num[l] else: r -= 1 j2 += num[r] print(maxn)

0.646045

n = int(input()) l = list(map(int,input().split())) curr = 0 best = 0 prevs = [0] * 31 for v in l: curr += v if v >= 0: for i in range(0, v): prevs[i] = curr for i in range(v, 31): best = max(curr - prevs[i] - i, best) else: for i in range(31): pr...

0.645485

def main(): import sys import numpy as np def input(): return sys.stdin.readline().rstrip() n = int(input()) a = list(map(int, input().split())) inf = 1e18 k = n%2 + 1 dp = np.full((n+1, k+2), -inf, dtype=int) dp[0,0] = 0 for i in range(n): for j in range(k+1): ...

0.644652

#taken from https://stackoverflow.com/questions/30698441/optimal-way-to-find-sums-of-all-contiguous-sub-arrays-max-difference def max_sums(d): stack = [(-1, float('inf'))] sum_ = 0 for i, x in enumerate(d): while x > stack[-1][1]: prev_i, prev_x = stack.pop() prev_prev_i, pr...

0.637395

class Solution: def maxValueAfterReverse(self, nums: List[int]) -> int: n = len(nums) base = sum([abs(nums[i] - nums[i+1]) for i in range(n - 1)]) if (n <= 2): return base #best = base #for i in range(n-1): # for j in range(i+1, n): # ...

0.634548

N = int(input()) A = list(map(int,input().split())) T = 0 for i in range(len(A)-1): if (A[i] > A[i + 1]): T += A[i] - A[i +1] A[i+1] = A[i] print(T)

0.634487

class Solution: def getMaxLen(self, nums: List[int]) -> int: maxx = 0 nums.append(0) # starting position # where we find a 0 i = -1 minusarr = [] for j,n in enumerate(nums): if n == 0: # now figure out previous one...

0.633306

# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def currentmax(self,root): leftval = 0 if root.left != None: leftval = self.currentmax(root.left) leftval = 0 if leftv...

0.628565

def dfs(i): if i >= 2 ** n: return 0, 0 x1, m1 = dfs(i * 2) x2, m2 = dfs(i * 2 + 1) if m1 + a[i * 2] < m2 + a[i * 2 + 1]: return x1 + x2 + m2 + a[i * 2 + 1] - m1 - a[i * 2], m2 + a[i * 2 + 1] return x1 + x2 + m1 + a[i * 2] - m2 - a[i * 2 + 1], m1 + a[i * 2] n = int(input()) a = [0, 0...

0.62788

from sys import stdin n = int(stdin.readline()) a = list(map(int,stdin.readline().split())) a = [0] + a ans = n dp = [float("inf")] * (n+1) dp[0] = 0 for i in range(1,n+1): nmin = float("inf") for j in range(i-1,-1,-1): if a[j] <= nmin: dp[i] = min(dp[i] , dp[j] + max(0,a[i]-a[j]) + (i-...

0.626027

class Solution: def maxSizeSlices(self, slices: List[int]) -> int: a,b,n=[slices[0]],[0],len(slices) for i in range(1,n): a.append(max(a[-1],slices[i])) b.append(max(b[-1],slices[i])) for i in range(2,2*n//3,2): aa,bb=[0]*(n-1),[0]*n for j in r...

0.624484

class Solution: def rob(self, nums): """ :type nums: List[int] :rtype: int """ if not nums: return 0 if len(nums)==1: return nums[0] return max(self.helper(nums[1:]), self.helper(nums[:-1])) def helper(self,nums...

0.622458

rr = lambda: input().strip() rri = lambda: int(rr()) rrm = lambda: list(map(int, rr().split())) def solve(N, A): ans = 0 prev = float('inf') for x in reversed(A): x = min(x, prev - 1) ans += max(x, 0) prev = x return ans for tc in range(1):#rri()): N = rri() A = rrm() ...

0.620847

N = int(input()) A = [int(s) for s in input().split(" ")] ABI = sorted(((a, i) for i, a in enumerate(A, 1)), reverse=True) prev = [0] for k, (a,i) in enumerate(ABI): curr = [0]*(k+2) for l in range(k+1): curr[l] = max(curr[l], prev[l]+abs(N-i-k+l)*a) curr[l+1] = prev[l]+abs(i-l-1)*a prev = curr pri...

0.620491

from functools import * class Solution: def stoneGameII(self, arr): a =[] s=0 n = len(arr) for i in arr[::-1]: s+=i a.append(s) a=a[::-1] @lru_cache(None) def fun(i,m): if i+2*m>=n:return a[i] mn = inf ...

0.620304

n = int(input()) *A, = list(map(int, input().split())) seq = [] cur = 1; cnt = 0 for a in A: if cur == a: cnt += 1 else: seq.append(cnt) cur = a; cnt = 1 if cnt > 0: seq.append(cnt) ans = max(seq) l = len(seq) dp = [[0]*4 for i in range(l+1)] for i in range(l): one = i % 2 #12 ...

0.618872

import os import sys if os.getenv("LOCAL"): sys.stdin = open("_in.txt", "r") sys.setrecursionlimit(2147483647) INF = float("inf") N = int(sys.stdin.readline()) S = list(map(int, sys.stdin.readline().split())) def count_max(diff): # 左右対称に diff 間隔でとるときの最大 b = 0 a = N - 1 ret = 0 cumsum = 0 ...

0.616382

class Solution: def deleteAndEarn(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums);#count is a dict [3,4,2]--> {2:1,3:1,4:1} prev = None; avoid = using = 0; for k in sorted(count): temp = ma...

0.612662

from heapq import heappush, heappop N = int(input()) A = [int(a) for a in input().split()] for i in range(N): if A[i] < 0: k = i break A = [0] + [0 if i < k else A[i] for i in range(N) if i != k] ans = A.pop() H = [] while N > 2: N //= 2 for i in range(N): heappush(H, A.pop()) a...

0.610782

def flipping_game(num): current = 0 biggest = 0 for i in num: current = max(0, current - ( i or -1 ) ) biggest = max(biggest, current) return sum(num) + (biggest or -1)

0.609609

class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ tmax_profit = 0 rmax_profits = [0] * len(prices) rmax = -1 for ii in range(len(prices)-2, -1, -1): if (prices[rmax] - prices[ii] > rmax_profi...

0.608019

n = int(input()) arr = list(map(int, input().split())) arr.sort() arr = arr[::-1] ans = [arr[0]] for i in range(1, n): if(arr[i] < ans[-1]): ans.append(arr[i]) else: ans.append(max(0, ans[-1] - 1)) print(sum(ans))

0.607288

n = int(input()) a = list(map(int, input().split())) lp,rp = [0 for i in range(n)],[0 for i in range(n)] lnr, rnr = [a[i] for i in range(n)],[a[i] for i in range(n)] mx = a[0] for i in range(1,n): if a[i] > mx: mx = a[i] lp[i] = lp[i-1] else: mx += 1 lp[i] = lp[i-1] + mx - a[i]...

0.6058

n=int(input()) a=list(map(int,input().split())) print(n*max(a)-sum(a))

0.605267

import sys import string def ria(): return [int(i) for i in input().split()] n = ria()[0] ar = ria() if n == 1: print(ar[0]) return onlyNegs = True onlyPos = True if max(ar) >= 0: onlyNegs = False if min(ar) <= 0: onlyPos = False if onlyNegs: print(abs(sum(ar)) + max(ar) * 2) return ...

0.604137

class Solution: def rob(self, nums: List[int]) -> int: if not nums: return 0 if len(nums) < 3: return max(nums) dp = [0] * len(nums) dp[0] = nums[0] dp[1] = max(nums[0], nums[1]) for i in range(2, len(nums)): dp[i] = max(dp...

0.597647

n = input() s = [] a = 0 for i in map(int, input().split()): while len(s) > 1 and min(s[-2], i)>=s[-1]: a += min(i, s[-2]) del(s[-1]) s.append(i) s.sort() print(a + sum(s[0: -2])) # Made By Mostafa_Khaled

0.597191

n = int(input()) t = [list(map(int, input().split())) for q in range(n)] t[0][0] = 0 n += 1 u = [-1e7] * n v = [0] * n for i, (j, a) in list(enumerate(t, 1))[::-1]: u[i] = max(u[i], v[i] + a) v[j], u[j] = max(v[j] + v[i], u[j] + u[i]), max(v[j] + u[i], u[j] + v[i]) print(u[1])

0.595259

# returns answer to the subproblem with interval range [start, end], # but with a total of "extra" additional stuff on the end # that must be deleted last. memo = {} def f(dat, rewards, start, end, extra): curr = (start, end, extra) if curr in memo: return memo[curr] if start > end: re...

0.5949

import sys from collections import defaultdict input = sys.stdin.readline sys.setrecursionlimit(1000000) arr=[int(x) for x in input().split()] if arr[0]==1: print(0) return p=[None] for i in range(1,arr[0]+1): p.append(arr[i]) a=[None] for i in range(arr[0]+1,2*arr[0]+1): a.appe...

0.593546

class Solution: def minStartValue(self, nums: List[int]) -> int: res = 1 for ind,n in enumerate(nums): temp = 1-sum(nums[:ind+1]) if(temp > res): res = temp return res

0.593243

n = int(input()) B = list(map(int, input().split())) pp = {} for i in range(n): if B[i] - (i + 1) not in pp: pp[B[i] - (i + 1)] = 0 pp[B[i] - (i + 1)] += B[i] ans = 0 for c in pp: ans = max(ans, pp[c]) print(ans)

0.592397

n = int(input()) A = list(map(int, input().split())) A.sort(reverse=True) A2 = [A[0]] for a in A[1:]: A2.extend([a, a]) ans = 0 for a in A2[:n-1]: ans += a print(ans)

0.591158

class Solution: def PredictTheWinner(self, nums): """ :type nums: List[int] :rtype: bool """ if not nums: return True n = len(nums) if n & 1 == 0: return True dp = [0] * n for i in range(n-1, -1, -1): for j in r...

0.589331

class Solution: def maxSumAfterPartitioning(self, arr, k): res = [0] for idx, val in enumerate(arr): max_val, cur_val = 0, 0 for i in range(max(0, idx-k+1), idx+1)[::-1]: if arr[i] > max_val: max_val =...

0.589058

n = int(input()) a = list(map(int, input().split())) r = n-2 for d in a: r += d print(max(max(a), r//(n-1)))

0.588132

n = input() s = [int(x) for x in input().split(' ')] g = input() A = 0 B = 0 for i in range(len(g)): if g[i] == 'A': A += s[i] else: B += s[i] startA, startB = A, B maximum = B for i in range(len(g)): if g[i] == 'A': A -= s[i] B += s[i] else: A += s[i] B -= s[i] if B > maximum: maximum = B A, B = ...

0.587598

import math n = int(input()) a=list(map(int,input().split())) dp = [0 for x in range(n)] dp[0] = a[0] dp[1] = a[1] dp[2] = a[2] for x in range(3,n): dp[x] = a[x] + min(dp[x-1],dp[x-2],dp[x-3]) print(min(dp[-3:]))

0.586629

import sys n = int(sys.stdin.readline()) a = [int(x) for x in sys.stdin.readline().split()] eps = 1e-12 def f(x): mx = a[0] - x tsmx = 0.0 mn = a[0] - x tsmn = 0.0 for ai in a: tsmx = max(tsmx + ai - x, ai - x) mx = max(tsmx, mx) tsmn = min(tsmn + ai - x, ai - x) mn...

0.584546

n=int(input()) l=list(map(int,input().split())) ans=l[0]+l[n-2] for i in range(n-2): ans+=min(l[i],l[i+1]) print(ans)

0.583294

class Solution: def maxScoreSightseeingPair(self, A: List[int]) -> int: curmaxsight = A[0] - 1 curmaxpair = 0 for sight in A[1:]: if sight + curmaxsight > curmaxpair: curmaxpair = sight + curmaxsight if sight > curmaxsight: curmaxsight ...

0.579765

3 n = int(input()) a = [0] + list(map(int, input().split())) if len(a) < 3 or n % 2 == 0: print(-1) else: ans = 0 for x in range(n // 2, 0, -1): d = max(0, a[2 * x], a[2 * x + 1]) ans += d a[x] -= d print(ans + max(0, a[1]))

0.578035

n = int(input()) l = list(map(int, input().split())) total = sum(l) gap = 0 for rod in l: gap = max(gap, rod - (total - rod)) print(gap + 1)

0.577023

n = int(input()) A = list(map(int, input().split())) A.sort() prev = -1 res = 0 for x in A: if x > prev: prev = x else: prev = prev + 1 res += prev - x print(res)

0.576619

def sum_array(arr): if arr == None or len(arr) < 3: return 0 return sum(arr) - max(arr) - min(arr)

0.575783

class Solution: def largestPerimeter(self, A: List[int]) -> int: A.sort(reverse=True) la=len(A) for i in range(la-2): if A[i]<A[i+1]+A[i+2]: return A[i]+A[i+1]+A[i+2] return 0

0.575726

# cook your dish here from sys import stdin, stdout from collections import defaultdict for _ in range(int(stdin.readline())): n=int(stdin.readline()) lst=list(map(int, stdin.readline().split())) prefix_odd=[0]*n prefix_even=[0]*n odd_val=0 even_val=0 for i in range(n): if lst[i]%2==...

0.575516

from collections import deque class Solution: def constrainedSubsetSum(self, nums, k): N, queue = len(nums), deque() dp = [val for val in nums] for i, val in enumerate(nums): if queue and (i - queue[0] > k): queue.popleft() if queue and dp[queue[0]] > ...

0.575504

n=int(input()) a=list(map(int,input().split())) tmp=0 ca=[0] for ai in a: tmp+=ai ca.append(tmp) from bisect import bisect_right,bisect_left ans=float('inf') # 数列をまず半分に区切る。左i個と右n-i個 2<=i,n-i f,g=1,3 for i in range(2,n-1): while abs(ca[i]-ca[f]-ca[f])>abs(ca[i]-ca[f+1]-ca[f+1]): f+=1 while abs((ca[-1]-ca[g]...

0.575457

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.57508

try: n, k=map(int, input().split()) arr=list(map(int, input().split())) forward = [0]*(n+1) backward= [0]*(n+1) backward[0]=arr[0] backward[1]=arr[0]+arr[1] for i in range(k, n): forward[i]=arr[i] +max(forward[i-1],forward[i-2]) for i in range(2, n): backward[i]=arr[i]+max(bac...

0.573794

n=int(input()) ar=list(map(int,input().split())) dp=[0]*n dp[0]=ar[0] dp[1]=ar[1] for i in range(2,n): dp[i]=min(dp[i-2],dp[i-1])+ar[i] ar.reverse() #print(ar) dp1=[0]*n dp1[0]=ar[0] dp1[1]=ar[1] for i in range(2,n): dp1[i]=min(dp1[i-2],dp1[i-1])+ar[i] print(min(dp[-1],dp1[-1]))

0.573723

from collections import deque class Dinic: def __init__(self, n: int): """頂点数をnとする""" self.INF = float("inf") self.n = n self.graph = [[] for _ in range(n)] def add_edge(self, _from: int, to: int, capacity: int): """残余グラフを構築 1. _fromからtoへ向かう容量capacityの辺をグラフに...

0.573416

class Solution: def maxSatisfaction(self, satisfaction: List[int]) -> int: satisfaction.sort() total, res = 0,0 while satisfaction and satisfaction[-1]+total > 0: total += satisfaction.pop() res += total return res

0.572802

count = int(input()) array = list(map(int, input().split())) diff = array[0] - array[1] holds = True for index in range(1, len(array)-1): if array[index] - array[index+1] != diff: holds = False if holds: print(array[-1] - (array[-2] - array[-1])) else: print(array[-1])

0.569965

rd = lambda: list(map(int, input().split())) k = kk = rd()[1] a = rd() k -= sum(x<0 for x in a) a[:kk] = list(map(abs, a[:kk])) print(sum(a)-(2*min(a) if k>0 and k%2 else 0))

0.569531

str=input().split() n=int(str[0]) len=int(str[1]) a=[] Q=[] F=[] for i in range(0,n+1): a.append(0) Q.append(0) F.append(0) sum=0 h=1 t=0 str=input().split() for i in range(1,n+1): a[i]=int(str[i-1]) sum+=a[i] #print (sum) while h<=t and Q[h]<=i-len: h=h+1 while h<=t and a[i]<=a[Q[t]]: t=t-1 t=t+1;Q[t]=i; ...

0.568557

class Solution: def maxProfit(self, prices): profits = 0 ln = len(prices) if not ln: return 0 elif ln == 2: return (prices[1]-prices[0]) if prices[1] > prices[0] else 0 lastPrice = prices[0] for price in prices: if lastPr...

0.568383

# cook your dish here n=int(input()) l=list(map(int,input().split())) temp=[] for item in l: temp.append(item) if(n<=3): print(sum(temp)) else: for i in range(3,n): temp[i]=l[i]+min(temp[i-1],temp[i-2],temp[i-3]) res=sum(l)-min(temp[n-1],temp[n-2],temp[n-3]) print(res)

0.566209

""" Codeforces Testing Round 10 Problem B Author : chaotic_iak Language: Python 3.3.4 """ def read(mode=2): # 0: String # 1: List of strings # 2: List of integers inputs = input().strip() if mode == 0: return inputs if mode == 1: return inputs.split() if mode == 2: ...

0.563688

def main(): input() l = list(map(int, input().split())) n = max(l) aa = [0] * (n + 1) for x in l: aa[x] += 1 f, x = [0] * n, 0 for a in reversed(aa): x += a f.append(x) f.reverse() res = [] for i, a in enumerate(aa): if a: tot, a = 0, f...

0.563315

n = int(input()) a = list(map(int, input().split())) print(max(a) ^ a[-1])

0.563201

from functools import lru_cache class Solution: def tallestBillboard(self, rods: List[int]) -> int: rods = sorted(rods)[::-1] n = len(rods) psum = rods.copy() for i in range(n-1)[::-1]: psum[i] += psum[i+1] @lru_cache(None) def dfs(idx, diff): ...

0.562818

for _ in range(int(input())): n=int(input()) l=list(map(int,input().split())) a=[] lis=[] prevsign=-1 if l[0]>0: prevsign=1 else: prevsign=0 i=0 for i in l: if (i>0 and prevsign==1) or (i<0 and prevsign==0): lis.append(i) else: ...

0.562089

import collections n = int(input()) A = list(map(int, input().split())) S = [0]*n S[0] = A[0] for i in range(1, n) : S[i] = S[i-1] + A[i] C = collections.Counter(S) max_val = 0 for key in C : max_val = max(max_val, C[key]) ans = n - max_val print(ans)

0.561385

class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ n = len(prices) if n < 2: return 0 sells = [0] * n buys = [0] * n buys[0] = -prices[0] for i in ...

0.561145

n = int(input()) a = list(map(int, input().split())) res = 0 new_a = [] for i in range(n): if a[i] % 2 == 0: if a[i] > 0: res += a[i] else: new_a.append(a[i]) a = new_a a.sort() res += a[-1] a.pop() while len(a) > 1: if a[-1] + a[-2] > 0: res += a[-1] + a[-2] a.po...

0.560338

stops, cap = map(int,input().split()) a = list(map(int,input().split())) start_max = cap start_min = 0 current = 0 for x in a: current += x start_max = min(cap-current, start_max) start_min = max(start_min,-current) if abs(current) > cap: print (0) break else: if start_max<start_m...

0.559577

# import collections, atexit, math, sys from functools import cmp_to_key #key=cmp_to_key(lambda x,y: 1 if x not in y else -1 ) sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) import bisect try : #raise ModuleNotFoundError import numpy def dprint(*args...

0.559549

class Solution: def sumSubseqWidths(self, A: List[int]) -> int: A.sort() ret, mod, p = 0, 10 ** 9 + 7, 1 for i in range(len(A)): ret += (A[i] - A[len(A) - i - 1]) * p % mod p = (p << 1) % mod return ret % mod

0.559247

n = int(input()) a = sorted(list(map(int, input().split()))) ans = 0 if n == 1: ans = a[0] else: mult = 2 for i in range(n - 1): ans += mult * a[i] mult += 1 ans += (mult - 1) * a[-1] print(ans)

0.558359

class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ n = len(prices) if n <=1: return 0 else: minprice = prices[0] res = 0 for i in range(1,n): if ...

0.557934

import heapq data = int(input()) array = [int(_) for _ in input().split()] X = array[0:data] B = array[data:2*data] Y = [-_ for _ in array[2*data:3*data]] heapq.heapify(X) heapq.heapify(Y) x = [sum(X)] y = [sum(Y)] for i in range(data): x += [B[i] - heapq.heappushpop(X, B[i])] y += [-B[-1-i] - heapq.heappu...

0.557723

try: n,k = map(int,input().split()) x = [int(input()) for _ in range(n)] k = k//2 dp = [0]*(k+1) for i in range(k+1): dp[i] = [0]*n #print(dp) for i in range(1,k+1): #print("*",dp[i-1][0]) diff = (-1)*x[0] for j in range(1,n): diff = max(dp[i-1][j]-x[j],diff) dp[i][j] = max(dp[i][j-1],diff+x[j]) ...

0.556609

n = int(input()) a = list(map(int,input().split())) s = sum(a) for k in range(max(a), 999999): vote = sum(k-x for x in a) if vote > s: print(k); break

0.554127

n = int(input()) l = tuple(map(int, input().split())) a = [] for i in range(n - 1): a.append(abs(l[i] - l[i + 1])) ev = [(a[i] if i % 2 == 0 else -a[i]) for i in range(n - 1)] od = [-i for i in ev] od[0] = 0 dp = [ev[0]] st = ["ev"] # print(a) # print(ev) # print(od) vmax = dp[0] evsum = evans = 0 odsum = oda...

0.552576

from heapq import * N = int(input()) price = [int(i) for i in input().split()] total = 0 inf = (10**6) + 1 h = [inf] #Assume we bought and sold optimally for the first k prices. #We adjust our answer for the (k+1)th price that comes up. for p in price: if p > h[0]: total += (p - heappop(h)) #We p...

0.552492

class Solution: def largestSumAfterKNegations(self, A: List[int], K: int) -> int: A.sort() i = 0 while A[i] < 0 and K > 0: A[i] *= -1 i += 1 K -= 1 if K % 2 == 1 and 0 not in A: return sum(A) - 2*min(A) ret...

0.552327

def maximum_product(arr): if arr.count(0) > 1: return min(arr) neg = [n for n in arr if n < 0] pos = [n for n in arr if n >= 0] if len(neg) % 2: return min(neg) if 0 in arr else max(neg) else: return min(pos) if pos else min(neg)

0.552146

#dt = {} for i in x: dt[i] = dt.get(i,0)+1 import sys;input = sys.stdin.readline #import io,os; input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline #for pypy inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()] from collections import deque def getmax(x,n,k): mx = [] dq = deq...

0.552093

import sys num=int(sys.stdin.readline()) s=sys.stdin.readline().split() sky=list(map(int,s)) sky.reverse() cuts=0 change=0 t=False i=1 while i<len(sky): if sky[i]<=sky[i-1]: for j in range(i-1,-1,-1): if sky[j]<=sky[i]-(i-j): break else: change+=sky[j]-(sky[i]-(i-j)) if change>=sky[i]: ...

0.551189

def subsolve(a): c = 0 m = 0 for i in a: c += i if c < 0: c = 0 m = max(m, c) return m def solve(): n = int(input()) a = list(map(int, input().split())) s = 0 for i in range(0, n, 2): s += a[i] u = subsolve([a[i] - a[i - 1] for i in range(1...

0.548496

def f(a, ind): if a[ind] == 0: return -1 k = a[ind] // 14 x = a[ind] % 14 b = a[:] b[ind] = 0 for j in range(14): b[j] += k for j in range(ind + 1, ind + x + 1): j1 = j % 14 b[j1] += 1 res = 0 for j in range(14): if b[j] % 2 == 0: r...

0.548485

from collections import defaultdict def fix_progression(arr): res = 0 for i in range(len(arr)): D = defaultdict(int) for j in range(i): q, r = divmod(arr[i]-arr[j], i-j) if not r: D[q] += 1 res = max(res, D[q]) return len(arr)-res-1

0.548223

from collections import Counter def obtain_max_number(arr): c = Counter(arr) while 1: find = next((k for k in c if c[k] > 1), None) if not find:return max(c) c[find] -= 2 c[find*2] = c.get(find*2,0) + 1

0.548022

def dp(): dparr = [0] * len(sections) for i in range(len(sections) - 1, -1, -1): _, curend, curcomfort = sections[i] nextsection = i + 1 try: while sections[nextsection][0] <= curend: nextsection += 1 except IndexError: # Loop til end inc = curcomfort else: inc = curcomfort + dparr[nextsecti...

0.547551

""" Codeforces Contest 260 Div 1 Problem A Author : chaotic_iak Language: Python 3.3.4 """ def main(): n, = read() ar = read() a = [0] * 100001 for i in ar: a[i] += 1 dp = [0] * 100001 dp[1] = a[1] for i in range(2, 100001): dp[i] = max(a[i] * i + dp[i-2], dp[i-1]) print(dp[-...

0.547475

rooms=int(input()) money=list(map(int,input().split())) keys=int(input()) rev=-1 a,b=0,-1 tot=[] #print(money[-3:-1]) x=0 for i in range(keys): #print(money[b:-1],money[0:a]) x=sum(money[b:])+sum(money[0:keys-abs(b)]) tot.append(x) b-=1 print(max(tot))

0.546888

def close_to_zero(t): if len(t)==0: return (0) x=t.split(" ") l=[] poz=[] neg=[] for i in x: l.append(int(i)) for i in l: if i == 0: return (0) if i>0: poz.append(i) if i<0: neg.append(i) if 0-min(poz)==...

0.546266

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): #print(*args, **kwargs, file=sys.stderr) # in python 3.4 **kwarg...

0.546051

# -*- coding: utf-8 -*- """ Created on Sun Apr 2 22:42:34 2017 @author: Sean38 """ n = int(input().rstrip()) s = input() a = [int(ch) for ch in s.split()] a = a[0:n] a.sort() def check_num(p, i): # i = ap + b(p+1) # min(a+b) <=> max(b) # b(p+1) <= i # b == i (mod p) max_b = (i // (p + 1)) b...

0.54473

class Solution: def splitArray(self, nums, m): """ :type nums: List[int] :type m: int :rtype: int """ accum = [0] N = len(nums) mmm = max(nums) if m >= N: return mmm res = 0 for i in nums: r...

0.544666

Given a string s, determine if it is valid. A string s is valid if, starting with an empty string t = "", you can transform t into s after performing the following operation any number of times: Insert string "abc" into any position in t. More formally, t becomes tleft + "abc" + tright, where t == tleft + tright. Note...

class Solution: def isValid(self, s: str) -> bool: if not s: return True return self.isValid(s.replace('abc', '')) if s.replace('abc', '') != s else False

0.846075

_ = input() S = input() print((S.count("ABC")))

0.746546

'''input aabc ''' def list_input(): return list(map(int,input().split())) def map_input(): return map(int,input().split()) def map_string(): return input().split() s = input() a = s.count('a') b = s.count('b') c = s.count('c') ans = "YES" if(a == 0 or b == 0): ans = "NO" if(c != a and c != b): ans = "...

0.696709

def main(): s = input() n = len(s) poss = False for i in range(n - 2): t = s[i:i + 3] if 'A' in t and 'B' in t and 'C' in t: poss = True break print('Yes' if poss else 'No') main()

0.687319

# cook your dish here for _ in range(int(input())): s=input() while(s.count("abc")!=0): s=s.replace("abc","") print(s)

0.636468

S = list(input()) S.sort() if S == ['a', 'b', 'c']: print("Yes") else: print("No")

0.630526

s = input() if s[0] == 'A' and s[2:-1].count('C') == 1 and s.replace('A','').replace('C','').islower(): print('AC') else: print('WA')

0.623078

def main(): n, a, b, c = map(int, input().split()) Ss = [input() for _ in range(n)] ans = [] f = True if a+b+c == 0: print("No") elif a+b+c == 1: for i in range(n): if Ss[i] == "AB": if a == 0 and b == 0: f = False ...

0.610586

class Solution: def checkRecord(self, s): count = 0 for i in range(0,len(s)): if s[i] == "A": count += 1 if count == 2: return False elif i >= 2 and s[i] == "L" and s[max(i-1,0)] == "L" and s[max(i-2,0)] == "L": ...

0.607079

class Solution: def longestDiverseString(self, a: int, b: int, c: int) -> str: if a == 0 and b == 0 and c == 0: return '' res = '' heap = [(-a, 'a'), (-b, 'b'), (-c, 'c')] heapq.heapify(heap) prev_val = 0 prev_char = '' while heap: v...

0.594719

# python3 import sys def read_all_following_lines(): lines = sys.stdin.readlines() return (tuple(map(int, line.split())) for line in lines) class AbcString(object): def __init__(self, string): self.prefix_bc = [0] self.a_strike = [0] bc, strike = 0, 0 for symbol in strin...

0.594424

class Solution: def countGoodTriplets(self, arr: List[int], a: int, b: int, c: int) -> int: da = defaultdict(set) db = defaultdict(set) dc = defaultdict(set) for i in range(len(arr)-1): for j in range(i+1,len(arr)): dis = abs(arr[j]-arr[i]) ...

0.583825

n = int(input()) arr = [] for i in range(n): s = input() arr.append('<') arr.append('3') for j in range(len(s)): arr.append(s[j]) arr.append('<') arr.append('3') s = input() cur = 0 i = 0 while cur < len(s) and i < len(arr): if s[cur] == arr[i]: i+=1 cur+=1 if i == len(arr): ...

0.583205

def main(): mod = 10**9 + 7 s = input() n = len(s) a_num = 0 c_num = s.count('C') q_num = 0 q_cnt = s.count('?') pow3, pow2, pow1, pow0 = 0, 0, 0, 0 if q_cnt >= 3: pow3 = pow(3, q_cnt-3, mod) pow2 = pow3 * 3 % mod pow1 = pow2 * 3 % mod pow0 = pow1 * ...

0.579412

def is_in_middle(s): while len(s)>4: s = s[1:-1] return 'abc' in s

0.577532

s = input() if s == 'ABC': print('ARC') else: print('ABC')

0.576495

class Solution: def strWithout3a3b(self, A: int, B: int) -> str: if A >= 2*B: return 'aab'* B + 'a'* (A-2*B) elif A >= B: return 'aab' * (A-B) + 'ab' * (2*B - A) elif B >= 2*A: return 'bba' * A + 'b' *(B-2*A) else: return 'bba' * (B-A) ...

0.573738

A,S,C=map(str,input().split()) print("A"+S[0]+"C")

0.567374

# cook your dish here t=int(input()) for _ in range(t): s=input() k=len(s) count=0 for i in range(k-1): if(s[i]=="C"): if(s[i+1]=='E'or s[i+1]=='S' or s[i+1]=="C"): count+=1 elif(s[i]=="E"): if(s[i+1]=="S"or s[i+1]=='E'): count+=1 elif(s[i]=="S"): if(s[i+1]=="S"): count+=1 if (count==...

0.561193

from collections import defaultdict, deque, Counter from heapq import heappush, heappop, heapify import math import bisect import random from itertools import permutations, accumulate, combinations, product import sys import string from bisect import bisect_left, bisect_right from math import factorial, ceil, floor fro...

0.56029

from collections import Counter def solve(s): return any(len(set(Counter(s.replace(c, '', 1)).values())) == 1 for c in s)

0.558802

def num(s): ans1 = [0]*n for q in range(n): ans1[q] = s[q] == 'a' sum1 = 0 for q in range(n): w = sum1*(s[q] == 'b') sum1 += ans1[q] ans1[q] = w sum1 = 0 for q in range(n): w = sum1*(s[q] == 'c') sum1 += ans1[q] ans1[q] = w sum1 = 0 ...

0.558511

A = input() B = input() C = input() turn = 'a' while True: if turn == 'a': if len(A) == 0: print('A') break turn = A[0] A = A[1:] elif turn == 'b': if len(B) == 0: print('B') break turn = B[0] B = B[1:] else: if len(C) == 0: print('C') break turn...

0.558263

import sys sys.setrecursionlimit(10 ** 6) INF = float("inf") MOD = 10 ** 9 + 7 def input(): return sys.stdin.readline().strip() def main(): N, S = input().split() N = int(N) ans = 0 for i in range(N): a = 0 c = 0 for j in range(i, N): if S[j] == "A": ...

0.555608

n = int(input()) s = input() s = list(map('_ABC'.index, s)) s0 = s[0] MOD = 10 ** 9 + 7 dp = [0, 0, 0, 0] dp[s0] = 1 p = 1 while p < n and s[p] == s0: p += 1 xor = 0 if p % 2 == 0 else s0 for i, c in enumerate(s[p:], start=p): d, e = c % 3 + 1, (c + 1) % 3 + 1 dp[c] = sum(dp) % MOD dp[d], dp[e] =...

0.553828

def solve(s,a,b): return s[:a]+s[a:b+1][::-1]+s[b+1:]

0.552969

# coding: utf-8 # Your code here! def solve(s, c): if(len(s)==1): if s[0]==c: return 0 else: return 1 ans1 = sum([i!=c for i in s[:len(s)//2]]) + solve(s[len(s)//2:],chr(ord(c)+1)) ans2 = sum([i!=c for i in s[len(s)//2:]]) + solve(s[:len(s)//2],chr(ord(c)+1)) ret...

0.546668

import sys fin = sys.stdin fout = sys.stdout #fin = open("input.txt", 'r') #fout = open("output.txt", 'w') s = fin.readline().strip() n = len(s) for L in range(n): for R in range(L + 1, n + 1): s1 = s[:L] s2 = s[L:R] s3 = s[R:] if (s1 + s3 == "CODEFORCES"): print("YES"...

0.543007

# -*- coding: utf-8 -*- import sys from operator import add def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c] * b for i in range(a)] def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in r...

0.542862

def solve(st): return all(True if ord(x) - ord(y) in [-2, 0, 2] else False for x, y in zip(st, st[::-1]))

0.538219

class Solution: def isScramble(self, A, B): if len(A) != len(B) or sorted(A) != sorted(B): return False if len(A) == 1 or A == B: return True for i in range(1, len(A)): if self.isScramble(A[:i], B[:i]) and self.isScramble(A[i:], B[i:]): ...

0.537576

# coding=utf-8 from functools import reduce a = input() b = input() c = input() alen = len(a) blen = len(b) clen = len(c) kmpnext = [0]*(clen+1) i = 1 j = 0 while i < clen: while j > 0 and c[i]!=c[j]: j = kmpnext[j] if c[i] == c[j]: j+=1 kmpnext[i+1] = j i+=1 #print(kmpnext) f = [[[0 for i in range(clen+2)]...

0.535363

class Solution: def generateTheString(self, n: int) -> str: if n%2 == 0: return ''.join(['a']*(n-1) + ['b']) else: if n == 1: return 'a' else: return ''.join(['a']*(n-2) + ['bc'])

0.532681

import math class Solution: def __init__(self): self.happy_string = '' def getHappyString(self, n: int, k: int) -> str: # determine starting character poss_per_group = 2 ** (n - 1) group_num = math.ceil(k / poss_per_group) - 1 starting_char = '' # c...

0.529335

N = input() print("ABC"+N)

0.527861

s=input() dp=[[0,0,0] for i in range(len(s))] for i in range(len(s)): if s[i]=='a': dp[i][0]=dp[i-1][0]+1 dp[i][1]=dp[i-1][1] dp[i][2]=max(dp[i-1][1]+1,dp[i-1][2]+1) else: dp[i][0]=dp[i-1][0] dp[i][1]=max(dp[i-1][0]+1,dp[i-1][1]+1) dp[i][2]=dp[i-1][2] e=len(s)-1 p...

0.524389

x = int(input()) if x < 1200: print('ABC') else: print('ARC')

0.523429

class Solution: def isInterleave(self, s1, s2, s3): """ :type s1: str :type s2: str :type s3: str :rtype: bool """ if len(s3) != len(s1) + len(s2): return False if not s1 or not s2: return (s1 or s2) == s3 op...

0.522385

class Solution: def canThreePartsEqualSum(self, A: List[int]) -> bool: # if len(A)<3: # return # i = 1 # j = len(A)-2 # tgtsum = sum(A)/3 # sum1 = sum(A[:i]) # while i<(len(A)-2) and sum1!=tgtsum: # sum1 = sum1 + A[i]...

0.519188

import sys #sys.stdin=open("data.txt") input=sys.stdin.readline # so the ending sequence is b...ba...a # find length of ending sequence extra=0 need=0 for ch in input().strip(): if ch=='a': need=(need*2+1)%1000000007 else: extra=(extra+need)%1000000007 print(extra)

0.5166

#!/usr/bin/env python3 M = 998244353 def powmod(a, x, m = M): y = 1 while 0 < x: if x % 2 == 1: y *= a y %= m x //= 2 a = a ** 2 a %= m return y def solve(s): n = len(s) nb = nc = 0 ch = s[0] if ch == 'b': nb += 1 eli...

0.514725

class Solution: def hasAllCodes(self, s: str, k: int) -> bool: if len(s) < 2 ** k + k - 1: return False # Cannot be a string, as this is the de brujin length target = 2 ** k seen = set() cur_len = 0 for end in range(k, len(s) + 1): chunk = s[end - k: e...

0.513822

n = int(input()) s = "aabb" * ((n+4)//4) s = s[:n] print(s)

0.512995

a='ABD' if int(input())<1000:a='ABC' print(a)

0.509998

def solve(s): v = sum(s[i] != s[-1-i] for i in range((len(s))//2) ) return v == 1 or not v and len(s)%2

0.507433

a = [] b = [] x = input() for i in range(len(x)-1): if x[i]+x[i+1] == 'AB': a.append(i) elif x[i]+x[i+1] == 'BA': b.append(i) if a == [] or b == []: print("NO") quit() if abs(min(a)-max(b))>1 or abs(max(a)-min(b))>1: print("YES") quit() print("NO")

0.507412

from collections import Counter from functools import reduce from math import gcd def has_subpattern(string): return reduce(gcd, Counter(string).values()) != 1

0.505055

def check(s): arr=[s[0]] l=len(s) f1=0 for i in range(1,l): if arr==[]: arr.append(s[i]) elif arr[-1]!=s[i]:arr.append(s[i]) else: del arr[-1] if arr==[]: return True else: return False count = 0 for t in range(eval(input())): s=input().strip() if check(s): count+=1 print(count)

0.505054

def checkValidity(s): count = 0 previous = "" for x in s: if count == 0: previous = x count += 1 elif count == 1: count = 0 if previous == x: return "no" return "yes" t = int(input()) for _ in range(t): s = input() print(checkValidity(s))

0.504755

class StreamChecker: def __init__(self, words: List[str]): #reverse trie self.trie = {} self.stream = deque([]) for word in set(words): node = self.trie for ch in word[::-1]: if not ch in node: node[ch] = {} ...

0.502988

def is_triangle(a, b, c): return (a<b+c) and (b<a+c) and (c<a+b)

0.502446

def solve(s): return any(s[i+1:] + s[:i+1] == s[i::-1] + s[:i:-1] for i in range(len(s)))

0.502285

S = input() SA = [0] n = 0 for c in S: if c=='A': n+=1 SA.append(n) T = input() TA = [0] n = 0 for c in T: if c=='A': n+=1 TA.append(n) q = int(input()) for _ in range(q): a, b, c, d = list(map(int, input().split())) nSA = SA[b]-SA[a-1] nSB = b-a+1-nSA nTA = TA[d]-TA[c-1] nTB = d...

0.50179

L=[] for i in range(4): L.append(input()) ans="NO" for i in range(3): for j in range(3): x=L[i][j]+L[i][j+1]+L[i+1][j]+L[i+1][j+1] if(x.count('#')==3 or x.count('.')==3 or x.count('#')==4 or x.count('.')==4): ans="YES" print(ans)

0.498996

for _ in range(int(input())): a, b, c = input(), input(), input() n = len(a) ok = True for i in range(n): if c[i] not in [a[i], b[i]]: ok = False print('YES' if ok else 'NO')

0.49888

class Solution: def threeConsecutiveOdds(self, arr: List[int]) -> bool: flag = False odd = 0 i = 0 while i < len(arr): if arr[i] % 2 == 1: if not flag: flag = True odd += 1 i += 1 ...

0.49802

class Solution: def findMinStep(self, board, hand): """ :type board: str :type hand: str :rtype: int """ res=float("inf") hmap=collections.defaultdict(int) for c in hand: hmap[c]+=1 res=self.helper(board,hmap) if...

0.497045

def solution(s): st=[1 for i in range(1,len(s)) if s[i-1]==s[i]] return sum(st)

0.495848

s=input() if(len(s)<=3): print(0) else: n=len(s) ans=0 A=0 for i in range(3,n): if(s[i-3]+s[i-2]+s[i-1]+s[i]=='bear'): ans+=((i-3)-A+1)*(n-i) A=i-2 print(ans)

0.495368

a = input() atcg =["A","T","C","G"] result =[] res= 0 for i in a: if i in atcg: res +=1 else: res = 0 result.append(res) print(max(result))

0.494058

def permute_a_palindrome (input): return sum( input.count(c)%2 for c in set(input) ) < 2

0.493008

def mat(shape, inital_val=None): if len(shape) > 1: return [mat(shape[1:], inital_val) for _ in range(shape[0])] else: return [inital_val] * shape[0] def main(): n, m = [int(x) for x in input().split()] graph = [{} for _ in range(n)] for _ in range(m): v, u, c ...

0.492359

class MagicDictionary: def __init__(self): """ Initialize your data structure here. """ self.l = [] def buildDict(self, dict): """ Build a dictionary through a list of words :type dict: List[str] :rtype: void """ sel...

0.49233

num = input() cnt = 0 for _ in range(int(num)): a = input() b = list(a) if b[0] == b[2]: cnt += 1 if cnt >= 3: print('Yes') break else: cnt = 0 if cnt <= 2: print('No')

0.492163

a,b,c=map(int, input().split()) print("YES" if b-a==c-b else "NO")

0.491621

def f(x): z=[0 for i in range(len(x))] l=0 r=0 for i in range(1,len(x)): if i<=r: z[i]=min(z[i-l],r-i+1) while i+z[i]<len(x) and x[z[i]]==x[i+z[i]]: z[i]+=1 if i+z[i]-1>r: l,r=i,i+z[i]-1 return z a=list(map(int,input('').split())) n,a,b=a[0...

0.491604

k = ''' H He Li Be B C N O F Ne Na Mg Al Si P S Cl Ar K Ca Sc Ti V Cr Mn Fe Co Ni Cu Zn Ga Ge As Se Br Kr 5 Rb Sr Y Zr Nb Mo Tc Ru Rh Pd Ag Cd In Sn Sb Te I Xe Cs Ba La Ce Pr Nd Pm Sm Eu Gd Tb Dy Ho Er Tm Yb Lu Hf Ta W Re Os Ir Pt Au Hg Tl Pb Bi Po At Rn Fr Ra Ac Th Pa U Np Pu Am Cm Bk Cf Es Fm Md No Lr Rf ...

0.491516

s = input().strip() if len(s)<=2: print(s) return ne = s[0]+s[1] for i in range(2,len(s)): if s[i]!=s[i-1] or s[i]!=s[i-2]: ne+=s[i] ne2 = ne[:3] for i in range(3,len(ne),1): if ne2[-3]==ne2[-2] and ne2[-1]==ne[i]: pass else: ne2+=ne[i] print(ne2)

0.491073

for _ in range(int(input())): n = int(input()) data = input() count = 0 while "AP" in data: data = data.replace("AP", "AA") count += 1 print(count)

0.491064

R = int(input()) if R < 1200: print("ABC") elif R < 2800: print("ARC") else: print("AGC")

0.490629

def go(): for i in range(8): s = input() prv = 0 for j in s: if j == prv: return False prv = j return True print("YES" if go() else "NO")

0.489844

def divisible_by_three(s): return int(s) % 3 == 0

0.489434

n = int(input()) mod = 10**9+7 a = [] l = ["A","C","G","T"] ban = ["AAGC","CAGC","GAGC","TAGC","AGCA","AGCC","AGCG","AGCT","AGAC","CGAC","GGAC","TGAC","GACA","GACC","GACG","GACT","AACG","CACG","GACG","TACG","ACGA","ACGC","ACGG","ACGT","ATGC","ACGC","AGGC","AGTC","AGGC","AGAC"] for i in l: for j in l: for k ...

0.487738

def modgroup(M = 10**9+7, invn = 0) : exec(f'''class mod{M} : inv = [None] * {invn} if {invn} >= 2 : inv[1] = 1 for i in range(2, {invn}) : inv[i] = (({M}-{M}//i)*inv[{M}%i])%{M} def __init__(self, n = 0) : self.n = n % {M} __repr__ = lambda self : str(self.n) + '%{M}' __int__ = lambda self : self.n __eq__ = la...

0.485595

from collections import Counter class Solution: def canConstruct(self, s: str, k: int) -> bool: if k > len(s): #return False return False counter = Counter(s) odd_counts = 0 for char in counter: if counter[char] % 2 == 1: odd_counts +=...

0.485476

for _ in range(int(input())): n, a, b = map(int, input().split()) s = input().strip() ans = (n + 1) * b + n * a if '1' in s: ans += 2 * a s = s[s.find('1'):s.rfind('1') + 1] t = [0] * (len(s) + 1) for i in range(len(s)): x = int(s[i]) t[i] = m...

0.484857

class Solution: def wordBreak(self, s, wordDict): n = len(s) dp = [False for i in range(n+1)] dp[0] = True for i in range(1,n+1): for w in wordDict: if dp[i-len(w)] and s[i-len(w):i]==w: dp[i]=True return dp[-1]

0.484223

s1,s2,s3 = input().split() print("YES") if s1[-1]==s2[0] and s2[-1]==s3[0] else print("NO")

0.483361

from bisect import bisect_left as bl from bisect import bisect_right as br import heapq import math from collections import * from functools import reduce,cmp_to_key import sys input = sys.stdin.readline M = mod = 10**9 + 7 def factors(n):return sorted(set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5)...

0.482925

def solve(a, b): if len(a) is 1: return b.count(a) index = [x for x in range(len(b)-1) if b[x] is a[0]] return sum(solve(a[1:], b[x+1:]) for x in index)

0.481488

n = input() print("Yes" if n[0] == n[1] == n[2] or n[1] == n[2] == n[3] else "No")

0.481461

kk=0 x = int(input()) y = input() z = [i for i in range(len(y)) if y[i] == '*'] for i in range(0, 100): for j in range(1, 100): if i in z and i+j in z and i+2*j in z and i+3*j in z and i+4*j in z: kk=1 if kk==1: print("yes") else: print("no")

0.481253

s=input() n=len(s) a=[] curr=0 for i in range(n): if s[i]=="a": curr+=1 elif s[i]=="b": a.append(curr) curr=0 if curr>0: a.append(curr) prod=1 for i in range(len(a)): prod*=(a[i]+1) prod=prod%1000000007 print(prod-1)

0.480878

import string def solve(st): return ''.join(sorted(st)) in string.ascii_letters

0.480481

print('YNeos'[input()+(T:=input())[-1]!=T::2])

0.479007

import sys input = sys.stdin.readline n=int(input()) s=list(input().strip()) ANS=0 for i in range(0,n,2): if s[i]==s[i+1]: ANS+=1 if s[i]=="a": s[i]="b" else: s[i]="a" print(ANS) print("".join(s))

0.47829

class Solution: def removePalindromeSub(self, s: str) -> int: # 'a' 1 # 'aa' 1 # 'ab' 2 # 'abb' 2 # 'aabb' 2 # 'abba' 1 # 'abaaba' if len(s) == 0: return 0 if s == s[::-1]: return 1 return 2

0.478035

a, b, c = list(map(int, input().split())) p = [0] * 100000 p[0] = 1 p[a] = 1 p[b] = 1 for i in range(c + 1): if p[i]: p[i + a] = 1 p[i + b] = 1 if p[c]: print('Yes') else: print('No')

0.477683

t=int(input()) count=[] for i in range(t) : s = input() a,b,c,n = s.split() n=int(n) d = int(a+b*n+c,2) count.append(0) while(d>0) : d=(d&(d+1))-1 count[i]+=1 for i in range(t) : print(count[i])

0.477583

brackets = {"}":"{","]":"[",")":"("} def braces_status(s): stack = [] for c in s: if c in "[({": stack.append(c) elif c in "])}": if not stack or stack.pop() != brackets[c]: return False return not stack

0.477535

s = input() arr_ans = [0] * len(s) for i in range(1, len(s)): if s[i] == 'a': arr_ans[i - 1] = (arr_ans[i - 1] + 1) % 2 arr_ans[i] += 1 print(*arr_ans)

0.476408

n,m=list(map(int,input().split())) f=[input() for _ in range(n)] def clr(ss): cc = None for s in ss: for c in s: if cc is None: cc = c elif cc != c: return None return cc if n%3 == 0: s = set() for i in range(0,n,n//3): ret = cl...

0.475084

import sys, logging logging.basicConfig(level=logging.INFO) logging.disable(logging.INFO) def build(S, n): Z = [0 for i in range(3 * n + 3)] #logging.info(S) n = len(S) L = 0 R = 0 Z[0] = n for i in range(1, n): if(i > R): L = R = i while(R < n and S[R] == S[...

0.474898

t = input() z = t.count('a') q = (len(t) - z) // 2 s = t[:q + z] ss = t[q + z:] p = ''.join([i for i in s if i != 'a']) if p == ss: print(s) else: print(':(')

0.474493

from collections import Counter def common(a,b,c): return sum((Counter(a) & Counter(b) & Counter(c)).elements())

0.472233

import sys, math s=input() pal='AHIMOoTUVvWwXxY' n=len(s) l=0 r=n-1 flag=True fir='pq' sec='bd' while l<=r: if s[l]==s[r] and s[l] in pal: l+=1 r-=1 continue elif s[l]==s[r]: flag=False break elif (s[l] in fir) and (s[r] in fir): l+=1 r-=1 cont...

0.471787

from collections import Counter from functools import reduce from fractions import gcd def has_subpattern(s): c = Counter(s) m = reduce(gcd, c.values()) return ''.join(sorted(k*(v//m) for k,v in c.items()))

0.471749

class Solution: def numWays(self, s: str) -> int: n = s.count('1') if n % 3 != 0: return 0 if n == 0: return (((len(s) - 1) * (len(s) - 2)) // 2) % (10**9 + 7) m = n // 3 L = s.split('1') return ((len(L[m]) + 1) * (len(L[2*m]) + 1)) % (10**9 + 7)

0.470853

def palindrome_rearranging(s): return sum(s.count(c) % 2 for c in set(s)) < 2

0.470527

X = [[], ['0', '1'], ['00', '01', '10', '11'], ['001', '010', '011', '100', '101', '110'], ['0010', '0011', '0100', '0101', '0110', '1001', '1010', '1011', '1100', '1101'], ['00100', '00101', '00110', '01001', '01011', '01100', '01101', '10010', '10011', '10100', '10110', '11001', '11010', '11011'], ['001001', '001011'...

0.470462

input() s = input() if 'MM' in s or 'YY' in s or 'CC' in s: print ('No') elif s.startswith('?') or s.endswith('?'): print ('Yes') elif '??' in s: print ('Yes') elif 'C?C' in s or 'M?M' in s or 'Y?Y' in s: print ('Yes') else: print ('No')

0.470404

You are given two strings s and t of the same length. You want to change s to t. Changing the i-th character of s to i-th character of t costs |s[i] - t[i]| that is, the absolute difference between the ASCII values of the characters. You are also given an integer maxCost. Return the maximum length of a substring of s t...

class Solution: def equalSubstring(self, s: str, t: str, maxCost: int) -> int: dist = [ abs( ord(s[i]) - ord(t[i]) ) for i in range(len(s))] # i = 0 # cur = 0 # res = 0 # for j in range(len(s)): # cur += dist[j] # while cur>maxCost: # ...

0.858401

class Solution: def minCost(self, s: str, cost: List[int]) -> int: delete_cost = 0 last = 0 for i in range(1, len(s)): if s[last] == s[i]: if cost[last] < cost[i]: delete_cost += cost[last] last = i else: ...

0.706439

for _ in range(eval(input())): S1=input() m1=len(S1)/2 S2=input() m2=len(S2)/2 d1={} d2={} for i in range(len(S1)): c=S1[i] v=abs(m1-i) if c in d1: if v<d1[c][0]: d1[c]=[v,i] else: d1[c]=[v,i] for i in range(len(S2)...

0.675884

class Solution: def minSteps(self, s: str, t: str) -> int: s_count=[s.count(chr(i)) for i in range(97,123)] t_count=[t.count(chr(i)) for i in range(97,123)] diff=[t_count[i]-s_count[i] for i in range(26) if t_count[i]-s_count[i]>0] sum=0 for i in range(len(diff)): ...

0.661606

class Solution: def kSimilarity(self, A: str, B: str) -> int: a = '' b = '' for i in range(len(A)): if A[i] != B[i]: a+=A[i] b+=B[i] return self.dfs(a,b) def dfs(self,a,b): if not a: ...

0.651955

from collections import defaultdict as dd def find(a, b): n = len(a) m = len(b) dp = [[0]*(m+1) for i in range(n+1)] for i in range(n-1,-1, -1): for j in range(m-1, -1, -1): if a[i] == b[j]: dp[i][j] = dp[i+1][j+1] + 1 mx = dd(int) ans = 0 for i in range(n-1, -1, -1): for j in range(m-1, -1, -1): ...

0.648551

for t in range(int(input())): s = input() r = input() diff = list() index = list() cnt = 0 for i in range(len(s)): if s[i] != r[i]: cnt += 1 index.append(i) for i in range(1, len(index)): diff.append(index[i] - index[i - 1] - 1) diff.sort() fmin = cnt ** 2 oper = cnt ; moves = cnt for i in diff: ...

0.646135

import sys input = sys.stdin.readline s = input() t = input() l, r = [0]*len(t), [0]*len(t) li, ri = 0, len(s) - 1 for i in range(len(t)): while s[ li ] != t[ i ]: li += 1 while s[ ri ] != t[ - i - 1 ]: ri -= 1 l[ i ] = li r[ -i -1 ] = ri li += 1 ri -= 1 print( max( [ r[ 0 ], le...

0.641273

s = input() t = input() l, r = [0]*len(t), [0]*len(t) li, ri = 0, len(s) - 1 for i in range(len(t)): while s[ li ] != t[ i ]: li += 1 while s[ ri ] != t[ - i - 1 ]: ri -= 1 l[ i ] = li r[ -i -1 ] = ri li += 1 ri -= 1 print( max( [ r[ 0 ], len(s) - l[ -1 ] - 1 ] + [ max( 0, r[ i ...

0.641051

from collections import * def go(): n,s,t=int(input()),input(),input() if Counter(s)!=Counter(t): return -1 ans=0 for i in range(n): k=0 for j in range(i,n): while k<n and s[k] != t[j]: k += 1 if k == n: break k += 1 ans = max(ans, j-i+1) return n-ans for _ in range(int(input())): print(go())

0.638413

S = input() T = input() base = 998244353 dp = [[0 for _ in range(len(S) + 1)] for _ in range(len(S) + 1)] for j in range(1, len(S) + 1): if (j > len(T)) or (S[0] == T[j - 1]): dp[1][j] = 2 for i in range(2, len(S) + 1): for j in range(1, len(S) - i + 1 + 1): if (j > len(T)) or (S[i - 1] == T[j -...

0.635865

# import collections, atexit, math, sys, bisect sys.setrecursionlimit(1000000) def getIntList(): return list(map(int, input().split())) try : #raise ModuleNotFoundError import numpy def dprint(*args, **kwargs): print(*args, **kwargs, file=sys.stderr) dprint('debug mode') except ...

0.629568

def check(w, s): j = 0 for i in range(len(s)): while j < len(w) and s[i] != w[j]: j += 1 if j >= len(w) or s[i] != w[j]: return False j += 1 return True n = int(input()) s = input() t = input() st = [] i = 0 while i < n and s[i] == t[i]: st.append(s[i]) ...

0.622582

def levenshtein(a,b): d = [[0] * (len(b) + 1) for _ in range(len(a) + 1)] d[0][:] = list(range(len(b)+1)) for i in range(1, len(a) + 1): d[i][0] = i for i, x in enumerate(a): for j, y in enumerate(b): d[i+1][j+1] = min(1 + d[i][j+1], 1 + d[i+1][j], d[i][j] + (1 if x != y el...

0.620185

class Solution: def longestCommonSubsequence(self, a: str, b: str) -> int: last, current = [0] * (len(b) + 1), [0] * (len(b) + 1) for i in range(len(a) - 1, -1, -1): for j in range(len(b) - 1, -1, -1): if a[i] == b[j]: current[j] = 1 + last[j ...

0.619999

class Solution: def minDeletionSize(self, A: List[str]) -> int: dp = [(1, 1)] * len(A[0]) for i in range(len(dp)): if i > 0: max_pre = None for pre in range(i - 1, -1, -1): for word in A: if word[pre] > word[i]: ...

0.607941

t=input() s=input() n=len(s) h=[0]*(n+1) h[0]=0 j=0 fa=[0]*(n+1) for i in range(2,n+1) : while j and s[i-1]!=s[j]: #j=fa[j-1]; j=fa[j]; if s[i-1]==s[j]: j+=1 fa[i]=j; #print(fa) l=list() j=fa[n] while(j>0): l.append(j) j=fa[j] tmp=t t=s s=tmp n=len(s) dp=[0]*(n) m=[0]*n ...

0.60492

class Solution: def maxUncrossedLines(self, A, B): # Optimization #commons = set(A).intersection(set(B)) # or commons = set(A) & set(B) #A = [x for x in A if x in commons] #B = [x for x in B if x in commons] N1, N2 = len(A), len(B) dp = [[0 for _ in range(N2+1)] for ...

0.604539

n = int(input()) s = input() code = input() res = 0 for i in range(n): k = abs(int(s[i]) - int(code[i])) res += min(k, 10 - k) print(res)

0.601156

s = input() t = input() m = 1000 for i in range(len(s) - len(t) + 1): c = 0 for j in range(len(t)): if s[i + j] != t[j]: c += 1 m = min(m, c) print(m)

0.600133

import sys input = sys.stdin.readline sys.setrecursionlimit(10 ** 7) import numpy as np # 適当な素数と原始根でrolling hash MOD = 10 ** 9 + 993 base = 123450 S = np.array([ord(x) for x in input().rstrip()],dtype=np.int64) T = np.array([ord(x) for x in input().rstrip()],dtype=np.int64) # Sの方が長くする LS = len(S) LT = len(T) n = (L...

0.600065

s = list(input()) t = list(input()) cnt = 0 for i in range(3): if s[i] == t[i]: cnt += 1 print(cnt)

0.596011

from functools import lru_cache def failure(pat): i, target, n = 1, 0, len(pat) res = [0] while i < n: if pat[i] == pat[target]: target += 1 res.append(target) i+=1 elif target: target = res[target-1] else: res.append(0) ...

0.595076

class Solution: def findLength(self, A, B): def check(length): seen = {A[i:i+length] for i in range(len(A) - length + 1)} return any(B[j:j+length] in seen for j in range(len(B) - length + 1)) A = ''.join(map(chr, A)) ...

0.595059

# cook your dish here try: a,b,da=list(input()),input(),list(map(int,input().split())) print(len(a)-len(b)) except: pass

0.593413

class Solution: def numDistinct(self, s, t): """ :type s: str :type t: str :rtype: int """ setOft=set(t) news="" for ch in s: if ch in setOft: news+=ch dp=[[1 for i in range(len(news)+1)] for j in range(l...

0.589607

# import sys # sys.stdin = open('in.txt', 'r') _ = input() s = input() t = input() par = [i for i in range(26)] def find(x): if par[x] != x: par[x] = find(par[x]) return par[x] else: return x for i in range(len(s)): a, b = find(ord(s[i])-97), find(ord(t[i])-97) if a != b: ...

0.588402

n,pos= (int(x) for x in input('').split()) s = input('') def dis(a, b): a=ord(a) b=ord(b) return min(abs(a - b), abs(a+26-b), abs(b+26-a)) d = [dis(s[i], s[len(s)-i-1]) for i in range((len(s) + 1)//2)] pos -= 1 if pos >= (len(s) + 1) // 2: pos = len(s) - pos - 1 #print(pos) #print(d) for rightmost, ...

0.587917

# AC import sys sys.setrecursionlimit(1000000) class Main: def __init__(self): self.buff = None self.index = 0 def __next__(self): if self.buff is None or self.index == len(self.buff): self.buff = self.next_line() self.index = 0 val = self.buff[self.ind...

0.585842

class Solution: def canConvertString(self, s: str, t: str, k: int) -> bool: if len(s) != len(t): return False c = Counter((ord(c2) - ord(c1)) % 26 for c1, c2 in zip(s, t)) return k >= max( (m + 26 * (count - 1) for m, count in list(c.items()) if m), ...

0.585327

s = input()[::-1] t = input()[::-1] i = 0 while i < min(len(s),len(t)) and s[i] == t[i]: i += 1 print(len(s) - i + len(t) - i)

0.584386

import sys from math import * def minp(): return sys.stdin.readline().strip() def mint(): return int(minp()) def mints(): return map(int, minp().split()) def add(a,b): return (a+b)%1000000007 def sub(a,b): return (a+1000000007-b)%1000000007 def mul(a,b): return (a*b)%1000000007 p = 102367 s = list(map(int,...

0.583242

import re def buy_newspaper(s1, s2): p = re.sub(r"(.)", r"\1?", s1) return -1 if set(s2) - set(s1) else len(re.findall(p, s2)) - 1

0.58315

n, m, k = map(int, input().split()) s, t = input(), input() n += 1 m += 1 p = [i for i in range(n * m - n) if (i + 1) % n] r = p[::-1] d = [0] * n * m for i in p: if s[i % n] == t[i // n]: d[i] = d[i - n - 1] + 1 f = d[:] for y in range(k - 1): for i in p: f[i] = max(f[i], f[i - 1], f[i - n]) for i in...

0.582588

from collections import Counter def solve(A,B): a = Counter(A) b = Counter(B) ans = 0 for i in a: if i in b: ans += min(a[i],b[i]) return ans t = int(input()) for _ in range(t): A = input() B = input() print(solve(A,B))

0.576087

s = input() t = input() n = len(s) m = len(t) t = t + '$' + s p = [0] * (n + m + 1) k = 0 for i in range(1, n + m + 1): while k > 0 and t[k] != t[i]: k = p[k - 1] if t[k] == t[i]: k += 1 p[i] = k ans = [0] * n sums = [0] * (n + 1) curs = 0 was = False j = 0 MOD = 10 ** 9 + 7 for i in ran...

0.575135

t=eval(input()) for _ in range(t): i,j=list(map(int,input().split())) bi=bin(i)[2:] bj=bin(j)[2:] k=0 while k<(min(len(bi),len(bj))): if bi[k]!=bj[k]: break else: k+=1 print(len(bi)-k+len(bj)-k)

0.573231

class Solution: def maxPower(self, s: str) -> int: n = len(s) count = 0 res = s[0] cur_count = 1 # Traverse string except # last character for i in range(n): # If current character # matches with next ...

0.571768

class Solution: def getMaxRepetitions(self, s1, n1, s2, n2): """ :type s1: str :type n1: int :type s2: str :type n2: int :rtype: int """ if s2=='aac' and n2==100: return 29999 i,j=0,0 l1=len(s1) l2=len(s...

0.570193

class Solution: def longestAwesome(self, s: str) -> int: cum = [0] firsts = {0: -1} lasts = {0: -1} for i, c in enumerate(s): cum.append(cum[-1] ^ (1 << (ord(c) - 48))) if cum[-1] not in firsts: firsts[cum[-1]] = i lasts[cum[-1]] = ...

0.569965

s = input() pole = input() t = 0 count = 0 for i in range(len(pole)): if pole[i] == s[t]: t += 1 if t == len(s): break count += 1 t -= 1 for i in range(len(pole) - 1, -1, -1): if pole[i] == s[t]: t -= 1 if t == -1: count1 = i break if count1 - count > 0: p...

0.568734

class Solution: def findTheLongestSubstring(self, s: str) -> int: s = s + 'a' bits, dp = {'a':0,'e':1,'i':2,'o':3,'u':4}, {0:-1} res = 0 key = 0 for i, char in enumerate(s): if char in bits: if key in dp: res = m...

0.568659

def ii(): return int(input()) def mi(): return list(map(int, input().split())) def li(): return list(mi()) # B. The Fair Nut and Strings n, k = mi() s = input().strip() t = input().strip() ans = 0 jj = 0 for i in range(n): if s[i] == t[i]: ans += 1 jj = i + 1 else: break c...

0.568214

g = "ACTG" def dist(a, b): p = abs(ord(a) - ord(b)) return min(p, 26 - p) def price(s): return sum(dist(x, y) for x, y in zip(g, s)) n = int(input()) s = input() ans = 100000 for i in range(len(s) - 3): ans = min(ans, price(s[i:i+4])) print(ans)

0.566894

from collections import Counter def create_anagram(s, t): return sum((Counter(s) - Counter(t)).values())

0.566807

''' \"aabcaca\" 0123456 x devide conquer 先找到第一个stamp把string分成左右两部分（必须要）（On 然后从长到短用stamp的头match左边的部分，直到match到最头如果不能到最头则退出从长到短用stamp的尾巴match右边，直到match到尾巴，如果不能match到最尾巴则继续找下一个stamp 能把他分成左右这时的左边有个offset了，比如****b** offset是3，只要stamp的长度不超过头且能match上，就可以这个解法可以有nwin*M^2 其中m平方是在用stamp去match的时候最坏能从stamp最长match到1 可以给出最短...

0.566001

class Solution: def ladderLength(self, beginWord, endWord, wordList): wordDict = set(wordList) if not endWord in wordDict: return 0 visited = set() beginSet = set() beginSet.add(beginWord) visited.add(beginWord) endSet = set() ...

0.564729

n = int(input()) for i in range(n): count = 0 k = input() x = list(k) kk = input() y = list(kk) for j in y: for jj in x: if(j==jj): count = count+1 break print(count)

0.561568

n, m = map(int, input().split()) mi = 100000000000000 ts = "" def num_d(a, b): t = 0 for x in range(len(a)): if a[x] != b[x]: t += 1 return t s, t = input(), input() for x in range(m-n+1): d = num_d(s, t[x:x+n]) if d < mi: mi = d ts = t[x:x+n] print(mi) for x in range(n): if s[x] != ts[x]:...

0.561187

import sys def input(): return sys.stdin.readline()[:-1] from bisect import bisect def ctoi(c): return ord(c) - ord("a") print(ans) T = int(input()) for _ in range(T): s = input() t = input() if not (set(s) >= set(t)): print(-1) else: alph = [[] for _ in range(26)] for i in range(len(s)): alph[ctoi(s[...

0.560485

def upc(c): if c >= 'a' and c <= 'z': c = chr(ord(c) - ord('a') + ord('A')) return c a1, a2 = {}, {} for i in input(): if i in a1: a1[i] += 1 else: a1[i] = 1 for i in input(): if i in a2: a2[i] += 1 else: a2[i] = 1 r1, r2 = 0, 0 a3, a4 = {}, {} for k in a1...

0.559223

S = input() T = input() tigau = 0 for i in range(len(S)): if S[i] != T[i]: tigau += 1 print(tigau)

0.559124

class Solution: def maxScoreWords(self, words: List[str], letters: List[str], score: List[int]) -> int: let=Counter(letters) sc={} for i in range(26): sc[chr(i+ord('a'))]=score[i] word={} for w in words: word[w]=Counter(w) self.ans=0 us...

0.558767

def num(c): return ord(c) - 97 import sys input = sys.stdin.readline t = int(input()) for _ in range(t): n = int(input()) s1 = input().strip() s2 = input().strip() char1 = [0] * 26 char2 = [0] * 26 for c in s1: char1[num(c)] += 1 for c in s2: char2[num(c)] += 1 if ...

0.558464

class Solution: def findTheDifference(self, s, t): """ :type s: str :type t: str :rtype: str """ sums=sum([ord(i) for i in s]), sum([ord(i) for i in t]) return chr(sum([ord(i) for i in t])-sum([ord(i) for i in s]))

0.55818

class Solution: def characterReplacement(self, s, k): """ :type s: str :type k: int :rtype: int """ if s == "": return 0 count = {} lo = 0 hi = 0 max_letter = 0 for hi in range(len(s)): try:...

0.558072

class Solution: def maxLength(self, arr: List[str]) -> int: def digit_representation(s): ans = 0 for c in s: ans |= 1<<(ord(c)-ord('a')) return ans A = sorted([(len(s), digit_representation(s)) for s in set(arr) if len(set(s))==len(s)], re...

0.557252

class Solution: def minWindow(self, s, t): """ :type s: str :type t: str :rtype: str """ left=-1 right = 0 result = "" totalMatch = 0 d = {} for c in t: d[c] = d.get(c, 0) + 1 for right in ran...

0.556929

def codn1(s1,s2,p): c=0 ind=0 for i in range(len(s1)): if s1[i]!=s2[i]: c+=1 ind=i if c>1 or ind==len(s1)-1: return 0 if s1[ind]>s2[ind] and s1[ind] in s2[ind+1:]: p[0]=True if s1[ind]<s2[ind] and s2[ind] in s1[ind+1:]: p[1]=True return 1 def codn2(s1,s2): if len(s1)<len(s2): ...

0.556737

def prefix1(a, b): cnt = 0 for i, j in zip(a, b): if i == j: cnt += 1 else: return cnt return cnt def prefix2(a, b, num): for i in range(num, -1, -1): if b.startswith(a[:i]): return i def zfunc(str_): z = [] k = len(str_) for i ...

0.556556

class Solution: def minDeletionSize(self, A: List[str]) -> int: def isSorted(arr, i, j): return all(arr[k] <= arr[k+1] for k in range(i, j)) ans = 0 ranges = [[0, len(A)-1]] for col in zip(*A): if not ranges: break if all(isSorted(c...

0.554874

class Solution: def lengthOfLongestSubstring(self, s): """ :type s: str :rtype: int """ L, res, last = -1, 0, {} for R, char in enumerate(s): if char in last and last[char] > L: L = last[char] elif R-L > res: ...

0.553086

def string_constructing(a, s): if len(s) == 0: return 0 i = -1 for j, c in enumerate(s): i = a.find(c, i+1) if i < 0 or i == len(a) - 1: break return len(a) - j + (i < 0) + string_constructing(a, s[j + (i >= 0):])

0.552537

from sys import stdin,stdout # stdout = open('output.txt', 'w+') # stdin = open('input.txt','r+') from collections import Counter def prefixsuffixmatch(s): pi_table=[0 for i in range(len(s))] for i in range(1,len(s)): y=pi_table[i-1] while s[i]!=s[y] and y!=0: y=pi_table[y-1] if s[i]==s[y]: y+=1 pi_ta...

0.550956

# cook your dish here st=input().strip() b=[] for i in range(len(st)): for j in range(i+1,len(st)): if st[i]!=st[j]: z=abs(i-j) b.append(z) print(max(b))

0.549453

s=input() t=int(input()) ans=[] n=len(s) clue=[0]*n for i in range(n-1): if(s[i]==s[i+1]): clue[i]+=1 L=[clue[0]] for i in range(1,n): L.append(L[i-1]+clue[i]) for i in range(t): A,B=input().split() A=int(A)-1 B=int(B)-1 r=0 x=L[B-1] y=L[A-1] if(A-1<0): y=0 ans....

0.546613

class Solution: def minSwap(self, A: List[int], B: List[int]) -> int: n = len(A) if n == 1: return 0 dp = [[float('inf'), float('inf')] for _ in range(n)] dp[0] = [0,1] #[natural, swapped] for i in range(1, n): if A[...

0.54544

import sys n = int(sys.stdin.readline().strip()) s = sys.stdin.readline().strip() dp = [[-1] * (n + 1) for i in range(26)] for c in range(26): for j in range(n): tst = 1 if s[j] == chr(c + 97) else 0 dp[c][1 - tst] = max(dp[c][1 - tst], 1) for k in range(j + 1, n): if s[k] ...

0.544628

class Solution: def maxScore(self, s: str) -> int: maxi=0 for i in range(1,len(s)): a=s[:i] b=s[i:] maxi=max(a.count('0')+b.count('1'),maxi) return maxi

0.54456

class Solution: def longestDupSubstring(self, S): nums, N = [ord(c) - ord('a') for c in S], len(S) BASE, MOD = 26, 2**32 def check(L): cur_hash, seen = 0, set() for val in nums[:L]: cur_hash = (cur_hash * BASE + val) % MOD seen.add(cur_hash...

0.544015

t = [0] * 26 def get_k(c): return ord(c) - ord('a') def analyze(s): length_of_str = len(s) pos = 0 beauty_table = [0] * 26 for i in range(1, length_of_str): if s[i] != s[pos]: k = get_k(s[pos]) beauty_table[k] = max(beauty_table[k], i - pos) pos = i ...

0.543991

#scott http://codeforces.com/problemset/problem/265/A new problem RO = input() # darn i don't know how to read string ins = input() #scott n = 0 for x in range (len(ins)): #scott yeah that looks fine #print (x) if ins[x] == RO[n]: n += 1 #scott print(n+1)

0.543423

T = int(input()) for _ in range(T): x = input()[::-1] y = input()[::-1] start = y.index("1") offset = x[start:].index("1") print(offset)

0.543013

class Solution: def longestDecomposition(self, text: str) -> int: n = len(text) splits = 0 leftstart, leftend = 0, 0 rightstart, rightend = n-1, n-1 while leftend<rightstart: if text[leftstart:leftend+1] == text[rightstart:rightend+1]: leftstart = ...

0.542948

from math import ceil n = int(input()) word1 = input() word2 = input() combined = [] for i in range(ceil(n / 2)): if i > n / 2 - 1: combined.append([word1[i], word2[i]]) else: combined.append([word1[i], word1[- i - 1], word2[i], word2[- i - 1]]) count = 0 for l in combined: s = set(l) ...

0.542811

import sys input = lambda: sys.stdin.readline().rstrip() T = int(input()) for _ in range(T): N = int(input()) A = [ord(a) - 97 for a in input()] B = [ord(a) - 97 for a in input()] X = [[0] * 20 for _ in range(20)] for a, b in zip(A, B): X[a][b] = 1 if a > b: print(-1) ...

0.541309

def sub(a, s): pa = 0 ps = 0 while pa < len(a) and ps < len(s): if a[pa] == s[ps]: ps += 1 pa += 1 else: pa += 1 return ps == len(s) def subword(t, ord_ar, n): t_copy = [] for i in range(len(ord_ar)): if ord_ar[i] >= n: t_...

0.540847

class Solution: def getLengthOfOptimalCompression(self, s: str, k: int) -> int: n = len(s) def compLen(c): return 1 + len(str(c)) if c > 1 else 1 @lru_cache(None) def dp(i, k): # return {head: (len, -head_count)} if (n - i) <= k: return {} # ...

0.540003

class Solution: def maxFreq(self, s: str, maxLetters: int, minSize: int, maxSize: int) -> int: n = len(s) count = collections.Counter(s[i : i + minSize] for i in range(0, n - minSize + 1)) res = 0 for k, v in count.items(): if len(set(k)) <= maxLetters: ...

0.5398

s=input() dp=[[0,0,0] for i in range(len(s))] for i in range(len(s)): if s[i]=='a': dp[i][0]=dp[i-1][0]+1 dp[i][1]=dp[i-1][1] dp[i][2]=max(dp[i-1][1]+1,dp[i-1][2]+1) else: dp[i][0]=dp[i-1][0] dp[i][1]=max(dp[i-1][0]+1,dp[i-1][1]+1) dp[i][2]=dp[i-1][2] e=len(s)-1 p...

0.538572

match = 0 nonmatch = 0 count = 0 def calc_match(s, t, p): nonlocal match nonlocal nonmatch nonlocal count if p == len(s)-len(t): return if p+len(t) < len(s): if s[p+len(t)] == '?': count -= 1 elif s[p+len(t)] == t[-1]: match -= 1 else: nonmatch -= 1 match, nonmatch = nonma...

0.537979

class Solution: def maxUniqueSplit(self, s: str) -> int: self.x, n = 0, len(s) def maxUniqueSplit_(i=0, S=set()): if s[i:] not in S: self.x = max(self.x, len(S) + 1) for j in range(i + 1, n): if s[i : j] not in S and len(S) + 1 + n...

0.537398

def shift_left(a, b): r = len(a) + len(b) for i in range(-1, -min(len(a), len(b)) - 1, -1): if a[i] != b[i]: break r -= 2 return r

0.537287

class Solution: def distinctSubseqII(self, s: str) -> int: n = len(s) MOD = 10**9 + 7 seen = dict() a = 1 for i in range(n): char = s[i] b = 2 * a if char in seen: b -= seen[char] b %= MOD ...

0.53726

s, p = input(), input() n, m = len(s) + 1, len(p) d = [[0] * n for t in range(n)] for x in range(1, n): i, j = x, m while i and j: j -= s[i - 1] == p[j - 1] i -= 1 if not j: for y in range(i + 1): d[x][y + x - i - m] = d[i][y] + 1 for y in range(x): d[x][y] = max(d[x][y], d[x - 1...

0.537005

class Solution: def findMinStep(self, board, hand): """ :type board: str :type hand: str :rtype: int """ res=float("inf") hmap=collections.defaultdict(int) for c in hand: hmap[c]+=1 res=self.helper(board,hmap) if...

0.536867

class Solution: def maxRepOpt1(self, text: str) -> int: letters = {} for i, char in enumerate(text): if char in letters: letters[char].append(i) else: letters[char] = [i] if len(letters) == 1: return len(text) ...

0.536318

import sys import math import bisect import heapq import collections S = input() T = input() lenS = len(S) lenT = len(T) F1 = [False]*26 F2 = [False]*26 alpha = 'abcdefghijklmnopqrstuvwxyz' for i in range(lenS): F1[alpha.index(S[i])] = True for i in range(lenT): F2[alpha.index(T[i])] = True for i in range(26):...

0.535203

# You lost the game. s = str(input()) n = len(s) d = -1 r = 0 V = "AEIOUY" for i in range(n): if V.count(s[i]): r = max(r,i-d) d = i print(max(r, n-d))

0.535007

t=int(input()) no_of_chars = 256 # Function to find smallest window # containing all characters of 'pat' def findSubString(string, pat): len1 = len(string) len2 = len(pat) if len1 < len2: return 0 hash_pat = [0] * no_of_chars hash_str = [0] * no_of_chars for i in...

0.533991

def main(): n = int(input()) a = [input() for i in range(n)] result = 0 for i in range(26): for j in range(i + 1, 26): t = 0 ci = chr(i + ord('a')) cj = chr(j + ord('a')) for s in a: if s.count(ci) + s.count(cj) == len(s): ...

0.532325

n = int(input()) r1, c1 = map(int, input().split()) r2, c2 = map(int, input().split()) a = [['1'] * (n + 2)] for _ in range(n): s = input() d = ['1'] for i in s: d.append(i) d.append('1') a.append(d) a.append(['1'] * (n + 2)) s = [] f = [] q = [[r1, c1]] while q: x, y = q.pop() a[x][...

0.532274

def ziped(a): p = [] for i in a: x = int(i.split('-')[0]) y = i.split('-')[1] if len(p) > 0 and p[-1][1] == y: p[-1][0] += x else: p.append([x, y]) return p def solve(a, b , c): ans = 0 if len(b) == 1: for token in a: if c(token, b[0]): ans += token[0] - b[0][0] + 1 return ans if len(...

0.531261

class Solution: def flipgame(self, fronts: List[int], backs: List[int]) -> int: w = set(fronts[i] for i in range(len(fronts)) if fronts[i] == backs[i]) x = set() for a in fronts: if a not in w: x.add(a) for a in backs: if a not in w: ...

0.531172

def maxlen(s1, s2): sm, lg = sorted((s1, s2)) return min(max(lg / 3, sm), lg / 2)

0.530866

def shortest_to_char(s, c): if not s or not c: return [] indexes = [i for i, ch in enumerate(s) if ch == c] if not indexes: return [] return [ min(abs(i - ic) for ic in indexes) for i in range(len(s)) ]

0.528637

def gen(a, b): gener = '' for i in range(k): if a[i] == b[i]: gener += a[i] else: if 'S' not in (a[i], b[i]): gener += 'S' elif 'E' not in (a[i], b[i]): gener += 'E' else: gener += 'T' return gene...

0.528565

class Solution: def minDeletionSize(self, A: List[str]) -> int: return sum([list(col) != sorted(col) for col in zip(*A)])

0.528324

n = int(input()) st = input() ans = n i = 1 while i < n: if st[i - 1] != st[i]: ans -= 1 i += 1 i += 1 print(ans)

0.528266

from collections import deque moves = ((1, 2), (1, -2), (-1, 2), (-1, -2), (2, 1), (2, -1), (-2, 1), (-2, -1)) def knight(p1, p2): x, y = ord(p2[0])-97, int(p2[1])-1 left, seen = deque([(ord(p1[0])-97, int(p1[1])-1, 0)]), set() while left: i, j, v = left.popleft() if i==x and j==y: return v...

0.528117

def blokovi(x): ret = [0] for i in range(len(x) - 1): if x[i] != x[i + 1]: ret.append(i + 1) return ret + [len(x)] s = input() t = input() ss = blokovi(s) tt = blokovi(t) if s[-1] == 'a': s += 'b' else: s += 'a' if t[-1] == 'a': t += 'b' else: t += 'a' def greedy(x,...

0.527676

Given an unsorted array of integers, find the length of the longest consecutive elements sequence. Your algorithm should run in O(n) complexity. Example: Input: [100, 4, 200, 1, 3, 2] Output: 4 Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4.

class Solution: def longestConsecutive(self, nums): """ :type nums: List[int] :rtype: int """ longest_streak = 0 num_set = set(nums) for num in num_set: if num - 1 not in num_set: current_num = num current...

0.742315

from collections import Counter class Solution: def longestArithSeqLength(self, A: List[int]) -> int: c = dict(Counter(A).most_common()) # print(c) m1 = max(c.values()) # A = list(set(A)) # A.sort() index = {} # for i in range(len(A)): # index[A[i]...

0.693159

def consecutive(arr): return max(arr) - min(arr) + 1 - len(arr) if arr else 0

0.680892

class Solution: def findLengthOfLCIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) < 1: return 0 cur_len = 1 max_len = 1 for i in range(1,len(nums)): if nums[i] > nums[i-1]: cur_...

0.674342

def bs(arr, val, key=lambda x:x): l, r = 0, len(arr)-1 if key(arr[l])>val: return l if key(arr[r])<=val: return r+1 while l+1<r: m = (l+r)>>1 v = key(arr[m]) if v<=val: l = m else: r = m return r def bs_left(arr,...

0.642129

class Solution: def isvalid(self,C): if len(C)>2: return False if len(C)==1: a = min(C) if a==1 or C[a]==1: # EXPLANATION: # a==1 : All lengths are unitary like A=[1,2,3,4,...], so poping anything is fine # C[a...

0.6379

class Solution: def lengthOfLIS(self, nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 0: return 0 res = [nums[0]] def binarySearch(l,target): left , right = 0 , len(l)-1 while left < right: ...

0.633644

class Solution: def findShortestSubArray(self, nums): diction = {} for i in nums: if i not in diction: diction[i] = 1 else: diction[i] += 1 degree = max(list(diction.values())) ...

0.627217

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ cnt, sm, ism = 0, 0, 0 for i, num in enumerate(arr): sm += num ism += i if sm == ism: cnt += 1 return cnt

0.618993

class Solution: def partitionDisjoint(self, A: List[int]) -> int: biggest = A[0] newbiggest = A[0] lenL = 1 total = 1 for itr in A[1:]: total += 1 if itr < biggest: lenL = total biggest = newbiggest else: ...

0.612857

from collections import defaultdict def fix_progression(arr): res = 0 for i in range(len(arr)): D = defaultdict(int) for j in range(i): q, r = divmod(arr[i]-arr[j], i-j) if not r: D[q] += 1 res = max(res, D[q]) return len(arr)-res-1

0.602879

def length_of_sequence(arr, n): if arr.count(n) != 2: return 0 a = arr.index(n) b = arr.index(n, a + 1) return b - a + 1

0.600905

class Solution: def arrayNesting(self, nums): """ :type nums: List[int] :rtype: int """ best = 0 n = len(nums) p = [] for i in range(len(nums)): j = i current = 0 while nums[j] != -1: cur...

0.595694

class Solution: def findLHS(self, nums): """ :type nums: List[int] :rtype: int """ count = collections.Counter(nums) ret = 0 for i in count: if i+1 in count: ret = max(ret, count[i]+count[i+1]) return ret...

0.591474

class Solution: def maxTurbulenceSize(self, A: List[int]) -> int: if len(A) == 1: return 1 prev = A[1] maxcount = count = 1 + int(A[0] != A[1]) print(count) lastcomp = A[0] < A[1] for a in A[2:]: comp = prev < a if prev == a: ...

0.591413

class Solution: def findMaxConsecutiveOnes(self, nums): """ :type nums: List[int] :rtype: int """ if nums == []: return 0 count = 0 countMax =0 for ele in nums: if ele == 1: count += 1 ...

0.590867

class Solution: def lenLongestFibSubseq(self, A: List[int]) -> int: def getFS(x1, x2): F = [x1, x2] while F[-1] <= 1000000000: F.append(F[-2] + F[-1]) return F C1 = getFS(1, 0) C2 = C1[1:] def getLLFS(x1, x2): ...

0.589213

class Solution: def maxChunksToSorted(self, arr): """ :type arr: List[int] :rtype: int """ res = 0 temp = sorted(arr) sum1, sum2 = 0, 0 for i in range(0,len(arr)): sum1 += arr[i] sum2 += temp[i] if(sum1 =...

0.588492

AVAILABLE_METHODS = { 'even' : lambda x: x / 2, 'odd': lambda x: 3 * x + 1 } def generator(x): temp = x temp_num = 0 while temp > 1: if temp % 2 == 0: temp = AVAILABLE_METHODS['even'](temp) else: temp = AVAILABLE_METHODS['odd'](temp) temp_num += 1 ...

0.582681

class Solution: def jump(self,nums): """ :type nums: List[int] :rtype: int """ if len(nums) == 1: return 0 else: step = 0 pos = 0 while pos != len(nums) - 1: bestStep = -1 bes...

0.578431

from collections import defaultdict class Solution: def longestSubsequence(self, arr: List[int], difference: int) -> int: count_dict = defaultdict(int) for num in arr: count_dict[num] = count_dict[num-difference] + 1 return max(count_dict.values())

0.575998

class Solution: def findUnsortedSubarray(self, nums): """ :type nums: List[int] :rtype: int """ left = 1 size = len(nums) if size == 0: return 0 while left < size and nums[left - 1] <= nums[left]: left += 1 i...

0.571332

class Solution: def findLUSlength(self, strs): """ :type strs: List[str] :rtype: int """ def isSubseq(s1, s2): i, m=0, len(s1) for c in s2: if i==m: return True if s1[i]==c: i+=1 return i==m ...

0.569888

class Solution: def minIncrementForUnique(self, A: List[int]) -> int: if not A: return 0 A.sort() prev = A[0] res = 0 for num in A[1:]: if num <= prev: prev += 1 res += prev-num else: ...

0.563527

class Solution: def numberOfArithmeticSlices(self, A): curr, sum = 0, 0 for i in range(2,len(A)): if A[i]-A[i-1] == A[i-1]-A[i-2]: curr += 1 sum += curr else: curr = 0 return sum # solution = 0 # ...

0.557629

def find_missing(sequence): t = sequence return (t[0] + t[-1]) * (len(t) + 1) / 2 - sum(t)

0.556706

from functools import reduce array_change = lambda arr: reduce(lambda a, u: (max(a[0] + 1, u), a[1] + max(0, a[0] - u + 1)), arr, (-10001, 0))[1]

0.553077

class Solution: def wiggleMaxLength(self, arr): """ :type nums: List[int] :rtype: int """ n = len(arr) if n < 2: return n wsl = [0]*n wsl[0] = 1 for cur in range(1, n): prev = cur - 1 ...

0.549564

def smaller(arr): # Good Luck! return [len([a for a in arr[i:] if a < arr[i]]) for i in range(0, len(arr))]

0.548329

class Solution: def lengthOfLongestSubstring(self, s): """ :type s: str :rtype: int """ L, res, last = -1, 0, {} for R, char in enumerate(s): if char in last and last[char] > L: L = last[char] elif R-L > res: ...

0.546111

class Solution: def findLongestChain(self, pairs): """ :type pairs: List[List[int]] :rtype: int """ pairs = sorted(pairs,key=lambda x:x[1]) res = 1 first = pairs[0] for i in pairs[1:]: if first[-1] < i[0]: res += ...

0.544467

def base_finder(seq): return len(set(''.join(seq)))

0.541225

class Solution: def maximumGap(self, nums): """ :type nums: List[int] :rtype: int """ if not nums or len(nums) == 1: return 0 sorted_gap=0 nums=list(set(nums)) nums.sort() for curr in range(len(nums[:-1])): g...

0.537904

def greatest_distance(arr): return max(i - arr.index(x) for i,x in enumerate(arr))

0.534935

def find_longest(xs): return max(xs, key=lambda x: len(str(x)))

0.53446

def max_gap(numbers): lst = sorted(numbers) return max(b-a for a,b in zip(lst, lst[1:]))

0.534292

def first_non_consecutive(arr): if not arr: return 0 for i, x in enumerate(arr[:-1]): if x + 1 != arr[i + 1]: return arr[i + 1]

0.53355

class Solution: def missingNumber(self, nums): """ :type nums: List[int] :rtype: int """ if 0 not in nums: return 0 array=sorted(nums) for i in range(len(array)): try: dif=array[i+1]-array[i] ...

0.531804

class Solution: def longestSubarray(self, nums: List[int]) -> int: if not 0 in nums: return len(nums) - 1 ans = 0 tot = 0 prev = 0 for n in nums: if n == 1: tot += 1 else: ans = max(tot+prev, ans) ...

0.53161

class Node(object): def __init__(self, data): self.data = data self.next = None def length(node): leng = 0 while node: leng += 1 node = node.next return leng def count(node, data): c = 0 while node: if node.data==data: c += 1 no...

0.530787

def find_dup(arr): return sum(arr) - sum(range(1, max(arr)+1))

0.530736

def segment_cover(A, L): n=1 s=min(A) for i in sorted(A): if s+L<i: s=i n+=1 return n

0.529288

def repeats(arr): return sum([x for x in arr if arr.count(x) == 1])

0.527635

class Solution: def leastBricks(self, wall): """ :type wall: List[List[int]] :rtype: int """ d = {} for i in wall: suma = 0 for j in range(len(i)-1): suma += i[j] if suma in d: d[s...

0.526229

class Solution: def maxLength(self, arr: List[str]) -> int: def digit_representation(s): ans = 0 for c in s: ans |= 1<<(ord(c)-ord('a')) return ans A = sorted([(len(s), digit_representation(s)) for s in set(arr) if len(set(s))==len(s)], re...

0.526076

def lis(a): b = [] for c in a: # if len(b) == 0 or c > b[-1] if len(b) == 0 or c > b[-1]: b.append(c) else: l = 0 r = len(b) while l < r-1: m = l+r>>1 # if b[m] <= c: l = m if b[m] < c: l = m ...

0.524758

def longest(words): return max(map(len, words))

0.523934

def find_dup(arr): return sum(arr) - len(arr)*(len(arr)-1)/2 #your code here

0.522831

def avoid_obstacles(arr): n=2 while 1: if all([x%n for x in arr]): return n n+=1

0.518202

from functools import lru_cache @lru_cache(maxsize=None) def rec(n): return 1 + (0 if n==1 else rec(3*n+1) if n&1 else rec(n//2)) memo = [[0, None], [1, 1]] def max_collatz_length(n): if not (type(n) == int and n > 0): return [] while n >= len(memo): x = rec(len(memo)) if x > memo[-1][1]: memo...

0.517335

def find_missing_number(sequence): if not sequence: return 0 try: sequence = set(int(a) for a in sequence.split()) except ValueError: return 1 for b in range(1, max(sequence) + 1): if b not in sequence: return b return 0

0.516411

def sequence_classifier(arr): if all(arr[i] == arr[i+1] for i in range(len(arr)-1)): return 5 if all(arr[i] < arr[i+1] for i in range(len(arr)-1)): return 1 if all(arr[i] <= arr[i+1] for i in range(len(arr)-1)): return 2 if all(arr[i] > arr[i+1] for i in range(len(arr)-1)): return 3 if all(arr[i] ...

0.51589

def find(seq): return (min(seq)+max(seq))*(len(seq)+1)/2-sum(seq)

0.51562

class Solution: def findLengthOfShortestSubarray(self, arr: List[int]) -> int: n = len(arr) if n<=1: return 0 l,r = n,-1 for i in range(1,n): if arr[i]<arr[i-1]: l = i break # monotonicially increasing ...

0.515245

from sys import stdin tt = int(stdin.readline()) for loop in range(tt): n = int(stdin.readline()) a = list(map(int,stdin.readline().split())) lis = [ [1] ] now = [] tmp = 0 for i in range(1,n): if len(now) == 0: now.append(a[i]) tmp = 1 elif now[-1] ...

0.513801

class Solution: def getMaxLen(self, nums: List[int]) -> int: maxx = 0 nums.append(0) # starting position # where we find a 0 i = -1 minusarr = [] for j,n in enumerate(nums): if n == 0: # now figure out previous one...

0.513795

def int_diff(arr, n): num=0 for i in range(len(arr)): for j in range(i+1,len(arr)): if abs(arr[i]-arr[j])==n: num+=1 return num

0.513503

def array_equalization(a, k): totals, ends = {}, {} for i, n in enumerate(a): if n not in ends: totals[n], ends[n] = 0, -1 if i < ends[n]: continue count = (i - ends[n] - 1 + k - 1) // k totals[n] += count ends[n] = max(i, ends[n] + count * k) return min(t + (len(a) -...

0.508912

'''Author- Akshit Monga''' from sys import stdin, stdout input = stdin.readline t=int(input()) for _ in range(t): n=int(input()) a=[int(x) for x in input().split()] ans=0 dp=[-1 for i in range(0,n+1)] for i in a: var1=dp[i] var2=ans ans=max(ans,var1+1) dp[i]=max(dp[i],var2+1) print(n-ans)

0.50824

def hop_across(lst): def one_side(lst): i = 0 steps = 0 while i < len(lst): i += lst[i] steps += 1 return steps return one_side(lst) + one_side(lst[::-1])

0.508123

from sys import stdin from heapq import heappop, heappush, heapify def main(): n = int(stdin.readline()) a = stdin.readline().split() q = [] p = 0 c = 0 l = [0] * (n + 1) r = [0] * (n + 1) k = [0] * (n + 1) pa = [0] * (n + 1) for i, x in enumerate(a): if x == a[p]: ...

0.506541

def finding_k(arr): for n in range(max(arr)-1, 0, -1): if len({ x%n for x in arr }) == 1: return n return -1

0.50499

from collections import defaultdict def repeat_sum(l): count = defaultdict(int) for l1 in l: for val in set(l1): count[val] += 1 return sum(k for k,v in list(count.items()) if v > 1)

0.504076

def cut_the_ropes(arr): results = [len(arr)] while arr: m = min(arr) arr = [elem - m for elem in arr if elem != m] results.append(len(arr)) return results[:-1]

0.503381

def artificial_rain(garden): left,area,record = 0,0,1 for i in range(1,len(garden)): if garden[i] < garden[i-1]: left = i elif garden[i] > garden[i-1]: area = max(area,record) record = i - left record += 1 return max(area,record)

0.503193

def mForMaxSeq(arr, n): eim = dict() for i in range(n): if arr[i] in eim: eim[arr[i]].append(i) else: eim[arr[i]] = [i] keys = sorted(eim.keys()) # print(eim, keys) connected = False count = 0 pI = -1 nKeys = len(keys) ...

0.50314

from math import sqrt class Solution: def largestDivisibleSubset(self, nums): """ :type nums: List[int] :rtype: List[int] """ nums.sort() l, prev = {}, {} # length, previous number(largest divisor in nums) max_l, end_number = 0, None ...

0.502764

class Solution: def longestAwesome(self, s: str) -> int: cum = [0] firsts = {0: -1} lasts = {0: -1} for i, c in enumerate(s): cum.append(cum[-1] ^ (1 << (ord(c) - 48))) if cum[-1] not in firsts: firsts[cum[-1]] = i lasts[cum[-1]] = ...

0.500343

def validate_sequence(seq): return len({a - b for a, b in zip(seq, seq[1:])}) == 1

0.499858

from collections import Counter def find_dups_miss(arr): mi, ma, c = min(arr), max(arr), Counter(arr) duplicates = sorted(n for n in c if c[n] > 1) return [ma*(ma+1)//2 - mi*(mi-1)//2 - sum(c), duplicates]

0.498806

def solve(xs): m = 0 for x in sorted(xs): if x > m + 1: break m += x return m + 1

0.498505

def solve(arr): return sum(set(arr))

0.498444

def count_inversions(array): inv_count = 0 for i in range(len(array)): for j in range(i, len(array)): if array[i] > array[j]: inv_count += 1 return inv_count

0.497765

def count_inversion(nums): return sum(a > b for i, a in enumerate(nums) for b in nums[i + 1:])

0.497533

class Solution: def longestStrChain(self, words: List[str]) -> int: by_length = collections.defaultdict(set) for word in words: by_length[len(word)].add(word) longest = 1 seen = {*()} mx = len(by_length) mn = min(by_length) for length in sorted(b...

0.496842

#!/usr/bin/env python3 n = int(input()) a = [int(x) for x in input().split()] sorted_a = sorted(a) dict_a = {} for x in a: if not x in dict_a: dict_a[x] = 1 else: dict_a[x] += 1 sorted_uniq_a = sorted(dict_a.keys()) max_fib_prefix = [a[0], a[1]] for i in range(0, len(sorted_uniq_a)): for...

0.49682

def most_frequent_item_count(collection): if collection: return max([collection.count(item) for item in collection]) return 0

0.495832

n=int(input()) arr=[int(x) for x in input().split()] l=[1]*n if sorted(arr)==arr: print('0') else: for i in range(0,len(arr)): for j in range(i): if arr[i]>=arr[j] and l[i]<l[j]+1: l[i]=l[j]+1 print(n-max(l))

0.495277

# Definition for an interval. # class Interval: # def __init__(self, s=0, e=0): # self.start = s # self.end = e class Solution: def eraseOverlapIntervals(self, intervals): """ :type intervals: List[Interval] :rtype: int """ intervals = sorted(...

0.493787

def longest_slide_down(p): res = p.pop() while p: tmp = p.pop() res = [tmp[i] + max(res[i],res[i+1]) for i in range(len(tmp))] return res.pop()

0.493393

class Solution: def findPoisonedDuration(self, timeSeries, duration): """ :type timeSeries: List[int] :type duration: int :rtype: int """ if not timeSeries: return 0 prev = timeSeries[0] ret = 0 count = 0 for t i...

0.492565

def calc(a): res = [0] * (len(a) + 1) for k in range(len(a)): res = [2 * max(a[i] + res[i+1], a[i+k] + res[i]) for i in range(len(a) - k)] return res[0]

0.49081

from collections import Counter def sum_no_duplicates(nums): return sum(k for k, v in list(Counter(nums).items()) if v == 1)

0.490742

def luxhouse(houses): return [max(0, max(houses[i:]) - h + 1) for i, h in enumerate(houses[:-1], 1)] + [0]

0.490657

def gap(num): s = bin(num)[2:].strip("0") return max(map(len, s.split("1")))

0.490633

from collections import defaultdict, Counter def count_sel(nums): cnt = Counter(nums) d = defaultdict(list) total = 0 unique = 0 for k, v in cnt.items(): d[v].append(k) total += v unique += 1 maximum = max(d) return [total, unique, len(d[1]), [sorted(d[maximum]), ma...

0.490626

from collections import Counter def obtain_max_number(arr): c = Counter(arr) while 1: find = next((k for k in c if c[k] > 1), None) if not find:return max(c) c[find] -= 2 c[find*2] = c.get(find*2,0) + 1

0.490023

def prog(): n = int(input()) inp = list(map(int,input().split())) ans = 0 for i in range(len(inp)): x,y = 0 ,0 for j in range(i,len(inp)): x+=inp[j] y+=100 if(x>y): ans = max(ans,(j-i)+1) print(ans) prog()

0.489846

from itertools import groupby def ones_counter(nums): return [sum(g) for k, g in groupby(nums) if k]

0.489813

def prefix1(a, b): cnt = 0 for i, j in zip(a, b): if i == j: cnt += 1 else: return cnt return cnt def prefix2(a, b, num): for i in range(num, -1, -1): if b.startswith(a[:i]): return i def zfunc(str_): z = [] k = len(str_) for i ...

0.489179

# -*- coding: utf-8 -*- """ Created on Sun Apr 2 22:42:34 2017 @author: Sean38 """ n = int(input().rstrip()) s = input() a = [int(ch) for ch in s.split()] a = a[0:n] a.sort() def check_num(p, i): # i = ap + b(p+1) # min(a+b) <=> max(b) # b(p+1) <= i # b == i (mod p) max_b = (i // (p + 1)) b...

0.488817

import sys import math input=sys.stdin.readline #sys.setrecursionlimit(1000000) mod=int(1000000007) i=lambda :map(int,input().split()) n=int(input()) a=[int(x) for x in input().split()] t=[[0]*21 for i in range(300005)] for i in range(n): t[i][0]=a[i] def build(n): for j in range(1,20): for i in rang...

0.48879

def infected_zeroes(s): m=0; l=0 for i,n in enumerate(s): if n==0: m=i if l==0 else max(m, (i-l+1)//2); l=i+1 return max(m,len(s)-l)

0.488721

def complete_series(a): return list(range(max(a) + 1)) if len(a) == len(set(a)) else [0]

0.488153

class Solution: def maxWidthRamp(self, A: List[int]) -> int: width = 0 icandidate = [0] for i in range(len(A)): if A[i] < A[icandidate[-1]]: icandidate.append(i) for j in range(len(A) - 1, -1, -1): while icandidate and A[icandidate[-1]] <= A[j]...

0.488121

from itertools import groupby def count_repeats(s): return len(s) - len(list(groupby(s)))

0.486004

def find_longest(st): res,pos=0,[0] for i,b in enumerate(st,1): if b=="(": pos.append(i) else: try:pos.pop();res=max(res,i-pos[-1]) except:pos.append(i) return res

0.485002

class Solution(object): def hIndex(self, citations): """ :type citations: List[int] :rtype: int """ n=len(citations) if n>0: citations.sort() citations.reverse() ...

0.484268

n = int(input()) a = list(map(int,input().split())) m = max(a) current = 0 longest = 0 for x in a: if x == m: current +=1 else: longest = max(current,longest) current = 0 longest = max(current,longest) print (longest)

0.484068

def folding(a,b): squares = 1 while a != b: squares += 1 b, a = sorted((a - b, b)) return squares

0.4838

from collections import Counter def highest_rank(arr): if arr: c = Counter(arr) m = max(c.values()) return max(k for k,v in c.items() if v==m)

0.483354