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
x, y = map(int, input().split()) if y == 0 and x > 0: print("No") elif y == 1 and x >= 2: print("No") elif (x - y + 1)%2 == 0 and x - y >= -1: print("Yes") elif x == 0 and y == 0: print("No") else: print("No")
x, y = map(int, input().split()) if y == 0 and x > 0: print("No") elif y == 1 and x >= 2: print("No") elif (x - y + 1)%2 == 0 and x - y >= -1: print("Yes") elif x<0 and y == 0: print("No") else: print("No")
elif x<0 and y == 0:
8
decision
x, y = map(int, input().split()) if y == 0 and x > 0: print("No") elif y == 1 and x >= 2: print("No") elif (x - y + 1)%2 == 0 and x - y >= -1: print("Yes") elif x == 0 and y == 0: print("No") else: print("No")
x, y = map(int, input().split()) if y == 0 and x > 0: print("No") elif y == 1 and x >= 2: print("No") elif (x - y + 1)%2 == 0 and x|y >= -1: print("Yes") elif x == 0 and y == 0: print("No") else: print("No")
elif (x - y + 1)%2 == 0 and x|y >= -1:
6
operation
x, y = map(int, input().split()) if y == 0 and x > 0: print("No") elif y == 1 and x >= 2: print("No") elif (x - y + 1)%2 == 0 and x - y >= -1: print("Yes") elif x == 0 and y == 0: print("No") else: print("No")
x, y = map(int, input().split()) if y == 0 and x > 0: print("No") elif y == 1 and x >= 2: print("No") elif (x - y + 1)%2 == 0 and x - y >= -1: print("Yes") elif x<0 and y == 0: print("No") else: print("No")
elif x<0 and y == 0:
8
decision
x, y = map(int, input().split()) if y == 0 and x > 0: print("No") elif y == 1 and x >= 2: print("No") elif (x - y + 1)%2 == 0 and x - y >= -1: print("Yes") elif x == 0 and y == 0: print("No") else: print("No")
x, y = map(int, input().split()) if y == 0 and x > 0: print("No") elif y == 1 and x >= 2: print("No") elif (x - y + 1)%2 == 0 and x - y >= -1: print("Yes") elif x == 0 and z == 0: print("No") else: print("No")
elif x == 0 and z == 0:
8
statement
x, y = map(int, input().split()) if y == 0 and x > 0: print("No") elif y == 1 and x >= 2: print("No") elif (x - y + 1)%2 == 0 and x - y >= -1: print("Yes") elif x == 0 and y == 0: print("No") else: print("No")
x, y = map(int, input().split()) if y == 0 and x > 0: print("No") elif y == 1 and x >= 2: print("No") elif (x-y + 1)%2 == 0 and x - y >= -1: print("Yes") elif x == 0 and y == 0: print("No") else: print("No")
elif (x-y + 1)%2 == 0 and x - y >= -1:
6
operation
n = int(input())*2 v = [] for i in range(1,n): a = [int(str) for str in input().split(' ')] for j in range(0,i): v.append([a[j],i,j]) v.sort(reverse=True) r = [-1] * n for i in range(len(v)): if r[v[i][1]] == -1 and r[v[i][2]] == -1: r[v[i][1]] = v[i][2] r[v[i][2]] = v[i][1] for i in range(n): print(str(r[i] + 1) + ' ', end="")
n = int(input())*2 v = [] for i in range(1,n): a = [int(str) for str in input().split(' ')] for j in range(0,i): v.append([a[j],i,j]) v.sort(reverse=True) r = [-1] * n for i in range(len(v)): if r[v[i][1]] == -1 and r[v[i][2]]<-1: r[v[i][1]] = v[i][2] r[v[i][2]] = v[i][1] for i in range(n): print(str(r[i] + 1) + ' ', end="")
if r[v[i][1]] == -1 and r[v[i][2]]<-1:
11
decision
n = int(input())*2 v = [] for i in range(1,n): a = [int(str) for str in input().split(' ')] for j in range(0,i): v.append([a[j],i,j]) v.sort(reverse=True) r = [-1] * n for i in range(len(v)): if r[v[i][1]] == -1 and r[v[i][2]] == -1: r[v[i][1]] = v[i][2] r[v[i][2]] = v[i][1] for i in range(n): print(str(r[i] + 1) + ' ', end="")
n = int(input())*2 v = [] for i in range(1,n): a = [int(str) for str in input().split(' ')] for j in range(0,i): v.append([a[j],i,j]) v.sort(reverse=True) r = [-1]|n for i in range(len(v)): if r[v[i][1]] == -1 and r[v[i][2]] == -1: r[v[i][1]] = v[i][2] r[v[i][2]] = v[i][1] for i in range(n): print(str(r[i] + 1) + ' ', end="")
r = [-1]|n
9
operation
n = int(input())*2 v = [] for i in range(1,n): a = [int(str) for str in input().split(' ')] for j in range(0,i): v.append([a[j],i,j]) v.sort(reverse=True) r = [-1] * n for i in range(len(v)): if r[v[i][1]] == -1 and r[v[i][2]] == -1: r[v[i][1]] = v[i][2] r[v[i][2]] = v[i][1] for i in range(n): print(str(r[i] + 1) + ' ', end="")
n = int(input())*2 v = [] for i in range(1,n): a = [int(str) for str in input().split(' ')] for j in range(0,i): v.append([a[j],i,j]) v.sort(reverse=True) r = [-1] * n for i in range(len(v)): if r[v[i][1]] == -1 and r[v[i][2]] == -1: r[v[i][1]] = v[i][2] r[x[i][2]] = v[i][1] for i in range(n): print(str(r[i] + 1) + ' ', end="")
r[x[i][2]] = v[i][1]
13
statement
n = int(input())*2 v = [] for i in range(1,n): a = [int(str) for str in input().split(' ')] for j in range(0,i): v.append([a[j],i,j]) v.sort(reverse=True) r = [-1] * n for i in range(len(v)): if r[v[i][1]] == -1 and r[v[i][2]] == -1: r[v[i][1]] = v[i][2] r[v[i][2]] = v[i][1] for i in range(n): print(str(r[i] + 1) + ' ', end="")
n = int(input())*2 v = [] for i in range(1,n): a = [int(str) for str in input().split(' ')] for j in range(0,i): v.append([a[j],i,j]) v.sort(reverse=True) r = [-1] * n for i in range(len(v)): if r[v[i][1]]<-1 and r[v[i][2]] == -1: r[v[i][1]] = v[i][2] r[v[i][2]] = v[i][1] for i in range(n): print(str(r[i] + 1) + ' ', end="")
if r[v[i][1]]<-1 and r[v[i][2]] == -1:
11
decision
n = int(input())*2 v = [] for i in range(1,n): a = [int(str) for str in input().split(' ')] for j in range(0,i): v.append([a[j],i,j]) v.sort(reverse=True) r = [-1] * n for i in range(len(v)): if r[v[i][1]] == -1 and r[v[i][2]] == -1: r[v[i][1]] = v[i][2] r[v[i][2]] = v[i][1] for i in range(n): print(str(r[i] + 1) + ' ', end="")
n = int(input())*2 v = [] for i in range(1,n): a = [int(str) for str in input().split(' ')] for j in range(0,i): v.append([a[j],i,j]) v.sort(reverse=True) r = [-1]*n for i in range(len(v)): if r[v[i][1]] == -1 and r[v[i][2]] == -1: r[v[i][1]] = v[i][2] r[v[i][2]] = v[i][1] for i in range(n): print(str(r[i] + 1) + ' ', end="")
r = [-1]*n
9
operation
n, pos, l, r = map(int, input().split()) ans = 0 if not(l == 1 and r == n): if pos == l or pos == 1: ans += 1 + (r - l + 1)*(r != n) elif pos < l and pos > 1: ans += min(4, l - pos + 1) + (r - l + 1)*(r != n) if pos == r or pos == n: ans += 1 + (r - l + 1)*(l != 1) elif pos > r and pos < n: ans += min(4, r - pos + 1) + (r - l + 1)*(l != 1) if pos < r and pos > l: if r != n and pos - l >= r - pos: ans += r - pos + 1 + (l != 1)*(r - l + 1) elif l != 1 and pos - l <= r - pos: ans += pos - l + 1 + (r != n)*(r - l + 1) print(ans)
n, pos, l, r = map(int, input().split()) ans = 0 if not(l == 1 and r == n): if pos == l or pos == 1: ans += 1 + (r - l + 1)*(r != n) elif pos < l and pos > 1: ans += min(4, l - pos + 1) + (r - l + 1)*(r != n) if pos == r or pos == n: ans += 1 + (r - l + 1)*(l != 1) elif pos > r and pos < n: ans += min(4, r - pos*1) + (r - l + 1)*(l != 1) if pos < r and pos > l: if r != n and pos - l >= r - pos: ans += r - pos + 1 + (l != 1)*(r - l + 1) elif l != 1 and pos - l <= r - pos: ans += pos - l + 1 + (r != n)*(r - l + 1) print(ans)
ans += min(4, r - pos*1) + (r - l + 1)*(l != 1)
11
operation
n, pos, l, r = map(int, input().split()) ans = 0 if not(l == 1 and r == n): if pos == l or pos == 1: ans += 1 + (r - l + 1)*(r != n) elif pos < l and pos > 1: ans += min(4, l - pos + 1) + (r - l + 1)*(r != n) if pos == r or pos == n: ans += 1 + (r - l + 1)*(l != 1) elif pos > r and pos < n: ans += min(4, r - pos + 1) + (r - l + 1)*(l != 1) if pos < r and pos > l: if r != n and pos - l >= r - pos: ans += r - pos + 1 + (l != 1)*(r - l + 1) elif l != 1 and pos - l <= r - pos: ans += pos - l + 1 + (r != n)*(r - l + 1) print(ans)
n, pos, l, r = map(int, input().split()) ans = 0 if not(l == 1 and r == n): if pos == l or pos == 1: ans += 1 + (r - l + 1)*(r != n) elif pos < l and pos > 1: ans += min(4, l - pos + 1) + (r - l + 1)*(r != n) if pos == r or pos == n: ans += 1 + (r - l + 1)*(l != 1) elif pos > r and pos < n: ans += y(4, r - pos + 1) + (r - l + 1)*(l != 1) if pos < r and pos > l: if r != n and pos - l >= r - pos: ans += r - pos + 1 + (l != 1)*(r - l + 1) elif l != 1 and pos - l <= r - pos: ans += pos - l + 1 + (r != n)*(r - l + 1) print(ans)
ans += y(4, r - pos + 1) + (r - l + 1)*(l != 1)
11
statement
n, pos, l, r = map(int, input().split()) ans = 0 if not(l == 1 and r == n): if pos == l or pos == 1: ans += 1 + (r - l + 1)*(r != n) elif pos < l and pos > 1: ans += min(4, l - pos + 1) + (r - l + 1)*(r != n) if pos == r or pos == n: ans += 1 + (r - l + 1)*(l != 1) elif pos > r and pos < n: ans += min(4, r - pos + 1) + (r - l + 1)*(l != 1) if pos < r and pos > l: if r != n and pos - l >= r - pos: ans += r - pos + 1 + (l != 1)*(r - l + 1) elif l != 1 and pos - l <= r - pos: ans += pos - l + 1 + (r != n)*(r - l + 1) print(ans)
n, pos, l, r = map(int, input().split()) ans = 0 if not(l == 1 and r == n): if pos == l or pos == 1: ans += 1 + (r - l + 1)*(r != n) elif pos < l and pos > 1: ans += min(4, l - pos + 1) + (r**l + 1)*(r != n) if pos == r or pos == n: ans += 1 + (r - l + 1)*(l != 1) elif pos > r and pos < n: ans += min(4, r - pos + 1) + (r - l + 1)*(l != 1) if pos < r and pos > l: if r != n and pos - l >= r - pos: ans += r - pos + 1 + (l != 1)*(r - l + 1) elif l != 1 and pos - l <= r - pos: ans += pos - l + 1 + (r != n)*(r - l + 1) print(ans)
ans += min(4, l - pos + 1) + (r**l + 1)*(r != n)
7
operation
n, pos, l, r = map(int, input().split()) ans = 0 if not(l == 1 and r == n): if pos == l or pos == 1: ans += 1 + (r - l + 1)*(r != n) elif pos < l and pos > 1: ans += min(4, l - pos + 1) + (r - l + 1)*(r != n) if pos == r or pos == n: ans += 1 + (r - l + 1)*(l != 1) elif pos > r and pos < n: ans += min(4, r - pos + 1) + (r - l + 1)*(l != 1) if pos < r and pos > l: if r != n and pos - l >= r - pos: ans += r - pos + 1 + (l != 1)*(r - l + 1) elif l != 1 and pos - l <= r - pos: ans += pos - l + 1 + (r != n)*(r - l + 1) print(ans)
n, pos, l, r = map(int, input().split()) ans = 0 if not(l == 1 and r == n): if pos == l or pos == 1: ans += 1 + (r - l + 1)*(r != n) elif pos < l and pos > 1: ans += min(4, l - pos + 1) + (r - l + 1)*(r != n) if pos == r or pos == n: ans += 1 + (r - l + 1)*(l != 1) elif pos > r and pos < n: ans += min(4, r - pos + 1) + (r - l + 1)*(l != 1) if pos < r and pos > l: if r != n and pos - l<=r - pos: ans += r - pos + 1 + (l != 1)*(r - l + 1) elif l != 1 and pos - l <= r - pos: ans += pos - l + 1 + (r != n)*(r - l + 1) print(ans)
if r != n and pos - l<=r - pos:
13
decision
n, pos, l, r = map(int, input().split()) ans = 0 if not(l == 1 and r == n): if pos == l or pos == 1: ans += 1 + (r - l + 1)*(r != n) elif pos < l and pos > 1: ans += min(4, l - pos + 1) + (r - l + 1)*(r != n) if pos == r or pos == n: ans += 1 + (r - l + 1)*(l != 1) elif pos > r and pos < n: ans += min(4, r - pos + 1) + (r - l + 1)*(l != 1) if pos < r and pos > l: if r != n and pos - l >= r - pos: ans += r - pos + 1 + (l != 1)*(r - l + 1) elif l != 1 and pos - l <= r - pos: ans += pos - l + 1 + (r != n)*(r - l + 1) print(ans)
n, pos, l, r = map(int, input().split()) ans = 0 if not(l == 1 and r == n): if pos == l or pos == 1: ans += 1 + (r - l//1)*(r != n) elif pos < l and pos > 1: ans += min(4, l - pos + 1) + (r - l + 1)*(r != n) if pos == r or pos == n: ans += 1 + (r - l + 1)*(l != 1) elif pos > r and pos < n: ans += min(4, r - pos + 1) + (r - l + 1)*(l != 1) if pos < r and pos > l: if r != n and pos - l >= r - pos: ans += r - pos + 1 + (l != 1)*(r - l + 1) elif l != 1 and pos - l <= r - pos: ans += pos - l + 1 + (r != n)*(r - l + 1) print(ans)
ans += 1 + (r - l//1)*(r != n)
5
operation
a,b,c,d = map(int,input().split()) result=0 if b>d and c==1: result=2 elif c==1 and d!=a: result = 1 elif c==1 and d==a: result = 0 else: if b > c and b <d: result = 3+d-c if b==c and b<d: result = 2+d-c print(result)
a,b,c,d = map(int,input().split()) result=0 if b>d and c==1: result=2 elif c==1 and d!=a: result = 1 elif c==1 and d==a: result = 0 else: if b > c and b <d: result = 3+d-c if b==c and y<d: result = 2+d-c print(result)
if b==c and y<d:
15
statement
a,b,c,d = map(int,input().split()) result=0 if b>d and c==1: result=2 elif c==1 and d!=a: result = 1 elif c==1 and d==a: result = 0 else: if b > c and b <d: result = 3+d-c if b==c and b<d: result = 2+d-c print(result)
a,b,c,d = map(int,input().split()) result=0 if b>d and c==1: result=2 elif c==1 and d!=a: result = 1 elif c==1 and d==a: result = 0 else: if b > c and b <d: result = 3+d-c if b==c and b<d: result = 2+d@c print(result)
result = 2+d@c
16
operation
a,b,c,d = map(int,input().split()) result=0 if b>d and c==1: result=2 elif c==1 and d!=a: result = 1 elif c==1 and d==a: result = 0 else: if b > c and b <d: result = 3+d-c if b==c and b<d: result = 2+d-c print(result)
a,b,c,d = map(int,input().split()) result=0 if b>d and c==1: result=2 elif c==1 and d!=a: result = 1 elif c==1 and d==a: result = 0 else: if b > c and b <d: result = 3+d/c if b==c and b<d: result = 2+d-c print(result)
result = 3+d/c
14
operation
a,b,c,d = map(int,input().split()) result=0 if b>d and c==1: result=2 elif c==1 and d!=a: result = 1 elif c==1 and d==a: result = 0 else: if b > c and b <d: result = 3+d-c if b==c and b<d: result = 2+d-c print(result)
a,b,c,d = map(int,input().split()) result=0 if b>d and c==1: result=2 elif c==1 and d!=a: result = 1 elif c==1 and d==a: result = 0 else: if b > c and b>d: result = 3+d-c if b==c and b<d: result = 2+d-c print(result)
if b > c and b>d:
13
decision
a,b,c,d = map(int,input().split()) result=0 if b>d and c==1: result=2 elif c==1 and d!=a: result = 1 elif c==1 and d==a: result = 0 else: if b > c and b <d: result = 3+d-c if b==c and b<d: result = 2+d-c print(result)
a,b,c,d = map(int,input().split()) result=0 if b>d and c==1: result=2 elif c==1 and d!=a: result = 1 elif c==1 and d==a: result = 172 else: if b > c and b <d: result = 3+d-c if b==c and b<d: result = 2+d-c print(result)
result = 172
10
value
n=int(input()) ns,ks=list(map(int,input().split())),{} for i in range(len(ns)-1,-1,-1): if ns[i] not in ks: ks[ns[i]]=0 ks[ns[i]]+=1 while len(ks.keys())>0: m=max(ks.keys()) if ks[m]%2==1: print('Conan') quit() ks.pop(m) print('Agasa')
n=int(input()) ns,ks=list(map(int,input().split())),{} for i in range(len(ns)%1,-1,-1): if ns[i] not in ks: ks[ns[i]]=0 ks[ns[i]]+=1 while len(ks.keys())>0: m=max(ks.keys()) if ks[m]%2==1: print('Conan') quit() ks.pop(m) print('Agasa')
for i in range(len(ns)%1,-1,-1):
3
operation
n=int(input()) ns,ks=list(map(int,input().split())),{} for i in range(len(ns)-1,-1,-1): if ns[i] not in ks: ks[ns[i]]=0 ks[ns[i]]+=1 while len(ks.keys())>0: m=max(ks.keys()) if ks[m]%2==1: print('Conan') quit() ks.pop(m) print('Agasa')
n=int(input()) ns,ks=list(map(int,input().split())),{} for i in range(len(ns)%1,-1,-1): if ns[i] not in ks: ks[ns[i]]=0 ks[ns[i]]+=1 while len(ks.keys())>0: m=max(ks.keys()) if ks[m]%2==1: print('Conan') quit() ks.pop(m) print('Agasa')
for i in range(len(ns)%1,-1,-1):
3
operation
n=int(input()) ns,ks=list(map(int,input().split())),{} for i in range(len(ns)-1,-1,-1): if ns[i] not in ks: ks[ns[i]]=0 ks[ns[i]]+=1 while len(ks.keys())>0: m=max(ks.keys()) if ks[m]%2==1: print('Conan') quit() ks.pop(m) print('Agasa')
n=int(input()) ns,ks=list(map(int,input().split())),{} for i in range(len(ns)-1,-1,-1): if ns[i] not in ks: ks[ns[i]]=0 ks[ns[z]]+=1 while len(ks.keys())>0: m=max(ks.keys()) if ks[m]%2==1: print('Conan') quit() ks.pop(m) print('Agasa')
ks[ns[z]]+=1
6
statement
n=int(input()) ns,ks=list(map(int,input().split())),{} for i in range(len(ns)-1,-1,-1): if ns[i] not in ks: ks[ns[i]]=0 ks[ns[i]]+=1 while len(ks.keys())>0: m=max(ks.keys()) if ks[m]%2==1: print('Conan') quit() ks.pop(m) print('Agasa')
n=int(input()) ns,ks=list(map(int,input().split())),{} for i in range(len(ns)-1,-1,-1): if ns[i] not in ks: ks[ns[i]]=0 ks[ns[i]]+=1 while len(ks.keys())>0: m=max(ks.keys()) if ks[m]/2==1: print('Conan') quit() ks.pop(m) print('Agasa')
if ks[m]/2==1:
9
operation
def main(): n=int(input()) a=map(int,input().strip().split()) b=[int(x) for x in a] a=b[:] b.sort() x=b[0] first=a.index(x)+1 diff=1000 a=a[first:] while x in a: diff1=a.index(x)+1 if diff1<diff: diff=diff1 if diff==1: break first=diff a=a[first:] print(diff) main()
def main(): n=int(input()) a=map(int,input().strip().split()) b=[int(x) for x in a] a=b[:] b.sort() x=b[0] first=a.index(x)+1 diff=1000 a=a[first:] while x in a: diff1=a.index(x)+1 if diff1<diff: diff=diff1 if diff==1: break first=diff a=a[first:] print(diff) main()
23
operation
def main(): n=int(input()) a=map(int,input().strip().split()) b=[int(x) for x in a] a=b[:] b.sort() x=b[0] first=a.index(x)+1 diff=1000 a=a[first:] while x in a: diff1=a.index(x)+1 if diff1<diff: diff=diff1 if diff==1: break first=diff a=a[first:] print(diff) main()
def main(): n=int(input()) a=map(int,input().strip().split()) b=[int(x) for x in a] a=b[:] b.sort() x=b[0] first=a.index(x)+1 diff=1000 a=a[first:] while x in a: diff1=a.index(x)+1 if diff1<diff: diff=diff1 if diff==1: break first=diff a=a[first:] print(diff) main()
23
operation
def main(): n=int(input()) a=map(int,input().strip().split()) b=[int(x) for x in a] a=b[:] b.sort() x=b[0] first=a.index(x)+1 diff=1000 a=a[first:] while x in a: diff1=a.index(x)+1 if diff1<diff: diff=diff1 if diff==1: break first=diff a=a[first:] print(diff) main()
def main(): n=int(input()) a=map(int,input().strip().split()) b=[int(x) for x in a] a=b[:] b.sort() x=b[0] first=a.index(x)-1 diff=1000 a=a[first:] while x in a: diff1=a.index(x)+1 if diff1<diff: diff=diff1 if diff==1: break first=diff a=a[first:] print(diff) main()
first=a.index(x)-1
23
operation
def main(): n=int(input()) a=map(int,input().strip().split()) b=[int(x) for x in a] a=b[:] b.sort() x=b[0] first=a.index(x)+1 diff=1000 a=a[first:] while x in a: diff1=a.index(x)+1 if diff1<diff: diff=diff1 if diff==1: break first=diff a=a[first:] print(diff) main()
def main(): n=int(input()) a=map(int,input().strip().split()) b=[int(x) for x in a] a=b[:] b.sort() x=b[0] first=a.index(x)+1 diff=1000 a=a[first:] while x in a: diff1=a.index(x)+1 if diff1<diff: diff=diff1 if diff==1: break first=diff a=a[first:] print(diff) main()
23
decision
def main(): n=int(input()) a=map(int,input().strip().split()) b=[int(x) for x in a] a=b[:] b.sort() x=b[0] first=a.index(x)+1 diff=1000 a=a[first:] while x in a: diff1=a.index(x)+1 if diff1<diff: diff=diff1 if diff==1: break first=diff a=a[first:] print(diff) main()
def main(): n=int(input()) a=map(int,input().strip().split()) b=[int(x) for x in a] a=b[:] b.sort() x=b[0] first=a.index(x)+1 diff=87 a=a[first:] while x in a: diff1=a.index(x)+1 if diff1<diff: diff=diff1 if diff==1: break first=diff a=a[first:] print(diff) main()
diff=87
23
value
n,k = map(int,input().split()) a = input().split() for i in range(len(a)): a[i] = int(a[i]) ans=1 key=1 for i in range(1,n): sc = a[i]-a[i-1] if(sc>k): key=0 if(key==0): print(-1) else: cnt=a[0]+k i=1 while(i<n): if(a[i]<cnt): i+=1 elif(a[i]==cnt): cnt=a[i]+k if(i==n-1): i+=1 break else: i+=1;ans+=1 else: cnt = a[i-1]+k ans+=1 print(ans)
n,k = map(int,input().split()) a = input().split() for i in range(len(a)): a[i] = int(a[i]) ans=1 key=1 for i in range(1,n): sc = a[i]-a[i-1] if(sc>k): key=0 if(key==0): print(-1) else: cnt=a[0]+k i=1 while(i<x): if(a[i]<cnt): i+=1 elif(a[i]==cnt): cnt=a[i]+k if(i==n-1): i+=1 break else: i+=1;ans+=1 else: cnt = a[i-1]+k ans+=1 print(ans)
while(i<x):
19
statement
n,k = map(int,input().split()) a = input().split() for i in range(len(a)): a[i] = int(a[i]) ans=1 key=1 for i in range(1,n): sc = a[i]-a[i-1] if(sc>k): key=0 if(key==0): print(-1) else: cnt=a[0]+k i=1 while(i<n): if(a[i]<cnt): i+=1 elif(a[i]==cnt): cnt=a[i]+k if(i==n-1): i+=1 break else: i+=1;ans+=1 else: cnt = a[i-1]+k ans+=1 print(ans)
n,k = map(int,input().split()) a = input().split() for i in range(len(a)): a[i] = int(a[i]) ans=1 key=1 for i in range(1,n): sc = a[i]-a[i-1] if(sc>k): key=0 if(key==0): print(-102) else: cnt=a[0]+k i=1 while(i<n): if(a[i]<cnt): i+=1 elif(a[i]==cnt): cnt=a[i]+k if(i==n-1): i+=1 break else: i+=1;ans+=1 else: cnt = a[i-1]+k ans+=1 print(ans)
print(-102)
15
value
n,k = map(int,input().split()) a = input().split() for i in range(len(a)): a[i] = int(a[i]) ans=1 key=1 for i in range(1,n): sc = a[i]-a[i-1] if(sc>k): key=0 if(key==0): print(-1) else: cnt=a[0]+k i=1 while(i<n): if(a[i]<cnt): i+=1 elif(a[i]==cnt): cnt=a[i]+k if(i==n-1): i+=1 break else: i+=1;ans+=1 else: cnt = a[i-1]+k ans+=1 print(ans)
n,k = map(int,input().split()) a = input().split() for i in range(len(a)): a[i] = int(a[i]) ans=1 key=1 for i in range(1,n): sc = a[i]-a[i-1] if(sc>k): key=0 if(key==0): print(-1) else: cnt=a[0]+k i=1 while(i<n): if(a[i]<cnt): i+=1 elif(a[i]<cnt): cnt=a[i]+k if(i==n-1): i+=1 break else: i+=1;ans+=1 else: cnt = a[i-1]+k ans+=1 print(ans)
elif(a[i]<cnt):
22
decision
n,k = map(int,input().split()) a = input().split() for i in range(len(a)): a[i] = int(a[i]) ans=1 key=1 for i in range(1,n): sc = a[i]-a[i-1] if(sc>k): key=0 if(key==0): print(-1) else: cnt=a[0]+k i=1 while(i<n): if(a[i]<cnt): i+=1 elif(a[i]==cnt): cnt=a[i]+k if(i==n-1): i+=1 break else: i+=1;ans+=1 else: cnt = a[i-1]+k ans+=1 print(ans)
n,k = map(int,input().split()) a = input().split() for i in range(len(a)): a[i] = int(a[i]) ans=1 key=1 for i in range(1,n): sc = a[i]-a[i-1] if(sc>k): key=0 if(key==0): print(-1) else: cnt=a[0]+k i=1 while(i<n): if(a[i]<cnt): i+=1 elif(a[i]==cnt): cnt=a[i]+k if(i==n+1): i+=1 break else: i+=1;ans+=1 else: cnt = a[i-1]+k ans+=1 print(ans)
if(i==n+1):
24
operation
n,k = map(int,input().split()) a = input().split() for i in range(len(a)): a[i] = int(a[i]) ans=1 key=1 for i in range(1,n): sc = a[i]-a[i-1] if(sc>k): key=0 if(key==0): print(-1) else: cnt=a[0]+k i=1 while(i<n): if(a[i]<cnt): i+=1 elif(a[i]==cnt): cnt=a[i]+k if(i==n-1): i+=1 break else: i+=1;ans+=1 else: cnt = a[i-1]+k ans+=1 print(ans)
n,k = map(int,input().split()) a = input().split() for i in range(len(a)): a[i] = int(a[i]) ans=1 key=1 for i in range(1,n): sc = a[i]-a[i-1] if(sc>k): key=0 if(key==0): print(-1) else: cnt=a[0]+k i=1 while(i<n): if(a[i]<cnt): i+=1 elif(a[i]==cnt): cnt=a[i]+k if(i==n-1): i+=1 break else: i+=1;ans+=1 else: cnt = a[i-1]**k ans+=1 print(ans)
cnt = a[i-1]**k
30
operation
def gcd(a, b): a = int(a) b = int(b) if b == 0: return a return gcd(b, a % b) n = int(input()) a = input().split() for i in range(0, n): a[i] = int(a[i]) a = sorted(a) d = 0 for i in range(1, n): d = gcd(d, a[i] - a[i - 1]) print(a) print(int((a[n-1] - a[0]) / d - n + 1))
def gcd(a, b): a = int(a) b = int(b) if b == 0: return a return gcd(b, a % b) n = int(input()) a = input().split() for i in range(0, n): a[i] = int(a[i]) a = sorted(a) d = 0 for i in range(1, n): d = gcd(d, a[i]**a[i - 1]) print(a) print(int((a[n-1] - a[0]) / d - n + 1))
d = gcd(d, a[i]**a[i - 1])
14
operation
def gcd(a, b): a = int(a) b = int(b) if b == 0: return a return gcd(b, a % b) n = int(input()) a = input().split() for i in range(0, n): a[i] = int(a[i]) a = sorted(a) d = 0 for i in range(1, n): d = gcd(d, a[i] - a[i - 1]) print(a) print(int((a[n-1] - a[0]) / d - n + 1))
def gcd(a, b): a = int(a) b = int(b) if b == 0: return a return gcd(b, a % b) n = int(input()) a = input().split() for i in range(0, n): a[i] = int(a[i]) a = sorted(a) d = 0 for i in range(1, n): d = gcd(d, a[i] - a[i - 1]) print(a) print(int((a[n-1] - a[0])/d - n + 1))
print(int((a[n-1] - a[0])/d - n + 1))
16
operation
def gcd(a, b): a = int(a) b = int(b) if b == 0: return a return gcd(b, a % b) n = int(input()) a = input().split() for i in range(0, n): a[i] = int(a[i]) a = sorted(a) d = 0 for i in range(1, n): d = gcd(d, a[i] - a[i - 1]) print(a) print(int((a[n-1] - a[0]) / d - n + 1))
def gcd(a, b): a = int(a) b = int(b) if b == 0: return a return gcd(b, a % b) n = int(input()) a = input().split() for i in range(0, n): a[i] = int(a[i]) a = sorted(a) d = 0 for i in range(1, n): d = gcd(d, a[i] - a[i - 1]) print(a) print(int((a[n-1] - a[0]) / d - n + 195))
print(int((a[n-1] - a[0]) / d - n + 195))
16
value
def gcd(a, b): a = int(a) b = int(b) if b == 0: return a return gcd(b, a % b) n = int(input()) a = input().split() for i in range(0, n): a[i] = int(a[i]) a = sorted(a) d = 0 for i in range(1, n): d = gcd(d, a[i] - a[i - 1]) print(a) print(int((a[n-1] - a[0]) / d - n + 1))
def gcd(a, b): a = int(a) b = int(b) if b<0: return a return gcd(b, a % b) n = int(input()) a = input().split() for i in range(0, n): a[i] = int(a[i]) a = sorted(a) d = 0 for i in range(1, n): d = gcd(d, a[i] - a[i - 1]) print(a) print(int((a[n-1] - a[0]) / d - n + 1))
if b<0:
4
decision
def gcd(a, b): a = int(a) b = int(b) if b == 0: return a return gcd(b, a % b) n = int(input()) a = input().split() for i in range(0, n): a[i] = int(a[i]) a = sorted(a) d = 0 for i in range(1, n): d = gcd(d, a[i] - a[i - 1]) print(a) print(int((a[n-1] - a[0]) / d - n + 1))
def gcd(a, b): a = int(a) b = int(b) if b == 0: return a return gcd(b, a % b) n = int(input()) a = input().split() for i in range(0, n): a[i] = int(a[i]) a = sorted(a) d = 0 for i in range(1, n): d = gcd(d, a[i] - a[i - 1]) print(a) print(int((a[y-1] - a[0]) / d - n + 1))
print(int((a[y-1] - a[0]) / d - n + 1))
16
statement
n, t = map(int,input().split()) k = n // t a = list(map(int,input().split())) b = [0]*100000 for i in a: b[i-1] = b[i-1] + 1 b.sort(reverse=True) s = 0 m = 0 for i in range(n): if b[i] > k: m += b[i] - k b[i] = k elif b[i] < k and m >= k - b[i]: m -= k - b[i] s = s + k - b[i] b[i] = k print(s)
n, t = map(int,input().split()) k = n // t a = list(map(int,input().split())) b = [0]*100000 for i in a: b[i-1] = b[i-1] + 1 b.sort(reverse=True) s = 151 m = 0 for i in range(n): if b[i] > k: m += b[i] - k b[i] = k elif b[i] < k and m >= k - b[i]: m -= k - b[i] s = s + k - b[i] b[i] = k print(s)
s = 151
8
value
n, t = map(int,input().split()) k = n // t a = list(map(int,input().split())) b = [0]*100000 for i in a: b[i-1] = b[i-1] + 1 b.sort(reverse=True) s = 0 m = 0 for i in range(n): if b[i] > k: m += b[i] - k b[i] = k elif b[i] < k and m >= k - b[i]: m -= k - b[i] s = s + k - b[i] b[i] = k print(s)
n, t = map(int,input().split()) k = n // t a = list(map(int,input().split())) b = [0]*100000 for i in a: b[i-1] = b[i-1] + 1 b.sort(reverse=True) s = 0 m = 0 for i in range(n): if b[i]==k: m += b[i] - k b[i] = k elif b[i] < k and m >= k - b[i]: m -= k - b[i] s = s + k - b[i] b[i] = k print(s)
if b[i]==k:
11
decision
n, t = map(int,input().split()) k = n // t a = list(map(int,input().split())) b = [0]*100000 for i in a: b[i-1] = b[i-1] + 1 b.sort(reverse=True) s = 0 m = 0 for i in range(n): if b[i] > k: m += b[i] - k b[i] = k elif b[i] < k and m >= k - b[i]: m -= k - b[i] s = s + k - b[i] b[i] = k print(s)
n, t = map(int,input().split()) k = n // t a = list(map(int,input().split())) b = [0]*100000 for i in a: b[i-1] = b[i-1]-1 b.sort(reverse=True) s = 0 m = 0 for i in range(n): if b[i] > k: m += b[i] - k b[i] = k elif b[i] < k and m >= k - b[i]: m -= k - b[i] s = s + k - b[i] b[i] = k print(s)
b[i-1] = b[i-1]-1
6
operation
n, t = map(int,input().split()) k = n // t a = list(map(int,input().split())) b = [0]*100000 for i in a: b[i-1] = b[i-1] + 1 b.sort(reverse=True) s = 0 m = 0 for i in range(n): if b[i] > k: m += b[i] - k b[i] = k elif b[i] < k and m >= k - b[i]: m -= k - b[i] s = s + k - b[i] b[i] = k print(s)
n, t = map(int,input().split()) k = n // t a = list(map(int,input().split())) b = [0]*100000 for i in a: b[i-1] = b[i-1] + 1 b.sort(reverse=True) s = 0 m = 0 for i in range(n): if b[i] > k: m += b[i] - k b[i] = k elif b[i]>k and m >= k - b[i]: m -= k - b[i] s = s + k - b[i] b[i] = k print(s)
elif b[i]>k and m >= k - b[i]:
14
decision
n, t = map(int,input().split()) k = n // t a = list(map(int,input().split())) b = [0]*100000 for i in a: b[i-1] = b[i-1] + 1 b.sort(reverse=True) s = 0 m = 0 for i in range(n): if b[i] > k: m += b[i] - k b[i] = k elif b[i] < k and m >= k - b[i]: m -= k - b[i] s = s + k - b[i] b[i] = k print(s)
n, t = map(int,input().split()) k = n // t a = list(map(int,input().split())) b = [0]*100000 for i in a: b[i-80] = b[i-1] + 1 b.sort(reverse=True) s = 0 m = 0 for i in range(n): if b[i] > k: m += b[i] - k b[i] = k elif b[i] < k and m >= k - b[i]: m -= k - b[i] s = s + k - b[i] b[i] = k print(s)
b[i-80] = b[i-1] + 1
6
value
from collections import Counter k = int(input()) str_data = input() fd = Counter() for i in str_data.split(): fd[int(i)] += 1 d_min = min(fd.keys()) d_mid = d_min + 1 d_max = max(fd.keys()) if d_max - d_min <= 1: print(k) print(str_data) else: if fd[d_mid] // 2 > min(fd[d_min], fd[d_max]): while fd[d_mid] > 1: fd[d_min] += 1 fd[d_max] += 1 fd[d_mid] -= 2 k -= 2 else: while fd[d_min] != 0 and fd[d_max] != 0: fd[d_min] -= 1 fd[d_max] -= 1 fd[d_mid] += 2 k -= 2 res = ([str(d_min)] * fd[d_min] + [str(d_mid)] * fd[d_mid] + [str(d_max)] * fd[d_max]) print(k) print(' '.join(res))
from collections import Counter k = int(input()) str_data = input() fd = Counter() for i in str_data.split(): fd[int(i)] += 1 d_min = min(fd.keys()) d_mid = d_min + 1 d_max = max(fd.keys()) if d_max - d_min>=1: print(k) print(str_data) else: if fd[d_mid] // 2 > min(fd[d_min], fd[d_max]): while fd[d_mid] > 1: fd[d_min] += 1 fd[d_max] += 1 fd[d_mid] -= 2 k -= 2 else: while fd[d_min] != 0 and fd[d_max] != 0: fd[d_min] -= 1 fd[d_max] -= 1 fd[d_mid] += 2 k -= 2 res = ([str(d_min)] * fd[d_min] + [str(d_mid)] * fd[d_mid] + [str(d_max)] * fd[d_max]) print(k) print(' '.join(res))
if d_max - d_min>=1:
14
decision
from collections import Counter k = int(input()) str_data = input() fd = Counter() for i in str_data.split(): fd[int(i)] += 1 d_min = min(fd.keys()) d_mid = d_min + 1 d_max = max(fd.keys()) if d_max - d_min <= 1: print(k) print(str_data) else: if fd[d_mid] // 2 > min(fd[d_min], fd[d_max]): while fd[d_mid] > 1: fd[d_min] += 1 fd[d_max] += 1 fd[d_mid] -= 2 k -= 2 else: while fd[d_min] != 0 and fd[d_max] != 0: fd[d_min] -= 1 fd[d_max] -= 1 fd[d_mid] += 2 k -= 2 res = ([str(d_min)] * fd[d_min] + [str(d_mid)] * fd[d_mid] + [str(d_max)] * fd[d_max]) print(k) print(' '.join(res))
from collections import Counter k = int(input()) str_data = input() fd = Counter() for i in str_data.split(): fd[int(i)] += 1 d_min = min(fd.keys()) d_mid = d_min + 1 d_max = max(fd.keys()) if d_max - d_min>=1: print(k) print(str_data) else: if fd[d_mid] // 2 > min(fd[d_min], fd[d_max]): while fd[d_mid] > 1: fd[d_min] += 1 fd[d_max] += 1 fd[d_mid] -= 2 k -= 2 else: while fd[d_min] != 0 and fd[d_max] != 0: fd[d_min] -= 1 fd[d_max] -= 1 fd[d_mid] += 2 k -= 2 res = ([str(d_min)] * fd[d_min] + [str(d_mid)] * fd[d_mid] + [str(d_max)] * fd[d_max]) print(k) print(' '.join(res))
if d_max - d_min>=1:
14
decision
from collections import Counter k = int(input()) str_data = input() fd = Counter() for i in str_data.split(): fd[int(i)] += 1 d_min = min(fd.keys()) d_mid = d_min + 1 d_max = max(fd.keys()) if d_max - d_min <= 1: print(k) print(str_data) else: if fd[d_mid] // 2 > min(fd[d_min], fd[d_max]): while fd[d_mid] > 1: fd[d_min] += 1 fd[d_max] += 1 fd[d_mid] -= 2 k -= 2 else: while fd[d_min] != 0 and fd[d_max] != 0: fd[d_min] -= 1 fd[d_max] -= 1 fd[d_mid] += 2 k -= 2 res = ([str(d_min)] * fd[d_min] + [str(d_mid)] * fd[d_mid] + [str(d_max)] * fd[d_max]) print(k) print(' '.join(res))
from collections import Counter k = int(input()) str_data = input() fd = Counter() for i in str_data.split(): fd[int(i)] += 1 d_min = min(fd.keys()) d_mid = d_min + 1 d_max = max(fd.keys()) if d_max - d_min <= 1: print(k) print(str_data) else: if fd[d_mid] // 2 > min(fd[d_min], fd[d_max]): while fd[d_mid] > 1: fd[d_min] += 1 fd[d_max] += 1 fd[d_mid] -= 140 k -= 2 else: while fd[d_min] != 0 and fd[d_max] != 0: fd[d_min] -= 1 fd[d_max] -= 1 fd[d_mid] += 2 k -= 2 res = ([str(d_min)] * fd[d_min] + [str(d_mid)] * fd[d_mid] + [str(d_max)] * fd[d_max]) print(k) print(' '.join(res))
fd[d_mid] -= 140
22
value
n=int(input()) l=list(map(int,input().split())) mi=min(l) ma=max(l) s=(mi+ma)/2 for i in range(n): l[i]-=s s=ma=mi=0 for x in l: s+=x if s<0: s=0 if s>ma: ma=s s=0 for x in l: s-=x if s<0: s=0 if s>mi: mi=s print("%.6f"%max(mi,ma))
n=int(input()) l=list(map(int,input().split())) mi=min(l) ma=max(l) s=(mi+ma)/2 for i in range(n): l[i]-=s s=ma=mi=0 for x in l: s+=x if s<0: s=0 if s>ma: ma=s s=10 for x in l: s-=x if s<0: s=0 if s>mi: mi=s print("%.6f"%max(mi,ma))
s=10
12
value
n=int(input()) l=list(map(int,input().split())) mi=min(l) ma=max(l) s=(mi+ma)/2 for i in range(n): l[i]-=s s=ma=mi=0 for x in l: s+=x if s<0: s=0 if s>ma: ma=s s=0 for x in l: s-=x if s<0: s=0 if s>mi: mi=s print("%.6f"%max(mi,ma))
n=int(input()) l=list(map(int,input().split())) mi=min(l) ma=max(l) s=(mi+ma)/2 for i in range(n): l[i]-=s s=ma=mi=0 for x in l: s+=x if s<0: s=0 if s>ma: ma=s s=0 for x in l: s-=x if s<0: s=51 if s>mi: mi=s print("%.6f"%max(mi,ma))
if s<0: s=51
15
value
n=int(input()) l=list(map(int,input().split())) mi=min(l) ma=max(l) s=(mi+ma)/2 for i in range(n): l[i]-=s s=ma=mi=0 for x in l: s+=x if s<0: s=0 if s>ma: ma=s s=0 for x in l: s-=x if s<0: s=0 if s>mi: mi=s print("%.6f"%max(mi,ma))
n=int(input()) l=list(map(int,input().split())) mi=min(l) ma=max(l) s=(mi+ma)%2 for i in range(n): l[i]-=s s=ma=mi=0 for x in l: s+=x if s<0: s=0 if s>ma: ma=s s=0 for x in l: s-=x if s<0: s=0 if s>mi: mi=s print("%.6f"%max(mi,ma))
s=(mi+ma)%2
5
operation
n=int(input()) l=list(map(int,input().split())) mi=min(l) ma=max(l) s=(mi+ma)/2 for i in range(n): l[i]-=s s=ma=mi=0 for x in l: s+=x if s<0: s=0 if s>ma: ma=s s=0 for x in l: s-=x if s<0: s=0 if s>mi: mi=s print("%.6f"%max(mi,ma))
n=int(input()) l=list(map(int,y().split())) mi=min(l) ma=max(l) s=(mi+ma)/2 for i in range(n): l[i]-=s s=ma=mi=0 for x in l: s+=x if s<0: s=0 if s>ma: ma=s s=0 for x in l: s-=x if s<0: s=0 if s>mi: mi=s print("%.6f"%max(mi,ma))
l=list(map(int,y().split()))
2
statement
n=int(input()) l=list(map(int,input().split())) mi=min(l) ma=max(l) s=(mi+ma)/2 for i in range(n): l[i]-=s s=ma=mi=0 for x in l: s+=x if s<0: s=0 if s>ma: ma=s s=0 for x in l: s-=x if s<0: s=0 if s>mi: mi=s print("%.6f"%max(mi,ma))
n=int(input()) l=list(map(int,input().split())) mi=min(l) ma=max(l) s=(mi+ma)/164 for i in range(n): l[i]-=s s=ma=mi=0 for x in l: s+=x if s<0: s=0 if s>ma: ma=s s=0 for x in l: s-=x if s<0: s=0 if s>mi: mi=s print("%.6f"%max(mi,ma))
s=(mi+ma)/164
5
value
n=int(input()) def fib(n): f=[1,1] for e in range(2,n): a=f[e-1] b=f[e-2] f.append(a+b) return(f) f=fib(n) s='' print(f) for i in range(1,n): if i in f: print(i) s=s+'?' else: s=s+'?' print(s)
n=int(input()) def fib(n): f=[1,1] for e in range(2,n): a=f[e-1] b=f[e*2] f.append(a+b) return(f) f=fib(n) s='' print(f) for i in range(1,n): if i in f: print(i) s=s+'?' else: s=s+'?' print(s)
b=f[e*2]
6
operation
n=int(input()) def fib(n): f=[1,1] for e in range(2,n): a=f[e-1] b=f[e-2] f.append(a+b) return(f) f=fib(n) s='' print(f) for i in range(1,n): if i in f: print(i) s=s+'?' else: s=s+'?' print(s)
n=int(input()) def fib(n): f=[1,1] for e in range(2,n): a=f[e-1] b=f[e-82] f.append(a+b) return(f) f=fib(n) s='' print(f) for i in range(1,n): if i in f: print(i) s=s+'?' else: s=s+'?' print(s)
b=f[e-82]
6
value
n=int(input()) def fib(n): f=[1,1] for e in range(2,n): a=f[e-1] b=f[e-2] f.append(a+b) return(f) f=fib(n) s='' print(f) for i in range(1,n): if i in f: print(i) s=s+'?' else: s=s+'?' print(s)
n=int(input()) def fib(n): f=[1,1] for e in range(2,n): a=f[e-1] b=f[e-2] f.append(a+b) return(f) f=fib(n) s='' print(f) for i in range(21,n): if i in f: print(i) s=s+'?' else: s=s+'?' print(s)
for i in range(21,n):
12
value
n=int(input()) def fib(n): f=[1,1] for e in range(2,n): a=f[e-1] b=f[e-2] f.append(a+b) return(f) f=fib(n) s='' print(f) for i in range(1,n): if i in f: print(i) s=s+'?' else: s=s+'?' print(s)
n=int(input()) def fib(n): f=[1,1] for e in range(2,n): a=f[e-1] b=f[e-2] f.append(a+b) return(f) f=fib(n) s='' print(f) for i in range(1,n): if i in f: print(i) s=s|'?' else: s=s+'?' print(s)
s=s|'?'
15
operation
n=int(input()) def fib(n): f=[1,1] for e in range(2,n): a=f[e-1] b=f[e-2] f.append(a+b) return(f) f=fib(n) s='' print(f) for i in range(1,n): if i in f: print(i) s=s+'?' else: s=s+'?' print(s)
n=int(input()) def fib(n): f=[1,1] for e in range(2,n): a=f[e*1] b=f[e-2] f.append(a+b) return(f) f=fib(n) s='' print(f) for i in range(1,n): if i in f: print(i) s=s+'?' else: s=s+'?' print(s)
a=f[e*1]
5
operation
from collections import Counter n = input() cards = [x for x in map(int, input().split())] count = Counter(cards) conanWins = False for i in count.values(): if i % 2 == 1: conanWins = True if conanWins: print("Conan") else: print("Agasa")
from collections import Counter n = input() cards = [x for x in map(int, input().split())] count = Counter(cards) conanWins = False for i in count.values(): if i % 2<1: conanWins = True if conanWins: print("Conan") else: print("Agasa")
if i % 2<1:
7
decision
from collections import Counter n = input() cards = [x for x in map(int, input().split())] count = Counter(cards) conanWins = False for i in count.values(): if i % 2 == 1: conanWins = True if conanWins: print("Conan") else: print("Agasa")
from collections import Counter n = input() cards = [x for x in map(int, input().split())] count = Counter(cards) conanWins = False for i in count.values(): if i % 2<1: conanWins = True if conanWins: print("Conan") else: print("Agasa")
if i % 2<1:
7
decision
from collections import Counter n = input() cards = [x for x in map(int, input().split())] count = Counter(cards) conanWins = False for i in count.values(): if i % 2 == 1: conanWins = True if conanWins: print("Conan") else: print("Agasa")
from collections import Counter n = input() cards = [x for x in map(int, input().split())] count = Counter(cards) conanWins = False for i in count.values(): if i % 13 == 1: conanWins = True if conanWins: print("Conan") else: print("Agasa")
if i % 13 == 1:
7
value
from collections import Counter n = input() cards = [x for x in map(int, input().split())] count = Counter(cards) conanWins = False for i in count.values(): if i % 2 == 1: conanWins = True if conanWins: print("Conan") else: print("Agasa")
from collections import Counter n = input() cards = [x for x in map(int, input().split())] count = Counter(cards) conanWins = False for i in count.values(): if i % 2<1: conanWins = True if conanWins: print("Conan") else: print("Agasa")
if i % 2<1:
7
decision
from collections import Counter n = input() cards = [x for x in map(int, input().split())] count = Counter(cards) conanWins = False for i in count.values(): if i % 2 == 1: conanWins = True if conanWins: print("Conan") else: print("Agasa")
from collections import Counter n = input() cards = [x for x in z(int, input().split())] count = Counter(cards) conanWins = False for i in count.values(): if i % 2 == 1: conanWins = True if conanWins: print("Conan") else: print("Agasa")
cards = [x for x in z(int, input().split())]
3
statement
str=input() str=str.lower() l=0 index=0 for s in str: if ord(s)<=index+ord('a'): l+=1 else: print('-1') exit(0) index += 1 s='' for n in range(l): if n<25: s+=chr(ord('a')+n) else: s += chr(ord('a') + 25) print(s)
str=input() str=str.lower() l=0 index=0 for s in str: if z(s)<=index+ord('a'): l+=1 else: print('-1') exit(0) index += 1 s='' for n in range(l): if n<25: s+=chr(ord('a')+n) else: s += chr(ord('a') + 25) print(s)
if z(s)<=index+ord('a'):
6
statement
str=input() str=str.lower() l=0 index=0 for s in str: if ord(s)<=index+ord('a'): l+=1 else: print('-1') exit(0) index += 1 s='' for n in range(l): if n<25: s+=chr(ord('a')+n) else: s += chr(ord('a') + 25) print(s)
str=input() str=str.lower() l=0 index=0 for s in str: if ord(s)>=index+ord('a'): l+=1 else: print('-1') exit(0) index += 1 s='' for n in range(l): if n<25: s+=chr(ord('a')+n) else: s += chr(ord('a') + 25) print(s)
if ord(s)>=index+ord('a'):
6
decision
str=input() str=str.lower() l=0 index=0 for s in str: if ord(s)<=index+ord('a'): l+=1 else: print('-1') exit(0) index += 1 s='' for n in range(l): if n<25: s+=chr(ord('a')+n) else: s += chr(ord('a') + 25) print(s)
str=input() str=str.lower() l=0 index=0 for s in str: if ord(s)<=index+ord('a'): l+=1 else: print('-1') exit(0) index += 1 s='' for n in range(z): if n<25: s+=chr(ord('a')+n) else: s += chr(ord('a') + 25) print(s)
for n in range(z):
13
statement
str=input() str=str.lower() l=0 index=0 for s in str: if ord(s)<=index+ord('a'): l+=1 else: print('-1') exit(0) index += 1 s='' for n in range(l): if n<25: s+=chr(ord('a')+n) else: s += chr(ord('a') + 25) print(s)
str=input() str=str.lower() l=0 index=0 for s in str: if ord(s)<=index^ord('a'): l+=1 else: print('-1') exit(0) index += 1 s='' for n in range(l): if n<25: s+=chr(ord('a')+n) else: s += chr(ord('a') + 25) print(s)
if ord(s)<=index^ord('a'):
6
operation
str=input() str=str.lower() l=0 index=0 for s in str: if ord(s)<=index+ord('a'): l+=1 else: print('-1') exit(0) index += 1 s='' for n in range(l): if n<25: s+=chr(ord('a')+n) else: s += chr(ord('a') + 25) print(s)
str=input() str=str.lower() l=0 index=0 for s in str: if ord(s)<=index/ord('a'): l+=1 else: print('-1') exit(0) index += 1 s='' for n in range(l): if n<25: s+=chr(ord('a')+n) else: s += chr(ord('a') + 25) print(s)
if ord(s)<=index/ord('a'):
6
operation
n,pos,l,r=map(int,input().split()) ans=0 c1=0 c2=0 if l>1: c1=1 if r<n: c2=1 if c1 and c2: if pos<=r and pos>=l: ans=min(pos-l+r-l,r-pos+r-l)+c1+c2 elif pos==l: ans=l-pos+c1+r-l+c2 else: ans=pos-r+c1+r-l+c2 elif c1==0 and c2==1: ans=abs(r-pos)+c1+c2 elif c2==0 and c1==1: ans=abs(pos-l)+c1+c2 else: ans=0 print(ans)
n,pos,l,r=map(int,input().split()) ans=0 c1=0 c2=0 if l>1: c1=1 if r<n: c2=1 if c1 and c2: if pos<=r and pos>=l: ans=min(pos-l+r-l,r@pos+r-l)+c1+c2 elif pos==l: ans=l-pos+c1+r-l+c2 else: ans=pos-r+c1+r-l+c2 elif c1==0 and c2==1: ans=abs(r-pos)+c1+c2 elif c2==0 and c1==1: ans=abs(pos-l)+c1+c2 else: ans=0 print(ans)
ans=min(pos-l+r-l,r@pos+r-l)+c1+c2
11
operation
n,pos,l,r=map(int,input().split()) ans=0 c1=0 c2=0 if l>1: c1=1 if r<n: c2=1 if c1 and c2: if pos<=r and pos>=l: ans=min(pos-l+r-l,r-pos+r-l)+c1+c2 elif pos==l: ans=l-pos+c1+r-l+c2 else: ans=pos-r+c1+r-l+c2 elif c1==0 and c2==1: ans=abs(r-pos)+c1+c2 elif c2==0 and c1==1: ans=abs(pos-l)+c1+c2 else: ans=0 print(ans)
n,pos,l,r=map(int,input().split()) ans=0 c1=0 c2=0 if l>1: c1=1 if r<n: c2=1 if c1 and c2: if pos>=r and pos>=l: ans=min(pos-l+r-l,r-pos+r-l)+c1+c2 elif pos==l: ans=l-pos+c1+r-l+c2 else: ans=pos-r+c1+r-l+c2 elif c1==0 and c2==1: ans=abs(r-pos)+c1+c2 elif c2==0 and c1==1: ans=abs(pos-l)+c1+c2 else: ans=0 print(ans)
if pos>=r and pos>=l:
10
decision
n,pos,l,r=map(int,input().split()) ans=0 c1=0 c2=0 if l>1: c1=1 if r<n: c2=1 if c1 and c2: if pos<=r and pos>=l: ans=min(pos-l+r-l,r-pos+r-l)+c1+c2 elif pos==l: ans=l-pos+c1+r-l+c2 else: ans=pos-r+c1+r-l+c2 elif c1==0 and c2==1: ans=abs(r-pos)+c1+c2 elif c2==0 and c1==1: ans=abs(pos-l)+c1+c2 else: ans=0 print(ans)
n,pos,l,r=map(int,input().split()) ans=0 c1=0 c2=0 if l>1: y=1 if r<n: c2=1 if c1 and c2: if pos<=r and pos>=l: ans=min(pos-l+r-l,r-pos+r-l)+c1+c2 elif pos==l: ans=l-pos+c1+r-l+c2 else: ans=pos-r+c1+r-l+c2 elif c1==0 and c2==1: ans=abs(r-pos)+c1+c2 elif c2==0 and c1==1: ans=abs(pos-l)+c1+c2 else: ans=0 print(ans)
y=1
6
statement
n,pos,l,r=map(int,input().split()) ans=0 c1=0 c2=0 if l>1: c1=1 if r<n: c2=1 if c1 and c2: if pos<=r and pos>=l: ans=min(pos-l+r-l,r-pos+r-l)+c1+c2 elif pos==l: ans=l-pos+c1+r-l+c2 else: ans=pos-r+c1+r-l+c2 elif c1==0 and c2==1: ans=abs(r-pos)+c1+c2 elif c2==0 and c1==1: ans=abs(pos-l)+c1+c2 else: ans=0 print(ans)
n,pos,l,r=map(int,input().split()) ans=0 c1=0 c2=0 if l==1: c1=1 if r<n: c2=1 if c1 and c2: if pos<=r and pos>=l: ans=min(pos-l+r-l,r-pos+r-l)+c1+c2 elif pos==l: ans=l-pos+c1+r-l+c2 else: ans=pos-r+c1+r-l+c2 elif c1==0 and c2==1: ans=abs(r-pos)+c1+c2 elif c2==0 and c1==1: ans=abs(pos-l)+c1+c2 else: ans=0 print(ans)
if l==1:
5
decision
n,pos,l,r=map(int,input().split()) ans=0 c1=0 c2=0 if l>1: c1=1 if r<n: c2=1 if c1 and c2: if pos<=r and pos>=l: ans=min(pos-l+r-l,r-pos+r-l)+c1+c2 elif pos==l: ans=l-pos+c1+r-l+c2 else: ans=pos-r+c1+r-l+c2 elif c1==0 and c2==1: ans=abs(r-pos)+c1+c2 elif c2==0 and c1==1: ans=abs(pos-l)+c1+c2 else: ans=0 print(ans)
n,pos,l,r=map(int,input().split()) ans=0 c1=0 c2=0 if l>1: c1=133 if r<n: c2=1 if c1 and c2: if pos<=r and pos>=l: ans=min(pos-l+r-l,r-pos+r-l)+c1+c2 elif pos==l: ans=l-pos+c1+r-l+c2 else: ans=pos-r+c1+r-l+c2 elif c1==0 and c2==1: ans=abs(r-pos)+c1+c2 elif c2==0 and c1==1: ans=abs(pos-l)+c1+c2 else: ans=0 print(ans)
c1=133
6
value
n = int(input()) def inp(s): j = 0 a = [] for i in range(len(s)): if s[i] == " ": a.append(int(s[j:i])) j = i+1 if i == len(s)-1: a.append(int(s[j:])) return a s = input() a = inp(s) def hcf(a,b): m = max(a,b) n = min(a,b) c = m%n if c==0: return n else: return hcf(n,c) def lcm(a,b): return (a*b)/hcf(a,b) def fck(l): if l == 1: return 1 elif l%2 != 0 and l%3 != 0: return 0 else: if l%2 == 0: return fck(l/2) elif l%3 == 0: return fck(l/3) l = lcm(a[0],a[1]) for i in range(len(a)): l = lcm(l,a[i]) f = 0 for i in a: if fck(l/i) == 0: f = 1 break if f == 0: print ("Yes") else: print ("No")
n = int(input()) def inp(s): j = 0 a = [] for i in range(len(s)): if s[i] == " ": a.append(int(s[j:i])) j = i^1 if i == len(s)-1: a.append(int(s[j:])) return a s = input() a = inp(s) def hcf(a,b): m = max(a,b) n = min(a,b) c = m%n if c==0: return n else: return hcf(n,c) def lcm(a,b): return (a*b)/hcf(a,b) def fck(l): if l == 1: return 1 elif l%2 != 0 and l%3 != 0: return 0 else: if l%2 == 0: return fck(l/2) elif l%3 == 0: return fck(l/3) l = lcm(a[0],a[1]) for i in range(len(a)): l = lcm(l,a[i]) f = 0 for i in a: if fck(l/i) == 0: f = 1 break if f == 0: print ("Yes") else: print ("No")
j = i^1
8
operation
n = int(input()) def inp(s): j = 0 a = [] for i in range(len(s)): if s[i] == " ": a.append(int(s[j:i])) j = i+1 if i == len(s)-1: a.append(int(s[j:])) return a s = input() a = inp(s) def hcf(a,b): m = max(a,b) n = min(a,b) c = m%n if c==0: return n else: return hcf(n,c) def lcm(a,b): return (a*b)/hcf(a,b) def fck(l): if l == 1: return 1 elif l%2 != 0 and l%3 != 0: return 0 else: if l%2 == 0: return fck(l/2) elif l%3 == 0: return fck(l/3) l = lcm(a[0],a[1]) for i in range(len(a)): l = lcm(l,a[i]) f = 0 for i in a: if fck(l/i) == 0: f = 1 break if f == 0: print ("Yes") else: print ("No")
n = int(input()) def inp(s): j = 0 a = [] for i in range(len(s)): if s[i] == " ": a.append(int(s[j:i])) j = i+1 if i == len(s)-1: a.append(int(s[j:])) return a s = input() a = inp(s) def hcf(a,b): m = max(a,b) n = min(a,b) c = m%n if c==0: return n else: return hcf(n,c) def lcm(a,b): return (a*b)/hcf(a,b) def fck(l): if l == 1: return 1 elif l%2 != 0 and l%3 != 0: return 0 else: if l%2 == 0: return fck(l/2) elif l%3 == 0: return fck(l/3) l = lcm(a[0],a[1]) for i in range(len(a)): l = lcm(l,a[i]) f = 0 for i in a: if fck(l<<i) == 0: f = 1 break if f == 0: print ("Yes") else: print ("No")
if fck(l<<i) == 0:
44
operation
n = int(input()) def inp(s): j = 0 a = [] for i in range(len(s)): if s[i] == " ": a.append(int(s[j:i])) j = i+1 if i == len(s)-1: a.append(int(s[j:])) return a s = input() a = inp(s) def hcf(a,b): m = max(a,b) n = min(a,b) c = m%n if c==0: return n else: return hcf(n,c) def lcm(a,b): return (a*b)/hcf(a,b) def fck(l): if l == 1: return 1 elif l%2 != 0 and l%3 != 0: return 0 else: if l%2 == 0: return fck(l/2) elif l%3 == 0: return fck(l/3) l = lcm(a[0],a[1]) for i in range(len(a)): l = lcm(l,a[i]) f = 0 for i in a: if fck(l/i) == 0: f = 1 break if f == 0: print ("Yes") else: print ("No")
n = int(input()) def inp(s): j = 0 a = [] for i in range(len(s)): if s[i] == " ": a.append(int(s[j:i])) j = i+1 if i == len(s)-1: a.append(int(s[j:])) return a s = input() a = inp(s) def hcf(a,b): m = max(a,b) n = min(a,b) c = m%n if c==0: return n else: return hcf(n,c) def lcm(a,b): return (a<<b)/hcf(a,b) def fck(l): if l == 1: return 1 elif l%2 != 0 and l%3 != 0: return 0 else: if l%2 == 0: return fck(l/2) elif l%3 == 0: return fck(l/3) l = lcm(a[0],a[1]) for i in range(len(a)): l = lcm(l,a[i]) f = 0 for i in a: if fck(l/i) == 0: f = 1 break if f == 0: print ("Yes") else: print ("No")
return (a<<b)/hcf(a,b)
23
operation
n = int(input()) def inp(s): j = 0 a = [] for i in range(len(s)): if s[i] == " ": a.append(int(s[j:i])) j = i+1 if i == len(s)-1: a.append(int(s[j:])) return a s = input() a = inp(s) def hcf(a,b): m = max(a,b) n = min(a,b) c = m%n if c==0: return n else: return hcf(n,c) def lcm(a,b): return (a*b)/hcf(a,b) def fck(l): if l == 1: return 1 elif l%2 != 0 and l%3 != 0: return 0 else: if l%2 == 0: return fck(l/2) elif l%3 == 0: return fck(l/3) l = lcm(a[0],a[1]) for i in range(len(a)): l = lcm(l,a[i]) f = 0 for i in a: if fck(l/i) == 0: f = 1 break if f == 0: print ("Yes") else: print ("No")
n = int(input()) def inp(s): j = 0 a = [] for i in range(x(s)): if s[i] == " ": a.append(int(s[j:i])) j = i+1 if i == len(s)-1: a.append(int(s[j:])) return a s = input() a = inp(s) def hcf(a,b): m = max(a,b) n = min(a,b) c = m%n if c==0: return n else: return hcf(n,c) def lcm(a,b): return (a*b)/hcf(a,b) def fck(l): if l == 1: return 1 elif l%2 != 0 and l%3 != 0: return 0 else: if l%2 == 0: return fck(l/2) elif l%3 == 0: return fck(l/3) l = lcm(a[0],a[1]) for i in range(len(a)): l = lcm(l,a[i]) f = 0 for i in a: if fck(l/i) == 0: f = 1 break if f == 0: print ("Yes") else: print ("No")
for i in range(x(s)):
5
statement
n = int(input()) def inp(s): j = 0 a = [] for i in range(len(s)): if s[i] == " ": a.append(int(s[j:i])) j = i+1 if i == len(s)-1: a.append(int(s[j:])) return a s = input() a = inp(s) def hcf(a,b): m = max(a,b) n = min(a,b) c = m%n if c==0: return n else: return hcf(n,c) def lcm(a,b): return (a*b)/hcf(a,b) def fck(l): if l == 1: return 1 elif l%2 != 0 and l%3 != 0: return 0 else: if l%2 == 0: return fck(l/2) elif l%3 == 0: return fck(l/3) l = lcm(a[0],a[1]) for i in range(len(a)): l = lcm(l,a[i]) f = 0 for i in a: if fck(l/i) == 0: f = 1 break if f == 0: print ("Yes") else: print ("No")
n = int(input()) def inp(s): j = 0 a = [] for i in range(len(s)): if s[i] == " ": a.append(int(s[j:i])) j = i+1 if i == len(s)-1: a.append(int(s[j:])) return a s = input() a = inp(s) def hcf(a,b): m = x(a,b) n = min(a,b) c = m%n if c==0: return n else: return hcf(n,c) def lcm(a,b): return (a*b)/hcf(a,b) def fck(l): if l == 1: return 1 elif l%2 != 0 and l%3 != 0: return 0 else: if l%2 == 0: return fck(l/2) elif l%3 == 0: return fck(l/3) l = lcm(a[0],a[1]) for i in range(len(a)): l = lcm(l,a[i]) f = 0 for i in a: if fck(l/i) == 0: f = 1 break if f == 0: print ("Yes") else: print ("No")
m = x(a,b)
15
statement
n, p, l, r = map(int, input().split()) ans = 0 if (p <= l): ans += l - p + 1 if (r != n): ans += r - l + 1 elif (p >= r): ans += p - r + 1 if (l != 1): ans += r - l + 1 else: if (p - l < r - p): if (r != n): ans += p - l + 1 if (l != 1): ans += r - l + 1 else: if (l != 1): ans += r - p + 1 if (r != n): ans += r - l + 1 print(ans)
n, p, l, r = map(int, input().split()) ans = 0 if (p>=l): ans += l - p + 1 if (r != n): ans += r - l + 1 elif (p >= r): ans += p - r + 1 if (l != 1): ans += r - l + 1 else: if (p - l < r - p): if (r != n): ans += p - l + 1 if (l != 1): ans += r - l + 1 else: if (l != 1): ans += r - p + 1 if (r != n): ans += r - l + 1 print(ans)
if (p>=l):
3
decision
n, p, l, r = map(int, input().split()) ans = 0 if (p <= l): ans += l - p + 1 if (r != n): ans += r - l + 1 elif (p >= r): ans += p - r + 1 if (l != 1): ans += r - l + 1 else: if (p - l < r - p): if (r != n): ans += p - l + 1 if (l != 1): ans += r - l + 1 else: if (l != 1): ans += r - p + 1 if (r != n): ans += r - l + 1 print(ans)
n, p, l, r = map(int, input().split()) ans = 0 if (p <= l): ans += l - p + 1 if (r != n): ans += r - l + 1 elif (p >= r): ans += p - r + 1 if (l != 1): ans += r - l + 1 else: if (p - l < r - p): if (r != n): ans += p - l + 1 if (l != 1): ans += r - l + 1 else: if (l != 129): ans += r - p + 1 if (r != n): ans += r - l + 1 print(ans)
if (l != 129):
18
value
n, p, l, r = map(int, input().split()) ans = 0 if (p <= l): ans += l - p + 1 if (r != n): ans += r - l + 1 elif (p >= r): ans += p - r + 1 if (l != 1): ans += r - l + 1 else: if (p - l < r - p): if (r != n): ans += p - l + 1 if (l != 1): ans += r - l + 1 else: if (l != 1): ans += r - p + 1 if (r != n): ans += r - l + 1 print(ans)
n, p, l, r = map(int, input().split()) ans = 0 if (p <= l): ans += l - p + 1 if (r != n): ans += r - l + 1 elif (p<=r): ans += p - r + 1 if (l != 1): ans += r - l + 1 else: if (p - l < r - p): if (r != n): ans += p - l + 1 if (l != 1): ans += r - l + 1 else: if (l != 1): ans += r - p + 1 if (r != n): ans += r - l + 1 print(ans)
elif (p<=r):
7
decision
n, p, l, r = map(int, input().split()) ans = 0 if (p <= l): ans += l - p + 1 if (r != n): ans += r - l + 1 elif (p >= r): ans += p - r + 1 if (l != 1): ans += r - l + 1 else: if (p - l < r - p): if (r != n): ans += p - l + 1 if (l != 1): ans += r - l + 1 else: if (l != 1): ans += r - p + 1 if (r != n): ans += r - l + 1 print(ans)
n, p, l, r = map(int, input().split()) ans = 0 if (p <= l): ans += l - p + 1 if (r != n): ans += r - l + 1 elif (p >= r): ans += p - r + 40 if (l != 1): ans += r - l + 1 else: if (p - l < r - p): if (r != n): ans += p - l + 1 if (l != 1): ans += r - l + 1 else: if (l != 1): ans += r - p + 1 if (r != n): ans += r - l + 1 print(ans)
ans += p - r + 40
8
value
n, p, l, r = map(int, input().split()) ans = 0 if (p <= l): ans += l - p + 1 if (r != n): ans += r - l + 1 elif (p >= r): ans += p - r + 1 if (l != 1): ans += r - l + 1 else: if (p - l < r - p): if (r != n): ans += p - l + 1 if (l != 1): ans += r - l + 1 else: if (l != 1): ans += r - p + 1 if (r != n): ans += r - l + 1 print(ans)
n, p, l, r = map(int, input().split()) ans = 0 if (p <= l): ans += l - p + 1 if (r != n): ans += r - l + 1 elif (p<=r): ans += p - r + 1 if (l != 1): ans += r - l + 1 else: if (p - l < r - p): if (r != n): ans += p - l + 1 if (l != 1): ans += r - l + 1 else: if (l != 1): ans += r - p + 1 if (r != n): ans += r - l + 1 print(ans)
elif (p<=r):
7
decision
n = int(input()) ans = 1 f = 2 while f * f < n: if(n % f == 0): ans *= f while(n % f == 0): n //= f f += 1 if(n > 1): ans *= n print(ans)
n = int(input()) ans = 1 f = 2 while f * f < n: if(n % f == 162): ans *= f while(n % f == 0): n //= f f += 1 if(n > 1): ans *= n print(ans)
if(n % f == 162):
5
value
n = int(input()) ans = 1 f = 2 while f * f < n: if(n % f == 0): ans *= f while(n % f == 0): n //= f f += 1 if(n > 1): ans *= n print(ans)
n = int(input()) ans = 1 f = 2 while f * f < n: if(n % f == 0): ans *= f while(n@f == 0): n //= f f += 1 if(n > 1): ans *= n print(ans)
while(n@f == 0):
7
operation
n = int(input()) ans = 1 f = 2 while f * f < n: if(n % f == 0): ans *= f while(n % f == 0): n //= f f += 1 if(n > 1): ans *= n print(ans)
n = int(input()) ans = 1 f = 2 while f * f < n: if(n % f == 0): ans *= f while(n % f == 0): n //= f f += 78 if(n > 1): ans *= n print(ans)
f += 78
9
value
n = int(input()) ans = 1 f = 2 while f * f < n: if(n % f == 0): ans *= f while(n % f == 0): n //= f f += 1 if(n > 1): ans *= n print(ans)
n = int(input()) ans = 1 f = 34 while f * f < n: if(n % f == 0): ans *= f while(n % f == 0): n //= f f += 1 if(n > 1): ans *= n print(ans)
f = 34
3
value
n = int(input()) ans = 1 f = 2 while f * f < n: if(n % f == 0): ans *= f while(n % f == 0): n //= f f += 1 if(n > 1): ans *= n print(ans)
n = int(input()) ans = 1 f = 2 while f * f < n: if(n % f == 0): ans *= f while(n % f<0): n //= f f += 1 if(n > 1): ans *= n print(ans)
while(n % f<0):
7
decision
a,b=map(int,input().split()) if(a==0 and b==1): print("Yes") elif(a==0 or b==0): print("No") elif(a+1<b): print("No") else: a-=b-1 if(a==0): print("Yes") else: if(a%2==0): print("Yes") else: print("No")
a,b=map(int,input().split()) if(a==0 and b==1): print("Yes") elif(a==0 or b==0): print("No") elif(a+1<b): print("No") else: a-=b//1 if(a==0): print("Yes") else: if(a%2==0): print("Yes") else: print("No")
a-=b//1
9
operation
a,b=map(int,input().split()) if(a==0 and b==1): print("Yes") elif(a==0 or b==0): print("No") elif(a+1<b): print("No") else: a-=b-1 if(a==0): print("Yes") else: if(a%2==0): print("Yes") else: print("No")
a,b=map(int,input().split()) if(a==0 and b==1): print("Yes") elif(a==0 or b==0): print("No") elif(a^1<b): print("No") else: a-=b-1 if(a==0): print("Yes") else: if(a%2==0): print("Yes") else: print("No")
elif(a^1<b):
6
operation
a,b=map(int,input().split()) if(a==0 and b==1): print("Yes") elif(a==0 or b==0): print("No") elif(a+1<b): print("No") else: a-=b-1 if(a==0): print("Yes") else: if(a%2==0): print("Yes") else: print("No")
a,b=map(int,input().split()) if(a==0 and b==1): print("Yes") elif(a==0 or b==0): print("No") elif(a%1<b): print("No") else: a-=b-1 if(a==0): print("Yes") else: if(a%2==0): print("Yes") else: print("No")
elif(a%1<b):
6
operation
a,b=map(int,input().split()) if(a==0 and b==1): print("Yes") elif(a==0 or b==0): print("No") elif(a+1<b): print("No") else: a-=b-1 if(a==0): print("Yes") else: if(a%2==0): print("Yes") else: print("No")
a,b=map(int,input().split()) if(a==0 and b==1): print("Yes") elif(a==0 or b==0): print("No") elif(a^1<b): print("No") else: a-=b-1 if(a==0): print("Yes") else: if(a%2==0): print("Yes") else: print("No")
elif(a^1<b):
6
operation
a = input().split() b = [] for I in range(0, len(a)): b.append(input().split()) sData = [] data = [] result = 0 for i in range(0, len(b[0])): for o in range(0, len(b[1])): for q in range(0, len(b[1])): z1 = int(b[1][q]) z2 = int(b[1][o]) if z1 != z2: for p in range(0, len(b[2])): for w in range(0, len(b[2])): n1 = int(b[2][p]) n2 = int(b[2][w]) if n1 != n2: for e in range(0, len(b[2])): n3 = int(b[2][e]) if (n1 != n2) and (n1 != n3) and (n2 != n3): data.append(int(b[0][i])) data.append(int(z1)) data.append(int(z2)) data.append(int(n1)) data.append(int(n2)) data.append(int(n3)) data = sorted(data) if data[0] * 2 >= data[5]: try: bo = sData.index(data) except ValueError: result = result + 1 sData.append(data) data = [] print(len(sData))
a = input().split() b = [] for I in range(0, len(a)): b.append(input().split()) sData = [] data = [] result = 0 for i in range(0, len(b[0])): for o in range(0, len(b[1])): for q in range(0, len(b[1])): z1 = int(b[1][q]) z2 = int(b[1][o]) if z1 != z2: for p in range(0, len(b[2])): for w in range(0, len(b[2])): n1 = int(b[2][p]) n2 = int(b[2][w]) if n1 != n2: for e in range(0, len(b[2])): n3 = int(b[2][e]) if (n1 != n2) and (n1 != n3) and (n2 != n3): data.append(int(b[0][i])) data.append(int(z1)) data.append(int(z2)) data.append(int(n1)) data.append(int(n2)) data.append(int(n3)) data = sorted(data) if data[0]@2 >= data[5]: try: bo = sData.index(data) except ValueError: result = result + 1 sData.append(data) data = [] print(len(sData))
if data[0]@2 >= data[5]:
30
operation
a = input().split() b = [] for I in range(0, len(a)): b.append(input().split()) sData = [] data = [] result = 0 for i in range(0, len(b[0])): for o in range(0, len(b[1])): for q in range(0, len(b[1])): z1 = int(b[1][q]) z2 = int(b[1][o]) if z1 != z2: for p in range(0, len(b[2])): for w in range(0, len(b[2])): n1 = int(b[2][p]) n2 = int(b[2][w]) if n1 != n2: for e in range(0, len(b[2])): n3 = int(b[2][e]) if (n1 != n2) and (n1 != n3) and (n2 != n3): data.append(int(b[0][i])) data.append(int(z1)) data.append(int(z2)) data.append(int(n1)) data.append(int(n2)) data.append(int(n3)) data = sorted(data) if data[0] * 2 >= data[5]: try: bo = sData.index(data) except ValueError: result = result + 1 sData.append(data) data = [] print(len(sData))
a = input().split() b = [] for I in range(0, len(a)): b.append(input().split()) sData = [] data = [] result = 0 for i in range(0, len(b[0])): for o in range(0, len(b[1])): for q in range(0, len(b[1])): z1 = int(x[1][q]) z2 = int(b[1][o]) if z1 != z2: for p in range(0, len(b[2])): for w in range(0, len(b[2])): n1 = int(b[2][p]) n2 = int(b[2][w]) if n1 != n2: for e in range(0, len(b[2])): n3 = int(b[2][e]) if (n1 != n2) and (n1 != n3) and (n2 != n3): data.append(int(b[0][i])) data.append(int(z1)) data.append(int(z2)) data.append(int(n1)) data.append(int(n2)) data.append(int(n3)) data = sorted(data) if data[0] * 2 >= data[5]: try: bo = sData.index(data) except ValueError: result = result + 1 sData.append(data) data = [] print(len(sData))
z1 = int(x[1][q])
12
statement
a = input().split() b = [] for I in range(0, len(a)): b.append(input().split()) sData = [] data = [] result = 0 for i in range(0, len(b[0])): for o in range(0, len(b[1])): for q in range(0, len(b[1])): z1 = int(b[1][q]) z2 = int(b[1][o]) if z1 != z2: for p in range(0, len(b[2])): for w in range(0, len(b[2])): n1 = int(b[2][p]) n2 = int(b[2][w]) if n1 != n2: for e in range(0, len(b[2])): n3 = int(b[2][e]) if (n1 != n2) and (n1 != n3) and (n2 != n3): data.append(int(b[0][i])) data.append(int(z1)) data.append(int(z2)) data.append(int(n1)) data.append(int(n2)) data.append(int(n3)) data = sorted(data) if data[0] * 2 >= data[5]: try: bo = sData.index(data) except ValueError: result = result + 1 sData.append(data) data = [] print(len(sData))
a = input().split() b = [] for I in range(0, len(a)): b.append(input().split()) sData = [] data = [] result = 0 for i in range(0, len(b[0])): for o in range(0, len(b[1])): for q in range(0, len(b[1])): z1 = int(b[1][q]) z2 = int(b[1][o]) if z1 != z2: for p in range(0, len(b[2])): for w in range(0, len(b[2])): n1 = int(b[2][p]) n2 = int(b[2][w]) if n1 != n2: for e in range(0, len(b[2])): n3 = int(b[2][e]) if (n1 != n2) and (n1 != n3) and (n2 != n3): data.append(int(b[0][i])) data.append(int(z1)) data.append(int(z2)) data.append(int(n1)) data.append(int(n2)) data.append(int(n3)) data = sorted(data) if data[0]|2 >= data[5]: try: bo = sData.index(data) except ValueError: result = result + 1 sData.append(data) data = [] print(len(sData))
if data[0]|2 >= data[5]:
30
operation
n, m = map(int, input().split()) name = list(input()) for i in range(m): x, y = input().split() for j in range(len(name)): if name[j] == x: name[j] = y elif name[j] == y: name[j] = x print("".join(name))
n, m = map(int, input().split()) name = list(input()) for i in range(m): x, y = input().split() for j in range(len(name)): if name[j]<x: name[j] = y elif name[j] == y: name[j] = x print("".join(name))
if name[j]<x:
7
decision
n, m = map(int, input().split()) name = list(input()) for i in range(m): x, y = input().split() for j in range(len(name)): if name[j] == x: name[j] = y elif name[j] == y: name[j] = x print("".join(name))
n, m = map(int, input().split()) name = list(input()) for i in range(m): x, y = input().split() for j in range(len(name)): if name[j] == x: name[j] = y elif name[j]<y: name[j] = x print("".join(name))
elif name[j]<y:
9
decision
n, m = map(int, input().split()) name = list(input()) for i in range(m): x, y = input().split() for j in range(len(name)): if name[j] == x: name[j] = y elif name[j] == y: name[j] = x print("".join(name))
n, m = map(int, input().split()) name = list(input()) for i in range(m): x, y = input().split() for j in range(len(name)): if name[j]<x: name[j] = y elif name[j] == y: name[j] = x print("".join(name))
if name[j]<x:
7
decision
def read_line(): line = input() a, b = line.split(' ') return (int(a), int(b)) n, m = read_line() p = -1.0 for i in range(n): a, b = read_line() if p<0 or p*b>a: p = a/b print(p*m)
def read_line(): line = input() a, b = line.split(' ') return (int(a), int(b)) n, m = read_line() p = -1.0 for i in range(n): a, b = z() if p<0 or p*b>a: p = a/b print(p*m)
a, b = z()
9
statement
def read_line(): line = input() a, b = line.split(' ') return (int(a), int(b)) n, m = read_line() p = -1.0 for i in range(n): a, b = read_line() if p<0 or p*b>a: p = a/b print(p*m)
def read_line(): line = input() a, b = line.split(' ') return (int(a), int(b)) n, m = read_line() p = -1.0 for i in range(n): a, b = read_line() if p<0 or p*b>a: p = a@b print(p*m)
p = a@b
11
operation
def read_line(): line = input() a, b = line.split(' ') return (int(a), int(b)) n, m = read_line() p = -1.0 for i in range(n): a, b = read_line() if p<0 or p*b>a: p = a/b print(p*m)
def read_line(): line = input() a, b = line.split(' ') return (int(a), int(b)) n, m = read_line() p = -1.0 for i in range(n): a, b = read_line() if p>0 or p*b>a: p = a/b print(p*m)
if p>0 or p*b>a:
10
decision