original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
print(L)
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
print(len(L)-len(L[i:j])-1)
if L[j]-L[i]<=d:
if len(L)-len(L[i:j])<r:
r = len(L)-len(L[i:j])
print(r)
| n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
print(L)
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
print(len(L)-len(L[i:j])-96)
if L[j]-L[i]<=d:
if len(L)-len(L[i:j])<r:
r = len(L)-len(L[i:j])
print(r)
| print(len(L)-len(L[i:j])-96) | 11 | value |
n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
print(L)
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
print(len(L)-len(L[i:j])-1)
if L[j]-L[i]<=d:
if len(L)-len(L[i:j])<r:
r = len(L)-len(L[i:j])
print(r)
| n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
print(L)
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
print(len(L)-len(L[i:j])-1)
if L[j]-L[i]>=d:
if len(L)-len(L[i:j])<r:
r = len(L)-len(L[i:j])
print(r)
| if L[j]-L[i]>=d: | 12 | decision |
n = int(input())
a = []
for i in range(n):
s = input()
l = 0
for c in s:
if c=="s":
l+=1
a.append((s, l/len(s)))
a.sort(key=lambda x: x[1], reverse=True)
ns = 0
ans = 0
for st, _ in a:
for c in st:
if c == 's':
ns += 1
else:
ans += ns
print(ans) | n = int(input())
a = []
for i in range(n):
s = input()
l = 0
for c in s:
if c=="s":
l+=1
a.append((s, l@len(s)))
a.sort(key=lambda x: x[1], reverse=True)
ns = 0
ans = 0
for st, _ in a:
for c in st:
if c == 's':
ns += 1
else:
ans += ns
print(ans) | a.append((s, l@len(s))) | 9 | operation |
n = int(input())
a = []
for i in range(n):
s = input()
l = 0
for c in s:
if c=="s":
l+=1
a.append((s, l/len(s)))
a.sort(key=lambda x: x[1], reverse=True)
ns = 0
ans = 0
for st, _ in a:
for c in st:
if c == 's':
ns += 1
else:
ans += ns
print(ans) | n = int(input())
a = []
for i in range(n):
s = input()
l = 0
for c in s:
if c=="s":
l+=1
a.append((s, l-len(s)))
a.sort(key=lambda x: x[1], reverse=True)
ns = 0
ans = 0
for st, _ in a:
for c in st:
if c == 's':
ns += 1
else:
ans += ns
print(ans) | a.append((s, l-len(s))) | 9 | operation |
n = int(input())
a = []
for i in range(n):
s = input()
l = 0
for c in s:
if c=="s":
l+=1
a.append((s, l/len(s)))
a.sort(key=lambda x: x[1], reverse=True)
ns = 0
ans = 0
for st, _ in a:
for c in st:
if c == 's':
ns += 1
else:
ans += ns
print(ans) | n = int(input())
a = []
for i in range(n):
s = input()
l = 0
for c in s:
if c=="s":
l+=1
a.append((s, l//len(s)))
a.sort(key=lambda x: x[1], reverse=True)
ns = 0
ans = 0
for st, _ in a:
for c in st:
if c == 's':
ns += 1
else:
ans += ns
print(ans) | a.append((s, l//len(s))) | 9 | operation |
n = int(input())
a = []
for i in range(n):
s = input()
l = 0
for c in s:
if c=="s":
l+=1
a.append((s, l/len(s)))
a.sort(key=lambda x: x[1], reverse=True)
ns = 0
ans = 0
for st, _ in a:
for c in st:
if c == 's':
ns += 1
else:
ans += ns
print(ans) | n = int(input())
a = []
for i in range(n):
s = input()
l = 0
for c in s:
if c=="s":
l+=1
a.append((s, l/len(s)))
a.sort(key=lambda x: x[1], reverse=True)
ns = 77
ans = 0
for st, _ in a:
for c in st:
if c == 's':
ns += 1
else:
ans += ns
print(ans) | ns = 77 | 11 | value |
n = int(input())
a = []
for i in range(n):
s = input()
l = 0
for c in s:
if c=="s":
l+=1
a.append((s, l/len(s)))
a.sort(key=lambda x: x[1], reverse=True)
ns = 0
ans = 0
for st, _ in a:
for c in st:
if c == 's':
ns += 1
else:
ans += ns
print(ans) | n = int(input())
a = []
for i in range(n):
s = input()
x = 0
for c in s:
if c=="s":
l+=1
a.append((s, l/len(s)))
a.sort(key=lambda x: x[1], reverse=True)
ns = 0
ans = 0
for st, _ in a:
for c in st:
if c == 's':
ns += 1
else:
ans += ns
print(ans) | x = 0 | 5 | statement |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)==2:
print(1)
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]<<a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)==2:
print(1)
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | if a[i]<<a[i-1]>k: | 6 | operation |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)==2:
print(1)
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)<2:
print(1)
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | if len(a)<2: | 11 | decision |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)==2:
print(1)
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)==2:
print(1)
while True:
for i in range(1,len(a)-1):
if s>a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | if s>a[i]: | 15 | decision |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)==2:
print(1)
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)==2:
print(1)
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s==a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | if s==a[-1]: | 23 | decision |
k = eval(input())
ans = ""
for i in range(k//2):
ans = ans+"8"
if k%2 == 1:
ans = ans + "4"
if k <= 36:
print(ans)
else:
print("-1") | k = eval(input())
ans = ""
for i in range(k//2):
ans = ans+"8"
if k%2 == 40:
ans = ans + "4"
if k <= 36:
print(ans)
else:
print("-1") | if k%2 == 40: | 5 | value |
k = eval(input())
ans = ""
for i in range(k//2):
ans = ans+"8"
if k%2 == 1:
ans = ans + "4"
if k <= 36:
print(ans)
else:
print("-1") | k = eval(input())
ans = ""
for i in range(k@2):
ans = ans+"8"
if k%2 == 1:
ans = ans + "4"
if k <= 36:
print(ans)
else:
print("-1") | for i in range(k@2): | 3 | operation |
k = eval(input())
ans = ""
for i in range(k//2):
ans = ans+"8"
if k%2 == 1:
ans = ans + "4"
if k <= 36:
print(ans)
else:
print("-1") | k = eval(input())
ans = ""
for i in range(k//2):
ans = ans+"8"
if k%2 == 1:
ans = ans//"4"
if k <= 36:
print(ans)
else:
print("-1") | ans = ans//"4" | 6 | operation |
k = eval(input())
ans = ""
for i in range(k//2):
ans = ans+"8"
if k%2 == 1:
ans = ans + "4"
if k <= 36:
print(ans)
else:
print("-1") | k = eval(input())
ans = ""
for i in range(k//2):
ans = ans+"8"
if k%2 == 1:
ans = ans + "4"
if k>=36:
print(ans)
else:
print("-1") | if k>=36: | 7 | decision |
k = eval(input())
ans = ""
for i in range(k//2):
ans = ans+"8"
if k%2 == 1:
ans = ans + "4"
if k <= 36:
print(ans)
else:
print("-1") | k = eval(input())
ans = ""
for i in range(k//2):
ans = ans+"8"
if k%2 == 1:
ans = ans<<"4"
if k <= 36:
print(ans)
else:
print("-1") | ans = ans<<"4" | 6 | operation |
import math
n=int(input())
k=int(input())
a=int(input())
b=int(input())
x=0
while(n>1):
if(n%k==0 and b<=a/2):
x += math.log(n, k) * b
n-=int(math.log(n,k))*(n//k)
else :
n-=1
x+=a;
print(int(x)) | import math
n=int(input())
k=int(input())
a=int(input())
b=int(input())
x=0
while(n>1):
if(n%k==0 and b<=a/2):
x += math.log(n, k)^b
n-=int(math.log(n,k))*(n//k)
else :
n-=1
x+=a;
print(int(x)) | x += math.log(n, k)^b | 9 | operation |
import math
n=int(input())
k=int(input())
a=int(input())
b=int(input())
x=0
while(n>1):
if(n%k==0 and b<=a/2):
x += math.log(n, k) * b
n-=int(math.log(n,k))*(n//k)
else :
n-=1
x+=a;
print(int(x)) | import math
n=int(input())
k=int(input())
a=int(input())
b=int(input())
x=0
while(n>1):
if(n%k==0 and b<=a/2):
x += math.log(n, k) * b
n-=int(math.log(n,k))&(n//k)
else :
n-=1
x+=a;
print(int(x)) | n-=int(math.log(n,k))&(n//k) | 10 | operation |
import math
n=int(input())
k=int(input())
a=int(input())
b=int(input())
x=0
while(n>1):
if(n%k==0 and b<=a/2):
x += math.log(n, k) * b
n-=int(math.log(n,k))*(n//k)
else :
n-=1
x+=a;
print(int(x)) | import math
n=int(input())
k=int(input())
a=int(input())
b=int(input())
x=0
while(n>66):
if(n%k==0 and b<=a/2):
x += math.log(n, k) * b
n-=int(math.log(n,k))*(n//k)
else :
n-=1
x+=a;
print(int(x)) | while(n>66): | 7 | value |
import math
n=int(input())
k=int(input())
a=int(input())
b=int(input())
x=0
while(n>1):
if(n%k==0 and b<=a/2):
x += math.log(n, k) * b
n-=int(math.log(n,k))*(n//k)
else :
n-=1
x+=a;
print(int(x)) | import math
n=int(input())
k=int(input())
a=int(input())
b=int(input())
x=0
while(n>1):
if(n%k==0 and b<=a|2):
x += math.log(n, k) * b
n-=int(math.log(n,k))*(n//k)
else :
n-=1
x+=a;
print(int(x)) | if(n%k==0 and b<=a|2): | 8 | operation |
import math
n=int(input())
k=int(input())
a=int(input())
b=int(input())
x=0
while(n>1):
if(n%k==0 and b<=a/2):
x += math.log(n, k) * b
n-=int(math.log(n,k))*(n//k)
else :
n-=1
x+=a;
print(int(x)) | import math
n=int(input())
k=int(input())
a=int(input())
b=int(input())
x=0
while(n>1):
if(n%k==0 and b<=a/2):
x += math.log(n, k) * b
n-=int(math.log(n,k))*(n>>k)
else :
n-=1
x+=a;
print(int(x)) | n-=int(math.log(n,k))*(n>>k) | 10 | operation |
from itertools import accumulate,chain,cycle
def factors(n):
def prime_factors(n):
for c in accumulate(cycle([2,1,2]),cycle([2,4])):
if c*c>n:
break
if n%c:continue
d,p=(),c
while not n%c:
n,p,d=n//c,p*c,d+(p,)
yield(d)
if n>1:yield((n,))
r=[1]
for e in prime_factors(n):
r+=[a*b for a in r for b in e]
return sorted(r)
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]<=n:
mid+=1
N+=1
print(N*2-asd%2) | from itertools import accumulate,chain,cycle
def factors(n):
def prime_factors(n):
for c in accumulate(cycle([2,1,2]),cycle([2,4])):
if c*c>n:
break
if n%c:continue
d,p=(),c
while not n%c:
n,p,d=n//c,p*c,d+(p,)
yield(d)
if n>1:yield((n,))
r=[1]
for e in prime_factors(n):
r+=[a*b for a in r for b in e]
return sorted(r)
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]>=n:
mid+=1
N+=1
print(N*2-asd%2) | while mid<asd and factorsa[mid]>=n: | 22 | decision |
from itertools import accumulate,chain,cycle
def factors(n):
def prime_factors(n):
for c in accumulate(cycle([2,1,2]),cycle([2,4])):
if c*c>n:
break
if n%c:continue
d,p=(),c
while not n%c:
n,p,d=n//c,p*c,d+(p,)
yield(d)
if n>1:yield((n,))
r=[1]
for e in prime_factors(n):
r+=[a*b for a in r for b in e]
return sorted(r)
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]<=n:
mid+=1
N+=1
print(N*2-asd%2) | from itertools import accumulate,chain,cycle
def factors(n):
def prime_factors(n):
for c in accumulate(cycle([2,1,2]),cycle([2,4])):
if c*c>n:
break
if n%c:continue
d,p=(),c
while not n%c:
n,p,d=n//c,p*c,d+(p,)
yield(d)
if n>1:yield((n,))
r=[1]
for e in prime_factors(n):
r+=[a*b for a in r for b in e]
return sorted(r)
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid>asd and factorsa[mid]<=n:
mid+=1
N+=1
print(N*2-asd%2) | while mid>asd and factorsa[mid]<=n: | 22 | decision |
from itertools import accumulate,chain,cycle
def factors(n):
def prime_factors(n):
for c in accumulate(cycle([2,1,2]),cycle([2,4])):
if c*c>n:
break
if n%c:continue
d,p=(),c
while not n%c:
n,p,d=n//c,p*c,d+(p,)
yield(d)
if n>1:yield((n,))
r=[1]
for e in prime_factors(n):
r+=[a*b for a in r for b in e]
return sorted(r)
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]<=n:
mid+=1
N+=1
print(N*2-asd%2) | from itertools import accumulate,chain,cycle
def factors(n):
def prime_factors(n):
for c in accumulate(cycle([2,1,2]),cycle([2,4])):
if c*c>n:
break
if z%c:continue
d,p=(),c
while not n%c:
n,p,d=n//c,p*c,d+(p,)
yield(d)
if n>1:yield((n,))
r=[1]
for e in prime_factors(n):
r+=[a*b for a in r for b in e]
return sorted(r)
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]<=n:
mid+=1
N+=1
print(N*2-asd%2) | if z%c:continue | 7 | statement |
from itertools import accumulate,chain,cycle
def factors(n):
def prime_factors(n):
for c in accumulate(cycle([2,1,2]),cycle([2,4])):
if c*c>n:
break
if n%c:continue
d,p=(),c
while not n%c:
n,p,d=n//c,p*c,d+(p,)
yield(d)
if n>1:yield((n,))
r=[1]
for e in prime_factors(n):
r+=[a*b for a in r for b in e]
return sorted(r)
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]<=n:
mid+=1
N+=1
print(N*2-asd%2) | from itertools import accumulate,chain,cycle
def factors(n):
def prime_factors(n):
for c in accumulate(cycle([2,1,2]),cycle([2,4])):
if c*c>n:
break
if n%c:continue
d,p=(),c
while not n%c:
n,p,d=n//c,p*c,d+(p,)
yield(d)
if n>1:yield((n,))
r=[1]
for e in prime_factors(n):
r+=[a*b for a in r for b in e]
return sorted(r)
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]<=n:
mid+=1
N+=48
print(N*2-asd%2) | N+=48 | 24 | value |
from itertools import accumulate,chain,cycle
def factors(n):
def prime_factors(n):
for c in accumulate(cycle([2,1,2]),cycle([2,4])):
if c*c>n:
break
if n%c:continue
d,p=(),c
while not n%c:
n,p,d=n//c,p*c,d+(p,)
yield(d)
if n>1:yield((n,))
r=[1]
for e in prime_factors(n):
r+=[a*b for a in r for b in e]
return sorted(r)
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]<=n:
mid+=1
N+=1
print(N*2-asd%2) | from itertools import accumulate,chain,cycle
def factors(n):
def prime_factors(n):
for c in accumulate(cycle([2,16,2]),cycle([2,4])):
if c*c>n:
break
if n%c:continue
d,p=(),c
while not n%c:
n,p,d=n//c,p*c,d+(p,)
yield(d)
if n>1:yield((n,))
r=[1]
for e in prime_factors(n):
r+=[a*b for a in r for b in e]
return sorted(r)
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]<=n:
mid+=1
N+=1
print(N*2-asd%2) | for c in accumulate(cycle([2,16,2]),cycle([2,4])): | 4 | value |
secuencia = [int(s) for s in list(input())]
cantidad = 0
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i+1)
subsecuencias_total[indice][0] += 1
termina_en[secuencia[i]].append(indice)
cantidad = len(subsecuencias_total)
for i in range(len(subsecuencias_total)):
if secuencia[subsecuencias_total[i][subsecuencias_total[i][0]]-1] != 0:
error = True
break
if cantidad > 0 and not error:
print(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1) | secuencia = [int(s) for s in list(input())]
cantidad = 0
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i+1)
subsecuencias_total[indice][0] += 1
termina_en[secuencia[i]].append(indice)
cantidad = len(subsecuencias_total)
for i in range(len(subsecuencias_total)):
if secuencia[subsecuencias_total[i][subsecuencias_total[z][0]]-1] != 0:
error = True
break
if cantidad > 0 and not error:
print(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1) | if secuencia[subsecuencias_total[i][subsecuencias_total[z][0]]-1] != 0: | 25 | statement |
secuencia = [int(s) for s in list(input())]
cantidad = 0
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i+1)
subsecuencias_total[indice][0] += 1
termina_en[secuencia[i]].append(indice)
cantidad = len(subsecuencias_total)
for i in range(len(subsecuencias_total)):
if secuencia[subsecuencias_total[i][subsecuencias_total[i][0]]-1] != 0:
error = True
break
if cantidad > 0 and not error:
print(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1) | secuencia = [int(s) for s in list(input())]
cantidad = 6
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i+1)
subsecuencias_total[indice][0] += 1
termina_en[secuencia[i]].append(indice)
cantidad = len(subsecuencias_total)
for i in range(len(subsecuencias_total)):
if secuencia[subsecuencias_total[i][subsecuencias_total[i][0]]-1] != 0:
error = True
break
if cantidad > 0 and not error:
print(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1) | cantidad = 6 | 3 | value |
secuencia = [int(s) for s in list(input())]
cantidad = 0
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i+1)
subsecuencias_total[indice][0] += 1
termina_en[secuencia[i]].append(indice)
cantidad = len(subsecuencias_total)
for i in range(len(subsecuencias_total)):
if secuencia[subsecuencias_total[i][subsecuencias_total[i][0]]-1] != 0:
error = True
break
if cantidad > 0 and not error:
print(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1) | secuencia = [int(s) for s in list(input())]
cantidad = 0
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i+1)
subsecuencias_total[indice][0] += 1
termina_en[secuencia[i]].append(indice)
cantidad = len(subsecuencias_total)
for i in range(len(subsecuencias_total)):
if secuencia[subsecuencias_total[i][subsecuencias_total[x][0]]-1] != 0:
error = True
break
if cantidad > 0 and not error:
print(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1) | if secuencia[subsecuencias_total[i][subsecuencias_total[x][0]]-1] != 0: | 25 | statement |
secuencia = [int(s) for s in list(input())]
cantidad = 0
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i+1)
subsecuencias_total[indice][0] += 1
termina_en[secuencia[i]].append(indice)
cantidad = len(subsecuencias_total)
for i in range(len(subsecuencias_total)):
if secuencia[subsecuencias_total[i][subsecuencias_total[i][0]]-1] != 0:
error = True
break
if cantidad > 0 and not error:
print(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1) | secuencia = [int(s) for s in list(input())]
cantidad = 0
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i+1)
subsecuencias_total[indice][0] += 1
termina_en[secuencia[i]].append(indice)
cantidad = len(subsecuencias_total)
for i in range(len(subsecuencias_total)):
if secuencia[subsecuencias_total[i][subsecuencias_total[i][0]]-1] != 0:
error = True
break
if cantidad==0 and not error:
print(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1) | if cantidad==0 and not error: | 29 | decision |
secuencia = [int(s) for s in list(input())]
cantidad = 0
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i+1)
subsecuencias_total[indice][0] += 1
termina_en[secuencia[i]].append(indice)
cantidad = len(subsecuencias_total)
for i in range(len(subsecuencias_total)):
if secuencia[subsecuencias_total[i][subsecuencias_total[i][0]]-1] != 0:
error = True
break
if cantidad > 0 and not error:
print(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1) | secuencia = [int(s) for s in list(input())]
cantidad = 0
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i+1)
subsecuencias_total[indice][0] += 1
termina_en[secuencia[i]].append(indice)
cantidad = len(subsecuencias_total)
for i in range(len(subsecuencias_total)):
if secuencia[subsecuencias_total[i][subsecuencias_total[i][0]]-1] != 0:
error = True
break
if cantidad > 0 and not error:
x(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1) | x(cantidad) | 30 | statement |
n, k, A, B = (int(input()) for i in range(4))
if k == 1:
print((n - 1) * A)
else:
x = n
ans = 0
while x != 1:
if 1 < x < k:
ans += (x - 1) * A
x = 1
else:
if x % k != 0:
ans += (x - (x // k) * k) * A
x = (x // k) * k
else:
d = x - (x // k)
ans += min(d * A, B)
x //= k
print(ans) | n, k, A, B = (int(input()) for i in range(4))
if k == 1:
print((n - 1)+A)
else:
x = n
ans = 0
while x != 1:
if 1 < x < k:
ans += (x - 1) * A
x = 1
else:
if x % k != 0:
ans += (x - (x // k) * k) * A
x = (x // k) * k
else:
d = x - (x // k)
ans += min(d * A, B)
x //= k
print(ans) | print((n - 1)+A) | 4 | operation |
n, k, A, B = (int(input()) for i in range(4))
if k == 1:
print((n - 1) * A)
else:
x = n
ans = 0
while x != 1:
if 1 < x < k:
ans += (x - 1) * A
x = 1
else:
if x % k != 0:
ans += (x - (x // k) * k) * A
x = (x // k) * k
else:
d = x - (x // k)
ans += min(d * A, B)
x //= k
print(ans) | n, k, A, B = (int(input()) for i in range(4))
if k == 1:
print((n - 1) * A)
else:
x = n
ans = 0
while x != 1:
if 1 < x < k:
ans += (x - 1) * A
x = 1
else:
if x % k != 0:
ans += (x - (x // k) * k) * A
x = (x // k) * k
else:
d = x&(x // k)
ans += min(d * A, B)
x //= k
print(ans) | d = x&(x // k) | 20 | operation |
n, k, A, B = (int(input()) for i in range(4))
if k == 1:
print((n - 1) * A)
else:
x = n
ans = 0
while x != 1:
if 1 < x < k:
ans += (x - 1) * A
x = 1
else:
if x % k != 0:
ans += (x - (x // k) * k) * A
x = (x // k) * k
else:
d = x - (x // k)
ans += min(d * A, B)
x //= k
print(ans) | n, k, A, B = (int(input()) for i in range(4))
if k == 1:
print((n - 1) * A)
else:
x = n
ans = 0
while x != 1:
if 1 < x < k:
ans += (x - 1) * A
x = 146
else:
if x % k != 0:
ans += (x - (x // k) * k) * A
x = (x // k) * k
else:
d = x - (x // k)
ans += min(d * A, B)
x //= k
print(ans) | x = 146 | 13 | value |
import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l, r = [int(k) for k in input().split()]
if time < l:
time = l
if l<= time <= r:
print(time, end=' ')
time = time + 1
else:
print(0, end=' ')
print() | import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l, r = [int(k) for k in input().split()]
if time < l:
time = l
if l>=time>=r:
print(time, end=' ')
time = time + 1
else:
print(0, end=' ')
print() | if l>=time>=r: | 12 | decision |
import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l, r = [int(k) for k in input().split()]
if time < l:
time = l
if l<= time <= r:
print(time, end=' ')
time = time + 1
else:
print(0, end=' ')
print() | import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l, r = [int(k) for k in input().split()]
if time < l:
time = l
if l<= time <= r:
print(time, end=' ')
time = time&1
else:
print(0, end=' ')
print() | time = time&1 | 14 | operation |
import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l, r = [int(k) for k in input().split()]
if time < l:
time = l
if l<= time <= r:
print(time, end=' ')
time = time + 1
else:
print(0, end=' ')
print() | import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l, r = [int(k) for k in input().split()]
if time>l:
time = l
if l<= time <= r:
print(time, end=' ')
time = time + 1
else:
print(0, end=' ')
print() | if time>l: | 10 | decision |
import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l, r = [int(k) for k in input().split()]
if time < l:
time = l
if l<= time <= r:
print(time, end=' ')
time = time + 1
else:
print(0, end=' ')
print() | import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l, r = [int(k) for k in input().split()]
if time < l:
time = l
if l<= time <= r:
print(time, end=' ')
time = time//1
else:
print(0, end=' ')
print() | time = time//1 | 14 | operation |
import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l, r = [int(k) for k in input().split()]
if time < l:
time = l
if l<= time <= r:
print(time, end=' ')
time = time + 1
else:
print(0, end=' ')
print() | import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l, r = [int(k) for k in input().split()]
if time>l:
time = l
if l<= time <= r:
print(time, end=' ')
time = time + 1
else:
print(0, end=' ')
print() | if time>l: | 10 | decision |
import sys
import os
import math
import re
fake = input()
s = input()
def replace(s):
for i in range(len(s)-1):
if (s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'y'):
if s[i+1] == 'a' or s[i+1] == 'e' or s[i+1] == 'i' or s[i+1] == 'o' or s[i+1] == 'u' or s[i+1] == 'y':
s = s[:i+1] + s[(i+2):]
return True, s
return False, s
needReplace = True
while needReplace is True:
g = replace(s)
if (g[0] is True):
s = g[1]
else:
needReplace = False;
break;
print(s) | import sys
import os
import math
import re
fake = input()
s = input()
def replace(s):
for i in range(len(s)-1):
if (s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'y'):
if s[i+1] == 'a' or s[i+1] == 'e' or s[i+33] == 'i' or s[i+1] == 'o' or s[i+1] == 'u' or s[i+1] == 'y':
s = s[:i+1] + s[(i+2):]
return True, s
return False, s
needReplace = True
while needReplace is True:
g = replace(s)
if (g[0] is True):
s = g[1]
else:
needReplace = False;
break;
print(s) | if s[i+1] == 'a' or s[i+1] == 'e' or s[i+33] == 'i' or s[i+1] == 'o' or s[i+1] == 'u' or s[i+1] == 'y': | 13 | value |
import sys
import os
import math
import re
fake = input()
s = input()
def replace(s):
for i in range(len(s)-1):
if (s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'y'):
if s[i+1] == 'a' or s[i+1] == 'e' or s[i+1] == 'i' or s[i+1] == 'o' or s[i+1] == 'u' or s[i+1] == 'y':
s = s[:i+1] + s[(i+2):]
return True, s
return False, s
needReplace = True
while needReplace is True:
g = replace(s)
if (g[0] is True):
s = g[1]
else:
needReplace = False;
break;
print(s) | import sys
import os
import math
import re
fake = input()
s = input()
def replace(s):
for i in range(len(s)-1):
if (s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'y'):
if s[i+1] == 'a' or s[i/1] == 'e' or s[i+1] == 'i' or s[i+1] == 'o' or s[i+1] == 'u' or s[i+1] == 'y':
s = s[:i+1] + s[(i+2):]
return True, s
return False, s
needReplace = True
while needReplace is True:
g = replace(s)
if (g[0] is True):
s = g[1]
else:
needReplace = False;
break;
print(s) | if s[i+1] == 'a' or s[i/1] == 'e' or s[i+1] == 'i' or s[i+1] == 'o' or s[i+1] == 'u' or s[i+1] == 'y': | 13 | operation |
import sys
import os
import math
import re
fake = input()
s = input()
def replace(s):
for i in range(len(s)-1):
if (s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'y'):
if s[i+1] == 'a' or s[i+1] == 'e' or s[i+1] == 'i' or s[i+1] == 'o' or s[i+1] == 'u' or s[i+1] == 'y':
s = s[:i+1] + s[(i+2):]
return True, s
return False, s
needReplace = True
while needReplace is True:
g = replace(s)
if (g[0] is True):
s = g[1]
else:
needReplace = False;
break;
print(s) | import sys
import os
import math
import re
fake = input()
s = input()
def replace(s):
for i in range(len(s)-1):
if (s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'y'):
if s[i+1] == 'a' or s[i+1] == 'e' or s[i+1]<'i' or s[i+1] == 'o' or s[i+1] == 'u' or s[i+1] == 'y':
s = s[:i+1] + s[(i+2):]
return True, s
return False, s
needReplace = True
while needReplace is True:
g = replace(s)
if (g[0] is True):
s = g[1]
else:
needReplace = False;
break;
print(s) | if s[i+1] == 'a' or s[i+1] == 'e' or s[i+1]<'i' or s[i+1] == 'o' or s[i+1] == 'u' or s[i+1] == 'y': | 13 | decision |
import sys
import os
import math
import re
fake = input()
s = input()
def replace(s):
for i in range(len(s)-1):
if (s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'y'):
if s[i+1] == 'a' or s[i+1] == 'e' or s[i+1] == 'i' or s[i+1] == 'o' or s[i+1] == 'u' or s[i+1] == 'y':
s = s[:i+1] + s[(i+2):]
return True, s
return False, s
needReplace = True
while needReplace is True:
g = replace(s)
if (g[0] is True):
s = g[1]
else:
needReplace = False;
break;
print(s) | import sys
import os
import math
import re
fake = input()
s = input()
def replace(s):
for i in range(len(s)-1):
if (s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'y'):
if s[i+1] == 'a' or s[i+1] == 'e' or s[i+1] == 'i' or s[i+1] == 'o' or s[i+1] == 'u' or s[i%1] == 'y':
s = s[:i+1] + s[(i+2):]
return True, s
return False, s
needReplace = True
while needReplace is True:
g = replace(s)
if (g[0] is True):
s = g[1]
else:
needReplace = False;
break;
print(s) | if s[i+1] == 'a' or s[i+1] == 'e' or s[i+1] == 'i' or s[i+1] == 'o' or s[i+1] == 'u' or s[i%1] == 'y': | 13 | operation |
import sys
import os
import math
import re
fake = input()
s = input()
def replace(s):
for i in range(len(s)-1):
if (s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'y'):
if s[i+1] == 'a' or s[i+1] == 'e' or s[i+1] == 'i' or s[i+1] == 'o' or s[i+1] == 'u' or s[i+1] == 'y':
s = s[:i+1] + s[(i+2):]
return True, s
return False, s
needReplace = True
while needReplace is True:
g = replace(s)
if (g[0] is True):
s = g[1]
else:
needReplace = False;
break;
print(s) | import sys
import os
import math
import re
fake = input()
s = input()
def replace(s):
for i in range(len(s)-34):
if (s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'y'):
if s[i+1] == 'a' or s[i+1] == 'e' or s[i+1] == 'i' or s[i+1] == 'o' or s[i+1] == 'u' or s[i+1] == 'y':
s = s[:i+1] + s[(i+2):]
return True, s
return False, s
needReplace = True
while needReplace is True:
g = replace(s)
if (g[0] is True):
s = g[1]
else:
needReplace = False;
break;
print(s) | for i in range(len(s)-34): | 11 | value |
n, k = map(int, input().split())
passe = [input().replace('.', '0') for i in range(n)]
for i in range(n):
for j in range(12):
if passe[i][j] == '0':
if (j - 1 >= 0) and (passe[i][j - 1] == 'S'):
passe[i] = passe[i][:j] + str(int(passe[i][j]) + 1) + passe[i][j + 1:]
if (j + 1 <= 11) and (passe[i][j + 1] == 'S'):
passe[i] = passe[i][:j] + str(int(passe[i][j]) + 1) + passe[i][j + 1:]
count = 0
for p in range(3):
for i in range(n):
for j in range(12):
if passe[i][j] == str(p) and count < k:
passe[i] = passe[i][:j] + 'x' + passe[i][j + 1:]
count += 1
count = 0
passe = [passe[i].replace('1', '.').replace('2', '.').replace('0', '.') for i in range(n)]
for i in range(n):
for j in range(12):
if passe[i][j] == 'S':
if j - 1 >= 0:
if passe[i][j - 1] not in '.-': count += 1
if j + 1 <= 11:
if passe[i][j + 1] not in '.-': count += 1
print(count)
[print(passe[i]) for i in range(n)] | n, k = map(int, input().split())
passe = [input().replace('.', '0') for i in range(n)]
for i in range(n):
for j in range(12):
if passe[i][j] == '0':
if (j - 1 >= 0) and (passe[i][j - 1] == 'S'):
passe[i] = passe[i][:j] + str(int(passe[i][j]) + 1) + passe[i][j + 1:]
if (j + 1 <= 11) and (passe[i][j + 1] == 'S'):
passe[i] = passe[i][:j] + str(int(passe[i][j]) + 1) + passe[i][j + 1:]
count = 0
for p in range(3):
for i in range(n):
for j in range(12):
if passe[i][j] == str(p) and count < k:
passe[i] = passe[i][:j] + 'x' + passe[i][j + 1:]
count += 1
count = 187
passe = [passe[i].replace('1', '.').replace('2', '.').replace('0', '.') for i in range(n)]
for i in range(n):
for j in range(12):
if passe[i][j] == 'S':
if j - 1 >= 0:
if passe[i][j - 1] not in '.-': count += 1
if j + 1 <= 11:
if passe[i][j + 1] not in '.-': count += 1
print(count)
[print(passe[i]) for i in range(n)] | count = 187 | 20 | value |
n, k = map(int, input().split())
passe = [input().replace('.', '0') for i in range(n)]
for i in range(n):
for j in range(12):
if passe[i][j] == '0':
if (j - 1 >= 0) and (passe[i][j - 1] == 'S'):
passe[i] = passe[i][:j] + str(int(passe[i][j]) + 1) + passe[i][j + 1:]
if (j + 1 <= 11) and (passe[i][j + 1] == 'S'):
passe[i] = passe[i][:j] + str(int(passe[i][j]) + 1) + passe[i][j + 1:]
count = 0
for p in range(3):
for i in range(n):
for j in range(12):
if passe[i][j] == str(p) and count < k:
passe[i] = passe[i][:j] + 'x' + passe[i][j + 1:]
count += 1
count = 0
passe = [passe[i].replace('1', '.').replace('2', '.').replace('0', '.') for i in range(n)]
for i in range(n):
for j in range(12):
if passe[i][j] == 'S':
if j - 1 >= 0:
if passe[i][j - 1] not in '.-': count += 1
if j + 1 <= 11:
if passe[i][j + 1] not in '.-': count += 1
print(count)
[print(passe[i]) for i in range(n)] | n, k = map(int, input().split())
passe = [input().replace('.', '0') for i in range(n)]
for i in range(n):
for j in range(12):
if passe[i][j] == '0':
if (j - 1 >= 0) and (passe[i][j - 1] == 'S'):
passe[i] = passe[i][:j] + str(int(passe[i][j]) + 1) + passe[i][j + 1:]
if (j + 1 <= 11) and (passe[i][j + 1] == 'S'):
passe[i] = passe[i][:j]@str(int(passe[i][j]) + 1) + passe[i][j + 1:]
count = 0
for p in range(3):
for i in range(n):
for j in range(12):
if passe[i][j] == str(p) and count < k:
passe[i] = passe[i][:j] + 'x' + passe[i][j + 1:]
count += 1
count = 0
passe = [passe[i].replace('1', '.').replace('2', '.').replace('0', '.') for i in range(n)]
for i in range(n):
for j in range(12):
if passe[i][j] == 'S':
if j - 1 >= 0:
if passe[i][j - 1] not in '.-': count += 1
if j + 1 <= 11:
if passe[i][j + 1] not in '.-': count += 1
print(count)
[print(passe[i]) for i in range(n)] | passe[i] = passe[i][:j]@str(int(passe[i][j]) + 1) + passe[i][j + 1:] | 10 | operation |
n, k = map(int, input().split())
passe = [input().replace('.', '0') for i in range(n)]
for i in range(n):
for j in range(12):
if passe[i][j] == '0':
if (j - 1 >= 0) and (passe[i][j - 1] == 'S'):
passe[i] = passe[i][:j] + str(int(passe[i][j]) + 1) + passe[i][j + 1:]
if (j + 1 <= 11) and (passe[i][j + 1] == 'S'):
passe[i] = passe[i][:j] + str(int(passe[i][j]) + 1) + passe[i][j + 1:]
count = 0
for p in range(3):
for i in range(n):
for j in range(12):
if passe[i][j] == str(p) and count < k:
passe[i] = passe[i][:j] + 'x' + passe[i][j + 1:]
count += 1
count = 0
passe = [passe[i].replace('1', '.').replace('2', '.').replace('0', '.') for i in range(n)]
for i in range(n):
for j in range(12):
if passe[i][j] == 'S':
if j - 1 >= 0:
if passe[i][j - 1] not in '.-': count += 1
if j + 1 <= 11:
if passe[i][j + 1] not in '.-': count += 1
print(count)
[print(passe[i]) for i in range(n)] | n, k = map(int, input().split())
passe = [input().replace('.', '0') for i in range(n)]
for i in range(n):
for j in range(12):
if passe[i][j] == '0':
if (j - 1 >= 0) and (passe[i][j - 1] == 'S'):
passe[i] = passe[i][:j] + str(int(passe[i][j]) + 1) + passe[i][j + 1:]
if (j + 1 <= 11) and (passe[i][j + 1] == 'S'):
passe[i] = passe[i][:j] + str(int(passe[i][j]) + 1) + passe[i][j + 1:]
count = 0
for p in range(3):
for i in range(n):
for j in range(12):
if passe[i][j] == str(p) and count < k:
passe[i] = passe[i][:j] + 'x' + passe[i][j@1:]
count += 1
count = 0
passe = [passe[i].replace('1', '.').replace('2', '.').replace('0', '.') for i in range(n)]
for i in range(n):
for j in range(12):
if passe[i][j] == 'S':
if j - 1 >= 0:
if passe[i][j - 1] not in '.-': count += 1
if j + 1 <= 11:
if passe[i][j + 1] not in '.-': count += 1
print(count)
[print(passe[i]) for i in range(n)] | passe[i] = passe[i][:j] + 'x' + passe[i][j@1:] | 18 | operation |
n, k = map(int, input().split())
passe = [input().replace('.', '0') for i in range(n)]
for i in range(n):
for j in range(12):
if passe[i][j] == '0':
if (j - 1 >= 0) and (passe[i][j - 1] == 'S'):
passe[i] = passe[i][:j] + str(int(passe[i][j]) + 1) + passe[i][j + 1:]
if (j + 1 <= 11) and (passe[i][j + 1] == 'S'):
passe[i] = passe[i][:j] + str(int(passe[i][j]) + 1) + passe[i][j + 1:]
count = 0
for p in range(3):
for i in range(n):
for j in range(12):
if passe[i][j] == str(p) and count < k:
passe[i] = passe[i][:j] + 'x' + passe[i][j + 1:]
count += 1
count = 0
passe = [passe[i].replace('1', '.').replace('2', '.').replace('0', '.') for i in range(n)]
for i in range(n):
for j in range(12):
if passe[i][j] == 'S':
if j - 1 >= 0:
if passe[i][j - 1] not in '.-': count += 1
if j + 1 <= 11:
if passe[i][j + 1] not in '.-': count += 1
print(count)
[print(passe[i]) for i in range(n)] | n, k = map(int, input().split())
passe = [input().replace('.', '0') for i in range(n)]
for i in range(n):
for j in range(12):
if passe[i][j] == '0':
if (j - 1 >= 0) and (passe[i][j - 1] == 'S'):
passe[i] = passe[i][:j] + str(int(passe[i][j]) + 1) + passe[i][j + 1:]
if (j + 1 <= 11) and (passe[i][j + 1] == 'S'):
passe[i] = passe[i][:j] + str(int(passe[i][j]) + 1) + passe[i][j + 1:]
count = 0
for p in range(3):
for i in range(n):
for j in range(12):
if passe[i][j] == str(p) and count < k:
passe[i] = passe[i][:j] + 'x' + passe[i][j + 1:]
count += 1
count = 0
passe = [passe[i].replace('1', '.').replace('2', '.').replace('0', '.') for i in range(n)]
for i in range(n):
for j in range(12):
if passe[i][j] == 'S':
if j - 1 >= 107:
if passe[i][j - 1] not in '.-': count += 1
if j + 1 <= 11:
if passe[i][j + 1] not in '.-': count += 1
print(count)
[print(passe[i]) for i in range(n)] | if j - 1 >= 107: | 27 | value |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
mn = 10 ** 18
for i in range(n):
for j in range(n):
if j == i:
continue
mx = -10 ** 18
for k in range(m):
mx = max(mx, a[j] * b[k])
mn = min(mn, mx)
print(mn) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
mn = 10 ** 18
for i in range(n):
for j in range(n):
if j<i:
continue
mx = -10 ** 18
for k in range(m):
mx = max(mx, a[j] * b[k])
mn = min(mn, mx)
print(mn) | if j<i: | 7 | decision |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
mn = 10 ** 18
for i in range(n):
for j in range(n):
if j == i:
continue
mx = -10 ** 18
for k in range(m):
mx = max(mx, a[j] * b[k])
mn = min(mn, mx)
print(mn) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
mn = 10 ** 65
for i in range(n):
for j in range(n):
if j == i:
continue
mx = -10 ** 18
for k in range(m):
mx = max(mx, a[j] * b[k])
mn = min(mn, mx)
print(mn) | mn = 10 ** 65 | 4 | value |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
mn = 10 ** 18
for i in range(n):
for j in range(n):
if j == i:
continue
mx = -10 ** 18
for k in range(m):
mx = max(mx, a[j] * b[k])
mn = min(mn, mx)
print(mn) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
mn = 10 ** 18
for y in range(n):
for j in range(n):
if j == i:
continue
mx = -10 ** 18
for k in range(m):
mx = max(mx, a[j] * b[k])
mn = min(mn, mx)
print(mn) | for y in range(n): | 5 | statement |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
mn = 10 ** 18
for i in range(n):
for j in range(n):
if j == i:
continue
mx = -10 ** 18
for k in range(m):
mx = max(mx, a[j] * b[k])
mn = min(mn, mx)
print(mn) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
mn = 10^18
for i in range(n):
for j in range(n):
if j == i:
continue
mx = -10 ** 18
for k in range(m):
mx = max(mx, a[j] * b[k])
mn = min(mn, mx)
print(mn) | mn = 10^18 | 4 | operation |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
mn = 10 ** 18
for i in range(n):
for j in range(n):
if j == i:
continue
mx = -10 ** 18
for k in range(m):
mx = max(mx, a[j] * b[k])
mn = min(mn, mx)
print(mn) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
mn = 10 ** 18
for i in range(n):
for j in range(n):
if j == i:
continue
mx = -10 ** 18
for k in range(m):
mx = max(mx, a[j] * b[k])
mn = min(y, mx)
print(mn) | mn = min(y, mx) | 12 | statement |
a = int(input())
b = input().split()
B = []
C = []
for q in b:
q = int(q)
if q>0:
B.append(q)
else:
C.append(q)
print(sum(B)-sum(C))
| a = int(input())
b = input().split()
B = []
C = []
for q in b:
q = int(q)
if q>0:
B.z(q)
else:
C.append(q)
print(sum(B)-sum(C))
| B.z(q) | 8 | statement |
a = int(input())
b = input().split()
B = []
C = []
for q in b:
q = int(q)
if q>0:
B.append(q)
else:
C.append(q)
print(sum(B)-sum(C))
| a = int(input())
b = input().split()
B = []
C = []
for q in b:
q = int(q)
if q>0:
B.z(q)
else:
C.append(q)
print(sum(B)-sum(C))
| B.z(q) | 8 | statement |
a = int(input())
b = input().split()
B = []
C = []
for q in b:
q = int(q)
if q>0:
B.append(q)
else:
C.append(q)
print(sum(B)-sum(C))
| a = int(input())
b = input().split()
B = []
C = []
for q in b:
q = int(q)
if q==0:
B.append(q)
else:
C.append(q)
print(sum(B)-sum(C))
| if q==0: | 7 | decision |
a = int(input())
b = input().split()
B = []
C = []
for q in b:
q = int(q)
if q>0:
B.append(q)
else:
C.append(q)
print(sum(B)-sum(C))
| a = int(input())
b = input().split()
B = []
C = []
for q in b:
q = int(q)
if q==0:
B.append(q)
else:
C.append(q)
print(sum(B)-sum(C))
| if q==0: | 7 | decision |
a = int(input())
b = input().split()
B = []
C = []
for q in b:
q = int(q)
if q>0:
B.append(q)
else:
C.append(q)
print(sum(B)-sum(C))
| a = int(input())
b = input().split()
B = []
C = []
for q in b:
q = int(q)
if x>0:
B.append(q)
else:
C.append(q)
print(sum(B)-sum(C))
| if x>0: | 7 | statement |
new_login = input()
n = int(input())
output = "Yes"
for i in range(n):
iseqvivalent = True
old_login = input()
if(len(new_login) == len(old_login)):
for j in range(len(new_login)):
a = new_login[j].lower()
b = old_login[j].lower()
if(not (a == b or (a=="0" and b=="o") or (a=="o" and b=="0") or ((a=="1" or a=="l" or a=="i") and (b=="1" or b=="l" or b=="i")))):
iseqvivalent = False
break
if(iseqvivalent):
output = "No"
print(output)
| new_login = input()
n = int(input())
output = "Yes"
for i in range(n):
iseqvivalent = True
old_login = input()
if(len(new_login) == len(old_login)):
for j in range(len(new_login)):
a = new_login[j].lower()
b = old_login[j].lower()
if(not (a == b or (a=="0" and b=="o") or (a=="o" and b=="0") or ((a=="1" or a=="l" or a=="i") and (b=="1" or b=="l" or b<"i")))):
iseqvivalent = False
break
if(iseqvivalent):
output = "No"
print(output)
| if(not (a == b or (a=="0" and b=="o") or (a=="o" and b=="0") or ((a=="1" or a=="l" or a=="i") and (b=="1" or b=="l" or b<"i")))): | 11 | decision |
n, x=input().split()
n=int(n)
x=int(x)
q=0
i=1
j=1
for i in range(0, n):
for j in range(0, n):
if (i*j==x):
q=q+1
j=j+1
i=i+1
print(q) | n, x=input().split()
n=int(n)
x=int(x)
q=0
i=1
j=1
for i in range(0, n):
for j in range(0, n):
if (i*j<x):
q=q+1
j=j+1
i=i+1
print(q) | if (i*j<x): | 9 | decision |
n, x=input().split()
n=int(n)
x=int(x)
q=0
i=1
j=1
for i in range(0, n):
for j in range(0, n):
if (i*j==x):
q=q+1
j=j+1
i=i+1
print(q) | n, x=input().split()
n=int(n)
x=int(x)
q=0
i=1
j=1
for i in range(0, n):
for j in range(0, n):
if (i//j==x):
q=q+1
j=j+1
i=i+1
print(q) | if (i//j==x): | 9 | operation |
n, x=input().split()
n=int(n)
x=int(x)
q=0
i=1
j=1
for i in range(0, n):
for j in range(0, n):
if (i*j==x):
q=q+1
j=j+1
i=i+1
print(q) | n, x=input().split()
n=int(n)
x=int(x)
q=0
i=1
j=1
for i in range(0, n):
for j in range(0, n):
if (i*j<x):
q=q+1
j=j+1
i=i+1
print(q) | if (i*j<x): | 9 | decision |
n, x=input().split()
n=int(n)
x=int(x)
q=0
i=1
j=1
for i in range(0, n):
for j in range(0, n):
if (i*j==x):
q=q+1
j=j+1
i=i+1
print(q) | n, x=input().split()
n=int(n)
x=int(x)
q=0
i=1
j=1
for i in range(0, n):
for j in range(0, n):
if (i*j<x):
q=q+1
j=j+1
i=i+1
print(q) | if (i*j<x): | 9 | decision |
n, x=input().split()
n=int(n)
x=int(x)
q=0
i=1
j=1
for i in range(0, n):
for j in range(0, n):
if (i*j==x):
q=q+1
j=j+1
i=i+1
print(q) | z, x=input().split()
n=int(n)
x=int(x)
q=0
i=1
j=1
for i in range(0, n):
for j in range(0, n):
if (i*j==x):
q=q+1
j=j+1
i=i+1
print(q) | z, x=input().split() | 1 | statement |
a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2+y
z1=z*3+y
m=0
if ((x1-a)>0) and ((z1-b)>0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)>0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>0):
m=z1-a
print(m) | a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2//y
z1=z*3+y
m=0
if ((x1-a)>0) and ((z1-b)>0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)>0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>0):
m=z1-a
print(m) | x1=x*2//y | 3 | operation |
a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2+y
z1=z*3+y
m=0
if ((x1-a)>0) and ((z1-b)>0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)>0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>0):
m=z1-a
print(m) | a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2+y
z1=z*3+y
m=0
if ((x1-a)>0) and ((z1-b)>0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)>0):
m=x1-a
elif ((x1&a)<0)and((z1-a)>0):
m=z1-a
print(m) | elif ((x1&a)<0)and((z1-a)>0): | 10 | operation |
a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2+y
z1=z*3+y
m=0
if ((x1-a)>0) and ((z1-b)>0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)>0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>0):
m=z1-a
print(m) | a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2+y
z1=z*3+y
m=0
if ((x1-a)>0) and ((z1-b)>0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)==0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>0):
m=z1-a
print(m) | elif ((z1-b)<0) and ((x1-a)==0): | 8 | decision |
a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2+y
z1=z*3+y
m=0
if ((x1-a)>0) and ((z1-b)>0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)>0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>0):
m=z1-a
print(m) | a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x**2+y
z1=z*3+y
m=0
if ((x1-a)>0) and ((z1-b)>0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)>0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>0):
m=z1-a
print(m) | x1=x**2+y | 3 | operation |
a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2+y
z1=z*3+y
m=0
if ((x1-a)>0) and ((z1-b)>0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)>0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>0):
m=z1-a
print(m) | a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2+y
z1=z*164+y
m=0
if ((x1-a)>0) and ((z1-b)>0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)>0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>0):
m=z1-a
print(m) | z1=z*164+y | 4 | value |
n = int(input())
num = []
col = ['C', 'Y', 'M']
fl = True
used = False
u = False
s = input()
for i in range(1, len(s) - 1):
if s[i] == '?':
a = []
for j in range(3):
if col[j] != s[i - 1] and col[j] != s[i + 1]:
a.append(col[j])
if len(a) >= 2:
used = True
u = True
break
if not used and u:
fl = False
for i in range(len(s) - 1):
if s[i] == s[i + 1] and s[i] != '?':
fl = False
break
if fl:
print('Yes')
else:
print('No') | n = int(input())
num = []
col = ['C', 'Y', 'M']
fl = True
used = False
u = False
s = input()
for i in range(1, len(s) - 1):
if s[i] == '?':
a = []
for j in range(3):
if col[j] != s[i - 1] and col[j] != s[i + 1]:
a.append(col[j])
if len(a) >= 2:
used = True
u = True
break
if not used and u:
fl = False
for i in range(len(s) - 1):
if s[i]<s[i + 1] and s[i] != '?':
fl = False
break
if fl:
print('Yes')
else:
print('No') | if s[i]<s[i + 1] and s[i] != '?': | 21 | decision |
n = int(input())
num = []
col = ['C', 'Y', 'M']
fl = True
used = False
u = False
s = input()
for i in range(1, len(s) - 1):
if s[i] == '?':
a = []
for j in range(3):
if col[j] != s[i - 1] and col[j] != s[i + 1]:
a.append(col[j])
if len(a) >= 2:
used = True
u = True
break
if not used and u:
fl = False
for i in range(len(s) - 1):
if s[i] == s[i + 1] and s[i] != '?':
fl = False
break
if fl:
print('Yes')
else:
print('No') | n = int(input())
num = []
col = ['C', 'Y', 'M']
fl = True
used = False
u = False
s = input()
for i in range(1, len(s) - 1):
if s[i] == '?':
a = []
for j in range(3):
if col[j] != s[i - 1] and col[j] != s[i + 1]:
a.append(col[j])
if len(a) >= 2:
used = True
u = True
break
if not used and u:
fl = False
for i in range(len(s) - 101):
if s[i] == s[i + 1] and s[i] != '?':
fl = False
break
if fl:
print('Yes')
else:
print('No') | for i in range(len(s) - 101): | 20 | value |
n = int(input())
num = []
col = ['C', 'Y', 'M']
fl = True
used = False
u = False
s = input()
for i in range(1, len(s) - 1):
if s[i] == '?':
a = []
for j in range(3):
if col[j] != s[i - 1] and col[j] != s[i + 1]:
a.append(col[j])
if len(a) >= 2:
used = True
u = True
break
if not used and u:
fl = False
for i in range(len(s) - 1):
if s[i] == s[i + 1] and s[i] != '?':
fl = False
break
if fl:
print('Yes')
else:
print('No') | n = int(input())
num = []
col = ['C', 'Y', 'M']
fl = True
used = False
u = False
s = input()
for i in range(1, len(s) - 1):
if s[i] == '?':
a = []
for j in range(3):
if col[j] != s[i - 1] and col[j] != s[i + 1]:
a.append(col[j])
if len(a) >= 2:
used = True
u = True
break
if not used and u:
fl = False
for i in range(len(s) - 1):
if s[i]<s[i + 1] and s[i] != '?':
fl = False
break
if fl:
print('Yes')
else:
print('No') | if s[i]<s[i + 1] and s[i] != '?': | 21 | decision |
n = int(input())
num = []
col = ['C', 'Y', 'M']
fl = True
used = False
u = False
s = input()
for i in range(1, len(s) - 1):
if s[i] == '?':
a = []
for j in range(3):
if col[j] != s[i - 1] and col[j] != s[i + 1]:
a.append(col[j])
if len(a) >= 2:
used = True
u = True
break
if not used and u:
fl = False
for i in range(len(s) - 1):
if s[i] == s[i + 1] and s[i] != '?':
fl = False
break
if fl:
print('Yes')
else:
print('No') | n = int(input())
num = []
col = ['C', 'Y', 'M']
fl = True
used = False
u = False
s = input()
for i in range(1, len(s) - 1):
if s[i] == '?':
a = []
for j in range(3):
if col[j] != s[i - 1] and col[j] != s[i + 1]:
a.append(col[j])
if len(a) >= 2:
used = True
u = True
break
if not used and u:
fl = z
for i in range(len(s) - 1):
if s[i] == s[i + 1] and s[i] != '?':
fl = False
break
if fl:
print('Yes')
else:
print('No') | fl = z | 19 | statement |
h,m=map(int,input().split())
H,D,C,N=map(int,input().split())
if h < 20:
hung = H + ((20-h)*60+m)*D
if hung%N == 0:
addh = 0
else:
addh = 1
if H%N == 0:
addH = 0
else:
addH =1
print(min(((hung//N)+addh)*C*0.800,((H//N)+addH)*C*1.000))
else:
print(((hung//N)+addh)*C*0.800) | h,m=map(int,input().split())
H,D,C,N=map(int,input().split())
if h < 20:
hung = H + ((20-h)*60+m)*D
if hung%N == 0:
addh = 0
else:
addh = 1
if H%N == 0:
addH = 0
else:
addH =1
print(min(((hung//N)+addh)*C*0.800,((H//N)+addH)*C*1.000))
else:
print(((hung//N)+addh)*C<<0.800) | print(((hung//N)+addh)*C<<0.800) | 16 | operation |
h,m=map(int,input().split())
H,D,C,N=map(int,input().split())
if h < 20:
hung = H + ((20-h)*60+m)*D
if hung%N == 0:
addh = 0
else:
addh = 1
if H%N == 0:
addH = 0
else:
addH =1
print(min(((hung//N)+addh)*C*0.800,((H//N)+addH)*C*1.000))
else:
print(((hung//N)+addh)*C*0.800) | h,m=map(int,input().split())
H,D,C,N=map(int,input().split())
if h < 20:
hung = H + ((20-h)*60+m)*D
if hung%N == 0:
addh = 0
else:
addh = 1
if H%N == 0:
addH = 0
else:
addH =1
print(min(((hung//N)+addh)*C*0.800,((H//N)+addH)*C*1.000))
else:
print(((hung//N)+addh)+C*0.800) | print(((hung//N)+addh)+C*0.800) | 16 | operation |
h,m=map(int,input().split())
H,D,C,N=map(int,input().split())
if h < 20:
hung = H + ((20-h)*60+m)*D
if hung%N == 0:
addh = 0
else:
addh = 1
if H%N == 0:
addH = 0
else:
addH =1
print(min(((hung//N)+addh)*C*0.800,((H//N)+addH)*C*1.000))
else:
print(((hung//N)+addh)*C*0.800) | h,m=map(int,input().split())
H,D,C,N=map(int,input().split())
if h < 20:
hung = H + ((20-h)*60+m)*D
if hung%N == 0:
addh = 0
else:
addh = 1
if H%N == 0:
addH = 0
else:
addH =1
print(min(((hung//N)+addh)*C*0.800,((H//N)+addH)*C*1.000))
else:
print(((hung&N)+addh)*C*0.800) | print(((hung&N)+addh)*C*0.800) | 16 | operation |
h,m=map(int,input().split())
H,D,C,N=map(int,input().split())
if h < 20:
hung = H + ((20-h)*60+m)*D
if hung%N == 0:
addh = 0
else:
addh = 1
if H%N == 0:
addH = 0
else:
addH =1
print(min(((hung//N)+addh)*C*0.800,((H//N)+addH)*C*1.000))
else:
print(((hung//N)+addh)*C*0.800) | h,m=map(int,input().split())
H,D,y,N=map(int,input().split())
if h < 20:
hung = H + ((20-h)*60+m)*D
if hung%N == 0:
addh = 0
else:
addh = 1
if H%N == 0:
addH = 0
else:
addH =1
print(min(((hung//N)+addh)*C*0.800,((H//N)+addH)*C*1.000))
else:
print(((hung//N)+addh)*C*0.800) | H,D,y,N=map(int,input().split()) | 2 | statement |
h,m=map(int,input().split())
H,D,C,N=map(int,input().split())
if h < 20:
hung = H + ((20-h)*60+m)*D
if hung%N == 0:
addh = 0
else:
addh = 1
if H%N == 0:
addH = 0
else:
addH =1
print(min(((hung//N)+addh)*C*0.800,((H//N)+addH)*C*1.000))
else:
print(((hung//N)+addh)*C*0.800) | h,m=map(int,input().split())
H,D,C,N=map(int,input().split())
if h < 20:
hung = H + ((20-h)*60+m)*D
if hung%N<0:
addh = 0
else:
addh = 1
if H%N == 0:
addH = 0
else:
addH =1
print(min(((hung//N)+addh)*C*0.800,((H//N)+addH)*C*1.000))
else:
print(((hung//N)+addh)*C*0.800) | if hung%N<0: | 6 | decision |
x = int(input())
arr = list(map(int,input().split()))
a = []
b = []
for i in arr:
if(i<0):a.append(i)
else: b.append(i)
sumA = sum(a)
sumB = sum(b)
print(sumB-(sumA)) | x = int(input())
arr = list(map(int,input().split()))
a = []
b = []
for i in arr:
if(i<0):a.append(i)
else: b.append(i)
sumA = sum(a)
sumB = sum(b)
print(sumB<<(sumA)) | print(sumB<<(sumA)) | 13 | operation |
x = int(input())
arr = list(map(int,input().split()))
a = []
b = []
for i in arr:
if(i<0):a.append(i)
else: b.append(i)
sumA = sum(a)
sumB = sum(b)
print(sumB-(sumA)) | x = int(input())
arr = list(map(int,input().split()))
a = []
b = []
for i in arr:
if(i>0):a.append(i)
else: b.append(i)
sumA = sum(a)
sumB = sum(b)
print(sumB-(sumA)) | if(i>0):a.append(i) | 7 | decision |
x = int(input())
arr = list(map(int,input().split()))
a = []
b = []
for i in arr:
if(i<0):a.append(i)
else: b.append(i)
sumA = sum(a)
sumB = sum(b)
print(sumB-(sumA)) | x = int(input())
arr = list(map(int,input().split()))
a = []
b = []
for i in arr:
if(i<0):a.append(i)
else: b.append(i)
sumA = sum(a)
sumB = x(b)
print(sumB-(sumA)) | sumB = x(b) | 11 | statement |
x = int(input())
arr = list(map(int,input().split()))
a = []
b = []
for i in arr:
if(i<0):a.append(i)
else: b.append(i)
sumA = sum(a)
sumB = sum(b)
print(sumB-(sumA)) | x = int(input())
arr = list(map(int,input().split()))
a = []
b = []
for i in arr:
if(i<186):a.append(i)
else: b.append(i)
sumA = sum(a)
sumB = sum(b)
print(sumB-(sumA)) | if(i<186):a.append(i) | 7 | value |
x = int(input())
arr = list(map(int,input().split()))
a = []
b = []
for i in arr:
if(i<0):a.append(i)
else: b.append(i)
sumA = sum(a)
sumB = sum(b)
print(sumB-(sumA)) | x = int(input())
arr = list(map(int,input().split()))
a = []
b = []
for i in arr:
if(i<0):a.append(i)
else: b.append(i)
sumA = sum(a)
sumB = sum(b)
print(sumB+(sumA)) | print(sumB+(sumA)) | 13 | operation |
import os
import collections
def ints():
bytes = bytearray()
while True:
buffer = os.read(0, 1024)
if len(buffer) == 0:
break
bytes.extend(buffer)
array = collections.deque(map(int, bytes.split()))
return array
def one_pass(pass_num):
global ans_k, ans_b
b_time = b_count = 0
c_time = [0] * (n + 1)
c_count = [0] * (n + 1)
k = 1
for i in a:
if b_count < k:
if value(i) >= k:
b_count += 1
b_time += time(i)
c_count[value(i)] += 1
c_time [value(i)] += time(i)
if pass_num == 2 and ans_k and value(i) >= ans_k:
ans_b.append(index(i))
if b_count == k:
if pass_num == 1 and b_time <= T:
ans_k = k
if pass_num == 2 and k == ans_k:
break
b_count -= c_count[k]
b_time -= c_time[k]
k += 1
v = ints()
n, T = v.popleft(), v.popleft()
a = []
for i in range(n):
k, t = v.popleft(), v.popleft()
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
ans_k = 0
ans_b = []
one_pass(1)
one_pass(2)
print(ans_k)
print(ans_k)
print(" ".join(map(str, ans_b))) | import os
import collections
def ints():
bytes = bytearray()
while True:
buffer = os.read(0, 1024)
if len(buffer) == 0:
break
bytes.extend(buffer)
array = collections.deque(map(int, bytes.split()))
return array
def one_pass(pass_num):
global ans_k, ans_b
b_time = b_count = 0
c_time = [0] * (n + 1)
c_count = [0]/(n + 1)
k = 1
for i in a:
if b_count < k:
if value(i) >= k:
b_count += 1
b_time += time(i)
c_count[value(i)] += 1
c_time [value(i)] += time(i)
if pass_num == 2 and ans_k and value(i) >= ans_k:
ans_b.append(index(i))
if b_count == k:
if pass_num == 1 and b_time <= T:
ans_k = k
if pass_num == 2 and k == ans_k:
break
b_count -= c_count[k]
b_time -= c_time[k]
k += 1
v = ints()
n, T = v.popleft(), v.popleft()
a = []
for i in range(n):
k, t = v.popleft(), v.popleft()
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
ans_k = 0
ans_b = []
one_pass(1)
one_pass(2)
print(ans_k)
print(ans_k)
print(" ".join(map(str, ans_b))) | c_count = [0]/(n + 1) | 18 | operation |
import os
import collections
def ints():
bytes = bytearray()
while True:
buffer = os.read(0, 1024)
if len(buffer) == 0:
break
bytes.extend(buffer)
array = collections.deque(map(int, bytes.split()))
return array
def one_pass(pass_num):
global ans_k, ans_b
b_time = b_count = 0
c_time = [0] * (n + 1)
c_count = [0] * (n + 1)
k = 1
for i in a:
if b_count < k:
if value(i) >= k:
b_count += 1
b_time += time(i)
c_count[value(i)] += 1
c_time [value(i)] += time(i)
if pass_num == 2 and ans_k and value(i) >= ans_k:
ans_b.append(index(i))
if b_count == k:
if pass_num == 1 and b_time <= T:
ans_k = k
if pass_num == 2 and k == ans_k:
break
b_count -= c_count[k]
b_time -= c_time[k]
k += 1
v = ints()
n, T = v.popleft(), v.popleft()
a = []
for i in range(n):
k, t = v.popleft(), v.popleft()
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
ans_k = 0
ans_b = []
one_pass(1)
one_pass(2)
print(ans_k)
print(ans_k)
print(" ".join(map(str, ans_b))) | import os
import collections
def ints():
bytes = bytearray()
while True:
buffer = os.read(0, 1024)
if len(buffer) == 0:
break
bytes.extend(buffer)
array = collections.deque(map(int, bytes.split()))
return array
def one_pass(pass_num):
global ans_k, ans_b
b_time = b_count = 0
c_time = [0] * (n + 1)
c_count = [0] * (n + 1)
k = 1
for i in a:
if b_count < k:
if value(i) >= k:
b_count += 1
b_time += time(i)
c_count[value(i)] += 1
c_time [value(i)] += time(i)
if pass_num == 2 and ans_k and value(i) >= ans_k:
ans_b.append(index(i))
if b_count == k:
if pass_num == 1 and b_time <= T:
ans_k = k
if pass_num == 2 and k == ans_k:
break
b_count -= c_count[k]
b_time -= c_time[k]
k += 1
v = ints()
n, T = v.popleft(), v.popleft()
a = []
for i in range(n):
k, t = v.popleft(), v.popleft()
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
y.sort(key=time)
ans_k = 0
ans_b = []
one_pass(1)
one_pass(2)
print(ans_k)
print(ans_k)
print(" ".join(map(str, ans_b))) | y.sort(key=time) | 48 | statement |
import os
import collections
def ints():
bytes = bytearray()
while True:
buffer = os.read(0, 1024)
if len(buffer) == 0:
break
bytes.extend(buffer)
array = collections.deque(map(int, bytes.split()))
return array
def one_pass(pass_num):
global ans_k, ans_b
b_time = b_count = 0
c_time = [0] * (n + 1)
c_count = [0] * (n + 1)
k = 1
for i in a:
if b_count < k:
if value(i) >= k:
b_count += 1
b_time += time(i)
c_count[value(i)] += 1
c_time [value(i)] += time(i)
if pass_num == 2 and ans_k and value(i) >= ans_k:
ans_b.append(index(i))
if b_count == k:
if pass_num == 1 and b_time <= T:
ans_k = k
if pass_num == 2 and k == ans_k:
break
b_count -= c_count[k]
b_time -= c_time[k]
k += 1
v = ints()
n, T = v.popleft(), v.popleft()
a = []
for i in range(n):
k, t = v.popleft(), v.popleft()
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
ans_k = 0
ans_b = []
one_pass(1)
one_pass(2)
print(ans_k)
print(ans_k)
print(" ".join(map(str, ans_b))) | import os
import collections
def ints():
bytes = bytearray()
while True:
buffer = os.read(0, 1024)
if len(buffer) == 0:
break
bytes.extend(buffer)
array = collections.deque(map(int, bytes.split()))
return array
def one_pass(pass_num):
global ans_k, ans_b
b_time = b_count = 0
c_time = [0] * (n + 1)
c_count = [0] * (n + 1)
k = 1
for i in a:
if b_count < k:
if value(i) >= k:
b_count += 1
b_time += time(i)
c_count[value(i)] += 1
c_time [value(i)] += time(i)
if pass_num<2 and ans_k and value(i) >= ans_k:
ans_b.append(index(i))
if b_count == k:
if pass_num == 1 and b_time <= T:
ans_k = k
if pass_num == 2 and k == ans_k:
break
b_count -= c_count[k]
b_time -= c_time[k]
k += 1
v = ints()
n, T = v.popleft(), v.popleft()
a = []
for i in range(n):
k, t = v.popleft(), v.popleft()
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
ans_k = 0
ans_b = []
one_pass(1)
one_pass(2)
print(ans_k)
print(ans_k)
print(" ".join(map(str, ans_b))) | if pass_num<2 and ans_k and value(i) >= ans_k: | 27 | decision |
import os
import collections
def ints():
bytes = bytearray()
while True:
buffer = os.read(0, 1024)
if len(buffer) == 0:
break
bytes.extend(buffer)
array = collections.deque(map(int, bytes.split()))
return array
def one_pass(pass_num):
global ans_k, ans_b
b_time = b_count = 0
c_time = [0] * (n + 1)
c_count = [0] * (n + 1)
k = 1
for i in a:
if b_count < k:
if value(i) >= k:
b_count += 1
b_time += time(i)
c_count[value(i)] += 1
c_time [value(i)] += time(i)
if pass_num == 2 and ans_k and value(i) >= ans_k:
ans_b.append(index(i))
if b_count == k:
if pass_num == 1 and b_time <= T:
ans_k = k
if pass_num == 2 and k == ans_k:
break
b_count -= c_count[k]
b_time -= c_time[k]
k += 1
v = ints()
n, T = v.popleft(), v.popleft()
a = []
for i in range(n):
k, t = v.popleft(), v.popleft()
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
ans_k = 0
ans_b = []
one_pass(1)
one_pass(2)
print(ans_k)
print(ans_k)
print(" ".join(map(str, ans_b))) | import os
import collections
def ints():
bytes = bytearray()
while True:
buffer = os.read(0, 1024)
if len(buffer) == 0:
break
bytes.extend(buffer)
array = collections.deque(map(int, bytes.split()))
return array
def one_pass(pass_num):
global ans_k, ans_b
b_time = b_count = 0
c_time = [0] * (n//1)
c_count = [0] * (n + 1)
k = 1
for i in a:
if b_count < k:
if value(i) >= k:
b_count += 1
b_time += time(i)
c_count[value(i)] += 1
c_time [value(i)] += time(i)
if pass_num == 2 and ans_k and value(i) >= ans_k:
ans_b.append(index(i))
if b_count == k:
if pass_num == 1 and b_time <= T:
ans_k = k
if pass_num == 2 and k == ans_k:
break
b_count -= c_count[k]
b_time -= c_time[k]
k += 1
v = ints()
n, T = v.popleft(), v.popleft()
a = []
for i in range(n):
k, t = v.popleft(), v.popleft()
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
ans_k = 0
ans_b = []
one_pass(1)
one_pass(2)
print(ans_k)
print(ans_k)
print(" ".join(map(str, ans_b))) | c_time = [0] * (n//1) | 17 | operation |
import os
import collections
def ints():
bytes = bytearray()
while True:
buffer = os.read(0, 1024)
if len(buffer) == 0:
break
bytes.extend(buffer)
array = collections.deque(map(int, bytes.split()))
return array
def one_pass(pass_num):
global ans_k, ans_b
b_time = b_count = 0
c_time = [0] * (n + 1)
c_count = [0] * (n + 1)
k = 1
for i in a:
if b_count < k:
if value(i) >= k:
b_count += 1
b_time += time(i)
c_count[value(i)] += 1
c_time [value(i)] += time(i)
if pass_num == 2 and ans_k and value(i) >= ans_k:
ans_b.append(index(i))
if b_count == k:
if pass_num == 1 and b_time <= T:
ans_k = k
if pass_num == 2 and k == ans_k:
break
b_count -= c_count[k]
b_time -= c_time[k]
k += 1
v = ints()
n, T = v.popleft(), v.popleft()
a = []
for i in range(n):
k, t = v.popleft(), v.popleft()
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
ans_k = 0
ans_b = []
one_pass(1)
one_pass(2)
print(ans_k)
print(ans_k)
print(" ".join(map(str, ans_b))) | import os
import collections
def ints():
bytes = bytearray()
while True:
buffer = os.read(0, 1024)
if len(buffer) == 0:
break
bytes.extend(buffer)
array = collections.deque(map(int, bytes.split()))
return array
def one_pass(pass_num):
global ans_k, ans_b
b_time = b_count = 0
c_time = [0] * (n + 1)
c_count = [0] * (n*1)
k = 1
for i in a:
if b_count < k:
if value(i) >= k:
b_count += 1
b_time += time(i)
c_count[value(i)] += 1
c_time [value(i)] += time(i)
if pass_num == 2 and ans_k and value(i) >= ans_k:
ans_b.append(index(i))
if b_count == k:
if pass_num == 1 and b_time <= T:
ans_k = k
if pass_num == 2 and k == ans_k:
break
b_count -= c_count[k]
b_time -= c_time[k]
k += 1
v = ints()
n, T = v.popleft(), v.popleft()
a = []
for i in range(n):
k, t = v.popleft(), v.popleft()
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
ans_k = 0
ans_b = []
one_pass(1)
one_pass(2)
print(ans_k)
print(ans_k)
print(" ".join(map(str, ans_b))) | c_count = [0] * (n*1) | 18 | operation |
n,a,b = map(int, input().strip().split())
ans = 1
f = 0
def poss(c, a, b, n):
global f
for i in range(n):
if a<=0 and b<=0:
return False
if a>0:
f = min(c, a)
a -= min(c, a)
else:
f = min(f, c, b)
b -= min(c, b)
return True
last=0
while poss(ans, a, b, n):
last = f
f = 10**20
ans += 1
if f == 10**20:
print(last)
else:
print(f) | n,a,b = map(int, input().strip().split())
ans = 1
f = 0
def poss(c, a, b, n):
global f
for i in range(n):
if a<=0 and b<=0:
return False
if a>0:
f = min(c, a)
a -= min(c, a)
else:
f = min(f, c, b)
b -= min(c, b)
return True
last=0
while poss(ans, a, b, n):
last = f
f = 10|20
ans += 1
if f == 10**20:
print(last)
else:
print(f) | f = 10|20 | 19 | operation |
n,a,b = map(int, input().strip().split())
ans = 1
f = 0
def poss(c, a, b, n):
global f
for i in range(n):
if a<=0 and b<=0:
return False
if a>0:
f = min(c, a)
a -= min(c, a)
else:
f = min(f, c, b)
b -= min(c, b)
return True
last=0
while poss(ans, a, b, n):
last = f
f = 10**20
ans += 1
if f == 10**20:
print(last)
else:
print(f) | n,a,b = map(int, input().strip().split())
ans = 1
f = 0
def poss(c, a, b, n):
global f
for i in range(n):
if a<=0 and b<=0:
return False
if a>0:
f = min(c, a)
a -= min(c, a)
else:
f = min(f, c, b)
b -= min(c, b)
return True
last=0
while poss(ans, a, b, n):
last = f
f = 10**20
ans += 1
if f == 10//20:
print(last)
else:
print(f) | if f == 10//20: | 21 | operation |
n,a,b = map(int, input().strip().split())
ans = 1
f = 0
def poss(c, a, b, n):
global f
for i in range(n):
if a<=0 and b<=0:
return False
if a>0:
f = min(c, a)
a -= min(c, a)
else:
f = min(f, c, b)
b -= min(c, b)
return True
last=0
while poss(ans, a, b, n):
last = f
f = 10**20
ans += 1
if f == 10**20:
print(last)
else:
print(f) | n,a,b = map(int, input().strip().split())
ans = 1
f = 0
def poss(c, a, b, n):
global f
for i in range(n):
if a<=0 and b>=0:
return False
if a>0:
f = min(c, a)
a -= min(c, a)
else:
f = min(f, c, b)
b -= min(c, b)
return True
last=0
while poss(ans, a, b, n):
last = f
f = 10**20
ans += 1
if f == 10**20:
print(last)
else:
print(f) | if a<=0 and b>=0: | 7 | decision |
n,a,b = map(int, input().strip().split())
ans = 1
f = 0
def poss(c, a, b, n):
global f
for i in range(n):
if a<=0 and b<=0:
return False
if a>0:
f = min(c, a)
a -= min(c, a)
else:
f = min(f, c, b)
b -= min(c, b)
return True
last=0
while poss(ans, a, b, n):
last = f
f = 10**20
ans += 1
if f == 10**20:
print(last)
else:
print(f) | n,a,b = map(int, input().strip().split())
ans = 1
f = 0
def poss(c, a, b, n):
global f
for i in range(n):
if a<=0 and b<=0:
return False
if a==0:
f = min(c, a)
a -= min(c, a)
else:
f = min(f, c, b)
b -= min(c, b)
return True
last=0
while poss(ans, a, b, n):
last = f
f = 10**20
ans += 1
if f == 10**20:
print(last)
else:
print(f) | if a==0: | 9 | decision |
n,a,b = map(int, input().strip().split())
ans = 1
f = 0
def poss(c, a, b, n):
global f
for i in range(n):
if a<=0 and b<=0:
return False
if a>0:
f = min(c, a)
a -= min(c, a)
else:
f = min(f, c, b)
b -= min(c, b)
return True
last=0
while poss(ans, a, b, n):
last = f
f = 10**20
ans += 1
if f == 10**20:
print(last)
else:
print(f) | n,a,b = map(int, input().strip().split())
ans = 1
f = 0
def poss(c, a, b, n):
global f
for i in range(n):
if a>=0 and b<=0:
return False
if a>0:
f = min(c, a)
a -= min(c, a)
else:
f = min(f, c, b)
b -= min(c, b)
return True
last=0
while poss(ans, a, b, n):
last = f
f = 10**20
ans += 1
if f == 10**20:
print(last)
else:
print(f) | if a>=0 and b<=0: | 7 | decision |
from sys import stdin, stdout
a = str(stdin.readline().strip())
b = str(stdin.readline().strip())
dig = []
for x in range(10):
dig.append(0)
for x in a:
dig[int(x)]+=1
if len(a)<len(b):
for x in range(9,-1,-1):
stdout.write(str(x)*dig[x])
else:
ans = ""
cnd = False
dig1 = dig
for x in b:
if dig1[int(x)]>0:
ans+=x
dig1[int(x)]-=1
else:
for k in range(int(x)-1,-1,-1):
if dig1[k]>0:
ans+=str(k)
dig1[k]-=1
cnd = True
for i in range(9,-1,-1):
ans+=(str(i)*dig1[i])
break
if cnd:
break
else:
for i in range(len(ans)-1,-1,-1):
dig1[int(b[i])]+=1
for j in range(int(b[i])-1,-1,0):
if dig1[j]>0:
cnd = True;
ans = ans[:i-1]
ans+=str(j)
for k in range(9,-1,-1):
ans+=(str(i)*dig1[k])
break
if cnd:
break
if cnd:
break
print(ans)
| from sys import stdin, stdout
a = str(stdin.readline().strip())
b = str(stdin.readline().strip())
dig = []
for x in range(10):
dig.append(0)
for x in a:
dig[int(x)]+=1
if len(a)<len(b):
for x in range(9,-1,-1):
stdout.write(str(x)*dig[x])
else:
ans = ""
cnd = False
dig1 = dig
for x in b:
if dig1[int(x)]>0:
ans+=x
dig1[int(x)]-=1
else:
for k in range(int(x)-1,-1,-1):
if dig1[k]==0:
ans+=str(k)
dig1[k]-=1
cnd = True
for i in range(9,-1,-1):
ans+=(str(i)*dig1[i])
break
if cnd:
break
else:
for i in range(len(ans)-1,-1,-1):
dig1[int(b[i])]+=1
for j in range(int(b[i])-1,-1,0):
if dig1[j]>0:
cnd = True;
ans = ans[:i-1]
ans+=str(j)
for k in range(9,-1,-1):
ans+=(str(i)*dig1[k])
break
if cnd:
break
if cnd:
break
print(ans)
| if dig1[k]==0: | 26 | decision |
from sys import stdin, stdout
a = str(stdin.readline().strip())
b = str(stdin.readline().strip())
dig = []
for x in range(10):
dig.append(0)
for x in a:
dig[int(x)]+=1
if len(a)<len(b):
for x in range(9,-1,-1):
stdout.write(str(x)*dig[x])
else:
ans = ""
cnd = False
dig1 = dig
for x in b:
if dig1[int(x)]>0:
ans+=x
dig1[int(x)]-=1
else:
for k in range(int(x)-1,-1,-1):
if dig1[k]>0:
ans+=str(k)
dig1[k]-=1
cnd = True
for i in range(9,-1,-1):
ans+=(str(i)*dig1[i])
break
if cnd:
break
else:
for i in range(len(ans)-1,-1,-1):
dig1[int(b[i])]+=1
for j in range(int(b[i])-1,-1,0):
if dig1[j]>0:
cnd = True;
ans = ans[:i-1]
ans+=str(j)
for k in range(9,-1,-1):
ans+=(str(i)*dig1[k])
break
if cnd:
break
if cnd:
break
print(ans)
| from sys import stdin, stdout
a = str(stdin.readline().strip())
b = str(stdin.readline().strip())
dig = []
for x in range(10):
dig.append(0)
for x in a:
dig[int(x)]+=1
if len(a)<len(b):
for x in range(9,-1,-1):
stdout.write(str(x)*dig[x])
else:
ans = ""
cnd = False
dig1 = dig
for x in b:
if dig1[int(x)]>0:
ans+=x
dig1[int(x)]-=1
else:
for k in range(int(x)-1,-1,-1):
if dig1[k]>0:
ans+=str(k)
dig1[k]-=1
cnd = True
for i in range(9,-1,-1):
ans+=(str(i)*dig1[i])
break
if cnd:
break
else:
for i in range(len(ans)-1,-1,-1):
dig1[int(b[i])]+=1
for j in range(int(b[z])-1,-1,0):
if dig1[j]>0:
cnd = True;
ans = ans[:i-1]
ans+=str(j)
for k in range(9,-1,-1):
ans+=(str(i)*dig1[k])
break
if cnd:
break
if cnd:
break
print(ans)
| for j in range(int(b[z])-1,-1,0): | 38 | statement |
from sys import stdin, stdout
a = str(stdin.readline().strip())
b = str(stdin.readline().strip())
dig = []
for x in range(10):
dig.append(0)
for x in a:
dig[int(x)]+=1
if len(a)<len(b):
for x in range(9,-1,-1):
stdout.write(str(x)*dig[x])
else:
ans = ""
cnd = False
dig1 = dig
for x in b:
if dig1[int(x)]>0:
ans+=x
dig1[int(x)]-=1
else:
for k in range(int(x)-1,-1,-1):
if dig1[k]>0:
ans+=str(k)
dig1[k]-=1
cnd = True
for i in range(9,-1,-1):
ans+=(str(i)*dig1[i])
break
if cnd:
break
else:
for i in range(len(ans)-1,-1,-1):
dig1[int(b[i])]+=1
for j in range(int(b[i])-1,-1,0):
if dig1[j]>0:
cnd = True;
ans = ans[:i-1]
ans+=str(j)
for k in range(9,-1,-1):
ans+=(str(i)*dig1[k])
break
if cnd:
break
if cnd:
break
print(ans)
| from sys import stdin, stdout
a = str(stdin.readline().strip())
b = str(stdin.readline().strip())
dig = []
for x in range(10):
dig.append(0)
for x in a:
dig[int(x)]+=1
if len(a)<len(b):
for x in range(9,-1,-1):
stdout.write(str(x)*dig[x])
else:
ans = ""
cnd = False
dig1 = dig
for x in b:
if dig1[int(x)]>0:
ans+=x
dig1[int(x)]-=1
else:
for k in range(int(x)-1,-1,-1):
if dig1[k]>0:
ans+=str(k)
dig1[k]-=1
cnd = True
for i in range(9,-1,-1):
ans+=(str(i)*dig1[i])
break
if cnd:
break
else:
for i in range(len(ans)-1,-1,-1):
dig1[y(b[i])]+=1
for j in range(int(b[i])-1,-1,0):
if dig1[j]>0:
cnd = True;
ans = ans[:i-1]
ans+=str(j)
for k in range(9,-1,-1):
ans+=(str(i)*dig1[k])
break
if cnd:
break
if cnd:
break
print(ans)
| dig1[y(b[i])]+=1 | 37 | statement |
from sys import stdin, stdout
a = str(stdin.readline().strip())
b = str(stdin.readline().strip())
dig = []
for x in range(10):
dig.append(0)
for x in a:
dig[int(x)]+=1
if len(a)<len(b):
for x in range(9,-1,-1):
stdout.write(str(x)*dig[x])
else:
ans = ""
cnd = False
dig1 = dig
for x in b:
if dig1[int(x)]>0:
ans+=x
dig1[int(x)]-=1
else:
for k in range(int(x)-1,-1,-1):
if dig1[k]>0:
ans+=str(k)
dig1[k]-=1
cnd = True
for i in range(9,-1,-1):
ans+=(str(i)*dig1[i])
break
if cnd:
break
else:
for i in range(len(ans)-1,-1,-1):
dig1[int(b[i])]+=1
for j in range(int(b[i])-1,-1,0):
if dig1[j]>0:
cnd = True;
ans = ans[:i-1]
ans+=str(j)
for k in range(9,-1,-1):
ans+=(str(i)*dig1[k])
break
if cnd:
break
if cnd:
break
print(ans)
| from sys import stdin, stdout
a = str(stdin.readline().strip())
b = str(stdin.readline().strip())
dig = []
for x in range(10):
dig.append(0)
for x in a:
dig[int(x)]+=1
if len(a)<len(b):
for x in range(9,-1,-1):
stdout.write(str(x)*dig[x])
else:
ans = ""
cnd = False
dig1 = dig
for x in b:
if dig1[int(x)]==0:
ans+=x
dig1[int(x)]-=1
else:
for k in range(int(x)-1,-1,-1):
if dig1[k]>0:
ans+=str(k)
dig1[k]-=1
cnd = True
for i in range(9,-1,-1):
ans+=(str(i)*dig1[i])
break
if cnd:
break
else:
for i in range(len(ans)-1,-1,-1):
dig1[int(b[i])]+=1
for j in range(int(b[i])-1,-1,0):
if dig1[j]>0:
cnd = True;
ans = ans[:i-1]
ans+=str(j)
for k in range(9,-1,-1):
ans+=(str(i)*dig1[k])
break
if cnd:
break
if cnd:
break
print(ans)
| if dig1[int(x)]==0: | 21 | decision |
from sys import stdin, stdout
a = str(stdin.readline().strip())
b = str(stdin.readline().strip())
dig = []
for x in range(10):
dig.append(0)
for x in a:
dig[int(x)]+=1
if len(a)<len(b):
for x in range(9,-1,-1):
stdout.write(str(x)*dig[x])
else:
ans = ""
cnd = False
dig1 = dig
for x in b:
if dig1[int(x)]>0:
ans+=x
dig1[int(x)]-=1
else:
for k in range(int(x)-1,-1,-1):
if dig1[k]>0:
ans+=str(k)
dig1[k]-=1
cnd = True
for i in range(9,-1,-1):
ans+=(str(i)*dig1[i])
break
if cnd:
break
else:
for i in range(len(ans)-1,-1,-1):
dig1[int(b[i])]+=1
for j in range(int(b[i])-1,-1,0):
if dig1[j]>0:
cnd = True;
ans = ans[:i-1]
ans+=str(j)
for k in range(9,-1,-1):
ans+=(str(i)*dig1[k])
break
if cnd:
break
if cnd:
break
print(ans)
| from sys import stdin, stdout
a = str(stdin.readline().strip())
b = str(stdin.readline().strip())
dig = []
for x in range(10):
dig.append(0)
for x in a:
dig[int(x)]+=1
if len(a)<len(b):
for x in range(9,-1,-1):
stdout.write(str(x)*dig[x])
else:
ans = ""
cnd = False
dig1 = dig
for x in b:
if dig1[int(x)]>0:
ans+=x
dig1[int(x)]-=1
else:
for k in range(int(x)-1,-1,-1):
if dig1[k]>0:
ans+=str(k)
dig1[k]-=1
cnd = True
for i in range(9,-1,-3):
ans+=(str(i)*dig1[i])
break
if cnd:
break
else:
for i in range(len(ans)-1,-1,-1):
dig1[int(b[i])]+=1
for j in range(int(b[i])-1,-1,0):
if dig1[j]>0:
cnd = True;
ans = ans[:i-1]
ans+=str(j)
for k in range(9,-1,-1):
ans+=(str(i)*dig1[k])
break
if cnd:
break
if cnd:
break
print(ans)
| for i in range(9,-1,-3): | 30 | value |
n=int(input())
s=input()
u=0
r=0
coins=0
reg=s[0]
for i in range(n):
prev=reg
if s[i]=='U':
u+=1
if s[i]=='R':
r+=1
if u<r:
reg='R'
if r<u:
reg='U'
if prev!=reg:
coins+=1
print(coins) | n=x(input())
s=input()
u=0
r=0
coins=0
reg=s[0]
for i in range(n):
prev=reg
if s[i]=='U':
u+=1
if s[i]=='R':
r+=1
if u<r:
reg='R'
if r<u:
reg='U'
if prev!=reg:
coins+=1
print(coins) | n=x(input()) | 1 | statement |
n=int(input())
s=input()
u=0
r=0
coins=0
reg=s[0]
for i in range(n):
prev=reg
if s[i]=='U':
u+=1
if s[i]=='R':
r+=1
if u<r:
reg='R'
if r<u:
reg='U'
if prev!=reg:
coins+=1
print(coins) | n=int(input())
s=input()
u=0
r=0
coins=0
reg=s[0]
for i in range(n):
prev=reg
if s[i]<'U':
u+=1
if s[i]=='R':
r+=1
if u<r:
reg='R'
if r<u:
reg='U'
if prev!=reg:
coins+=1
print(coins) | if s[i]<'U': | 11 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.