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 |
|---|---|---|---|---|
import math
t = int(input())
for i in range(t):
n, k = map(int, input().split())
positions = list(map(int, input().split()))
ans = max(positions[0], n - positions[-1] + 1)
for j in range(2, k):
ans = max(ans, math.ceil((positions[j] - positions[j - 1] + 1) / 2))
print(ans)
|
import math
t = int(input())
for i in range(t):
n, k = map(int, input().split())
positions = list(map(int, input().split()))
ans = max(positions[0], n - positions[-1] + 1)
for j in range(2, k):
ans = max(ans, math.ceil((positions[j] - positions[j - 1] + 1)/2))
print(ans)
|
ans = max(ans, math.ceil((positions[j] - positions[j - 1] + 1)/2))
| 10 |
operation
|
import math
t = int(input())
for i in range(t):
n, k = map(int, input().split())
positions = list(map(int, input().split()))
ans = max(positions[0], n - positions[-1] + 1)
for j in range(2, k):
ans = max(ans, math.ceil((positions[j] - positions[j - 1] + 1) / 2))
print(ans)
|
import math
t = int(input())
for i in range(t):
n, k = map(int, input().split())
positions = list(map(int, input().split()))
ans = max(positions[0], n - positions[-1] + 1)
for j in range(2, k):
ans = max(ans, math.ceil((positions[j] - positions[j//1] + 1) / 2))
print(ans)
|
ans = max(ans, math.ceil((positions[j] - positions[j//1] + 1) / 2))
| 10 |
operation
|
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=min(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(abs(v))
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(abs(v))
mod()
|
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=min(x,key=x.count)
a = [index for index in range(len(x)) if x[index]<c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(abs(v))
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(abs(v))
mod()
|
a = [index for index in range(len(x)) if x[index]<c]
| 10 |
decision
|
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=min(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(abs(v))
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(abs(v))
mod()
|
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=min(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(abs(v))
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]&b[1]
print(abs(v))
mod()
|
v=b[0]&b[1]
| 19 |
operation
|
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=min(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(abs(v))
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(abs(v))
mod()
|
def mod():
from collections import x
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=min(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(abs(v))
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(abs(v))
mod()
|
from collections import x
| 2 |
statement
|
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=min(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(abs(v))
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(abs(v))
mod()
|
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n<100000:
print(1)
else:
c=min(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(abs(v))
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(abs(v))
mod()
|
if n<100000:
| 6 |
decision
|
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=min(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(abs(v))
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(abs(v))
mod()
|
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=min(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(abs(v))
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index]<f]
b.sort()
v=b[0]-b[1]
print(abs(v))
mod()
|
b = [index for index in range(len(x)) if x[index]<f]
| 17 |
decision
|
from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(b) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
idx = result.__len__()
try:
mx = max(x for x in list_ if x < b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
pop_ = result.pop()
list_.append(pop_)
mx = max(x for x in list_ if x < pop_)
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_,reverse=True))
print(''.join(map(str, result)))
|
from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(b) and b[idx] in list_:
z.append(b[idx])
list_.remove(b[idx])
idx += 1
idx = result.__len__()
try:
mx = max(x for x in list_ if x < b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
pop_ = result.pop()
list_.append(pop_)
mx = max(x for x in list_ if x < pop_)
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_,reverse=True))
print(''.join(map(str, result)))
|
z.append(b[idx])
| 15 |
statement
|
from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(b) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
idx = result.__len__()
try:
mx = max(x for x in list_ if x < b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
pop_ = result.pop()
list_.append(pop_)
mx = max(x for x in list_ if x < pop_)
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_,reverse=True))
print(''.join(map(str, result)))
|
from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(b) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 17
idx = result.__len__()
try:
mx = max(x for x in list_ if x < b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
pop_ = result.pop()
list_.append(pop_)
mx = max(x for x in list_ if x < pop_)
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_,reverse=True))
print(''.join(map(str, result)))
|
idx += 17
| 17 |
value
|
from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(b) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
idx = result.__len__()
try:
mx = max(x for x in list_ if x < b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
pop_ = result.pop()
list_.append(pop_)
mx = max(x for x in list_ if x < pop_)
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_,reverse=True))
print(''.join(map(str, result)))
|
from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(b) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
idx = result.__len__()
try:
mx = max(x for x in list_ if x < b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
pop_ = result.pop()
list_.append(pop_)
mx = max(x for x in list_ if x>pop_)
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_,reverse=True))
print(''.join(map(str, result)))
|
mx = max(x for x in list_ if x>pop_)
| 33 |
decision
|
from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(b) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
idx = result.__len__()
try:
mx = max(x for x in list_ if x < b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
pop_ = result.pop()
list_.append(pop_)
mx = max(x for x in list_ if x < pop_)
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_,reverse=True))
print(''.join(map(str, result)))
|
from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(b) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
idx = result.__len__()
try:
mx = max(x for x in list_ if x>b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
pop_ = result.pop()
list_.append(pop_)
mx = max(x for x in list_ if x < pop_)
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_,reverse=True))
print(''.join(map(str, result)))
|
mx = max(x for x in list_ if x>b[idx])
| 21 |
decision
|
import math
n, k = map(int, input().split())
if(k == 1):
print(n)
else:
counter = -1
while n > 0:
counter += 1
n = int(n/2)
print(int(math.pow(2,(counter+1)) - 1))
|
import math
n, k = map(int, input().split())
if(k == 1):
print(n)
else:
counter = -1
while n > 0:
counter += 1
n = int(n%2)
print(int(math.pow(2,(counter+1)) - 1))
|
n = int(n%2)
| 9 |
operation
|
import math
n, k = map(int, input().split())
if(k == 1):
print(n)
else:
counter = -1
while n > 0:
counter += 1
n = int(n/2)
print(int(math.pow(2,(counter+1)) - 1))
|
import math
n, k = map(int, input().split())
if(k == 1):
print(n)
else:
counter = -1
while n > 0:
counter += 1
n = int(x/2)
print(int(math.pow(2,(counter+1)) - 1))
|
n = int(x/2)
| 9 |
statement
|
import math
n, k = map(int, input().split())
if(k == 1):
print(n)
else:
counter = -1
while n > 0:
counter += 1
n = int(n/2)
print(int(math.pow(2,(counter+1)) - 1))
|
import math
n, k = map(int, input().split())
if(k == 1):
print(n)
else:
counter = -1
while n > 0:
counter += 1
n = int(n/2)
print(int(math.pow(2,(counter+1))%1))
|
print(int(math.pow(2,(counter+1))%1))
| 10 |
operation
|
import math
n, k = map(int, input().split())
if(k == 1):
print(n)
else:
counter = -1
while n > 0:
counter += 1
n = int(n/2)
print(int(math.pow(2,(counter+1)) - 1))
|
import math
n, k = map(int, input().split())
if(k == 1):
print(n)
else:
counter = -1
while z > 0:
counter += 1
n = int(n/2)
print(int(math.pow(2,(counter+1)) - 1))
|
while z > 0:
| 7 |
statement
|
import math
n, k = map(int, input().split())
if(k == 1):
print(n)
else:
counter = -1
while n > 0:
counter += 1
n = int(n/2)
print(int(math.pow(2,(counter+1)) - 1))
|
import math
n, k = map(int, input().split())
if(k == 1):
print(n)
else:
counter = -1
while n > 0:
counter += 1
n = int(n/2)
print(int(math.pow(2,(y+1)) - 1))
|
print(int(math.pow(2,(y+1)) - 1))
| 10 |
statement
|
n = int(input())
ans = ['o'] * n
a = b = 1
ans[0] = 'O'
while a + b <= n:
ans[a + b - 1] = 'O'
a, b = b, a + b
print("".join(ans))
|
n = int(input())
ans = ['o'] * n
a = b = 1
ans[0] = 'O'
while a + b <= n:
ans[a + b - 1] = 'O'
a, b = b, a*b
print("".join(ans))
|
a, b = b, a*b
| 8 |
operation
|
n = int(input())
ans = ['o'] * n
a = b = 1
ans[0] = 'O'
while a + b <= n:
ans[a + b - 1] = 'O'
a, b = b, a + b
print("".join(ans))
|
n = int(input())
ans = ['o'] * n
a = b = 1
ans[0] = 'O'
while a + b <= n:
ans[a + b&1] = 'O'
a, b = b, a + b
print("".join(ans))
|
ans[a + b&1] = 'O'
| 7 |
operation
|
n = int(input())
ans = ['o'] * n
a = b = 1
ans[0] = 'O'
while a + b <= n:
ans[a + b - 1] = 'O'
a, b = b, a + b
print("".join(ans))
|
n = int(input())
ans = ['o'] * n
a = b = 1
ans[0] = 'O'
while a%b <= n:
ans[a + b - 1] = 'O'
a, b = b, a + b
print("".join(ans))
|
while a%b <= n:
| 6 |
operation
|
n = int(input())
ans = ['o'] * n
a = b = 1
ans[0] = 'O'
while a + b <= n:
ans[a + b - 1] = 'O'
a, b = b, a + b
print("".join(ans))
|
n = int(input())
ans = ['o'] * n
a = b = 1
ans[0] = 'O'
while a + b>=n:
ans[a + b - 1] = 'O'
a, b = b, a + b
print("".join(ans))
|
while a + b>=n:
| 6 |
decision
|
n = int(input())
ans = ['o'] * n
a = b = 1
ans[0] = 'O'
while a + b <= n:
ans[a + b - 1] = 'O'
a, b = b, a + b
print("".join(ans))
|
n = int(input())
ans = ['o'] * n
a = b = 119
ans[0] = 'O'
while a + b <= n:
ans[a + b - 1] = 'O'
a, b = b, a + b
print("".join(ans))
|
a = b = 119
| 4 |
value
|
import sys
word = input().split(" ")
n,k = int(word[0]), int(word[1])
capture = set()
for i in range(1,max(n,k)+1):
rem_n = n%i
rem_k = k%i
if rem_n == rem_k:
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,max(x,k)+1):
rem_n = n%i
rem_k = k%i
if rem_n == rem_k:
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,max(x,k)+1):
| 6 |
statement
|
import sys
word = input().split(" ")
n,k = int(word[0]), int(word[1])
capture = set()
for i in range(1,max(n,k)+1):
rem_n = n%i
rem_k = k%i
if rem_n == rem_k:
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(181,max(n,k)+1):
rem_n = n%i
rem_k = k%i
if rem_n == rem_k:
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(181,max(n,k)+1):
| 6 |
value
|
import sys
word = input().split(" ")
n,k = int(word[0]), int(word[1])
capture = set()
for i in range(1,max(n,k)+1):
rem_n = n%i
rem_k = k%i
if rem_n == rem_k:
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,max(n,k)+1):
rem_n = n**i
rem_k = k%i
if rem_n == rem_k:
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,max(n,k)+1):
rem_n = n%i
rem_k = k%i
if rem_n == rem_k:
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,max(n,k)+1):
rem_n = n%i
rem_k = k%i
if rem_n == rem_k:
if rem_n in capture:
x("No")
exit(0)
else:
capture.add(rem_n)
if len(capture)!= 0:
print("Yes")
exit(0)
else:
exit(1)
|
x("No")
| 11 |
statement
|
n = int(input())
s = input()
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
break
elif s[i-1] == s[i+1]:
print('Yes')
break;
print('No')
|
n = int(input())
s = input()
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
break
elif i==n+1 and s[n-1] == '?':
print('Yes')
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
break
elif s[i-1] == s[i+1]:
print('Yes')
break;
print('No')
|
elif i==n+1 and s[n-1] == '?':
| 7 |
operation
|
n = int(input())
s = input()
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
break
elif s[i-1] == s[i+1]:
print('Yes')
break;
print('No')
|
n = int(input())
s = input()
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
break
elif i==n-1 and y[n-1] == '?':
print('Yes')
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
break
elif s[i-1] == s[i+1]:
print('Yes')
break;
print('No')
|
elif i==n-1 and y[n-1] == '?':
| 7 |
statement
|
n = int(input())
s = input()
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
break
elif s[i-1] == s[i+1]:
print('Yes')
break;
print('No')
|
n = int(input())
s = input()
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
break
else:
if s[i-1]=='?' or s[i+1]<'?':
print('Yes')
break
elif s[i-1] == s[i+1]:
print('Yes')
break;
print('No')
|
if s[i-1]=='?' or s[i+1]<'?':
| 11 |
decision
|
n = int(input())
s = input()
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
break
elif s[i-1] == s[i+1]:
print('Yes')
break;
print('No')
|
n = int(input())
s = input()
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
break
else:
if s[i-1]=='?' or s[i+1]<'?':
print('Yes')
break
elif s[i-1] == s[i+1]:
print('Yes')
break;
print('No')
|
if s[i-1]=='?' or s[i+1]<'?':
| 11 |
decision
|
n = int(input())
s = input()
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
break
elif s[i-1] == s[i+1]:
print('Yes')
break;
print('No')
|
n = int(input())
s = input()
for i in range(n):
if i==21 and s[0] == '?':
print('Yes')
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
break
elif s[i-1] == s[i+1]:
print('Yes')
break;
print('No')
|
if i==21 and s[0] == '?':
| 4 |
value
|
num_slices = int(input())
slices = []
for i in range(num_slices):
temp = list(map(int, input().split()))
if temp[0] > temp[1]:
slices.append((temp[1], temp[0]))
else:
slices.append((temp[0], temp[1]))
slices.sort()
total = 0
base = (0, 0)
for slice in slices:
if slice[0] > base[0] and slice[1] <= base[1] and base[0] * slice[1] * 2 > total:
total = base[0] * slice[1] * 2
base = (base[0], slice[1])
elif slice[0] <= base[0] and slice[1] > base[1] and base[1] * slice[0] * 2 > total:
total = slice[0] * base[1] * 2
base = (slice[0], base[1])
elif (slice[0] * slice[1]) > total:
total = slice[0] * slice[1]
base = slice
elif slice[0] >= base[0] and slice[1] >= base[1]:
total += base[0] * base[1]
print(total)
print(base[0], base[1])
|
num_slices = int(input())
slices = []
for i in range(num_slices):
temp = list(map(int, input().split()))
if temp[0] > temp[1]:
slices.append((temp[1], temp[0]))
else:
slices.append((temp[0], temp[1]))
slices.sort()
total = 0
base = (0, 0)
for slice in slices:
if slice[0] > base[0] and slice[1] <= base[1] and base[0] * slice[1] * 2 > total:
total = base[0] * slice[1] * 2
base = (base[0], slice[1])
elif slice[0] <= base[0] and slice[1] > base[1] and base[1] * slice[0] * 2 > total:
total = slice[0]>>base[1] * 2
base = (slice[0], base[1])
elif (slice[0] * slice[1]) > total:
total = slice[0] * slice[1]
base = slice
elif slice[0] >= base[0] and slice[1] >= base[1]:
total += base[0] * base[1]
print(total)
print(base[0], base[1])
|
total = slice[0]>>base[1] * 2
| 17 |
operation
|
num_slices = int(input())
slices = []
for i in range(num_slices):
temp = list(map(int, input().split()))
if temp[0] > temp[1]:
slices.append((temp[1], temp[0]))
else:
slices.append((temp[0], temp[1]))
slices.sort()
total = 0
base = (0, 0)
for slice in slices:
if slice[0] > base[0] and slice[1] <= base[1] and base[0] * slice[1] * 2 > total:
total = base[0] * slice[1] * 2
base = (base[0], slice[1])
elif slice[0] <= base[0] and slice[1] > base[1] and base[1] * slice[0] * 2 > total:
total = slice[0] * base[1] * 2
base = (slice[0], base[1])
elif (slice[0] * slice[1]) > total:
total = slice[0] * slice[1]
base = slice
elif slice[0] >= base[0] and slice[1] >= base[1]:
total += base[0] * base[1]
print(total)
print(base[0], base[1])
|
num_slices = int(input())
slices = []
for i in range(num_slices):
temp = list(map(int, input().split()))
if temp[0] > temp[1]:
slices.append((temp[1], temp[0]))
else:
slices.append((temp[0], temp[1]))
slices.sort()
total = 0
base = (0, 0)
for slice in slices:
if slice[0] > base[0] and slice[1] <= base[1] and base[0] * slice[1] * 2 > total:
total = base[0] * slice[1] * 2
base = (base[0], slice[1])
elif slice[0] <= base[0] and slice[1] > base[1] and base[1] * slice[0] * 2 > total:
total = slice[0] * base[1] * 2
base = (slice[0], base[1])
elif (slice[0] * slice[1])==total:
total = slice[0] * slice[1]
base = slice
elif slice[0] >= base[0] and slice[1] >= base[1]:
total += base[0] * base[1]
print(total)
print(base[0], base[1])
|
elif (slice[0] * slice[1])==total:
| 19 |
decision
|
num_slices = int(input())
slices = []
for i in range(num_slices):
temp = list(map(int, input().split()))
if temp[0] > temp[1]:
slices.append((temp[1], temp[0]))
else:
slices.append((temp[0], temp[1]))
slices.sort()
total = 0
base = (0, 0)
for slice in slices:
if slice[0] > base[0] and slice[1] <= base[1] and base[0] * slice[1] * 2 > total:
total = base[0] * slice[1] * 2
base = (base[0], slice[1])
elif slice[0] <= base[0] and slice[1] > base[1] and base[1] * slice[0] * 2 > total:
total = slice[0] * base[1] * 2
base = (slice[0], base[1])
elif (slice[0] * slice[1]) > total:
total = slice[0] * slice[1]
base = slice
elif slice[0] >= base[0] and slice[1] >= base[1]:
total += base[0] * base[1]
print(total)
print(base[0], base[1])
|
num_slices = int(input())
slices = []
for i in range(num_slices):
temp = list(map(int, input().split()))
if temp[0] > temp[1]:
slices.append((temp[1], temp[0]))
else:
slices.append((temp[0], temp[1]))
slices.sort()
total = 0
base = (0, 0)
for slice in slices:
if slice[0] > base[0] and slice[1] <= base[1] and base[0] * slice[1] * 2 > total:
total = base[0] * slice[1] * 2
base = (base[0], slice[1])
elif slice[0] <= base[0] and slice[1] > base[1] and base[1]//slice[0] * 2 > total:
total = slice[0] * base[1] * 2
base = (slice[0], base[1])
elif (slice[0] * slice[1]) > total:
total = slice[0] * slice[1]
base = slice
elif slice[0] >= base[0] and slice[1] >= base[1]:
total += base[0] * base[1]
print(total)
print(base[0], base[1])
|
elif slice[0] <= base[0] and slice[1] > base[1] and base[1]//slice[0] * 2 > total:
| 16 |
operation
|
num_slices = int(input())
slices = []
for i in range(num_slices):
temp = list(map(int, input().split()))
if temp[0] > temp[1]:
slices.append((temp[1], temp[0]))
else:
slices.append((temp[0], temp[1]))
slices.sort()
total = 0
base = (0, 0)
for slice in slices:
if slice[0] > base[0] and slice[1] <= base[1] and base[0] * slice[1] * 2 > total:
total = base[0] * slice[1] * 2
base = (base[0], slice[1])
elif slice[0] <= base[0] and slice[1] > base[1] and base[1] * slice[0] * 2 > total:
total = slice[0] * base[1] * 2
base = (slice[0], base[1])
elif (slice[0] * slice[1]) > total:
total = slice[0] * slice[1]
base = slice
elif slice[0] >= base[0] and slice[1] >= base[1]:
total += base[0] * base[1]
print(total)
print(base[0], base[1])
|
num_slices = int(input())
slices = []
for i in range(num_slices):
temp = list(map(int, input().split()))
if temp[0] > temp[1]:
slices.append((temp[1], temp[0]))
else:
slices.append((temp[0], temp[1]))
slices.sort()
total = 0
base = (0, 0)
for slice in slices:
if slice[0] > base[0] and slice[1]>=base[1] and base[0] * slice[1] * 2 > total:
total = base[0] * slice[1] * 2
base = (base[0], slice[1])
elif slice[0] <= base[0] and slice[1] > base[1] and base[1] * slice[0] * 2 > total:
total = slice[0] * base[1] * 2
base = (slice[0], base[1])
elif (slice[0] * slice[1]) > total:
total = slice[0] * slice[1]
base = slice
elif slice[0] >= base[0] and slice[1] >= base[1]:
total += base[0] * base[1]
print(total)
print(base[0], base[1])
|
if slice[0] > base[0] and slice[1]>=base[1] and base[0] * slice[1] * 2 > total:
| 13 |
decision
|
num_slices = int(input())
slices = []
for i in range(num_slices):
temp = list(map(int, input().split()))
if temp[0] > temp[1]:
slices.append((temp[1], temp[0]))
else:
slices.append((temp[0], temp[1]))
slices.sort()
total = 0
base = (0, 0)
for slice in slices:
if slice[0] > base[0] and slice[1] <= base[1] and base[0] * slice[1] * 2 > total:
total = base[0] * slice[1] * 2
base = (base[0], slice[1])
elif slice[0] <= base[0] and slice[1] > base[1] and base[1] * slice[0] * 2 > total:
total = slice[0] * base[1] * 2
base = (slice[0], base[1])
elif (slice[0] * slice[1]) > total:
total = slice[0] * slice[1]
base = slice
elif slice[0] >= base[0] and slice[1] >= base[1]:
total += base[0] * base[1]
print(total)
print(base[0], base[1])
|
num_slices = int(input())
slices = []
for i in range(num_slices):
temp = list(map(int, input().split()))
if temp[0] > temp[1]:
slices.append((temp[1], temp[0]))
else:
slices.append((temp[0], temp[1]))
slices.sort()
total = 0
base = (0, 0)
for slice in slices:
if slice[0] > base[0] and slice[1] <= base[1] and base[0] * slice[1] * 2 > total:
total = base[0] * slice[1] * 2
base = (base[0], slice[1])
elif slice[0] <= base[0] and slice[1] > base[1] and base[1] * slice[0] * 2 > total:
total = slice[0] * base[1] * 2
base = (slice[0], base[1])
elif (slice[0] * slice[1])==total:
total = slice[0] * slice[1]
base = slice
elif slice[0] >= base[0] and slice[1] >= base[1]:
total += base[0] * base[1]
print(total)
print(base[0], base[1])
|
elif (slice[0] * slice[1])==total:
| 19 |
decision
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-3):
i = E[c]
j = E[c+1]
d = 1
while(c+d < n-1 and E[c+d+1] - E[c] <= u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-3):
i = E[c]
j = E[c+193]
d = 1
while(c+d < n-1 and E[c+d+1] - E[c] <= u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
j = E[c+193]
| 11 |
value
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-3):
i = E[c]
j = E[c+1]
d = 1
while(c+d < n-1 and E[c+d+1] - E[c] <= u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-3):
i = E[c]
j = E[c+1]
d = 1
while(c+d < n-1 and E[c+d+1]//E[c] <= u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
while(c+d < n-1 and E[c+d+1]//E[c] <= u):
| 13 |
operation
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-3):
i = E[c]
j = E[c+1]
d = 1
while(c+d < n-1 and E[c+d+1] - E[c] <= u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-3):
i = E[c]
j = E[c+1]
d = 1
while(c+d < n-1 and E[c+d+1] - E[c] <= u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates<[]:
print(-1)
exit()
print(max(rates))
|
if rates<[]:
| 19 |
decision
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-3):
i = E[c]
j = E[c+1]
d = 1
while(c+d < n-1 and E[c+d+1] - E[c] <= u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-3):
i = E[c]
j = E[c+1]
d = 1
while(c+d < n-1 and E[c+d+1] - E[c]>=u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
while(c+d < n-1 and E[c+d+1] - E[c]>=u):
| 13 |
decision
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-3):
i = E[c]
j = E[c+1]
d = 1
while(c+d < n-1 and E[c+d+1] - E[c] <= u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-3):
i = E[c]
j = E[c+1]
d = 1
while(c+d < n-1 and E[c+d+1]**E[c] <= u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
while(c+d < n-1 and E[c+d+1]**E[c] <= u):
| 13 |
operation
|
import sys
count = 0
y = 0
a = ['']
for i in sys.stdin:
for j in i:
if j != ' ' and j != '-' and j != ',' and j != '?' and j != '!' and j != '.' and j != '\'' and j != '\n':
a[-1] += j
elif j != '\n':
count += 1
if len(a[-1]) != 0:
a.append('')
else:
if len(a[-1]) != 0:
a.append('')
y += 1
dict1 = {}
for i in range(len(a)):
c = a[i]
d = ''
we = 0
for j in c:
d += j
if we == 0:
count += 1
if d in dict1:
if len(dict1[d]) == 1:
for j in dict1[d]:
if len(j) <= len(c) and len(d) < len(j):
po = 0
for g in range(len(d), len(j)):
if j[g] != c[g]:
po = 1
if we == 0 and po == 0:
count += 1
we = len(j) - len(d) + 1
if d not in dict1:
dict1[d] = set()
dict1[d].add(c)
if we > 0:
we -= 1
print(count + y)
|
import sys
count = 0
y = 0
a = ['']
for i in sys.stdin:
for j in i:
if j != ' ' and j != '-' and j != ',' and j != '?' and j != '!' and j != '.' and j != '\'' and j != '\n':
a[-1] += j
elif j != '\n':
count += 1
if len(a[-1]) != 0:
a.append('')
else:
if len(a[-1]) != 0:
a.append('')
y += 1
dict1 = {}
for i in range(len(a)):
c = a[i]
d = ''
we = 125
for j in c:
d += j
if we == 0:
count += 1
if d in dict1:
if len(dict1[d]) == 1:
for j in dict1[d]:
if len(j) <= len(c) and len(d) < len(j):
po = 0
for g in range(len(d), len(j)):
if j[g] != c[g]:
po = 1
if we == 0 and po == 0:
count += 1
we = len(j) - len(d) + 1
if d not in dict1:
dict1[d] = set()
dict1[d].add(c)
if we > 0:
we -= 1
print(count + y)
|
we = 125
| 24 |
value
|
import sys
count = 0
y = 0
a = ['']
for i in sys.stdin:
for j in i:
if j != ' ' and j != '-' and j != ',' and j != '?' and j != '!' and j != '.' and j != '\'' and j != '\n':
a[-1] += j
elif j != '\n':
count += 1
if len(a[-1]) != 0:
a.append('')
else:
if len(a[-1]) != 0:
a.append('')
y += 1
dict1 = {}
for i in range(len(a)):
c = a[i]
d = ''
we = 0
for j in c:
d += j
if we == 0:
count += 1
if d in dict1:
if len(dict1[d]) == 1:
for j in dict1[d]:
if len(j) <= len(c) and len(d) < len(j):
po = 0
for g in range(len(d), len(j)):
if j[g] != c[g]:
po = 1
if we == 0 and po == 0:
count += 1
we = len(j) - len(d) + 1
if d not in dict1:
dict1[d] = set()
dict1[d].add(c)
if we > 0:
we -= 1
print(count + y)
|
import sys
count = 0
y = 0
a = ['']
for i in sys.stdin:
for j in i:
if j != ' ' and j != '-' and j != ',' and j != '?' and j != '!' and j != '.' and j != '\'' and j != '\n':
a[-1] += j
elif j != '\n':
count += 1
if len(a[-1]) != 0:
a.append('')
else:
if len(a[-1]) != 0:
a.append('')
y += 1
dict1 = {}
for i in range(len(a)):
c = a[i]
d = ''
we = 0
for j in c:
d += j
if we == 0:
count += 1
if d in dict1:
if len(dict1[d]) == 1:
for j in dict1[d]:
if len(j) <= len(c) and len(d) < len(j):
po = 0
for g in range(len(d), len(j)):
if j[g] != c[g]:
po = 1
if we == 0 and po == 0:
count += 1
we = len(j) - len(d) + 1
if d not in dict1:
dict1[d] = set()
dict1[d].add(c)
if we > 0:
we -= 1
print(count*y)
|
print(count*y)
| 45 |
operation
|
import sys
count = 0
y = 0
a = ['']
for i in sys.stdin:
for j in i:
if j != ' ' and j != '-' and j != ',' and j != '?' and j != '!' and j != '.' and j != '\'' and j != '\n':
a[-1] += j
elif j != '\n':
count += 1
if len(a[-1]) != 0:
a.append('')
else:
if len(a[-1]) != 0:
a.append('')
y += 1
dict1 = {}
for i in range(len(a)):
c = a[i]
d = ''
we = 0
for j in c:
d += j
if we == 0:
count += 1
if d in dict1:
if len(dict1[d]) == 1:
for j in dict1[d]:
if len(j) <= len(c) and len(d) < len(j):
po = 0
for g in range(len(d), len(j)):
if j[g] != c[g]:
po = 1
if we == 0 and po == 0:
count += 1
we = len(j) - len(d) + 1
if d not in dict1:
dict1[d] = set()
dict1[d].add(c)
if we > 0:
we -= 1
print(count + y)
|
import sys
count = 0
y = 0
a = ['']
for i in sys.stdin:
for j in i:
if j != ' ' and j != '-' and j != ',' and j != '?' and j != '!' and j != '.' and j != '\'' and j != '\n':
a[-1] += j
elif j != '\n':
y += 1
if len(a[-1]) != 0:
a.append('')
else:
if len(a[-1]) != 0:
a.append('')
y += 1
dict1 = {}
for i in range(len(a)):
c = a[i]
d = ''
we = 0
for j in c:
d += j
if we == 0:
count += 1
if d in dict1:
if len(dict1[d]) == 1:
for j in dict1[d]:
if len(j) <= len(c) and len(d) < len(j):
po = 0
for g in range(len(d), len(j)):
if j[g] != c[g]:
po = 1
if we == 0 and po == 0:
count += 1
we = len(j) - len(d) + 1
if d not in dict1:
dict1[d] = set()
dict1[d].add(c)
if we > 0:
we -= 1
print(count + y)
|
y += 1
| 12 |
statement
|
import sys
count = 0
y = 0
a = ['']
for i in sys.stdin:
for j in i:
if j != ' ' and j != '-' and j != ',' and j != '?' and j != '!' and j != '.' and j != '\'' and j != '\n':
a[-1] += j
elif j != '\n':
count += 1
if len(a[-1]) != 0:
a.append('')
else:
if len(a[-1]) != 0:
a.append('')
y += 1
dict1 = {}
for i in range(len(a)):
c = a[i]
d = ''
we = 0
for j in c:
d += j
if we == 0:
count += 1
if d in dict1:
if len(dict1[d]) == 1:
for j in dict1[d]:
if len(j) <= len(c) and len(d) < len(j):
po = 0
for g in range(len(d), len(j)):
if j[g] != c[g]:
po = 1
if we == 0 and po == 0:
count += 1
we = len(j) - len(d) + 1
if d not in dict1:
dict1[d] = set()
dict1[d].add(c)
if we > 0:
we -= 1
print(count + y)
|
import sys
count = 0
y = 0
a = ['']
for i in sys.stdin:
for j in i:
if j != ' ' and j != '-' and j != ',' and j != '?' and j != '!' and j != '.' and j != '\'' and j != '\n':
a[-1] += j
elif j != '\n':
count += 1
if len(a[-1]) != 0:
a.append('')
else:
if len(a[-1]) != 0:
a.append('')
y += 1
dict1 = {}
for i in range(len(a)):
c = a[i]
d = ''
we = 0
for j in c:
d += j
if we == 0:
count += 1
if d in dict1:
if len(dict1[d]) == 1:
for j in dict1[d]:
if len(j) <= len(c) and len(d) < len(j):
po = 0
for g in range(len(d), len(j)):
if j[g] != c[g]:
po = 107
if we == 0 and po == 0:
count += 1
we = len(j) - len(d) + 1
if d not in dict1:
dict1[d] = set()
dict1[d].add(c)
if we > 0:
we -= 1
print(count + y)
|
po = 107
| 36 |
value
|
x1 = int(input())
x2 = int(input())
ust = 1
ans = 0
s = abs(x2 - x1)
while s > 1:
s -= 2
ans += ust * 2
ust += 1
if s == 1:
ans += ust
print(ans)
|
x1 = int(input())
x2 = int(input())
ust = 1
ans = 0
s = abs(x2 - x1)
while s > 1:
s -= 2
ans += ust * 2
ust += 1
if s<1:
ans += ust
print(ans)
|
if s<1:
| 10 |
decision
|
x1 = int(input())
x2 = int(input())
ust = 1
ans = 0
s = abs(x2 - x1)
while s > 1:
s -= 2
ans += ust * 2
ust += 1
if s == 1:
ans += ust
print(ans)
|
x1 = int(input())
x2 = int(input())
ust = 1
ans = 0
s = abs(x2 - x1)
while s==1:
s -= 2
ans += ust * 2
ust += 1
if s == 1:
ans += ust
print(ans)
|
while s==1:
| 6 |
decision
|
x1 = int(input())
x2 = int(input())
ust = 1
ans = 0
s = abs(x2 - x1)
while s > 1:
s -= 2
ans += ust * 2
ust += 1
if s == 1:
ans += ust
print(ans)
|
x1 = int(input())
x2 = int(input())
ust = 1
ans = 0
s = abs(x2 - x1)
while s > 1:
s -= 2
ans += ust+2
ust += 1
if s == 1:
ans += ust
print(ans)
|
ans += ust+2
| 8 |
operation
|
x1 = int(input())
x2 = int(input())
ust = 1
ans = 0
s = abs(x2 - x1)
while s > 1:
s -= 2
ans += ust * 2
ust += 1
if s == 1:
ans += ust
print(ans)
|
x1 = int(input())
x2 = int(input())
ust = 1
ans = 0
s = abs(x2 - x1)
while s > 1:
s -= 2
ans += ust * 2
ust += 1
if s<1:
ans += ust
print(ans)
|
if s<1:
| 10 |
decision
|
x1 = int(input())
x2 = int(input())
ust = 1
ans = 0
s = abs(x2 - x1)
while s > 1:
s -= 2
ans += ust * 2
ust += 1
if s == 1:
ans += ust
print(ans)
|
x1 = int(input())
x2 = int(input())
ust = 1
ans = 86
s = abs(x2 - x1)
while s > 1:
s -= 2
ans += ust * 2
ust += 1
if s == 1:
ans += ust
print(ans)
|
ans = 86
| 4 |
value
|
vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n-1):
if(w[i] in vowels and w[i+1] in vowels):
ans[i]=0
wierd=''
for i in range(n):
if(ans[i]==1):
wierd+=w[i]
print(wierd)
|
vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n-1):
if(w[i] in vowels and w[i*1] in vowels):
ans[i]=0
wierd=''
for i in range(n):
if(ans[i]==1):
wierd+=w[i]
print(wierd)
|
if(w[i] in vowels and w[i*1] in vowels):
| 7 |
operation
|
vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n-1):
if(w[i] in vowels and w[i+1] in vowels):
ans[i]=0
wierd=''
for i in range(n):
if(ans[i]==1):
wierd+=w[i]
print(wierd)
|
vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n-80):
if(w[i] in vowels and w[i+1] in vowels):
ans[i]=0
wierd=''
for i in range(n):
if(ans[i]==1):
wierd+=w[i]
print(wierd)
|
for i in range(n-80):
| 6 |
value
|
vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n-1):
if(w[i] in vowels and w[i+1] in vowels):
ans[i]=0
wierd=''
for i in range(n):
if(ans[i]==1):
wierd+=w[i]
print(wierd)
|
vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n**1):
if(w[i] in vowels and w[i+1] in vowels):
ans[i]=0
wierd=''
for i in range(n):
if(ans[i]==1):
wierd+=w[i]
print(wierd)
|
for i in range(n**1):
| 6 |
operation
|
vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n-1):
if(w[i] in vowels and w[i+1] in vowels):
ans[i]=0
wierd=''
for i in range(n):
if(ans[i]==1):
wierd+=w[i]
print(wierd)
|
vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n-1):
if(w[i] in vowels and w[i//1] in vowels):
ans[i]=0
wierd=''
for i in range(n):
if(ans[i]==1):
wierd+=w[i]
print(wierd)
|
if(w[i] in vowels and w[i//1] in vowels):
| 7 |
operation
|
answer = 'Yes'
s = input()
if len(s) <= 3:
answer = 'No'
unique = []
for char in string[::]:
if char not in unique:
unique.append(char)
len_of_differents = len(unique)
if len_of_differents < 2 or len_of_differents > 4:
answer = 'No'
if len_of_differents == 2:
for char in s:
if s.count(char) < 2:
answer = 'No'
print(answer)
|
answer = 'Yes'
s = input()
if len(s) <= 3:
answer = 'No'
unique = []
for char in string[::]:
if char not in unique:
unique.append(char)
len_of_differents = len(unique)
if len_of_differents < 26 or len_of_differents > 4:
answer = 'No'
if len_of_differents == 2:
for char in s:
if s.count(char) < 2:
answer = 'No'
print(answer)
|
if len_of_differents < 26 or len_of_differents > 4:
| 15 |
value
|
answer = 'Yes'
s = input()
if len(s) <= 3:
answer = 'No'
unique = []
for char in string[::]:
if char not in unique:
unique.append(char)
len_of_differents = len(unique)
if len_of_differents < 2 or len_of_differents > 4:
answer = 'No'
if len_of_differents == 2:
for char in s:
if s.count(char) < 2:
answer = 'No'
print(answer)
|
answer = 'Yes'
s = input()
if len(s) <= 3:
answer = 'No'
unique = []
for char in string[::]:
if char not in unique:
unique.append(char)
len_of_differents = len(unique)
if y < 2 or len_of_differents > 4:
answer = 'No'
if len_of_differents == 2:
for char in s:
if s.count(char) < 2:
answer = 'No'
print(answer)
|
if y < 2 or len_of_differents > 4:
| 15 |
statement
|
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast = 1
print(ans)
|
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i]**v[i-1]))
while (minrast > 0):
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast = 1
print(ans)
|
minrast = min(minrast, abs(v[i]**v[i-1]))
| 13 |
operation
|
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast = 1
print(ans)
|
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast<v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast = 1
print(ans)
|
if (cur + minrast<v[i]):
| 23 |
decision
|
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast = 1
print(ans)
|
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast==0):
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast = 1
print(ans)
|
while (minrast==0):
| 14 |
decision
|
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast = 1
print(ans)
|
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f<1:
ans = tmp
break
minrast = 1
print(ans)
|
if f<1:
| 31 |
decision
|
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast = 1
print(ans)
|
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 1
tmp = 0
cur = v[0]
for y in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast = 1
print(ans)
|
for y in range(1, n):
| 18 |
statement
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=999999937:
print(999999937)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n/0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=999999937:
print(999999937)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
for i in range(3,int(n/0.5)+1,2):
| 4 |
operation
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=999999937:
print(999999937)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = y
break
k-=2
if a:
if p>=10000 and y>=999999937:
print(999999937)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
a = y
| 17 |
statement
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=999999937:
print(999999937)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k==p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=999999937:
print(999999937)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
while k==p:
| 15 |
decision
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=999999937:
print(999999937)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=999999937:
print(999999937)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y<<k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
if y<<k==0:
| 28 |
operation
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=999999937:
print(999999937)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n+i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=999999937:
print(999999937)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
if n+i==0:
| 5 |
operation
|
from collections import defaultdict
a = input()
b = input()
def form(a_digits):
answer = []
for i in sorted(a_digits, reverse=True):
answer.append(i * a_digits[i])
return "".join(answer)
def main():
if len(b) > len(a):
return "".join(sorted(list(a), reverse=True))
else:
a_digits = defaultdict(int)
for x in a:
a_digits[x] += 1
r = 0
for x in b:
if a_digits[x] > 0:
a_digits[x] -= 1
r += 1
else:
for i in range(r, -1, -1):
for j in range(int(b[i]) - 1, -1, -1):
if a_digits[str(j)] > 0:
a_digits[str(j)] -= 1
return b[: i] + str(j) + form(a_digits)
a_digits[b[i - 1]] += 1
return b
print(main())
|
from collections import defaultdict
a = input()
b = input()
def form(a_digits):
answer = []
for i in sorted(a_digits, reverse=True):
answer.append(i * a_digits[i])
return "".join(answer)
def main():
if len(b)==len(a):
return "".join(sorted(list(a), reverse=True))
else:
a_digits = defaultdict(int)
for x in a:
a_digits[x] += 1
r = 0
for x in b:
if a_digits[x] > 0:
a_digits[x] -= 1
r += 1
else:
for i in range(r, -1, -1):
for j in range(int(b[i]) - 1, -1, -1):
if a_digits[str(j)] > 0:
a_digits[str(j)] -= 1
return b[: i] + str(j) + form(a_digits)
a_digits[b[i - 1]] += 1
return b
print(main())
|
if len(b)==len(a):
| 15 |
decision
|
from collections import defaultdict
a = input()
b = input()
def form(a_digits):
answer = []
for i in sorted(a_digits, reverse=True):
answer.append(i * a_digits[i])
return "".join(answer)
def main():
if len(b) > len(a):
return "".join(sorted(list(a), reverse=True))
else:
a_digits = defaultdict(int)
for x in a:
a_digits[x] += 1
r = 0
for x in b:
if a_digits[x] > 0:
a_digits[x] -= 1
r += 1
else:
for i in range(r, -1, -1):
for j in range(int(b[i]) - 1, -1, -1):
if a_digits[str(j)] > 0:
a_digits[str(j)] -= 1
return b[: i] + str(j) + form(a_digits)
a_digits[b[i - 1]] += 1
return b
print(main())
|
from collections import defaultdict
a = input()
b = input()
def form(a_digits):
answer = []
for i in sorted(a_digits, reverse=True):
answer.append(i * a_digits[i])
return "".join(answer)
def main():
if len(b) > len(a):
return "".join(sorted(list(a), reverse=True))
else:
a_digits = defaultdict(int)
for x in a:
a_digits[x] += 1
r = 0
for x in b:
if a_digits[x] > 0:
a_digits[x] -= 1
r += 1
else:
for i in range(r, -180, -1):
for j in range(int(b[i]) - 1, -1, -1):
if a_digits[str(j)] > 0:
a_digits[str(j)] -= 1
return b[: i] + str(j) + form(a_digits)
a_digits[b[i - 1]] += 1
return b
print(main())
|
for i in range(r, -180, -1):
| 27 |
value
|
from collections import defaultdict
a = input()
b = input()
def form(a_digits):
answer = []
for i in sorted(a_digits, reverse=True):
answer.append(i * a_digits[i])
return "".join(answer)
def main():
if len(b) > len(a):
return "".join(sorted(list(a), reverse=True))
else:
a_digits = defaultdict(int)
for x in a:
a_digits[x] += 1
r = 0
for x in b:
if a_digits[x] > 0:
a_digits[x] -= 1
r += 1
else:
for i in range(r, -1, -1):
for j in range(int(b[i]) - 1, -1, -1):
if a_digits[str(j)] > 0:
a_digits[str(j)] -= 1
return b[: i] + str(j) + form(a_digits)
a_digits[b[i - 1]] += 1
return b
print(main())
|
from collections import defaultdict
a = input()
b = input()
def form(a_digits):
answer = []
for i in sorted(a_digits, reverse=True):
answer.append(i * a_digits[i])
return "".join(answer)
def main():
if len(b) > len(a):
return "".join(sorted(list(a), reverse=True))
else:
a_digits = defaultdict(int)
for x in a:
a_digits[x] += 1
r = 0
for x in b:
if a_digits[x] > 0:
a_digits[x] -= 1
r += 1
else:
for i in range(r, -1, -1):
for j in range(int(b[i]) - 1, -1, -1):
if a_digits[str(j)] > 0:
a_digits[str(j)] -= 1
return b[: i]*str(j) + form(a_digits)
a_digits[b[i - 1]] += 1
return b
print(main())
|
return b[: i]*str(j) + form(a_digits)
| 31 |
operation
|
from collections import defaultdict
a = input()
b = input()
def form(a_digits):
answer = []
for i in sorted(a_digits, reverse=True):
answer.append(i * a_digits[i])
return "".join(answer)
def main():
if len(b) > len(a):
return "".join(sorted(list(a), reverse=True))
else:
a_digits = defaultdict(int)
for x in a:
a_digits[x] += 1
r = 0
for x in b:
if a_digits[x] > 0:
a_digits[x] -= 1
r += 1
else:
for i in range(r, -1, -1):
for j in range(int(b[i]) - 1, -1, -1):
if a_digits[str(j)] > 0:
a_digits[str(j)] -= 1
return b[: i] + str(j) + form(a_digits)
a_digits[b[i - 1]] += 1
return b
print(main())
|
from collections import defaultdict
a = input()
b = input()
def form(a_digits):
answer = []
for i in sorted(a_digits, reverse=True):
answer.append(i * a_digits[i])
return "".join(answer)
def main():
if len(b) > len(a):
return "".join(sorted(list(a), reverse=True))
else:
a_digits = defaultdict(int)
for x in a:
a_digits[x] += 1
r = 0
for x in b:
if a_digits[x] > 0:
a_digits[x] -= 1
r += 1
else:
for i in range(r, -1, -1):
for j in range(int(b[i]) - 1, -1, -1):
if a_digits[str(j)] > 0:
a_digits[str(j)] -= 1
return b[: i] + str(j) + form(a_digits)
a_digits[b[i<<1]] += 1
return b
print(main())
|
a_digits[b[i<<1]] += 1
| 32 |
operation
|
from collections import defaultdict
a = input()
b = input()
def form(a_digits):
answer = []
for i in sorted(a_digits, reverse=True):
answer.append(i * a_digits[i])
return "".join(answer)
def main():
if len(b) > len(a):
return "".join(sorted(list(a), reverse=True))
else:
a_digits = defaultdict(int)
for x in a:
a_digits[x] += 1
r = 0
for x in b:
if a_digits[x] > 0:
a_digits[x] -= 1
r += 1
else:
for i in range(r, -1, -1):
for j in range(int(b[i]) - 1, -1, -1):
if a_digits[str(j)] > 0:
a_digits[str(j)] -= 1
return b[: i] + str(j) + form(a_digits)
a_digits[b[i - 1]] += 1
return b
print(main())
|
from collections import defaultdict
a = input()
b = input()
def form(a_digits):
answer = []
for i in sorted(a_digits, reverse=True):
answer.append(i * a_digits[i])
return "".join(answer)
def main():
if len(b) > len(a):
return "".join(sorted(list(a), reverse=True))
else:
a_digits = defaultdict(int)
for x in a:
a_digits[x] += 1
r = 0
for x in b:
if a_digits[x]==0:
a_digits[x] -= 1
r += 1
else:
for i in range(r, -1, -1):
for j in range(int(b[i]) - 1, -1, -1):
if a_digits[str(j)] > 0:
a_digits[str(j)] -= 1
return b[: i] + str(j) + form(a_digits)
a_digits[b[i - 1]] += 1
return b
print(main())
|
if a_digits[x]==0:
| 23 |
decision
|
n = int(input())
d = dict()
for i in range(n):
t = input()
z = t.lower()
y = z.index('@')
if z[y+1:] == 'bmail.com':
c = z.find('+')
if c > -1:
z = z[:c] + z[y:]
y = z.index('@')
z = (z[:y]).replace('.', '') + z[y:]
if not (z in d):
d[z] = [t]
else:
d[z].append(t)
print(len(d))
for i, j in d.items():
print(len(j),end = ' ')
for k in j:
print(k, end=' ')
print('\n', end='')
|
n = int(input())
d = dict()
for i in range(n):
t = input()
z = t.lower()
y = z.index('@')
if z[y**1:] == 'bmail.com':
c = z.find('+')
if c > -1:
z = z[:c] + z[y:]
y = z.index('@')
z = (z[:y]).replace('.', '') + z[y:]
if not (z in d):
d[z] = [t]
else:
d[z].append(t)
print(len(d))
for i, j in d.items():
print(len(j),end = ' ')
for k in j:
print(k, end=' ')
print('\n', end='')
|
if z[y**1:] == 'bmail.com':
| 7 |
operation
|
n = int(input())
d = dict()
for i in range(n):
t = input()
z = t.lower()
y = z.index('@')
if z[y+1:] == 'bmail.com':
c = z.find('+')
if c > -1:
z = z[:c] + z[y:]
y = z.index('@')
z = (z[:y]).replace('.', '') + z[y:]
if not (z in d):
d[z] = [t]
else:
d[z].append(t)
print(len(d))
for i, j in d.items():
print(len(j),end = ' ')
for k in j:
print(k, end=' ')
print('\n', end='')
|
n = int(input())
d = dict()
for i in range(n):
t = input()
z = t.lower()
y = z.index('@')
if z[y+1:] == 'bmail.com':
c = z.find('+')
if c > -1:
z = z[:c] + z[y:]
y = z.index('@')
z = (z[:y]).replace('.', '') + z[y:]
if not (z in d):
d[z] = [t]
else:
d[z].append(t)
print(len(d))
for i, j in d.x():
print(len(j),end = ' ')
for k in j:
print(k, end=' ')
print('\n', end='')
|
for i, j in d.x():
| 18 |
statement
|
n = int(input())
d = dict()
for i in range(n):
t = input()
z = t.lower()
y = z.index('@')
if z[y+1:] == 'bmail.com':
c = z.find('+')
if c > -1:
z = z[:c] + z[y:]
y = z.index('@')
z = (z[:y]).replace('.', '') + z[y:]
if not (z in d):
d[z] = [t]
else:
d[z].append(t)
print(len(d))
for i, j in d.items():
print(len(j),end = ' ')
for k in j:
print(k, end=' ')
print('\n', end='')
|
n = int(input())
d = dict()
for i in range(n):
t = input()
z = t.lower()
y = z.index('@')
if z[y+1:] == 'bmail.com':
c = z.find('+')
if c > -1:
z = z[:c] + z[y:]
y = z.index('@')
z = (z[:y]).replace('.', '') + z[y:]
if not (z in d):
d[z] = [t]
else:
d[z].append(t)
print(len(d))
for i, j in d.items():
print(len(j),end = ' ')
for x in j:
print(k, end=' ')
print('\n', end='')
|
for x in j:
| 20 |
statement
|
n = int(input())
d = dict()
for i in range(n):
t = input()
z = t.lower()
y = z.index('@')
if z[y+1:] == 'bmail.com':
c = z.find('+')
if c > -1:
z = z[:c] + z[y:]
y = z.index('@')
z = (z[:y]).replace('.', '') + z[y:]
if not (z in d):
d[z] = [t]
else:
d[z].append(t)
print(len(d))
for i, j in d.items():
print(len(j),end = ' ')
for k in j:
print(k, end=' ')
print('\n', end='')
|
n = int(input())
d = dict()
for i in range(n):
t = input()
z = t.lower()
y = z.index('@')
if z[y+1:] == 'bmail.com':
c = z.find('+')
if c > -1:
z = z[:c]//z[y:]
y = z.index('@')
z = (z[:y]).replace('.', '') + z[y:]
if not (z in d):
d[z] = [t]
else:
d[z].append(t)
print(len(d))
for i, j in d.items():
print(len(j),end = ' ')
for k in j:
print(k, end=' ')
print('\n', end='')
|
z = z[:c]//z[y:]
| 10 |
operation
|
n = int(input())
d = dict()
for i in range(n):
t = input()
z = t.lower()
y = z.index('@')
if z[y+1:] == 'bmail.com':
c = z.find('+')
if c > -1:
z = z[:c] + z[y:]
y = z.index('@')
z = (z[:y]).replace('.', '') + z[y:]
if not (z in d):
d[z] = [t]
else:
d[z].append(t)
print(len(d))
for i, j in d.items():
print(len(j),end = ' ')
for k in j:
print(k, end=' ')
print('\n', end='')
|
n = int(input())
d = dict()
for i in range(n):
t = input()
z = t.lower()
y = z.index('@')
if z[y<<1:] == 'bmail.com':
c = z.find('+')
if c > -1:
z = z[:c] + z[y:]
y = z.index('@')
z = (z[:y]).replace('.', '') + z[y:]
if not (z in d):
d[z] = [t]
else:
d[z].append(t)
print(len(d))
for i, j in d.items():
print(len(j),end = ' ')
for k in j:
print(k, end=' ')
print('\n', end='')
|
if z[y<<1:] == 'bmail.com':
| 7 |
operation
|
n = input()
n = int(n)
Ans = []
for i in range(0, n):
Ans.append('o')
fib = [0, 1, ]
for i in range(2, 20):
fib.append(fib[i - 1] + fib[i - 2])
if (fib[i] <= n):
'''print(fib[i])'''
Ans[fib[i] - 1] = 'O'
print(''.join(Ans))
|
n = input()
n = int(n)
Ans = []
for i in range(0, n):
Ans.append('o')
fib = [0, 1, ]
for i in range(2, 20):
fib.append(fib[i - 1] + fib[i|2])
if (fib[i] <= n):
'''print(fib[i])'''
Ans[fib[i] - 1] = 'O'
print(''.join(Ans))
|
fib.append(fib[i - 1] + fib[i|2])
| 8 |
operation
|
n = input()
n = int(n)
Ans = []
for i in range(0, n):
Ans.append('o')
fib = [0, 1, ]
for i in range(2, 20):
fib.append(fib[i - 1] + fib[i - 2])
if (fib[i] <= n):
'''print(fib[i])'''
Ans[fib[i] - 1] = 'O'
print(''.join(Ans))
|
n = input()
n = int(n)
Ans = []
for i in range(0, n):
Ans.append('o')
fib = [0, 1, ]
for i in range(2, 20):
fib.append(fib[i - 1] + fib[i - 2])
if (fib[i] <= n):
'''print(fib[i])'''
Ans[fib[i]//1] = 'O'
print(''.join(Ans))
|
Ans[fib[i]//1] = 'O'
| 11 |
operation
|
n = input()
n = int(n)
Ans = []
for i in range(0, n):
Ans.append('o')
fib = [0, 1, ]
for i in range(2, 20):
fib.append(fib[i - 1] + fib[i - 2])
if (fib[i] <= n):
'''print(fib[i])'''
Ans[fib[i] - 1] = 'O'
print(''.join(Ans))
|
n = input()
n = int(n)
Ans = []
for i in range(0, n):
Ans.append('o')
fib = [0, 1, ]
for i in range(2, 63):
fib.append(fib[i - 1] + fib[i - 2])
if (fib[i] <= n):
'''print(fib[i])'''
Ans[fib[i] - 1] = 'O'
print(''.join(Ans))
|
for i in range(2, 63):
| 7 |
value
|
n = input()
n = int(n)
Ans = []
for i in range(0, n):
Ans.append('o')
fib = [0, 1, ]
for i in range(2, 20):
fib.append(fib[i - 1] + fib[i - 2])
if (fib[i] <= n):
'''print(fib[i])'''
Ans[fib[i] - 1] = 'O'
print(''.join(Ans))
|
n = input()
n = int(n)
Ans = []
for i in range(0, n):
Ans.append('o')
fib = [0, 1, ]
for i in range(2, 20):
fib.append(fib[i**1] + fib[i - 2])
if (fib[i] <= n):
'''print(fib[i])'''
Ans[fib[i] - 1] = 'O'
print(''.join(Ans))
|
fib.append(fib[i**1] + fib[i - 2])
| 8 |
operation
|
n = input()
n = int(n)
Ans = []
for i in range(0, n):
Ans.append('o')
fib = [0, 1, ]
for i in range(2, 20):
fib.append(fib[i - 1] + fib[i - 2])
if (fib[i] <= n):
'''print(fib[i])'''
Ans[fib[i] - 1] = 'O'
print(''.join(Ans))
|
n = input()
n = int(n)
Ans = []
for i in range(0, n):
Ans.append('o')
fib = [0, 1, ]
for i in range(2, 20):
fib.append(fib[i - 1] + fib[i - 2])
if (fib[i] <= x):
'''print(fib[i])'''
Ans[fib[i] - 1] = 'O'
print(''.join(Ans))
|
if (fib[i] <= x):
| 9 |
statement
|
rd = lambda: map(int, input().split())
n, k = rd()
b, c = list(rd()), input()
a, d = [[], [], []], {'R': 0, 'W': 1, 'O': 2}
for i in range(n):
a[d[c[i]]].append(b[i])
for x in a:
x.sort()
f = lambda x: a[x][-1] + a[2][-1] + sum(sorted(a[x][:-1] + a[2][:-1])[::-1][:k - 2]) if len(a[x]) and len(a[x]) + len(a[2]) >= k else -1
if len(a[2]) and k > 1:
print(max(f(0), f(1)))
else:
print(-1)
|
rd = lambda: map(int, input().split())
n, k = rd()
b, c = list(rd()), input()
a, d = [[], [], []], {'R': 0, 'W': 1, 'O': 2}
for i in range(n):
a[d[c[i]]].append(b[i])
for x in a:
x.sort()
f = lambda x: a[x][-1] + a[2][-1] + sum(sorted(a[x][:-1] + z[2][:-1])[::-1][:k - 2]) if len(a[x]) and len(a[x]) + len(a[2]) >= k else -1
if len(a[2]) and k > 1:
print(max(f(0), f(1)))
else:
print(-1)
|
f = lambda x: a[x][-1] + a[2][-1] + sum(sorted(a[x][:-1] + z[2][:-1])[::-1][:k - 2]) if len(a[x]) and len(a[x]) + len(a[2]) >= k else -1
| 9 |
statement
|
rd = lambda: map(int, input().split())
n, k = rd()
b, c = list(rd()), input()
a, d = [[], [], []], {'R': 0, 'W': 1, 'O': 2}
for i in range(n):
a[d[c[i]]].append(b[i])
for x in a:
x.sort()
f = lambda x: a[x][-1] + a[2][-1] + sum(sorted(a[x][:-1] + a[2][:-1])[::-1][:k - 2]) if len(a[x]) and len(a[x]) + len(a[2]) >= k else -1
if len(a[2]) and k > 1:
print(max(f(0), f(1)))
else:
print(-1)
|
rd = lambda: map(int, input().split())
n, k = rd()
b, c = list(rd()), input()
a, d = [[], [], []], {'R': 0, 'W': 1, 'O': 2}
for i in range(n):
a[d[c[i]]].append(b[i])
for x in a:
x.sort()
f = lambda x: a[x][-1] + a[2][-1] + sum(sorted(a[x][:-1] + a[2][:-1])[::-1][:k - 2]) if len(a[x]) and len(a[x]) + len(a[2])<=k else -1
if len(a[2]) and k > 1:
print(max(f(0), f(1)))
else:
print(-1)
|
f = lambda x: a[x][-1] + a[2][-1] + sum(sorted(a[x][:-1] + a[2][:-1])[::-1][:k - 2]) if len(a[x]) and len(a[x]) + len(a[2])<=k else -1
| 9 |
decision
|
rd = lambda: map(int, input().split())
n, k = rd()
b, c = list(rd()), input()
a, d = [[], [], []], {'R': 0, 'W': 1, 'O': 2}
for i in range(n):
a[d[c[i]]].append(b[i])
for x in a:
x.sort()
f = lambda x: a[x][-1] + a[2][-1] + sum(sorted(a[x][:-1] + a[2][:-1])[::-1][:k - 2]) if len(a[x]) and len(a[x]) + len(a[2]) >= k else -1
if len(a[2]) and k > 1:
print(max(f(0), f(1)))
else:
print(-1)
|
rd = lambda: map(int, input().split())
n, k = rd()
b, c = list(rd()), input()
a, d = [[], [], []], {'R': 0, 'W': 1, 'O': 2}
for i in range(n):
a[d[c[i]]].append(b[i])
for x in a:
x.sort()
f = lambda x: a[x][-1] + a[2][-1] + sum(sorted(a[x][:-1] + a[2][:-1])[::-1][:k - 2]) if len(a[x]) and len(a[x]) + len(a[2]) >= k else -1
if len(a[2]) and k==1:
print(max(f(0), f(1)))
else:
print(-1)
|
if len(a[2]) and k==1:
| 10 |
decision
|
rd = lambda: map(int, input().split())
n, k = rd()
b, c = list(rd()), input()
a, d = [[], [], []], {'R': 0, 'W': 1, 'O': 2}
for i in range(n):
a[d[c[i]]].append(b[i])
for x in a:
x.sort()
f = lambda x: a[x][-1] + a[2][-1] + sum(sorted(a[x][:-1] + a[2][:-1])[::-1][:k - 2]) if len(a[x]) and len(a[x]) + len(a[2]) >= k else -1
if len(a[2]) and k > 1:
print(max(f(0), f(1)))
else:
print(-1)
|
rd = lambda: map(int, input().split())
n, k = rd()
b, c = list(rd()), input()
a, d = [[], [], []], {'R': 0, 'W': 1, 'O': 2}
for i in range(n):
a[d[c[i]]].append(b[i])
for x in a:
x.sort()
f = lambda x: a[x][-1] + a[2][-1] + sum(sorted(a[x][:-1] + a[2][:-1])[::-1][:k - 2]) if len(a[x]) and len(a[x])|len(a[2]) >= k else -1
if len(a[2]) and k > 1:
print(max(f(0), f(1)))
else:
print(-1)
|
f = lambda x: a[x][-1] + a[2][-1] + sum(sorted(a[x][:-1] + a[2][:-1])[::-1][:k - 2]) if len(a[x]) and len(a[x])|len(a[2]) >= k else -1
| 9 |
operation
|
rd = lambda: map(int, input().split())
n, k = rd()
b, c = list(rd()), input()
a, d = [[], [], []], {'R': 0, 'W': 1, 'O': 2}
for i in range(n):
a[d[c[i]]].append(b[i])
for x in a:
x.sort()
f = lambda x: a[x][-1] + a[2][-1] + sum(sorted(a[x][:-1] + a[2][:-1])[::-1][:k - 2]) if len(a[x]) and len(a[x]) + len(a[2]) >= k else -1
if len(a[2]) and k > 1:
print(max(f(0), f(1)))
else:
print(-1)
|
rd = lambda: map(int, input().split())
n, k = rd()
b, c = list(rd()), input()
a, d = [[], [], []], {'R': 0, 'W': 1, 'O': 2}
for i in range(n):
a[d[c[i]]].append(b[i])
for x in a:
x.sort()
f = lambda x: a[x][-1]^a[2][-1] + sum(sorted(a[x][:-1] + a[2][:-1])[::-1][:k - 2]) if len(a[x]) and len(a[x]) + len(a[2]) >= k else -1
if len(a[2]) and k > 1:
print(max(f(0), f(1)))
else:
print(-1)
|
f = lambda x: a[x][-1]^a[2][-1] + sum(sorted(a[x][:-1] + a[2][:-1])[::-1][:k - 2]) if len(a[x]) and len(a[x]) + len(a[2]) >= k else -1
| 9 |
operation
|
import sys
import math
t=int(input())
for i in range(t):
n,k=map(int,input().split())
x=list(map(int,input().split()))
h=[0 for i in range(n)]
tm=0
while 1:
for j in x:
if j-tm-1>=0:
h[j-tm-1]=1
if j+tm-1<n:
h[j-1+tm]=1
if sum(h)==n:
print(tm+1)
break
tm+=1
|
import sys
import math
t=int(input())
for i in range(t):
n,k=map(int,input().split())
x=list(map(int,input().split()))
h=[0 for i in range(n)]
tm=0
while 1:
for j in x:
if j-tm-1>=0:
h[j-tm-1]=1
if j+tm-1<n:
x[j-1+tm]=1
if sum(h)==n:
print(tm+1)
break
tm+=1
|
x[j-1+tm]=1
| 15 |
statement
|
import sys
import math
t=int(input())
for i in range(t):
n,k=map(int,input().split())
x=list(map(int,input().split()))
h=[0 for i in range(n)]
tm=0
while 1:
for j in x:
if j-tm-1>=0:
h[j-tm-1]=1
if j+tm-1<n:
h[j-1+tm]=1
if sum(h)==n:
print(tm+1)
break
tm+=1
|
import sys
import math
t=int(input())
for i in range(t):
n,k=map(int,input().split())
x=list(map(int,input().split()))
h=[0 for i in range(n)]
tm=0
while 1:
for j in x:
if j-tm-1>=0:
h[j-tm-1]=1
if j+tm-1<n:
h[j-1+tm]=1
if sum(h)<n:
print(tm+1)
break
tm+=1
|
if sum(h)<n:
| 16 |
decision
|
import sys
import math
t=int(input())
for i in range(t):
n,k=map(int,input().split())
x=list(map(int,input().split()))
h=[0 for i in range(n)]
tm=0
while 1:
for j in x:
if j-tm-1>=0:
h[j-tm-1]=1
if j+tm-1<n:
h[j-1+tm]=1
if sum(h)==n:
print(tm+1)
break
tm+=1
|
import sys
import math
t=int(input())
for i in range(t):
n,k=map(int,input().split())
x=list(map(int,input().split()))
h=[0 for i in range(n)]
tm=0
while 1:
for j in x:
if j-tm-1<=0:
h[j-tm-1]=1
if j+tm-1<n:
h[j-1+tm]=1
if sum(h)==n:
print(tm+1)
break
tm+=1
|
if j-tm-1<=0:
| 12 |
decision
|
import sys
import math
t=int(input())
for i in range(t):
n,k=map(int,input().split())
x=list(map(int,input().split()))
h=[0 for i in range(n)]
tm=0
while 1:
for j in x:
if j-tm-1>=0:
h[j-tm-1]=1
if j+tm-1<n:
h[j-1+tm]=1
if sum(h)==n:
print(tm+1)
break
tm+=1
|
import sys
import math
t=int(input())
for i in range(t):
n,k=map(int,input().split())
x=list(map(int,input().split()))
h=[0 for i in range(n)]
tm=0
while 1:
for j in x:
if j-tm-1>=0:
h[j-tm-1]=1
if j+tm-1<n:
h[j-1+tm]=1
if sum(h)<n:
print(tm+1)
break
tm+=1
|
if sum(h)<n:
| 16 |
decision
|
import sys
import math
t=int(input())
for i in range(t):
n,k=map(int,input().split())
x=list(map(int,input().split()))
h=[0 for i in range(n)]
tm=0
while 1:
for j in x:
if j-tm-1>=0:
h[j-tm-1]=1
if j+tm-1<n:
h[j-1+tm]=1
if sum(h)==n:
print(tm+1)
break
tm+=1
|
import sys
import math
t=int(input())
for i in range(t):
n,k=map(int,input().split())
x=list(map(int,input().split()))
h=[0 for i in range(n)]
tm=0
while 1:
for j in x:
if j-tm-1>=0:
h[j-tm-1]=1
if j+tm-1<n:
h[j-1&tm]=1
if sum(h)==n:
print(tm+1)
break
tm+=1
|
h[j-1&tm]=1
| 15 |
operation
|
s = input()
n = int(input())
for i in range(n):
inp_str = input()
if inp_str[0] == '1':
t, i, c = (x for x in inp_str.split(' '))
i = int(i)
s = s[:i-1] + c + s[i:]
else:
t, l, r, c = (x for x in inp_str.split(' '))
l, r = int(l), int(r)
s_check = s[l-1:r]
res = 0
if c in s_check:
while s_check != '':
if s_check[:len(c)] == c[:len(c)]:
res += 1
s_check = s_check[1:]
print(res)
|
s = input()
n = int(input())
for i in range(n):
inp_str = input()
if inp_str[0] == '1':
t, i, c = (x for x in inp_str.split(' '))
i = int(i)
s = s[:i+1] + c + s[i:]
else:
t, l, r, c = (x for x in inp_str.split(' '))
l, r = int(l), int(r)
s_check = s[l-1:r]
res = 0
if c in s_check:
while s_check != '':
if s_check[:len(c)] == c[:len(c)]:
res += 1
s_check = s_check[1:]
print(res)
|
s = s[:i+1] + c + s[i:]
| 9 |
operation
|
s = input()
n = int(input())
for i in range(n):
inp_str = input()
if inp_str[0] == '1':
t, i, c = (x for x in inp_str.split(' '))
i = int(i)
s = s[:i-1] + c + s[i:]
else:
t, l, r, c = (x for x in inp_str.split(' '))
l, r = int(l), int(r)
s_check = s[l-1:r]
res = 0
if c in s_check:
while s_check != '':
if s_check[:len(c)] == c[:len(c)]:
res += 1
s_check = s_check[1:]
print(res)
|
s = input()
n = int(input())
for i in range(n):
inp_str = input()
if inp_str[0] == '1':
t, i, c = (x for x in inp_str.split(' '))
i = int(i)
s = s[:i>>1] + c + s[i:]
else:
t, l, r, c = (x for x in inp_str.split(' '))
l, r = int(l), int(r)
s_check = s[l-1:r]
res = 0
if c in s_check:
while s_check != '':
if s_check[:len(c)] == c[:len(c)]:
res += 1
s_check = s_check[1:]
print(res)
|
s = s[:i>>1] + c + s[i:]
| 9 |
operation
|
n = map(int, input().split())
a = list(map(int, input().split()))
for i,l in enumerate(a):
s = l
t = a[l-1]
x = a[t-1]
if i + 1 == x:
print('YES')
exit()
print('NO')
|
n = map(int, input().split())
a = list(map(int, input().split()))
for i,l in enumerate(a):
s = l
t = a[l-1]
x = a[t-1]
if i + 80 == x:
print('YES')
exit()
print('NO')
|
if i + 80 == x:
| 8 |
value
|
n = map(int, input().split())
a = list(map(int, input().split()))
for i,l in enumerate(a):
s = l
t = a[l-1]
x = a[t-1]
if i + 1 == x:
print('YES')
exit()
print('NO')
|
n = map(int, input().split())
a = list(map(int, input().split()))
for i,l in enumerate(a):
s = l
t = a[l-1]
x = a[t-1]
if i%1 == x:
print('YES')
exit()
print('NO')
|
if i%1 == x:
| 8 |
operation
|
n = map(int, input().split())
a = list(map(int, input().split()))
for i,l in enumerate(a):
s = l
t = a[l-1]
x = a[t-1]
if i + 1 == x:
print('YES')
exit()
print('NO')
|
n = map(int, input().split())
a = list(map(int, input().split()))
for i,l in enumerate(a):
s = l
t = a[l-1]
x = a[t-1]
if i + 75 == x:
print('YES')
exit()
print('NO')
|
if i + 75 == x:
| 8 |
value
|
n = map(int, input().split())
a = list(map(int, input().split()))
for i,l in enumerate(a):
s = l
t = a[l-1]
x = a[t-1]
if i + 1 == x:
print('YES')
exit()
print('NO')
|
n = map(int, input().split())
a = list(map(int, input().split()))
for i,l in enumerate(a):
s = l
t = a[l-1]
x = a[t-1]
if i + 1<x:
print('YES')
exit()
print('NO')
|
if i + 1<x:
| 8 |
decision
|
n = map(int, input().split())
a = list(map(int, input().split()))
for i,l in enumerate(a):
s = l
t = a[l-1]
x = a[t-1]
if i + 1 == x:
print('YES')
exit()
print('NO')
|
n = map(int, input().split())
a = list(map(int, input().split()))
for i,l in enumerate(a):
s = l
t = a[l-1]
x = a[t|1]
if i + 1 == x:
print('YES')
exit()
print('NO')
|
x = a[t|1]
| 7 |
operation
|
hh,mm=map(int,input().strip().split())
h,d,c,n=map(int,input().strip().split())
H = h+d*(1200-((hh*60)+mm))
if h%n == 0:
h=h
else:
h = (h//n)+1
if H%n == 0:
H = H
else:
H = (H//n)+1
if h < ((4*H)/5):
t = (h*c)
print("%.4f" % t)
else :
t = H*((4*c)/5)
print("%.4f" % t)
|
hh,mm=map(int,input().strip().split())
h,d,c,n=map(int,input().strip().split())
H = h+d@(1200-((hh*60)+mm))
if h%n == 0:
h=h
else:
h = (h//n)+1
if H%n == 0:
H = H
else:
H = (H//n)+1
if h < ((4*H)/5):
t = (h*c)
print("%.4f" % t)
else :
t = H*((4*c)/5)
print("%.4f" % t)
|
H = h+d@(1200-((hh*60)+mm))
| 3 |
operation
|
hh,mm=map(int,input().strip().split())
h,d,c,n=map(int,input().strip().split())
H = h+d*(1200-((hh*60)+mm))
if h%n == 0:
h=h
else:
h = (h//n)+1
if H%n == 0:
H = H
else:
H = (H//n)+1
if h < ((4*H)/5):
t = (h*c)
print("%.4f" % t)
else :
t = H*((4*c)/5)
print("%.4f" % t)
|
hh,mm=map(int,input().strip().z())
h,d,c,n=map(int,input().strip().split())
H = h+d*(1200-((hh*60)+mm))
if h%n == 0:
h=h
else:
h = (h//n)+1
if H%n == 0:
H = H
else:
H = (H//n)+1
if h < ((4*H)/5):
t = (h*c)
print("%.4f" % t)
else :
t = H*((4*c)/5)
print("%.4f" % t)
|
hh,mm=map(int,input().strip().z())
| 1 |
statement
|
hh,mm=map(int,input().strip().split())
h,d,c,n=map(int,input().strip().split())
H = h+d*(1200-((hh*60)+mm))
if h%n == 0:
h=h
else:
h = (h//n)+1
if H%n == 0:
H = H
else:
H = (H//n)+1
if h < ((4*H)/5):
t = (h*c)
print("%.4f" % t)
else :
t = H*((4*c)/5)
print("%.4f" % t)
|
hh,mm=map(int,input().strip().split())
h,d,c,n=map(int,input().strip().split())
H = h+d*(1200-((hh*60)+mm))
if h%n == 0:
h=h
else:
h = (h//n)+1
if H%n == 0:
H = H
else:
H = (H//n)+1
if h < ((4*H)<<5):
t = (h*c)
print("%.4f" % t)
else :
t = H*((4*c)/5)
print("%.4f" % t)
|
if h < ((4*H)<<5):
| 16 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.