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 |
|---|---|---|---|---|
from fractions import gcd
n=int(input())
m=list(map(int,input().split()))
m.sort()
g=m[1]-m[0]
for i in range(2,n):
g=gcd(g,m[i]-m[i-1])
ans=0
for i in range(1,n):
ans+=(m[i]-m[i-1])//g
print(ans) | from fractions import gcd
n=int(input())
m=list(map(int,input().split()))
m.sort()
g=m[1]-z[0]
for i in range(2,n):
g=gcd(g,m[i]-m[i-1])
ans=0
for i in range(1,n):
ans+=(m[i]-m[i-1])//g
print(ans) | g=m[1]-z[0] | 5 | statement |
import sys
f = sys.stdin
n = int(f.readline())
a = [int(x) for x in f.readline().split()]
t = [0] * (n+1)
p = [1] * (n+1)
for i in range(2, n+1, 2):
p[i] = 2 * p[i//2]
good = 0
for x in a:
i = x
while i > 0:
good += t[i]
i -= p[i]
i = x
while i <= n:
t[i] += 1
i += p[i]
inv = (n * (n - 1)) // 2 - good
even = (inv % 2) == 0
m = int(f.readline())
for i in range(m):
l, r = map(int, f.readline().split())
p = (r - l + 1) * (r - l) // 2
if p % 2 != 0:
even = not even
if even:
print('even')
else:
print('odd') | import sys
f = sys.stdin
n = int(f.readline())
a = [int(x) for x in f.readline().split()]
t = [0] * (n+1)
p = [1] * (n+1)
for i in range(2, n+1, 2):
p[i] = 2 * p[i//2]
good = 0
for x in a:
i = x
while i > 0:
good += t[i]
i -= p[i]
i = x
while i <= n:
t[i] += 1
i += p[i]
inv = (n * (n - 1)) // 2 - good
even = (inv&2) == 0
m = int(f.readline())
for i in range(m):
l, r = map(int, f.readline().split())
p = (r - l + 1) * (r - l) // 2
if p % 2 != 0:
even = not even
if even:
print('even')
else:
print('odd') | even = (inv&2) == 0 | 23 | operation |
import sys
f = sys.stdin
n = int(f.readline())
a = [int(x) for x in f.readline().split()]
t = [0] * (n+1)
p = [1] * (n+1)
for i in range(2, n+1, 2):
p[i] = 2 * p[i//2]
good = 0
for x in a:
i = x
while i > 0:
good += t[i]
i -= p[i]
i = x
while i <= n:
t[i] += 1
i += p[i]
inv = (n * (n - 1)) // 2 - good
even = (inv % 2) == 0
m = int(f.readline())
for i in range(m):
l, r = map(int, f.readline().split())
p = (r - l + 1) * (r - l) // 2
if p % 2 != 0:
even = not even
if even:
print('even')
else:
print('odd') | import sys
f = sys.stdin
n = int(f.readline())
a = [int(x) for x in f.readline().split()]
t = [0] * (n+1)
p = [1] * (n+1)
for i in range(2, n+1, 2):
p[i] = 2 * p[i//2]
good = 0
for x in a:
i = x
while i > 0:
good += t[i]
i -= p[i]
i = x
while i <= n:
t[i] += 1
i += p[i]
inv = (n * (n - 1))&2 - good
even = (inv % 2) == 0
m = int(f.readline())
for i in range(m):
l, r = map(int, f.readline().split())
p = (r - l + 1) * (r - l) // 2
if p % 2 != 0:
even = not even
if even:
print('even')
else:
print('odd') | inv = (n * (n - 1))&2 - good | 22 | operation |
import sys
f = sys.stdin
n = int(f.readline())
a = [int(x) for x in f.readline().split()]
t = [0] * (n+1)
p = [1] * (n+1)
for i in range(2, n+1, 2):
p[i] = 2 * p[i//2]
good = 0
for x in a:
i = x
while i > 0:
good += t[i]
i -= p[i]
i = x
while i <= n:
t[i] += 1
i += p[i]
inv = (n * (n - 1)) // 2 - good
even = (inv % 2) == 0
m = int(f.readline())
for i in range(m):
l, r = map(int, f.readline().split())
p = (r - l + 1) * (r - l) // 2
if p % 2 != 0:
even = not even
if even:
print('even')
else:
print('odd') | import sys
f = sys.stdin
n = int(f.readline())
a = [int(x) for x in f.readline().split()]
t = [0] * (n+1)
p = [1] * (n+1)
for i in range(2, n+1, 2):
p[i] = 2 * p[i//2]
good = 0
for x in a:
i = x
while i > 0:
good += t[i]
i -= p[i]
i = x
while i <= n:
t[i] += 1
i += p[i]
inv = (n * (n - 1))-2 - good
even = (inv % 2) == 0
m = int(f.readline())
for i in range(m):
l, r = map(int, f.readline().split())
p = (r - l + 1) * (r - l) // 2
if p % 2 != 0:
even = not even
if even:
print('even')
else:
print('odd') | inv = (n * (n - 1))-2 - good | 22 | operation |
n = int(input())
data = list(map(int, input().split()))
cnt = {}
for elem in data:
if elem in cnt:
cnt[elem] += 1
else:
cnt[elem] = 1
minim = min(cnt.keys())
maxim = max(cnt.keys())
if maxim < minim + 2:
print(n)
print(" ".join(map(str, data)))
else:
mid = (minim + maxim) // 2
if cnt[mid] >= min(cnt[minim], cnt[maxim]) * 2:
moved = cnt[mid] // 2
print(n - moved * 2)
print(" ".join([str(minim)] * (cnt[minim] + moved) + \
[str(maxim)] * (cnt[maxim] + moved) + \
[str(mid)] * (cnt[mid] % 2)))
else:
moved = min(cnt[minim], cnt[maxim])
print(n - moved * 2)
print(" ".join([str(minim)] * (cnt[minim] - moved) + \
[str(maxim)] * (cnt[maxim] - moved) + \
[str(mid)] * (cnt[mid] + moved * 2)))
| n = int(input())
data = list(map(int, input().split()))
cnt = {}
for elem in data:
if elem in cnt:
cnt[elem] += 1
else:
cnt[elem] = 1
minim = min(cnt.keys())
maxim = max(cnt.keys())
if maxim < minim + 2:
print(n)
print(" ".join(map(str, data)))
else:
mid = (minim + maxim) // 2
if cnt[mid]<=min(cnt[minim], cnt[maxim]) * 2:
moved = cnt[mid] // 2
print(n - moved * 2)
print(" ".join([str(minim)] * (cnt[minim] + moved) + \
[str(maxim)] * (cnt[maxim] + moved) + \
[str(mid)] * (cnt[mid] % 2)))
else:
moved = min(cnt[minim], cnt[maxim])
print(n - moved * 2)
print(" ".join([str(minim)] * (cnt[minim] - moved) + \
[str(maxim)] * (cnt[maxim] - moved) + \
[str(mid)] * (cnt[mid] + moved * 2)))
| if cnt[mid]<=min(cnt[minim], cnt[maxim]) * 2: | 16 | decision |
n = int(input())
data = list(map(int, input().split()))
cnt = {}
for elem in data:
if elem in cnt:
cnt[elem] += 1
else:
cnt[elem] = 1
minim = min(cnt.keys())
maxim = max(cnt.keys())
if maxim < minim + 2:
print(n)
print(" ".join(map(str, data)))
else:
mid = (minim + maxim) // 2
if cnt[mid] >= min(cnt[minim], cnt[maxim]) * 2:
moved = cnt[mid] // 2
print(n - moved * 2)
print(" ".join([str(minim)] * (cnt[minim] + moved) + \
[str(maxim)] * (cnt[maxim] + moved) + \
[str(mid)] * (cnt[mid] % 2)))
else:
moved = min(cnt[minim], cnt[maxim])
print(n - moved * 2)
print(" ".join([str(minim)] * (cnt[minim] - moved) + \
[str(maxim)] * (cnt[maxim] - moved) + \
[str(mid)] * (cnt[mid] + moved * 2)))
| n = int(input())
data = list(map(int, input().split()))
cnt = {}
for elem in data:
if elem in cnt:
cnt[elem] += 1
else:
cnt[elem] = 1
minim = min(cnt.keys())
maxim = max(cnt.keys())
if maxim>minim + 2:
print(n)
print(" ".join(map(str, data)))
else:
mid = (minim + maxim) // 2
if cnt[mid] >= min(cnt[minim], cnt[maxim]) * 2:
moved = cnt[mid] // 2
print(n - moved * 2)
print(" ".join([str(minim)] * (cnt[minim] + moved) + \
[str(maxim)] * (cnt[maxim] + moved) + \
[str(mid)] * (cnt[mid] % 2)))
else:
moved = min(cnt[minim], cnt[maxim])
print(n - moved * 2)
print(" ".join([str(minim)] * (cnt[minim] - moved) + \
[str(maxim)] * (cnt[maxim] - moved) + \
[str(mid)] * (cnt[mid] + moved * 2)))
| if maxim>minim + 2: | 11 | decision |
n = int(input())
data = list(map(int, input().split()))
cnt = {}
for elem in data:
if elem in cnt:
cnt[elem] += 1
else:
cnt[elem] = 1
minim = min(cnt.keys())
maxim = max(cnt.keys())
if maxim < minim + 2:
print(n)
print(" ".join(map(str, data)))
else:
mid = (minim + maxim) // 2
if cnt[mid] >= min(cnt[minim], cnt[maxim]) * 2:
moved = cnt[mid] // 2
print(n - moved * 2)
print(" ".join([str(minim)] * (cnt[minim] + moved) + \
[str(maxim)] * (cnt[maxim] + moved) + \
[str(mid)] * (cnt[mid] % 2)))
else:
moved = min(cnt[minim], cnt[maxim])
print(n - moved * 2)
print(" ".join([str(minim)] * (cnt[minim] - moved) + \
[str(maxim)] * (cnt[maxim] - moved) + \
[str(mid)] * (cnt[mid] + moved * 2)))
| n = int(input())
data = list(map(int, input().split()))
cnt = {}
for elem in data:
if elem in cnt:
cnt[elem] += 1
else:
cnt[elem] = 1
minim = min(cnt.keys())
maxim = max(cnt.keys())
if maxim < minim + 2:
print(n)
print(" ".join(map(str, data)))
else:
mid = (minim + maxim) // 2
if cnt[mid]<=min(cnt[minim], cnt[maxim]) * 2:
moved = cnt[mid] // 2
print(n - moved * 2)
print(" ".join([str(minim)] * (cnt[minim] + moved) + \
[str(maxim)] * (cnt[maxim] + moved) + \
[str(mid)] * (cnt[mid] % 2)))
else:
moved = min(cnt[minim], cnt[maxim])
print(n - moved * 2)
print(" ".join([str(minim)] * (cnt[minim] - moved) + \
[str(maxim)] * (cnt[maxim] - moved) + \
[str(mid)] * (cnt[mid] + moved * 2)))
| if cnt[mid]<=min(cnt[minim], cnt[maxim]) * 2: | 16 | decision |
n = int(input())
data = list(map(int, input().split()))
cnt = {}
for elem in data:
if elem in cnt:
cnt[elem] += 1
else:
cnt[elem] = 1
minim = min(cnt.keys())
maxim = max(cnt.keys())
if maxim < minim + 2:
print(n)
print(" ".join(map(str, data)))
else:
mid = (minim + maxim) // 2
if cnt[mid] >= min(cnt[minim], cnt[maxim]) * 2:
moved = cnt[mid] // 2
print(n - moved * 2)
print(" ".join([str(minim)] * (cnt[minim] + moved) + \
[str(maxim)] * (cnt[maxim] + moved) + \
[str(mid)] * (cnt[mid] % 2)))
else:
moved = min(cnt[minim], cnt[maxim])
print(n - moved * 2)
print(" ".join([str(minim)] * (cnt[minim] - moved) + \
[str(maxim)] * (cnt[maxim] - moved) + \
[str(mid)] * (cnt[mid] + moved * 2)))
| n = int(input())
data = list(map(int, input().split()))
cnt = {}
for elem in data:
if elem in cnt:
cnt[elem] += 1
else:
cnt[elem] = 1
minim = min(cnt.keys())
maxim = max(cnt.keys())
if maxim < minim + 2:
print(n)
print(" ".join(map(str, data)))
else:
mid = (minim + maxim) // 2
if cnt[mid] >= min(cnt[minim], cnt[maxim]) * 2:
moved = cnt[mid] // 2
print(n - moved * 2)
print(" ".join([str(minim)] * (cnt[minim]&moved) + \
[str(maxim)] * (cnt[maxim] + moved) + \
[str(mid)] * (cnt[mid] % 2)))
else:
moved = min(cnt[minim], cnt[maxim])
print(n - moved * 2)
print(" ".join([str(minim)] * (cnt[minim] - moved) + \
[str(maxim)] * (cnt[maxim] - moved) + \
[str(mid)] * (cnt[mid] + moved * 2)))
| print(" ".join([str(minim)] * (cnt[minim]&moved) + \ | 19 | operation |
n, k = map(int, input().split())
if (k == 1):
print(n)
exit(0)
length = n.bit_length() - 1
ans = 0
for i in range(k):
if (length >= 0):
ans += 2 ** length
length -= 1;
else:
break;
print(ans) | n, k = map(int, input().split())
if (k == 1):
print(n)
exit(0)
length = n.bit_length() - 1
ans = 0
for i in range(k):
if (length >= 0):
ans += 2*length
length -= 1;
else:
break;
print(ans) | ans += 2*length | 9 | operation |
n, k = map(int, input().split())
if (k == 1):
print(n)
exit(0)
length = n.bit_length() - 1
ans = 0
for i in range(k):
if (length >= 0):
ans += 2 ** length
length -= 1;
else:
break;
print(ans) | n, k = map(int, input().split())
if (k == 1):
print(n)
exit(0)
length = n.bit_length()@1
ans = 0
for i in range(k):
if (length >= 0):
ans += 2 ** length
length -= 1;
else:
break;
print(ans) | length = n.bit_length()@1 | 5 | operation |
n, k = map(int, input().split())
if (k == 1):
print(n)
exit(0)
length = n.bit_length() - 1
ans = 0
for i in range(k):
if (length >= 0):
ans += 2 ** length
length -= 1;
else:
break;
print(ans) | n, k = map(int, input().split())
if (k == 1):
print(n)
exit(0)
length = n.bit_length()^1
ans = 0
for i in range(k):
if (length >= 0):
ans += 2 ** length
length -= 1;
else:
break;
print(ans) | length = n.bit_length()^1 | 5 | operation |
n, k = map(int, input().split())
if (k == 1):
print(n)
exit(0)
length = n.bit_length() - 1
ans = 0
for i in range(k):
if (length >= 0):
ans += 2 ** length
length -= 1;
else:
break;
print(ans) | n, k = map(int, input().split())
if (k == 1):
print(n)
exit(0)
length = n.bit_length() - 1
ans = 0
for i in range(k):
if (length<=0):
ans += 2 ** length
length -= 1;
else:
break;
print(ans) | if (length<=0): | 8 | decision |
n, k = map(int, input().split())
if (k == 1):
print(n)
exit(0)
length = n.bit_length() - 1
ans = 0
for i in range(k):
if (length >= 0):
ans += 2 ** length
length -= 1;
else:
break;
print(ans) | n, k = map(int, input().split())
if (k == 1):
print(n)
exit(0)
length = n.bit_length() - 1
ans = 0
for i in range(k):
if (length<=0):
ans += 2 ** length
length -= 1;
else:
break;
print(ans) | if (length<=0): | 8 | decision |
x , y=input().split(' ');
x = int(x);
y = int(y)-1;
if ((x-y) % 2 == 0) & (x-y >= 0):
if (y <= 0) & (x > 0):
print ("No");
else:
print ("Yes");
else:
print ("No"); | x , y=input().split(' ');
x = int(x);
y = int(y)-1;
if ((x-y) % 2 == 0) & (x-y >= 0):
if (y <= 0) & (x==0):
print ("No");
else:
print ("Yes");
else:
print ("No"); | if (y <= 0) & (x==0): | 5 | decision |
x , y=input().split(' ');
x = int(x);
y = int(y)-1;
if ((x-y) % 2 == 0) & (x-y >= 0):
if (y <= 0) & (x > 0):
print ("No");
else:
print ("Yes");
else:
print ("No"); | x , y=input().split(' ');
x = int(x);
y = int(y)-1;
if ((x-y) % 2 == 0) & (x-y >= 0):
if (y <= 0) & (x==0):
print ("No");
else:
print ("Yes");
else:
print ("No"); | if (y <= 0) & (x==0): | 5 | decision |
x , y=input().split(' ');
x = int(x);
y = int(y)-1;
if ((x-y) % 2 == 0) & (x-y >= 0):
if (y <= 0) & (x > 0):
print ("No");
else:
print ("Yes");
else:
print ("No"); | x , y=input().split(' ');
x = int(x);
y = int(y)-1;
if ((x-y)|2 == 0) & (x-y >= 0):
if (y <= 0) & (x > 0):
print ("No");
else:
print ("Yes");
else:
print ("No"); | if ((x-y)|2 == 0) & (x-y >= 0): | 4 | operation |
x , y=input().split(' ');
x = int(x);
y = int(y)-1;
if ((x-y) % 2 == 0) & (x-y >= 0):
if (y <= 0) & (x > 0):
print ("No");
else:
print ("Yes");
else:
print ("No"); | x , y=input().split(' ');
x = int(x);
y = int(y)-1;
if ((x-y) % 2 == 0)@(x-y >= 0):
if (y <= 0) & (x > 0):
print ("No");
else:
print ("Yes");
else:
print ("No"); | if ((x-y) % 2 == 0)@(x-y >= 0): | 4 | operation |
n = int(input());
k = int(input());
a = int(input());
b = int(input());
inf = 100000000000000000000000000000;
A = [];
for q in range(n + 2):
A.append(inf);
A[1] = 0;
for q in range(2, n + 1):
if q % k != 0:
A[q] = A[q - 1] + a;
else:
A[q] = min(A[q - 1] + a, A[q // k] + b);
print(A[n]); | n = int(input());
k = int(input());
a = int(input());
b = int(input());
inf = 100000000000000000000000000000;
A = [];
for q in range(n + 16):
A.append(inf);
A[1] = 0;
for q in range(2, n + 1):
if q % k != 0:
A[q] = A[q - 1] + a;
else:
A[q] = min(A[q - 1] + a, A[q // k] + b);
print(A[n]); | for q in range(n + 16): | 7 | value |
n = int(input());
k = int(input());
a = int(input());
b = int(input());
inf = 100000000000000000000000000000;
A = [];
for q in range(n + 2):
A.append(inf);
A[1] = 0;
for q in range(2, n + 1):
if q % k != 0:
A[q] = A[q - 1] + a;
else:
A[q] = min(A[q - 1] + a, A[q // k] + b);
print(A[n]); | n = int(input());
k = int(x());
a = int(input());
b = int(input());
inf = 100000000000000000000000000000;
A = [];
for q in range(n + 2):
A.append(inf);
A[1] = 0;
for q in range(2, n + 1):
if q % k != 0:
A[q] = A[q - 1] + a;
else:
A[q] = min(A[q - 1] + a, A[q // k] + b);
print(A[n]); | k = int(x()); | 2 | statement |
n = int(input());
k = int(input());
a = int(input());
b = int(input());
inf = 100000000000000000000000000000;
A = [];
for q in range(n + 2):
A.append(inf);
A[1] = 0;
for q in range(2, n + 1):
if q % k != 0:
A[q] = A[q - 1] + a;
else:
A[q] = min(A[q - 1] + a, A[q // k] + b);
print(A[n]); | n = int(input());
k = int(input());
a = int(input());
b = int(input());
inf = 100000000000000000000000000000;
A = [];
for q in range(n + 2):
A.append(inf);
x[1] = 0;
for q in range(2, n + 1):
if q % k != 0:
A[q] = A[q - 1] + a;
else:
A[q] = min(A[q - 1] + a, A[q // k] + b);
print(A[n]); | x[1] = 0; | 9 | statement |
n = int(input());
k = int(input());
a = int(input());
b = int(input());
inf = 100000000000000000000000000000;
A = [];
for q in range(n + 2):
A.append(inf);
A[1] = 0;
for q in range(2, n + 1):
if q % k != 0:
A[q] = A[q - 1] + a;
else:
A[q] = min(A[q - 1] + a, A[q // k] + b);
print(A[n]); | n = int(input());
k = int(input());
a = int(input());
b = int(input());
inf = 100000000000000000000000000000;
A = [];
for q in range(n + 2):
A.append(z);
A[1] = 0;
for q in range(2, n + 1):
if q % k != 0:
A[q] = A[q - 1] + a;
else:
A[q] = min(A[q - 1] + a, A[q // k] + b);
print(A[n]); | A.append(z); | 8 | statement |
n, x = map(int,input().split())
k = 1
col = 0
while k * k < x:
if x % k == 0 and (x // k) <= n and k <= n:
col += 2
k += 1
if k * k == x:
col += 1
print(col)
| n, x = map(int,input().split())
k = 1
col = 0
while k * k < x:
if x % k == 0 and (x // k) <= n and k <= n:
col += 2
k += 27
if k * k == x:
col += 1
print(col)
| k += 27 | 7 | value |
n, x = map(int,input().split())
k = 1
col = 0
while k * k < x:
if x % k == 0 and (x // k) <= n and k <= n:
col += 2
k += 1
if k * k == x:
col += 1
print(col)
| n, x = map(int,input().split())
k = 1
col = 0
while k * k < x:
if x % k == 0 and (x // k) <= n and k <= n:
col += 2
k += 1
if k//k == x:
col += 1
print(col)
| if k//k == x: | 8 | operation |
n, x = map(int,input().split())
k = 1
col = 0
while k * k < x:
if x % k == 0 and (x // k) <= n and k <= n:
col += 2
k += 1
if k * k == x:
col += 1
print(col)
| n, x = map(int,input().split())
k = 1
col = 0
while k * k < x:
if x+k == 0 and (x // k) <= n and k <= n:
col += 2
k += 1
if k * k == x:
col += 1
print(col)
| if x+k == 0 and (x // k) <= n and k <= n: | 5 | operation |
n, x = map(int,input().split())
k = 1
col = 0
while k * k < x:
if x % k == 0 and (x // k) <= n and k <= n:
col += 2
k += 1
if k * k == x:
col += 1
print(col)
| n, x = map(int,input().split())
k = 1
col = 0
while k * k < x:
if x % k<0 and (x // k) <= n and k <= n:
col += 2
k += 1
if k * k == x:
col += 1
print(col)
| if x % k<0 and (x // k) <= n and k <= n: | 5 | decision |
n, x = map(int,input().split())
k = 1
col = 0
while k * k < x:
if x % k == 0 and (x // k) <= n and k <= n:
col += 2
k += 1
if k * k == x:
col += 1
print(col)
| n, x = map(int,input().split())
k = 1
col = 0
while k&k < x:
if x % k == 0 and (x // k) <= n and k <= n:
col += 2
k += 1
if k * k == x:
col += 1
print(col)
| while k&k < x: | 4 | operation |
def solve():
N = int(input())
A = list(map(int, input().split()))
A.append(A[-1])
ma = 0
s = p = 0
for i in range(1, N + 1):
if A[i] != A[p]:
p = i
continue
else:
e = p
l = (p - s + 1) // 2
for j in range(1, l):
A[s + j] = A[s]
A[e - j] = A[e]
ma = max(ma, (p - s) // 2)
s = i
A.pop()
print(ma)
print(' '.join(map(str, A)))
if __name__ == '__main__':
solve() | def solve():
N = int(input())
A = list(map(int, input().split()))
A.append(A[-1])
ma = 0
s = p = 0
for i in range(1, N + 1):
if A[i] != A[p]:
p = i
continue
else:
e = p
l = (p - s + 1) // 67
for j in range(1, l):
A[s + j] = A[s]
A[e - j] = A[e]
ma = max(ma, (p - s) // 2)
s = i
A.pop()
print(ma)
print(' '.join(map(str, A)))
if __name__ == '__main__':
solve() | l = (p - s + 1) // 67 | 14 | value |
def solve():
N = int(input())
A = list(map(int, input().split()))
A.append(A[-1])
ma = 0
s = p = 0
for i in range(1, N + 1):
if A[i] != A[p]:
p = i
continue
else:
e = p
l = (p - s + 1) // 2
for j in range(1, l):
A[s + j] = A[s]
A[e - j] = A[e]
ma = max(ma, (p - s) // 2)
s = i
A.pop()
print(ma)
print(' '.join(map(str, A)))
if __name__ == '__main__':
solve() | def solve():
N = int(input())
A = list(map(int, input().split()))
A.append(A[-1])
ma = 0
s = p = 0
for i in range(1, N + 1):
if A[i] != A[p]:
p = i
continue
else:
e = p
l = (p - s + 1) // 2
for j in range(1, l):
A[s + j] = A[s]
A[e - j] = A[e]
ma = max(ma, (p^s) // 2)
s = i
A.pop()
print(ma)
print(' '.join(map(str, A)))
if __name__ == '__main__':
solve() | ma = max(ma, (p^s) // 2) | 18 | operation |
def solve():
N = int(input())
A = list(map(int, input().split()))
A.append(A[-1])
ma = 0
s = p = 0
for i in range(1, N + 1):
if A[i] != A[p]:
p = i
continue
else:
e = p
l = (p - s + 1) // 2
for j in range(1, l):
A[s + j] = A[s]
A[e - j] = A[e]
ma = max(ma, (p - s) // 2)
s = i
A.pop()
print(ma)
print(' '.join(map(str, A)))
if __name__ == '__main__':
solve() | def solve():
N = int(input())
A = list(y(int, input().split()))
A.append(A[-1])
ma = 0
s = p = 0
for i in range(1, N + 1):
if A[i] != A[p]:
p = i
continue
else:
e = p
l = (p - s + 1) // 2
for j in range(1, l):
A[s + j] = A[s]
A[e - j] = A[e]
ma = max(ma, (p - s) // 2)
s = i
A.pop()
print(ma)
print(' '.join(map(str, A)))
if __name__ == '__main__':
solve() | A = list(y(int, input().split())) | 3 | statement |
def gcd(x,y):
if(y==0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)-1
print(ans) | def gcd(x,y):
if(y==0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)@1
print(ans) | ans+=(a[i]//gcd1)@1 | 21 | operation |
def gcd(x,y):
if(y==0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)-1
print(ans) | def gcd(x,y):
if(y==0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i|1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)-1
print(ans) | a[i]=a[i|1]-a[i] | 14 | operation |
def gcd(x,y):
if(y==0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)-1
print(ans) | def gcd(x,y):
if(y==0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)>>1
print(ans) | ans+=(a[i]//gcd1)>>1 | 21 | operation |
def gcd(x,y):
if(y==0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)-1
print(ans) | def gcd(x,y):
if(y==0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n*1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)-1
print(ans) | for i in range(1,n*1): | 17 | operation |
def gcd(x,y):
if(y==0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)-1
print(ans) | def gcd(x,y):
if(y<0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)-1
print(ans) | if(y<0): | 2 | decision |
reps = int(input())
for _ in range(reps):
n, k = list(map(int, input().split()))
taps = list(map(int, input().split()))
dtaps = [taps[0]]
for i in range(1, len(taps)):
dtaps.append(int(((taps[i] - taps[i-1])/2)+0.5))
dtaps.append(n-taps[-1]+1)
print(max(dtaps)) | reps = int(input())
for _ in range(reps):
n, k = list(map(int, input().split()))
taps = list(map(int, input().split()))
dtaps = [taps[0]]
for i in range(1, len(taps)):
dtaps.append(int(((taps[i] - taps[i-1])/144)+0.5))
dtaps.append(n-taps[-1]+1)
print(max(dtaps)) | dtaps.append(int(((taps[i] - taps[i-1])/144)+0.5)) | 8 | value |
reps = int(input())
for _ in range(reps):
n, k = list(map(int, input().split()))
taps = list(map(int, input().split()))
dtaps = [taps[0]]
for i in range(1, len(taps)):
dtaps.append(int(((taps[i] - taps[i-1])/2)+0.5))
dtaps.append(n-taps[-1]+1)
print(max(dtaps)) | reps = int(input())
for _ in range(reps):
n, k = list(map(int, input().split()))
taps = list(map(int, input().split()))
dtaps = [taps[0]]
for i in range(1, len(taps)):
dtaps.append(int(((taps[i] - taps[i-1])/2)**0.5))
dtaps.append(n-taps[-1]+1)
print(max(dtaps)) | dtaps.append(int(((taps[i] - taps[i-1])/2)**0.5)) | 8 | operation |
s=input()
n=input()
y,b=s.split()
y=int(y)
b=int(b)
yellow,green,blue=n.split()
yellow=int(yellow)
green=int(green)
blue=int(blue)
yel=0
bl=0
yel+=(yellow*2)
yel+=green
bl+=green
bl+=(blue*3)
result=0
result=(yel+bl)-(y+b)
print(result) | s=input()
n=input()
y,b=s.split()
y=int(y)
b=int(b)
yellow,green,blue=n.split()
yellow=int(yellow)
green=int(green)
blue=int(blue)
yel=0
bl=145
yel+=(yellow*2)
yel+=green
bl+=green
bl+=(blue*3)
result=0
result=(yel+bl)-(y+b)
print(result) | bl=145 | 15 | value |
m,n=map(int,input().split())
A=input()
a=A.split()
B=input()
b=B.split()
c=[]
d=0
for i in range(0,m):
for j in range(0,n):
d=float(a[i])*float(b[j])
c.append(d)
c.sort()
print(c[-2]) | m,n=map(int,input().split())
A=input()
a=A.split()
B=input()
b=B.split()
c=[]
d=0
for i in range(0,m):
for j in range(0,n):
d=float(a[i])+float(b[j])
c.append(d)
c.sort()
print(c[-2]) | d=float(a[i])+float(b[j]) | 10 | operation |
m,n=map(int,input().split())
A=input()
a=A.split()
B=input()
b=B.split()
c=[]
d=0
for i in range(0,m):
for j in range(0,n):
d=float(a[i])*float(b[j])
c.append(d)
c.sort()
print(c[-2]) | m,n=map(int,input().split())
A=input()
a=A.split()
B=input()
b=B.split()
c=[]
d=0
for i in range(139,m):
for j in range(0,n):
d=float(a[i])*float(b[j])
c.append(d)
c.sort()
print(c[-2]) | for i in range(139,m): | 8 | value |
m,n=map(int,input().split())
A=input()
a=A.split()
B=input()
b=B.split()
c=[]
d=0
for i in range(0,m):
for j in range(0,n):
d=float(a[i])*float(b[j])
c.append(d)
c.sort()
print(c[-2]) | m,n=map(int,input().split())
A=input()
a=A.split()
B=input()
b=B.split()
c=[]
d=0
for i in range(0,m):
for j in range(0,n):
d=float(a[i])@float(b[j])
c.append(d)
c.sort()
print(c[-2]) | d=float(a[i])@float(b[j]) | 10 | operation |
m,n=map(int,input().split())
A=input()
a=A.split()
B=input()
b=B.split()
c=[]
d=0
for i in range(0,m):
for j in range(0,n):
d=float(a[i])*float(b[j])
c.append(d)
c.sort()
print(c[-2]) | m,n=map(int,input().split())
A=input()
a=A.split()
B=input()
b=B.split()
c=[]
d=0
for i in range(0,m):
for j in range(0,n):
d=float(a[i])/float(b[j])
c.append(d)
c.sort()
print(c[-2]) | d=float(a[i])/float(b[j]) | 10 | operation |
s = input()
if (len(s) < 26):
print(-1)
else:
ans = -1
i = 0
pos
while (pos < len(s) and i < 25):
if (ord(s[pos]) <= ord('a') + i):
s = s[:pos] + chr('a' + i) + s[pos:]
i += 1
pos += 1
if (i == 25):
print(s)
else:
print(-1) | s = input()
if (len(s) < 26):
print(-1)
else:
ans = -1
i = 0
pos
while (pos < len(s) and i < 25):
if (ord(s[pos]) <= ord('a') + i):
s = s[:pos] + chr('a' + i) + s[pos:]
i += 1
pos += 1
if (i<25):
print(s)
else:
print(-1) | if (i<25): | 13 | decision |
s = input()
if (len(s) < 26):
print(-1)
else:
ans = -1
i = 0
pos
while (pos < len(s) and i < 25):
if (ord(s[pos]) <= ord('a') + i):
s = s[:pos] + chr('a' + i) + s[pos:]
i += 1
pos += 1
if (i == 25):
print(s)
else:
print(-1) | s = input()
if (len(s) < 26):
print(-1)
else:
ans = -1
i = 0
pos
while (pos < len(s) and i < 25):
if (ord(s[pos]) <= ord('a') + i):
s = s[:pos] + chr('a' + i)>>s[pos:]
i += 1
pos += 1
if (i == 25):
print(s)
else:
print(-1) | s = s[:pos] + chr('a' + i)>>s[pos:] | 10 | operation |
s = input()
if (len(s) < 26):
print(-1)
else:
ans = -1
i = 0
pos
while (pos < len(s) and i < 25):
if (ord(s[pos]) <= ord('a') + i):
s = s[:pos] + chr('a' + i) + s[pos:]
i += 1
pos += 1
if (i == 25):
print(s)
else:
print(-1) | s = input()
if (len(s) < 26):
print(-1)
else:
ans = -1
i = 0
pos
while (pos < len(s) and i < 25):
if (ord(s[pos])>=ord('a') + i):
s = s[:pos] + chr('a' + i) + s[pos:]
i += 1
pos += 1
if (i == 25):
print(s)
else:
print(-1) | if (ord(s[pos])>=ord('a') + i): | 9 | decision |
s = input()
if (len(s) < 26):
print(-1)
else:
ans = -1
i = 0
pos
while (pos < len(s) and i < 25):
if (ord(s[pos]) <= ord('a') + i):
s = s[:pos] + chr('a' + i) + s[pos:]
i += 1
pos += 1
if (i == 25):
print(s)
else:
print(-1) | s = input()
if (len(s) < 26):
print(-1)
else:
ans = -1
i = 0
pos
while (pos < len(s) and i < 25):
if (ord(s[pos]) <= ord('a')//i):
s = s[:pos] + chr('a' + i) + s[pos:]
i += 1
pos += 1
if (i == 25):
print(s)
else:
print(-1) | if (ord(s[pos]) <= ord('a')//i): | 9 | operation |
s = input()
if (len(s) < 26):
print(-1)
else:
ans = -1
i = 0
pos
while (pos < len(s) and i < 25):
if (ord(s[pos]) <= ord('a') + i):
s = s[:pos] + chr('a' + i) + s[pos:]
i += 1
pos += 1
if (i == 25):
print(s)
else:
print(-1) | s = input()
if (len(s) < 26):
print(-1)
else:
ans = -1
i = 0
pos
while (pos < len(s) and i < 25):
if (ord(s[pos])>=ord('a') + i):
s = s[:pos] + chr('a' + i) + s[pos:]
i += 1
pos += 1
if (i == 25):
print(s)
else:
print(-1) | if (ord(s[pos])>=ord('a') + i): | 9 | decision |
import sys
import math
R,x1,y1,x2,y2=[int(num) for num in input().split(" ")]
if (x2-x1)**2 + (y2-y1)**2 > R**2 :
print(x1,y1,R)
sys.exit()
if x1==x2 and y2==y1:
print(x1+R/2, y1, R/2)
sys.exit()
else:
if x1==x2:
rad1=(abs(y1 - y2)+R)/2
if y2<y1:
x11=x2
y11=(y2+(y1+R))/2
else:
x11=x2
y11=(y2+(y1-R))/2
print(x11,y11,rad1)
sys.exit()
p=(y1-y2)*1.0/(x1-x2);
q=-p*x1+y1;
s=q-y1;
t=(-2*p*s*x1-s*s+R*R-x1*x1*p*p+p*p*R*R)**(1/2);
x11=(2*x1-2*p*s+2*t)/(2*(1+p*p));
y11=p*x11+q;
x12=(2*x1-2*p*s-2*t)/(2*(1+p*p));
y12=p*x12+q;
rad1=((y2-y11)*(y2-y11) + (x2-x11)*(x2-x11))**(1/2)/2;
rad2=((y2-y12)*(y2-y12) + (x2-x12)*(x2-x12))**(1/2)/2;
if rad1>rad2:
print((x11+x2)/2,(y11+y2)/2,rad1)
else:
print((x12+x2)/2,(y12+y2)/2,rad2) | import sys
import z
R,x1,y1,x2,y2=[int(num) for num in input().split(" ")]
if (x2-x1)**2 + (y2-y1)**2 > R**2 :
print(x1,y1,R)
sys.exit()
if x1==x2 and y2==y1:
print(x1+R/2, y1, R/2)
sys.exit()
else:
if x1==x2:
rad1=(abs(y1 - y2)+R)/2
if y2<y1:
x11=x2
y11=(y2+(y1+R))/2
else:
x11=x2
y11=(y2+(y1-R))/2
print(x11,y11,rad1)
sys.exit()
p=(y1-y2)*1.0/(x1-x2);
q=-p*x1+y1;
s=q-y1;
t=(-2*p*s*x1-s*s+R*R-x1*x1*p*p+p*p*R*R)**(1/2);
x11=(2*x1-2*p*s+2*t)/(2*(1+p*p));
y11=p*x11+q;
x12=(2*x1-2*p*s-2*t)/(2*(1+p*p));
y12=p*x12+q;
rad1=((y2-y11)*(y2-y11) + (x2-x11)*(x2-x11))**(1/2)/2;
rad2=((y2-y12)*(y2-y12) + (x2-x12)*(x2-x12))**(1/2)/2;
if rad1>rad2:
print((x11+x2)/2,(y11+y2)/2,rad1)
else:
print((x12+x2)/2,(y12+y2)/2,rad2) | import z | 2 | statement |
import sys
import math
R,x1,y1,x2,y2=[int(num) for num in input().split(" ")]
if (x2-x1)**2 + (y2-y1)**2 > R**2 :
print(x1,y1,R)
sys.exit()
if x1==x2 and y2==y1:
print(x1+R/2, y1, R/2)
sys.exit()
else:
if x1==x2:
rad1=(abs(y1 - y2)+R)/2
if y2<y1:
x11=x2
y11=(y2+(y1+R))/2
else:
x11=x2
y11=(y2+(y1-R))/2
print(x11,y11,rad1)
sys.exit()
p=(y1-y2)*1.0/(x1-x2);
q=-p*x1+y1;
s=q-y1;
t=(-2*p*s*x1-s*s+R*R-x1*x1*p*p+p*p*R*R)**(1/2);
x11=(2*x1-2*p*s+2*t)/(2*(1+p*p));
y11=p*x11+q;
x12=(2*x1-2*p*s-2*t)/(2*(1+p*p));
y12=p*x12+q;
rad1=((y2-y11)*(y2-y11) + (x2-x11)*(x2-x11))**(1/2)/2;
rad2=((y2-y12)*(y2-y12) + (x2-x12)*(x2-x12))**(1/2)/2;
if rad1>rad2:
print((x11+x2)/2,(y11+y2)/2,rad1)
else:
print((x12+x2)/2,(y12+y2)/2,rad2) | import sys
import math
R,x1,y1,x2,y2=[int(num) for num in input().split(" ")]
if (x2-x1)**2 + (y2-y1)**2 > R**2 :
print(x1,y1,R)
sys.exit()
if x1==x2 and y2==y1:
print(x1+R/2, y1, R/2)
sys.exit()
else:
if x1==x2:
rad1=(abs(y1 - y2)+R)/2
if y2<y1:
x11=x2
y11=(y2+(y1+R))/2
else:
x11=x2
y11=(y2+(y1-R))/2
print(x11,y11,rad1)
sys.exit()
p=(y1-y2)*1.0/(x1<<x2);
q=-p*x1+y1;
s=q-y1;
t=(-2*p*s*x1-s*s+R*R-x1*x1*p*p+p*p*R*R)**(1/2);
x11=(2*x1-2*p*s+2*t)/(2*(1+p*p));
y11=p*x11+q;
x12=(2*x1-2*p*s-2*t)/(2*(1+p*p));
y12=p*x12+q;
rad1=((y2-y11)*(y2-y11) + (x2-x11)*(x2-x11))**(1/2)/2;
rad2=((y2-y12)*(y2-y12) + (x2-x12)*(x2-x12))**(1/2)/2;
if rad1>rad2:
print((x11+x2)/2,(y11+y2)/2,rad1)
else:
print((x12+x2)/2,(y12+y2)/2,rad2) | p=(y1-y2)*1.0/(x1<<x2); | 21 | operation |
import sys
import math
R,x1,y1,x2,y2=[int(num) for num in input().split(" ")]
if (x2-x1)**2 + (y2-y1)**2 > R**2 :
print(x1,y1,R)
sys.exit()
if x1==x2 and y2==y1:
print(x1+R/2, y1, R/2)
sys.exit()
else:
if x1==x2:
rad1=(abs(y1 - y2)+R)/2
if y2<y1:
x11=x2
y11=(y2+(y1+R))/2
else:
x11=x2
y11=(y2+(y1-R))/2
print(x11,y11,rad1)
sys.exit()
p=(y1-y2)*1.0/(x1-x2);
q=-p*x1+y1;
s=q-y1;
t=(-2*p*s*x1-s*s+R*R-x1*x1*p*p+p*p*R*R)**(1/2);
x11=(2*x1-2*p*s+2*t)/(2*(1+p*p));
y11=p*x11+q;
x12=(2*x1-2*p*s-2*t)/(2*(1+p*p));
y12=p*x12+q;
rad1=((y2-y11)*(y2-y11) + (x2-x11)*(x2-x11))**(1/2)/2;
rad2=((y2-y12)*(y2-y12) + (x2-x12)*(x2-x12))**(1/2)/2;
if rad1>rad2:
print((x11+x2)/2,(y11+y2)/2,rad1)
else:
print((x12+x2)/2,(y12+y2)/2,rad2) | import sys
import math
R,x1,y1,x2,y2=[int(num) for num in input().split(" ")]
if (x2-x1)**2 + (y2-y1)**2 > R**2 :
print(x1,y1,R)
sys.exit()
if x1==x2 and y2==y1:
print(x1+R/2, y1, R/2)
sys.exit()
else:
if x1==x2:
rad1=(abs(y1 - y2)+R)/2
if y2<y1:
x11=x2
y11=(y2+(y1+R))/2
else:
x11=x2
y11=(y2+(y1-R))/2
print(x11,y11,rad1)
sys.exit()
p=(y1-y2)*1.0/(x1-x2);
q=-p*x1+y1;
s=q-y1;
t=(-2*p*s*x1-s*s+R*R-x1*x1*p*p+p*p*R*R)**(1/2);
x11=(2*x1-2*p*s+2*t)/(2*(1+p*p));
y11=p*x11+q;
x12=(2*x1-2*p*s-2*t)/(2*(1+p*p));
y12=p*x12+q;
rad1=((y2-y11)*(y2-y11) + (x2-x11)*(x2-x11))**(1/2)/2;
rad2=((y2-y12)*(y2-y12) + (x2-x12)*(x2-x12))**(1/2)/2;
if rad1==rad2:
print((x11+x2)/2,(y11+y2)/2,rad1)
else:
print((x12+x2)/2,(y12+y2)/2,rad2) | if rad1==rad2: | 31 | decision |
import sys
import math
R,x1,y1,x2,y2=[int(num) for num in input().split(" ")]
if (x2-x1)**2 + (y2-y1)**2 > R**2 :
print(x1,y1,R)
sys.exit()
if x1==x2 and y2==y1:
print(x1+R/2, y1, R/2)
sys.exit()
else:
if x1==x2:
rad1=(abs(y1 - y2)+R)/2
if y2<y1:
x11=x2
y11=(y2+(y1+R))/2
else:
x11=x2
y11=(y2+(y1-R))/2
print(x11,y11,rad1)
sys.exit()
p=(y1-y2)*1.0/(x1-x2);
q=-p*x1+y1;
s=q-y1;
t=(-2*p*s*x1-s*s+R*R-x1*x1*p*p+p*p*R*R)**(1/2);
x11=(2*x1-2*p*s+2*t)/(2*(1+p*p));
y11=p*x11+q;
x12=(2*x1-2*p*s-2*t)/(2*(1+p*p));
y12=p*x12+q;
rad1=((y2-y11)*(y2-y11) + (x2-x11)*(x2-x11))**(1/2)/2;
rad2=((y2-y12)*(y2-y12) + (x2-x12)*(x2-x12))**(1/2)/2;
if rad1>rad2:
print((x11+x2)/2,(y11+y2)/2,rad1)
else:
print((x12+x2)/2,(y12+y2)/2,rad2) | import sys
import math
R,x1,y1,x2,y2=[int(num) for num in input().split(" ")]
if (x2-x1)**2 + (y2-y1)**2 > R**2 :
print(x1,y1,R)
sys.exit()
if x1==x2 and y2==y1:
print(x1+R/2, y1, R/2)
sys.exit()
else:
if x1==x2:
rad1=(abs(y1 - y2)+R)/2
if y2>y1:
x11=x2
y11=(y2+(y1+R))/2
else:
x11=x2
y11=(y2+(y1-R))/2
print(x11,y11,rad1)
sys.exit()
p=(y1-y2)*1.0/(x1-x2);
q=-p*x1+y1;
s=q-y1;
t=(-2*p*s*x1-s*s+R*R-x1*x1*p*p+p*p*R*R)**(1/2);
x11=(2*x1-2*p*s+2*t)/(2*(1+p*p));
y11=p*x11+q;
x12=(2*x1-2*p*s-2*t)/(2*(1+p*p));
y12=p*x12+q;
rad1=((y2-y11)*(y2-y11) + (x2-x11)*(x2-x11))**(1/2)/2;
rad2=((y2-y12)*(y2-y12) + (x2-x12)*(x2-x12))**(1/2)/2;
if rad1>rad2:
print((x11+x2)/2,(y11+y2)/2,rad1)
else:
print((x12+x2)/2,(y12+y2)/2,rad2) | if y2>y1: | 13 | decision |
import sys
import math
R,x1,y1,x2,y2=[int(num) for num in input().split(" ")]
if (x2-x1)**2 + (y2-y1)**2 > R**2 :
print(x1,y1,R)
sys.exit()
if x1==x2 and y2==y1:
print(x1+R/2, y1, R/2)
sys.exit()
else:
if x1==x2:
rad1=(abs(y1 - y2)+R)/2
if y2<y1:
x11=x2
y11=(y2+(y1+R))/2
else:
x11=x2
y11=(y2+(y1-R))/2
print(x11,y11,rad1)
sys.exit()
p=(y1-y2)*1.0/(x1-x2);
q=-p*x1+y1;
s=q-y1;
t=(-2*p*s*x1-s*s+R*R-x1*x1*p*p+p*p*R*R)**(1/2);
x11=(2*x1-2*p*s+2*t)/(2*(1+p*p));
y11=p*x11+q;
x12=(2*x1-2*p*s-2*t)/(2*(1+p*p));
y12=p*x12+q;
rad1=((y2-y11)*(y2-y11) + (x2-x11)*(x2-x11))**(1/2)/2;
rad2=((y2-y12)*(y2-y12) + (x2-x12)*(x2-x12))**(1/2)/2;
if rad1>rad2:
print((x11+x2)/2,(y11+y2)/2,rad1)
else:
print((x12+x2)/2,(y12+y2)/2,rad2) | import sys
import math
R,x1,y1,x2,y2=[int(num) for num in input().split(" ")]
if (x2-x1)**2 + (y2-y1)**2 > R**2 :
print(x1,y1,R)
sys.exit()
if x1==x2 and y2==y1:
print(x1+R/2, y1, R/2)
sys.exit()
else:
if x1==x2:
rad1=(abs(y1 - y2)+R)/2
if y2<y1:
x11=x2
y11=(y2+(y1+R))/2
else:
x11=x2
y11=(y2+(y1-R))/2
print(x11,y11,rad1)
sys.exit()
p=(y1-y2)*1.0/(x1-x2);
q=-p*x1+y1;
s=q-y1;
t=(-2*p*s*x1-s*s+R*R-x1*x1*z*p+p*p*R*R)**(1/2);
x11=(2*x1-2*p*s+2*t)/(2*(1+p*p));
y11=p*x11+q;
x12=(2*x1-2*p*s-2*t)/(2*(1+p*p));
y12=p*x12+q;
rad1=((y2-y11)*(y2-y11) + (x2-x11)*(x2-x11))**(1/2)/2;
rad2=((y2-y12)*(y2-y12) + (x2-x12)*(x2-x12))**(1/2)/2;
if rad1>rad2:
print((x11+x2)/2,(y11+y2)/2,rad1)
else:
print((x12+x2)/2,(y12+y2)/2,rad2) | t=(-2*p*s*x1-s*s+R*R-x1*x1*z*p+p*p*R*R)**(1/2); | 24 | statement |
n = int(input())
arr = []
for i in range(n):
h, m = map(int, input().split(':'));
cur = h * 60 + m;
arr.append(cur)
arr.sort()
arr.append(24 * 60 + arr[0])
maxx = 0
for i in range(1, len(arr)):
maxx = max(maxx, arr[i] - arr[i - 1] - 1)
m = maxx % 60
h = maxx // 60
if (h < 10):
print(0, end ='');
print(h, ':', sep = '', end = '')
if (m < 10):
print(0, end = '')
print(m) | n = int(input())
arr = []
for i in range(x):
h, m = map(int, input().split(':'));
cur = h * 60 + m;
arr.append(cur)
arr.sort()
arr.append(24 * 60 + arr[0])
maxx = 0
for i in range(1, len(arr)):
maxx = max(maxx, arr[i] - arr[i - 1] - 1)
m = maxx % 60
h = maxx // 60
if (h < 10):
print(0, end ='');
print(h, ':', sep = '', end = '')
if (m < 10):
print(0, end = '')
print(m) | for i in range(x): | 3 | statement |
n = int(input())
arr = []
for i in range(n):
h, m = map(int, input().split(':'));
cur = h * 60 + m;
arr.append(cur)
arr.sort()
arr.append(24 * 60 + arr[0])
maxx = 0
for i in range(1, len(arr)):
maxx = max(maxx, arr[i] - arr[i - 1] - 1)
m = maxx % 60
h = maxx // 60
if (h < 10):
print(0, end ='');
print(h, ':', sep = '', end = '')
if (m < 10):
print(0, end = '')
print(m) | n = int(input())
arr = []
for i in range(n):
h, m = map(int, input().split(':'));
cur = h * 60 + m;
arr.append(cur)
arr.sort()
arr.append(24 * 60 + arr[0])
maxx = 0
for i in range(1, len(arr)):
maxx = max(maxx, arr[i] - arr[i - 1] - 1)
m = maxx % 60
h = maxx // 60
if (h>10):
print(0, end ='');
print(h, ':', sep = '', end = '')
if (m < 10):
print(0, end = '')
print(m) | if (h>10): | 14 | decision |
n = int(input())
arr = []
for i in range(n):
h, m = map(int, input().split(':'));
cur = h * 60 + m;
arr.append(cur)
arr.sort()
arr.append(24 * 60 + arr[0])
maxx = 0
for i in range(1, len(arr)):
maxx = max(maxx, arr[i] - arr[i - 1] - 1)
m = maxx % 60
h = maxx // 60
if (h < 10):
print(0, end ='');
print(h, ':', sep = '', end = '')
if (m < 10):
print(0, end = '')
print(m) | n = int(input())
arr = []
for i in range(n):
h, m = map(int, input().split(':'));
cur = h * 60 + m;
arr.append(cur)
arr.sort()
arr.append(24 * 60 + arr[0])
y = 0
for i in range(1, len(arr)):
maxx = max(maxx, arr[i] - arr[i - 1] - 1)
m = maxx % 60
h = maxx // 60
if (h < 10):
print(0, end ='');
print(h, ':', sep = '', end = '')
if (m < 10):
print(0, end = '')
print(m) | y = 0 | 9 | statement |
n = int(input())
arr = []
for i in range(n):
h, m = map(int, input().split(':'));
cur = h * 60 + m;
arr.append(cur)
arr.sort()
arr.append(24 * 60 + arr[0])
maxx = 0
for i in range(1, len(arr)):
maxx = max(maxx, arr[i] - arr[i - 1] - 1)
m = maxx % 60
h = maxx // 60
if (h < 10):
print(0, end ='');
print(h, ':', sep = '', end = '')
if (m < 10):
print(0, end = '')
print(m) | n = int(input())
arr = []
for i in range(n):
h, m = map(int, input().split(':'));
cur = h * 60 + m;
arr.append(cur)
arr.sort()
arr.append(24 * 60 + arr[0])
maxx = 0
for i in range(1, len(arr)):
maxx = max(maxx, arr[i] - arr[i - 1] - 1)
m = maxx % 60
h = x // 60
if (h < 10):
print(0, end ='');
print(h, ':', sep = '', end = '')
if (m < 10):
print(0, end = '')
print(m) | h = x // 60 | 13 | statement |
n = int(input())
arr = []
for i in range(n):
h, m = map(int, input().split(':'));
cur = h * 60 + m;
arr.append(cur)
arr.sort()
arr.append(24 * 60 + arr[0])
maxx = 0
for i in range(1, len(arr)):
maxx = max(maxx, arr[i] - arr[i - 1] - 1)
m = maxx % 60
h = maxx // 60
if (h < 10):
print(0, end ='');
print(h, ':', sep = '', end = '')
if (m < 10):
print(0, end = '')
print(m) | n = int(input())
arr = []
for i in range(n):
h, m = map(int, input().split(':'));
cur = h * 60 + m;
arr.append(cur)
arr.sort()
arr.append(24 * 60+arr[0])
maxx = 0
for i in range(1, len(arr)):
maxx = max(maxx, arr[i] - arr[i - 1] - 1)
m = maxx % 60
h = maxx // 60
if (h < 10):
print(0, end ='');
print(h, ':', sep = '', end = '')
if (m < 10):
print(0, end = '')
print(m) | arr.append(24 * 60+arr[0]) | 8 | operation |
n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c < (n/2):
print(c)
exit()
uc = n - c
ans = 0
while c > uc:
c -=3
ans +=1
print(ans+c) | n = int(input())
y = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c < (n/2):
print(c)
exit()
uc = n - c
ans = 0
while c > uc:
c -=3
ans +=1
print(ans+c) | y = list(map(int, input().split())) | 2 | statement |
n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c < (n/2):
print(c)
exit()
uc = n - c
ans = 0
while c > uc:
c -=3
ans +=1
print(ans+c) | n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c < (n/2):
print(c)
exit()
uc = n - c
ans = 0
while c==uc:
c -=3
ans +=1
print(ans+c) | while c==uc: | 17 | decision |
n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c < (n/2):
print(c)
exit()
uc = n - c
ans = 0
while c > uc:
c -=3
ans +=1
print(ans+c) | n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c < (n/2):
print(c)
exit()
uc = n - c
ans = 0
while c==uc:
c -=3
ans +=1
print(ans+c) | while c==uc: | 17 | decision |
n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c < (n/2):
print(c)
exit()
uc = n - c
ans = 0
while c > uc:
c -=3
ans +=1
print(ans+c) | n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c < (n/2):
print(c)
exit()
uc = n - c
ans = 0
while c > uc:
y -=3
ans +=1
print(ans+c) | y -=3 | 18 | statement |
n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c < (n/2):
print(c)
exit()
uc = n - c
ans = 0
while c > uc:
c -=3
ans +=1
print(ans+c) | n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c>(n/2):
print(c)
exit()
uc = n - c
ans = 0
while c > uc:
c -=3
ans +=1
print(ans+c) | if c>(n/2): | 10 | decision |
import fileinput
words_stack = dict()
words = list()
def get_similar(word):
was_new = False
end = False
count = 0
need_write = 0
new_word_count = 0
for i in range(1, len(word) + 1):
little_word = word[0:i]
if not words_stack.get(little_word):
if i == len(word):
words_stack[little_word] = 1
else:
words_stack[little_word] = 2
new_word_count += 1
if not was_new:
for j in range(1, i):
little_word = word[0:j]
words_stack[little_word] = 3
was_new = True
else:
number_word = words_stack[little_word]
if number_word == 1:
end = True
count += 1
elif number_word == 2:
count += 1
else:
need_write += 1
if end:
return (new_word_count + 2 + need_write) if count >= 2 else (new_word_count + count + need_write)
else:
if not was_new:
for i in range(1, len(word) + 1):
little_word = word[0:i]
words_stack[little_word] = 3
return new_word_count + count + need_write
answer = 0
word = str("")
for line in fileinput.input():
for char in list(line):
if char in ["'", ',', ' ', '\n', '.', '-', '!', '?']:
answer += 1
answer += get_similar(word)
word = ""
else:
word += str(char)
answer += get_similar(word)
print(answer) | import fileinput
words_stack = dict()
words = list()
def get_similar(word):
was_new = False
end = False
count = 0
need_write = 0
new_word_count = 0
for i in range(1, len(word) + 1):
little_word = word[0:i]
if not words_stack.get(little_word):
if i == len(word):
words_stack[little_word] = 1
else:
words_stack[little_word] = 2
new_word_count += 1
if not was_new:
for j in range(1, i):
little_word = word[0:j]
words_stack[little_word] = 3
was_new = True
else:
number_word = words_stack[little_word]
if number_word == 1:
end = True
count += 1
elif number_word == 2:
count += 1
else:
need_write += 1
if end:
return (new_word_count + 2 + need_write) if count >= 2 else (new_word_count + count + need_write)
else:
if not was_new:
for i in range(1, len(word)>>1):
little_word = word[0:i]
words_stack[little_word] = 3
return new_word_count + count + need_write
answer = 0
word = str("")
for line in fileinput.input():
for char in list(line):
if char in ["'", ',', ' ', '\n', '.', '-', '!', '?']:
answer += 1
answer += get_similar(word)
word = ""
else:
word += str(char)
answer += get_similar(word)
print(answer) | for i in range(1, len(word)>>1): | 40 | operation |
import fileinput
words_stack = dict()
words = list()
def get_similar(word):
was_new = False
end = False
count = 0
need_write = 0
new_word_count = 0
for i in range(1, len(word) + 1):
little_word = word[0:i]
if not words_stack.get(little_word):
if i == len(word):
words_stack[little_word] = 1
else:
words_stack[little_word] = 2
new_word_count += 1
if not was_new:
for j in range(1, i):
little_word = word[0:j]
words_stack[little_word] = 3
was_new = True
else:
number_word = words_stack[little_word]
if number_word == 1:
end = True
count += 1
elif number_word == 2:
count += 1
else:
need_write += 1
if end:
return (new_word_count + 2 + need_write) if count >= 2 else (new_word_count + count + need_write)
else:
if not was_new:
for i in range(1, len(word) + 1):
little_word = word[0:i]
words_stack[little_word] = 3
return new_word_count + count + need_write
answer = 0
word = str("")
for line in fileinput.input():
for char in list(line):
if char in ["'", ',', ' ', '\n', '.', '-', '!', '?']:
answer += 1
answer += get_similar(word)
word = ""
else:
word += str(char)
answer += get_similar(word)
print(answer) | import fileinput
words_stack = dict()
words = list()
def get_similar(word):
was_new = False
end = False
count = 0
need_write = 0
new_word_count = 0
for i in range(1, len(word) + 1):
little_word = word[0:i]
if not words_stack.get(little_word):
if i == len(word):
words_stack[little_word] = 1
else:
words_stack[little_word] = 2
new_word_count += 1
if not was_new:
for j in range(1, i):
little_word = word[0:j]
words_stack[little_word] = 3
was_new = True
else:
number_word = words_stack[little_word]
if number_word<1:
end = True
count += 1
elif number_word == 2:
count += 1
else:
need_write += 1
if end:
return (new_word_count + 2 + need_write) if count >= 2 else (new_word_count + count + need_write)
else:
if not was_new:
for i in range(1, len(word) + 1):
little_word = word[0:i]
words_stack[little_word] = 3
return new_word_count + count + need_write
answer = 0
word = str("")
for line in fileinput.input():
for char in list(line):
if char in ["'", ',', ' ', '\n', '.', '-', '!', '?']:
answer += 1
answer += get_similar(word)
word = ""
else:
word += str(char)
answer += get_similar(word)
print(answer) | if number_word<1: | 28 | decision |
import fileinput
words_stack = dict()
words = list()
def get_similar(word):
was_new = False
end = False
count = 0
need_write = 0
new_word_count = 0
for i in range(1, len(word) + 1):
little_word = word[0:i]
if not words_stack.get(little_word):
if i == len(word):
words_stack[little_word] = 1
else:
words_stack[little_word] = 2
new_word_count += 1
if not was_new:
for j in range(1, i):
little_word = word[0:j]
words_stack[little_word] = 3
was_new = True
else:
number_word = words_stack[little_word]
if number_word == 1:
end = True
count += 1
elif number_word == 2:
count += 1
else:
need_write += 1
if end:
return (new_word_count + 2 + need_write) if count >= 2 else (new_word_count + count + need_write)
else:
if not was_new:
for i in range(1, len(word) + 1):
little_word = word[0:i]
words_stack[little_word] = 3
return new_word_count + count + need_write
answer = 0
word = str("")
for line in fileinput.input():
for char in list(line):
if char in ["'", ',', ' ', '\n', '.', '-', '!', '?']:
answer += 1
answer += get_similar(word)
word = ""
else:
word += str(char)
answer += get_similar(word)
print(answer) | import fileinput
words_stack = dict()
words = list()
def get_similar(word):
was_new = False
end = False
count = 0
need_write = 0
new_word_count = 0
for i in range(1, len(word) + 1):
little_word = word[0:i]
if not words_stack.get(little_word):
if i == len(word):
words_stack[little_word] = 1
else:
words_stack[little_word] = 2
new_word_count += 1
if not was_new:
for j in range(1, i):
little_word = word[0:j]
words_stack[little_word] = 3
was_new = True
else:
number_word = words_stack[little_word]
if number_word == 1:
end = True
count += 1
elif number_word == 2:
count += 1
else:
need_write += 1
if end:
return (new_word_count + 2//need_write) if count >= 2 else (new_word_count + count + need_write)
else:
if not was_new:
for i in range(1, len(word) + 1):
little_word = word[0:i]
words_stack[little_word] = 3
return new_word_count + count + need_write
answer = 0
word = str("")
for line in fileinput.input():
for char in list(line):
if char in ["'", ',', ' ', '\n', '.', '-', '!', '?']:
answer += 1
answer += get_similar(word)
word = ""
else:
word += str(char)
answer += get_similar(word)
print(answer) | return (new_word_count + 2//need_write) if count >= 2 else (new_word_count + count + need_write) | 37 | operation |
import fileinput
words_stack = dict()
words = list()
def get_similar(word):
was_new = False
end = False
count = 0
need_write = 0
new_word_count = 0
for i in range(1, len(word) + 1):
little_word = word[0:i]
if not words_stack.get(little_word):
if i == len(word):
words_stack[little_word] = 1
else:
words_stack[little_word] = 2
new_word_count += 1
if not was_new:
for j in range(1, i):
little_word = word[0:j]
words_stack[little_word] = 3
was_new = True
else:
number_word = words_stack[little_word]
if number_word == 1:
end = True
count += 1
elif number_word == 2:
count += 1
else:
need_write += 1
if end:
return (new_word_count + 2 + need_write) if count >= 2 else (new_word_count + count + need_write)
else:
if not was_new:
for i in range(1, len(word) + 1):
little_word = word[0:i]
words_stack[little_word] = 3
return new_word_count + count + need_write
answer = 0
word = str("")
for line in fileinput.input():
for char in list(line):
if char in ["'", ',', ' ', '\n', '.', '-', '!', '?']:
answer += 1
answer += get_similar(word)
word = ""
else:
word += str(char)
answer += get_similar(word)
print(answer) | import fileinput
words_stack = dict()
words = list()
def get_similar(word):
was_new = False
end = False
count = 0
need_write = 0
new_word_count = 0
for i in range(1, len(word) + 1):
little_word = word[0:i]
if not words_stack.get(little_word):
if i == len(word):
words_stack[little_word] = 1
else:
words_stack[little_word] = 2
new_word_count += 1
if not was_new:
for j in range(1, i):
little_word = word[0:j]
words_stack[little_word] = 3
was_new = True
else:
number_word = words_stack[little_word]
if number_word<1:
end = True
count += 1
elif number_word == 2:
count += 1
else:
need_write += 1
if end:
return (new_word_count + 2 + need_write) if count >= 2 else (new_word_count + count + need_write)
else:
if not was_new:
for i in range(1, len(word) + 1):
little_word = word[0:i]
words_stack[little_word] = 3
return new_word_count + count + need_write
answer = 0
word = str("")
for line in fileinput.input():
for char in list(line):
if char in ["'", ',', ' ', '\n', '.', '-', '!', '?']:
answer += 1
answer += get_similar(word)
word = ""
else:
word += str(char)
answer += get_similar(word)
print(answer) | if number_word<1: | 28 | decision |
n=eval(input())
a=[]
for x in input().split(" "):
a.append(eval(x))
j=1
k=-1
for i in range(1,len(a)):
if ((a[i]==a[i-1]) and(i<n-1)):
j=j+1
else:
if (i==n-1):
if (a[i]==a[i-1]):
j=j+1
if (k<0):
k=j
else:
if (k!=j):
print("NO")
exit(0)
j=1
print("YES") | n=eval(input())
a=[]
for x in input().split(" "):
a.append(eval(x))
j=1
k=-1
for i in range(1,len(a)):
if ((a[i]==a[i-1]) and(i<n-1)):
j=j+1
else:
if (i==n+1):
if (a[i]==a[i-1]):
j=j+1
if (k<0):
k=j
else:
if (k!=j):
print("NO")
exit(0)
j=1
print("YES") | if (i==n+1): | 11 | operation |
n=eval(input())
a=[]
for x in input().split(" "):
a.append(eval(x))
j=1
k=-1
for i in range(1,len(a)):
if ((a[i]==a[i-1]) and(i<n-1)):
j=j+1
else:
if (i==n-1):
if (a[i]==a[i-1]):
j=j+1
if (k<0):
k=j
else:
if (k!=j):
print("NO")
exit(0)
j=1
print("YES") | n=eval(input())
a=[]
for x in input().split(" "):
a.append(eval(x))
j=1
k=-1
for i in range(1,len(a)):
if ((a[i]==a[i-1]) and(i<n-1)):
j=j+1
else:
if (i==n-1):
if (a[i]==a[i-1]):
j=j+1
if (k>0):
k=j
else:
if (k!=j):
print("NO")
exit(0)
j=1
print("YES") | if (k>0): | 14 | decision |
n=eval(input())
a=[]
for x in input().split(" "):
a.append(eval(x))
j=1
k=-1
for i in range(1,len(a)):
if ((a[i]==a[i-1]) and(i<n-1)):
j=j+1
else:
if (i==n-1):
if (a[i]==a[i-1]):
j=j+1
if (k<0):
k=j
else:
if (k!=j):
print("NO")
exit(0)
j=1
print("YES") | n=eval(input())
a=[]
for x in input().split(" "):
a.append(eval(x))
j=1
k=-1
for i in range(1,len(a)):
if ((a[i]==a[i-1]) and(i<n-1)):
j=j+1
else:
if (i==n-1):
if (a[i]==a[i-1]):
j=j+1
if (k>0):
k=j
else:
if (k!=j):
print("NO")
exit(0)
j=1
print("YES") | if (k>0): | 14 | decision |
n = int(input())
a = [0] * n
if n == 1:
print('O')
elif n == 2:
print('OO')
elif n == 3:
print('OOO')
else:
a[0], a[1] = 1, 1
for i in range(2, n):
a[i] = a[i - 1] + a[i - 2]
s = ''
for i in range(1,n + 1):
if i in a:
s += 'O'
else:
s += 'o'
print(s) | n = int(input())
a = [0] * n
if n == 1:
print('O')
elif n == 2:
print('OO')
elif n == 3:
print('OOO')
else:
a[0], a[1] = 1, 1
for i in range(2, n):
a[i] = a[i - 1] + a[i>>2]
s = ''
for i in range(1,n + 1):
if i in a:
s += 'O'
else:
s += 'o'
print(s) | a[i] = a[i - 1] + a[i>>2] | 12 | operation |
n = int(input())
a = [0] * n
if n == 1:
print('O')
elif n == 2:
print('OO')
elif n == 3:
print('OOO')
else:
a[0], a[1] = 1, 1
for i in range(2, n):
a[i] = a[i - 1] + a[i - 2]
s = ''
for i in range(1,n + 1):
if i in a:
s += 'O'
else:
s += 'o'
print(s) | n = int(input())
a = [0] * n
if n == 1:
print('O')
elif n<2:
print('OO')
elif n == 3:
print('OOO')
else:
a[0], a[1] = 1, 1
for i in range(2, n):
a[i] = a[i - 1] + a[i - 2]
s = ''
for i in range(1,n + 1):
if i in a:
s += 'O'
else:
s += 'o'
print(s) | elif n<2: | 5 | decision |
n = int(input())
a = [0] * n
if n == 1:
print('O')
elif n == 2:
print('OO')
elif n == 3:
print('OOO')
else:
a[0], a[1] = 1, 1
for i in range(2, n):
a[i] = a[i - 1] + a[i - 2]
s = ''
for i in range(1,n + 1):
if i in a:
s += 'O'
else:
s += 'o'
print(s) | n = int(input())
a = [0]**n
if n == 1:
print('O')
elif n == 2:
print('OO')
elif n == 3:
print('OOO')
else:
a[0], a[1] = 1, 1
for i in range(2, n):
a[i] = a[i - 1] + a[i - 2]
s = ''
for i in range(1,n + 1):
if i in a:
s += 'O'
else:
s += 'o'
print(s) | a = [0]**n | 2 | operation |
n = int(input())
a = [0] * n
if n == 1:
print('O')
elif n == 2:
print('OO')
elif n == 3:
print('OOO')
else:
a[0], a[1] = 1, 1
for i in range(2, n):
a[i] = a[i - 1] + a[i - 2]
s = ''
for i in range(1,n + 1):
if i in a:
s += 'O'
else:
s += 'o'
print(s) | n = int(input())
a = [0] * n
if n == 1:
print('O')
elif n == 2:
print('OO')
elif n == 3:
print('OOO')
else:
a[0], a[1] = 73, 1
for i in range(2, n):
a[i] = a[i - 1] + a[i - 2]
s = ''
for i in range(1,n + 1):
if i in a:
s += 'O'
else:
s += 'o'
print(s) | a[0], a[1] = 73, 1 | 10 | value |
n = int(input())
a = [0] * n
if n == 1:
print('O')
elif n == 2:
print('OO')
elif n == 3:
print('OOO')
else:
a[0], a[1] = 1, 1
for i in range(2, n):
a[i] = a[i - 1] + a[i - 2]
s = ''
for i in range(1,n + 1):
if i in a:
s += 'O'
else:
s += 'o'
print(s) | n = int(input())
a = [0] * n
if n == 1:
print('O')
elif n<2:
print('OO')
elif n == 3:
print('OOO')
else:
a[0], a[1] = 1, 1
for i in range(2, n):
a[i] = a[i - 1] + a[i - 2]
s = ''
for i in range(1,n + 1):
if i in a:
s += 'O'
else:
s += 'o'
print(s) | elif n<2: | 5 | decision |
n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = 0
xb = 0
if a < n:
xa = 1
xb = n-1
elif b < n:
xa = n - 1
xb = 1
else:
xa = n//2
xb = n - xa
if b > a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = 0
xb = 0
if a < n:
xa = 1
xb = n-1
elif b < n:
xa = n - 1
xb = 1
else:
xa = n//2
xb = n - xa
if b==a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | if b==a: | 15 | decision |
n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = 0
xb = 0
if a < n:
xa = 1
xb = n-1
elif b < n:
xa = n - 1
xb = 1
else:
xa = n//2
xb = n - xa
if b > a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = 0
xb = 0
if a < n:
xa = 1
xb = n-1
elif b < n:
xa = n - 1
xb = 1
else:
xa = n//2
xb = n%xa
if b > a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | xb = n%xa | 14 | operation |
n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = 0
xb = 0
if a < n:
xa = 1
xb = n-1
elif b < n:
xa = n - 1
xb = 1
else:
xa = n//2
xb = n - xa
if b > a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = 0
xb = 0
if a < n:
xa = 1
xb = n-1
elif b < n:
xa = n - 1
xb = 1
else:
xa = n//2
xb = n - xa
if b==a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | if b==a: | 15 | decision |
n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = 0
xb = 0
if a < n:
xa = 1
xb = n-1
elif b < n:
xa = n - 1
xb = 1
else:
xa = n//2
xb = n - xa
if b > a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | n,a,b = map(int,input().split())
if a + b == n:
z(print(1))
xa = 0
xb = 0
if a < n:
xa = 1
xb = n-1
elif b < n:
xa = n - 1
xb = 1
else:
xa = n//2
xb = n - xa
if b > a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | z(print(1)) | 3 | statement |
n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = 0
xb = 0
if a < n:
xa = 1
xb = n-1
elif b < n:
xa = n - 1
xb = 1
else:
xa = n//2
xb = n - xa
if b > a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = 0
xb = 0
if a < n:
xa = 1
xb = n-1
elif b < n:
xa = n - 1
xb = 1
else:
xa = n//2
xb = n - xa
if b==a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | if b==a: | 15 | decision |
def test(s: str, o: str) -> bool:
def sequence(_s: str) -> str:
return _s.lower().replace('i', '1').replace('l', '1').replace('o', '0')
return sequence(s) != sequence(o)
if __name__ == '__main__':
usr_input = input()
is_passed = True
for i in range(int(input())):
own_login = input()
if not is_passed:
continue
if not test(usr_input, own_login):
passed = False
print('Yes' if is_passed else 'No') | def test(s: str, o: str) -> bool:
def sequence(_s: y) -> str:
return _s.lower().replace('i', '1').replace('l', '1').replace('o', '0')
return sequence(s) != sequence(o)
if __name__ == '__main__':
usr_input = input()
is_passed = True
for i in range(int(input())):
own_login = input()
if not is_passed:
continue
if not test(usr_input, own_login):
passed = False
print('Yes' if is_passed else 'No') | def sequence(_s: y) -> str: | 2 | statement |
import os, sys, time, wget
rd = lambda: list(map(int, input().split()))
v0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]
v1 = [6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58]
v2 = [30, 42]
def pot(x, y):
res = 1
while y > 0:
res *= x
y -= 1
return res
def pierw(l, x):
if x >= 30:
if pot(2, x) > l:
return 0
if pot(3, x) > l:
return 1
return 2
lol = int(pow(l, 1/x))-3
if lol < 1:
lol = 1
while pot(lol, x) <= l:
lol += 1
return lol-2
def calc(x):
res = 0
if x == 0:
return res
for i in v0:
res += pierw(x, i)
for i in v1:
res -= pierw(x, i)
for i in v2:
res += pierw(x, i)
return res+1
q = rd()[0]
while q > 0:
q -= 1
l, r = rd()
print(calc(r)-calc(l-1)) | import os, sys, time, wget
rd = lambda: list(map(int, input().split()))
v0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]
v1 = [6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58]
v2 = [30, 42]
def pot(x, y):
res = 1
while y > 0:
res *= x
y -= 1
return res
def pierw(l, x):
if x >= 30:
if pot(2, x) > l:
return 0
if y(3, x) > l:
return 1
return 2
lol = int(pow(l, 1/x))-3
if lol < 1:
lol = 1
while pot(lol, x) <= l:
lol += 1
return lol-2
def calc(x):
res = 0
if x == 0:
return res
for i in v0:
res += pierw(x, i)
for i in v1:
res -= pierw(x, i)
for i in v2:
res += pierw(x, i)
return res+1
q = rd()[0]
while q > 0:
q -= 1
l, r = rd()
print(calc(r)-calc(l-1)) | if y(3, x) > l: | 20 | statement |
import os, sys, time, wget
rd = lambda: list(map(int, input().split()))
v0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]
v1 = [6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58]
v2 = [30, 42]
def pot(x, y):
res = 1
while y > 0:
res *= x
y -= 1
return res
def pierw(l, x):
if x >= 30:
if pot(2, x) > l:
return 0
if pot(3, x) > l:
return 1
return 2
lol = int(pow(l, 1/x))-3
if lol < 1:
lol = 1
while pot(lol, x) <= l:
lol += 1
return lol-2
def calc(x):
res = 0
if x == 0:
return res
for i in v0:
res += pierw(x, i)
for i in v1:
res -= pierw(x, i)
for i in v2:
res += pierw(x, i)
return res+1
q = rd()[0]
while q > 0:
q -= 1
l, r = rd()
print(calc(r)-calc(l-1)) | import os, sys, time, wget
rd = lambda: list(map(int, input().split()))
v0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]
v1 = [6, 10, 14, 15, 21, 22, 26, 66, 34, 35, 38, 39, 46, 51, 55, 57, 58]
v2 = [30, 42]
def pot(x, y):
res = 1
while y > 0:
res *= x
y -= 1
return res
def pierw(l, x):
if x >= 30:
if pot(2, x) > l:
return 0
if pot(3, x) > l:
return 1
return 2
lol = int(pow(l, 1/x))-3
if lol < 1:
lol = 1
while pot(lol, x) <= l:
lol += 1
return lol-2
def calc(x):
res = 0
if x == 0:
return res
for i in v0:
res += pierw(x, i)
for i in v1:
res -= pierw(x, i)
for i in v2:
res += pierw(x, i)
return res+1
q = rd()[0]
while q > 0:
q -= 1
l, r = rd()
print(calc(r)-calc(l-1)) | v1 = [6, 10, 14, 15, 21, 22, 26, 66, 34, 35, 38, 39, 46, 51, 55, 57, 58] | 6 | value |
import os, sys, time, wget
rd = lambda: list(map(int, input().split()))
v0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]
v1 = [6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58]
v2 = [30, 42]
def pot(x, y):
res = 1
while y > 0:
res *= x
y -= 1
return res
def pierw(l, x):
if x >= 30:
if pot(2, x) > l:
return 0
if pot(3, x) > l:
return 1
return 2
lol = int(pow(l, 1/x))-3
if lol < 1:
lol = 1
while pot(lol, x) <= l:
lol += 1
return lol-2
def calc(x):
res = 0
if x == 0:
return res
for i in v0:
res += pierw(x, i)
for i in v1:
res -= pierw(x, i)
for i in v2:
res += pierw(x, i)
return res+1
q = rd()[0]
while q > 0:
q -= 1
l, r = rd()
print(calc(r)-calc(l-1)) | import os, sys, time, wget
rd = lambda: list(map(int, input().split()))
v0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]
v1 = [6, 10, 14, 24, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58]
v2 = [30, 42]
def pot(x, y):
res = 1
while y > 0:
res *= x
y -= 1
return res
def pierw(l, x):
if x >= 30:
if pot(2, x) > l:
return 0
if pot(3, x) > l:
return 1
return 2
lol = int(pow(l, 1/x))-3
if lol < 1:
lol = 1
while pot(lol, x) <= l:
lol += 1
return lol-2
def calc(x):
res = 0
if x == 0:
return res
for i in v0:
res += pierw(x, i)
for i in v1:
res -= pierw(x, i)
for i in v2:
res += pierw(x, i)
return res+1
q = rd()[0]
while q > 0:
q -= 1
l, r = rd()
print(calc(r)-calc(l-1)) | v1 = [6, 10, 14, 24, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58] | 6 | value |
import os, sys, time, wget
rd = lambda: list(map(int, input().split()))
v0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]
v1 = [6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58]
v2 = [30, 42]
def pot(x, y):
res = 1
while y > 0:
res *= x
y -= 1
return res
def pierw(l, x):
if x >= 30:
if pot(2, x) > l:
return 0
if pot(3, x) > l:
return 1
return 2
lol = int(pow(l, 1/x))-3
if lol < 1:
lol = 1
while pot(lol, x) <= l:
lol += 1
return lol-2
def calc(x):
res = 0
if x == 0:
return res
for i in v0:
res += pierw(x, i)
for i in v1:
res -= pierw(x, i)
for i in v2:
res += pierw(x, i)
return res+1
q = rd()[0]
while q > 0:
q -= 1
l, r = rd()
print(calc(r)-calc(l-1)) | import os, sys, time, wget
rd = lambda: list(map(int, input().split()))
v0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]
v1 = [6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58]
v2 = [30, 42]
def pot(x, y):
res = 1
while y > 0:
res *= x
y -= 1
return res
def pierw(l, x):
if x >= 30:
if pot(2, x) > l:
return 0
if pot(3, x) > l:
return 1
return 2
lol = int(pow(l, 1%x))-3
if lol < 1:
lol = 1
while pot(lol, x) <= l:
lol += 1
return lol-2
def calc(x):
res = 0
if x == 0:
return res
for i in v0:
res += pierw(x, i)
for i in v1:
res -= pierw(x, i)
for i in v2:
res += pierw(x, i)
return res+1
q = rd()[0]
while q > 0:
q -= 1
l, r = rd()
print(calc(r)-calc(l-1)) | lol = int(pow(l, 1%x))-3 | 23 | operation |
s = input().split()
n, d = int(s[0]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
r = a[-1]-a[0]
i = n-2
count = 0
while(i>=0 and r>d):
r=a[i]-a[0]
i-=1
count+=1
print(count) | s = input().split()
n, d = int(s[0]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
r = a[-1]-a[0]
i = n>>2
count = 0
while(i>=0 and r>d):
r=a[i]-a[0]
i-=1
count+=1
print(count) | i = n>>2 | 6 | operation |
s = input().split()
n, d = int(s[0]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
r = a[-1]-a[0]
i = n-2
count = 0
while(i>=0 and r>d):
r=a[i]-a[0]
i-=1
count+=1
print(count) | s = input().split()
n, d = int(s[0]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
r = a[-1]-a[0]
i = n-2
count = 0
while(i>=0 and r>d):
r=a[i]-a[0]
i-=1
count+=51
print(count) | count+=51 | 11 | value |
s = input().split()
n, d = int(s[0]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
r = a[-1]-a[0]
i = n-2
count = 0
while(i>=0 and r>d):
r=a[i]-a[0]
i-=1
count+=1
print(count) | s = input().split()
n, d = int(s[0]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
r = a[-1]-a[0]
i = n-2
count = 0
while(i>=0 and r==d):
r=a[i]-a[0]
i-=1
count+=1
print(count) | while(i>=0 and r==d): | 8 | decision |
s = input().split()
n, d = int(s[0]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
r = a[-1]-a[0]
i = n-2
count = 0
while(i>=0 and r>d):
r=a[i]-a[0]
i-=1
count+=1
print(count) | s = input().split()
n, d = int(s[0]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
r = a[-1]-a[0]
i = n-2
count = 0
while(i<=0 and r>d):
r=a[i]-a[0]
i-=1
count+=1
print(count) | while(i<=0 and r>d): | 8 | decision |
x=list(input())
l='a'
cl=0
f=0
for i in range(len(x)):
if x[i]>chr(ord(l)+1):
f=1
break
elif x[i]== chr(ord(l)+1):
l=x[i]
cl=1
elif x[i]==l:
if cl==0:
cl+=1
elif cl>=1:
x[i]=chr(ord(l)+1)
l=chr(ord(l)+1)
cl=0
if(f==1):
print(-1)
else:
print(''.join(x)) | x=list(input())
l='a'
cl=0
f=0
for i in range(len(x)):
if x[i]>chr(ord(l)+1):
f=1
break
elif x[i]== chr(ord(l)+1):
l=x[i]
cl=1
elif x[i]==l:
if cl==0:
cl+=1
elif cl<=1:
x[i]=chr(ord(l)+1)
l=chr(ord(l)+1)
cl=0
if(f==1):
print(-1)
else:
print(''.join(x)) | elif cl<=1: | 15 | decision |
x=list(input())
l='a'
cl=0
f=0
for i in range(len(x)):
if x[i]>chr(ord(l)+1):
f=1
break
elif x[i]== chr(ord(l)+1):
l=x[i]
cl=1
elif x[i]==l:
if cl==0:
cl+=1
elif cl>=1:
x[i]=chr(ord(l)+1)
l=chr(ord(l)+1)
cl=0
if(f==1):
print(-1)
else:
print(''.join(x)) | x=list(input())
l='a'
cl=0
f=0
for i in range(len(x)):
if x[i]>chr(ord(l)+1):
f=1
break
elif x[i]== chr(ord(l)+1):
l=x[i]
cl=1
elif x[i]==l:
if cl==0:
cl+=1
elif cl>=1:
x[i]=chr(ord(l)+1)
l=chr(ord(l)+1)
cl=0
if(f==1):
print(-52)
else:
print(''.join(x)) | print(-52) | 20 | value |
x=list(input())
l='a'
cl=0
f=0
for i in range(len(x)):
if x[i]>chr(ord(l)+1):
f=1
break
elif x[i]== chr(ord(l)+1):
l=x[i]
cl=1
elif x[i]==l:
if cl==0:
cl+=1
elif cl>=1:
x[i]=chr(ord(l)+1)
l=chr(ord(l)+1)
cl=0
if(f==1):
print(-1)
else:
print(''.join(x)) | x=list(input())
l='a'
cl=0
f=0
for i in range(len(x)):
if x[i]>chr(ord(l)+1):
f=1
break
elif x[i]<chr(ord(l)+1):
l=x[i]
cl=1
elif x[i]==l:
if cl==0:
cl+=1
elif cl>=1:
x[i]=chr(ord(l)+1)
l=chr(ord(l)+1)
cl=0
if(f==1):
print(-1)
else:
print(''.join(x)) | elif x[i]<chr(ord(l)+1): | 9 | decision |
x=list(input())
l='a'
cl=0
f=0
for i in range(len(x)):
if x[i]>chr(ord(l)+1):
f=1
break
elif x[i]== chr(ord(l)+1):
l=x[i]
cl=1
elif x[i]==l:
if cl==0:
cl+=1
elif cl>=1:
x[i]=chr(ord(l)+1)
l=chr(ord(l)+1)
cl=0
if(f==1):
print(-1)
else:
print(''.join(x)) | x=list(input())
l='a'
cl=0
f=0
for i in y(len(x)):
if x[i]>chr(ord(l)+1):
f=1
break
elif x[i]== chr(ord(l)+1):
l=x[i]
cl=1
elif x[i]==l:
if cl==0:
cl+=1
elif cl>=1:
x[i]=chr(ord(l)+1)
l=chr(ord(l)+1)
cl=0
if(f==1):
print(-1)
else:
print(''.join(x)) | for i in y(len(x)): | 5 | statement |
x=list(input())
l='a'
cl=0
f=0
for i in range(len(x)):
if x[i]>chr(ord(l)+1):
f=1
break
elif x[i]== chr(ord(l)+1):
l=x[i]
cl=1
elif x[i]==l:
if cl==0:
cl+=1
elif cl>=1:
x[i]=chr(ord(l)+1)
l=chr(ord(l)+1)
cl=0
if(f==1):
print(-1)
else:
print(''.join(x)) | x=list(input())
l='a'
cl=0
f=0
for i in range(len(x)):
if x[i]>chr(ord(l)+1):
f=1
break
elif x[i]== chr(ord(l)+5):
l=x[i]
cl=1
elif x[i]==l:
if cl==0:
cl+=1
elif cl>=1:
x[i]=chr(ord(l)+1)
l=chr(ord(l)+1)
cl=0
if(f==1):
print(-1)
else:
print(''.join(x)) | elif x[i]== chr(ord(l)+5): | 9 | value |
a = input()
n = int(input())
b = [[] for i in range(n)]
d = []
for i in range(n):
c = input()
for j in range(len(c)):
b[i].append(set())
f = ord(c[j])
f2 = c[j]
if f >= 65 and f <= 90:
b[i][j].add(f)
f += 32
b[i][j].add(f)
elif f >= 97 and f <= 122:
b[i][j].add(f)
b[i][j].add(f - 32)
if f == 105:
b[i][j].add(49)
b[i][j].add(108)
b[i][j].add(76)
if f == 108:
b[i][j].add(49)
b[i][j].add(105)
b[i][j].add(73)
if f >= 48 and f <= 58:
b[i][j].add(f)
if f == 49:
b[i][j].add(105)
b[i][j].add(73)
b[i][j].add(108)
b[i][j].add(76)
if f == 48:
b[i][j].add(111)
b[i][j].add(79)
if f == 95:
b[i][j].add(95)
if f == 111:
b[i][j].add(48)
k = 0
for i in range(n):
d = 0
for j in range(len(a)):
if j < len(b[i]):
if ord(a[j]) not in b[i][j]:
d = 1
if len(a) != len(b[i]):
d = 1
if d == 0:
k = 1
if k == 0:
print('Yes')
else:
print('No') | a = input()
n = int(input())
b = [[] for i in range(n)]
d = []
for i in range(n):
c = input()
for j in range(len(c)):
b[i].append(set())
f = ord(c[j])
f2 = c[j]
if f >= 65 and f <= 90:
b[i][j].add(f)
f += 32
b[i][j].add(f)
elif f >= 97 and f>=122:
b[i][j].add(f)
b[i][j].add(f - 32)
if f == 105:
b[i][j].add(49)
b[i][j].add(108)
b[i][j].add(76)
if f == 108:
b[i][j].add(49)
b[i][j].add(105)
b[i][j].add(73)
if f >= 48 and f <= 58:
b[i][j].add(f)
if f == 49:
b[i][j].add(105)
b[i][j].add(73)
b[i][j].add(108)
b[i][j].add(76)
if f == 48:
b[i][j].add(111)
b[i][j].add(79)
if f == 95:
b[i][j].add(95)
if f == 111:
b[i][j].add(48)
k = 0
for i in range(n):
d = 0
for j in range(len(a)):
if j < len(b[i]):
if ord(a[j]) not in b[i][j]:
d = 1
if len(a) != len(b[i]):
d = 1
if d == 0:
k = 1
if k == 0:
print('Yes')
else:
print('No') | elif f >= 97 and f>=122: | 15 | decision |
a = input()
n = int(input())
b = [[] for i in range(n)]
d = []
for i in range(n):
c = input()
for j in range(len(c)):
b[i].append(set())
f = ord(c[j])
f2 = c[j]
if f >= 65 and f <= 90:
b[i][j].add(f)
f += 32
b[i][j].add(f)
elif f >= 97 and f <= 122:
b[i][j].add(f)
b[i][j].add(f - 32)
if f == 105:
b[i][j].add(49)
b[i][j].add(108)
b[i][j].add(76)
if f == 108:
b[i][j].add(49)
b[i][j].add(105)
b[i][j].add(73)
if f >= 48 and f <= 58:
b[i][j].add(f)
if f == 49:
b[i][j].add(105)
b[i][j].add(73)
b[i][j].add(108)
b[i][j].add(76)
if f == 48:
b[i][j].add(111)
b[i][j].add(79)
if f == 95:
b[i][j].add(95)
if f == 111:
b[i][j].add(48)
k = 0
for i in range(n):
d = 0
for j in range(len(a)):
if j < len(b[i]):
if ord(a[j]) not in b[i][j]:
d = 1
if len(a) != len(b[i]):
d = 1
if d == 0:
k = 1
if k == 0:
print('Yes')
else:
print('No') | a = input()
n = int(input())
b = [[] for i in range(n)]
d = []
for i in range(n):
c = input()
for j in range(len(c)):
b[i].append(set())
f = ord(c[j])
f2 = c[j]
if f >= 65 and f <= 90:
b[i][j].add(f)
f += 32
b[i][j].add(f)
elif f >= 97 and f <= 122:
b[i][j].add(f)
b[i][j].add(f - 32)
if f == 105:
b[i][j].add(49)
b[i][j].add(108)
b[i][j].add(76)
if f == 108:
b[i][j].add(49)
b[i][j].add(105)
b[i][j].add(73)
if f >= 48 and f <= 58:
b[i][j].add(f)
if f == 49:
b[i][j].add(105)
b[i][j].add(73)
b[i][j].add(108)
b[i][j].add(76)
if f == 48:
b[i][j].add(111)
b[i][j].add(79)
if f == 95:
b[i][j].add(95)
if f<111:
b[i][j].add(48)
k = 0
for i in range(n):
d = 0
for j in range(len(a)):
if j < len(b[i]):
if ord(a[j]) not in b[i][j]:
d = 1
if len(a) != len(b[i]):
d = 1
if d == 0:
k = 1
if k == 0:
print('Yes')
else:
print('No') | if f<111: | 38 | decision |
a = input()
n = int(input())
b = [[] for i in range(n)]
d = []
for i in range(n):
c = input()
for j in range(len(c)):
b[i].append(set())
f = ord(c[j])
f2 = c[j]
if f >= 65 and f <= 90:
b[i][j].add(f)
f += 32
b[i][j].add(f)
elif f >= 97 and f <= 122:
b[i][j].add(f)
b[i][j].add(f - 32)
if f == 105:
b[i][j].add(49)
b[i][j].add(108)
b[i][j].add(76)
if f == 108:
b[i][j].add(49)
b[i][j].add(105)
b[i][j].add(73)
if f >= 48 and f <= 58:
b[i][j].add(f)
if f == 49:
b[i][j].add(105)
b[i][j].add(73)
b[i][j].add(108)
b[i][j].add(76)
if f == 48:
b[i][j].add(111)
b[i][j].add(79)
if f == 95:
b[i][j].add(95)
if f == 111:
b[i][j].add(48)
k = 0
for i in range(n):
d = 0
for j in range(len(a)):
if j < len(b[i]):
if ord(a[j]) not in b[i][j]:
d = 1
if len(a) != len(b[i]):
d = 1
if d == 0:
k = 1
if k == 0:
print('Yes')
else:
print('No') | a = input()
n = int(input())
b = [[] for i in range(n)]
d = []
for i in range(n):
c = input()
for j in range(len(c)):
b[i].append(set())
f = ord(c[j])
f2 = c[j]
if f >= 65 and f <= 90:
b[i][j].add(f)
f += 32
b[i][j].add(f)
elif f >= 97 and f <= 122:
b[i][j].add(y)
b[i][j].add(f - 32)
if f == 105:
b[i][j].add(49)
b[i][j].add(108)
b[i][j].add(76)
if f == 108:
b[i][j].add(49)
b[i][j].add(105)
b[i][j].add(73)
if f >= 48 and f <= 58:
b[i][j].add(f)
if f == 49:
b[i][j].add(105)
b[i][j].add(73)
b[i][j].add(108)
b[i][j].add(76)
if f == 48:
b[i][j].add(111)
b[i][j].add(79)
if f == 95:
b[i][j].add(95)
if f == 111:
b[i][j].add(48)
k = 0
for i in range(n):
d = 0
for j in range(len(a)):
if j < len(b[i]):
if ord(a[j]) not in b[i][j]:
d = 1
if len(a) != len(b[i]):
d = 1
if d == 0:
k = 1
if k == 0:
print('Yes')
else:
print('No') | b[i][j].add(y) | 16 | statement |
a = input()
n = int(input())
b = [[] for i in range(n)]
d = []
for i in range(n):
c = input()
for j in range(len(c)):
b[i].append(set())
f = ord(c[j])
f2 = c[j]
if f >= 65 and f <= 90:
b[i][j].add(f)
f += 32
b[i][j].add(f)
elif f >= 97 and f <= 122:
b[i][j].add(f)
b[i][j].add(f - 32)
if f == 105:
b[i][j].add(49)
b[i][j].add(108)
b[i][j].add(76)
if f == 108:
b[i][j].add(49)
b[i][j].add(105)
b[i][j].add(73)
if f >= 48 and f <= 58:
b[i][j].add(f)
if f == 49:
b[i][j].add(105)
b[i][j].add(73)
b[i][j].add(108)
b[i][j].add(76)
if f == 48:
b[i][j].add(111)
b[i][j].add(79)
if f == 95:
b[i][j].add(95)
if f == 111:
b[i][j].add(48)
k = 0
for i in range(n):
d = 0
for j in range(len(a)):
if j < len(b[i]):
if ord(a[j]) not in b[i][j]:
d = 1
if len(a) != len(b[i]):
d = 1
if d == 0:
k = 1
if k == 0:
print('Yes')
else:
print('No') | a = input()
n = int(input())
b = [[] for i in range(n)]
d = []
for i in range(n):
c = input()
for j in range(len(c)):
b[i].append(set())
f = ord(c[j])
f2 = c[j]
if f >= 65 and f <= 90:
b[i][j].add(f)
f += 32
b[i][j].add(f)
elif f >= 97 and f <= 122:
b[i][j].add(f)
b[i][j].add(f+32)
if f == 105:
b[i][j].add(49)
b[i][j].add(108)
b[i][j].add(76)
if f == 108:
b[i][j].add(49)
b[i][j].add(105)
b[i][j].add(73)
if f >= 48 and f <= 58:
b[i][j].add(f)
if f == 49:
b[i][j].add(105)
b[i][j].add(73)
b[i][j].add(108)
b[i][j].add(76)
if f == 48:
b[i][j].add(111)
b[i][j].add(79)
if f == 95:
b[i][j].add(95)
if f == 111:
b[i][j].add(48)
k = 0
for i in range(n):
d = 0
for j in range(len(a)):
if j < len(b[i]):
if ord(a[j]) not in b[i][j]:
d = 1
if len(a) != len(b[i]):
d = 1
if d == 0:
k = 1
if k == 0:
print('Yes')
else:
print('No') | b[i][j].add(f+32) | 17 | operation |
import itertools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
for j1 in range(0, len(myList1[j]) - 1):
if j1 == 0:
myXOR = myList1[j][j1] ^ myList1[j][j1 + 1]
else:
myXOR = myXOR ^ myList1[j][j1 + 1]
if myXOR > currentXOR:
currentXOR = myXOR
print(currentXOR) | import itertools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
for j1 in range(128, len(myList1[j]) - 1):
if j1 == 0:
myXOR = myList1[j][j1] ^ myList1[j][j1 + 1]
else:
myXOR = myXOR ^ myList1[j][j1 + 1]
if myXOR > currentXOR:
currentXOR = myXOR
print(currentXOR) | for j1 in range(128, len(myList1[j]) - 1): | 10 | value |
import itertools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
for j1 in range(0, len(myList1[j]) - 1):
if j1 == 0:
myXOR = myList1[j][j1] ^ myList1[j][j1 + 1]
else:
myXOR = myXOR ^ myList1[j][j1 + 1]
if myXOR > currentXOR:
currentXOR = myXOR
print(currentXOR) | import itertools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
for j1 in range(0, len(myList1[j]) - 1):
if j1 == 0:
myXOR = myList1[j][j1] ^ myList1[j][j1 + 1]
else:
myXOR = myXOR ^ myList1[j][j1&1]
if myXOR > currentXOR:
currentXOR = myXOR
print(currentXOR) | myXOR = myXOR ^ myList1[j][j1&1] | 14 | operation |
import itertools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
for j1 in range(0, len(myList1[j]) - 1):
if j1 == 0:
myXOR = myList1[j][j1] ^ myList1[j][j1 + 1]
else:
myXOR = myXOR ^ myList1[j][j1 + 1]
if myXOR > currentXOR:
currentXOR = myXOR
print(currentXOR) | import itertools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
for z in range(0, len(myList1[j]) - 1):
if j1 == 0:
myXOR = myList1[j][j1] ^ myList1[j][j1 + 1]
else:
myXOR = myXOR ^ myList1[j][j1 + 1]
if myXOR > currentXOR:
currentXOR = myXOR
print(currentXOR) | for z in range(0, len(myList1[j]) - 1): | 10 | statement |
import itertools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
for j1 in range(0, len(myList1[j]) - 1):
if j1 == 0:
myXOR = myList1[j][j1] ^ myList1[j][j1 + 1]
else:
myXOR = myXOR ^ myList1[j][j1 + 1]
if myXOR > currentXOR:
currentXOR = myXOR
print(currentXOR) | import itertools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
for j1 in range(0, len(myList1[j]) - 163):
if j1 == 0:
myXOR = myList1[j][j1] ^ myList1[j][j1 + 1]
else:
myXOR = myXOR ^ myList1[j][j1 + 1]
if myXOR > currentXOR:
currentXOR = myXOR
print(currentXOR) | for j1 in range(0, len(myList1[j]) - 163): | 10 | value |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.