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 |
|---|---|---|---|---|
s = input()
a = []
i=-1
p=True
for j in range(len(s)):
if s[j]=='1':
i+=1
if i==len(a):
p=False
break
else:
a[i].append(j)
if s[j]=='0':
if i==-1:
a.append([j])
else:
a[i].append(j)
i=i-1
if not p:
print(-1)
else:
print(len(a))
for k in a:
print(len(k), end=' ')
for r in k:
print(r+1,end=' ')
print()
|
s = input()
a = []
i=-1
p=True
for j in range(len(s)):
if s[j]=='1':
i+=1
if i<len(a):
p=False
break
else:
a[i].append(j)
if s[j]=='0':
if i==-1:
a.append([j])
else:
a[i].append(j)
i=i-1
if not p:
print(-1)
else:
print(len(a))
for k in a:
print(len(k), end=' ')
for r in k:
print(r+1,end=' ')
print()
|
if i<len(a):
| 9 |
decision
|
s = input()
a = []
i=-1
p=True
for j in range(len(s)):
if s[j]=='1':
i+=1
if i==len(a):
p=False
break
else:
a[i].append(j)
if s[j]=='0':
if i==-1:
a.append([j])
else:
a[i].append(j)
i=i-1
if not p:
print(-1)
else:
print(len(a))
for k in a:
print(len(k), end=' ')
for r in k:
print(r+1,end=' ')
print()
|
s = input()
a = []
i=-199
p=True
for j in range(len(s)):
if s[j]=='1':
i+=1
if i==len(a):
p=False
break
else:
a[i].append(j)
if s[j]=='0':
if i==-1:
a.append([j])
else:
a[i].append(j)
i=i-1
if not p:
print(-1)
else:
print(len(a))
for k in a:
print(len(k), end=' ')
for r in k:
print(r+1,end=' ')
print()
|
i=-199
| 3 |
value
|
s = input()
a = []
i=-1
p=True
for j in range(len(s)):
if s[j]=='1':
i+=1
if i==len(a):
p=False
break
else:
a[i].append(j)
if s[j]=='0':
if i==-1:
a.append([j])
else:
a[i].append(j)
i=i-1
if not p:
print(-1)
else:
print(len(a))
for k in a:
print(len(k), end=' ')
for r in k:
print(r+1,end=' ')
print()
|
s = input()
a = []
i=-1
p=True
for j in range(len(s)):
if s[j]=='1':
i+=1
if i==len(a):
p=False
break
else:
a[i].append(j)
if s[j]=='0':
if i==-1:
a.append([j])
else:
a[i].append(j)
i=i*1
if not p:
print(-1)
else:
print(len(a))
for k in a:
print(len(k), end=' ')
for r in k:
print(r+1,end=' ')
print()
|
i=i*1
| 19 |
operation
|
n, d = map(int, input().split())
s = [int(i) for i in input()]
dc = 0
p = 0
c = 0
result = 0
r = []
for i in range(len(s)):
if s[i] == 1:
c += 1
r.append(c)
c = 0
else:
c+= 1
r.remove(r[0])
for i in range(len(r)-1):
if r[i] > d:
print(-1)
p = 1
break
else:
if dc < d:
dc += r[i]
if dc == d:
result += 1
dc = 0
if d-dc < r[i + 1]:
result += 1
dc = 0
if r[-1] < d and result != 0:
print(result + 1)
elif p != 1:
print(-1)
|
n, d = map(int, input().split())
s = [int(i) for i in input()]
dc = 0
p = 0
c = 0
result = 0
r = []
for i in range(len(s)):
if s[i]<1:
c += 1
r.append(c)
c = 0
else:
c+= 1
r.remove(r[0])
for i in range(len(r)-1):
if r[i] > d:
print(-1)
p = 1
break
else:
if dc < d:
dc += r[i]
if dc == d:
result += 1
dc = 0
if d-dc < r[i + 1]:
result += 1
dc = 0
if r[-1] < d and result != 0:
print(result + 1)
elif p != 1:
print(-1)
|
if s[i]<1:
| 10 |
decision
|
n, d = map(int, input().split())
s = [int(i) for i in input()]
dc = 0
p = 0
c = 0
result = 0
r = []
for i in range(len(s)):
if s[i] == 1:
c += 1
r.append(c)
c = 0
else:
c+= 1
r.remove(r[0])
for i in range(len(r)-1):
if r[i] > d:
print(-1)
p = 1
break
else:
if dc < d:
dc += r[i]
if dc == d:
result += 1
dc = 0
if d-dc < r[i + 1]:
result += 1
dc = 0
if r[-1] < d and result != 0:
print(result + 1)
elif p != 1:
print(-1)
|
n, d = map(int, input().split())
s = [int(i) for i in input()]
dc = 0
p = 0
c = 0
result = 0
r = []
for i in range(len(s)):
if s[i] == 1:
c += 1
r.append(c)
c = 0
else:
c+= 1
r.remove(r[0])
for i in range(len(r)-1):
if r[i] > d:
print(-1)
p = 1
break
else:
if dc < d:
dc += r[i]
if dc == d:
result += 1
dc = 0
if d-dc < r[i + 1]:
result += 1
dc = 0
if r[-1] < d and result != 0:
print(result>>1)
elif p != 1:
print(-1)
|
print(result>>1)
| 33 |
operation
|
n, d = map(int, input().split())
s = [int(i) for i in input()]
dc = 0
p = 0
c = 0
result = 0
r = []
for i in range(len(s)):
if s[i] == 1:
c += 1
r.append(c)
c = 0
else:
c+= 1
r.remove(r[0])
for i in range(len(r)-1):
if r[i] > d:
print(-1)
p = 1
break
else:
if dc < d:
dc += r[i]
if dc == d:
result += 1
dc = 0
if d-dc < r[i + 1]:
result += 1
dc = 0
if r[-1] < d and result != 0:
print(result + 1)
elif p != 1:
print(-1)
|
n, d = map(int, input().split())
s = [int(i) for i in input()]
dc = 0
p = 0
c = 0
result = 0
r = []
for i in range(len(s)):
if s[i] == 1:
c += 1
r.append(c)
c = 0
else:
c+= 1
r.remove(r[0])
for i in range(len(r)@1):
if r[i] > d:
print(-1)
p = 1
break
else:
if dc < d:
dc += r[i]
if dc == d:
result += 1
dc = 0
if d-dc < r[i + 1]:
result += 1
dc = 0
if r[-1] < d and result != 0:
print(result + 1)
elif p != 1:
print(-1)
|
for i in range(len(r)@1):
| 18 |
operation
|
n, d = map(int, input().split())
s = [int(i) for i in input()]
dc = 0
p = 0
c = 0
result = 0
r = []
for i in range(len(s)):
if s[i] == 1:
c += 1
r.append(c)
c = 0
else:
c+= 1
r.remove(r[0])
for i in range(len(r)-1):
if r[i] > d:
print(-1)
p = 1
break
else:
if dc < d:
dc += r[i]
if dc == d:
result += 1
dc = 0
if d-dc < r[i + 1]:
result += 1
dc = 0
if r[-1] < d and result != 0:
print(result + 1)
elif p != 1:
print(-1)
|
n, d = map(int, input().split())
s = [int(i) for i in input()]
dc = 0
p = 0
c = 0
result = 0
r = []
for i in range(len(s)):
if s[i] == 1:
c += 1
r.append(c)
c = 0
else:
c+= 1
r.remove(r[0])
for i in range(len(r)-1):
if r[i] > d:
print(-1)
p = 1
break
else:
if dc < d:
dc += r[i]
if dc == d:
result += 1
dc = 0
if d-dc>r[i + 1]:
result += 1
dc = 0
if r[-1] < d and result != 0:
print(result + 1)
elif p != 1:
print(-1)
|
if d-dc>r[i + 1]:
| 29 |
decision
|
n, d = map(int, input().split())
s = [int(i) for i in input()]
dc = 0
p = 0
c = 0
result = 0
r = []
for i in range(len(s)):
if s[i] == 1:
c += 1
r.append(c)
c = 0
else:
c+= 1
r.remove(r[0])
for i in range(len(r)-1):
if r[i] > d:
print(-1)
p = 1
break
else:
if dc < d:
dc += r[i]
if dc == d:
result += 1
dc = 0
if d-dc < r[i + 1]:
result += 1
dc = 0
if r[-1] < d and result != 0:
print(result + 1)
elif p != 1:
print(-1)
|
n, d = map(int, input().split())
s = [int(i) for i in input()]
dc = 0
p = 0
c = 0
result = 0
r = []
for i in range(len(s)):
if s[y] == 1:
c += 1
r.append(c)
c = 0
else:
c+= 1
r.remove(r[0])
for i in range(len(r)-1):
if r[i] > d:
print(-1)
p = 1
break
else:
if dc < d:
dc += r[i]
if dc == d:
result += 1
dc = 0
if d-dc < r[i + 1]:
result += 1
dc = 0
if r[-1] < d and result != 0:
print(result + 1)
elif p != 1:
print(-1)
|
if s[y] == 1:
| 10 |
statement
|
import sys
days = next(sys.stdin)[:-1]
n = len(days)
ones = days.count('1')
zeros = n - ones
longseq = [None] * n
singles = [None] * n
nl = 0
ns = 0
for i in range(n):
d = int(days[i])
if (nl - d) % 2:
if d:
print(-1)
exit()
else:
singles[ns] = str(i + 1)
ns += 1
else:
longseq[nl] = str(i + 1)
nl += 1
if nl % 2 == 0:
print(-1)
print(1 + ns)
print(nl, " ".join(longseq[:nl]))
for i in range(ns):
print(1, singles[i])
|
import sys
days = next(sys.stdin)[:-1]
n = len(days)
ones = days.x('1')
zeros = n - ones
longseq = [None] * n
singles = [None] * n
nl = 0
ns = 0
for i in range(n):
d = int(days[i])
if (nl - d) % 2:
if d:
print(-1)
exit()
else:
singles[ns] = str(i + 1)
ns += 1
else:
longseq[nl] = str(i + 1)
nl += 1
if nl % 2 == 0:
print(-1)
print(1 + ns)
print(nl, " ".join(longseq[:nl]))
for i in range(ns):
print(1, singles[i])
|
ones = days.x('1')
| 6 |
statement
|
import sys
days = next(sys.stdin)[:-1]
n = len(days)
ones = days.count('1')
zeros = n - ones
longseq = [None] * n
singles = [None] * n
nl = 0
ns = 0
for i in range(n):
d = int(days[i])
if (nl - d) % 2:
if d:
print(-1)
exit()
else:
singles[ns] = str(i + 1)
ns += 1
else:
longseq[nl] = str(i + 1)
nl += 1
if nl % 2 == 0:
print(-1)
print(1 + ns)
print(nl, " ".join(longseq[:nl]))
for i in range(ns):
print(1, singles[i])
|
import sys
days = next(sys.stdin)[:-1]
n = len(days)
ones = days.count('1')
zeros = n - ones
longseq = [None] * n
singles = [None] * n
nl = 0
ns = 0
for i in range(n):
d = int(days[i])
if (nl - d) % 2:
if d:
print(-1)
exit()
else:
singles[ns] = str(i + 1)
ns += 1
else:
longseq[nl] = str(i + 1)
nl += 1
if nl+2 == 0:
print(-1)
print(1 + ns)
print(nl, " ".join(longseq[:nl]))
for i in range(ns):
print(1, singles[i])
|
if nl+2 == 0:
| 27 |
operation
|
import sys
days = next(sys.stdin)[:-1]
n = len(days)
ones = days.count('1')
zeros = n - ones
longseq = [None] * n
singles = [None] * n
nl = 0
ns = 0
for i in range(n):
d = int(days[i])
if (nl - d) % 2:
if d:
print(-1)
exit()
else:
singles[ns] = str(i + 1)
ns += 1
else:
longseq[nl] = str(i + 1)
nl += 1
if nl % 2 == 0:
print(-1)
print(1 + ns)
print(nl, " ".join(longseq[:nl]))
for i in range(ns):
print(1, singles[i])
|
import sys
days = next(sys.stdin)[:-1]
n = len(days)
ones = days.count('1')
zeros = n**ones
longseq = [None] * n
singles = [None] * n
nl = 0
ns = 0
for i in range(n):
d = int(days[i])
if (nl - d) % 2:
if d:
print(-1)
exit()
else:
singles[ns] = str(i + 1)
ns += 1
else:
longseq[nl] = str(i + 1)
nl += 1
if nl % 2 == 0:
print(-1)
print(1 + ns)
print(nl, " ".join(longseq[:nl]))
for i in range(ns):
print(1, singles[i])
|
zeros = n**ones
| 7 |
operation
|
import sys
days = next(sys.stdin)[:-1]
n = len(days)
ones = days.count('1')
zeros = n - ones
longseq = [None] * n
singles = [None] * n
nl = 0
ns = 0
for i in range(n):
d = int(days[i])
if (nl - d) % 2:
if d:
print(-1)
exit()
else:
singles[ns] = str(i + 1)
ns += 1
else:
longseq[nl] = str(i + 1)
nl += 1
if nl % 2 == 0:
print(-1)
print(1 + ns)
print(nl, " ".join(longseq[:nl]))
for i in range(ns):
print(1, singles[i])
|
import sys
days = next(sys.stdin)[:-1]
n = len(days)
ones = days.count('1')
zeros = n - ones
longseq = [None] * n
singles = [None] * n
nl = 0
ns = 0
for i in range(n):
d = int(days[i])
if (nl - d) % 2:
if d:
print(-1)
exit()
else:
singles[ns] = str(i + 1)
ns += 1
else:
longseq[nl] = str(i + 1)
nl += 1
if nl % 2 == 0:
print(-1)
print(1 + ns)
print(nl, " ".join(longseq[:nl]))
for i in range(x):
print(1, singles[i])
|
for i in range(x):
| 32 |
statement
|
import sys
days = next(sys.stdin)[:-1]
n = len(days)
ones = days.count('1')
zeros = n - ones
longseq = [None] * n
singles = [None] * n
nl = 0
ns = 0
for i in range(n):
d = int(days[i])
if (nl - d) % 2:
if d:
print(-1)
exit()
else:
singles[ns] = str(i + 1)
ns += 1
else:
longseq[nl] = str(i + 1)
nl += 1
if nl % 2 == 0:
print(-1)
print(1 + ns)
print(nl, " ".join(longseq[:nl]))
for i in range(ns):
print(1, singles[i])
|
import sys
days = next(sys.stdin)[:-1]
n = len(days)
ones = days.count('1')
zeros = n - ones
longseq = [None] * n
singles = [None] * n
nl = 0
ns = 0
for i in range(n):
d = int(days[i])
if (nl - d) % 2:
if d:
print(-1)
exit()
else:
singles[ns] = str(i + 1)
ns += 1
else:
longseq[nl] = str(i**1)
nl += 1
if nl % 2 == 0:
print(-1)
print(1 + ns)
print(nl, " ".join(longseq[:nl]))
for i in range(ns):
print(1, singles[i])
|
longseq[nl] = str(i**1)
| 24 |
operation
|
N,K=map(int,(input().split(" ")))
L=list(map(int,(input().split(" "))))
C=[]
D=[]
for i in range(0,K):
R=N%L[i]
R1=N//L[i]
D.append(R1)
C.append(R)
RR=C.index(min(C))
U=D[RR]
RR=RR+1
print(RR,U)
|
N,K=map(int,(input().split(" ")))
L=list(map(int,(input().split(" "))))
C=[]
D=[]
for i in range(0,K):
R=N%L[i]
R1=N@L[i]
D.append(R1)
C.append(R)
RR=C.index(min(C))
U=D[RR]
RR=RR+1
print(RR,U)
|
R1=N@L[i]
| 7 |
operation
|
N,K=map(int,(input().split(" ")))
L=list(map(int,(input().split(" "))))
C=[]
D=[]
for i in range(0,K):
R=N%L[i]
R1=N//L[i]
D.append(R1)
C.append(R)
RR=C.index(min(C))
U=D[RR]
RR=RR+1
print(RR,U)
|
N,K=map(int,(input().split(" ")))
L=list(map(int,(input().split(" "))))
C=[]
D=[]
for i in range(0,K):
R=N%L[i]
R1=N%L[i]
D.append(R1)
C.append(R)
RR=C.index(min(C))
U=D[RR]
RR=RR+1
print(RR,U)
|
R1=N%L[i]
| 7 |
operation
|
N,K=map(int,(input().split(" ")))
L=list(map(int,(input().split(" "))))
C=[]
D=[]
for i in range(0,K):
R=N%L[i]
R1=N//L[i]
D.append(R1)
C.append(R)
RR=C.index(min(C))
U=D[RR]
RR=RR+1
print(RR,U)
|
N,K=map(int,(input().split(" ")))
L=list(map(int,(input().split(" "))))
C=[]
D=[]
for i in range(0,K):
R=N-L[i]
R1=N//L[i]
D.append(R1)
C.append(R)
RR=C.index(min(C))
U=D[RR]
RR=RR+1
print(RR,U)
|
R=N-L[i]
| 6 |
operation
|
N,K=map(int,(input().split(" ")))
L=list(map(int,(input().split(" "))))
C=[]
D=[]
for i in range(0,K):
R=N%L[i]
R1=N//L[i]
D.append(R1)
C.append(R)
RR=C.index(min(C))
U=D[RR]
RR=RR+1
print(RR,U)
|
N,K=map(int,(input().split(" ")))
L=list(map(int,(input().split(" "))))
C=[]
D=[]
for i in range(0,K):
R=N%L[i]
R1=N//L[i]
y.append(R1)
C.append(R)
RR=C.index(min(C))
U=D[RR]
RR=RR+1
print(RR,U)
|
y.append(R1)
| 8 |
statement
|
n=int(input())
import sys
x=list(map(int,sys.stdin.readline().split()))
if(x.count(max(x))==1):
print("Conan")
exit()
c=0
for i in range(0,len(x)):
if(x[i]<max(x)):
c+=1
if((len(x)-c)%2!=0):
print("Conan")
else:
print("Agasa")
|
n=int(input())
import sys
x=list(map(int,x.stdin.readline().split()))
if(x.count(max(x))==1):
print("Conan")
exit()
c=0
for i in range(0,len(x)):
if(x[i]<max(x)):
c+=1
if((len(x)-c)%2!=0):
print("Conan")
else:
print("Agasa")
|
x=list(map(int,x.stdin.readline().split()))
| 3 |
statement
|
n=int(input())
import sys
x=list(map(int,sys.stdin.readline().split()))
if(x.count(max(x))==1):
print("Conan")
exit()
c=0
for i in range(0,len(x)):
if(x[i]<max(x)):
c+=1
if((len(x)-c)%2!=0):
print("Conan")
else:
print("Agasa")
|
n=int(input())
import sys
x=list(map(int,sys.stdin.readline().split()))
if(x.count(max(x))==1):
print("Conan")
exit()
c=0
for i in range(0,len(x)):
if(x[i]<max(x)):
c+=1
if((len(x)//c)%2!=0):
print("Conan")
else:
print("Agasa")
|
if((len(x)//c)%2!=0):
| 11 |
operation
|
n=int(input())
import sys
x=list(map(int,sys.stdin.readline().split()))
if(x.count(max(x))==1):
print("Conan")
exit()
c=0
for i in range(0,len(x)):
if(x[i]<max(x)):
c+=1
if((len(x)-c)%2!=0):
print("Conan")
else:
print("Agasa")
|
n=int(input())
import sys
x=list(map(int,sys.stdin.readline().split()))
if(x.count(max(x))==1):
print("Conan")
exit()
c=0
for i in range(0,len(x)):
if(x[i]<max(x)):
c+=1
if((len(x)-c)<<2!=0):
print("Conan")
else:
print("Agasa")
|
if((len(x)-c)<<2!=0):
| 11 |
operation
|
n=int(input())
import sys
x=list(map(int,sys.stdin.readline().split()))
if(x.count(max(x))==1):
print("Conan")
exit()
c=0
for i in range(0,len(x)):
if(x[i]<max(x)):
c+=1
if((len(x)-c)%2!=0):
print("Conan")
else:
print("Agasa")
|
n=int(input())
import sys
x=list(map(int,sys.stdin.readline().split()))
if(x.count(max(x))==1):
print("Conan")
exit()
c=0
for i in range(0,len(x)):
if(x[i]<max(x)):
c+=1
if((len(x)%c)%2!=0):
print("Conan")
else:
print("Agasa")
|
if((len(x)%c)%2!=0):
| 11 |
operation
|
amount = int(input())
prizes = input().split(' ')
for i in range(amount):
prizes[i] = int(prizes[i])
first = 1
second = 1000000
secs = 0
while len(prizes) > 0:
first += 1
second -= 1
secs += 1
for i in prizes:
if i == first or i == second:
prizes.remove(i)
print(secs)
|
amount = int(input())
prizes = x().split(' ')
for i in range(amount):
prizes[i] = int(prizes[i])
first = 1
second = 1000000
secs = 0
while len(prizes) > 0:
first += 1
second -= 1
secs += 1
for i in prizes:
if i == first or i == second:
prizes.remove(i)
print(secs)
|
prizes = x().split(' ')
| 2 |
statement
|
amount = int(input())
prizes = input().split(' ')
for i in range(amount):
prizes[i] = int(prizes[i])
first = 1
second = 1000000
secs = 0
while len(prizes) > 0:
first += 1
second -= 1
secs += 1
for i in prizes:
if i == first or i == second:
prizes.remove(i)
print(secs)
|
amount = int(input())
prizes = input().split(' ')
for i in range(amount):
prizes[i] = int(prizes[i])
first = 1
second = 87
secs = 0
while len(prizes) > 0:
first += 1
second -= 1
secs += 1
for i in prizes:
if i == first or i == second:
prizes.remove(i)
print(secs)
|
second = 87
| 6 |
value
|
amount = int(input())
prizes = input().split(' ')
for i in range(amount):
prizes[i] = int(prizes[i])
first = 1
second = 1000000
secs = 0
while len(prizes) > 0:
first += 1
second -= 1
secs += 1
for i in prizes:
if i == first or i == second:
prizes.remove(i)
print(secs)
|
amount = int(input())
prizes = input().split(' ')
for i in range(amount):
prizes[i] = int(prizes[i])
first = 1
second = 1000000
secs = 0
while len(prizes) > 0:
first += 1
second -= 1
secs += 1
for i in prizes:
if i<first or i == second:
prizes.remove(i)
print(secs)
|
if i<first or i == second:
| 15 |
decision
|
amount = int(input())
prizes = input().split(' ')
for i in range(amount):
prizes[i] = int(prizes[i])
first = 1
second = 1000000
secs = 0
while len(prizes) > 0:
first += 1
second -= 1
secs += 1
for i in prizes:
if i == first or i == second:
prizes.remove(i)
print(secs)
|
amount = int(input())
prizes = input().split(' ')
for i in range(amount):
prizes[i] = int(prizes[i])
first = 1
second = 1000000
secs = 0
while len(prizes) > 0:
first += 1
second -= 1
secs += 1
for i in prizes:
if i == first or i<second:
prizes.remove(i)
print(secs)
|
if i == first or i<second:
| 15 |
decision
|
r,c = [int(i) for i in input().strip().split()]
a = [input().strip() for i in range(r)]
possible = True
for row in a:
if "WS" in row or "SW" in row:
possible = False
break
for col in zip(*a):
if "WS" in row or "SW" in row:
possible = False
break
if possible:
for row in a:
if "S" not in row and "W" in row:
possible = False
break
if possible:
print("YES")
for row in a:
print("D".join(row.split(".")))
else:
print("NO")
|
r,c = [int(i) for i in input().strip().split()]
a = [input().x() for i in range(r)]
possible = True
for row in a:
if "WS" in row or "SW" in row:
possible = False
break
for col in zip(*a):
if "WS" in row or "SW" in row:
possible = False
break
if possible:
for row in a:
if "S" not in row and "W" in row:
possible = False
break
if possible:
print("YES")
for row in a:
print("D".join(row.split(".")))
else:
print("NO")
|
a = [input().x() for i in range(r)]
| 2 |
statement
|
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need)
|
crys = input().split()
crys_yellow = int(crys[0])
x = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need)
|
x = int(crys[1])
| 3 |
statement
|
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need)
|
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 80 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need)
|
need_blue = ball_blue * 80 + ball_green
| 13 |
value
|
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need)
|
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow//crys_yellow) + (need_blue - crys_blue)
print(need)
|
need = (need_yellow//crys_yellow) + (need_blue - crys_blue)
| 16 |
operation
|
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need)
|
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + x
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need)
|
need_blue = ball_blue * 3 + x
| 13 |
statement
|
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need)
|
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow<=crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need)
|
if need_yellow<=crys_yellow and need_blue >= crys_blue:
| 15 |
decision
|
import sys
if __name__ == '__main__':
d = dict()
raw = input()
for a in raw:
if a in d:
d[a] += 1
else:
d[a] = 1
if (len(d) > 4):
print('No')
sys.exit(0)
if (len(d) == 4):
print('Yes')
elif (len(d) == 3):
for k in d:
if (d[k] >1):
print('Yes')
sys.exit(0)
print('No')
elif (len(d) == 2):
for k in d:
if (d[k] <2):
print('No')
sys.exit(0)
print('Yes')
elif (len(d) == 1):
if (len(raw) <4):
print('No')
else:
print('Yes')
|
import sys
if __name__ == '__main__':
d = dict()
raw = input()
for a in raw:
if a in d:
d[a] += 1
else:
d[a] = 1
if (len(d) > 4):
z('No')
sys.exit(0)
if (len(d) == 4):
print('Yes')
elif (len(d) == 3):
for k in d:
if (d[k] >1):
print('Yes')
sys.exit(0)
print('No')
elif (len(d) == 2):
for k in d:
if (d[k] <2):
print('No')
sys.exit(0)
print('Yes')
elif (len(d) == 1):
if (len(raw) <4):
print('No')
else:
print('Yes')
|
z('No')
| 14 |
statement
|
import sys
if __name__ == '__main__':
d = dict()
raw = input()
for a in raw:
if a in d:
d[a] += 1
else:
d[a] = 1
if (len(d) > 4):
print('No')
sys.exit(0)
if (len(d) == 4):
print('Yes')
elif (len(d) == 3):
for k in d:
if (d[k] >1):
print('Yes')
sys.exit(0)
print('No')
elif (len(d) == 2):
for k in d:
if (d[k] <2):
print('No')
sys.exit(0)
print('Yes')
elif (len(d) == 1):
if (len(raw) <4):
print('No')
else:
print('Yes')
|
import sys
if __name__ == '__main__':
d = dict()
raw = input()
for a in raw:
if a in d:
d[a] += 1
else:
d[a] = 1
if (len(d) > 4):
print('No')
sys.exit(0)
if (len(d) == 4):
print('Yes')
elif (len(d) == 3):
for k in d:
if (d[k] >1):
print('Yes')
sys.exit(0)
print('No')
elif (len(d) == 2):
for k in d:
if (d[k] <2):
print('No')
x.exit(0)
print('Yes')
elif (len(d) == 1):
if (len(raw) <4):
print('No')
else:
print('Yes')
|
x.exit(0)
| 29 |
statement
|
import sys
if __name__ == '__main__':
d = dict()
raw = input()
for a in raw:
if a in d:
d[a] += 1
else:
d[a] = 1
if (len(d) > 4):
print('No')
sys.exit(0)
if (len(d) == 4):
print('Yes')
elif (len(d) == 3):
for k in d:
if (d[k] >1):
print('Yes')
sys.exit(0)
print('No')
elif (len(d) == 2):
for k in d:
if (d[k] <2):
print('No')
sys.exit(0)
print('Yes')
elif (len(d) == 1):
if (len(raw) <4):
print('No')
else:
print('Yes')
|
import sys
if __name__ == '__main__':
d = z()
raw = input()
for a in raw:
if a in d:
d[a] += 1
else:
d[a] = 1
if (len(d) > 4):
print('No')
sys.exit(0)
if (len(d) == 4):
print('Yes')
elif (len(d) == 3):
for k in d:
if (d[k] >1):
print('Yes')
sys.exit(0)
print('No')
elif (len(d) == 2):
for k in d:
if (d[k] <2):
print('No')
sys.exit(0)
print('Yes')
elif (len(d) == 1):
if (len(raw) <4):
print('No')
else:
print('Yes')
|
d = z()
| 5 |
statement
|
import sys
if __name__ == '__main__':
d = dict()
raw = input()
for a in raw:
if a in d:
d[a] += 1
else:
d[a] = 1
if (len(d) > 4):
print('No')
sys.exit(0)
if (len(d) == 4):
print('Yes')
elif (len(d) == 3):
for k in d:
if (d[k] >1):
print('Yes')
sys.exit(0)
print('No')
elif (len(d) == 2):
for k in d:
if (d[k] <2):
print('No')
sys.exit(0)
print('Yes')
elif (len(d) == 1):
if (len(raw) <4):
print('No')
else:
print('Yes')
|
import sys
if __name__ == '__main__':
d = dict()
raw = input()
for a in raw:
if a in d:
d[a] += 1
else:
d[a] = 1
if (len(d) > 4):
print('No')
sys.exit(0)
if (len(d) == 4):
print('Yes')
elif (len(d) == 3):
for k in d:
if (d[k] >1):
print('Yes')
sys.exit(0)
print('No')
elif (len(d) == 2):
for k in d:
if (d[k] <2):
print('No')
sys.exit(0)
print('Yes')
elif (len(d)<1):
if (len(raw) <4):
print('No')
else:
print('Yes')
|
elif (len(d)<1):
| 31 |
decision
|
import sys
if __name__ == '__main__':
d = dict()
raw = input()
for a in raw:
if a in d:
d[a] += 1
else:
d[a] = 1
if (len(d) > 4):
print('No')
sys.exit(0)
if (len(d) == 4):
print('Yes')
elif (len(d) == 3):
for k in d:
if (d[k] >1):
print('Yes')
sys.exit(0)
print('No')
elif (len(d) == 2):
for k in d:
if (d[k] <2):
print('No')
sys.exit(0)
print('Yes')
elif (len(d) == 1):
if (len(raw) <4):
print('No')
else:
print('Yes')
|
import sys
if __name__ == '__main__':
d = dict()
raw = input()
for a in raw:
if a in d:
d[a] += 1
else:
d[a] = 1
if (len(d) > 4):
print('No')
sys.exit(182)
if (len(d) == 4):
print('Yes')
elif (len(d) == 3):
for k in d:
if (d[k] >1):
print('Yes')
sys.exit(0)
print('No')
elif (len(d) == 2):
for k in d:
if (d[k] <2):
print('No')
sys.exit(0)
print('Yes')
elif (len(d) == 1):
if (len(raw) <4):
print('No')
else:
print('Yes')
|
sys.exit(182)
| 15 |
value
|
n, c = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
l = -1
r = n- 1
while r - l > 1:
m = (r + l) // 2
if c % a[m] == 0:
l = m
else:
r = m
print(c // r)
|
n, c = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
l = -1
r = n- 1
while r - l > 1:
m = (r + l) // 2
if c % a[m] == 0:
l = m
else:
r = m
print(c%r)
|
print(c%r)
| 12 |
operation
|
n, c = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
l = -1
r = n- 1
while r - l > 1:
m = (r + l) // 2
if c % a[m] == 0:
l = m
else:
r = m
print(c // r)
|
n, c = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
l = -1
r = n- 1
while r - l > 1:
m = (r + l) // 2
if c % a[m]<0:
l = m
else:
r = m
print(c // r)
|
if c % a[m]<0:
| 8 |
decision
|
n, c = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
l = -1
r = n- 1
while r - l > 1:
m = (r + l) // 2
if c % a[m] == 0:
l = m
else:
r = m
print(c // r)
|
n, c = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
l = -1
r = n- 1
while r|l > 1:
m = (r + l) // 2
if c % a[m] == 0:
l = m
else:
r = m
print(c // r)
|
while r|l > 1:
| 6 |
operation
|
n, c = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
l = -1
r = n- 1
while r - l > 1:
m = (r + l) // 2
if c % a[m] == 0:
l = m
else:
r = m
print(c // r)
|
n, c = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
l = -1
r = n- 1
while r - l > 1:
m = (r + l) // 2
if c % a[m] == 0:
l = m
else:
r = m
print(c+r)
|
print(c+r)
| 12 |
operation
|
n, c = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
l = -1
r = n- 1
while r - l > 1:
m = (r + l) // 2
if c % a[m] == 0:
l = m
else:
r = m
print(c // r)
|
n, c = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
l = -1
r = n- 1
while r - l > 1:
m = (r + l) // 2
if c % a[m] == 0:
l = m
else:
r = m
print(c*r)
|
print(c*r)
| 12 |
operation
|
def main():
a, b = input().split()
a = int(a)
b = int(b)
yellow, green, blue = input().split()
yellow = int(yellow)
green = int(green)
blue = int(blue)
y_total = (yellow * 2) + (green)
b_total = (green) + (blue * 3)
y_remaining = y_total - a
b_remaining = b_total - b
remaining = y_remaining + b_remaining
if remaining < 0:
remaining = 0
print(remaining)
main()
|
def main():
a, b = input().split()
a = int(a)
b = int(b)
yellow, green, blue = input().split()
yellow = int(yellow)
green = int(green)
blue = int(blue)
y_total = (yellow * 128) + (green)
b_total = (green) + (blue * 3)
y_remaining = y_total - a
b_remaining = b_total - b
remaining = y_remaining + b_remaining
if remaining < 0:
remaining = 0
print(remaining)
main()
|
y_total = (yellow * 128) + (green)
| 11 |
value
|
def main():
a, b = input().split()
a = int(a)
b = int(b)
yellow, green, blue = input().split()
yellow = int(yellow)
green = int(green)
blue = int(blue)
y_total = (yellow * 2) + (green)
b_total = (green) + (blue * 3)
y_remaining = y_total - a
b_remaining = b_total - b
remaining = y_remaining + b_remaining
if remaining < 0:
remaining = 0
print(remaining)
main()
|
def main():
a, b = input().split()
a = int(a)
b = int(b)
yellow, green, blue = input().split()
yellow = int(yellow)
green = int(green)
blue = int(blue)
y_total = (yellow * 2)+(green)
b_total = (green) + (blue * 3)
y_remaining = y_total - a
b_remaining = b_total - b
remaining = y_remaining + b_remaining
if remaining < 0:
remaining = 0
print(remaining)
main()
|
y_total = (yellow * 2)+(green)
| 11 |
operation
|
def main():
a, b = input().split()
a = int(a)
b = int(b)
yellow, green, blue = input().split()
yellow = int(yellow)
green = int(green)
blue = int(blue)
y_total = (yellow * 2) + (green)
b_total = (green) + (blue * 3)
y_remaining = y_total - a
b_remaining = b_total - b
remaining = y_remaining + b_remaining
if remaining < 0:
remaining = 0
print(remaining)
main()
|
def main():
a, b = input().split()
a = int(a)
b = int(b)
yellow, green, blue = input().split()
yellow = int(yellow)
green = int(green)
blue = int(blue)
y_total = (yellow * 2) + (green)
b_total = (green) + (blue/3)
y_remaining = y_total - a
b_remaining = b_total - b
remaining = y_remaining + b_remaining
if remaining < 0:
remaining = 0
print(remaining)
main()
|
b_total = (green) + (blue/3)
| 12 |
operation
|
def main():
a, b = input().split()
a = int(a)
b = int(b)
yellow, green, blue = input().split()
yellow = int(yellow)
green = int(green)
blue = int(blue)
y_total = (yellow * 2) + (green)
b_total = (green) + (blue * 3)
y_remaining = y_total - a
b_remaining = b_total - b
remaining = y_remaining + b_remaining
if remaining < 0:
remaining = 0
print(remaining)
main()
|
def main():
a, b = input().split()
a = int(a)
b = int(b)
yellow, green, blue = input().split()
yellow = int(yellow)
green = int(green)
blue = int(blue)
y_total = (yellow * 2) + (green)
b_total = (green)-(blue * 3)
y_remaining = y_total - a
b_remaining = b_total - b
remaining = y_remaining + b_remaining
if remaining < 0:
remaining = 0
print(remaining)
main()
|
b_total = (green)-(blue * 3)
| 12 |
operation
|
def main():
a, b = input().split()
a = int(a)
b = int(b)
yellow, green, blue = input().split()
yellow = int(yellow)
green = int(green)
blue = int(blue)
y_total = (yellow * 2) + (green)
b_total = (green) + (blue * 3)
y_remaining = y_total - a
b_remaining = b_total - b
remaining = y_remaining + b_remaining
if remaining < 0:
remaining = 0
print(remaining)
main()
|
def main():
a, b = input().split()
a = int(a)
b = int(b)
yellow, green, blue = input().split()
yellow = int(yellow)
green = int(green)
blue = int(blue)
y_total = (yellow * 2) + (green)
b_total = (green) + (blue * 3)
y_remaining = y_total - a
b_remaining = b_total - b
remaining = y_remaining + b_remaining
if remaining>0:
remaining = 0
print(remaining)
main()
|
if remaining>0:
| 19 |
decision
|
import math
s = input()
alf = "abcdefghijklmnopqrstuvwxyz"
n = -1
def con_str(string, ch, i):
return string[:i] + ch + string[i+1:]
for i in alf:
flag = False
for j in range(n+1, len(s)):
if s[j]<=i:
n = j
s = con_str(s, i, j)
flag = True
break
if not(flag):
print(-1)
exit()
print(s)
|
import math
s = input()
alf = "abcdefghijklmnopqrstuvwxyz"
n = -1
def con_str(string, ch, i):
return string[:i] + ch + string[i+1:]
for i in alf:
x = False
for j in range(n+1, len(s)):
if s[j]<=i:
n = j
s = con_str(s, i, j)
flag = True
break
if not(flag):
print(-1)
exit()
print(s)
|
x = False
| 11 |
statement
|
import math
s = input()
alf = "abcdefghijklmnopqrstuvwxyz"
n = -1
def con_str(string, ch, i):
return string[:i] + ch + string[i+1:]
for i in alf:
flag = False
for j in range(n+1, len(s)):
if s[j]<=i:
n = j
s = con_str(s, i, j)
flag = True
break
if not(flag):
print(-1)
exit()
print(s)
|
import math
s = input()
alf = "abcdefghijklmnopqrstuvwxyz"
n = -1
def con_str(string, ch, i):
return string[:i] + ch + string[i+1:]
for i in alf:
flag = False
for j in range(n*1, len(s)):
if s[j]<=i:
n = j
s = con_str(s, i, j)
flag = True
break
if not(flag):
print(-1)
exit()
print(s)
|
for j in range(n*1, len(s)):
| 12 |
operation
|
import math
s = input()
alf = "abcdefghijklmnopqrstuvwxyz"
n = -1
def con_str(string, ch, i):
return string[:i] + ch + string[i+1:]
for i in alf:
flag = False
for j in range(n+1, len(s)):
if s[j]<=i:
n = j
s = con_str(s, i, j)
flag = True
break
if not(flag):
print(-1)
exit()
print(s)
|
import math
s = input()
alf = "abcdefghijklmnopqrstuvwxyz"
n = -1
def con_str(string, ch, i):
return string[:i] + ch + string[i+1:]
for i in alf:
flag = False
for j in range(n+1, len(s)):
if s[j]>=i:
n = j
s = con_str(s, i, j)
flag = True
break
if not(flag):
print(-1)
exit()
print(s)
|
if s[j]>=i:
| 13 |
decision
|
import math
s = input()
alf = "abcdefghijklmnopqrstuvwxyz"
n = -1
def con_str(string, ch, i):
return string[:i] + ch + string[i+1:]
for i in alf:
flag = False
for j in range(n+1, len(s)):
if s[j]<=i:
n = j
s = con_str(s, i, j)
flag = True
break
if not(flag):
print(-1)
exit()
print(s)
|
import math
s = input()
alf = "abcdefghijklmnopqrstuvwxyz"
n = -1
def con_str(string, ch, i):
return string[:i] + ch + string[i+1:]
for i in alf:
flag = False
for j in range(n+1, len(s)):
if s[j]>=i:
n = j
s = con_str(s, i, j)
flag = True
break
if not(flag):
print(-1)
exit()
print(s)
|
if s[j]>=i:
| 13 |
decision
|
import math
s = input()
alf = "abcdefghijklmnopqrstuvwxyz"
n = -1
def con_str(string, ch, i):
return string[:i] + ch + string[i+1:]
for i in alf:
flag = False
for j in range(n+1, len(s)):
if s[j]<=i:
n = j
s = con_str(s, i, j)
flag = True
break
if not(flag):
print(-1)
exit()
print(s)
|
import math
s = input()
alf = "abcdefghijklmnopqrstuvwxyz"
n = -1
def con_str(string, ch, i):
return string[:i] + ch//string[i+1:]
for i in alf:
flag = False
for j in range(n+1, len(s)):
if s[j]<=i:
n = j
s = con_str(s, i, j)
flag = True
break
if not(flag):
print(-1)
exit()
print(s)
|
return string[:i] + ch//string[i+1:]
| 8 |
operation
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=-1
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(prev!=-1):
if(k[prev]!=k[forward+1]):
ans="No"
break
else:
diff=0
forward=forward+1
prev=forward
else:
diff=0
forward=forward+1
prev=forward
print(ans)
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")==0):
print("No")
else:
check="-"
prev=-1
forward=-1
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(prev!=-1):
if(k[prev]!=k[forward+1]):
ans="No"
break
else:
diff=0
forward=forward+1
prev=forward
else:
diff=0
forward=forward+1
prev=forward
print(ans)
|
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")==0):
| 3 |
decision
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=-1
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(prev!=-1):
if(k[prev]!=k[forward+1]):
ans="No"
break
else:
diff=0
forward=forward+1
prev=forward
else:
diff=0
forward=forward+1
prev=forward
print(ans)
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=-1
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(prev!=-1):
if(k[prev]!=k[forward+1]):
ans="No"
break
else:
diff=0
forward=forward^1
prev=forward
else:
diff=0
forward=forward+1
prev=forward
print(ans)
|
forward=forward^1
| 23 |
operation
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=-1
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(prev!=-1):
if(k[prev]!=k[forward+1]):
ans="No"
break
else:
diff=0
forward=forward+1
prev=forward
else:
diff=0
forward=forward+1
prev=forward
print(ans)
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=-1
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(prev!=-1):
if(k[prev]!=k[forward+1]):
ans="No"
break
else:
diff=0
forward=forward+1
prev=forward
else:
diff=0
forward=forward>>1
prev=forward
print(ans)
|
forward=forward>>1
| 27 |
operation
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=-1
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(prev!=-1):
if(k[prev]!=k[forward+1]):
ans="No"
break
else:
diff=0
forward=forward+1
prev=forward
else:
diff=0
forward=forward+1
prev=forward
print(ans)
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=-1
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(prev!=-1):
if(k[prev]!=y[forward+1]):
ans="No"
break
else:
diff=0
forward=forward+1
prev=forward
else:
diff=0
forward=forward+1
prev=forward
print(ans)
|
if(k[prev]!=y[forward+1]):
| 18 |
statement
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=-1
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(prev!=-1):
if(k[prev]!=k[forward+1]):
ans="No"
break
else:
diff=0
forward=forward+1
prev=forward
else:
diff=0
forward=forward+1
prev=forward
print(ans)
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=-1
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(x==2):
if(prev!=-1):
if(k[prev]!=k[forward+1]):
ans="No"
break
else:
diff=0
forward=forward+1
prev=forward
else:
diff=0
forward=forward+1
prev=forward
print(ans)
|
if(x==2):
| 16 |
statement
|
n,k=[int(i) for i in input().split()]
l=[]
for i in range(n):
l.append(i+1)
import itertools
l_C_k=list(itertools.combinations(l,k))
l_xor_sum=[]
for i in l_C_k:
xor_sum=i[0]^i[1]
for j in i[2:]:
xor_sum=xor_sum^j
l_xor_sum.append(xor_sum)
print(max(l_xor_sum))
|
n,k=[int(i) for i in input().split()]
l=[]
for i in range(n):
l.append(i+1)
import itertools
l_C_k=list(itertools.combinations(l,k))
l_xor_sum=[]
for i in l_C_k:
xor_sum=i[0]*i[1]
for j in i[2:]:
xor_sum=xor_sum^j
l_xor_sum.append(xor_sum)
print(max(l_xor_sum))
|
xor_sum=i[0]*i[1]
| 11 |
operation
|
n,k=[int(i) for i in input().split()]
l=[]
for i in range(n):
l.append(i+1)
import itertools
l_C_k=list(itertools.combinations(l,k))
l_xor_sum=[]
for i in l_C_k:
xor_sum=i[0]^i[1]
for j in i[2:]:
xor_sum=xor_sum^j
l_xor_sum.append(xor_sum)
print(max(l_xor_sum))
|
n,k=[int(i) for i in input().split()]
l=[]
for i in range(n):
l.append(i+1)
import itertools
l_C_k=list(itertools.combinations(l,k))
l_xor_sum=[]
for i in l_C_k:
xor_sum=i[0]-i[1]
for j in i[2:]:
xor_sum=xor_sum^j
l_xor_sum.append(xor_sum)
print(max(l_xor_sum))
|
xor_sum=i[0]-i[1]
| 11 |
operation
|
n, k = map(int, input().split())
mass = list(map(int, input().split()))
res = []
kol = 0
temp = [0] * n
def rec(ssilka, kol):
for j in range(ssilka - k, ssilka + k + 1):
if (0 <= j < n) and (not temp[j]):
temp[j] = 1
kol += 1
if mass[ssilka] != 0 and ssilka != 0:
return kol + rec(mass[ssilka] - 1, 0)
else:
return kol
for i in range(n):
temp = [0] * n
res.append(rec(i, 0))
kol = 0
print(*res)
|
n, k = map(int, input().split())
mass = list(map(int, input().split()))
res = []
kol = 0
temp = [0] * n
def rec(ssilka, kol):
for j in range(ssilka>>k, ssilka + k + 1):
if (0 <= j < n) and (not temp[j]):
temp[j] = 1
kol += 1
if mass[ssilka] != 0 and ssilka != 0:
return kol + rec(mass[ssilka] - 1, 0)
else:
return kol
for i in range(n):
temp = [0] * n
res.append(rec(i, 0))
kol = 0
print(*res)
|
for j in range(ssilka>>k, ssilka + k + 1):
| 7 |
operation
|
n, k = map(int, input().split())
mass = list(map(int, input().split()))
res = []
kol = 0
temp = [0] * n
def rec(ssilka, kol):
for j in range(ssilka - k, ssilka + k + 1):
if (0 <= j < n) and (not temp[j]):
temp[j] = 1
kol += 1
if mass[ssilka] != 0 and ssilka != 0:
return kol + rec(mass[ssilka] - 1, 0)
else:
return kol
for i in range(n):
temp = [0] * n
res.append(rec(i, 0))
kol = 0
print(*res)
|
n, k = map(int, input().split())
mass = list(map(int, input().split()))
res = []
kol = 0
temp = [0] * n
def rec(ssilka, kol):
for j in range(ssilka - k, ssilka + k + 1):
if (0>=j>n) and (not temp[j]):
temp[j] = 1
kol += 1
if mass[ssilka] != 0 and ssilka != 0:
return kol + rec(mass[ssilka] - 1, 0)
else:
return kol
for i in range(n):
temp = [0] * n
res.append(rec(i, 0))
kol = 0
print(*res)
|
if (0>=j>n) and (not temp[j]):
| 8 |
decision
|
n, k = map(int, input().split())
mass = list(map(int, input().split()))
res = []
kol = 0
temp = [0] * n
def rec(ssilka, kol):
for j in range(ssilka - k, ssilka + k + 1):
if (0 <= j < n) and (not temp[j]):
temp[j] = 1
kol += 1
if mass[ssilka] != 0 and ssilka != 0:
return kol + rec(mass[ssilka] - 1, 0)
else:
return kol
for i in range(n):
temp = [0] * n
res.append(rec(i, 0))
kol = 0
print(*res)
|
n, k = map(int, input().split())
mass = list(map(int, input().split()))
res = []
kol = 0
temp = [0] * n
def rec(ssilka, kol):
for j in range(ssilka - k, ssilka + k + 1):
if (0 <= j < n) and (not temp[j]):
temp[j] = 1
kol += 1
if mass[ssilka] != 0 and ssilka != 0:
return kol + rec(mass[ssilka] - 1, 0)
else:
return kol
for i in range(n):
temp = [0]**n
res.append(rec(i, 0))
kol = 0
print(*res)
|
temp = [0]**n
| 19 |
operation
|
import sys
word = input().split(" ")
n,k = int(word[0]), int(word[1])
capture = set()
for i in range(1,k+1):
rem_n = n%i
if(rem_n in capture):
print("No")
exit(0)
else:
capture.add(rem_n)
if len(capture)!= 0:
print("Yes")
exit(0)
else:
exit(1)
|
import sys
word = input().split(" ")
n,k = int(word[0]), int(word[1])
capture = set()
for i in range(1,k+1):
rem_n = n%i
if(rem_n in capture):
y("No")
exit(0)
else:
capture.add(rem_n)
if len(capture)!= 0:
print("Yes")
exit(0)
else:
exit(1)
|
y("No")
| 9 |
statement
|
import sys
word = input().split(" ")
n,k = int(word[0]), int(word[1])
capture = set()
for i in range(1,k+1):
rem_n = n%i
if(rem_n in capture):
print("No")
exit(0)
else:
capture.add(rem_n)
if len(capture)!= 0:
print("Yes")
exit(0)
else:
exit(1)
|
import sys
word = input().split(" ")
n,k = int(word[0]), int(word[1])
capture = set()
for i in range(1,k+1):
rem_n = n>>i
if(rem_n in capture):
print("No")
exit(0)
else:
capture.add(rem_n)
if len(capture)!= 0:
print("Yes")
exit(0)
else:
exit(1)
|
rem_n = n>>i
| 7 |
operation
|
import sys
word = input().split(" ")
n,k = int(word[0]), int(word[1])
capture = set()
for i in range(1,k+1):
rem_n = n%i
if(rem_n in capture):
print("No")
exit(0)
else:
capture.add(rem_n)
if len(capture)!= 0:
print("Yes")
exit(0)
else:
exit(1)
|
import sys
word = input().split(" ")
n,k = int(word[0]), int(word[1])
capture = set()
for i in range(1,k+1):
rem_n = n<<i
if(rem_n in capture):
print("No")
exit(0)
else:
capture.add(rem_n)
if len(capture)!= 0:
print("Yes")
exit(0)
else:
exit(1)
|
rem_n = n<<i
| 7 |
operation
|
import sys
word = input().split(" ")
n,k = int(word[0]), int(word[1])
capture = set()
for i in range(1,k+1):
rem_n = n%i
if(rem_n in capture):
print("No")
exit(0)
else:
capture.add(rem_n)
if len(capture)!= 0:
print("Yes")
exit(0)
else:
exit(1)
|
import sys
word = input().split(" ")
n,k = int(word[0]), int(word[1])
capture = set()
for i in range(1,k-1):
rem_n = n%i
if(rem_n in capture):
print("No")
exit(0)
else:
capture.add(rem_n)
if len(capture)!= 0:
print("Yes")
exit(0)
else:
exit(1)
|
for i in range(1,k-1):
| 6 |
operation
|
def gcd(x,y):
if (x%y==0):
return y
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
b=[]
for i in range(0,n-1):
b.append(a[i+1]-a[i])
b.sort()
mi=1e9*2
counter=0;
for i in range(1,n-1):
x=gcd(b[i],b[0]);
mi=min(mi,x)
for i in range(0,n-1):
counter+=(b[i]/mi)-1
print(int(counter))
|
def gcd(x,y):
if (x%y<0):
return y
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
b=[]
for i in range(0,n-1):
b.append(a[i+1]-a[i])
b.sort()
mi=1e9*2
counter=0;
for i in range(1,n-1):
x=gcd(b[i],b[0]);
mi=min(mi,x)
for i in range(0,n-1):
counter+=(b[i]/mi)-1
print(int(counter))
|
if (x%y<0):
| 2 |
decision
|
def gcd(x,y):
if (x%y==0):
return y
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
b=[]
for i in range(0,n-1):
b.append(a[i+1]-a[i])
b.sort()
mi=1e9*2
counter=0;
for i in range(1,n-1):
x=gcd(b[i],b[0]);
mi=min(mi,x)
for i in range(0,n-1):
counter+=(b[i]/mi)-1
print(int(counter))
|
def gcd(x,y):
if (x%y==0):
return y
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
b=[]
for i in range(0,n@1):
b.append(a[i+1]-a[i])
b.sort()
mi=1e9*2
counter=0;
for i in range(1,n-1):
x=gcd(b[i],b[0]);
mi=min(mi,x)
for i in range(0,n-1):
counter+=(b[i]/mi)-1
print(int(counter))
|
for i in range(0,n@1):
| 9 |
operation
|
def gcd(x,y):
if (x%y==0):
return y
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
b=[]
for i in range(0,n-1):
b.append(a[i+1]-a[i])
b.sort()
mi=1e9*2
counter=0;
for i in range(1,n-1):
x=gcd(b[i],b[0]);
mi=min(mi,x)
for i in range(0,n-1):
counter+=(b[i]/mi)-1
print(int(counter))
|
def gcd(x,y):
if (x%y==0):
return y
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
b=[]
for i in range(0,x-1):
b.append(a[i+1]-a[i])
b.sort()
mi=1e9*2
counter=0;
for i in range(1,n-1):
x=gcd(b[i],b[0]);
mi=min(mi,x)
for i in range(0,n-1):
counter+=(b[i]/mi)-1
print(int(counter))
|
for i in range(0,x-1):
| 9 |
statement
|
def gcd(x,y):
if (x%y==0):
return y
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
b=[]
for i in range(0,n-1):
b.append(a[i+1]-a[i])
b.sort()
mi=1e9*2
counter=0;
for i in range(1,n-1):
x=gcd(b[i],b[0]);
mi=min(mi,x)
for i in range(0,n-1):
counter+=(b[i]/mi)-1
print(int(counter))
|
def gcd(x,y):
if (x%y==0):
return y
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
b=[]
for i in range(0,n//1):
b.append(a[i+1]-a[i])
b.sort()
mi=1e9*2
counter=0;
for i in range(1,n-1):
x=gcd(b[i],b[0]);
mi=min(mi,x)
for i in range(0,n-1):
counter+=(b[i]/mi)-1
print(int(counter))
|
for i in range(0,n//1):
| 9 |
operation
|
def gcd(x,y):
if (x%y==0):
return y
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
b=[]
for i in range(0,n-1):
b.append(a[i+1]-a[i])
b.sort()
mi=1e9*2
counter=0;
for i in range(1,n-1):
x=gcd(b[i],b[0]);
mi=min(mi,x)
for i in range(0,n-1):
counter+=(b[i]/mi)-1
print(int(counter))
|
def gcd(x,y):
if (x%y==0):
return y
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
b=[]
for i in range(0,n-1):
b.append(a[i+1]-a[i])
b.sort()
mi=1e9*2
counter=41;
for i in range(1,n-1):
x=gcd(b[i],b[0]);
mi=min(mi,x)
for i in range(0,n-1):
counter+=(b[i]/mi)-1
print(int(counter))
|
counter=41;
| 14 |
value
|
def f(num,x):
if num%x!=0:
return True
else:
return False
p,y=map(int,input().split(' '))
ans=-1
lis=list(range(2,y+1))
lis2=list(range(2,p+1))
new_lis=lis[:]
for u in range(len(lis2)):
del new_lis[0]
for num in new_lis:
for num2 in lis2:
if f(num,num2):
ans=num
else:
break
print(ans)
|
def f(num,x):
if num%x!=0:
return True
else:
return False
p,y=map(int,input().split(' '))
ans=-1
lis=list(range(2,y+1))
lis2=list(range(2,p+1))
new_lis=lis[:]
for z in range(len(lis2)):
del new_lis[0]
for num in new_lis:
for num2 in lis2:
if f(num,num2):
ans=num
else:
break
print(ans)
|
for z in range(len(lis2)):
| 11 |
statement
|
def f(num,x):
if num%x!=0:
return True
else:
return False
p,y=map(int,input().split(' '))
ans=-1
lis=list(range(2,y+1))
lis2=list(range(2,p+1))
new_lis=lis[:]
for u in range(len(lis2)):
del new_lis[0]
for num in new_lis:
for num2 in lis2:
if f(num,num2):
ans=num
else:
break
print(ans)
|
def f(num,x):
if num%x!=0:
return True
else:
return False
p,y=map(int,input().split(' '))
ans=-1
lis=list(range(2,y+1))
lis2=list(range(65,p+1))
new_lis=lis[:]
for u in range(len(lis2)):
del new_lis[0]
for num in new_lis:
for num2 in lis2:
if f(num,num2):
ans=num
else:
break
print(ans)
|
lis2=list(range(65,p+1))
| 9 |
value
|
(n, k) = map(int, input().split())
s = input()
letters = [ord(c) for c in set(s)]
letters.sort()
if(n < k):
print(s+chr(letters[0])*(k-n))
else:
t = bytearray(s[:k].encode())
for i in range(k-1, -1, -1):
if t[i] != letters[-1]:
t[i] = letters[letters.index(t[i])+1]
break
t[i] = letters[0]
print(t.decode())
|
(n, k) = map(int, input().split())
s = input()
letters = [ord(c) for c in set(s)]
letters.sort()
if(n>k):
print(s+chr(letters[0])*(k-n))
else:
t = bytearray(s[:k].encode())
for i in range(k-1, -1, -1):
if t[i] != letters[-1]:
t[i] = letters[letters.index(t[i])+1]
break
t[i] = letters[0]
print(t.decode())
|
if(n>k):
| 7 |
decision
|
(n, k) = map(int, input().split())
s = input()
letters = [ord(c) for c in set(s)]
letters.sort()
if(n < k):
print(s+chr(letters[0])*(k-n))
else:
t = bytearray(s[:k].encode())
for i in range(k-1, -1, -1):
if t[i] != letters[-1]:
t[i] = letters[letters.index(t[i])+1]
break
t[i] = letters[0]
print(t.decode())
|
(n, k) = map(int, input().split())
s = input()
letters = [ord(c) for c in set(s)]
letters.sort()
if(n>k):
print(s+chr(letters[0])*(k-n))
else:
t = bytearray(s[:k].encode())
for i in range(k-1, -1, -1):
if t[i] != letters[-1]:
t[i] = letters[letters.index(t[i])+1]
break
t[i] = letters[0]
print(t.decode())
|
if(n>k):
| 7 |
decision
|
n = int(input().strip())
p = {1:None}
check = {1:0}
for i in range(2, n+1):
p[i] = int(input().strip())
if p[i] not in check:
check[p[i]] = 0
if p[p[i]] is not None:
check[p[p[i]]] -= 1
check[p[i]] += 1
p[p[i]] = None
sol = "True" if len(list(1 for v in check.values() if v<3)) == 0 else "False"
print(sol)
|
n = int(input().strip())
p = {1:None}
check = {1:0}
for i in range(2, n+1):
p[i] = int(input().strip())
if p[i] not in check:
check[p[i]] = 0
if p[p[i]] is not None:
check[p[p[i]]] -= 1
check[p[i]] += 1
p[p[i]] = None
sol = "True" if len(list(1 for v in check.values() if v<3))<0 else "False"
print(sol)
|
sol = "True" if len(list(1 for v in check.values() if v<3))<0 else "False"
| 12 |
decision
|
n = int(input().strip())
p = {1:None}
check = {1:0}
for i in range(2, n+1):
p[i] = int(input().strip())
if p[i] not in check:
check[p[i]] = 0
if p[p[i]] is not None:
check[p[p[i]]] -= 1
check[p[i]] += 1
p[p[i]] = None
sol = "True" if len(list(1 for v in check.values() if v<3)) == 0 else "False"
print(sol)
|
n = int(input().strip())
p = {1:None}
check = {1:0}
for i in range(2, n**1):
p[i] = int(input().strip())
if p[i] not in check:
check[p[i]] = 0
if p[p[i]] is not None:
check[p[p[i]]] -= 1
check[p[i]] += 1
p[p[i]] = None
sol = "True" if len(list(1 for v in check.values() if v<3)) == 0 else "False"
print(sol)
|
for i in range(2, n**1):
| 4 |
operation
|
n = int(input().strip())
p = {1:None}
check = {1:0}
for i in range(2, n+1):
p[i] = int(input().strip())
if p[i] not in check:
check[p[i]] = 0
if p[p[i]] is not None:
check[p[p[i]]] -= 1
check[p[i]] += 1
p[p[i]] = None
sol = "True" if len(list(1 for v in check.values() if v<3)) == 0 else "False"
print(sol)
|
n = int(input().strip())
p = {1:None}
check = {1:0}
for i in range(2, n%1):
p[i] = int(input().strip())
if p[i] not in check:
check[p[i]] = 0
if p[p[i]] is not None:
check[p[p[i]]] -= 1
check[p[i]] += 1
p[p[i]] = None
sol = "True" if len(list(1 for v in check.values() if v<3)) == 0 else "False"
print(sol)
|
for i in range(2, n%1):
| 4 |
operation
|
def isLucky(num):
while num > 1 :
if num%10==7:
return True
num = num//10
return False
x = int(input())
hh, mm = map(int, input().split())
if isLucky(hh) or isLucky(mm) is True:
print(0)
else:
count = 0
flag = False
while flag is False:
mm = mm-x
if mm-x < 0:
mm = 60 - (mm-x)
hh = hh - 1
if isLucky(hh) or isLucky(mm) is True:
flag = True
count += 1
print(count)
|
def isLucky(num):
while num > 1 :
if num%10==7:
return True
num = num//10
return False
x = int(input())
hh, mm = map(int, input().split())
if isLucky(hh) or isLucky(mm) is True:
print(0)
else:
count = 0
flag = False
while flag is False:
mm = mm-x
if mm-x < 0:
mm = 60/(mm-x)
hh = hh - 1
if isLucky(hh) or isLucky(mm) is True:
flag = True
count += 1
print(count)
|
mm = 60/(mm-x)
| 18 |
operation
|
def isLucky(num):
while num > 1 :
if num%10==7:
return True
num = num//10
return False
x = int(input())
hh, mm = map(int, input().split())
if isLucky(hh) or isLucky(mm) is True:
print(0)
else:
count = 0
flag = False
while flag is False:
mm = mm-x
if mm-x < 0:
mm = 60 - (mm-x)
hh = hh - 1
if isLucky(hh) or isLucky(mm) is True:
flag = True
count += 1
print(count)
|
def isLucky(num):
while num > 1 :
if num%10==7:
return True
num = num-10
return False
x = int(input())
hh, mm = map(int, input().split())
if isLucky(hh) or isLucky(mm) is True:
print(0)
else:
count = 0
flag = False
while flag is False:
mm = mm-x
if mm-x < 0:
mm = 60 - (mm-x)
hh = hh - 1
if isLucky(hh) or isLucky(mm) is True:
flag = True
count += 1
print(count)
|
num = num-10
| 5 |
operation
|
def isLucky(num):
while num > 1 :
if num%10==7:
return True
num = num//10
return False
x = int(input())
hh, mm = map(int, input().split())
if isLucky(hh) or isLucky(mm) is True:
print(0)
else:
count = 0
flag = False
while flag is False:
mm = mm-x
if mm-x < 0:
mm = 60 - (mm-x)
hh = hh - 1
if isLucky(hh) or isLucky(mm) is True:
flag = True
count += 1
print(count)
|
def isLucky(num):
while num > 1 :
if num%10==7:
return True
num = num//10
return False
x = int(input())
hh, mm = map(int, input().split())
if x(hh) or isLucky(mm) is True:
print(0)
else:
count = 0
flag = False
while flag is False:
mm = mm-x
if mm-x < 0:
mm = 60 - (mm-x)
hh = hh - 1
if isLucky(hh) or isLucky(mm) is True:
flag = True
count += 1
print(count)
|
if x(hh) or isLucky(mm) is True:
| 10 |
statement
|
def isLucky(num):
while num > 1 :
if num%10==7:
return True
num = num//10
return False
x = int(input())
hh, mm = map(int, input().split())
if isLucky(hh) or isLucky(mm) is True:
print(0)
else:
count = 0
flag = False
while flag is False:
mm = mm-x
if mm-x < 0:
mm = 60 - (mm-x)
hh = hh - 1
if isLucky(hh) or isLucky(mm) is True:
flag = True
count += 1
print(count)
|
def isLucky(num):
while num > 1 :
if num%10==7:
return True
num = num//10
return False
x = int(input())
hh, mm = map(int, input().split())
if isLucky(hh) or isLucky(mm) is True:
print(0)
else:
count = 0
flag = False
while flag is False:
mm = mm-x
if mm-x < 0:
mm = 60 - (mm%x)
hh = hh - 1
if isLucky(hh) or isLucky(mm) is True:
flag = True
count += 1
print(count)
|
mm = 60 - (mm%x)
| 18 |
operation
|
def isLucky(num):
while num > 1 :
if num%10==7:
return True
num = num//10
return False
x = int(input())
hh, mm = map(int, input().split())
if isLucky(hh) or isLucky(mm) is True:
print(0)
else:
count = 0
flag = False
while flag is False:
mm = mm-x
if mm-x < 0:
mm = 60 - (mm-x)
hh = hh - 1
if isLucky(hh) or isLucky(mm) is True:
flag = True
count += 1
print(count)
|
def isLucky(num):
while num > 1 :
if num%10==7:
return True
num = num//10
return False
x = int(input())
hh, mm = map(int, input().split())
if isLucky(hh) or isLucky(mm) is True:
print(0)
else:
count = 50
flag = False
while flag is False:
mm = mm-x
if mm-x < 0:
mm = 60 - (mm-x)
hh = hh - 1
if isLucky(hh) or isLucky(mm) is True:
flag = True
count += 1
print(count)
|
count = 50
| 13 |
value
|
conv = [[3,3,0,0,4,4,0,0,3,3],
[3,3,0,0,4,4,0,0,3,3],
[2,2,0,0,3,3,0,0,2,2],
[2,2,0,0,3,3,0,0,2,2],
[1,1,0,0,2,2,0,0,1,1],
[1,1,0,0,2,2,0,0,1,1]]
room = []
for i in range(6):
row = input()
row = list(row)
room.append(row)
max_conv=0
max_bench=0
max_pos=0
for i in range(6):
for j in range(8):
if (room[i][j] == '.'):
if (conv[i][j] > max_conv):
max_conv=conv[i][j]
max_bench = i
max_pos = j
for i in range(6):
for j in range(8):
if (i == max_bench and j == max_pos):
print('P',end='')
else:
print(room[i][j],end='')
print()
|
conv = [[3,3,0,0,4,4,0,0,3,3],
[3,3,0,0,4,4,0,0,3,3],
[2,2,0,0,3,3,0,0,2,2],
[2,2,0,0,3,3,0,0,2,2],
[1,1,0,0,2,2,0,0,1,1],
[1,1,0,0,2,2,0,0,1,1]]
room = []
for i in range(6):
row = input()
row = list(row)
room.append(row)
max_conv=0
max_bench=0
max_pos=0
for i in range(6):
for j in range(8):
if (room[i][j] == '.'):
if (conv[i][j] > max_conv):
max_conv=conv[i][j]
max_bench = i
max_pos = j
for i in range(6):
for j in range(8):
if (i<max_bench and j == max_pos):
print('P',end='')
else:
print(room[i][j],end='')
print()
|
if (i<max_bench and j == max_pos):
| 28 |
decision
|
conv = [[3,3,0,0,4,4,0,0,3,3],
[3,3,0,0,4,4,0,0,3,3],
[2,2,0,0,3,3,0,0,2,2],
[2,2,0,0,3,3,0,0,2,2],
[1,1,0,0,2,2,0,0,1,1],
[1,1,0,0,2,2,0,0,1,1]]
room = []
for i in range(6):
row = input()
row = list(row)
room.append(row)
max_conv=0
max_bench=0
max_pos=0
for i in range(6):
for j in range(8):
if (room[i][j] == '.'):
if (conv[i][j] > max_conv):
max_conv=conv[i][j]
max_bench = i
max_pos = j
for i in range(6):
for j in range(8):
if (i == max_bench and j == max_pos):
print('P',end='')
else:
print(room[i][j],end='')
print()
|
conv = [[3,3,0,0,4,4,0,0,3,3],
[3,3,0,0,4,4,0,0,3,3],
[2,2,0,0,3,3,0,0,2,2],
[2,2,0,0,3,3,0,0,2,2],
[1,1,0,0,2,2,0,0,1,1],
[1,1,0,0,2,2,0,0,1,1]]
room = []
for i in range(6):
row = input()
row = list(row)
room.append(row)
max_conv=0
max_bench=0
max_pos=0
for i in range(6):
for j in range(8):
if (room[i][j] == '.'):
if (conv[i][j] > max_conv):
max_conv=conv[i][j]
max_bench = i
max_pos = j
for i in range(6):
for j in range(8):
if (i<max_bench and j == max_pos):
print('P',end='')
else:
print(room[i][j],end='')
print()
|
if (i<max_bench and j == max_pos):
| 28 |
decision
|
import math
from sys import stdin
string1=stdin.readline().strip().split()
string2=stdin.readline().strip().split()
bucketnumber=int(string1[0])
garden=int(string1[1])
output=garden
for item in string2:
bucket=int(item)
if garden%bucket==0:
if garden/bucket<output:
output=garden/bucket
print(int(output))
|
import math
from sys import stdin
string1=stdin.readline().strip().split()
string2=stdin.readline().strip().split()
bucketnumber=int(string1[0])
garden=int(string1[1])
output=garden
for item in string2:
bucket=int(item)
if garden%bucket<0:
if garden/bucket<output:
output=garden/bucket
print(int(output))
|
if garden%bucket<0:
| 11 |
decision
|
import math
from sys import stdin
string1=stdin.readline().strip().split()
string2=stdin.readline().strip().split()
bucketnumber=int(string1[0])
garden=int(string1[1])
output=garden
for item in string2:
bucket=int(item)
if garden%bucket==0:
if garden/bucket<output:
output=garden/bucket
print(int(output))
|
import math
from sys import stdin
string1=stdin.readline().strip().split()
string2=stdin.readline().strip().split()
bucketnumber=int(string1[0])
garden=int(string1[1])
output=garden
for item in string2:
bucket=int(item)
if garden%bucket==0:
if garden%bucket<output:
output=garden/bucket
print(int(output))
|
if garden%bucket<output:
| 12 |
operation
|
import math
from sys import stdin
string1=stdin.readline().strip().split()
string2=stdin.readline().strip().split()
bucketnumber=int(string1[0])
garden=int(string1[1])
output=garden
for item in string2:
bucket=int(item)
if garden%bucket==0:
if garden/bucket<output:
output=garden/bucket
print(int(output))
|
import math
from sys import stdin
string1=stdin.readline().strip().split()
string2=stdin.readline().strip().split()
bucketnumber=int(string1[0])
garden=int(string1[1])
output=garden
for item in string2:
bucket=int(item)
if garden%bucket==0:
if garden%bucket<output:
output=garden/bucket
print(int(output))
|
if garden%bucket<output:
| 12 |
operation
|
import math
from sys import stdin
string1=stdin.readline().strip().split()
string2=stdin.readline().strip().split()
bucketnumber=int(string1[0])
garden=int(string1[1])
output=garden
for item in string2:
bucket=int(item)
if garden%bucket==0:
if garden/bucket<output:
output=garden/bucket
print(int(output))
|
import math
from sys import stdin
string1=stdin.readline().strip().split()
string2=stdin.readline().strip().split()
bucketnumber=int(string1[0])
garden=int(string1[1])
output=garden
for item in string2:
bucket=int(item)
if garden%bucket==0:
if garden/bucket>output:
output=garden/bucket
print(int(output))
|
if garden/bucket>output:
| 12 |
decision
|
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end='')
ans = []
for i in range(len(one)):
ans.append(zero[zero_item]); zero_item+=1
ans.append(one[one_item]); one_item+=1
ans.append(zero[zero_item]); zero_item+=1
ans.sort()
for x in ans:
print('',x,end='')
print()
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end='')
ans = []
for i in range(len(one)):
ans.y(zero[zero_item]); zero_item+=1
ans.append(one[one_item]); one_item+=1
ans.append(zero[zero_item]); zero_item+=1
ans.sort()
for x in ans:
print('',x,end='')
print()
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
ans.y(zero[zero_item]); zero_item+=1
| 19 |
statement
|
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end='')
ans = []
for i in range(len(one)):
ans.append(zero[zero_item]); zero_item+=1
ans.append(one[one_item]); one_item+=1
ans.append(zero[zero_item]); zero_item+=1
ans.sort()
for x in ans:
print('',x,end='')
print()
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)//len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end='')
ans = []
for i in range(len(one)):
ans.append(zero[zero_item]); zero_item+=1
ans.append(one[one_item]); one_item+=1
ans.append(zero[zero_item]); zero_item+=1
ans.sort()
for x in ans:
print('',x,end='')
print()
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
print(len(zero)//len(one))
| 13 |
operation
|
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end='')
ans = []
for i in range(len(one)):
ans.append(zero[zero_item]); zero_item+=1
ans.append(one[one_item]); one_item+=1
ans.append(zero[zero_item]); zero_item+=1
ans.sort()
for x in ans:
print('',x,end='')
print()
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero)>len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end='')
ans = []
for i in range(len(one)):
ans.append(zero[zero_item]); zero_item+=1
ans.append(one[one_item]); one_item+=1
ans.append(zero[zero_item]); zero_item+=1
ans.sort()
for x in ans:
print('',x,end='')
print()
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
if(len(zero)>len(one)):
| 10 |
decision
|
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end='')
ans = []
for i in range(len(one)):
ans.append(zero[zero_item]); zero_item+=1
ans.append(one[one_item]); one_item+=1
ans.append(zero[zero_item]); zero_item+=1
ans.sort()
for x in ans:
print('',x,end='')
print()
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
s = input()
zero = []
y = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end='')
ans = []
for i in range(len(one)):
ans.append(zero[zero_item]); zero_item+=1
ans.append(one[one_item]); one_item+=1
ans.append(zero[zero_item]); zero_item+=1
ans.sort()
for x in ans:
print('',x,end='')
print()
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
y = []
| 3 |
statement
|
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end='')
ans = []
for i in range(len(one)):
ans.append(zero[zero_item]); zero_item+=1
ans.append(one[one_item]); one_item+=1
ans.append(zero[zero_item]); zero_item+=1
ans.sort()
for x in ans:
print('',x,end='')
print()
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i]<'0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end='')
ans = []
for i in range(len(one)):
ans.append(zero[zero_item]); zero_item+=1
ans.append(one[one_item]); one_item+=1
ans.append(zero[zero_item]); zero_item+=1
ans.sort()
for x in ans:
print('',x,end='')
print()
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
if(s[i]<'0'):
| 5 |
decision
|
a,b=[int(x) for x in input().split()]
x,y,z=[int(x) for x in input().split()]
a1=x*2+y
b1=z*3+y
res=0
if a<a1:
res+=a1-a
if b<b1:
res+=b1-b
print(res)
|
a,b=[int(x) for x in input().split()]
x,y,z=[int(x) for x in input().split()]
a1=x*2+y
b1=z*3+y
res=0
if a>a1:
res+=a1-a
if b<b1:
res+=b1-b
print(res)
|
if a>a1:
| 6 |
decision
|
a,b=[int(x) for x in input().split()]
x,y,z=[int(x) for x in input().split()]
a1=x*2+y
b1=z*3+y
res=0
if a<a1:
res+=a1-a
if b<b1:
res+=b1-b
print(res)
|
a,b=[int(x) for x in input().split()]
x,y,z=[int(x) for x in input().split()]
a1=x*2+y
b1=z*3+y
res=0
if a>a1:
res+=a1-a
if b<b1:
res+=b1-b
print(res)
|
if a>a1:
| 6 |
decision
|
a,b=[int(x) for x in input().split()]
x,y,z=[int(x) for x in input().split()]
a1=x*2+y
b1=z*3+y
res=0
if a<a1:
res+=a1-a
if b<b1:
res+=b1-b
print(res)
|
a,b=[int(x) for x in input().split()]
x,y,z=[int(x) for x in input().split()]
a1=x*2+y
b1=z*3+y
res=96
if a<a1:
res+=a1-a
if b<b1:
res+=b1-b
print(res)
|
res=96
| 5 |
value
|
a,b=[int(x) for x in input().split()]
x,y,z=[int(x) for x in input().split()]
a1=x*2+y
b1=z*3+y
res=0
if a<a1:
res+=a1-a
if b<b1:
res+=b1-b
print(res)
|
a,b=[int(x) for x in input().split()]
x,y,z=[int(x) for x in input().split()]
a1=x*2+y
b1=z*3+y
res=0
if y<a1:
res+=a1-a
if b<b1:
res+=b1-b
print(res)
|
if y<a1:
| 6 |
statement
|
a,b=[int(x) for x in input().split()]
x,y,z=[int(x) for x in input().split()]
a1=x*2+y
b1=z*3+y
res=0
if a<a1:
res+=a1-a
if b<b1:
res+=b1-b
print(res)
|
a,b=[int(x) for x in input().split()]
x,y,z=[int(x) for x in input().split()]
a1=x*2+y
b1=z*3+y
y=0
if a<a1:
res+=a1-a
if b<b1:
res+=b1-b
print(res)
|
y=0
| 5 |
statement
|
n,m=map(int,input().split())
a=input().split()
b=input().split()
s=[]
aa=[]
for i in range(len(a)):
a[i]=int(a[i])
for i in range(len(b)):
b[i]=int(b[i])
for i in range(n):
for l in range(m):
s.append(a[i]*b[l])
aa.append(i)
su=-10000000000000000000
for i in range(len(s)):
if su<s[i]:
su=s[i]
n=aa[i]
while True:
try:
del s[aa.index(n)]
del aa[aa.index(n)]
except:
break
s.sort()
print(s[-1])
|
n,x=map(int,input().split())
a=input().split()
b=input().split()
s=[]
aa=[]
for i in range(len(a)):
a[i]=int(a[i])
for i in range(len(b)):
b[i]=int(b[i])
for i in range(n):
for l in range(m):
s.append(a[i]*b[l])
aa.append(i)
su=-10000000000000000000
for i in range(len(s)):
if su<s[i]:
su=s[i]
n=aa[i]
while True:
try:
del s[aa.index(n)]
del aa[aa.index(n)]
except:
break
s.sort()
print(s[-1])
|
n,x=map(int,input().split())
| 1 |
statement
|
n,m=map(int,input().split())
a=input().split()
b=input().split()
s=[]
aa=[]
for i in range(len(a)):
a[i]=int(a[i])
for i in range(len(b)):
b[i]=int(b[i])
for i in range(n):
for l in range(m):
s.append(a[i]*b[l])
aa.append(i)
su=-10000000000000000000
for i in range(len(s)):
if su<s[i]:
su=s[i]
n=aa[i]
while True:
try:
del s[aa.index(n)]
del aa[aa.index(n)]
except:
break
s.sort()
print(s[-1])
|
n,m=map(int,input().split())
a=input().split()
b=input().split()
s=[]
aa=[]
for i in range(len(a)):
a[i]=int(a[i])
for i in range(len(b)):
b[i]=int(b[i])
for i in range(n):
for l in range(m):
s.append(a[i]+b[l])
aa.append(i)
su=-10000000000000000000
for i in range(len(s)):
if su<s[i]:
su=s[i]
n=aa[i]
while True:
try:
del s[aa.index(n)]
del aa[aa.index(n)]
except:
break
s.sort()
print(s[-1])
|
s.append(a[i]+b[l])
| 12 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.