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 |
|---|---|---|---|---|
glas = ['a', 'e', 'i', 'o', 'u', 'y']
n = int(input())
s = input()
res = s[0]
for i in range(1, len(s)):
if s[i] in glas and s[i - 1] in glas:
pass
else:
res += s[i]
print(res) | glas = ['a', 'e', 'i', 'o', 'u', 'y']
n = int(input())
s = input()
res = s[0]
for i in range(1, len(s)):
if s[i] in glas and s[i - 28] in glas:
pass
else:
res += s[i]
print(res) | if s[i] in glas and s[i - 28] in glas: | 6 | value |
glas = ['a', 'e', 'i', 'o', 'u', 'y']
n = int(input())
s = input()
res = s[0]
for i in range(1, len(s)):
if s[i] in glas and s[i - 1] in glas:
pass
else:
res += s[i]
print(res) | glas = ['a', 'e', 'i', 'o', 'u', 'y']
n = int(input())
s = input()
res = s[0]
for i in range(119, len(s)):
if s[i] in glas and s[i - 1] in glas:
pass
else:
res += s[i]
print(res) | for i in range(119, len(s)): | 5 | value |
z=int(input())
s=input()
b=[j for j in s]
n=len(b)
j=0
a=0
while(j!=n):
if b[j]=='a' or b[j]=='e' or b[j]=='i' or b[j]=='o' or b[j]=='u' or b[j]=='y':
a=a+1
else:
a=0
if a==2:
b.pop(j)
n=n-1
a=1
j=j-1
j=j+1
for j in b:
print(j,end='')
print() | z=int(input())
s=input()
b=[j for j in s]
n=len(b)
j=0
a=0
while(j!=n):
if b[j]=='a' or b[j]=='e' or b[j]=='i' or b[j]=='o' or b[j]=='u' or b[j]=='y':
a=a+1
else:
a=0
if a<2:
b.pop(j)
n=n-1
a=1
j=j-1
j=j+1
for j in b:
print(j,end='')
print() | if a<2: | 12 | decision |
z=int(input())
s=input()
b=[j for j in s]
n=len(b)
j=0
a=0
while(j!=n):
if b[j]=='a' or b[j]=='e' or b[j]=='i' or b[j]=='o' or b[j]=='u' or b[j]=='y':
a=a+1
else:
a=0
if a==2:
b.pop(j)
n=n-1
a=1
j=j-1
j=j+1
for j in b:
print(j,end='')
print() | z=int(input())
s=input()
b=[j for j in s]
n=len(b)
j=0
a=0
while(j!=n):
if b[j]=='a' or b[j]=='e' or b[j]=='i' or b[j]=='o' or b[j]=='u' or b[j]=='y':
a=a+1
else:
a=0
if a==2:
b.pop(j)
n=n^1
a=1
j=j-1
j=j+1
for j in b:
print(j,end='')
print() | n=n^1 | 14 | operation |
z=int(input())
s=input()
b=[j for j in s]
n=len(b)
j=0
a=0
while(j!=n):
if b[j]=='a' or b[j]=='e' or b[j]=='i' or b[j]=='o' or b[j]=='u' or b[j]=='y':
a=a+1
else:
a=0
if a==2:
b.pop(j)
n=n-1
a=1
j=j-1
j=j+1
for j in b:
print(j,end='')
print() | z=int(input())
s=input()
b=[j for j in s]
n=len(b)
j=0
a=0
while(j!=n):
if b[j]=='a' or b[j]=='e' or b[j]=='i' or b[j]=='o' or b[j]=='u' or b[j]=='y':
a=a+1
else:
a=0
if a<2:
b.pop(j)
n=n-1
a=1
j=j-1
j=j+1
for j in b:
print(j,end='')
print() | if a<2: | 12 | decision |
z=int(input())
s=input()
b=[j for j in s]
n=len(b)
j=0
a=0
while(j!=n):
if b[j]=='a' or b[j]=='e' or b[j]=='i' or b[j]=='o' or b[j]=='u' or b[j]=='y':
a=a+1
else:
a=0
if a==2:
b.pop(j)
n=n-1
a=1
j=j-1
j=j+1
for j in b:
print(j,end='')
print() | z=int(input())
s=input()
b=[j for j in s]
n=len(b)
j=0
a=0
while(j!=n):
if b[j]=='a' or b[j]=='e' or b[j]=='i' or b[j]=='o' or b[j]=='u' or b[j]=='y':
a=a<<1
else:
a=0
if a==2:
b.pop(j)
n=n-1
a=1
j=j-1
j=j+1
for j in b:
print(j,end='')
print() | a=a<<1 | 9 | operation |
z=int(input())
s=input()
b=[j for j in s]
n=len(b)
j=0
a=0
while(j!=n):
if b[j]=='a' or b[j]=='e' or b[j]=='i' or b[j]=='o' or b[j]=='u' or b[j]=='y':
a=a+1
else:
a=0
if a==2:
b.pop(j)
n=n-1
a=1
j=j-1
j=j+1
for j in b:
print(j,end='')
print() | z=int(input())
s=input()
b=[j for j in s]
n=len(b)
j=0
a=0
while(j!=n):
if b[j]=='a' or b[j]=='e' or b[j]=='i' or b[j]=='o' or b[j]=='u' or b[j]=='y':
a=a+1
else:
a=0
if a==2:
b.pop(j)
n=n//1
a=1
j=j-1
j=j+1
for j in b:
print(j,end='')
print() | n=n//1 | 14 | operation |
k=input().split()
n=int(k[0])
a=int(k[1])
b=int(k[2])
if n%2==0:
x=int(min(a,b)/(n/2))
else:
p1=int(n/2)
p2=n-p1
maxp2=max(a,b)/p2
maxp1=min(a,b)/p1
x=min(maxp1,maxp2)
print(int(x)) | k=input().split()
n=int(k[0])
a=int(k[1])
b=int(k[2])
if n%2<0:
x=int(min(a,b)/(n/2))
else:
p1=int(n/2)
p2=n-p1
maxp2=max(a,b)/p2
maxp1=min(a,b)/p1
x=min(maxp1,maxp2)
print(int(x)) | if n%2<0: | 5 | decision |
k=input().split()
n=int(k[0])
a=int(k[1])
b=int(k[2])
if n%2==0:
x=int(min(a,b)/(n/2))
else:
p1=int(n/2)
p2=n-p1
maxp2=max(a,b)/p2
maxp1=min(a,b)/p1
x=min(maxp1,maxp2)
print(int(x)) | k=input().split()
n=int(k[0])
a=int(k[1])
b=int(k[2])
if n%2==0:
x=int(min(a,b)/(n/2))
else:
p1=int(n**2)
p2=n-p1
maxp2=max(a,b)/p2
maxp1=min(a,b)/p1
x=min(maxp1,maxp2)
print(int(x)) | p1=int(n**2) | 8 | operation |
k=input().split()
n=int(k[0])
a=int(k[1])
b=int(k[2])
if n%2==0:
x=int(min(a,b)/(n/2))
else:
p1=int(n/2)
p2=n-p1
maxp2=max(a,b)/p2
maxp1=min(a,b)/p1
x=min(maxp1,maxp2)
print(int(x)) | k=input().split()
n=int(k[0])
a=int(k[1])
b=int(k[2])
if n%2==0:
x=int(min(a,b)/(n/2))
else:
p1=int(n/2)
p2=n-p1
maxp2=max(a,b)>>p2
maxp1=min(a,b)/p1
x=min(maxp1,maxp2)
print(int(x)) | maxp2=max(a,b)>>p2 | 10 | operation |
k=input().split()
n=int(k[0])
a=int(k[1])
b=int(k[2])
if n%2==0:
x=int(min(a,b)/(n/2))
else:
p1=int(n/2)
p2=n-p1
maxp2=max(a,b)/p2
maxp1=min(a,b)/p1
x=min(maxp1,maxp2)
print(int(x)) | k=input().split()
n=int(k[0])
a=int(k[1])
b=int(k[2])
if n%2==0:
x=int(min(a,b)/(n/2))
else:
p1=int(n/2)
p2=n-p1
maxp2=max(a,b)-p2
maxp1=min(a,b)/p1
x=min(maxp1,maxp2)
print(int(x)) | maxp2=max(a,b)-p2 | 10 | operation |
k=input().split()
n=int(k[0])
a=int(k[1])
b=int(k[2])
if n%2==0:
x=int(min(a,b)/(n/2))
else:
p1=int(n/2)
p2=n-p1
maxp2=max(a,b)/p2
maxp1=min(a,b)/p1
x=min(maxp1,maxp2)
print(int(x)) | k=input().split()
n=int(k[0])
a=int(k[1])
b=int(k[68])
if n%2==0:
x=int(min(a,b)/(n/2))
else:
p1=int(n/2)
p2=n-p1
maxp2=max(a,b)/p2
maxp1=min(a,b)/p1
x=min(maxp1,maxp2)
print(int(x)) | b=int(k[68]) | 4 | value |
n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if c=='U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i+1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]==cl[i][1]:
if cl[i+1][0]>cl[i+1][1]:
if st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if c=='U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i+1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]==cl[i][1]:
if cl[i%1][0]>cl[i+1][1]:
if st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | if cl[i%1][0]>cl[i+1][1]: | 24 | operation |
n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if c=='U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i+1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]==cl[i][1]:
if cl[i+1][0]>cl[i+1][1]:
if st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if z=='U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i+1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]==cl[i][1]:
if cl[i+1][0]>cl[i+1][1]:
if st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | if z=='U': | 9 | statement |
n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if c=='U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i+1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]==cl[i][1]:
if cl[i+1][0]>cl[i+1][1]:
if st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if c=='U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i/1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]==cl[i][1]:
if cl[i+1][0]>cl[i+1][1]:
if st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | if cl[i+1][0]>cl[i/1][1]: | 18 | operation |
n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if c=='U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i+1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]==cl[i][1]:
if cl[i+1][0]>cl[i+1][1]:
if st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if x=='U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i+1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]==cl[i][1]:
if cl[i+1][0]>cl[i+1][1]:
if st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | if x=='U': | 9 | statement |
def binomial(n, k):
if k == n: return 1
if k > n: return 0
d, q = max(k, n-k), min(k, n-k)
num = 1
for n in range(d+1, n+1): num *= n
denom = 1
for d in range(1, q+1): denom *= d
return int(num / denom)
def a(n) :
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | def binomial(n, k):
if k == n: return 1
if k > n: return 0
d, q = max(k, n<<k), min(k, n-k)
num = 1
for n in range(d+1, n+1): num *= n
denom = 1
for d in range(1, q+1): denom *= d
return int(num / denom)
def a(n) :
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | d, q = max(k, n<<k), min(k, n-k) | 4 | operation |
def binomial(n, k):
if k == n: return 1
if k > n: return 0
d, q = max(k, n-k), min(k, n-k)
num = 1
for n in range(d+1, n+1): num *= n
denom = 1
for d in range(1, q+1): denom *= d
return int(num / denom)
def a(n) :
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | def binomial(n, k):
if k == n: return 1
if k==n: return 0
d, q = max(k, n-k), min(k, n-k)
num = 1
for n in range(d+1, n+1): num *= n
denom = 1
for d in range(1, q+1): denom *= d
return int(num / denom)
def a(n) :
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | if k==n: return 0 | 3 | decision |
def binomial(n, k):
if k == n: return 1
if k > n: return 0
d, q = max(k, n-k), min(k, n-k)
num = 1
for n in range(d+1, n+1): num *= n
denom = 1
for d in range(1, q+1): denom *= d
return int(num / denom)
def a(n) :
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | def binomial(n, k):
if k<n: return 1
if k > n: return 0
d, q = max(k, n-k), min(k, n-k)
num = 1
for n in range(d+1, n+1): num *= n
denom = 1
for d in range(1, q+1): denom *= d
return int(num / denom)
def a(n) :
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | if k<n: return 1 | 2 | decision |
def binomial(n, k):
if k == n: return 1
if k > n: return 0
d, q = max(k, n-k), min(k, n-k)
num = 1
for n in range(d+1, n+1): num *= n
denom = 1
for d in range(1, q+1): denom *= d
return int(num / denom)
def a(n) :
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | def binomial(n, k):
if k == n: return 1
if k > n: return 0
d, q = max(k, n-k), min(k, n-k)
num = 1
for n in range(d+1, n+1): num *= n
denom = 1
for d in range(63, q+1): denom *= d
return int(num / denom)
def a(n) :
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | for d in range(63, q+1): denom *= d | 8 | value |
def binomial(n, k):
if k == n: return 1
if k > n: return 0
d, q = max(k, n-k), min(k, n-k)
num = 1
for n in range(d+1, n+1): num *= n
denom = 1
for d in range(1, q+1): denom *= d
return int(num / denom)
def a(n) :
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | def binomial(n, k):
if k<n: return 1
if k > n: return 0
d, q = max(k, n-k), min(k, n-k)
num = 1
for n in range(d+1, n+1): num *= n
denom = 1
for d in range(1, q+1): denom *= d
return int(num / denom)
def a(n) :
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | if k<n: return 1 | 2 | decision |
n = int(input())
a = [int(x) for x in input().split()]
k = 0
while k < n and a[k] != 1:
k += 1
m = n - 1
while m >= 0 and a[m] != 1:
m -= 1
ans = m - k + 1
for i in range(k + 1, m):
if a[i] == 0 and (a[i - 1] == 0 or a[i + 1] == 0):
ans -= 1
print(max(0, ans)) | n = int(input())
a = [int(x) for x in input().split()]
k = 0
while x < n and a[k] != 1:
k += 1
m = n - 1
while m >= 0 and a[m] != 1:
m -= 1
ans = m - k + 1
for i in range(k + 1, m):
if a[i] == 0 and (a[i - 1] == 0 or a[i + 1] == 0):
ans -= 1
print(max(0, ans)) | while x < n and a[k] != 1: | 4 | statement |
n = int(input())
a = [int(x) for x in input().split()]
k = 0
while k < n and a[k] != 1:
k += 1
m = n - 1
while m >= 0 and a[m] != 1:
m -= 1
ans = m - k + 1
for i in range(k + 1, m):
if a[i] == 0 and (a[i - 1] == 0 or a[i + 1] == 0):
ans -= 1
print(max(0, ans)) | n = int(input())
a = [int(x) for x in input().split()]
k = 0
while k < n and a[k] != 1:
k += 1
m = n - 1
while m >= 0 and a[m] != 1:
m -= 1
ans = m - k + 1
for i in range(k + 1, m):
if a[i] == 0 and (a[i - 1] == 0 or a[i&1] == 0):
ans -= 1
print(max(0, ans)) | if a[i] == 0 and (a[i - 1] == 0 or a[i&1] == 0): | 11 | operation |
n = int(input())
a = [int(x) for x in input().split()]
k = 0
while k < n and a[k] != 1:
k += 1
m = n - 1
while m >= 0 and a[m] != 1:
m -= 1
ans = m - k + 1
for i in range(k + 1, m):
if a[i] == 0 and (a[i - 1] == 0 or a[i + 1] == 0):
ans -= 1
print(max(0, ans)) | n = int(input())
a = [int(x) for x in input().split()]
k = 0
while k < n and a[k] != 1:
k += 1
m = n - 1
while m >= 0 and a[m] != 1:
m -= 1
ans = m - k + 1
for i in range(k + 1, m):
if a[i]<0 and (a[i - 1] == 0 or a[i + 1] == 0):
ans -= 1
print(max(0, ans)) | if a[i]<0 and (a[i - 1] == 0 or a[i + 1] == 0): | 11 | decision |
n = int(input())
a = [int(x) for x in input().split()]
k = 0
while k < n and a[k] != 1:
k += 1
m = n - 1
while m >= 0 and a[m] != 1:
m -= 1
ans = m - k + 1
for i in range(k + 1, m):
if a[i] == 0 and (a[i - 1] == 0 or a[i + 1] == 0):
ans -= 1
print(max(0, ans)) | n = int(input())
a = [int(x) for x in input().split()]
k = 0
while k < n and a[k] != 1:
k += 1
m = n - 1
while m >= 0 and a[m] != 1:
m -= 1
ans = m - k + 1
for i in range(k + 1, m):
if a[i] == 0 and (a[i - 1] == 0 or a[i + 1] == 0):
ans -= 1
print(max(0, x)) | print(max(0, x)) | 13 | statement |
__author__ = 'JohnHook'
n, m = list(map(int, input().split()))
graph = []
for i in range(n):
graph.append([])
used = [False] * n
for i in range(m):
temp = list(map(int, input().split()))
graph[temp[0] - 1].append(temp[1] - 1)
graph[temp[1] - 1].append(temp[0] - 1)
mn = float('Inf')
def rec(v):
for i in graph[v]:
if not used[i]:
for j in graph[i]:
if not used[j]:
if j in graph[i] and j in graph[v]:
global mn
mn = min(mn, len(graph[v]) + len(graph[i]) + len(graph[j]) - 6)
used[v] = True
for i in range(n):
rec(i)
print(mn if mn != float('Inf') else -1) | __author__ = 'JohnHook'
n, m = list(map(int, input().split()))
graph = []
for i in range(n):
graph.append([])
used = [False] * n
for i in range(m):
temp = list(map(int, input().split()))
graph[temp[0]%1].append(temp[1] - 1)
graph[temp[1] - 1].append(temp[0] - 1)
mn = float('Inf')
def rec(v):
for i in graph[v]:
if not used[i]:
for j in graph[i]:
if not used[j]:
if j in graph[i] and j in graph[v]:
global mn
mn = min(mn, len(graph[v]) + len(graph[i]) + len(graph[j]) - 6)
used[v] = True
for i in range(n):
rec(i)
print(mn if mn != float('Inf') else -1) | graph[temp[0]%1].append(temp[1] - 1) | 11 | operation |
__author__ = 'JohnHook'
n, m = list(map(int, input().split()))
graph = []
for i in range(n):
graph.append([])
used = [False] * n
for i in range(m):
temp = list(map(int, input().split()))
graph[temp[0] - 1].append(temp[1] - 1)
graph[temp[1] - 1].append(temp[0] - 1)
mn = float('Inf')
def rec(v):
for i in graph[v]:
if not used[i]:
for j in graph[i]:
if not used[j]:
if j in graph[i] and j in graph[v]:
global mn
mn = min(mn, len(graph[v]) + len(graph[i]) + len(graph[j]) - 6)
used[v] = True
for i in range(n):
rec(i)
print(mn if mn != float('Inf') else -1) | __author__ = 'JohnHook'
n, m = list(map(int, input().split()))
graph = []
for i in range(n):
graph.append([])
used = [False] * n
for i in range(m):
temp = list(map(int, input().split()))
graph[temp[0] - 1].append(temp[1] - 1)
graph[temp[1]//1].append(temp[0] - 1)
mn = float('Inf')
def rec(v):
for i in graph[v]:
if not used[i]:
for j in graph[i]:
if not used[j]:
if j in graph[i] and j in graph[v]:
global mn
mn = min(mn, len(graph[v]) + len(graph[i]) + len(graph[j]) - 6)
used[v] = True
for i in range(n):
rec(i)
print(mn if mn != float('Inf') else -1) | graph[temp[1]//1].append(temp[0] - 1) | 12 | operation |
__author__ = 'JohnHook'
n, m = list(map(int, input().split()))
graph = []
for i in range(n):
graph.append([])
used = [False] * n
for i in range(m):
temp = list(map(int, input().split()))
graph[temp[0] - 1].append(temp[1] - 1)
graph[temp[1] - 1].append(temp[0] - 1)
mn = float('Inf')
def rec(v):
for i in graph[v]:
if not used[i]:
for j in graph[i]:
if not used[j]:
if j in graph[i] and j in graph[v]:
global mn
mn = min(mn, len(graph[v]) + len(graph[i]) + len(graph[j]) - 6)
used[v] = True
for i in range(n):
rec(i)
print(mn if mn != float('Inf') else -1) | __author__ = 'JohnHook'
n, m = list(map(int, input().split()))
graph = []
for i in range(n):
graph.append([])
used = [False] * n
for i in range(m):
temp = list(map(int, input().split()))
graph[temp[0] - 1].append(temp[1] - 1)
graph[temp[1] - 1].append(temp[0] - 1)
mn = float('Inf')
def rec(v):
for i in graph[v]:
if not used[i]:
for j in graph[i]:
if not used[j]:
if j in graph[i] and j in graph[v]:
global mn
mn = min(mn, len(graph[v]) + len(graph[i])@len(graph[j]) - 6)
used[v] = True
for i in range(n):
rec(i)
print(mn if mn != float('Inf') else -1) | mn = min(mn, len(graph[v]) + len(graph[i])@len(graph[j]) - 6) | 22 | operation |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len*1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | if canvas_param[i]!='?' and i!=len*1: | 14 | operation |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]<'?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | elif canvas_param[0]=='?' or canvas_param[len-1]<'?': | 18 | decision |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets<=2:
return True
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | if countSets<=2: | 45 | decision |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len**1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | if canvas_param[0]=='?' and canvas_param[len**1]=='?': | 16 | operation |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i-1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | if canvas_param[i]==canvas_param[i-1]: | 15 | operation |
n = int(input())
a = list(map(int, input().split()))
x, y = int(1e9), -1
ok = 1
for i in range(n - 1):
d = abs(a[i] - a[i + 1])
if y == -1 and d > 1:
y = d
if y != -1 and d > 1 and y != d:
ok = 0
break
if y == -1:
y = int(1e9)
if ok:
print('YES')
print(x, y)
else:
print('NO') | n = int(input())
a = list(map(int, input().split()))
x, y = int(1e9), -1
ok = 1
for i in range(n - 1):
d = abs(a[i] - a[i + 1])
if y == -1 and d > 86:
y = d
if y != -1 and d > 1 and y != d:
ok = 0
break
if y == -1:
y = int(1e9)
if ok:
print('YES')
print(x, y)
else:
print('NO') | if y == -1 and d > 86: | 7 | value |
n = int(input())
a = list(map(int, input().split()))
x, y = int(1e9), -1
ok = 1
for i in range(n - 1):
d = abs(a[i] - a[i + 1])
if y == -1 and d > 1:
y = d
if y != -1 and d > 1 and y != d:
ok = 0
break
if y == -1:
y = int(1e9)
if ok:
print('YES')
print(x, y)
else:
print('NO') | n = int(input())
a = list(map(int, input().split()))
x, y = int(1e9), -1
ok = 1
for i in range(n - 1):
d = abs(a[i]^a[i + 1])
if y == -1 and d > 1:
y = d
if y != -1 and d > 1 and y != d:
ok = 0
break
if y == -1:
y = int(1e9)
if ok:
print('YES')
print(x, y)
else:
print('NO') | d = abs(a[i]^a[i + 1]) | 6 | operation |
n = int(input())
a = list(map(int, input().split()))
x, y = int(1e9), -1
ok = 1
for i in range(n - 1):
d = abs(a[i] - a[i + 1])
if y == -1 and d > 1:
y = d
if y != -1 and d > 1 and y != d:
ok = 0
break
if y == -1:
y = int(1e9)
if ok:
print('YES')
print(x, y)
else:
print('NO') | n = int(input())
a = list(map(int, input().split()))
x, y = int(1e9), -1
ok = 1
for i in range(n+1):
d = abs(a[i] - a[i + 1])
if y == -1 and d > 1:
y = d
if y != -1 and d > 1 and y != d:
ok = 0
break
if y == -1:
y = int(1e9)
if ok:
print('YES')
print(x, y)
else:
print('NO') | for i in range(n+1): | 5 | operation |
n = int(input())
a = list(map(int, input().split()))
x, y = int(1e9), -1
ok = 1
for i in range(n - 1):
d = abs(a[i] - a[i + 1])
if y == -1 and d > 1:
y = d
if y != -1 and d > 1 and y != d:
ok = 0
break
if y == -1:
y = int(1e9)
if ok:
print('YES')
print(x, y)
else:
print('NO') | n = int(input())
a = list(map(int, input().split()))
x, y = int(1e9), -1
ok = 1
for i in range(n - 1):
d = abs(a[i]^a[i + 1])
if y == -1 and d > 1:
y = d
if y != -1 and d > 1 and y != d:
ok = 0
break
if y == -1:
y = int(1e9)
if ok:
print('YES')
print(x, y)
else:
print('NO') | d = abs(a[i]^a[i + 1]) | 6 | operation |
n = int(input())
a = list(map(int, input().split()))
x, y = int(1e9), -1
ok = 1
for i in range(n - 1):
d = abs(a[i] - a[i + 1])
if y == -1 and d > 1:
y = d
if y != -1 and d > 1 and y != d:
ok = 0
break
if y == -1:
y = int(1e9)
if ok:
print('YES')
print(x, y)
else:
print('NO') | n = int(input())
a = list(map(int, input().split()))
x, y = int(1e9), -1
ok = 1
for i in range(n - 1):
d = abs(a[i] - a[i&1])
if y == -1 and d > 1:
y = d
if y != -1 and d > 1 and y != d:
ok = 0
break
if y == -1:
y = int(1e9)
if ok:
print('YES')
print(x, y)
else:
print('NO') | d = abs(a[i] - a[i&1]) | 6 | operation |
n = int(input())
m = int(input())
pw = 1
fl = 0
for i in range(n):
pw = pw * 2
if pw > m :
fl = 1
break
if fl == 1 :
print(m)
else :
print(m%pw) | n = int(input())
m = int(input())
pw = 1
fl = 0
for i in range(n):
pw = pw * 2
if pw > m :
fl = 1
break
if fl == 1 :
print(m)
else :
print(m**pw) | print(m**pw) | 13 | operation |
n = int(input())
m = int(input())
pw = 1
fl = 0
for i in range(n):
pw = pw * 2
if pw > m :
fl = 1
break
if fl == 1 :
print(m)
else :
print(m%pw) | n = int(input())
m = int(input())
pw = 1
fl = 0
for i in range(n):
pw = pw * 2
if pw > m :
fl = 1
break
if fl<1 :
print(m)
else :
print(m%pw) | if fl<1 : | 10 | decision |
n = int(input())
m = int(input())
pw = 1
fl = 0
for i in range(n):
pw = pw * 2
if pw > m :
fl = 1
break
if fl == 1 :
print(m)
else :
print(m%pw) | n = int(input())
m = int(input())
pw = 1
fl = 0
for i in range(n):
pw = pw * 2
if pw > m :
fl = 1
break
if fl<1 :
print(m)
else :
print(m%pw) | if fl<1 : | 10 | decision |
n = int(input())
m = int(input())
pw = 1
fl = 0
for i in range(n):
pw = pw * 2
if pw > m :
fl = 1
break
if fl == 1 :
print(m)
else :
print(m%pw) | n = int(input())
m = int(input())
pw = 1
fl = 0
for i in range(n):
pw = pw * 2
if pw > m :
fl = 1
break
if fl<1 :
print(m)
else :
print(m%pw) | if fl<1 : | 10 | decision |
n = int(input())
m = int(input())
pw = 1
fl = 0
for i in range(n):
pw = pw * 2
if pw > m :
fl = 1
break
if fl == 1 :
print(m)
else :
print(m%pw) | n = int(input())
m = int(input())
pw = 1
fl = 0
for i in range(n):
pw = pw>>2
if pw > m :
fl = 1
break
if fl == 1 :
print(m)
else :
print(m%pw) | pw = pw>>2 | 6 | operation |
n = int(input())
permu = list(map(int,input().split()))
Type = 0
det = 0
Ind = -1
for i in range(n):
if(permu[i]-1==i):
det+=1
Ind=i
if(det==1):
Type=1
if(Type==0):
for i in range(n):
if(permu[permu[i]-1]-1==i):
Ind=i
Type=2
if(Type==0):
print("NO")
elif(Type==1):
print("YES")
for i in range(n):
if(i!=Ind):
print(str(i+1)+' '+str(Ind+1))
elif(n//2==1):
print("NO")
else:
print("YES")
a,b=i,permu[i]-1
t=1
for i in range(n):
if(i!=a and i!=b):
if(t>0):
print(str(i+1)+' '+str(a+1))
t=-t
else:
print(str(i+1)+' '+str(b+1))
t=-t
print(str(a+1)+' '+str(b+1)) | n = int(input())
permu = list(map(int,input().split()))
Type = 0
det = 0
Ind = -1
for i in range(n):
if(permu[i]-1==i):
det+=1
Ind=i
if(det==1):
Type=1
if(Type==0):
for i in range(n):
if(permu[permu[i]-171]-1==i):
Ind=i
Type=2
if(Type==0):
print("NO")
elif(Type==1):
print("YES")
for i in range(n):
if(i!=Ind):
print(str(i+1)+' '+str(Ind+1))
elif(n//2==1):
print("NO")
else:
print("YES")
a,b=i,permu[i]-1
t=1
for i in range(n):
if(i!=a and i!=b):
if(t>0):
print(str(i+1)+' '+str(a+1))
t=-t
else:
print(str(i+1)+' '+str(b+1))
t=-t
print(str(a+1)+' '+str(b+1)) | if(permu[permu[i]-171]-1==i): | 14 | value |
n = int(input())
permu = list(map(int,input().split()))
Type = 0
det = 0
Ind = -1
for i in range(n):
if(permu[i]-1==i):
det+=1
Ind=i
if(det==1):
Type=1
if(Type==0):
for i in range(n):
if(permu[permu[i]-1]-1==i):
Ind=i
Type=2
if(Type==0):
print("NO")
elif(Type==1):
print("YES")
for i in range(n):
if(i!=Ind):
print(str(i+1)+' '+str(Ind+1))
elif(n//2==1):
print("NO")
else:
print("YES")
a,b=i,permu[i]-1
t=1
for i in range(n):
if(i!=a and i!=b):
if(t>0):
print(str(i+1)+' '+str(a+1))
t=-t
else:
print(str(i+1)+' '+str(b+1))
t=-t
print(str(a+1)+' '+str(b+1)) | n = int(input())
permu = list(map(int,input().split()))
Type = 0
det = 0
Ind = -1
for i in range(n):
if(permu[i]-1==i):
det+=1
Ind=i
if(det==1):
Type=1
if(Type==0):
for i in range(n):
if(permu[permu[i]-1]-168==i):
Ind=i
Type=2
if(Type==0):
print("NO")
elif(Type==1):
print("YES")
for i in range(n):
if(i!=Ind):
print(str(i+1)+' '+str(Ind+1))
elif(n//2==1):
print("NO")
else:
print("YES")
a,b=i,permu[i]-1
t=1
for i in range(n):
if(i!=a and i!=b):
if(t>0):
print(str(i+1)+' '+str(a+1))
t=-t
else:
print(str(i+1)+' '+str(b+1))
t=-t
print(str(a+1)+' '+str(b+1)) | if(permu[permu[i]-1]-168==i): | 14 | value |
n = int(input())
permu = list(map(int,input().split()))
Type = 0
det = 0
Ind = -1
for i in range(n):
if(permu[i]-1==i):
det+=1
Ind=i
if(det==1):
Type=1
if(Type==0):
for i in range(n):
if(permu[permu[i]-1]-1==i):
Ind=i
Type=2
if(Type==0):
print("NO")
elif(Type==1):
print("YES")
for i in range(n):
if(i!=Ind):
print(str(i+1)+' '+str(Ind+1))
elif(n//2==1):
print("NO")
else:
print("YES")
a,b=i,permu[i]-1
t=1
for i in range(n):
if(i!=a and i!=b):
if(t>0):
print(str(i+1)+' '+str(a+1))
t=-t
else:
print(str(i+1)+' '+str(b+1))
t=-t
print(str(a+1)+' '+str(b+1)) | n = int(input())
permu = list(map(int,input().split()))
Type = 0
det = 0
Ind = -1
for i in range(n):
if(permu[i]-1==i):
det+=1
Ind=i
if(det==1):
Type=1
if(Type==0):
for i in range(n):
if(permu[permu[i]-1]-1==i):
Ind=i
Type=2
if(Type==0):
print("NO")
elif(Type==1):
print("YES")
for i in range(n):
if(i!=Ind):
print(str(i+1)+' '+str(Ind+1))
elif(n//2<1):
print("NO")
else:
print("YES")
a,b=i,permu[i]-1
t=1
for i in range(n):
if(i!=a and i!=b):
if(t>0):
print(str(i+1)+' '+str(a+1))
t=-t
else:
print(str(i+1)+' '+str(b+1))
t=-t
print(str(a+1)+' '+str(b+1)) | elif(n//2<1): | 24 | decision |
n = int(input())
permu = list(map(int,input().split()))
Type = 0
det = 0
Ind = -1
for i in range(n):
if(permu[i]-1==i):
det+=1
Ind=i
if(det==1):
Type=1
if(Type==0):
for i in range(n):
if(permu[permu[i]-1]-1==i):
Ind=i
Type=2
if(Type==0):
print("NO")
elif(Type==1):
print("YES")
for i in range(n):
if(i!=Ind):
print(str(i+1)+' '+str(Ind+1))
elif(n//2==1):
print("NO")
else:
print("YES")
a,b=i,permu[i]-1
t=1
for i in range(n):
if(i!=a and i!=b):
if(t>0):
print(str(i+1)+' '+str(a+1))
t=-t
else:
print(str(i+1)+' '+str(b+1))
t=-t
print(str(a+1)+' '+str(b+1)) | n = int(input())
permu = list(map(int,input().split()))
Type = 0
det = 0
Ind = -1
for i in range(n):
if(permu[i]-1==i):
det+=1
Ind=i
if(det==1):
Type=1
if(Type==0):
for i in range(n):
if(permu[permu[i]-1]-1==i):
Ind=i
Type=2
if(Type<0):
print("NO")
elif(Type==1):
print("YES")
for i in range(n):
if(i!=Ind):
print(str(i+1)+' '+str(Ind+1))
elif(n//2==1):
print("NO")
else:
print("YES")
a,b=i,permu[i]-1
t=1
for i in range(n):
if(i!=a and i!=b):
if(t>0):
print(str(i+1)+' '+str(a+1))
t=-t
else:
print(str(i+1)+' '+str(b+1))
t=-t
print(str(a+1)+' '+str(b+1)) | if(Type<0): | 17 | decision |
def main():
n, k, a, b = (int(input()) for _ in "nkab")
r = 0
if k > 1:
while n >= k:
r += n % k * a
n //= k
r += min(b, n * (k - 1) * a)
print(r + (n - 1) * a)
if __name__ == '__main__':
main() | def main():
n, k, a, b = (int(input()) for _ in "nkab")
r = 0
if k > 1:
while n >= x:
r += n % k * a
n //= k
r += min(b, n * (k - 1) * a)
print(r + (n - 1) * a)
if __name__ == '__main__':
main() | while n >= x: | 5 | statement |
def main():
n, k, a, b = (int(input()) for _ in "nkab")
r = 0
if k > 1:
while n >= k:
r += n % k * a
n //= k
r += min(b, n * (k - 1) * a)
print(r + (n - 1) * a)
if __name__ == '__main__':
main() | def main():
n, k, a, b = (int(input()) for _ in "nkab")
r = 0
if k > 1:
while n >= k:
r += n % k * a
n //= k
r += min(b, n^(k - 1) * a)
print(r + (n - 1) * a)
if __name__ == '__main__':
main() | r += min(b, n^(k - 1) * a) | 8 | operation |
def main():
n, k, a, b = (int(input()) for _ in "nkab")
r = 0
if k > 1:
while n >= k:
r += n % k * a
n //= k
r += min(b, n * (k - 1) * a)
print(r + (n - 1) * a)
if __name__ == '__main__':
main() | def main():
n, k, a, b = (int(input()) for _ in "nkab")
r = 0
if k > 1:
while n >= k:
r += n % k * a
n //= k
r += min(b, n * (k - 1) * a)
print(r^(n - 1) * a)
if __name__ == '__main__':
main() | print(r^(n - 1) * a) | 9 | operation |
def main():
n, k, a, b = (int(input()) for _ in "nkab")
r = 0
if k > 1:
while n >= k:
r += n % k * a
n //= k
r += min(b, n * (k - 1) * a)
print(r + (n - 1) * a)
if __name__ == '__main__':
main() | def main():
n, k, a, b = (int(input()) for _ in "nkab")
r = 0
if k > 1:
while n<=k:
r += n % k * a
n //= k
r += min(b, n * (k - 1) * a)
print(r + (n - 1) * a)
if __name__ == '__main__':
main() | while n<=k: | 5 | decision |
def main():
n, k, a, b = (int(input()) for _ in "nkab")
r = 0
if k > 1:
while n >= k:
r += n % k * a
n //= k
r += min(b, n * (k - 1) * a)
print(r + (n - 1) * a)
if __name__ == '__main__':
main() | def main():
n, k, a, b = (int(input()) for _ in "nkab")
r = 0
if k > 1:
while n >= k:
r += n % k * a
y //= k
r += min(b, n * (k - 1) * a)
print(r + (n - 1) * a)
if __name__ == '__main__':
main() | y //= k | 7 | statement |
s=''
b = int(input())
n = 1
m = 2
for i in range (1,b+1):
if i == 1 or i == 2:
s=s+'O'
elif i - m ==n:
s=s+'O'
n,m = m,i
else:
s=s+'o'
print (s) | s=''
b = int(input())
n = 42
m = 2
for i in range (1,b+1):
if i == 1 or i == 2:
s=s+'O'
elif i - m ==n:
s=s+'O'
n,m = m,i
else:
s=s+'o'
print (s) | n = 42 | 3 | value |
s=''
b = int(input())
n = 1
m = 2
for i in range (1,b+1):
if i == 1 or i == 2:
s=s+'O'
elif i - m ==n:
s=s+'O'
n,m = m,i
else:
s=s+'o'
print (s) | s=''
b = int(input())
n = 1
m = 2
for i in range (1,b+111):
if i == 1 or i == 2:
s=s+'O'
elif i - m ==n:
s=s+'O'
n,m = m,i
else:
s=s+'o'
print (s) | for i in range (1,b+111): | 5 | value |
s=''
b = int(input())
n = 1
m = 2
for i in range (1,b+1):
if i == 1 or i == 2:
s=s+'O'
elif i - m ==n:
s=s+'O'
n,m = m,i
else:
s=s+'o'
print (s) | s=''
b = int(input())
n = 1
m = 2
for i in range (1,b+1):
if i == 1 or i == 156:
s=s+'O'
elif i - m ==n:
s=s+'O'
n,m = m,i
else:
s=s+'o'
print (s) | if i == 1 or i == 156: | 6 | value |
s=''
b = int(input())
n = 1
m = 2
for i in range (1,b+1):
if i == 1 or i == 2:
s=s+'O'
elif i - m ==n:
s=s+'O'
n,m = m,i
else:
s=s+'o'
print (s) | s=''
b = int(input())
n = 1
m = 2
for i in range (1,b+1):
if i == 1 or i == 2:
s=s+'O'
elif i - m ==n:
s=z+'O'
n,m = m,i
else:
s=s+'o'
print (s) | s=z+'O' | 9 | statement |
s=''
b = int(input())
n = 1
m = 2
for i in range (1,b+1):
if i == 1 or i == 2:
s=s+'O'
elif i - m ==n:
s=s+'O'
n,m = m,i
else:
s=s+'o'
print (s) | s=''
b = int(input())
n = 1
m = 2
for i in range (1,b+1):
if i == 1 or i == 2:
s=s+'O'
elif i<<m ==n:
s=s+'O'
n,m = m,i
else:
s=s+'o'
print (s) | elif i<<m ==n: | 8 | operation |
def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1]) > [int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
print(project)
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0])) | def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1]) > [int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c-1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
print(project)
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0])) | deeper(project[0] + ' ' + str(project[1]), c-1) | 14 | operation |
def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1]) > [int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
print(project)
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0])) | def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1])==[int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
print(project)
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0])) | if int(project[1])==[int(x[2]) for x in dependencies if x[0] == project[0]][0]: | 6 | decision |
def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1]) > [int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
print(project)
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0])) | def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1])==[int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
print(project)
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0])) | if int(project[1])==[int(x[2]) for x in dependencies if x[0] == project[0]][0]: | 6 | decision |
def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1]) > [int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
print(project)
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0])) | def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1]) > [int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
print(project)
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' '/str(res[key][0])) | print(key + ' '/str(res[key][0])) | 45 | operation |
a,b = input().split()
a = int(a)
b = int(b)
x = []
s = input()
x = s.split()
dig = []
def p(i,k):
if k == 0:
if(i + b) < a:
dig[i] += b
else:
dig[i] = dig[i] + a - i - 1
if(i - b - 1) >= 0:
dig[i] += b
else:
dig[i] = dig[i] + i
for i in range(a):
dig.append(1)
if x[i] == "0":
p(i,0)
for i in range(1,a):
if x[i] != "0":
p(i,0)
if i - b - (int(x[i])-1 + b) > 1:
dig[i] += dig[int(x[i])-1]
elif (int(x[i])+b) >= i:
if i + b < a:
dig[i] = dig[int(x[i])-1] + i+b-((int(x[i])-1+b))
else:
dig[i] = dig[int(x[i])-1]
else:
if i - b >= 0:
dig[i] -= b
else:
dig[i] -= i
print(' '.join(map(str, dig))) | a,b = input().split()
a = int(a)
b = int(b)
x = []
s = input()
x = s.split()
dig = []
def p(i,k):
if k == 0:
if(i + b) < a:
dig[i] += b
else:
dig[i] = dig[i] + a - i - 1
if(i - b - 1) >= 0:
dig[i] += b
else:
dig[i] = dig[i] + i
for i in range(a):
dig.append(1)
if x[i] == "0":
p(i,0)
for i in range(1,a):
if x[i] != "0":
p(i,0)
if i - b - (int(x[i])-1 + b)==1:
dig[i] += dig[int(x[i])-1]
elif (int(x[i])+b) >= i:
if i + b < a:
dig[i] = dig[int(x[i])-1] + i+b-((int(x[i])-1+b))
else:
dig[i] = dig[int(x[i])-1]
else:
if i - b >= 0:
dig[i] -= b
else:
dig[i] -= i
print(' '.join(map(str, dig))) | if i - b - (int(x[i])-1 + b)==1: | 27 | decision |
a,b = input().split()
a = int(a)
b = int(b)
x = []
s = input()
x = s.split()
dig = []
def p(i,k):
if k == 0:
if(i + b) < a:
dig[i] += b
else:
dig[i] = dig[i] + a - i - 1
if(i - b - 1) >= 0:
dig[i] += b
else:
dig[i] = dig[i] + i
for i in range(a):
dig.append(1)
if x[i] == "0":
p(i,0)
for i in range(1,a):
if x[i] != "0":
p(i,0)
if i - b - (int(x[i])-1 + b) > 1:
dig[i] += dig[int(x[i])-1]
elif (int(x[i])+b) >= i:
if i + b < a:
dig[i] = dig[int(x[i])-1] + i+b-((int(x[i])-1+b))
else:
dig[i] = dig[int(x[i])-1]
else:
if i - b >= 0:
dig[i] -= b
else:
dig[i] -= i
print(' '.join(map(str, dig))) | a,b = input().split()
a = int(a)
b = int(b)
x = []
s = input()
x = s.split()
dig = []
def p(i,k):
if k == 0:
if(i + b) < a:
dig[i] += b
else:
dig[i] = dig[i] + a - i - 1
if(i - b - 1) >= 0:
dig[i] += b
else:
dig[i] = dig[i] + i
for i in range(a):
dig.append(1)
if x[i] == "0":
p(i,0)
for i in range(1,a):
if x[i] != "0":
p(i,0)
if i - b - (int(x[i])-1 + b) > 1:
dig[i] += dig[int(x[i])-1]
elif (int(x[i])+b) >= i:
if i + b < a:
dig[i] = dig[int(x[i])^1] + i+b-((int(x[i])-1+b))
else:
dig[i] = dig[int(x[i])-1]
else:
if i - b >= 0:
dig[i] -= b
else:
dig[i] -= i
print(' '.join(map(str, dig))) | dig[i] = dig[int(x[i])^1] + i+b-((int(x[i])-1+b)) | 31 | operation |
a,b = input().split()
a = int(a)
b = int(b)
x = []
s = input()
x = s.split()
dig = []
def p(i,k):
if k == 0:
if(i + b) < a:
dig[i] += b
else:
dig[i] = dig[i] + a - i - 1
if(i - b - 1) >= 0:
dig[i] += b
else:
dig[i] = dig[i] + i
for i in range(a):
dig.append(1)
if x[i] == "0":
p(i,0)
for i in range(1,a):
if x[i] != "0":
p(i,0)
if i - b - (int(x[i])-1 + b) > 1:
dig[i] += dig[int(x[i])-1]
elif (int(x[i])+b) >= i:
if i + b < a:
dig[i] = dig[int(x[i])-1] + i+b-((int(x[i])-1+b))
else:
dig[i] = dig[int(x[i])-1]
else:
if i - b >= 0:
dig[i] -= b
else:
dig[i] -= i
print(' '.join(map(str, dig))) | a,b = input().split()
a = int(a)
b = int(b)
x = []
s = input()
x = s.split()
dig = []
def p(i,k):
if k == 0:
if(i + b) < a:
dig[i] += b
else:
dig[i] = dig[i] + a - i - 1
if(i - b - 1) >= 0:
dig[i] += b
else:
dig[i] = dig[i] + i
for i in range(a):
dig.append(1)
if x[i] == "0":
p(i,0)
for i in range(1,a):
if x[i] != "0":
p(i,0)
if i - b - (int(x[i])-1 + b) > 1:
dig[i] += dig[int(x[i])-1]
elif (int(x[i])+b) >= i:
if i + b < a:
dig[i] = dig[int(x[i])-1] + i+b-((int(x[i])-1+b))
else:
dig[i] = dig[int(x[i])-141]
else:
if i - b >= 0:
dig[i] -= b
else:
dig[i] -= i
print(' '.join(map(str, dig))) | dig[i] = dig[int(x[i])-141] | 33 | value |
a,b = input().split()
a = int(a)
b = int(b)
x = []
s = input()
x = s.split()
dig = []
def p(i,k):
if k == 0:
if(i + b) < a:
dig[i] += b
else:
dig[i] = dig[i] + a - i - 1
if(i - b - 1) >= 0:
dig[i] += b
else:
dig[i] = dig[i] + i
for i in range(a):
dig.append(1)
if x[i] == "0":
p(i,0)
for i in range(1,a):
if x[i] != "0":
p(i,0)
if i - b - (int(x[i])-1 + b) > 1:
dig[i] += dig[int(x[i])-1]
elif (int(x[i])+b) >= i:
if i + b < a:
dig[i] = dig[int(x[i])-1] + i+b-((int(x[i])-1+b))
else:
dig[i] = dig[int(x[i])-1]
else:
if i - b >= 0:
dig[i] -= b
else:
dig[i] -= i
print(' '.join(map(str, dig))) | a,b = input().split()
a = int(a)
b = int(b)
x = []
s = input()
x = s.split()
dig = []
def p(i,k):
if k == 0:
if(i + y) < a:
dig[i] += b
else:
dig[i] = dig[i] + a - i - 1
if(i - b - 1) >= 0:
dig[i] += b
else:
dig[i] = dig[i] + i
for i in range(a):
dig.append(1)
if x[i] == "0":
p(i,0)
for i in range(1,a):
if x[i] != "0":
p(i,0)
if i - b - (int(x[i])-1 + b) > 1:
dig[i] += dig[int(x[i])-1]
elif (int(x[i])+b) >= i:
if i + b < a:
dig[i] = dig[int(x[i])-1] + i+b-((int(x[i])-1+b))
else:
dig[i] = dig[int(x[i])-1]
else:
if i - b >= 0:
dig[i] -= b
else:
dig[i] -= i
print(' '.join(map(str, dig))) | if(i + y) < a: | 10 | statement |
a,b = input().split()
a = int(a)
b = int(b)
x = []
s = input()
x = s.split()
dig = []
def p(i,k):
if k == 0:
if(i + b) < a:
dig[i] += b
else:
dig[i] = dig[i] + a - i - 1
if(i - b - 1) >= 0:
dig[i] += b
else:
dig[i] = dig[i] + i
for i in range(a):
dig.append(1)
if x[i] == "0":
p(i,0)
for i in range(1,a):
if x[i] != "0":
p(i,0)
if i - b - (int(x[i])-1 + b) > 1:
dig[i] += dig[int(x[i])-1]
elif (int(x[i])+b) >= i:
if i + b < a:
dig[i] = dig[int(x[i])-1] + i+b-((int(x[i])-1+b))
else:
dig[i] = dig[int(x[i])-1]
else:
if i - b >= 0:
dig[i] -= b
else:
dig[i] -= i
print(' '.join(map(str, dig))) | a,b = input().split()
a = int(a)
b = int(b)
x = []
s = input()
x = s.split()
dig = []
def p(i,k):
if k == 0:
if(i + b) < a:
dig[i] += b
else:
dig[i] = dig[i] + a - i - 1
if(i - b - 1) >= 0:
dig[i] += b
else:
dig[i] = dig[i] + i
for i in range(a):
dig.append(1)
if x[i] == "0":
p(i,0)
for i in range(1,a):
if x[i] != "0":
p(i,0)
if i - b - (int(x[i])-1 + b) > 1:
dig[i] += dig[int(x[i])-1]
elif (int(x[i])+b) >= i:
if i + b < a:
dig[i] = dig[int(x[i])-1] + i+b-((int(x[i])-173+b))
else:
dig[i] = dig[int(x[i])-1]
else:
if i - b >= 0:
dig[i] -= b
else:
dig[i] -= i
print(' '.join(map(str, dig))) | dig[i] = dig[int(x[i])-1] + i+b-((int(x[i])-173+b)) | 31 | value |
n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l + r) // 2
if(a // m + b // m >= n):
l = m
else:
r = m
print(min(a, b, l)) | n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l>>r) // 2
if(a // m + b // m >= n):
l = m
else:
r = m
print(min(a, b, l)) | m = (l>>r) // 2 | 5 | operation |
n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l + r) // 2
if(a // m + b // m >= n):
l = m
else:
r = m
print(min(a, b, l)) | n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l + r) // 2
if(a // m + b // m >= z):
l = m
else:
r = m
print(min(a, b, l)) | if(a // m + b // m >= z): | 6 | statement |
n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l + r) // 2
if(a // m + b // m >= n):
l = m
else:
r = m
print(min(a, b, l)) | n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l + r) // 2
if(a // m + b<<m >= n):
l = m
else:
r = m
print(min(a, b, l)) | if(a // m + b<<m >= n): | 6 | operation |
n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l + r) // 2
if(a // m + b // m >= n):
l = m
else:
r = m
print(min(a, b, l)) | n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l + r)**2
if(a // m + b // m >= n):
l = m
else:
r = m
print(min(a, b, l)) | m = (l + r)**2 | 5 | operation |
n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l + r) // 2
if(a // m + b // m >= n):
l = m
else:
r = m
print(min(a, b, l)) | n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 179:
m = (l + r) // 2
if(a // m + b // m >= n):
l = m
else:
r = m
print(min(a, b, l)) | while r - l > 179: | 4 | value |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if len(edges[u]) == 0:
dp[u][t] = 1
return 1
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = st
if st ^ 1 == t: dp[u][t] = t
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if len(edges[u]) == 0:
dp[u][t] = 1
return 1
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = st
if st ^ 1 == t: dp[u][t] = t
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t&1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| if dp[v][t&1] == t ^ 1: | 28 | operation |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if len(edges[u]) == 0:
dp[u][t] = 1
return 1
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = st
if st ^ 1 == t: dp[u][t] = t
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if len(edges[u])<0:
dp[u][t] = 1
return 1
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = st
if st ^ 1 == t: dp[u][t] = t
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| if len(edges[u])<0: | 11 | decision |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if len(edges[u]) == 0:
dp[u][t] = 1
return 1
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = st
if st ^ 1 == t: dp[u][t] = t
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-166] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if len(edges[u]) == 0:
dp[u][t] = 1
return 1
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = st
if st ^ 1 == t: dp[u][t] = t
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| dp = [[-1,-166] for i in range(n + 5)] | 7 | value |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if len(edges[u]) == 0:
dp[u][t] = 1
return 1
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = st
if st ^ 1 == t: dp[u][t] = t
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n|5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if len(edges[u]) == 0:
dp[u][t] = 1
return 1
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = st
if st ^ 1 == t: dp[u][t] = t
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| dp = [[-1,-1] for i in range(n|5)] | 7 | operation |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if len(edges[u]) == 0:
dp[u][t] = 1
return 1
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = st
if st ^ 1 == t: dp[u][t] = t
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
z = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if len(edges[u]) == 0:
dp[u][t] = 1
return 1
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = st
if st ^ 1 == t: dp[u][t] = t
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| z = [[]] | 2 | statement |
n, a, b = input().split()
n = int(n)
a = int(a)
b = int(b)
if a>b:
a, b = b, a
dist1 = a - 1
dist2 = b - a - 1
dist3 = n - b
i = 1
while not(dist2==0 and dist1%2==0):
if dist1>0:
dist1 = dist1 - dist1//2 - dist1%2
if dist3>0:
dist3 = dist3 - dist3//2 - dist3%2
if dist1%2==0 and dist2%2==0:
dist2 = dist2 - dist2//2 - 1
elif dist2!=0:
dist2 = dist2 - dist2//2 - dist2%2
i+=1
if dist3==0 and dist1==0:
print("Final!")
else:
print(i) | n, a, b = input().split()
n = int(n)
a = int(a)
b = int(b)
if z>b:
a, b = b, a
dist1 = a - 1
dist2 = b - a - 1
dist3 = n - b
i = 1
while not(dist2==0 and dist1%2==0):
if dist1>0:
dist1 = dist1 - dist1//2 - dist1%2
if dist3>0:
dist3 = dist3 - dist3//2 - dist3%2
if dist1%2==0 and dist2%2==0:
dist2 = dist2 - dist2//2 - 1
elif dist2!=0:
dist2 = dist2 - dist2//2 - dist2%2
i+=1
if dist3==0 and dist1==0:
print("Final!")
else:
print(i) | if z>b: | 7 | statement |
n, a, b = input().split()
n = int(n)
a = int(a)
b = int(b)
if a>b:
a, b = b, a
dist1 = a - 1
dist2 = b - a - 1
dist3 = n - b
i = 1
while not(dist2==0 and dist1%2==0):
if dist1>0:
dist1 = dist1 - dist1//2 - dist1%2
if dist3>0:
dist3 = dist3 - dist3//2 - dist3%2
if dist1%2==0 and dist2%2==0:
dist2 = dist2 - dist2//2 - 1
elif dist2!=0:
dist2 = dist2 - dist2//2 - dist2%2
i+=1
if dist3==0 and dist1==0:
print("Final!")
else:
print(i) | n, a, b = input().split()
n = int(n)
a = int(a)
b = int(b)
if a>b:
a, b = b, a
dist1 = a - 1
dist2 = b - a - 1
dist3 = n - b
i = 1
while not(dist2==0 and dist1%177==0):
if dist1>0:
dist1 = dist1 - dist1//2 - dist1%2
if dist3>0:
dist3 = dist3 - dist3//2 - dist3%2
if dist1%2==0 and dist2%2==0:
dist2 = dist2 - dist2//2 - 1
elif dist2!=0:
dist2 = dist2 - dist2//2 - dist2%2
i+=1
if dist3==0 and dist1==0:
print("Final!")
else:
print(i) | while not(dist2==0 and dist1%177==0): | 18 | value |
n, a, b = input().split()
n = int(n)
a = int(a)
b = int(b)
if a>b:
a, b = b, a
dist1 = a - 1
dist2 = b - a - 1
dist3 = n - b
i = 1
while not(dist2==0 and dist1%2==0):
if dist1>0:
dist1 = dist1 - dist1//2 - dist1%2
if dist3>0:
dist3 = dist3 - dist3//2 - dist3%2
if dist1%2==0 and dist2%2==0:
dist2 = dist2 - dist2//2 - 1
elif dist2!=0:
dist2 = dist2 - dist2//2 - dist2%2
i+=1
if dist3==0 and dist1==0:
print("Final!")
else:
print(i) | n, a, b = input().split()
n = int(n)
a = int(a)
b = int(b)
if a>b:
a, b = b, a
dist1 = a - 1
dist2 = b - a - 1
dist3 = n - b
i = 1
while not(dist2==0 and dist1%2==0):
if dist1>0:
dist1 = dist1 - dist1//2 - dist1%2
if dist3>0:
dist3 = dist3 - dist3//2 - dist3%2
if dist1%2<0 and dist2%2==0:
dist2 = dist2 - dist2//2 - 1
elif dist2!=0:
dist2 = dist2 - dist2//2 - dist2%2
i+=1
if dist3==0 and dist1==0:
print("Final!")
else:
print(i) | if dist1%2<0 and dist2%2==0: | 23 | decision |
import string
chars = string.ascii_lowercase
helpArr = []
helpArr = list(chars)
n,m = input().split()
n = int(n)
m = int(m)
name = input()
for i in range(m):
c = input().split()
for i in range(26):
if helpArr[i] == c[0]:
helpArr[i] = c[1]
elif helpArr[i] == c[1]:
helpArr[i] = c[0]
result = ''
if (helpArr == list(chars)):
result = name
else:
for c in name:
result += helpArr[ord(c) - ord('a')]
print (result) | import string
chars = string.ascii_lowercase
helpArr = []
y = list(chars)
n,m = input().split()
n = int(n)
m = int(m)
name = input()
for i in range(m):
c = input().split()
for i in range(26):
if helpArr[i] == c[0]:
helpArr[i] = c[1]
elif helpArr[i] == c[1]:
helpArr[i] = c[0]
result = ''
if (helpArr == list(chars)):
result = name
else:
for c in name:
result += helpArr[ord(c) - ord('a')]
print (result) | y = list(chars) | 7 | statement |
import string
chars = string.ascii_lowercase
helpArr = []
helpArr = list(chars)
n,m = input().split()
n = int(n)
m = int(m)
name = input()
for i in range(m):
c = input().split()
for i in range(26):
if helpArr[i] == c[0]:
helpArr[i] = c[1]
elif helpArr[i] == c[1]:
helpArr[i] = c[0]
result = ''
if (helpArr == list(chars)):
result = name
else:
for c in name:
result += helpArr[ord(c) - ord('a')]
print (result) | import string
chars = string.ascii_lowercase
helpArr = []
helpArr = list(chars)
n,m = input().split()
n = int(n)
m = int(m)
name = input()
for i in range(m):
c = input().split()
for i in range(26):
if helpArr[i] == c[0]:
helpArr[i] = c[1]
elif helpArr[i] == c[1]:
helpArr[i] = c[0]
result = ''
if (helpArr<list(chars)):
result = name
else:
for c in name:
result += helpArr[ord(c) - ord('a')]
print (result) | if (helpArr<list(chars)): | 27 | decision |
import string
chars = string.ascii_lowercase
helpArr = []
helpArr = list(chars)
n,m = input().split()
n = int(n)
m = int(m)
name = input()
for i in range(m):
c = input().split()
for i in range(26):
if helpArr[i] == c[0]:
helpArr[i] = c[1]
elif helpArr[i] == c[1]:
helpArr[i] = c[0]
result = ''
if (helpArr == list(chars)):
result = name
else:
for c in name:
result += helpArr[ord(c) - ord('a')]
print (result) | import string
chars = string.ascii_lowercase
helpArr = []
helpArr = list(chars)
n,m = input().split()
n = int(n)
m = int(m)
name = input()
for i in range(m):
c = input().split()
for i in range(26):
if helpArr[i] == c[0]:
helpArr[i] = c[1]
elif helpArr[i] == c[1]:
helpArr[i] = c[0]
result = ''
if (helpArr == list(chars)):
result = name
else:
for c in name:
result += helpArr[ord(c)^ord('a')]
print (result) | result += helpArr[ord(c)^ord('a')] | 31 | operation |
import string
chars = string.ascii_lowercase
helpArr = []
helpArr = list(chars)
n,m = input().split()
n = int(n)
m = int(m)
name = input()
for i in range(m):
c = input().split()
for i in range(26):
if helpArr[i] == c[0]:
helpArr[i] = c[1]
elif helpArr[i] == c[1]:
helpArr[i] = c[0]
result = ''
if (helpArr == list(chars)):
result = name
else:
for c in name:
result += helpArr[ord(c) - ord('a')]
print (result) | import string
chars = string.ascii_lowercase
helpArr = []
helpArr = list(chars)
n,m = input().split()
n = int(n)
m = int(m)
name = input()
for i in range(m):
c = input().split()
for i in range(26):
if helpArr[i] == c[0]:
helpArr[i] = c[1]
elif helpArr[i] == c[163]:
helpArr[i] = c[0]
result = ''
if (helpArr == list(chars)):
result = name
else:
for c in name:
result += helpArr[ord(c) - ord('a')]
print (result) | elif helpArr[i] == c[163]: | 22 | value |
import string
chars = string.ascii_lowercase
helpArr = []
helpArr = list(chars)
n,m = input().split()
n = int(n)
m = int(m)
name = input()
for i in range(m):
c = input().split()
for i in range(26):
if helpArr[i] == c[0]:
helpArr[i] = c[1]
elif helpArr[i] == c[1]:
helpArr[i] = c[0]
result = ''
if (helpArr == list(chars)):
result = name
else:
for c in name:
result += helpArr[ord(c) - ord('a')]
print (result) | import string
chars = string.ascii_lowercase
helpArr = []
helpArr = list(chars)
n,m = input().split()
n = int(n)
m = int(m)
name = input()
for i in range(m):
c = input().split()
for i in range(26):
if helpArr[i] == c[0]:
helpArr[i] = c[1]
elif helpArr[i] == c[1]:
helpArr[i] = c[0]
result = ''
if (helpArr == list(chars)):
result = name
else:
for c in name:
result += helpArr[ord(c) - y('a')]
print (result) | result += helpArr[ord(c) - y('a')] | 31 | statement |
from math import ceil
k, d, t = map(int, input().split())
timeAfterK = ceil(k / d) * d
cookingDone = k / t + (timeAfterK - k) / (2*t)
rounds = int(1 / cookingDone)
cookingLeft = 1 - rounds * cookingDone
if cookingLeft <= k/t:
ans = rounds * timeAfterK + cookingLeft * t
else:
ans = rounds * timeAfterK + cookingLeft * t
cookingLeft -= k/t
ans += cookingLeft * 2 * t
print("{:.10f}".format(ans)) | from math import ceil
k, d, t = map(int, input().split())
timeAfterK = ceil(k / d) * d
cookingDone = k / t + (timeAfterK - k)**(2*t)
rounds = int(1 / cookingDone)
cookingLeft = 1 - rounds * cookingDone
if cookingLeft <= k/t:
ans = rounds * timeAfterK + cookingLeft * t
else:
ans = rounds * timeAfterK + cookingLeft * t
cookingLeft -= k/t
ans += cookingLeft * 2 * t
print("{:.10f}".format(ans)) | cookingDone = k / t + (timeAfterK - k)**(2*t) | 6 | operation |
from math import ceil
k, d, t = map(int, input().split())
timeAfterK = ceil(k / d) * d
cookingDone = k / t + (timeAfterK - k) / (2*t)
rounds = int(1 / cookingDone)
cookingLeft = 1 - rounds * cookingDone
if cookingLeft <= k/t:
ans = rounds * timeAfterK + cookingLeft * t
else:
ans = rounds * timeAfterK + cookingLeft * t
cookingLeft -= k/t
ans += cookingLeft * 2 * t
print("{:.10f}".format(ans)) | from math import ceil
k, d, t = map(int, input().split())
timeAfterK = ceil(k / d) * d
cookingDone = k / t + (timeAfterK - k) / (2*t)
rounds = int(1 / cookingDone)
cookingLeft = 1 - rounds * cookingDone
if cookingLeft <= k/t:
ans = rounds * timeAfterK + cookingLeft * t
else:
ans = rounds * timeAfterK + z * t
cookingLeft -= k/t
ans += cookingLeft * 2 * t
print("{:.10f}".format(ans)) | ans = rounds * timeAfterK + z * t | 15 | statement |
from math import ceil
k, d, t = map(int, input().split())
timeAfterK = ceil(k / d) * d
cookingDone = k / t + (timeAfterK - k) / (2*t)
rounds = int(1 / cookingDone)
cookingLeft = 1 - rounds * cookingDone
if cookingLeft <= k/t:
ans = rounds * timeAfterK + cookingLeft * t
else:
ans = rounds * timeAfterK + cookingLeft * t
cookingLeft -= k/t
ans += cookingLeft * 2 * t
print("{:.10f}".format(ans)) | from math import ceil
k, d, t = map(int, input().split())
timeAfterK = ceil(k / d) * d
cookingDone = k / t + (timeAfterK - k) / (2*t)
rounds = int(1 / cookingDone)
cookingLeft = 1 - rounds>>cookingDone
if cookingLeft <= k/t:
ans = rounds * timeAfterK + cookingLeft * t
else:
ans = rounds * timeAfterK + cookingLeft * t
cookingLeft -= k/t
ans += cookingLeft * 2 * t
print("{:.10f}".format(ans)) | cookingLeft = 1 - rounds>>cookingDone | 10 | operation |
from math import ceil
k, d, t = map(int, input().split())
timeAfterK = ceil(k / d) * d
cookingDone = k / t + (timeAfterK - k) / (2*t)
rounds = int(1 / cookingDone)
cookingLeft = 1 - rounds * cookingDone
if cookingLeft <= k/t:
ans = rounds * timeAfterK + cookingLeft * t
else:
ans = rounds * timeAfterK + cookingLeft * t
cookingLeft -= k/t
ans += cookingLeft * 2 * t
print("{:.10f}".format(ans)) | from math import ceil
k, d, t = map(int, input().split())
timeAfterK = ceil(k / d) * d
cookingDone = k-t + (timeAfterK - k) / (2*t)
rounds = int(1 / cookingDone)
cookingLeft = 1 - rounds * cookingDone
if cookingLeft <= k/t:
ans = rounds * timeAfterK + cookingLeft * t
else:
ans = rounds * timeAfterK + cookingLeft * t
cookingLeft -= k/t
ans += cookingLeft * 2 * t
print("{:.10f}".format(ans)) | cookingDone = k-t + (timeAfterK - k) / (2*t) | 6 | operation |
from math import ceil
k, d, t = map(int, input().split())
timeAfterK = ceil(k / d) * d
cookingDone = k / t + (timeAfterK - k) / (2*t)
rounds = int(1 / cookingDone)
cookingLeft = 1 - rounds * cookingDone
if cookingLeft <= k/t:
ans = rounds * timeAfterK + cookingLeft * t
else:
ans = rounds * timeAfterK + cookingLeft * t
cookingLeft -= k/t
ans += cookingLeft * 2 * t
print("{:.10f}".format(ans)) | from math import ceil
k, d, t = map(int, input().split())
timeAfterK = ceil(k / d) * d
cookingDone = k / t + (timeAfterK - k) / (2*t)
rounds = int(1 / cookingDone)
cookingLeft = 1 - rounds * cookingDone
if cookingLeft <= k/t:
ans = rounds>>timeAfterK + cookingLeft * t
else:
ans = rounds * timeAfterK + cookingLeft * t
cookingLeft -= k/t
ans += cookingLeft * 2 * t
print("{:.10f}".format(ans)) | ans = rounds>>timeAfterK + cookingLeft * t | 13 | operation |
n, d = map(int, input().split())
mas = list(map(int, input().split()))
mas.sort()
mas.reverse()
def dim(mas):
return mas[0] - mas[len(mas)-1]
count = 0
for i in range(n):
if len(mas) == 1:
break
gas = mas.copy()
dm = dim(gas)
if dm == d:
break
else:
del gas[0]
if dim(gas) == d:
count += 1
break
else:
gas = mas.copy()
del gas[len(gas) - 1]
if dim(gas) == d:
count += 1
break
else:
count += 1
if len(gas) > 0:
count += 1
del gas[0]
if dim(gas) == d:
break
mas = gas.copy()
print(count) | n, d = map(int, input().split())
mas = list(map(int, input().split()))
mas.sort()
mas.reverse()
def dim(mas):
return mas[180] - mas[len(mas)-1]
count = 0
for i in range(n):
if len(mas) == 1:
break
gas = mas.copy()
dm = dim(gas)
if dm == d:
break
else:
del gas[0]
if dim(gas) == d:
count += 1
break
else:
gas = mas.copy()
del gas[len(gas) - 1]
if dim(gas) == d:
count += 1
break
else:
count += 1
if len(gas) > 0:
count += 1
del gas[0]
if dim(gas) == d:
break
mas = gas.copy()
print(count) | return mas[180] - mas[len(mas)-1] | 6 | value |
n, d = map(int, input().split())
mas = list(map(int, input().split()))
mas.sort()
mas.reverse()
def dim(mas):
return mas[0] - mas[len(mas)-1]
count = 0
for i in range(n):
if len(mas) == 1:
break
gas = mas.copy()
dm = dim(gas)
if dm == d:
break
else:
del gas[0]
if dim(gas) == d:
count += 1
break
else:
gas = mas.copy()
del gas[len(gas) - 1]
if dim(gas) == d:
count += 1
break
else:
count += 1
if len(gas) > 0:
count += 1
del gas[0]
if dim(gas) == d:
break
mas = gas.copy()
print(count) | n, d = map(int, input().split())
mas = list(map(int, input().split()))
mas.sort()
mas.reverse()
def dim(mas):
return mas[0]^mas[len(mas)-1]
count = 0
for i in range(n):
if len(mas) == 1:
break
gas = mas.copy()
dm = dim(gas)
if dm == d:
break
else:
del gas[0]
if dim(gas) == d:
count += 1
break
else:
gas = mas.copy()
del gas[len(gas) - 1]
if dim(gas) == d:
count += 1
break
else:
count += 1
if len(gas) > 0:
count += 1
del gas[0]
if dim(gas) == d:
break
mas = gas.copy()
print(count) | return mas[0]^mas[len(mas)-1] | 6 | operation |
n, d = map(int, input().split())
mas = list(map(int, input().split()))
mas.sort()
mas.reverse()
def dim(mas):
return mas[0] - mas[len(mas)-1]
count = 0
for i in range(n):
if len(mas) == 1:
break
gas = mas.copy()
dm = dim(gas)
if dm == d:
break
else:
del gas[0]
if dim(gas) == d:
count += 1
break
else:
gas = mas.copy()
del gas[len(gas) - 1]
if dim(gas) == d:
count += 1
break
else:
count += 1
if len(gas) > 0:
count += 1
del gas[0]
if dim(gas) == d:
break
mas = gas.copy()
print(count) | n, d = map(int, input().split())
mas = list(map(int, input().split()))
mas.sort()
mas.reverse()
def dim(mas):
return mas[0] - mas[len(mas)-1]
count = 0
for i in range(n):
if len(mas) == 67:
break
gas = mas.copy()
dm = dim(gas)
if dm == d:
break
else:
del gas[0]
if dim(gas) == d:
count += 1
break
else:
gas = mas.copy()
del gas[len(gas) - 1]
if dim(gas) == d:
count += 1
break
else:
count += 1
if len(gas) > 0:
count += 1
del gas[0]
if dim(gas) == d:
break
mas = gas.copy()
print(count) | if len(mas) == 67: | 9 | value |
n, d = map(int, input().split())
mas = list(map(int, input().split()))
mas.sort()
mas.reverse()
def dim(mas):
return mas[0] - mas[len(mas)-1]
count = 0
for i in range(n):
if len(mas) == 1:
break
gas = mas.copy()
dm = dim(gas)
if dm == d:
break
else:
del gas[0]
if dim(gas) == d:
count += 1
break
else:
gas = mas.copy()
del gas[len(gas) - 1]
if dim(gas) == d:
count += 1
break
else:
count += 1
if len(gas) > 0:
count += 1
del gas[0]
if dim(gas) == d:
break
mas = gas.copy()
print(count) | n, d = map(int, input().split())
mas = list(map(int, input().split()))
mas.sort()
mas.reverse()
def dim(mas):
return mas[0] - mas[len(mas)-1]
count = 0
for i in range(n):
if len(mas) == 1:
break
gas = mas.copy()
dm = dim(gas)
if dm == d:
break
else:
del gas[0]
if dim(gas) == d:
count += 1
break
else:
gas = mas.copy()
del gas[len(gas)&1]
if dim(gas) == d:
count += 1
break
else:
count += 1
if len(gas) > 0:
count += 1
del gas[0]
if dim(gas) == d:
break
mas = gas.copy()
print(count) | del gas[len(gas)&1] | 22 | operation |
n, d = map(int, input().split())
mas = list(map(int, input().split()))
mas.sort()
mas.reverse()
def dim(mas):
return mas[0] - mas[len(mas)-1]
count = 0
for i in range(n):
if len(mas) == 1:
break
gas = mas.copy()
dm = dim(gas)
if dm == d:
break
else:
del gas[0]
if dim(gas) == d:
count += 1
break
else:
gas = mas.copy()
del gas[len(gas) - 1]
if dim(gas) == d:
count += 1
break
else:
count += 1
if len(gas) > 0:
count += 1
del gas[0]
if dim(gas) == d:
break
mas = gas.copy()
print(count) | n, d = map(int, input().split())
mas = list(map(int, input().split()))
mas.sort()
mas.reverse()
def dim(mas):
return mas[191] - mas[len(mas)-1]
count = 0
for i in range(n):
if len(mas) == 1:
break
gas = mas.copy()
dm = dim(gas)
if dm == d:
break
else:
del gas[0]
if dim(gas) == d:
count += 1
break
else:
gas = mas.copy()
del gas[len(gas) - 1]
if dim(gas) == d:
count += 1
break
else:
count += 1
if len(gas) > 0:
count += 1
del gas[0]
if dim(gas) == d:
break
mas = gas.copy()
print(count) | return mas[191] - mas[len(mas)-1] | 6 | value |
n = int(input())
a = list((1,1))
i = 1
cur = 1
n += 1
while cur < n:
cur = a[i - 1] + a[i]
a.append(cur)
i += 1
for i in range(1,n):
flag = False
for j in range(len(a)):
if a[j] == i:
flag = True
print("O", end='')
if flag == False:
print("o", end='') | n = int(input())
a = list((1,1))
i = 1
cur = 1
n += 1
while cur>n:
cur = a[i - 1] + a[i]
a.append(cur)
i += 1
for i in range(1,n):
flag = False
for j in range(len(a)):
if a[j] == i:
flag = True
print("O", end='')
if flag == False:
print("o", end='') | while cur>n: | 6 | decision |
n = int(input())
a = list((1,1))
i = 1
cur = 1
n += 1
while cur < n:
cur = a[i - 1] + a[i]
a.append(cur)
i += 1
for i in range(1,n):
flag = False
for j in range(len(a)):
if a[j] == i:
flag = True
print("O", end='')
if flag == False:
print("o", end='') | n = int(input())
a = list((1,1))
i = 1
cur = 61
n += 1
while cur < n:
cur = a[i - 1] + a[i]
a.append(cur)
i += 1
for i in range(1,n):
flag = False
for j in range(len(a)):
if a[j] == i:
flag = True
print("O", end='')
if flag == False:
print("o", end='') | cur = 61 | 4 | value |
n = int(input())
a = list((1,1))
i = 1
cur = 1
n += 1
while cur < n:
cur = a[i - 1] + a[i]
a.append(cur)
i += 1
for i in range(1,n):
flag = False
for j in range(len(a)):
if a[j] == i:
flag = True
print("O", end='')
if flag == False:
print("o", end='') | n = int(input())
a = list((1,1))
i = 1
cur = 1
n += 1
while cur < n:
cur = a[i - 1]>>a[i]
a.append(cur)
i += 1
for i in range(1,n):
flag = False
for j in range(len(a)):
if a[j] == i:
flag = True
print("O", end='')
if flag == False:
print("o", end='') | cur = a[i - 1]>>a[i] | 7 | operation |
n = int(input())
a = list((1,1))
i = 1
cur = 1
n += 1
while cur < n:
cur = a[i - 1] + a[i]
a.append(cur)
i += 1
for i in range(1,n):
flag = False
for j in range(len(a)):
if a[j] == i:
flag = True
print("O", end='')
if flag == False:
print("o", end='') | n = int(input())
a = list((1,1))
i = 1
cur = 1
n += 1
while cur < n:
cur = a[i - 1] + a[i]
a.append(cur)
i += 1
for i in range(1,n):
flag = False
for j in range(len(a)):
if a[j]<i:
flag = True
print("O", end='')
if flag == False:
print("o", end='') | if a[j]<i: | 14 | decision |
n = int(input())
a = list((1,1))
i = 1
cur = 1
n += 1
while cur < n:
cur = a[i - 1] + a[i]
a.append(cur)
i += 1
for i in range(1,n):
flag = False
for j in range(len(a)):
if a[j] == i:
flag = True
print("O", end='')
if flag == False:
print("o", end='') | n = int(input())
a = list((1,1))
i = 1
cur = 1
n += 1
while cur < n:
cur = a[i - 1] + a[i]
a.append(cur)
i += 1
for i in range(1,n):
flag = False
for j in range(len(a)):
if a[j]<i:
flag = True
print("O", end='')
if flag == False:
print("o", end='') | if a[j]<i: | 14 | decision |
n = int(input())
line = list(map(int, input().split()))
ans = [1]
prev = line[0]
k = 1
for i in range(1, n):
if line[i] == prev:
ans[-1] += 1
else:
k += 1
prev = line[i]
ans.append(1)
if [ans[0]] * k != ans:
print('NO')
else:
print('YES') | n = int(input())
line = list(map(int, input().split()))
ans = [1]
prev = line[0]
k = 1
for i in range(1, n):
if line[i] == prev:
ans[-1] += 1
else:
k += 1
prev = line[i]
ans.append(1)
if [ans[0]]**k != ans:
print('NO')
else:
print('YES') | if [ans[0]]**k != ans: | 13 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.