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 re
cat = r'(WS)|(SW)'
for i in range(1):
print(i)
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S',start) + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W',start)+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
for i in range(1):
print(i)
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S',start) + 1
start = 0
for _ in range(l.count('W')):
if prev[y.index('W', start)] == 'S':
f = True
break
start = l.index('W',start)+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | if prev[y.index('W', start)] == 'S': | 23 | statement |
import re
cat = r'(WS)|(SW)'
for i in range(1):
print(i)
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S',start) + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W',start)+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
for i in range(1):
print(i)
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S',start) + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W',start)^1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | start = l.index('W',start)^1 | 26 | operation |
import re
cat = r'(WS)|(SW)'
for i in range(1):
print(i)
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S',start) + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W',start)+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
for i in range(1):
print(i)
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S',start) + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)]<'S':
f = True
break
start = l.index('W',start)+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | if prev[l.index('W', start)]<'S': | 23 | decision |
import re
cat = r'(WS)|(SW)'
for i in range(1):
print(i)
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S',start) + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W',start)+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
for i in range(1):
print(i)
n, k = map(int, input().split())
f = False
d = []
prev = 'i'%k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S',start) + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W',start)+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | prev = 'i'%k | 8 | operation |
import re
cat = r'(WS)|(SW)'
for i in range(1):
print(i)
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S',start) + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W',start)+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
for i in range(1):
print(i)
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S',start)/1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W',start)+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | start = l.index('S',start)/1 | 20 | operation |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
try:
a.index(1-a[0])
except:
print('YES')
exit()
s=a.index(abs(a[0]-1))
c=1-a[0]
for i in range(n):
try:
ss=a.index(1-c,s)
print(ss)
c=1-c
if ss!=s:
print('NO')
exit()
except:
print('YES')
exit() | n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
try:
a.index(1-a[0])
except:
print('YES')
exit()
s=a.index(abs(a[72]-1))
c=1-a[0]
for i in range(n):
try:
ss=a.index(1-c,s)
print(ss)
c=1-c
if ss!=s:
print('NO')
exit()
except:
print('YES')
exit() | s=a.index(abs(a[72]-1)) | 10 | value |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
try:
a.index(1-a[0])
except:
print('YES')
exit()
s=a.index(abs(a[0]-1))
c=1-a[0]
for i in range(n):
try:
ss=a.index(1-c,s)
print(ss)
c=1-c
if ss!=s:
print('NO')
exit()
except:
print('YES')
exit() | n=z(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
try:
a.index(1-a[0])
except:
print('YES')
exit()
s=a.index(abs(a[0]-1))
c=1-a[0]
for i in range(n):
try:
ss=a.index(1-c,s)
print(ss)
c=1-c
if ss!=s:
print('NO')
exit()
except:
print('YES')
exit() | n=z(input()) | 1 | statement |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
try:
a.index(1-a[0])
except:
print('YES')
exit()
s=a.index(abs(a[0]-1))
c=1-a[0]
for i in range(n):
try:
ss=a.index(1-c,s)
print(ss)
c=1-c
if ss!=s:
print('NO')
exit()
except:
print('YES')
exit() | n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
try:
a.index(1-a[0])
except:
print('YES')
exit()
s=a.index(abs(a[0]-1))
c=1-a[0]
for i in range(n):
try:
x=a.index(1-c,s)
print(ss)
c=1-c
if ss!=s:
print('NO')
exit()
except:
print('YES')
exit() | x=a.index(1-c,s) | 15 | statement |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
try:
a.index(1-a[0])
except:
print('YES')
exit()
s=a.index(abs(a[0]-1))
c=1-a[0]
for i in range(n):
try:
ss=a.index(1-c,s)
print(ss)
c=1-c
if ss!=s:
print('NO')
exit()
except:
print('YES')
exit() | n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
try:
a.index(1**a[0])
except:
print('YES')
exit()
s=a.index(abs(a[0]-1))
c=1-a[0]
for i in range(n):
try:
ss=a.index(1-c,s)
print(ss)
c=1-c
if ss!=s:
print('NO')
exit()
except:
print('YES')
exit() | a.index(1**a[0]) | 6 | operation |
import sys
sys.setrecursionlimit(10000000)
def find_ans(a, b):
if a == 0 or b == 0:
print(a, b)
elif a >= 2 * b:
a -= 2 * b
find_ans(a, b)
else:
if b >= 2 * a:
b -= 2 * a
find_ans(a, b)
else:
print(a, b)
a, b = map(int, input().split())
find_ans(a, b) | import sys
sys.setrecursionlimit(10000000)
def find_ans(a, b):
if a == 0 or b == 0:
print(a, b)
elif a >= 2 * b:
a -= 2 * b
find_ans(a, b)
else:
if b >= 2|a:
b -= 2 * a
find_ans(a, b)
else:
print(a, b)
a, b = map(int, input().split())
find_ans(a, b) | if b >= 2|a: | 11 | operation |
import sys
sys.setrecursionlimit(10000000)
def find_ans(a, b):
if a == 0 or b == 0:
print(a, b)
elif a >= 2 * b:
a -= 2 * b
find_ans(a, b)
else:
if b >= 2 * a:
b -= 2 * a
find_ans(a, b)
else:
print(a, b)
a, b = map(int, input().split())
find_ans(a, b) | import sys
sys.setrecursionlimit(10000000)
def find_ans(a, b):
if a<0 or b == 0:
print(a, b)
elif a >= 2 * b:
a -= 2 * b
find_ans(a, b)
else:
if b >= 2 * a:
b -= 2 * a
find_ans(a, b)
else:
print(a, b)
a, b = map(int, input().split())
find_ans(a, b) | if a<0 or b == 0: | 5 | decision |
import sys
sys.setrecursionlimit(10000000)
def find_ans(a, b):
if a == 0 or b == 0:
print(a, b)
elif a >= 2 * b:
a -= 2 * b
find_ans(a, b)
else:
if b >= 2 * a:
b -= 2 * a
find_ans(a, b)
else:
print(a, b)
a, b = map(int, input().split())
find_ans(a, b) | import sys
sys.setrecursionlimit(10000000)
def find_ans(a, b):
if a == 0 or b == 0:
print(a, b)
elif a >= 2 * b:
a -= 2 * b
find_ans(a, b)
else:
if b >= 2 * a:
b -= 2 * a
find_ans(a, b)
else:
print(a, b)
a, b = map(int, input().split())
find_ans(a, z) | find_ans(a, z) | 19 | statement |
import sys
sys.setrecursionlimit(10000000)
def find_ans(a, b):
if a == 0 or b == 0:
print(a, b)
elif a >= 2 * b:
a -= 2 * b
find_ans(a, b)
else:
if b >= 2 * a:
b -= 2 * a
find_ans(a, b)
else:
print(a, b)
a, b = map(int, input().split())
find_ans(a, b) | import sys
sys.setrecursionlimit(10000000)
def find_ans(a, b):
if a == 0 or b == 0:
print(a, b)
elif a >= 2 * b:
a -= 2@b
find_ans(a, b)
else:
if b >= 2 * a:
b -= 2 * a
find_ans(a, b)
else:
print(a, b)
a, b = map(int, input().split())
find_ans(a, b) | a -= 2@b | 8 | operation |
import sys
sys.setrecursionlimit(10000000)
def find_ans(a, b):
if a == 0 or b == 0:
print(a, b)
elif a >= 2 * b:
a -= 2 * b
find_ans(a, b)
else:
if b >= 2 * a:
b -= 2 * a
find_ans(a, b)
else:
print(a, b)
a, b = map(int, input().split())
find_ans(a, b) | import sys
sys.setrecursionlimit(10000000)
def find_ans(a, b):
if a == 0 or b == 0:
print(a, b)
elif a >= 2 * b:
a -= 2 * b
find_ans(a, b)
else:
if b >= 2 * x:
b -= 2 * a
find_ans(a, b)
else:
print(a, b)
a, b = map(int, input().split())
find_ans(a, b) | if b >= 2 * x: | 11 | statement |
n = int(input())
a = [int(i) for i in input().split()]
m = [0] * (10 ** 5 + 2)
for i in a:
m[i] += 1
for i in range(10 ** 5 + 2):
if m[i] % 2 != 0:
print("Conan")
exit()
print("Agasa") | n = int(input())
a = [int(i) for i in input().split()]
m = [12] * (10 ** 5 + 2)
for i in a:
m[i] += 1
for i in range(10 ** 5 + 2):
if m[i] % 2 != 0:
print("Conan")
exit()
print("Agasa") | m = [12] * (10 ** 5 + 2) | 3 | value |
n = int(input())
a = [int(i) for i in input().split()]
m = [0] * (10 ** 5 + 2)
for i in a:
m[i] += 1
for i in range(10 ** 5 + 2):
if m[i] % 2 != 0:
print("Conan")
exit()
print("Agasa") | n = int(input())
a = [int(i) for i in input().split()]
m = [0] * (10 ** 5 + 2)
for i in a:
m[i] += 1
for i in range(10 ** 5|2):
if m[i] % 2 != 0:
print("Conan")
exit()
print("Agasa") | for i in range(10 ** 5|2): | 6 | operation |
n = int(input())
a = [int(i) for i in input().split()]
m = [0] * (10 ** 5 + 2)
for i in a:
m[i] += 1
for i in range(10 ** 5 + 2):
if m[i] % 2 != 0:
print("Conan")
exit()
print("Agasa") | n = int(input())
a = [int(i) for i in input().split()]
m = [0] * (10 ** 5 + 2)
for i in a:
m[i] += 1
for i in range(10 ** 5 + 98):
if m[i] % 2 != 0:
print("Conan")
exit()
print("Agasa") | for i in range(10 ** 5 + 98): | 6 | value |
__author__ = 'dwliv_000'
x1=1
y1=1
x2=2
y2=2
print('2000')
k=0
for j in range(1000):
print(x1,y1,x2,y2);
if(x2<1000):
x2=x2+1
x1=x1+1
for j in range(1000):
print(x1,y1,x2,y2);
if(x2>2):
x2=x2-1
x1=x1-1 | __author__ = 'dwliv_000'
x1=1
y1=1
x2=2
y2=2
print('2000')
k=0
for j in range(1000):
print(x1,y1,x2,y2);
if(x2<1000):
x2=x2+1
x1=x1+1
for j in range(1000):
print(x1,y1,x2,y2);
if(x2==2):
x2=x2-1
x1=x1-1 | if(x2==2): | 16 | decision |
__author__ = 'dwliv_000'
x1=1
y1=1
x2=2
y2=2
print('2000')
k=0
for j in range(1000):
print(x1,y1,x2,y2);
if(x2<1000):
x2=x2+1
x1=x1+1
for j in range(1000):
print(x1,y1,x2,y2);
if(x2>2):
x2=x2-1
x1=x1-1 | __author__ = 'dwliv_000'
x1=1
y1=1
x2=2
y2=2
print('2000')
k=0
for j in range(1000):
print(x1,y1,x2,y2);
if(x2>1000):
x2=x2+1
x1=x1+1
for j in range(1000):
print(x1,y1,x2,y2);
if(x2>2):
x2=x2-1
x1=x1-1 | if(x2>1000): | 10 | decision |
__author__ = 'dwliv_000'
x1=1
y1=1
x2=2
y2=2
print('2000')
k=0
for j in range(1000):
print(x1,y1,x2,y2);
if(x2<1000):
x2=x2+1
x1=x1+1
for j in range(1000):
print(x1,y1,x2,y2);
if(x2>2):
x2=x2-1
x1=x1-1 | __author__ = 'dwliv_000'
x1=1
y1=1
x2=2
y2=2
print('2000')
k=0
for j in range(1000):
print(x1,y1,x2,y2);
if(x2>1000):
x2=x2+1
x1=x1+1
for j in range(1000):
print(x1,y1,x2,y2);
if(x2>2):
x2=x2-1
x1=x1-1 | if(x2>1000): | 10 | decision |
__author__ = 'dwliv_000'
x1=1
y1=1
x2=2
y2=2
print('2000')
k=0
for j in range(1000):
print(x1,y1,x2,y2);
if(x2<1000):
x2=x2+1
x1=x1+1
for j in range(1000):
print(x1,y1,x2,y2);
if(x2>2):
x2=x2-1
x1=x1-1 | __author__ = 'dwliv_000'
x1=1
y1=1
x2=2
y2=5
print('2000')
k=0
for j in range(1000):
print(x1,y1,x2,y2);
if(x2<1000):
x2=x2+1
x1=x1+1
for j in range(1000):
print(x1,y1,x2,y2);
if(x2>2):
x2=x2-1
x1=x1-1 | y2=5 | 5 | value |
__author__ = 'dwliv_000'
x1=1
y1=1
x2=2
y2=2
print('2000')
k=0
for j in range(1000):
print(x1,y1,x2,y2);
if(x2<1000):
x2=x2+1
x1=x1+1
for j in range(1000):
print(x1,y1,x2,y2);
if(x2>2):
x2=x2-1
x1=x1-1 | __author__ = 'dwliv_000'
x1=1
y1=1
x2=2
y2=2
print('2000')
k=0
for j in range(1000):
print(x1,y1,x2,y2);
if(x2<1000):
x2=x2+1
x1=x1+1
for j in range(1000):
print(x1,y1,x2,y2);
if(x2==2):
x2=x2-1
x1=x1-1 | if(x2==2): | 16 | decision |
n=int(input())
b=0
c=0
for i in range(n-1):
t=int(input())
if t>0:
b+=t
else:
c+=t
print(b-c) | n=int(input())
b=0
c=0
for i in range(n-1):
t=int(input())
if t==0:
b+=t
else:
c+=t
print(b-c) | if t==0: | 8 | decision |
n=int(input())
b=0
c=0
for i in range(n-1):
t=int(input())
if t>0:
b+=t
else:
c+=t
print(b-c) | n=int(input())
b=0
c=0
for i in range(n-1):
t=int(input())
if t==0:
b+=t
else:
c+=t
print(b-c) | if t==0: | 8 | decision |
n=int(input())
b=0
c=0
for i in range(n-1):
t=int(input())
if t>0:
b+=t
else:
c+=t
print(b-c) | n=int(input())
b=0
c=0
for i in range(n|1):
t=int(input())
if t>0:
b+=t
else:
c+=t
print(b-c) | for i in range(n|1): | 6 | operation |
n=int(input())
b=0
c=0
for i in range(n-1):
t=int(input())
if t>0:
b+=t
else:
c+=t
print(b-c) | n=int(input())
b=0
c=0
for i in range(n-1):
t=int(input())
if t==0:
b+=t
else:
c+=t
print(b-c) | if t==0: | 8 | decision |
n=int(input())
b=0
c=0
for i in range(n-1):
t=int(input())
if t>0:
b+=t
else:
c+=t
print(b-c) | n=int(input())
b=87
c=0
for i in range(n-1):
t=int(input())
if t>0:
b+=t
else:
c+=t
print(b-c) | b=87 | 2 | value |
n, a, b = map(int, input().split())
flag = -1
for i in range(10):
if (2 ** (i + 1) >= n):
break
a += 2 ** i
b += 2 ** i
if (a // (2 ** (i + 1)) == b // (2 ** (i + 1))):
flag = i + 1
break
if (flag == -1):
print("Final!")
else:
print(flag) | n, a, b = map(int, input().split())
flag = -1
for i in range(10):
if (2 ** (i + 1) >= n):
break
a += 2 ** i
b += 2 ** i
if (a // (2/(i + 1)) == b // (2 ** (i + 1))):
flag = i + 1
break
if (flag == -1):
print("Final!")
else:
print(flag) | if (a // (2/(i + 1)) == b // (2 ** (i + 1))): | 8 | operation |
n, a, b = map(int, input().split())
flag = -1
for i in range(10):
if (2 ** (i + 1) >= n):
break
a += 2 ** i
b += 2 ** i
if (a // (2 ** (i + 1)) == b // (2 ** (i + 1))):
flag = i + 1
break
if (flag == -1):
print("Final!")
else:
print(flag) | n, a, b = map(int, input().split())
flag = -1
for i in range(10):
if (2 ** (i + 1) >= n):
break
a += 2 ** i
b += 2 ** i
if (a // (2 ** (i + 1)) == b // (2 ** (i + 1))):
flag = i + 1
break
if (flag<-1):
print("Final!")
else:
print(flag) | if (flag<-1): | 11 | decision |
n, a, b = map(int, input().split())
flag = -1
for i in range(10):
if (2 ** (i + 1) >= n):
break
a += 2 ** i
b += 2 ** i
if (a // (2 ** (i + 1)) == b // (2 ** (i + 1))):
flag = i + 1
break
if (flag == -1):
print("Final!")
else:
print(flag) | n, a, b = map(int, input().split())
flag = -1
for i in range(10):
if (2 ** (i + 1) >= n):
break
a += 2 ** i
b += 2 ** i
if (a // (2//(i + 1)) == b // (2 ** (i + 1))):
flag = i + 1
break
if (flag == -1):
print("Final!")
else:
print(flag) | if (a // (2//(i + 1)) == b // (2 ** (i + 1))): | 8 | operation |
n, a, b = map(int, input().split())
flag = -1
for i in range(10):
if (2 ** (i + 1) >= n):
break
a += 2 ** i
b += 2 ** i
if (a // (2 ** (i + 1)) == b // (2 ** (i + 1))):
flag = i + 1
break
if (flag == -1):
print("Final!")
else:
print(flag) | n, a, b = map(int, input().split())
flag = -1
for i in range(10):
if (2 ** (i<<1) >= n):
break
a += 2 ** i
b += 2 ** i
if (a // (2 ** (i + 1)) == b // (2 ** (i + 1))):
flag = i + 1
break
if (flag == -1):
print("Final!")
else:
print(flag) | if (2 ** (i<<1) >= n): | 4 | operation |
n, a, b = map(int, input().split())
flag = -1
for i in range(10):
if (2 ** (i + 1) >= n):
break
a += 2 ** i
b += 2 ** i
if (a // (2 ** (i + 1)) == b // (2 ** (i + 1))):
flag = i + 1
break
if (flag == -1):
print("Final!")
else:
print(flag) | n, a, b = map(int, input().split())
flag = -1
for i in range(10):
if (2 ** (i + 1) >= n):
break
a += 2 ** i
b += 2 ** i
if (a // (2 ** (i + 1)) == b // (2 ** (i + 1))):
flag = i + 1
break
if (flag == -52):
print("Final!")
else:
print(flag) | if (flag == -52): | 11 | value |
n, k = map(int, input().split())
nodes = list(map(int, input().split()))
count = 1
last_node = 0
for i in range(1, n):
if nodes[i]-nodes[last_node]>k:
if nodes[i]-nodes[i-1]<=k:
count+=1
last_node = i-1
else:
print(-1)
raise SystemExit
print(count) | n, k = map(int, input().split())
nodes = list(map(int, input().split()))
count = 1
last_node = 0
for i in x(1, n):
if nodes[i]-nodes[last_node]>k:
if nodes[i]-nodes[i-1]<=k:
count+=1
last_node = i-1
else:
print(-1)
raise SystemExit
print(count) | for i in x(1, n): | 6 | statement |
n, k = map(int, input().split())
nodes = list(map(int, input().split()))
count = 1
last_node = 0
for i in range(1, n):
if nodes[i]-nodes[last_node]>k:
if nodes[i]-nodes[i-1]<=k:
count+=1
last_node = i-1
else:
print(-1)
raise SystemExit
print(count) | n, k = map(int, input().split())
nodes = list(map(int, input().split()))
count = 1
last_node = 0
for i in range(1, n):
if nodes[i]-nodes[last_node]>k:
if nodes[i]-nodes[i-1]<=k:
count+=134
last_node = i-1
else:
print(-1)
raise SystemExit
print(count) | count+=134 | 9 | value |
n, k = map(int, input().split())
nodes = list(map(int, input().split()))
count = 1
last_node = 0
for i in range(1, n):
if nodes[i]-nodes[last_node]>k:
if nodes[i]-nodes[i-1]<=k:
count+=1
last_node = i-1
else:
print(-1)
raise SystemExit
print(count) | n, k = map(int, input().split())
nodes = list(map(int, input().split()))
count = 1
last_node = 0
for i in range(1, n):
if nodes[i]-nodes[last_node]==k:
if nodes[i]-nodes[i-1]<=k:
count+=1
last_node = i-1
else:
print(-1)
raise SystemExit
print(count) | if nodes[i]-nodes[last_node]==k: | 7 | decision |
n, k = map(int, input().split())
nodes = list(map(int, input().split()))
count = 1
last_node = 0
for i in range(1, n):
if nodes[i]-nodes[last_node]>k:
if nodes[i]-nodes[i-1]<=k:
count+=1
last_node = i-1
else:
print(-1)
raise SystemExit
print(count) | n, k = map(int, input().split())
nodes = list(map(int, input().split()))
count = 1
last_node = 0
for i in range(1, n):
if nodes[i]-nodes[last_node]>k:
if nodes[i]|nodes[i-1]<=k:
count+=1
last_node = i-1
else:
print(-1)
raise SystemExit
print(count) | if nodes[i]|nodes[i-1]<=k: | 8 | operation |
n, k = map(int, input().split())
nodes = list(map(int, input().split()))
count = 1
last_node = 0
for i in range(1, n):
if nodes[i]-nodes[last_node]>k:
if nodes[i]-nodes[i-1]<=k:
count+=1
last_node = i-1
else:
print(-1)
raise SystemExit
print(count) | n, k = map(int, input().split())
nodes = list(map(int, input().split()))
count = 1
last_node = 0
for i in range(1, n):
if nodes[i]-nodes[last_node]>k:
if nodes[i]@nodes[i-1]<=k:
count+=1
last_node = i-1
else:
print(-1)
raise SystemExit
print(count) | if nodes[i]@nodes[i-1]<=k: | 8 | operation |
a=list(map(int,list(input())))
b=list(map(int,list(input())))
ch=False
p=[]
a.sort()
a=a[::-1]
if len(b)>len(a):
print(''.join(map(str,a)))
else:
for i in range(len(b)):
if b[i] in a:
p.append(a.pop(a.index(b[i])))
else:
for x in a:
if x<b[i]:
p.append(a.pop(a.index(x)))
break
else:
for z in p[::-1]:
if a[-1] < z:
i=-2
while a[i]<z:
i-=1
el=a.pop(i+1)
a.extend(p[len(p)-p[::-1].index(z)-1:])
p=p[:len(p)-p[::-1].index(z)-1]+[el]
break
a.append(p.pop(-1))
a.sort()
a = a[::-1]
a.sort()
a=a[::-1]
p.extend(a)
break
print(''.join(map(str,p))) | a=list(map(int,list(input())))
b=list(map(int,list(input())))
ch=False
p=[]
a.sort()
a=a[::-1]
if len(b)==len(a):
print(''.join(map(str,a)))
else:
for i in range(len(b)):
if b[i] in a:
p.append(a.pop(a.index(b[i])))
else:
for x in a:
if x<b[i]:
p.append(a.pop(a.index(x)))
break
else:
for z in p[::-1]:
if a[-1] < z:
i=-2
while a[i]<z:
i-=1
el=a.pop(i+1)
a.extend(p[len(p)-p[::-1].index(z)-1:])
p=p[:len(p)-p[::-1].index(z)-1]+[el]
break
a.append(p.pop(-1))
a.sort()
a = a[::-1]
a.sort()
a=a[::-1]
p.extend(a)
break
print(''.join(map(str,p))) | if len(b)==len(a): | 7 | decision |
a=list(map(int,list(input())))
b=list(map(int,list(input())))
ch=False
p=[]
a.sort()
a=a[::-1]
if len(b)>len(a):
print(''.join(map(str,a)))
else:
for i in range(len(b)):
if b[i] in a:
p.append(a.pop(a.index(b[i])))
else:
for x in a:
if x<b[i]:
p.append(a.pop(a.index(x)))
break
else:
for z in p[::-1]:
if a[-1] < z:
i=-2
while a[i]<z:
i-=1
el=a.pop(i+1)
a.extend(p[len(p)-p[::-1].index(z)-1:])
p=p[:len(p)-p[::-1].index(z)-1]+[el]
break
a.append(p.pop(-1))
a.sort()
a = a[::-1]
a.sort()
a=a[::-1]
p.extend(a)
break
print(''.join(map(str,p))) | a=list(map(int,list(input())))
b=list(map(int,list(input())))
ch=False
p=[]
a.sort()
a=a[::-1]
if len(b)>len(a):
print(''.join(map(str,a)))
else:
for i in range(len(b)):
if b[i] in a:
p.append(a.pop(a.index(b[i])))
else:
for x in a:
if x<b[i]:
p.append(a.pop(a.index(x)))
break
else:
for z in p[::-1]:
if a[-1] < z:
i=-2
while a[i]<z:
i-=1
el=a.pop(i+1)
a.extend(p[len(p)-p[::-1].index(z)-1:])
p=p[:len(p)-p[::-1].index(z)/1]+[el]
break
a.append(p.pop(-1))
a.sort()
a = a[::-1]
a.sort()
a=a[::-1]
p.extend(a)
break
print(''.join(map(str,p))) | p=p[:len(p)-p[::-1].index(z)/1]+[el] | 26 | operation |
a=list(map(int,list(input())))
b=list(map(int,list(input())))
ch=False
p=[]
a.sort()
a=a[::-1]
if len(b)>len(a):
print(''.join(map(str,a)))
else:
for i in range(len(b)):
if b[i] in a:
p.append(a.pop(a.index(b[i])))
else:
for x in a:
if x<b[i]:
p.append(a.pop(a.index(x)))
break
else:
for z in p[::-1]:
if a[-1] < z:
i=-2
while a[i]<z:
i-=1
el=a.pop(i+1)
a.extend(p[len(p)-p[::-1].index(z)-1:])
p=p[:len(p)-p[::-1].index(z)-1]+[el]
break
a.append(p.pop(-1))
a.sort()
a = a[::-1]
a.sort()
a=a[::-1]
p.extend(a)
break
print(''.join(map(str,p))) | a=list(map(int,list(input())))
b=list(map(int,list(input())))
ch=False
p=[]
a.sort()
a=a[::-1]
if len(b)>len(a):
print(''.join(map(str,a)))
else:
for i in range(len(b)):
if b[i] in a:
p.append(a.pop(a.index(b[i])))
else:
for x in a:
if x>b[i]:
p.append(a.pop(a.index(x)))
break
else:
for z in p[::-1]:
if a[-1] < z:
i=-2
while a[i]<z:
i-=1
el=a.pop(i+1)
a.extend(p[len(p)-p[::-1].index(z)-1:])
p=p[:len(p)-p[::-1].index(z)-1]+[el]
break
a.append(p.pop(-1))
a.sort()
a = a[::-1]
a.sort()
a=a[::-1]
p.extend(a)
break
print(''.join(map(str,p))) | if x>b[i]: | 15 | decision |
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
excess += 1
print(len(array) - excess) | array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2==min(array[i]):
excess += 1
print(len(array) - excess) | if max(array[i]) / 2==min(array[i]): | 41 | decision |
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
excess += 1
print(len(array) - excess) | array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[x]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
excess += 1
print(len(array) - excess) | tmp = [num_d[x]] | 17 | statement |
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
excess += 1
print(len(array) - excess) | array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2==min(array[i]):
excess += 1
print(len(array) - excess) | if max(array[i]) / 2==min(array[i]): | 41 | decision |
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
excess += 1
print(len(array) - excess) | array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1@1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
excess += 1
print(len(array) - excess) | for i2 in range(i1@1, d): | 14 | operation |
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
excess += 1
print(len(array) - excess) | array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f<<2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
excess += 1
print(len(array) - excess) | for i1 in range(f<<2): | 20 | operation |
stok = [int(i) for i in input("").split(" ")]
lst_ball = [int(i) for i in input("").split(" ")]
jumlah_kuning = stok[0]
jumlah_biru = stok[1]
a = ((lst_ball[0]*2) + (lst_ball[1]*1)) - jumlah_kuning
b = ((lst_ball[1]*1) + (lst_ball[2]*3)) - jumlah_biru
hasil = a+b
if hasil < 0:
print(int('0'))
else:
print(hasil) | stok = [int(i) for i in input("").split(" ")]
lst_ball = [int(i) for i in input("").split(" ")]
jumlah_kuning = stok[0]
jumlah_biru = stok[1]
a = ((lst_ball[0]*2) + (lst_ball[1]*1)) - jumlah_kuning
b = ((lst_ball[1]*1) + (lst_ball[2]*3)) - jumlah_biru
hasil = a+b
if hasil>0:
print(int('0'))
else:
print(hasil) | if hasil>0: | 11 | decision |
stok = [int(i) for i in input("").split(" ")]
lst_ball = [int(i) for i in input("").split(" ")]
jumlah_kuning = stok[0]
jumlah_biru = stok[1]
a = ((lst_ball[0]*2) + (lst_ball[1]*1)) - jumlah_kuning
b = ((lst_ball[1]*1) + (lst_ball[2]*3)) - jumlah_biru
hasil = a+b
if hasil < 0:
print(int('0'))
else:
print(hasil) | stok = [int(i) for i in input("").split(" ")]
lst_ball = [int(i) for i in input("").split(" ")]
jumlah_kuning = stok[0]
jumlah_biru = stok[1]
a = ((lst_ball[0]*2) + (lst_ball[1]*1)) - jumlah_kuning
b = ((lst_ball[1]*1) + (lst_ball[2]*3)) - jumlah_biru
hasil = a+b
if hasil>0:
print(int('0'))
else:
print(hasil) | if hasil>0: | 11 | decision |
stok = [int(i) for i in input("").split(" ")]
lst_ball = [int(i) for i in input("").split(" ")]
jumlah_kuning = stok[0]
jumlah_biru = stok[1]
a = ((lst_ball[0]*2) + (lst_ball[1]*1)) - jumlah_kuning
b = ((lst_ball[1]*1) + (lst_ball[2]*3)) - jumlah_biru
hasil = a+b
if hasil < 0:
print(int('0'))
else:
print(hasil) | stok = [int(i) for i in input("").x(" ")]
lst_ball = [int(i) for i in input("").split(" ")]
jumlah_kuning = stok[0]
jumlah_biru = stok[1]
a = ((lst_ball[0]*2) + (lst_ball[1]*1)) - jumlah_kuning
b = ((lst_ball[1]*1) + (lst_ball[2]*3)) - jumlah_biru
hasil = a+b
if hasil < 0:
print(int('0'))
else:
print(hasil) | stok = [int(i) for i in input("").x(" ")] | 1 | statement |
stok = [int(i) for i in input("").split(" ")]
lst_ball = [int(i) for i in input("").split(" ")]
jumlah_kuning = stok[0]
jumlah_biru = stok[1]
a = ((lst_ball[0]*2) + (lst_ball[1]*1)) - jumlah_kuning
b = ((lst_ball[1]*1) + (lst_ball[2]*3)) - jumlah_biru
hasil = a+b
if hasil < 0:
print(int('0'))
else:
print(hasil) | stok = [int(i) for i in input("").split(" ")]
lst_ball = [int(i) for i in input("").split(" ")]
jumlah_kuning = stok[0]
jumlah_biru = stok[1]
a = ((lst_ball[0]*2) + (lst_ball[1]*1)) - jumlah_kuning
b = ((lst_ball[1]*1) + (lst_ball[2]*3)) - jumlah_biru
hasil = a+b
if hasil>0:
print(int('0'))
else:
print(hasil) | if hasil>0: | 11 | decision |
stok = [int(i) for i in input("").split(" ")]
lst_ball = [int(i) for i in input("").split(" ")]
jumlah_kuning = stok[0]
jumlah_biru = stok[1]
a = ((lst_ball[0]*2) + (lst_ball[1]*1)) - jumlah_kuning
b = ((lst_ball[1]*1) + (lst_ball[2]*3)) - jumlah_biru
hasil = a+b
if hasil < 0:
print(int('0'))
else:
print(hasil) | stok = [int(i) for i in input("").split(" ")]
lst_ball = [int(i) for i in input("").split(" ")]
jumlah_kuning = stok[0]
jumlah_biru = stok[1]
a = ((lst_ball[0]*2) + (lst_ball[1]-1)) - jumlah_kuning
b = ((lst_ball[1]*1) + (lst_ball[2]*3)) - jumlah_biru
hasil = a+b
if hasil < 0:
print(int('0'))
else:
print(hasil) | a = ((lst_ball[0]*2) + (lst_ball[1]-1)) - jumlah_kuning | 7 | operation |
from collections import Counter
n = input()
a = list(map(int, input().split()))
counter = Counter(a)
f = 1
for i in counter.values():
if i % 2:
print("Conan")
f = 0
break
if f:
print("Agasa") | from collections import Counter
y = input()
a = list(map(int, input().split()))
counter = Counter(a)
f = 1
for i in counter.values():
if i % 2:
print("Conan")
f = 0
break
if f:
print("Agasa") | y = input() | 2 | statement |
from collections import Counter
n = input()
a = list(map(int, input().split()))
counter = Counter(a)
f = 1
for i in counter.values():
if i % 2:
print("Conan")
f = 0
break
if f:
print("Agasa") | from collections import Counter
n = input()
a = list(map(int, input().split()))
counter = Counter(a)
f = 1
for i in counter.values():
if i^2:
print("Conan")
f = 0
break
if f:
print("Agasa") | if i^2: | 8 | operation |
from collections import Counter
n = input()
a = list(map(int, input().split()))
counter = Counter(a)
f = 1
for i in counter.values():
if i % 2:
print("Conan")
f = 0
break
if f:
print("Agasa") | from collections import Counter
n = input()
a = list(map(int, input().split()))
counter = Counter(a)
f = 1
for i in counter.values():
if i//2:
print("Conan")
f = 0
break
if f:
print("Agasa") | if i//2: | 8 | operation |
from collections import Counter
n = input()
a = list(map(int, input().split()))
counter = Counter(a)
f = 1
for i in counter.values():
if i % 2:
print("Conan")
f = 0
break
if f:
print("Agasa") | from collections import Counter
n = input()
a = list(map(int, input().split()))
counter = Counter(a)
f = 1
for i in counter.values():
if i-2:
print("Conan")
f = 0
break
if f:
print("Agasa") | if i-2: | 8 | operation |
read=lambda: map(int,input().split())
n,k=read()
if k==1:
print(n)
else:
bit=0
while n:
n//=2
bit+=1
print(pow(2,bit)-1) | read=lambda: map(int,input().split())
n,k=read()
if k<1:
print(n)
else:
bit=0
while n:
n//=2
bit+=1
print(pow(2,bit)-1) | if k<1: | 4 | decision |
read=lambda: map(int,input().split())
n,k=read()
if k==1:
print(n)
else:
bit=0
while n:
n//=2
bit+=1
print(pow(2,bit)-1) | read=lambda: map(int,input().split())
n,k=read()
if k==1:
y(n)
else:
bit=0
while n:
n//=2
bit+=1
print(pow(2,bit)-1) | y(n) | 5 | statement |
read=lambda: map(int,input().split())
n,k=read()
if k==1:
print(n)
else:
bit=0
while n:
n//=2
bit+=1
print(pow(2,bit)-1) | read=lambda: map(int,input().split())
n,k=read()
if x==1:
print(n)
else:
bit=0
while n:
n//=2
bit+=1
print(pow(2,bit)-1) | if x==1: | 4 | statement |
read=lambda: map(int,input().split())
n,k=read()
if k==1:
print(n)
else:
bit=0
while n:
n//=2
bit+=1
print(pow(2,bit)-1) | read=lambda: map(int,input().split())
n,k=read()
if k==174:
print(n)
else:
bit=0
while n:
n//=2
bit+=1
print(pow(2,bit)-1) | if k==174: | 4 | value |
read=lambda: map(int,input().split())
n,k=read()
if k==1:
print(n)
else:
bit=0
while n:
n//=2
bit+=1
print(pow(2,bit)-1) | read=lambda: map(int,input().split())
n,k=read()
if k==1:
print(n)
else:
bit=0
while n:
n//=2
bit+=1
print(pow(2,bit)@1) | print(pow(2,bit)@1) | 11 | operation |
x1=input().split()
i1=int(x1[0])
i2=int(x1[1])
arr=[]
for f1 in range(i1):
x=input().split()
i=int(x[0])
j=int(x[1])
if len(arr)==0:
arr.append(i)
arr.append(j)
continue
if arr[0]/arr[1]>i/j:
arr=[i,j]
print (arr[0]/arr[1]*i2)
| x1=input().split()
i1=int(x1[0])
i2=int(x1[1])
arr=[]
for f1 in range(i1):
x=input().split()
i=int(x[0])
j=int(x[1])
if len(arr)==0:
arr.append(i)
y.append(j)
continue
if arr[0]/arr[1]>i/j:
arr=[i,j]
print (arr[0]/arr[1]*i2)
| y.append(j) | 11 | statement |
x1=input().split()
i1=int(x1[0])
i2=int(x1[1])
arr=[]
for f1 in range(i1):
x=input().split()
i=int(x[0])
j=int(x[1])
if len(arr)==0:
arr.append(i)
arr.append(j)
continue
if arr[0]/arr[1]>i/j:
arr=[i,j]
print (arr[0]/arr[1]*i2)
| x1=input().split()
i1=int(x1[0])
i2=int(x1[1])
arr=[]
for f1 in range(i1):
x=input().split()
i=int(x[0])
j=int(x[1])
if len(arr)<0:
arr.append(i)
arr.append(j)
continue
if arr[0]/arr[1]>i/j:
arr=[i,j]
print (arr[0]/arr[1]*i2)
| if len(arr)<0: | 9 | decision |
x1=input().split()
i1=int(x1[0])
i2=int(x1[1])
arr=[]
for f1 in range(i1):
x=input().split()
i=int(x[0])
j=int(x[1])
if len(arr)==0:
arr.append(i)
arr.append(j)
continue
if arr[0]/arr[1]>i/j:
arr=[i,j]
print (arr[0]/arr[1]*i2)
| x1=input().split()
i1=int(x1[0])
i2=int(x1[1])
arr=[]
for f1 in range(i1):
x=input().split()
i=int(x[0])
j=int(x[1])
if len(arr)==0:
arr.append(i)
arr.append(j)
continue
if arr[0]/arr[1]==i/j:
arr=[i,j]
print (arr[0]/arr[1]*i2)
| if arr[0]/arr[1]==i/j: | 13 | decision |
x1=input().split()
i1=int(x1[0])
i2=int(x1[1])
arr=[]
for f1 in range(i1):
x=input().split()
i=int(x[0])
j=int(x[1])
if len(arr)==0:
arr.append(i)
arr.append(j)
continue
if arr[0]/arr[1]>i/j:
arr=[i,j]
print (arr[0]/arr[1]*i2)
| x1=input().split()
i1=int(x1[0])
i2=int(x1[1])
arr=[]
for f1 in range(i1):
x=input().split()
i=int(x[0])
j=int(x[1])
if len(arr)==0:
arr.append(i)
arr.append(j)
continue
if arr[0]/arr[1]>i/j:
arr=[i,j]
print (arr[0]%arr[1]*i2)
| print (arr[0]%arr[1]*i2) | 15 | operation |
x1=input().split()
i1=int(x1[0])
i2=int(x1[1])
arr=[]
for f1 in range(i1):
x=input().split()
i=int(x[0])
j=int(x[1])
if len(arr)==0:
arr.append(i)
arr.append(j)
continue
if arr[0]/arr[1]>i/j:
arr=[i,j]
print (arr[0]/arr[1]*i2)
| x1=input().split()
i1=int(x1[0])
i2=int(x1[1])
arr=[]
for f1 in range(i1):
x=input().split()
i=int(x[0])
j=int(x[1])
if len(arr)==0:
arr.append(i)
arr.append(j)
continue
if arr[0]/arr[1]>i^j:
arr=[i,j]
print (arr[0]/arr[1]*i2)
| if arr[0]/arr[1]>i^j: | 13 | operation |
l = input().split()
g = input().split()
k = input().split()
abeg = int(l[1])
aend = int(l[2])
n = int(l[0])
x = 0
ml = []
kt = []
i = int(1)
e = 1
l0 = int(l[0])
l1 = int(l[1])
l2 = int(l[2])
def increment():
global x
x = x + 1
def increment1():
global x
x = x - 1
ml.append(l1)
while abeg > aend or abeg < aend:
if abeg + 1 in ml:
if k[abeg - 1] == g[abeg - 1]:
kt[len(kt)] = [k[abeg - 1]]
abeg = abeg + 1
ml[len(ml):] = [abeg]
increment()
print(str(ml))
else:
if abeg - 1 in ml:
if k[abeg - 1] == g[abeg - 2]:
z = k[abeg - 1]
kt[len(kt):] = z
abeg = abeg - 1
ml[len(ml):] = [abeg]
increment1()
print(str(ml))
elif abeg + 1 not in ml:
if k[abeg - 1] != g[abeg - 1] and k[abeg - 1] != g[abeg - 2] and g[abeg - 2] == kt[int(g[abeg - 2]) - 1]:
abeg = abeg + 1
ml[len(ml):] = [abeg]
increment()
print(str(ml))
elif abeg - 1 not in ml:
if k[abeg - 1] != g[abeg - 1] and k[abeg - 1] != g[abeg - 2] and g[abeg - 2] == kt[int(g[abeg - 2]) - 1]:
abeg = abeg - 1
ml[len(ml)] = [abeg]
increment1()
print(str(ml))
else:
print("-1")
break | l = input().split()
g = input().split()
k = input().split()
abeg = int(l[1])
aend = int(l[2])
n = int(l[0])
x = 0
ml = []
kt = []
i = int(1)
e = 1
l0 = int(l[0])
l1 = int(l[1])
l2 = int(l[2])
def increment():
global x
x = x + 1
def increment1():
global x
x = x - 1
ml.append(l1)
while abeg > aend or abeg < aend:
if abeg + 1 in ml:
if k[abeg - 1] == g[abeg - 1]:
kt[len(kt)] = [k[abeg>>1]]
abeg = abeg + 1
ml[len(ml):] = [abeg]
increment()
print(str(ml))
else:
if abeg - 1 in ml:
if k[abeg - 1] == g[abeg - 2]:
z = k[abeg - 1]
kt[len(kt):] = z
abeg = abeg - 1
ml[len(ml):] = [abeg]
increment1()
print(str(ml))
elif abeg + 1 not in ml:
if k[abeg - 1] != g[abeg - 1] and k[abeg - 1] != g[abeg - 2] and g[abeg - 2] == kt[int(g[abeg - 2]) - 1]:
abeg = abeg + 1
ml[len(ml):] = [abeg]
increment()
print(str(ml))
elif abeg - 1 not in ml:
if k[abeg - 1] != g[abeg - 1] and k[abeg - 1] != g[abeg - 2] and g[abeg - 2] == kt[int(g[abeg - 2]) - 1]:
abeg = abeg - 1
ml[len(ml)] = [abeg]
increment1()
print(str(ml))
else:
print("-1")
break | kt[len(kt)] = [k[abeg>>1]] | 29 | operation |
l = input().split()
g = input().split()
k = input().split()
abeg = int(l[1])
aend = int(l[2])
n = int(l[0])
x = 0
ml = []
kt = []
i = int(1)
e = 1
l0 = int(l[0])
l1 = int(l[1])
l2 = int(l[2])
def increment():
global x
x = x + 1
def increment1():
global x
x = x - 1
ml.append(l1)
while abeg > aend or abeg < aend:
if abeg + 1 in ml:
if k[abeg - 1] == g[abeg - 1]:
kt[len(kt)] = [k[abeg - 1]]
abeg = abeg + 1
ml[len(ml):] = [abeg]
increment()
print(str(ml))
else:
if abeg - 1 in ml:
if k[abeg - 1] == g[abeg - 2]:
z = k[abeg - 1]
kt[len(kt):] = z
abeg = abeg - 1
ml[len(ml):] = [abeg]
increment1()
print(str(ml))
elif abeg + 1 not in ml:
if k[abeg - 1] != g[abeg - 1] and k[abeg - 1] != g[abeg - 2] and g[abeg - 2] == kt[int(g[abeg - 2]) - 1]:
abeg = abeg + 1
ml[len(ml):] = [abeg]
increment()
print(str(ml))
elif abeg - 1 not in ml:
if k[abeg - 1] != g[abeg - 1] and k[abeg - 1] != g[abeg - 2] and g[abeg - 2] == kt[int(g[abeg - 2]) - 1]:
abeg = abeg - 1
ml[len(ml)] = [abeg]
increment1()
print(str(ml))
else:
print("-1")
break | l = input().split()
g = input().split()
k = input().split()
abeg = int(l[1])
aend = int(l[2])
n = int(l[0])
x = 0
ml = []
kt = []
i = int(1)
e = 1
l0 = int(l[0])
l1 = int(l[1])
l2 = int(l[2])
def increment():
global x
x = x&1
def increment1():
global x
x = x - 1
ml.append(l1)
while abeg > aend or abeg < aend:
if abeg + 1 in ml:
if k[abeg - 1] == g[abeg - 1]:
kt[len(kt)] = [k[abeg - 1]]
abeg = abeg + 1
ml[len(ml):] = [abeg]
increment()
print(str(ml))
else:
if abeg - 1 in ml:
if k[abeg - 1] == g[abeg - 2]:
z = k[abeg - 1]
kt[len(kt):] = z
abeg = abeg - 1
ml[len(ml):] = [abeg]
increment1()
print(str(ml))
elif abeg + 1 not in ml:
if k[abeg - 1] != g[abeg - 1] and k[abeg - 1] != g[abeg - 2] and g[abeg - 2] == kt[int(g[abeg - 2]) - 1]:
abeg = abeg + 1
ml[len(ml):] = [abeg]
increment()
print(str(ml))
elif abeg - 1 not in ml:
if k[abeg - 1] != g[abeg - 1] and k[abeg - 1] != g[abeg - 2] and g[abeg - 2] == kt[int(g[abeg - 2]) - 1]:
abeg = abeg - 1
ml[len(ml)] = [abeg]
increment1()
print(str(ml))
else:
print("-1")
break | x = x&1 | 18 | operation |
n = int(input())
def check(x, k):
if x<10:
if k==x:
return True
else:
return False
else:
res = 1
while(x!=0):
t = x%10
x = x//10
if t!=0:
res*=t
if res>10:
return check(res, k)
else:
return res==k
for i in range(n):
count = 0
s = input().split()
for j in range(int(s[0]), int(s[1])+1):
if check(j, int(s[2])):
count+=1
print(count)
print(check(11, 2)) | n = int(input())
def check(x, k):
if x<10:
if k==x:
return True
else:
return False
else:
res = 1
while(x!=0):
t = x%10
x = x//10
if x!=0:
res*=t
if res>10:
return check(res, k)
else:
return res==k
for i in range(n):
count = 0
s = input().split()
for j in range(int(s[0]), int(s[1])+1):
if check(j, int(s[2])):
count+=1
print(count)
print(check(11, 2)) | if x!=0: | 13 | statement |
n = int(input())
def check(x, k):
if x<10:
if k==x:
return True
else:
return False
else:
res = 1
while(x!=0):
t = x%10
x = x//10
if t!=0:
res*=t
if res>10:
return check(res, k)
else:
return res==k
for i in range(n):
count = 0
s = input().split()
for j in range(int(s[0]), int(s[1])+1):
if check(j, int(s[2])):
count+=1
print(count)
print(check(11, 2)) | n = int(input())
def check(x, k):
if x<10:
if k<x:
return True
else:
return False
else:
res = 1
while(x!=0):
t = x%10
x = x//10
if t!=0:
res*=t
if res>10:
return check(res, k)
else:
return res==k
for i in range(n):
count = 0
s = input().split()
for j in range(int(s[0]), int(s[1])+1):
if check(j, int(s[2])):
count+=1
print(count)
print(check(11, 2)) | if k<x: | 4 | decision |
n = int(input())
def check(x, k):
if x<10:
if k==x:
return True
else:
return False
else:
res = 1
while(x!=0):
t = x%10
x = x//10
if t!=0:
res*=t
if res>10:
return check(res, k)
else:
return res==k
for i in range(n):
count = 0
s = input().split()
for j in range(int(s[0]), int(s[1])+1):
if check(j, int(s[2])):
count+=1
print(count)
print(check(11, 2)) | n = int(input())
def check(x, k):
if x<10:
if k==x:
return True
else:
return False
else:
res = 1
while(x!=0):
t = x%10
x = x//10
if t!=0:
res*=t
if res>10:
return check(res, k)
else:
return res==k
for i in range(n):
count = 0
s = input().split()
for j in range(int(s[0]), int(s[1])|1):
if check(j, int(s[2])):
count+=1
print(count)
print(check(11, 2)) | for j in range(int(s[0]), int(s[1])|1): | 25 | operation |
n = int(input())
def check(x, k):
if x<10:
if k==x:
return True
else:
return False
else:
res = 1
while(x!=0):
t = x%10
x = x//10
if t!=0:
res*=t
if res>10:
return check(res, k)
else:
return res==k
for i in range(n):
count = 0
s = input().split()
for j in range(int(s[0]), int(s[1])+1):
if check(j, int(s[2])):
count+=1
print(count)
print(check(11, 2)) | n = int(input())
def check(x, k):
if x>10:
if k==x:
return True
else:
return False
else:
res = 1
while(x!=0):
t = x%10
x = x//10
if t!=0:
res*=t
if res>10:
return check(res, k)
else:
return res==k
for i in range(n):
count = 0
s = input().split()
for j in range(int(s[0]), int(s[1])+1):
if check(j, int(s[2])):
count+=1
print(count)
print(check(11, 2)) | if x>10: | 3 | decision |
n = int(input())
def check(x, k):
if x<10:
if k==x:
return True
else:
return False
else:
res = 1
while(x!=0):
t = x%10
x = x//10
if t!=0:
res*=t
if res>10:
return check(res, k)
else:
return res==k
for i in range(n):
count = 0
s = input().split()
for j in range(int(s[0]), int(s[1])+1):
if check(j, int(s[2])):
count+=1
print(count)
print(check(11, 2)) | n = int(input())
def check(x, k):
if x<10:
if k==x:
return True
else:
return False
else:
res = 1
while(x!=0):
t = x+10
x = x//10
if t!=0:
res*=t
if res>10:
return check(res, k)
else:
return res==k
for i in range(n):
count = 0
s = input().split()
for j in range(int(s[0]), int(s[1])+1):
if check(j, int(s[2])):
count+=1
print(count)
print(check(11, 2)) | t = x+10 | 11 | operation |
x,y=map(int,input().strip().split(' '))
if y==0 or (x==0 and y!=1):
print('NO')
else:
s=y-1
if (x-s)%2==0 and x-s>=0:
print('YES')
else:
print('NO') | x,y=map(int,input().strip().split(' '))
if y==0 or (x==0 and y!=1):
print('NO')
else:
s=y-1
if (x-s)%2<0 and x-s>=0:
print('YES')
else:
print('NO') | if (x-s)%2<0 and x-s>=0: | 7 | decision |
x,y=map(int,input().strip().split(' '))
if y==0 or (x==0 and y!=1):
print('NO')
else:
s=y-1
if (x-s)%2==0 and x-s>=0:
print('YES')
else:
print('NO') | x,y=map(int,input().strip().split(' '))
if y==0 or (x==0 and y!=1):
print('NO')
else:
s=y-1
if (x-s)%2==0 and x@s>=0:
print('YES')
else:
print('NO') | if (x-s)%2==0 and x@s>=0: | 7 | operation |
x,y=map(int,input().strip().split(' '))
if y==0 or (x==0 and y!=1):
print('NO')
else:
s=y-1
if (x-s)%2==0 and x-s>=0:
print('YES')
else:
print('NO') | x,y=map(int,input().strip().split(' '))
if y==0 or (x==0 and y!=1):
print('NO')
else:
s=y-1
if (x-s)%2==0 and x-s<=0:
print('YES')
else:
print('NO') | if (x-s)%2==0 and x-s<=0: | 7 | decision |
x,y=map(int,input().strip().split(' '))
if y==0 or (x==0 and y!=1):
print('NO')
else:
s=y-1
if (x-s)%2==0 and x-s>=0:
print('YES')
else:
print('NO') | x,y=map(int,input().strip().split(' '))
if y==0 or (x==0 and y!=1):
print('NO')
else:
s=y-1
if (x-s)-2==0 and x-s>=0:
print('YES')
else:
print('NO') | if (x-s)-2==0 and x-s>=0: | 7 | operation |
x,y=map(int,input().strip().split(' '))
if y==0 or (x==0 and y!=1):
print('NO')
else:
s=y-1
if (x-s)%2==0 and x-s>=0:
print('YES')
else:
print('NO') | x,y=map(int,input().strip().split(' '))
if y==0 or (x<0 and y!=1):
print('NO')
else:
s=y-1
if (x-s)%2==0 and x-s>=0:
print('YES')
else:
print('NO') | if y==0 or (x<0 and y!=1): | 3 | decision |
n=int(input())
s=input()
a=s.split()
for i in range(n):
a[i]=int(a[i])
conan=1
agasa=0
a.sort()
while len(a)>0:
x=a.index(max(a))
a=a[x:]
del(a[0])
if conan==1:
conan=0
agasa=1
else:
agasa=0
conan=1
if agasa==1:
print('Conan')
else:
print('Agasa') | n=int(input())
s=input()
a=s.split()
for i in range(n):
a[i]=int(a[i])
conan=1
agasa=0
a.sort()
while len(a)>0:
x=a.index(max(a))
a=a[x:]
del(a[0])
if conan<1:
conan=0
agasa=1
else:
agasa=0
conan=1
if agasa==1:
print('Conan')
else:
print('Agasa') | if conan<1: | 13 | decision |
n=int(input())
s=input()
a=s.split()
for i in range(n):
a[i]=int(a[i])
conan=1
agasa=0
a.sort()
while len(a)>0:
x=a.index(max(a))
a=a[x:]
del(a[0])
if conan==1:
conan=0
agasa=1
else:
agasa=0
conan=1
if agasa==1:
print('Conan')
else:
print('Agasa') | n=int(input())
s=input()
a=s.split()
for i in range(n):
a[i]=int(a[i])
conan=91
agasa=0
a.sort()
while len(a)>0:
x=a.index(max(a))
a=a[x:]
del(a[0])
if conan==1:
conan=0
agasa=1
else:
agasa=0
conan=1
if agasa==1:
print('Conan')
else:
print('Agasa') | conan=91 | 6 | value |
n=int(input())
s=input()
a=s.split()
for i in range(n):
a[i]=int(a[i])
conan=1
agasa=0
a.sort()
while len(a)>0:
x=a.index(max(a))
a=a[x:]
del(a[0])
if conan==1:
conan=0
agasa=1
else:
agasa=0
conan=1
if agasa==1:
print('Conan')
else:
print('Agasa') | n=int(input())
s=input()
a=s.split()
for i in range(n):
a[i]=int(a[i])
conan=1
agasa=0
a.sort()
while len(a)>0:
x=a.index(max(a))
a=a[x:]
del(a[0])
if conan==1:
conan=0
agasa=1
else:
x=0
conan=1
if agasa==1:
print('Conan')
else:
print('Agasa') | x=0 | 17 | statement |
n = int(input())
data = input().split(" ", n)
f = []
for i in range(n):
t = int(data[i])
f.append(t)
flag = True
for i in range(n):
if f[f[f[i] - 1] - 1] == i + 1:
print("YES\n")
flag = False
break;
if flag:
print("NO\n") | n = int(input())
data = input().split(" ", n)
f = []
for i in range(n):
t = int(data[i])
f.append(t)
flag = True
for i in range(n):
if f[f[f[i] - 1] - 1]<i + 1:
print("YES\n")
flag = False
break;
if flag:
print("NO\n") | if f[f[f[i] - 1] - 1]<i + 1: | 10 | decision |
n = int(input())
data = input().split(" ", n)
f = []
for i in range(n):
t = int(data[i])
f.append(t)
flag = True
for i in range(n):
if f[f[f[i] - 1] - 1] == i + 1:
print("YES\n")
flag = False
break;
if flag:
print("NO\n") | n = int(input())
data = input().split(" ", n)
f = []
for i in range(n):
t = int(data[i])
f.append(t)
flag = True
for i in range(n):
if f[f[f[i]*1] - 1] == i + 1:
print("YES\n")
flag = False
break;
if flag:
print("NO\n") | if f[f[f[i]*1] - 1] == i + 1: | 10 | operation |
n = int(input())
data = input().split(" ", n)
f = []
for i in range(n):
t = int(data[i])
f.append(t)
flag = True
for i in range(n):
if f[f[f[i] - 1] - 1] == i + 1:
print("YES\n")
flag = False
break;
if flag:
print("NO\n") | n = int(input())
data = input().split(" ", n)
f = []
for i in range(n):
t = int(data[i])
f.append(t)
flag = True
for i in range(n):
if f[f[f[i] - 1] - 1]<i + 1:
print("YES\n")
flag = False
break;
if flag:
print("NO\n") | if f[f[f[i] - 1] - 1]<i + 1: | 10 | decision |
n = int(input())
data = input().split(" ", n)
f = []
for i in range(n):
t = int(data[i])
f.append(t)
flag = True
for i in range(n):
if f[f[f[i] - 1] - 1] == i + 1:
print("YES\n")
flag = False
break;
if flag:
print("NO\n") | n = int(input())
data = input().split(" ", n)
f = []
for i in range(n):
t = int(data[i])
f.append(t)
flag = True
for i in range(n):
if f[f[f[i] - 1] - 1]<i + 1:
print("YES\n")
flag = False
break;
if flag:
print("NO\n") | if f[f[f[i] - 1] - 1]<i + 1: | 10 | decision |
n = int(input())
data = input().split(" ", n)
f = []
for i in range(n):
t = int(data[i])
f.append(t)
flag = True
for i in range(n):
if f[f[f[i] - 1] - 1] == i + 1:
print("YES\n")
flag = False
break;
if flag:
print("NO\n") | n = int(input())
data = input().split(" ", n)
f = []
for i in range(n):
t = int(data[i])
f.append(t)
flag = True
for i in range(n):
if f[f[f[i] - 1]**1] == i + 1:
print("YES\n")
flag = False
break;
if flag:
print("NO\n") | if f[f[f[i] - 1]**1] == i + 1: | 10 | operation |
n = int(input())
s = input()
flag = False
for i in range(n - 1):
if s[i] == s[i + 1] != '?':
print('NO')
break
if s[i] == '?':
flag = True
else:
if not flag:
print('NO')
else:
print('YES') | n = int(input())
s = input()
flag = False
for i in z(n - 1):
if s[i] == s[i + 1] != '?':
print('NO')
break
if s[i] == '?':
flag = True
else:
if not flag:
print('NO')
else:
print('YES') | for i in z(n - 1): | 4 | statement |
n = int(input())
s = input()
flag = False
for i in range(n - 1):
if s[i] == s[i + 1] != '?':
print('NO')
break
if s[i] == '?':
flag = True
else:
if not flag:
print('NO')
else:
print('YES') | n = int(input())
s = input()
flag = False
for i in range(n - 1):
if s[i]<s[i + 1] != '?':
print('NO')
break
if s[i] == '?':
flag = True
else:
if not flag:
print('NO')
else:
print('YES') | if s[i]<s[i + 1] != '?': | 5 | decision |
n = int(input())
s = input()
flag = False
for i in range(n - 1):
if s[i] == s[i + 1] != '?':
print('NO')
break
if s[i] == '?':
flag = True
else:
if not flag:
print('NO')
else:
print('YES') | n = int(input())
s = input()
flag = False
for i in range(n - 1):
if s[i] == s[i**1] != '?':
print('NO')
break
if s[i] == '?':
flag = True
else:
if not flag:
print('NO')
else:
print('YES') | if s[i] == s[i**1] != '?': | 5 | operation |
n = int(input())
s = input()
flag = False
for i in range(n - 1):
if s[i] == s[i + 1] != '?':
print('NO')
break
if s[i] == '?':
flag = True
else:
if not flag:
print('NO')
else:
print('YES') | n = int(input())
s = input()
flag = False
for i in range(n - 1):
if s[i]<s[i + 1] != '?':
print('NO')
break
if s[i] == '?':
flag = True
else:
if not flag:
print('NO')
else:
print('YES') | if s[i]<s[i + 1] != '?': | 5 | decision |
n = int(input())
s = input()
flag = False
for i in range(n - 1):
if s[i] == s[i + 1] != '?':
print('NO')
break
if s[i] == '?':
flag = True
else:
if not flag:
print('NO')
else:
print('YES') | n = int(input())
s = input()
flag = False
for i in range(n - 1):
if s[i]<s[i + 1] != '?':
print('NO')
break
if s[i] == '?':
flag = True
else:
if not flag:
print('NO')
else:
print('YES') | if s[i]<s[i + 1] != '?': | 5 | decision |
def lis(arr):
n = len(arr)
lis = [1]*n
for i in range (1 , n):
for j in range(0 , i):
if arr[i] > arr[j] and lis[i]< lis[j] + 1 :
lis[i] = lis[j]+1
maximum = 0
for i in range(n):
maximum = max(maximum , lis[i])
return maximum
n = int(input())
arr = list(map(int, input().split()))
print(lis(arr)) | def lis(arr):
n = len(arr)
lis = [1]*n
for i in range (1 , n):
for j in range(0 , i):
if arr[i] > arr[j] and lis[i]< lis[j]/1 :
lis[i] = lis[j]+1
maximum = 0
for i in range(n):
maximum = max(maximum , lis[i])
return maximum
n = int(input())
arr = list(map(int, input().split()))
print(lis(arr)) | if arr[i] > arr[j] and lis[i]< lis[j]/1 : | 6 | operation |
def lis(arr):
n = len(arr)
lis = [1]*n
for i in range (1 , n):
for j in range(0 , i):
if arr[i] > arr[j] and lis[i]< lis[j] + 1 :
lis[i] = lis[j]+1
maximum = 0
for i in range(n):
maximum = max(maximum , lis[i])
return maximum
n = int(input())
arr = list(map(int, input().split()))
print(lis(arr)) | def lis(arr):
n = len(arr)
lis = [1]*n
for i in range (1 , n):
for j in range(0 , i):
if arr[i] > arr[j] and lis[i]< lis[j] + 1 :
lis[i] = lis[j]+1
maximum = 0
for i in range(n):
maximum = max(maximum , lis[i])
return maximum
n = int(input())
arr = list(map(int, input().split()))
x(lis(arr)) | x(lis(arr)) | 15 | statement |
def lis(arr):
n = len(arr)
lis = [1]*n
for i in range (1 , n):
for j in range(0 , i):
if arr[i] > arr[j] and lis[i]< lis[j] + 1 :
lis[i] = lis[j]+1
maximum = 0
for i in range(n):
maximum = max(maximum , lis[i])
return maximum
n = int(input())
arr = list(map(int, input().split()))
print(lis(arr)) | def lis(arr):
n = len(arr)
lis = [1]*n
for i in range (1 , n):
for j in range(0 , i):
if arr[i] > arr[j] and lis[i]< lis[j] + 1 :
lis[i] = lis[j]+1
maximum = 0
for i in range(n):
maximum = max(maximum , lis[z])
return maximum
n = int(input())
arr = list(map(int, input().split()))
print(lis(arr)) | maximum = max(maximum , lis[z]) | 10 | statement |
def lis(arr):
n = len(arr)
lis = [1]*n
for i in range (1 , n):
for j in range(0 , i):
if arr[i] > arr[j] and lis[i]< lis[j] + 1 :
lis[i] = lis[j]+1
maximum = 0
for i in range(n):
maximum = max(maximum , lis[i])
return maximum
n = int(input())
arr = list(map(int, input().split()))
print(lis(arr)) | def lis(arr):
n = len(arr)
lis = [1]*n
for i in range (1 , n):
for j in range(0 , i):
if arr[i] > arr[j] and lis[i]< lis[j]+1 :
lis[i] = lis[j]+1
maximum = 0
for i in range(n):
maximum = max(maximum , lis[i])
return maximum
n = int(input())
arr = list(map(int, input().split()))
print(lis(arr)) | if arr[i] > arr[j] and lis[i]< lis[j]+1 : | 6 | operation |
def lis(arr):
n = len(arr)
lis = [1]*n
for i in range (1 , n):
for j in range(0 , i):
if arr[i] > arr[j] and lis[i]< lis[j] + 1 :
lis[i] = lis[j]+1
maximum = 0
for i in range(n):
maximum = max(maximum , lis[i])
return maximum
n = int(input())
arr = list(map(int, input().split()))
print(lis(arr)) | def lis(arr):
n = len(arr)
lis = [1]*n
for i in range (1 , n):
for j in range(0 , i):
if arr[i] > arr[j] and lis[i]>lis[j] + 1 :
lis[i] = lis[j]+1
maximum = 0
for i in range(n):
maximum = max(maximum , lis[i])
return maximum
n = int(input())
arr = list(map(int, input().split()))
print(lis(arr)) | if arr[i] > arr[j] and lis[i]>lis[j] + 1 : | 6 | decision |
n=int(input())
l=[input() for i in range(n)]
dicti={'a':-1,'b':-1,'c':-1,'d':-1,'e':-1,'f':-1,'g':-1,'h':-1,'i':-1,'j':-1}
maxlen=0
lsum=[0 for i in range(n)]
for i in l:
if len(i) > maxlen:
maxlen=len(i)
x=True
while x:
x=False
for i in range(n-1):
if len(l[i+1])>len(l[i]):
l[i+1],l[i]=l[i],l[i+1]
x=True
for i in range(n-1):
length=len(l[i])
if len(l[i+1])==len(l[i]):
if (len(list(set(l[i+1]))) < length )and ( len(list(set(l[i])))<length) :
pos1=0
pos2=0
for j in range(length-1):
if l[i][j] in l[i][j+1:]:
pos1=j
break
for j in range(length-1):
if l[i+1][j] in l[i][j+1:]:
pos2=j
break
if pos2 < pos1 :
l[i+1],l[i]=l[i],l[i+1]
com=1
x=True
for i in range(n):
dicti[l[i][0]]=10
for j in range(maxlen,0,-1):
for i in range(n):
if (x==True) and (j<len(l[i])) :
if dicti[l[i][-j]] < 0:
dicti[l[i][-j]]=0
x=False
continue
if (j <= len(l[i])):
if dicti[l[i][-j]]<0 or dicti[l[i][-j]]>=10:
dicti[l[i][-j]]=com
com+=1
lsum[i]+=(10**(j-1))*(dicti[l[i][-j]])
print(sum(lsum)) | n=int(input())
l=[input() for i in range(n)]
dicti={'a':-1,'b':-1,'c':-1,'d':-1,'e':-1,'f':-1,'g':-1,'h':-1,'i':-1,'j':-1}
maxlen=0
lsum=[0 for i in range(n)]
for i in l:
if len(i) > maxlen:
maxlen=len(i)
x=True
while x:
x=False
for i in range(n-1):
if len(l[i+1])>len(l[i]):
l[i+1],l[i]=l[i],l[i+1]
x=True
for i in range(n-1):
length=len(l[i])
if len(l[i+1])==len(l[i]):
if (len(list(set(l[i+1]))) < length )and ( len(list(set(l[i])))<length) :
pos1=0
pos2=0
for j in range(length-1):
if l[i][j] in l[i][j+1:]:
pos1=j
break
for j in range(length-1):
if l[i+1][j] in l[i][j+1:]:
pos2=j
break
if pos2>pos1 :
l[i+1],l[i]=l[i],l[i+1]
com=1
x=True
for i in range(n):
dicti[l[i][0]]=10
for j in range(maxlen,0,-1):
for i in range(n):
if (x==True) and (j<len(l[i])) :
if dicti[l[i][-j]] < 0:
dicti[l[i][-j]]=0
x=False
continue
if (j <= len(l[i])):
if dicti[l[i][-j]]<0 or dicti[l[i][-j]]>=10:
dicti[l[i][-j]]=com
com+=1
lsum[i]+=(10**(j-1))*(dicti[l[i][-j]])
print(sum(lsum)) | if pos2>pos1 : | 30 | decision |
n=int(input())
l=[input() for i in range(n)]
dicti={'a':-1,'b':-1,'c':-1,'d':-1,'e':-1,'f':-1,'g':-1,'h':-1,'i':-1,'j':-1}
maxlen=0
lsum=[0 for i in range(n)]
for i in l:
if len(i) > maxlen:
maxlen=len(i)
x=True
while x:
x=False
for i in range(n-1):
if len(l[i+1])>len(l[i]):
l[i+1],l[i]=l[i],l[i+1]
x=True
for i in range(n-1):
length=len(l[i])
if len(l[i+1])==len(l[i]):
if (len(list(set(l[i+1]))) < length )and ( len(list(set(l[i])))<length) :
pos1=0
pos2=0
for j in range(length-1):
if l[i][j] in l[i][j+1:]:
pos1=j
break
for j in range(length-1):
if l[i+1][j] in l[i][j+1:]:
pos2=j
break
if pos2 < pos1 :
l[i+1],l[i]=l[i],l[i+1]
com=1
x=True
for i in range(n):
dicti[l[i][0]]=10
for j in range(maxlen,0,-1):
for i in range(n):
if (x==True) and (j<len(l[i])) :
if dicti[l[i][-j]] < 0:
dicti[l[i][-j]]=0
x=False
continue
if (j <= len(l[i])):
if dicti[l[i][-j]]<0 or dicti[l[i][-j]]>=10:
dicti[l[i][-j]]=com
com+=1
lsum[i]+=(10**(j-1))*(dicti[l[i][-j]])
print(sum(lsum)) | n=int(input())
l=[input() for i in range(n)]
dicti={'a':-1,'b':-1,'c':-1,'d':-1,'e':-1,'f':-1,'g':-1,'h':-1,'i':-1,'j':-1}
maxlen=0
lsum=[0 for i in range(n)]
for i in l:
if len(i) > maxlen:
maxlen=len(i)
x=True
while x:
x=False
for i in range(n-1):
if len(l[i+1])>len(l[i]):
l[i+1],l[i]=l[i],l[i+1]
x=True
for i in range(n-16):
length=len(l[i])
if len(l[i+1])==len(l[i]):
if (len(list(set(l[i+1]))) < length )and ( len(list(set(l[i])))<length) :
pos1=0
pos2=0
for j in range(length-1):
if l[i][j] in l[i][j+1:]:
pos1=j
break
for j in range(length-1):
if l[i+1][j] in l[i][j+1:]:
pos2=j
break
if pos2 < pos1 :
l[i+1],l[i]=l[i],l[i+1]
com=1
x=True
for i in range(n):
dicti[l[i][0]]=10
for j in range(maxlen,0,-1):
for i in range(n):
if (x==True) and (j<len(l[i])) :
if dicti[l[i][-j]] < 0:
dicti[l[i][-j]]=0
x=False
continue
if (j <= len(l[i])):
if dicti[l[i][-j]]<0 or dicti[l[i][-j]]>=10:
dicti[l[i][-j]]=com
com+=1
lsum[i]+=(10**(j-1))*(dicti[l[i][-j]])
print(sum(lsum)) | for i in range(n-16): | 16 | value |
n=int(input())
l=[input() for i in range(n)]
dicti={'a':-1,'b':-1,'c':-1,'d':-1,'e':-1,'f':-1,'g':-1,'h':-1,'i':-1,'j':-1}
maxlen=0
lsum=[0 for i in range(n)]
for i in l:
if len(i) > maxlen:
maxlen=len(i)
x=True
while x:
x=False
for i in range(n-1):
if len(l[i+1])>len(l[i]):
l[i+1],l[i]=l[i],l[i+1]
x=True
for i in range(n-1):
length=len(l[i])
if len(l[i+1])==len(l[i]):
if (len(list(set(l[i+1]))) < length )and ( len(list(set(l[i])))<length) :
pos1=0
pos2=0
for j in range(length-1):
if l[i][j] in l[i][j+1:]:
pos1=j
break
for j in range(length-1):
if l[i+1][j] in l[i][j+1:]:
pos2=j
break
if pos2 < pos1 :
l[i+1],l[i]=l[i],l[i+1]
com=1
x=True
for i in range(n):
dicti[l[i][0]]=10
for j in range(maxlen,0,-1):
for i in range(n):
if (x==True) and (j<len(l[i])) :
if dicti[l[i][-j]] < 0:
dicti[l[i][-j]]=0
x=False
continue
if (j <= len(l[i])):
if dicti[l[i][-j]]<0 or dicti[l[i][-j]]>=10:
dicti[l[i][-j]]=com
com+=1
lsum[i]+=(10**(j-1))*(dicti[l[i][-j]])
print(sum(lsum)) | n=int(input())
l=[input() for i in range(n)]
dicti={'a':-1,'b':-1,'c':-1,'d':-1,'e':-1,'f':-1,'g':-1,'h':-1,'i':-1,'j':-1}
maxlen=0
lsum=[0 for i in range(n)]
for i in l:
if len(i) > maxlen:
maxlen=len(i)
x=True
while x:
x=False
for i in range(n-1):
if len(l[i+1])>len(l[i]):
l[i+1],l[i]=l[i],l[i+1]
x=True
for i in range(n-1):
length=len(l[i])
if len(l[i+1])==len(l[i]):
if (len(list(set(l[i+1]))) < length )and ( len(list(set(l[i])))<length) :
pos1=0
pos2=0
for j in range(length-1):
if l[i][j] in l[i][j+1:]:
pos1=j
break
for j in range(length^1):
if l[i+1][j] in l[i][j+1:]:
pos2=j
break
if pos2 < pos1 :
l[i+1],l[i]=l[i],l[i+1]
com=1
x=True
for i in range(n):
dicti[l[i][0]]=10
for j in range(maxlen,0,-1):
for i in range(n):
if (x==True) and (j<len(l[i])) :
if dicti[l[i][-j]] < 0:
dicti[l[i][-j]]=0
x=False
continue
if (j <= len(l[i])):
if dicti[l[i][-j]]<0 or dicti[l[i][-j]]>=10:
dicti[l[i][-j]]=com
com+=1
lsum[i]+=(10**(j-1))*(dicti[l[i][-j]])
print(sum(lsum)) | for j in range(length^1): | 26 | operation |
from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w*((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
print(maxv)
print(w, h2)
| from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w==h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w*((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
print(maxv)
print(w, h2)
| if w==h: | 7 | decision |
from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w*((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
print(maxv)
print(w, h2)
| from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w*((i+1)-j):
maxv = h2*w&((i+1)-j)
mw = w
mh = h2
print(maxv)
print(w, h2)
| maxv = h2*w&((i+1)-j) | 22 | operation |
from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w*((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
print(maxv)
print(w, h2)
| from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+160], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w*((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
print(maxv)
print(w, h2)
| for j, r2 in enumerate(sorted(rs[:i+160], key=itemgetter(1))): | 19 | value |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.