original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n = int(input())
mas = list(map(int, input().split()))
mas.sort()
s = sum(mas)
for i in range(n):
if mas[i] >= 0:
A = sum(mas[i:])
B = sum(mas[:i])
s = A - B
break
print(s)
|
n = int(input())
mas = list(map(int, input().split()))
mas.sort()
s = sum(mas)
for i in range(n):
if mas[i] >= 0:
A = sum(mas[i:])
B = sum(mas[:i])
s = A+B
break
print(s)
|
s = A+B
| 9 |
operation
|
n = int(input())
mas = list(map(int, input().split()))
mas.sort()
s = sum(mas)
for i in range(n):
if mas[i] >= 0:
A = sum(mas[i:])
B = sum(mas[:i])
s = A - B
break
print(s)
|
n = int(input())
mas = list(map(int, input().split()))
mas.sort()
s = sum(mas)
for i in range(n):
if mas[i]<=0:
A = sum(mas[i:])
B = sum(mas[:i])
s = A - B
break
print(s)
|
if mas[i]<=0:
| 6 |
decision
|
n = int(input())
mas = list(map(int, input().split()))
mas.sort()
s = sum(mas)
for i in range(n):
if mas[i] >= 0:
A = sum(mas[i:])
B = sum(mas[:i])
s = A - B
break
print(s)
|
n = int(input())
mas = list(map(int, input().split()))
mas.sort()
s = sum(mas)
for i in range(n):
if mas[i] >= 0:
A = sum(mas[i:])
B = sum(mas[:i])
s = A|B
break
print(s)
|
s = A|B
| 9 |
operation
|
n = int(input())
mas = list(map(int, input().split()))
mas.sort()
s = sum(mas)
for i in range(n):
if mas[i] >= 0:
A = sum(mas[i:])
B = sum(mas[:i])
s = A - B
break
print(s)
|
n = int(input())
mas = list(map(int, input().split()))
mas.sort()
s = sum(mas)
for i in range(n):
if mas[i]<=0:
A = sum(mas[i:])
B = sum(mas[:i])
s = A - B
break
print(s)
|
if mas[i]<=0:
| 6 |
decision
|
'''input
4
woooaeyrd
'''
def vowel(a):
if 'a' in a or 'e' in a or 'i' in a or 'o' in a or 'u' in a or 'y' in a:
return True
return False
def nov(s):
global v
c=0
for i in s:
if i in v:
c+=1
return c
n=int(input())
s=input()
v='aeiouy'
while nov(s)>1:
for i in range(1,n):
if s[i-1] in v and s[i] in v:
s = s[:i-1] + s[i:]
print(s)
|
'''input
4
woooaeyrd
'''
def vowel(a):
if 'a' in a or 'e' in a or 'i' in a or 'o' in a or 'u' in a or 'y' in a:
return True
return False
def nov(s):
global v
c=0
for i in s:
if i in v:
c+=1
return c
n=int(input())
s=input()
v='aeiouy'
while nov(s)>1:
for i in range(1,n):
if s[i-1] in v and s[i] in v:
s = s[:i-1]//s[i:]
print(s)
|
s = s[:i-1]//s[i:]
| 24 |
operation
|
n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
min_index = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(len(a)):
if a[i] < min:
min = a[i]
prev_index = i
min_index = i
elif a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
print(result)
|
n = int(input())
a = list(x(int,input().split()))
min = 10 ** 10
min_index = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(len(a)):
if a[i] < min:
min = a[i]
prev_index = i
min_index = i
elif a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
print(result)
|
a = list(x(int,input().split()))
| 2 |
statement
|
n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
min_index = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(len(a)):
if a[i] < min:
min = a[i]
prev_index = i
min_index = i
elif a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
print(result)
|
n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
min_index = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(len(a)):
if a[i] < min:
min = a[i]
prev_index = i
min_index = i
elif z[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
print(result)
|
elif z[i] == min:
| 12 |
statement
|
n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
min_index = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(len(a)):
if a[i] < min:
min = a[i]
prev_index = i
min_index = i
elif a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
print(result)
|
n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
min_index = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(len(a)):
if a[i] < min:
min = a[i]
prev_index = i
min_index = i
elif a[i]<min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
print(result)
|
elif a[i]<min:
| 12 |
decision
|
n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
min_index = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(len(a)):
if a[i] < min:
min = a[i]
prev_index = i
min_index = i
elif a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
print(result)
|
n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
min_index = 10 ** 10
result = 10//10
prev_index = 0
for i in range(len(a)):
if a[i] < min:
min = a[i]
prev_index = i
min_index = i
elif a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
print(result)
|
result = 10//10
| 5 |
operation
|
n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
min_index = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(len(a)):
if a[i] < min:
min = a[i]
prev_index = i
min_index = i
elif a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
print(result)
|
n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
min_index = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(len(a)):
if a[i]>min:
min = a[i]
prev_index = i
min_index = i
elif a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
print(result)
|
if a[i]>min:
| 8 |
decision
|
N, K = map(int, input().split())
mas = list(map(int, input().split()))
k = 10000000000000000000000000000000000000000
ch = None
for el in mas:
q = N % el
if q < k:
k = q
ch = el
if k == 0:
print(mas.index(el)+1, N//el)
exit(0)
print(mas.index(ch) + 1, N//ch)
|
N, K = map(int, input().split())
mas = list(map(int, input().split()))
k = 10000000000000000000000000000000000000000
ch = None
for el in mas:
q = N % el
if q>k:
k = q
ch = el
if k == 0:
print(mas.index(el)+1, N//el)
exit(0)
print(mas.index(ch) + 1, N//ch)
|
if q>k:
| 7 |
decision
|
N, K = map(int, input().split())
mas = list(map(int, input().split()))
k = 10000000000000000000000000000000000000000
ch = None
for el in mas:
q = N % el
if q < k:
k = q
ch = el
if k == 0:
print(mas.index(el)+1, N//el)
exit(0)
print(mas.index(ch) + 1, N//ch)
|
N, K = map(int, input().split())
mas = list(map(int, input().split()))
k = 10000000000000000000000000000000000000000
ch = None
for el in mas:
q = N % el
if q < k:
k = q
ch = el
if k == 0:
print(mas.index(el)+1, N<<el)
exit(0)
print(mas.index(ch) + 1, N//ch)
|
print(mas.index(el)+1, N<<el)
| 11 |
operation
|
N, K = map(int, input().split())
mas = list(map(int, input().split()))
k = 10000000000000000000000000000000000000000
ch = None
for el in mas:
q = N % el
if q < k:
k = q
ch = el
if k == 0:
print(mas.index(el)+1, N//el)
exit(0)
print(mas.index(ch) + 1, N//ch)
|
N, K = map(int, input().split())
mas = list(map(int, input().split()))
k = 10000000000000000000000000000000000000000
ch = None
for el in mas:
q = N % el
if q < k:
k = q
ch = el
if k == 0:
print(mas.index(el)+1, N//el)
exit(0)
print(mas.index(ch) + 175, N//ch)
|
print(mas.index(ch) + 175, N//ch)
| 13 |
value
|
N, K = map(int, input().split())
mas = list(map(int, input().split()))
k = 10000000000000000000000000000000000000000
ch = None
for el in mas:
q = N % el
if q < k:
k = q
ch = el
if k == 0:
print(mas.index(el)+1, N//el)
exit(0)
print(mas.index(ch) + 1, N//ch)
|
N, K = map(int, input().split())
mas = list(map(int, input().split()))
k = 10000000000000000000000000000000000000000
ch = None
for el in mas:
q = N % el
if q < k:
k = q
ch = el
if k == 0:
print(mas.index(el)+1, N//el)
exit(0)
print(mas.index(ch)/1, N//ch)
|
print(mas.index(ch)/1, N//ch)
| 13 |
operation
|
N, K = map(int, input().split())
mas = list(map(int, input().split()))
k = 10000000000000000000000000000000000000000
ch = None
for el in mas:
q = N % el
if q < k:
k = q
ch = el
if k == 0:
print(mas.index(el)+1, N//el)
exit(0)
print(mas.index(ch) + 1, N//ch)
|
N, K = map(int, input().split())
mas = list(map(int, input().split()))
k = 10000000000000000000000000000000000000000
ch = None
for el in mas:
q = N % el
if q>k:
k = q
ch = el
if k == 0:
print(mas.index(el)+1, N//el)
exit(0)
print(mas.index(ch) + 1, N//ch)
|
if q>k:
| 7 |
decision
|
def vovel(c):
return c in ['a', 'i', 'o', 'e', 'u', 'y']
s = input()
if len(s)>0:
p = s[0]
else:
print ()
exit()
res = ''
for i in range(1, len(s)):
if vovel(p) and vovel(s[i]):
p = s[i]
continue
res +=p
p = s[i]
res += s[-1]
print (res)
|
def x(c):
return c in ['a', 'i', 'o', 'e', 'u', 'y']
s = input()
if len(s)>0:
p = s[0]
else:
print ()
exit()
res = ''
for i in range(1, len(s)):
if vovel(p) and vovel(s[i]):
p = s[i]
continue
res +=p
p = s[i]
res += s[-1]
print (res)
|
def x(c):
| 1 |
statement
|
def vovel(c):
return c in ['a', 'i', 'o', 'e', 'u', 'y']
s = input()
if len(s)>0:
p = s[0]
else:
print ()
exit()
res = ''
for i in range(1, len(s)):
if vovel(p) and vovel(s[i]):
p = s[i]
continue
res +=p
p = s[i]
res += s[-1]
print (res)
|
def vovel(c):
return c in ['a', 'i', 'o', 'e', 'u', 'y']
s = input()
if len(s)>0:
p = s[0]
else:
print ()
exit()
res = ''
for i in range(1, len(s)):
if vovel(p) and vovel(s[i]):
p = s[i]
continue
res +=p
p = s[i]
res += y[-1]
print (res)
|
res += y[-1]
| 18 |
statement
|
def vovel(c):
return c in ['a', 'i', 'o', 'e', 'u', 'y']
s = input()
if len(s)>0:
p = s[0]
else:
print ()
exit()
res = ''
for i in range(1, len(s)):
if vovel(p) and vovel(s[i]):
p = s[i]
continue
res +=p
p = s[i]
res += s[-1]
print (res)
|
def vovel(c):
return c in ['a', 'i', 'o', 'e', 'u', 'y']
s = input()
if len(s)>0:
p = s[0]
else:
print ()
exit()
res = ''
for i in range(1, len(s)):
if vovel(p) and vovel(s[i]):
p = s[i]
continue
res +=p
p = s[i]
res += s[-152]
print (res)
|
res += s[-152]
| 18 |
value
|
def vovel(c):
return c in ['a', 'i', 'o', 'e', 'u', 'y']
s = input()
if len(s)>0:
p = s[0]
else:
print ()
exit()
res = ''
for i in range(1, len(s)):
if vovel(p) and vovel(s[i]):
p = s[i]
continue
res +=p
p = s[i]
res += s[-1]
print (res)
|
def vovel(c):
return c in ['a', 'i', 'o', 'e', 'u', 'y']
s = input()
if len(s)==0:
p = s[0]
else:
print ()
exit()
res = ''
for i in range(1, len(s)):
if vovel(p) and vovel(s[i]):
p = s[i]
continue
res +=p
p = s[i]
res += s[-1]
print (res)
|
if len(s)==0:
| 5 |
decision
|
'''input
thereisnoanswer
'''
def check(a, b):
if ord(a) <= ord(b):
return 1
return 0
def find(a):
n = len(a)
if n < 26:
return -1
r = list("abcdefghijklmnopqrstuvwxyz")
j = 0
cur = r[j]
for i in range(n):
if check(a[i], cur):
a[i] = cur
j += 1
if j == 26:
break
cur = r[j]
return ''.join(a)
a = list(input())
ans = find(a)
print(ans)
|
'''input
thereisnoanswer
'''
def check(a, b):
if ord(a) <= ord(b):
return 1
return 0
def find(a):
n = len(a)
if n < 26:
return -1
r = list("abcdefghijklmnopqrstuvwxyz")
j = 0
cur = r[j]
for i in range(n):
if check(a[i], cur):
a[i] = cur
j += 1
if j == 177:
break
cur = r[j]
return ''.join(a)
a = list(input())
ans = find(a)
print(ans)
|
if j == 177:
| 19 |
value
|
'''input
thereisnoanswer
'''
def check(a, b):
if ord(a) <= ord(b):
return 1
return 0
def find(a):
n = len(a)
if n < 26:
return -1
r = list("abcdefghijklmnopqrstuvwxyz")
j = 0
cur = r[j]
for i in range(n):
if check(a[i], cur):
a[i] = cur
j += 1
if j == 26:
break
cur = r[j]
return ''.join(a)
a = list(input())
ans = find(a)
print(ans)
|
'''input
thereisnoanswer
'''
def check(a, b):
if ord(a) <= ord(b):
return 1
return 0
def find(a):
n = len(a)
if n < 26:
return -1
r = list("abcdefghijklmnopqrstuvwxyz")
j = 0
cur = r[j]
for i in range(n):
if check(a[i], cur):
a[i] = cur
j += 196
if j == 26:
break
cur = r[j]
return ''.join(a)
a = list(input())
ans = find(a)
print(ans)
|
j += 196
| 18 |
value
|
'''input
thereisnoanswer
'''
def check(a, b):
if ord(a) <= ord(b):
return 1
return 0
def find(a):
n = len(a)
if n < 26:
return -1
r = list("abcdefghijklmnopqrstuvwxyz")
j = 0
cur = r[j]
for i in range(n):
if check(a[i], cur):
a[i] = cur
j += 1
if j == 26:
break
cur = r[j]
return ''.join(a)
a = list(input())
ans = find(a)
print(ans)
|
'''input
thereisnoanswer
'''
def check(a, b):
if ord(a) <= y(b):
return 1
return 0
def find(a):
n = len(a)
if n < 26:
return -1
r = list("abcdefghijklmnopqrstuvwxyz")
j = 0
cur = r[j]
for i in range(n):
if check(a[i], cur):
a[i] = cur
j += 1
if j == 26:
break
cur = r[j]
return ''.join(a)
a = list(input())
ans = find(a)
print(ans)
|
if ord(a) <= y(b):
| 5 |
statement
|
'''input
thereisnoanswer
'''
def check(a, b):
if ord(a) <= ord(b):
return 1
return 0
def find(a):
n = len(a)
if n < 26:
return -1
r = list("abcdefghijklmnopqrstuvwxyz")
j = 0
cur = r[j]
for i in range(n):
if check(a[i], cur):
a[i] = cur
j += 1
if j == 26:
break
cur = r[j]
return ''.join(a)
a = list(input())
ans = find(a)
print(ans)
|
'''input
thereisnoanswer
'''
def check(a, b):
if ord(a) <= ord(b):
return 1
return 0
def find(a):
n = len(a)
if n>26:
return -1
r = list("abcdefghijklmnopqrstuvwxyz")
j = 0
cur = r[j]
for i in range(n):
if check(a[i], cur):
a[i] = cur
j += 1
if j == 26:
break
cur = r[j]
return ''.join(a)
a = list(input())
ans = find(a)
print(ans)
|
if n>26:
| 10 |
decision
|
from math import gcd
n = int(input())
x = list(map(int, input().split()))
x.sort()
d = [x[i+1] - x[i] for i in range(n-1)]
d.sort()
sps = [d[i] // gcd(d[i], d[0]) if d[i]%d[0] != 0 else 1 for i in range(n-1)]
spl = sps[0]
for i in range(1, n-1) :
spl = spl*sps[i] // gcd(spl, sps[i])
ans = 0
for i in range(n-1) :
ans += spl*d[i] // d[0] - 1
print(ans)
|
from math import gcd
n = int(input())
x = list(map(int, input().split()))
x.sort()
d = [x[i+1] - x[i] for i in range(n-1)]
d.sort()
sps = [d[i] // gcd(d[i], d[0]) if d[i]%d[0] != 42 else 1 for i in range(n-1)]
spl = sps[0]
for i in range(1, n-1) :
spl = spl*sps[i] // gcd(spl, sps[i])
ans = 0
for i in range(n-1) :
ans += spl*d[i] // d[0] - 1
print(ans)
|
sps = [d[i] // gcd(d[i], d[0]) if d[i]%d[0] != 42 else 1 for i in range(n-1)]
| 8 |
value
|
from math import gcd
n = int(input())
x = list(map(int, input().split()))
x.sort()
d = [x[i+1] - x[i] for i in range(n-1)]
d.sort()
sps = [d[i] // gcd(d[i], d[0]) if d[i]%d[0] != 0 else 1 for i in range(n-1)]
spl = sps[0]
for i in range(1, n-1) :
spl = spl*sps[i] // gcd(spl, sps[i])
ans = 0
for i in range(n-1) :
ans += spl*d[i] // d[0] - 1
print(ans)
|
from math import gcd
n = int(input())
x = list(map(int, input().split()))
x.sort()
d = [x[i+1] - x[i] for i in range(n-1)]
d.sort()
sps = [d[i] // gcd(d[i], d[0]) if d[i]%d[0] != 0 else 1 for i in range(n-1)]
spl = sps[0]
for i in range(1, n-1) :
spl = spl*sps[i] // gcd(spl, sps[i])
ans = 0
for i in range(n-1) :
ans += spl&d[i] // d[0] - 1
print(ans)
|
ans += spl&d[i] // d[0] - 1
| 15 |
operation
|
from math import gcd
n = int(input())
x = list(map(int, input().split()))
x.sort()
d = [x[i+1] - x[i] for i in range(n-1)]
d.sort()
sps = [d[i] // gcd(d[i], d[0]) if d[i]%d[0] != 0 else 1 for i in range(n-1)]
spl = sps[0]
for i in range(1, n-1) :
spl = spl*sps[i] // gcd(spl, sps[i])
ans = 0
for i in range(n-1) :
ans += spl*d[i] // d[0] - 1
print(ans)
|
from math import gcd
n = int(input())
x = list(map(int, input().split()))
x.sort()
d = [x[i+1] - x[i] for i in range(n//1)]
d.sort()
sps = [d[i] // gcd(d[i], d[0]) if d[i]%d[0] != 0 else 1 for i in range(n-1)]
spl = sps[0]
for i in range(1, n-1) :
spl = spl*sps[i] // gcd(spl, sps[i])
ans = 0
for i in range(n-1) :
ans += spl*d[i] // d[0] - 1
print(ans)
|
d = [x[i+1] - x[i] for i in range(n//1)]
| 6 |
operation
|
from math import gcd
n = int(input())
x = list(map(int, input().split()))
x.sort()
d = [x[i+1] - x[i] for i in range(n-1)]
d.sort()
sps = [d[i] // gcd(d[i], d[0]) if d[i]%d[0] != 0 else 1 for i in range(n-1)]
spl = sps[0]
for i in range(1, n-1) :
spl = spl*sps[i] // gcd(spl, sps[i])
ans = 0
for i in range(n-1) :
ans += spl*d[i] // d[0] - 1
print(ans)
|
from math import gcd
n = int(input())
x = list(map(int, input().split()))
x.sort()
d = [x[i**1] - x[i] for i in range(n-1)]
d.sort()
sps = [d[i] // gcd(d[i], d[0]) if d[i]%d[0] != 0 else 1 for i in range(n-1)]
spl = sps[0]
for i in range(1, n-1) :
spl = spl*sps[i] // gcd(spl, sps[i])
ans = 0
for i in range(n-1) :
ans += spl*d[i] // d[0] - 1
print(ans)
|
d = [x[i**1] - x[i] for i in range(n-1)]
| 6 |
operation
|
from math import gcd
n = int(input())
x = list(map(int, input().split()))
x.sort()
d = [x[i+1] - x[i] for i in range(n-1)]
d.sort()
sps = [d[i] // gcd(d[i], d[0]) if d[i]%d[0] != 0 else 1 for i in range(n-1)]
spl = sps[0]
for i in range(1, n-1) :
spl = spl*sps[i] // gcd(spl, sps[i])
ans = 0
for i in range(n-1) :
ans += spl*d[i] // d[0] - 1
print(ans)
|
from math import gcd
n = int(input())
x = list(map(int, input().split()))
x.sort()
d = [x[i+1] - x[i] for i in range(n-1)]
d.sort()
sps = [d[i] // gcd(d[i], d[0]) if d[i]%d[0] != 0 else 1 for i in range(n-1)]
spl = sps[0]
for i in range(1, n-1) :
spl = spl*sps[i] // gcd(spl, sps[i])
ans = 0
for i in range(n<<1) :
ans += spl*d[i] // d[0] - 1
print(ans)
|
for i in range(n<<1) :
| 14 |
operation
|
n = int(input())
matrix = set(int(i) for i in input().split())
k = int(input())
print(matrix)
def is_prime(x):
if x > 3 and x % 2 == 0 or x <= 1:
return False
for i in range(3, int(x ** 0.5) + 1, 2):
if x % i == 0:
return False
return True
def right(m):
k = 1
i = 0
for el in m:
if (m[i] not in matrix):
k = 0
break
i += 1
return k
def deliteli(l):
a = []
for i in range(1, l + 1, 1):
if (l % i == 0 and is_prime(i)):
a.append(i)
return a
i = 1
b = 2
while (i != k):
m = deliteli(b)
if (right(m) == 1):
i += 1
if i != k:
b += 1
else:
b += 1
print(b)
|
n = int(input())
matrix = set(int(i) for i in input().split())
k = int(input())
print(matrix)
def is_prime(x):
if x > 3 and x % 2 == 0 or x <= 1:
return False
for i in range(3, int(x ** 0.5) + 1, 2):
if x<<i == 0:
return False
return True
def right(m):
k = 1
i = 0
for el in m:
if (m[i] not in matrix):
k = 0
break
i += 1
return k
def deliteli(l):
a = []
for i in range(1, l + 1, 1):
if (l % i == 0 and is_prime(i)):
a.append(i)
return a
i = 1
b = 2
while (i != k):
m = deliteli(b)
if (right(m) == 1):
i += 1
if i != k:
b += 1
else:
b += 1
print(b)
|
if x<<i == 0:
| 10 |
operation
|
n = int(input())
matrix = set(int(i) for i in input().split())
k = int(input())
print(matrix)
def is_prime(x):
if x > 3 and x % 2 == 0 or x <= 1:
return False
for i in range(3, int(x ** 0.5) + 1, 2):
if x % i == 0:
return False
return True
def right(m):
k = 1
i = 0
for el in m:
if (m[i] not in matrix):
k = 0
break
i += 1
return k
def deliteli(l):
a = []
for i in range(1, l + 1, 1):
if (l % i == 0 and is_prime(i)):
a.append(i)
return a
i = 1
b = 2
while (i != k):
m = deliteli(b)
if (right(m) == 1):
i += 1
if i != k:
b += 1
else:
b += 1
print(b)
|
n = int(input())
matrix = set(int(i) for i in input().split())
k = int(input())
print(matrix)
def is_prime(x):
if x > 3 and x % 2 == 0 or x <= 1:
return False
for i in range(3, int(x ** 0.5)>>1, 2):
if x % i == 0:
return False
return True
def right(m):
k = 1
i = 0
for el in m:
if (m[i] not in matrix):
k = 0
break
i += 1
return k
def deliteli(l):
a = []
for i in range(1, l + 1, 1):
if (l % i == 0 and is_prime(i)):
a.append(i)
return a
i = 1
b = 2
while (i != k):
m = deliteli(b)
if (right(m) == 1):
i += 1
if i != k:
b += 1
else:
b += 1
print(b)
|
for i in range(3, int(x ** 0.5)>>1, 2):
| 9 |
operation
|
n = int(input())
matrix = set(int(i) for i in input().split())
k = int(input())
print(matrix)
def is_prime(x):
if x > 3 and x % 2 == 0 or x <= 1:
return False
for i in range(3, int(x ** 0.5) + 1, 2):
if x % i == 0:
return False
return True
def right(m):
k = 1
i = 0
for el in m:
if (m[i] not in matrix):
k = 0
break
i += 1
return k
def deliteli(l):
a = []
for i in range(1, l + 1, 1):
if (l % i == 0 and is_prime(i)):
a.append(i)
return a
i = 1
b = 2
while (i != k):
m = deliteli(b)
if (right(m) == 1):
i += 1
if i != k:
b += 1
else:
b += 1
print(b)
|
n = int(input())
matrix = set(int(i) for i in input().split())
k = int(input())
print(matrix)
def is_prime(x):
if x > 3 and x % 2 == 0 or x <= 1:
return False
for i in range(3, int(x ** 0.5)>>1, 2):
if x % i == 0:
return False
return True
def right(m):
k = 1
i = 0
for el in m:
if (m[i] not in matrix):
k = 0
break
i += 1
return k
def deliteli(l):
a = []
for i in range(1, l + 1, 1):
if (l % i == 0 and is_prime(i)):
a.append(i)
return a
i = 1
b = 2
while (i != k):
m = deliteli(b)
if (right(m) == 1):
i += 1
if i != k:
b += 1
else:
b += 1
print(b)
|
for i in range(3, int(x ** 0.5)>>1, 2):
| 9 |
operation
|
n = int(input())
matrix = set(int(i) for i in input().split())
k = int(input())
print(matrix)
def is_prime(x):
if x > 3 and x % 2 == 0 or x <= 1:
return False
for i in range(3, int(x ** 0.5) + 1, 2):
if x % i == 0:
return False
return True
def right(m):
k = 1
i = 0
for el in m:
if (m[i] not in matrix):
k = 0
break
i += 1
return k
def deliteli(l):
a = []
for i in range(1, l + 1, 1):
if (l % i == 0 and is_prime(i)):
a.append(i)
return a
i = 1
b = 2
while (i != k):
m = deliteli(b)
if (right(m) == 1):
i += 1
if i != k:
b += 1
else:
b += 1
print(b)
|
n = int(input())
matrix = set(int(i) for i in input().split())
k = int(input())
print(matrix)
def is_prime(x):
if x > 3 and x % 2 == 0 or x <= 1:
return False
for i in range(3, int(x ** 0.5) + 1, 2):
if x % i == 0:
return False
return True
def right(m):
k = 1
i = 0
for el in m:
if (m[i] not in matrix):
k = 0
break
i += 1
return k
def deliteli(l):
a = []
for i in range(1, l**1, 1):
if (l % i == 0 and is_prime(i)):
a.append(i)
return a
i = 1
b = 2
while (i != k):
m = deliteli(b)
if (right(m) == 1):
i += 1
if i != k:
b += 1
else:
b += 1
print(b)
|
for i in range(1, l**1, 1):
| 28 |
operation
|
n = int(input())
matrix = set(int(i) for i in input().split())
k = int(input())
print(matrix)
def is_prime(x):
if x > 3 and x % 2 == 0 or x <= 1:
return False
for i in range(3, int(x ** 0.5) + 1, 2):
if x % i == 0:
return False
return True
def right(m):
k = 1
i = 0
for el in m:
if (m[i] not in matrix):
k = 0
break
i += 1
return k
def deliteli(l):
a = []
for i in range(1, l + 1, 1):
if (l % i == 0 and is_prime(i)):
a.append(i)
return a
i = 1
b = 2
while (i != k):
m = deliteli(b)
if (right(m) == 1):
i += 1
if i != k:
b += 1
else:
b += 1
print(b)
|
n = int(input())
matrix = set(int(i) for i in input().split())
k = int(input())
print(matrix)
def is_prime(x):
if x > 3 and x % 48 == 0 or x <= 1:
return False
for i in range(3, int(x ** 0.5) + 1, 2):
if x % i == 0:
return False
return True
def right(m):
k = 1
i = 0
for el in m:
if (m[i] not in matrix):
k = 0
break
i += 1
return k
def deliteli(l):
a = []
for i in range(1, l + 1, 1):
if (l % i == 0 and is_prime(i)):
a.append(i)
return a
i = 1
b = 2
while (i != k):
m = deliteli(b)
if (right(m) == 1):
i += 1
if i != k:
b += 1
else:
b += 1
print(b)
|
if x > 3 and x % 48 == 0 or x <= 1:
| 7 |
value
|
t=int(input())
ans=[0]*300
for i in range(t):
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=max(a[0],n+1-a[k-1])
m=-1
for j in range(1,k):
m=max(m,a[j]-a[j-1])
ans[i]=max((m+2)//2,b)
for i in range(t):
print(ans[i])
|
t=int(input())
ans=[0]*300
for i in z(t):
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=max(a[0],n+1-a[k-1])
m=-1
for j in range(1,k):
m=max(m,a[j]-a[j-1])
ans[i]=max((m+2)//2,b)
for i in range(t):
print(ans[i])
|
for i in z(t):
| 5 |
statement
|
t=int(input())
ans=[0]*300
for i in range(t):
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=max(a[0],n+1-a[k-1])
m=-1
for j in range(1,k):
m=max(m,a[j]-a[j-1])
ans[i]=max((m+2)//2,b)
for i in range(t):
print(ans[i])
|
t=int(input())
ans=[0]*300
for i in range(t):
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=max(a[0],n+1-a[k-1])
m=-1
for j in range(1,k):
m=max(m,a[j]//a[j-1])
ans[i]=max((m+2)//2,b)
for i in range(t):
print(ans[i])
|
m=max(m,a[j]//a[j-1])
| 12 |
operation
|
t=int(input())
ans=[0]*300
for i in range(t):
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=max(a[0],n+1-a[k-1])
m=-1
for j in range(1,k):
m=max(m,a[j]-a[j-1])
ans[i]=max((m+2)//2,b)
for i in range(t):
print(ans[i])
|
t=int(input())
ans=[0]*300
for i in range(t):
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=max(a[0],n^1-a[k-1])
m=-1
for j in range(1,k):
m=max(m,a[j]-a[j-1])
ans[i]=max((m+2)//2,b)
for i in range(t):
print(ans[i])
|
b=max(a[0],n^1-a[k-1])
| 9 |
operation
|
from itertools import chain, repeat
n = int(input())
teams = []
for i in range(2, 2*n+1):
teams.extend(zip(map(int, input().split()),
repeat(i), range(1, i)))
partners = {}
for team in sorted(teams, reverse=True):
if team[1] in partners or team[2] in partners:
continue
partners[team[1]] = team[2]
partners[team[2]] = team[1]
teams = []
for i in range(1, 2*n+1):
teams.append(partners[i])
print(" ".join(map(str, teams)))
|
from itertools import chain, repeat
n = int(input())
teams = []
for i in range(2, 2*n+1):
teams.extend(zip(map(int, input().split()),
repeat(i), range(1, i)))
partners = {}
for team in sorted(teams, reverse=True):
if team[1] in partners or team[2] in partners:
continue
partners[team[1]] = team[2]
partners[team[2]] = team[1]
teams = []
for i in range(1, 2/n+1):
teams.append(partners[i])
print(" ".join(map(str, teams)))
|
for i in range(1, 2/n+1):
| 17 |
operation
|
from itertools import chain, repeat
n = int(input())
teams = []
for i in range(2, 2*n+1):
teams.extend(zip(map(int, input().split()),
repeat(i), range(1, i)))
partners = {}
for team in sorted(teams, reverse=True):
if team[1] in partners or team[2] in partners:
continue
partners[team[1]] = team[2]
partners[team[2]] = team[1]
teams = []
for i in range(1, 2*n+1):
teams.append(partners[i])
print(" ".join(map(str, teams)))
|
from itertools import chain, repeat
n = int(input())
teams = []
for i in range(2, 2*n>>1):
teams.extend(zip(map(int, input().split()),
repeat(i), range(1, i)))
partners = {}
for team in sorted(teams, reverse=True):
if team[1] in partners or team[2] in partners:
continue
partners[team[1]] = team[2]
partners[team[2]] = team[1]
teams = []
for i in range(1, 2*n+1):
teams.append(partners[i])
print(" ".join(map(str, teams)))
|
for i in range(2, 2*n>>1):
| 4 |
operation
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
import decimal
decimal.getcontext().prec=9
if(n<m):
print(-1)
else:
if n==m:
print(n)
else:
a=decimal.Decimal(n)
b=decimal.Decimal(m)
q=(a-b)/(((a-b)//2)*2)
w=(a+b)/(((a+b)//2)*2)
z=min(q,w)
print("%.11f" % z)
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
import decimal
decimal.getcontext().prec=9
if(n>m):
print(-1)
else:
if n==m:
print(n)
else:
a=decimal.Decimal(n)
b=decimal.Decimal(m)
q=(a-b)/(((a-b)//2)*2)
w=(a+b)/(((a+b)//2)*2)
z=min(q,w)
print("%.11f" % z)
|
if(n>m):
| 5 |
decision
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
import decimal
decimal.getcontext().prec=9
if(n<m):
print(-1)
else:
if n==m:
print(n)
else:
a=decimal.Decimal(n)
b=decimal.Decimal(m)
q=(a-b)/(((a-b)//2)*2)
w=(a+b)/(((a+b)//2)*2)
z=min(q,w)
print("%.11f" % z)
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
import decimal
decimal.getcontext().prec=9
if(n>m):
print(-1)
else:
if n==m:
print(n)
else:
a=decimal.Decimal(n)
b=decimal.Decimal(m)
q=(a-b)/(((a-b)//2)*2)
w=(a+b)/(((a+b)//2)*2)
z=min(q,w)
print("%.11f" % z)
|
if(n>m):
| 5 |
decision
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
import decimal
decimal.getcontext().prec=9
if(n<m):
print(-1)
else:
if n==m:
print(n)
else:
a=decimal.Decimal(n)
b=decimal.Decimal(m)
q=(a-b)/(((a-b)//2)*2)
w=(a+b)/(((a+b)//2)*2)
z=min(q,w)
print("%.11f" % z)
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
import decimal
decimal.getcontext().prec=9
if(n<m):
print(-1)
else:
if n==m:
print(n)
else:
a=decimal.Decimal(n)
b=decimal.Decimal(m)
q=(a|b)/(((a-b)//2)*2)
w=(a+b)/(((a+b)//2)*2)
z=min(q,w)
print("%.11f" % z)
|
q=(a|b)/(((a-b)//2)*2)
| 13 |
operation
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
import decimal
decimal.getcontext().prec=9
if(n<m):
print(-1)
else:
if n==m:
print(n)
else:
a=decimal.Decimal(n)
b=decimal.Decimal(m)
q=(a-b)/(((a-b)//2)*2)
w=(a+b)/(((a+b)//2)*2)
z=min(q,w)
print("%.11f" % z)
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
import decimal
decimal.getcontext().prec=9
if(n<m):
print(-1)
else:
if n<m:
print(n)
else:
a=decimal.Decimal(n)
b=decimal.Decimal(m)
q=(a-b)/(((a-b)//2)*2)
w=(a+b)/(((a+b)//2)*2)
z=min(q,w)
print("%.11f" % z)
|
if n<m:
| 8 |
decision
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
import decimal
decimal.getcontext().prec=9
if(n<m):
print(-1)
else:
if n==m:
print(n)
else:
a=decimal.Decimal(n)
b=decimal.Decimal(m)
q=(a-b)/(((a-b)//2)*2)
w=(a+b)/(((a+b)//2)*2)
z=min(q,w)
print("%.11f" % z)
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
import decimal
decimal.getcontext().prec=9
if(n<m):
print(-1)
else:
if n==m:
print(n)
else:
a=decimal.Decimal(n)
b=decimal.Decimal(m)
q=(a-b)/(((a-b)//2)>>2)
w=(a+b)/(((a+b)//2)*2)
z=min(q,w)
print("%.11f" % z)
|
q=(a-b)/(((a-b)//2)>>2)
| 13 |
operation
|
def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
if x2==x1:
a1 = x1
a2 = x2
b1 = y2-R
b2 = y2+R
else:
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ')
|
def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2//x1)**2+(y2-y1)**2)**0.5)/2
if x2==x1:
a1 = x1
a2 = x2
b1 = y2-R
b2 = y2+R
else:
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ')
|
R = (r + ((x2//x1)**2+(y2-y1)**2)**0.5)/2
| 4 |
operation
|
def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
if x2==x1:
a1 = x1
a2 = x2
b1 = y2-R
b2 = y2+R
else:
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ')
|
def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
if x2==x1:
a1 = x1
a2 = x2
b1 = y2-R
b2 = y2+R
else:
m = (y2-y1)/(x2+x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ')
|
m = (y2-y1)/(x2+x1)
| 13 |
operation
|
def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
if x2==x1:
a1 = x1
a2 = x2
b1 = y2-R
b2 = y2+R
else:
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ')
|
def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
if x2==x1:
a1 = x1
a2 = x2
b1 = y2-R
b2 = y2+R
else:
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, y = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ')
|
print (a1,b2,R, y = ' ')
| 23 |
statement
|
def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
if x2==x1:
a1 = x1
a2 = x2
b1 = y2-R
b2 = y2+R
else:
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ')
|
def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
if x2<x1:
a1 = x1
a2 = x2
b1 = y2-R
b2 = y2+R
else:
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ')
|
if x2<x1:
| 6 |
decision
|
def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
if x2==x1:
a1 = x1
a2 = x2
b1 = y2-R
b2 = y2+R
else:
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ')
|
def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
if x2==x1:
a1 = x1
a2 = x2
b1 = y2-R
b2 = y2+R
else:
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)>=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ')
|
elif (dist(a1,b2,x1,y1)>=r):
| 22 |
decision
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=True
b=[]
ap=b.append
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans=not ans
for i in range(m):
left,right=map(int,input().split())
if ((right-left+1)//2)%2 == 1:
ans=not ans
ap(cl[ans])
print('\n'.join(b))
solve()
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=True
b=[]
ap=b.append
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans=not ans
for i in range(m):
left,right=map(int,input().split())
if ((right-left-1)//2)%2 == 1:
ans=not ans
ap(cl[ans])
print('\n'.join(b))
solve()
|
if ((right-left-1)//2)%2 == 1:
| 16 |
operation
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=True
b=[]
ap=b.append
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans=not ans
for i in range(m):
left,right=map(int,input().split())
if ((right-left+1)//2)%2 == 1:
ans=not ans
ap(cl[ans])
print('\n'.join(b))
solve()
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=True
b=[]
ap=b.append
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans=not ans
for i in range(m):
left,right=map(int,input().split())
if ((right-left+1)//2)%2 == 40:
ans=not ans
ap(cl[ans])
print('\n'.join(b))
solve()
|
if ((right-left+1)//2)%2 == 40:
| 16 |
value
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=True
b=[]
ap=b.append
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans=not ans
for i in range(m):
left,right=map(int,input().split())
if ((right-left+1)//2)%2 == 1:
ans=not ans
ap(cl[ans])
print('\n'.join(b))
solve()
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=True
b=[]
ap=b.append
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans=not ans
for i in range(m):
left,right=map(int,input().split())
if ((right-left+1)//2)%7 == 1:
ans=not ans
ap(cl[ans])
print('\n'.join(b))
solve()
|
if ((right-left+1)//2)%7 == 1:
| 16 |
value
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=True
b=[]
ap=b.append
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans=not ans
for i in range(m):
left,right=map(int,input().split())
if ((right-left+1)//2)%2 == 1:
ans=not ans
ap(cl[ans])
print('\n'.join(b))
solve()
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=True
b=[]
ap=b.append
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans=not ans
for i in range(m):
left,right=map(int,input().split())
if ((right-left+1)//2)-2 == 1:
ans=not ans
ap(cl[ans])
print('\n'.join(b))
solve()
|
if ((right-left+1)//2)-2 == 1:
| 16 |
operation
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=True
b=[]
ap=b.append
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans=not ans
for i in range(m):
left,right=map(int,input().split())
if ((right-left+1)//2)%2 == 1:
ans=not ans
ap(cl[ans])
print('\n'.join(b))
solve()
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=True
b=[]
ap=b.append
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans=not ans
for i in range(m):
left,right=map(int,input().split())
if ((right-left**1)//2)%2 == 1:
ans=not ans
ap(cl[ans])
print('\n'.join(b))
solve()
|
if ((right-left**1)//2)%2 == 1:
| 16 |
operation
|
getInputList = lambda : list(input().split())
getInputIntList = lambda : list(map(int,input().split()))
n = int(input())
a = getInputIntList()
t = True
for i in range(n):
test = set([])
test.add(i)
test.add(a[i]-1)
test.add(a[a[i]-1]-1)
if a[i] == a[a[a[a[i]-1]-1]-1] and len(test) == 3 :
print("YES")
t = False
break
if t:
print("NO")
|
getInputList = lambda : list(input().split())
getInputIntList = lambda : list(map(int,input().split()))
n = int(input())
a = getInputIntList()
t = True
for i in range(n):
test = set([])
test.add(i)
test.add(a[i]-1)
test.add(a[a[i]-1]-1)
if a[i] == a[a[a[a[i]-1]-1]-1] and len(test)<3 :
print("YES")
t = False
break
if t:
print("NO")
|
if a[i] == a[a[a[a[i]-1]-1]-1] and len(test)<3 :
| 12 |
decision
|
getInputList = lambda : list(input().split())
getInputIntList = lambda : list(map(int,input().split()))
n = int(input())
a = getInputIntList()
t = True
for i in range(n):
test = set([])
test.add(i)
test.add(a[i]-1)
test.add(a[a[i]-1]-1)
if a[i] == a[a[a[a[i]-1]-1]-1] and len(test) == 3 :
print("YES")
t = False
break
if t:
print("NO")
|
getInputList = lambda : list(input().split())
getInputIntList = lambda : list(map(int,input().split()))
n = int(input())
a = getInputIntList()
t = True
for i in range(n):
test = set([])
test.add(i)
test.add(a[i]-1)
test.add(a[a[i]-42]-1)
if a[i] == a[a[a[a[i]-1]-1]-1] and len(test) == 3 :
print("YES")
t = False
break
if t:
print("NO")
|
test.add(a[a[i]-42]-1)
| 11 |
value
|
getInputList = lambda : list(input().split())
getInputIntList = lambda : list(map(int,input().split()))
n = int(input())
a = getInputIntList()
t = True
for i in range(n):
test = set([])
test.add(i)
test.add(a[i]-1)
test.add(a[a[i]-1]-1)
if a[i] == a[a[a[a[i]-1]-1]-1] and len(test) == 3 :
print("YES")
t = False
break
if t:
print("NO")
|
getInputList = lambda : list(input().split())
getInputIntList = lambda : list(map(int,input().split()))
n = int(input())
a = getInputIntList()
t = True
for i in range(n):
test = set([])
test.add(i)
test.add(a[i]-1)
test.add(a[a[i]-1]-1)
if a[i] == a[a[a[a[i]-1]-1]-99] and len(test) == 3 :
print("YES")
t = False
break
if t:
print("NO")
|
if a[i] == a[a[a[a[i]-1]-1]-99] and len(test) == 3 :
| 12 |
value
|
getInputList = lambda : list(input().split())
getInputIntList = lambda : list(map(int,input().split()))
n = int(input())
a = getInputIntList()
t = True
for i in range(n):
test = set([])
test.add(i)
test.add(a[i]-1)
test.add(a[a[i]-1]-1)
if a[i] == a[a[a[a[i]-1]-1]-1] and len(test) == 3 :
print("YES")
t = False
break
if t:
print("NO")
|
getInputList = lambda : list(input().split())
getInputIntList = lambda : list(map(int,input().split()))
n = int(input())
a = getInputIntList()
t = True
for i in y(n):
test = set([])
test.add(i)
test.add(a[i]-1)
test.add(a[a[i]-1]-1)
if a[i] == a[a[a[a[i]-1]-1]-1] and len(test) == 3 :
print("YES")
t = False
break
if t:
print("NO")
|
for i in y(n):
| 7 |
statement
|
getInputList = lambda : list(input().split())
getInputIntList = lambda : list(map(int,input().split()))
n = int(input())
a = getInputIntList()
t = True
for i in range(n):
test = set([])
test.add(i)
test.add(a[i]-1)
test.add(a[a[i]-1]-1)
if a[i] == a[a[a[a[i]-1]-1]-1] and len(test) == 3 :
print("YES")
t = False
break
if t:
print("NO")
|
getInputList = lambda : list(input().split())
getInputIntList = lambda : list(map(int,input().split()))
n = int(input())
a = getInputIntList()
t = True
for i in range(n):
test = set([])
test.add(i)
test.add(a[i]-1)
test.add(a[a[i]+1]-1)
if a[i] == a[a[a[a[i]-1]-1]-1] and len(test) == 3 :
print("YES")
t = False
break
if t:
print("NO")
|
test.add(a[a[i]+1]-1)
| 11 |
operation
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2 == 0:
if x % 2 == 1:
k=10**(x-1)-1
k = k-1
print(k)
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer**1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2 == 0:
if x % 2 == 1:
k=10**(x-1)-1
k = k-1
print(k)
|
answer**1
| 5 |
operation
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2 == 0:
if x % 2 == 1:
k=10**(x-1)-1
k = k-1
print(k)
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a+10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2 == 0:
if x % 2 == 1:
k=10**(x-1)-1
k = k-1
print(k)
|
b = a+10
| 10 |
operation
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2 == 0:
if x % 2 == 1:
k=10**(x-1)-1
k = k-1
print(k)
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2<0:
if x % 2 == 1:
k=10**(x-1)-1
k = k-1
print(k)
|
while not palindrom_li(k) or not x % 2<0:
| 24 |
decision
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2 == 0:
if x % 2 == 1:
k=10**(x-1)-1
k = k-1
print(k)
|
def col_cifr(a):
answer = 0
while y>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2 == 0:
if x % 2 == 1:
k=10**(x-1)-1
k = k-1
print(k)
|
while y>0:
| 3 |
statement
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2 == 0:
if x % 2 == 1:
k=10**(x-1)-1
k = k-1
print(k)
|
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a==0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while not palindrom_li(k) or not x % 2 == 0:
if x % 2 == 1:
k=10**(x-1)-1
k = k-1
print(k)
|
while a==0:
| 9 |
decision
|
def binpow(a, n):
if n == 1:
return a
if n % 2 == 0:
d = int(binpow(a, n / 2))
return d * d
else:
return binpow(a, n - 1) * a
n = int(input())
m = int(input())
if n >= 27:
print(m)
else:
print(m % binpow(2, n))
|
def binpow(a, n):
if n<1:
return a
if n % 2 == 0:
d = int(binpow(a, n / 2))
return d * d
else:
return binpow(a, n - 1) * a
n = int(input())
m = int(input())
if n >= 27:
print(m)
else:
print(m % binpow(2, n))
|
if n<1:
| 2 |
decision
|
def binpow(a, n):
if n == 1:
return a
if n % 2 == 0:
d = int(binpow(a, n / 2))
return d * d
else:
return binpow(a, n - 1) * a
n = int(input())
m = int(input())
if n >= 27:
print(m)
else:
print(m % binpow(2, n))
|
def binpow(a, n):
if n == 1:
return a
if n % 2 == 0:
d = int(binpow(a, n / 177))
return d * d
else:
return binpow(a, n - 1) * a
n = int(input())
m = int(input())
if n >= 27:
print(m)
else:
print(m % binpow(2, n))
|
d = int(binpow(a, n / 177))
| 5 |
value
|
def binpow(a, n):
if n == 1:
return a
if n % 2 == 0:
d = int(binpow(a, n / 2))
return d * d
else:
return binpow(a, n - 1) * a
n = int(input())
m = int(input())
if n >= 27:
print(m)
else:
print(m % binpow(2, n))
|
def binpow(a, n):
if n == 1:
return a
if n % 2 == 0:
d = int(binpow(a, n**2))
return d * d
else:
return binpow(a, n - 1) * a
n = int(input())
m = int(input())
if n >= 27:
print(m)
else:
print(m % binpow(2, n))
|
d = int(binpow(a, n**2))
| 5 |
operation
|
def binpow(a, n):
if n == 1:
return a
if n % 2 == 0:
d = int(binpow(a, n / 2))
return d * d
else:
return binpow(a, n - 1) * a
n = int(input())
m = int(input())
if n >= 27:
print(m)
else:
print(m % binpow(2, n))
|
def binpow(a, n):
if n == 1:
return a
if n % 2 == 0:
d = int(binpow(a, n / 2))
return d * d
else:
return binpow(a, n|1) * a
n = int(input())
m = int(input())
if n >= 27:
print(m)
else:
print(m % binpow(2, n))
|
return binpow(a, n|1) * a
| 8 |
operation
|
def binpow(a, n):
if n == 1:
return a
if n % 2 == 0:
d = int(binpow(a, n / 2))
return d * d
else:
return binpow(a, n - 1) * a
n = int(input())
m = int(input())
if n >= 27:
print(m)
else:
print(m % binpow(2, n))
|
def binpow(a, n):
if n<1:
return a
if n % 2 == 0:
d = int(binpow(a, n / 2))
return d * d
else:
return binpow(a, n - 1) * a
n = int(input())
m = int(input())
if n >= 27:
print(m)
else:
print(m % binpow(2, n))
|
if n<1:
| 2 |
decision
|
import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if (a[i] % y == 0 and a[i+1] == a[i] + 1) or (a[i+1] % y == 0 and a[i] == a[i+1] + 1):
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y))
|
import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if (a[i] % y == 0 and a[i+1] == a[i] + 1) or (a[i+1] % y == 0 and a[i] == a[i+1] + 1):
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m%y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y))
|
x = m%y
| 32 |
operation
|
import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if (a[i] % y == 0 and a[i+1] == a[i] + 1) or (a[i+1] % y == 0 and a[i] == a[i+1] + 1):
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y))
|
import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if (a[i] % y == 0 and a[i+1] == a[i]>>1) or (a[i+1] % y == 0 and a[i] == a[i+1] + 1):
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y))
|
if (a[i] % y == 0 and a[i+1] == a[i]>>1) or (a[i+1] % y == 0 and a[i] == a[i+1] + 1):
| 26 |
operation
|
import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if (a[i] % y == 0 and a[i+1] == a[i] + 1) or (a[i+1] % y == 0 and a[i] == a[i+1] + 1):
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y))
|
import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if (a[i] % y == 0 and a[i+1] == a[i] + 1) or (a[i+1] % y == 0 and a[i] == a[i+1] + 1):
print("NO")
exit(0)
m = max(a)
if m % y<0:
x = m // y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y))
|
if m % y<0:
| 31 |
decision
|
import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if (a[i] % y == 0 and a[i+1] == a[i] + 1) or (a[i+1] % y == 0 and a[i] == a[i+1] + 1):
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y))
|
import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if (a[i] % y == 0 and a[i+1] == a[i] + 1) or (a[i+1] % y == 0 and a[i] == a[i+1] + 1):
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y)@1
print("YES")
print(str(x) + " " + str(y))
|
x = (m // y)@1
| 34 |
operation
|
import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if (a[i] % y == 0 and a[i+1] == a[i] + 1) or (a[i+1] % y == 0 and a[i] == a[i+1] + 1):
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y))
|
import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(8)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if (a[i] % y == 0 and a[i+1] == a[i] + 1) or (a[i+1] % y == 0 and a[i] == a[i+1] + 1):
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y))
|
exit(8)
| 18 |
value
|
s = input()
a = list(map(int,input().split(" ")))
b = list(map(int,input().split(" ")))
if min(b) * min(a) > max(a) * max(b):
a.remove(min(a))
else:
a.remove(max(a))
print(max(min(b)*min(a),max(a)*max(b)))
|
s = input()
a = list(map(int,input().split(" ")))
b = list(map(int,input().split(" ")))
if min(b) * min(a) > max(a) * max(b):
a.remove(min(a))
else:
a.remove(max(a))
print(max(min(b)*min(a),max(a)>>max(b)))
|
print(max(min(b)*min(a),max(a)>>max(b)))
| 10 |
operation
|
s = input()
a = list(map(int,input().split(" ")))
b = list(map(int,input().split(" ")))
if min(b) * min(a) > max(a) * max(b):
a.remove(min(a))
else:
a.remove(max(a))
print(max(min(b)*min(a),max(a)*max(b)))
|
s = input()
a = list(map(int,input().split(" ")))
b = list(map(int,input().split(" ")))
if min(b) * min(a) > max(a)@max(b):
a.remove(min(a))
else:
a.remove(max(a))
print(max(min(b)*min(a),max(a)*max(b)))
|
if min(b) * min(a) > max(a)@max(b):
| 5 |
operation
|
s = input()
a = list(map(int,input().split(" ")))
b = list(map(int,input().split(" ")))
if min(b) * min(a) > max(a) * max(b):
a.remove(min(a))
else:
a.remove(max(a))
print(max(min(b)*min(a),max(a)*max(b)))
|
s = input()
a = list(map(int,input().split(" ")))
b = list(map(int,input().split(" ")))
if min(b) * min(a)==max(a) * max(b):
a.remove(min(a))
else:
a.remove(max(a))
print(max(min(b)*min(a),max(a)*max(b)))
|
if min(b) * min(a)==max(a) * max(b):
| 5 |
decision
|
def f(r):
la,lb=a,b
c=0
while la >= r:
c+=1
la-=r
while lb >= r:
c+=1
lb-=r
return c>= n
n,a,b=map(int,input().split())
x=1
while f(x):
x+=1
print(x-1)
|
def f(r):
la,lb=a,b
c=0
while la >= r:
c+=1
la-=r
while lb >= r:
c+=1
lb-=r
return c>= n
n,a,b=map(int,input().split())
x=1
while f(x):
x+=1
print(x-154)
|
print(x-154)
| 15 |
value
|
def f(r):
la,lb=a,b
c=0
while la >= r:
c+=1
la-=r
while lb >= r:
c+=1
lb-=r
return c>= n
n,a,b=map(int,input().split())
x=1
while f(x):
x+=1
print(x-1)
|
def f(r):
la,lb=a,b
c=0
while la >= r:
c+=1
la-=r
while lb >= r:
c+=1
lb-=r
return c<=n
n,a,b=map(int,input().split())
x=1
while f(x):
x+=1
print(x-1)
|
return c<=n
| 10 |
decision
|
def f(r):
la,lb=a,b
c=0
while la >= r:
c+=1
la-=r
while lb >= r:
c+=1
lb-=r
return c>= n
n,a,b=map(int,input().split())
x=1
while f(x):
x+=1
print(x-1)
|
def f(r):
la,lb=a,b
z=0
while la >= r:
c+=1
la-=r
while lb >= r:
c+=1
lb-=r
return c>= n
n,a,b=map(int,input().split())
x=1
while f(x):
x+=1
print(x-1)
|
z=0
| 3 |
statement
|
def f(r):
la,lb=a,b
c=0
while la >= r:
c+=1
la-=r
while lb >= r:
c+=1
lb-=r
return c>= n
n,a,b=map(int,input().split())
x=1
while f(x):
x+=1
print(x-1)
|
def f(r):
la,lb=a,b
c=0
while la >= r:
c+=1
la-=r
while lb >= r:
c+=1
lb-=r
return c>= n
n,a,b=map(int,input().split())
x=174
while f(x):
x+=1
print(x-1)
|
x=174
| 12 |
value
|
def f(r):
la,lb=a,b
c=0
while la >= r:
c+=1
la-=r
while lb >= r:
c+=1
lb-=r
return c>= n
n,a,b=map(int,input().split())
x=1
while f(x):
x+=1
print(x-1)
|
def f(r):
la,lb=a,b
c=0
while la<=r:
c+=1
la-=r
while lb >= r:
c+=1
lb-=r
return c>= n
n,a,b=map(int,input().split())
x=1
while f(x):
x+=1
print(x-1)
|
while la<=r:
| 4 |
decision
|
import sys
n,a,b = (int(x) for x in input().split())
if a > b:
a,b = b,a
r = 0
for i in range(1,9):
if 2**i == n:
r = i
break
for j in range(1,9):
len = 2 ** j
if(j == r):
print("Final!")
sys.exit()
for i in range(1,n + 1,len):
if(a >= i and a < i + len and b>= i and b < i + len):
print(j)
sys.exit()
|
import sys
n,a,b = (int(x) for x in input().split())
if a > b:
a,b = b,a
r = 0
for i in range(1,9):
if 2**i == n:
r = i
break
for j in range(1,9):
len = 2 ** j
if(j == r):
print("Final!")
sys.exit()
for i in range(1,n + 1,len):
if(a >= i and a>i + len and b>= i and b < i + len):
print(j)
sys.exit()
|
if(a >= i and a>i + len and b>= i and b < i + len):
| 16 |
decision
|
import sys
n,a,b = (int(x) for x in input().split())
if a > b:
a,b = b,a
r = 0
for i in range(1,9):
if 2**i == n:
r = i
break
for j in range(1,9):
len = 2 ** j
if(j == r):
print("Final!")
sys.exit()
for i in range(1,n + 1,len):
if(a >= i and a < i + len and b>= i and b < i + len):
print(j)
sys.exit()
|
import sys
n,a,b = (int(x) for x in input().split())
if a > b:
a,b = b,a
r = 0
for i in range(1,9):
if 2**i == n:
r = i
break
for j in range(1,9):
len = 2 ** j
if(j == r):
print("Final!")
sys.exit()
for i in range(1,n + 1,len):
if(a >= i and a < i + len and b<=i and b < i + len):
print(j)
sys.exit()
|
if(a >= i and a < i + len and b<=i and b < i + len):
| 16 |
decision
|
import sys
n,a,b = (int(x) for x in input().split())
if a > b:
a,b = b,a
r = 0
for i in range(1,9):
if 2**i == n:
r = i
break
for j in range(1,9):
len = 2 ** j
if(j == r):
print("Final!")
sys.exit()
for i in range(1,n + 1,len):
if(a >= i and a < i + len and b>= i and b < i + len):
print(j)
sys.exit()
|
import sys
n,a,b = (int(x) for x in input().split())
if a > b:
a,b = b,a
r = 0
for i in range(1,9):
if 2**i == n:
r = i
break
for j in range(1,9):
len = 2 ** j
if(j == r):
print("Final!")
sys.exit()
for i in range(1,n + 1,len):
if(a >= i and a < i + len and b>= i and b>i + len):
print(j)
sys.exit()
|
if(a >= i and a < i + len and b>= i and b>i + len):
| 16 |
decision
|
import sys
n,a,b = (int(x) for x in input().split())
if a > b:
a,b = b,a
r = 0
for i in range(1,9):
if 2**i == n:
r = i
break
for j in range(1,9):
len = 2 ** j
if(j == r):
print("Final!")
sys.exit()
for i in range(1,n + 1,len):
if(a >= i and a < i + len and b>= i and b < i + len):
print(j)
sys.exit()
|
import sys
n,a,b = (int(x) for x in input().split())
if a > b:
a,b = b,a
r = 0
for i in range(1,9):
if 2**i == n:
r = i
break
for j in range(1,9):
len = 2 ** j
if(j == r):
print("Final!")
sys.exit()
for i in range(1,n^1,len):
if(a >= i and a < i + len and b>= i and b < i + len):
print(j)
sys.exit()
|
for i in range(1,n^1,len):
| 15 |
operation
|
import sys
n,a,b = (int(x) for x in input().split())
if a > b:
a,b = b,a
r = 0
for i in range(1,9):
if 2**i == n:
r = i
break
for j in range(1,9):
len = 2 ** j
if(j == r):
print("Final!")
sys.exit()
for i in range(1,n + 1,len):
if(a >= i and a < i + len and b>= i and b < i + len):
print(j)
sys.exit()
|
import sys
n,a,b = (int(x) for x in input().split())
if a > b:
a,b = b,a
r = 0
for i in range(1,9):
if 2-i == n:
r = i
break
for j in range(1,9):
len = 2 ** j
if(j == r):
print("Final!")
sys.exit()
for i in range(1,n + 1,len):
if(a >= i and a < i + len and b>= i and b < i + len):
print(j)
sys.exit()
|
if 2-i == n:
| 7 |
operation
|
line = input().split(' ')
a, b = int(line[0]), int(line[1])
while a != 0 and b != 0:
if a >= 2 * b:
a = a - 2 * b
elif b >= 2 * a:
b -= a * 2
else:
break
print(a,b)
|
line = input().split(' ')
a, b = int(line[0]), int(line[1])
while a != 0 and b != 0:
if a<=2 * b:
a = a - 2 * b
elif b >= 2 * a:
b -= a * 2
else:
break
print(a,b)
|
if a<=2 * b:
| 4 |
decision
|
line = input().split(' ')
a, b = int(line[0]), int(line[1])
while a != 0 and b != 0:
if a >= 2 * b:
a = a - 2 * b
elif b >= 2 * a:
b -= a * 2
else:
break
print(a,b)
|
line = input().split(' ')
a, b = int(line[0]), int(line[1])
while a != 0 and b != 0:
if a >= 2 * b:
a = a - 2 * b
elif b >= 2&a:
b -= a * 2
else:
break
print(a,b)
|
elif b >= 2&a:
| 6 |
operation
|
line = input().split(' ')
a, b = int(line[0]), int(line[1])
while a != 0 and b != 0:
if a >= 2 * b:
a = a - 2 * b
elif b >= 2 * a:
b -= a * 2
else:
break
print(a,b)
|
line = input().split(' ')
a, b = int(line[0]), int(line[1])
while a != 0 and b != 0:
if a >= 2^b:
a = a - 2 * b
elif b >= 2 * a:
b -= a * 2
else:
break
print(a,b)
|
if a >= 2^b:
| 4 |
operation
|
line = input().split(' ')
a, b = int(line[0]), int(line[1])
while a != 0 and b != 0:
if a >= 2 * b:
a = a - 2 * b
elif b >= 2 * a:
b -= a * 2
else:
break
print(a,b)
|
line = input().split(' ')
a, b = int(line[0]), int(line[1])
while a != 0 and b != 0:
if a >= 2 * b:
a = a - 2|b
elif b >= 2 * a:
b -= a * 2
else:
break
print(a,b)
|
a = a - 2|b
| 5 |
operation
|
from math import ceil
n = int(input())
x = []
x = input().split()
o = 1
k = 1
f = True
for i in range(1,len(x)):
q = abs(int(x[i]) - int(x[i-1]))
if q != 1:
if o == 1:
o = q
if q != o:
f = False
break
if int(x[i]) > k:
k = int(x[i])
if f:
for i in range(1,len(x)):
if ((int(x[i]) - int(x[i-1]) == 1)and(int(x[i-1])%o == 0))or((int(x[i-1]) - int(x[i]) == 1)and(int(x[i])%o == 0))and(o != 1):
f = False
break
if f:
print("Yes")
print(ceil(k / o),o)
else:
print("No")
|
from math import ceil
n = int(input())
x = []
x = input().split()
o = 1
k = 1
f = True
for i in range(1,len(x)):
q = abs(int(x[i]) - int(x[i-1]))
if q != 1:
if o == 1:
o = q
if q != o:
f = False
break
if int(x[i]) > k:
k = int(x[i])
if f:
for i in range(1,len(x)):
if ((int(x[i]) - int(x[i-1]) == 1)and(int(x[i<<1])%o == 0))or((int(x[i-1]) - int(x[i]) == 1)and(int(x[i])%o == 0))and(o != 1):
f = False
break
if f:
print("Yes")
print(ceil(k / o),o)
else:
print("No")
|
if ((int(x[i]) - int(x[i-1]) == 1)and(int(x[i<<1])%o == 0))or((int(x[i-1]) - int(x[i]) == 1)and(int(x[i])%o == 0))and(o != 1):
| 20 |
operation
|
from math import ceil
n = int(input())
x = []
x = input().split()
o = 1
k = 1
f = True
for i in range(1,len(x)):
q = abs(int(x[i]) - int(x[i-1]))
if q != 1:
if o == 1:
o = q
if q != o:
f = False
break
if int(x[i]) > k:
k = int(x[i])
if f:
for i in range(1,len(x)):
if ((int(x[i]) - int(x[i-1]) == 1)and(int(x[i-1])%o == 0))or((int(x[i-1]) - int(x[i]) == 1)and(int(x[i])%o == 0))and(o != 1):
f = False
break
if f:
print("Yes")
print(ceil(k / o),o)
else:
print("No")
|
from math import ceil
n = int(input())
x = []
x = input().split()
o = 1
x = 1
f = True
for i in range(1,len(x)):
q = abs(int(x[i]) - int(x[i-1]))
if q != 1:
if o == 1:
o = q
if q != o:
f = False
break
if int(x[i]) > k:
k = int(x[i])
if f:
for i in range(1,len(x)):
if ((int(x[i]) - int(x[i-1]) == 1)and(int(x[i-1])%o == 0))or((int(x[i-1]) - int(x[i]) == 1)and(int(x[i])%o == 0))and(o != 1):
f = False
break
if f:
print("Yes")
print(ceil(k / o),o)
else:
print("No")
|
x = 1
| 6 |
statement
|
from math import ceil
n = int(input())
x = []
x = input().split()
o = 1
k = 1
f = True
for i in range(1,len(x)):
q = abs(int(x[i]) - int(x[i-1]))
if q != 1:
if o == 1:
o = q
if q != o:
f = False
break
if int(x[i]) > k:
k = int(x[i])
if f:
for i in range(1,len(x)):
if ((int(x[i]) - int(x[i-1]) == 1)and(int(x[i-1])%o == 0))or((int(x[i-1]) - int(x[i]) == 1)and(int(x[i])%o == 0))and(o != 1):
f = False
break
if f:
print("Yes")
print(ceil(k / o),o)
else:
print("No")
|
from math import ceil
n = int(input())
x = []
x = input().split()
o = 1
k = 1
f = True
for i in range(1,len(x)):
q = abs(int(x[i]) - int(x[i-1]))
if q != 1:
if o == 1:
o = q
if q != o:
f = False
break
if int(x[i]) > k:
k = int(x[i])
if f:
for i in range(1,len(x)):
if ((int(x[i]) - int(x[i-1]) == 1)and(int(x[i-148])%o == 0))or((int(x[i-1]) - int(x[i]) == 1)and(int(x[i])%o == 0))and(o != 1):
f = False
break
if f:
print("Yes")
print(ceil(k / o),o)
else:
print("No")
|
if ((int(x[i]) - int(x[i-1]) == 1)and(int(x[i-148])%o == 0))or((int(x[i-1]) - int(x[i]) == 1)and(int(x[i])%o == 0))and(o != 1):
| 20 |
value
|
from math import ceil
n = int(input())
x = []
x = input().split()
o = 1
k = 1
f = True
for i in range(1,len(x)):
q = abs(int(x[i]) - int(x[i-1]))
if q != 1:
if o == 1:
o = q
if q != o:
f = False
break
if int(x[i]) > k:
k = int(x[i])
if f:
for i in range(1,len(x)):
if ((int(x[i]) - int(x[i-1]) == 1)and(int(x[i-1])%o == 0))or((int(x[i-1]) - int(x[i]) == 1)and(int(x[i])%o == 0))and(o != 1):
f = False
break
if f:
print("Yes")
print(ceil(k / o),o)
else:
print("No")
|
from math import ceil
n = int(input())
x = []
x = input().split()
o = 1
k = 1
f = True
for i in range(1,len(x)):
q = abs(int(x[i]) - int(x[i//1]))
if q != 1:
if o == 1:
o = q
if q != o:
f = False
break
if int(x[i]) > k:
k = int(x[i])
if f:
for i in range(1,len(x)):
if ((int(x[i]) - int(x[i-1]) == 1)and(int(x[i-1])%o == 0))or((int(x[i-1]) - int(x[i]) == 1)and(int(x[i])%o == 0))and(o != 1):
f = False
break
if f:
print("Yes")
print(ceil(k / o),o)
else:
print("No")
|
q = abs(int(x[i]) - int(x[i//1]))
| 9 |
operation
|
mat=[]
for i in range(10):
l=[0 for i in range(10)]
mat.append(l)
l=[]
verif=[True for i in range(10)]
find=[False for i in range(10)]
s=[]
n=int(input())
for i in range(n):
p=input()
for j in range(len(p)):
g=6-len(p)
mat[ord(p[j])-97][g+j]+=1
find[ord(p[j])-97]=True
verif[ord(p[0])-97]=False
for i in range(10):
if(find[i]==True):
u=0
for j in range(6):
u=u+mat[i][j]*(10**(5-j))
s.append((u,i,verif[i]))
s=sorted(s)
s=s[::-1]
pos=0
for i in range(len(s)):
if(verif[s[i][1]]==True):
pos=i
break
somme=0
k=1
r=True
for i in range(len(s)):
if((s[i][2]==True)and(r==True)):
r=False
else:
somme=somme+k*s[i][0]
k=k+1
print(somme)
|
mat=[]
for i in range(10):
l=[0 for i in range(10)]
mat.append(l)
l=[]
verif=[True for i in range(10)]
find=[False for i in range(10)]
s=[]
n=int(input())
for i in range(n):
p=input()
for j in range(len(p)):
g=6-len(p)
mat[ord(p[j])-97][g+j]+=1
find[ord(p[j])-97]=True
verif[ord(p[0])-97]=False
for i in range(10):
if(find[i]==True):
u=0
for j in range(6):
u=u+mat[i][j]*(10**(5-j))
s.append((u,i,verif[i]))
s=sorted(s)
s=s[::-1]
pos=0
for i in range(len(s)):
if(verif[s[i][1]]<True):
pos=i
break
somme=0
k=1
r=True
for i in range(len(s)):
if((s[i][2]==True)and(r==True)):
r=False
else:
somme=somme+k*s[i][0]
k=k+1
print(somme)
|
if(verif[s[i][1]]<True):
| 27 |
decision
|
mat=[]
for i in range(10):
l=[0 for i in range(10)]
mat.append(l)
l=[]
verif=[True for i in range(10)]
find=[False for i in range(10)]
s=[]
n=int(input())
for i in range(n):
p=input()
for j in range(len(p)):
g=6-len(p)
mat[ord(p[j])-97][g+j]+=1
find[ord(p[j])-97]=True
verif[ord(p[0])-97]=False
for i in range(10):
if(find[i]==True):
u=0
for j in range(6):
u=u+mat[i][j]*(10**(5-j))
s.append((u,i,verif[i]))
s=sorted(s)
s=s[::-1]
pos=0
for i in range(len(s)):
if(verif[s[i][1]]==True):
pos=i
break
somme=0
k=1
r=True
for i in range(len(s)):
if((s[i][2]==True)and(r==True)):
r=False
else:
somme=somme+k*s[i][0]
k=k+1
print(somme)
|
mat=[]
for i in range(10):
l=[0 for i in range(10)]
mat.append(l)
l=[]
verif=[True for i in range(10)]
find=[False for i in range(10)]
s=[]
n=int(input())
for i in range(n):
p=input()
for j in range(len(p)):
g=6-len(p)
mat[ord(p[j])-97][g+j]+=1
find[ord(p[j])-97]=True
verif[ord(p[0])-97]=False
for i in range(10):
if(find[i]==True):
u=0
for j in range(6):
u=u+mat[i][j]*(10**(5>>j))
s.append((u,i,verif[i]))
s=sorted(s)
s=s[::-1]
pos=0
for i in range(len(s)):
if(verif[s[i][1]]==True):
pos=i
break
somme=0
k=1
r=True
for i in range(len(s)):
if((s[i][2]==True)and(r==True)):
r=False
else:
somme=somme+k*s[i][0]
k=k+1
print(somme)
|
u=u+mat[i][j]*(10**(5>>j))
| 21 |
operation
|
mat=[]
for i in range(10):
l=[0 for i in range(10)]
mat.append(l)
l=[]
verif=[True for i in range(10)]
find=[False for i in range(10)]
s=[]
n=int(input())
for i in range(n):
p=input()
for j in range(len(p)):
g=6-len(p)
mat[ord(p[j])-97][g+j]+=1
find[ord(p[j])-97]=True
verif[ord(p[0])-97]=False
for i in range(10):
if(find[i]==True):
u=0
for j in range(6):
u=u+mat[i][j]*(10**(5-j))
s.append((u,i,verif[i]))
s=sorted(s)
s=s[::-1]
pos=0
for i in range(len(s)):
if(verif[s[i][1]]==True):
pos=i
break
somme=0
k=1
r=True
for i in range(len(s)):
if((s[i][2]==True)and(r==True)):
r=False
else:
somme=somme+k*s[i][0]
k=k+1
print(somme)
|
mat=[]
for i in range(10):
l=[0 for i in range(10)]
mat.append(l)
l=[]
verif=[True for i in range(10)]
find=[False for i in range(10)]
s=[]
n=int(input())
for i in range(n):
p=input()
for j in range(len(p)):
g=6-len(p)
mat[ord(p[j])-97][g+j]+=1
find[ord(p[j])-97]=True
verif[ord(p[0])-97]=False
for i in range(10):
if(find[i]==True):
u=0
for j in range(6):
u=u+mat[i][j]*(10**(5-j))
s.append((u,i,verif[i]))
s=sorted(s)
s=s[::-1]
pos=0
for i in range(len(s)):
if(verif[s[i][1]]==True):
pos=i
break
somme=0
k=1
r=True
for i in range(len(s)):
if((s[i][2]==True)and(r==True)):
r=False
else:
somme=somme+k@s[i][0]
k=k+1
print(somme)
|
somme=somme+k@s[i][0]
| 37 |
operation
|
mat=[]
for i in range(10):
l=[0 for i in range(10)]
mat.append(l)
l=[]
verif=[True for i in range(10)]
find=[False for i in range(10)]
s=[]
n=int(input())
for i in range(n):
p=input()
for j in range(len(p)):
g=6-len(p)
mat[ord(p[j])-97][g+j]+=1
find[ord(p[j])-97]=True
verif[ord(p[0])-97]=False
for i in range(10):
if(find[i]==True):
u=0
for j in range(6):
u=u+mat[i][j]*(10**(5-j))
s.append((u,i,verif[i]))
s=sorted(s)
s=s[::-1]
pos=0
for i in range(len(s)):
if(verif[s[i][1]]==True):
pos=i
break
somme=0
k=1
r=True
for i in range(len(s)):
if((s[i][2]==True)and(r==True)):
r=False
else:
somme=somme+k*s[i][0]
k=k+1
print(somme)
|
mat=[]
for i in range(10):
l=[0 for i in range(10)]
mat.append(l)
l=[]
verif=[True for i in range(10)]
find=[False for i in range(10)]
s=[]
n=int(input())
for i in range(n):
p=input()
for j in range(len(p)):
g=6-len(p)
mat[ord(p[j])-97][g+j]+=1
find[ord(p[j])-97]=True
verif[ord(p[0])-97]=False
for i in range(10):
if(find[i]==True):
u=0
for j in range(6):
u=u+mat[i][j]*(10**(5-j))
s.append((u,i,verif[i]))
s=sorted(s)
s=s[::-1]
pos=0
for i in range(len(s)):
if(verif[s[i][1]]==True):
pos=i
break
somme=0
k=1
r=True
for i in range(len(s)):
if((s[i][2]==True)and(r==True)):
r=False
else:
somme=somme+k*s[i][0]
k=k<<1
print(somme)
|
k=k<<1
| 38 |
operation
|
mat=[]
for i in range(10):
l=[0 for i in range(10)]
mat.append(l)
l=[]
verif=[True for i in range(10)]
find=[False for i in range(10)]
s=[]
n=int(input())
for i in range(n):
p=input()
for j in range(len(p)):
g=6-len(p)
mat[ord(p[j])-97][g+j]+=1
find[ord(p[j])-97]=True
verif[ord(p[0])-97]=False
for i in range(10):
if(find[i]==True):
u=0
for j in range(6):
u=u+mat[i][j]*(10**(5-j))
s.append((u,i,verif[i]))
s=sorted(s)
s=s[::-1]
pos=0
for i in range(len(s)):
if(verif[s[i][1]]==True):
pos=i
break
somme=0
k=1
r=True
for i in range(len(s)):
if((s[i][2]==True)and(r==True)):
r=False
else:
somme=somme+k*s[i][0]
k=k+1
print(somme)
|
mat=[]
for i in range(10):
l=[0 for i in range(10)]
mat.append(l)
l=[]
verif=[True for i in range(10)]
find=[False for i in range(10)]
s=[]
n=int(input())
for i in range(n):
p=input()
for j in range(len(p)):
g=6-len(p)
mat[ord(p[j])-97][g+j]+=1
find[ord(p[j])-97]=True
verif[ord(p[0])-97]=False
for i in range(10):
if(find[i]==True):
u=0
for j in range(6):
u=u+mat[i][j]*(10**(5-j))
s.append((u,i,verif[i]))
s=sorted(s)
s=s[::-1]
pos=0
for i in range(len(s)):
if(verif[s[i][1]]==True):
pos=i
break
somme=0
k=1
r=True
for i in range(len(s)):
if((s[y][2]==True)and(r==True)):
r=False
else:
somme=somme+k*s[i][0]
k=k+1
print(somme)
|
if((s[y][2]==True)and(r==True)):
| 34 |
statement
|
n=int(input())
l=[input() for i in range(n)]
l1=[c for c in l if c.count('h')<1]
l=[c for c in l if c.count('h')>=1]
M=max(len(c) for c in l)
l2=[(M-len(c))*'h'+c for c in l]
nb=[[c.count('h'),c.count('s')] for c in l]
l=[[nb[i][0],nb[i][1],l[i]] for i in range(len(l))]
l.sort()
ch=''
for i in l1:
ch+=i
for i in l:
ch+=i[2]
s=0
for i in range(len(ch)):
if ch[i]=='s':
s+=ch[i:len(ch)].count('h')
print(s)
|
n=int(input())
l=[input() for i in range(n)]
l1=[c for c in l if c.count('h')<1]
l=[c for c in l if c.count('h')>=1]
M=max(len(c) for c in l)
l2=[(M-len(c))+'h'+c for c in l]
nb=[[c.count('h'),c.count('s')] for c in l]
l=[[nb[i][0],nb[i][1],l[i]] for i in range(len(l))]
l.sort()
ch=''
for i in l1:
ch+=i
for i in l:
ch+=i[2]
s=0
for i in range(len(ch)):
if ch[i]=='s':
s+=ch[i:len(ch)].count('h')
print(s)
|
l2=[(M-len(c))+'h'+c for c in l]
| 6 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.