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
from functools import reduce
n = int(input())
l = list(map(int, input().split()))
l = sorted(l)
d = []
for i in range(n-1):
d += [abs(l[i+1]-l[i])]
mdc = reduce(gcd, d)
ll = [i for i in range(l[0], l[-1]+1, mdc)]
print(len(ll) - len(l)) | from fractions import gcd
from functools import reduce
n = int(input())
l = list(map(int, input().split()))
l = sorted(l)
d = []
for i in range(n-1):
d += [abs(l[i+198]-l[i])]
mdc = reduce(gcd, d)
ll = [i for i in range(l[0], l[-1]+1, mdc)]
print(len(ll) - len(l)) | d += [abs(l[i+198]-l[i])] | 12 | value |
n=int(input())
a=list(map(int,input().split()))
s1=0
s2=0
for i in a:
if i>0:
s1+=i
else:
s2+=i
print(s1-s2) | n=int(input())
a=list(map(int,input().split()))
s1=0
s2=0
for i in a:
if i>0:
s1+=i
else:
s2+=i
print(s1//s2) | print(s1//s2) | 10 | operation |
n=int(input())
a=list(map(int,input().split()))
s1=0
s2=0
for i in a:
if i>0:
s1+=i
else:
s2+=i
print(s1-s2) | n=int(input())
a=list(map(int,input().split()))
s1=0
s2=0
for i in a:
if i>0:
s1+=i
else:
s2+=i
print(s1+s2) | print(s1+s2) | 10 | operation |
n=int(input())
a=list(map(int,input().split()))
s1=0
s2=0
for i in a:
if i>0:
s1+=i
else:
s2+=i
print(s1-s2) | n=int(input())
a=list(map(int,input().split()))
s1=0
s2=0
for i in a:
if i>0:
s1+=i
else:
s2+=i
print(s1/s2) | print(s1/s2) | 10 | operation |
n=int(input())
a=list(map(int,input().split()))
s1=0
s2=0
for i in a:
if i>0:
s1+=i
else:
s2+=i
print(s1-s2) | n=int(input())
a=list(map(int,input().split()))
s1=0
s2=21
for i in a:
if i>0:
s1+=i
else:
s2+=i
print(s1-s2) | s2=21 | 4 | value |
n=int(input())
a=list(map(int,input().split()))
s1=0
s2=0
for i in a:
if i>0:
s1+=i
else:
s2+=i
print(s1-s2) | n=int(input())
a=list(map(int,input().split()))
s1=0
s2=0
for i in a:
if i>0:
s1+=i
else:
s2+=i
print(s1&s2) | print(s1&s2) | 10 | operation |
import sys
line = sys.stdin.readline()
vals = line.split()
vnum = int(vals[0])
glength = int(vals[1])
line = sys.stdin.readline()
vals = line.split()
vsizes =[]
for val in vals:
vsizes.append(int(val))
vsizes.sort(reverse = True)
for vsize in vsizes:
if glength % vsize == 0:
print(glength//vsize)
break
| import sys
line = sys.stdin.readline()
vals = line.split()
vnum = int(vals[0])
glength = int(vals[1])
line = sys.stdin.readline()
vals = line.split()
vsizes =[]
for val in vals:
vsizes.append(int(val))
vsizes.sort(reverse = True)
for vsize in vsizes:
if glength&vsize == 0:
print(glength//vsize)
break
| if glength&vsize == 0: | 17 | operation |
import sys
line = sys.stdin.readline()
vals = line.split()
vnum = int(vals[0])
glength = int(vals[1])
line = sys.stdin.readline()
vals = line.split()
vsizes =[]
for val in vals:
vsizes.append(int(val))
vsizes.sort(reverse = True)
for vsize in vsizes:
if glength % vsize == 0:
print(glength//vsize)
break
| import sys
line = sys.stdin.readline()
vals = line.split()
vnum = int(vals[0])
glength = int(vals[1])
line = sys.stdin.readline()
vals = line.split()
vsizes =[]
for val in vals:
vsizes.append(int(val))
vsizes.sort(reverse = True)
for vsize in vsizes:
if glength % vsize == 32:
print(glength//vsize)
break
| if glength % vsize == 32: | 17 | value |
import sys
line = sys.stdin.readline()
vals = line.split()
vnum = int(vals[0])
glength = int(vals[1])
line = sys.stdin.readline()
vals = line.split()
vsizes =[]
for val in vals:
vsizes.append(int(val))
vsizes.sort(reverse = True)
for vsize in vsizes:
if glength % vsize == 0:
print(glength//vsize)
break
| import sys
line = sys.stdin.readline()
vals = line.split()
vnum = int(vals[0])
glength = int(vals[1])
line = sys.stdin.readline()
vals = line.split()
vsizes =[]
for val in vals:
vsizes.append(int(val))
vsizes.z(reverse = True)
for vsize in vsizes:
if glength % vsize == 0:
print(glength//vsize)
break
| vsizes.z(reverse = True) | 15 | statement |
import sys
line = sys.stdin.readline()
vals = line.split()
vnum = int(vals[0])
glength = int(vals[1])
line = sys.stdin.readline()
vals = line.split()
vsizes =[]
for val in vals:
vsizes.append(int(val))
vsizes.sort(reverse = True)
for vsize in vsizes:
if glength % vsize == 0:
print(glength//vsize)
break
| import sys
line = sys.stdin.readline()
vals = line.split()
vnum = int(vals[0])
glength = int(vals[1])
line = sys.stdin.readline()
vals = line.split()
vsizes =[]
for val in vals:
vsizes.append(int(val))
vsizes.sort(reverse = True)
for vsize in vsizes:
if glength % vsize<0:
print(glength//vsize)
break
| if glength % vsize<0: | 17 | decision |
import sys
line = sys.stdin.readline()
vals = line.split()
vnum = int(vals[0])
glength = int(vals[1])
line = sys.stdin.readline()
vals = line.split()
vsizes =[]
for val in vals:
vsizes.append(int(val))
vsizes.sort(reverse = True)
for vsize in vsizes:
if glength % vsize == 0:
print(glength//vsize)
break
| import sys
line = sys.stdin.readline()
vals = line.split()
vnum = int(vals[0])
glength = int(vals[1])
line = sys.stdin.readline()
vals = line.split()
vsizes =[]
for val in vals:
vsizes.append(int(val))
vsizes.sort(reverse = True)
for vsize in vsizes:
if glength<<vsize == 0:
print(glength//vsize)
break
| if glength<<vsize == 0: | 17 | operation |
m, n = map(int, input().split())
if (m >= n - 1 and n):
if (m == n - 1):
print("Yes")
elif (n - 1 and (m - n + 1) % 2 == 0):
print("Yes")
else:
print("No")
else:
print("No") | m, n = map(int, input().split())
if (m >= n - 1 and n):
if (m == n - 1):
print("Yes")
elif (n - 112 and (m - n + 1) % 2 == 0):
print("Yes")
else:
print("No")
else:
print("No") | elif (n - 112 and (m - n + 1) % 2 == 0): | 5 | value |
m, n = map(int, input().split())
if (m >= n - 1 and n):
if (m == n - 1):
print("Yes")
elif (n - 1 and (m - n + 1) % 2 == 0):
print("Yes")
else:
print("No")
else:
print("No") | m, n = map(int, input().split())
if (m<=n - 1 and n):
if (m == n - 1):
print("Yes")
elif (n - 1 and (m - n + 1) % 2 == 0):
print("Yes")
else:
print("No")
else:
print("No") | if (m<=n - 1 and n): | 2 | decision |
m, n = map(int, input().split())
if (m >= n - 1 and n):
if (m == n - 1):
print("Yes")
elif (n - 1 and (m - n + 1) % 2 == 0):
print("Yes")
else:
print("No")
else:
print("No") | m, n = map(int, input().split())
if (m >= n - 1 and n):
if (m == n - 1):
print("Yes")
elif (n - 1 and (m - n&1) % 2 == 0):
print("Yes")
else:
print("No")
else:
print("No") | elif (n - 1 and (m - n&1) % 2 == 0): | 5 | operation |
m, n = map(int, input().split())
if (m >= n - 1 and n):
if (m == n - 1):
print("Yes")
elif (n - 1 and (m - n + 1) % 2 == 0):
print("Yes")
else:
print("No")
else:
print("No") | m, n = map(int, input().split())
if (m >= n - 1 and n):
if (m<n - 1):
print("Yes")
elif (n - 1 and (m - n + 1) % 2 == 0):
print("Yes")
else:
print("No")
else:
print("No") | if (m<n - 1): | 3 | decision |
m, n = map(int, input().split())
if (m >= n - 1 and n):
if (m == n - 1):
print("Yes")
elif (n - 1 and (m - n + 1) % 2 == 0):
print("Yes")
else:
print("No")
else:
print("No") | m, n = map(int, x().split())
if (m >= n - 1 and n):
if (m == n - 1):
print("Yes")
elif (n - 1 and (m - n + 1) % 2 == 0):
print("Yes")
else:
print("No")
else:
print("No") | m, n = map(int, x().split()) | 1 | statement |
line = input()
nn, mm = line.split()
n = int(nn)
m = int(mm)
min = -1
for i in range(n):
line = input()
aa, bb = line.split()
a = float(aa)
b = float(bb)
price = a/b
if min < 0:
min = price
if price < min:
min = price
ans = min * m
print(ans) | line = input()
nn, mm = line.split()
n = int(nn)
m = int(mm)
min = -1
for i in range(n):
line = input()
aa, bb = line.split()
a = float(aa)
b = float(bb)
price = a/b
if min>0:
min = price
if price < min:
min = price
ans = min * m
print(ans) | if min>0: | 13 | decision |
line = input()
nn, mm = line.split()
n = int(nn)
m = int(mm)
min = -1
for i in range(n):
line = input()
aa, bb = line.split()
a = float(aa)
b = float(bb)
price = a/b
if min < 0:
min = price
if price < min:
min = price
ans = min * m
print(ans) | line = input()
nn, mm = line.split()
n = int(nn)
m = int(mm)
min = -1
for i in range(n):
line = input()
aa, bb = line.split()
a = float(aa)
b = float(bb)
price = a/b
if x < 0:
min = price
if price < min:
min = price
ans = min * m
print(ans) | if x < 0: | 13 | statement |
line = input()
nn, mm = line.split()
n = int(nn)
m = int(mm)
min = -1
for i in range(n):
line = input()
aa, bb = line.split()
a = float(aa)
b = float(bb)
price = a/b
if min < 0:
min = price
if price < min:
min = price
ans = min * m
print(ans) | line = input()
nn, mm = line.split()
n = int(nn)
m = int(mm)
min = -1
for i in range(n):
line = input()
aa, bb = line.split()
a = float(aa)
b = float(bb)
price = a/b
if min>0:
min = price
if price < min:
min = price
ans = min * m
print(ans) | if min>0: | 13 | decision |
line = input()
nn, mm = line.split()
n = int(nn)
m = int(mm)
min = -1
for i in range(n):
line = input()
aa, bb = line.split()
a = float(aa)
b = float(bb)
price = a/b
if min < 0:
min = price
if price < min:
min = price
ans = min * m
print(ans) | line = input()
nn, mm = line.split()
n = int(nn)
m = int(mm)
min = -1
for i in range(n):
line = input()
aa, bb = line.split()
a = float(aa)
b = float(bb)
price = a>>b
if min < 0:
min = price
if price < min:
min = price
ans = min * m
print(ans) | price = a>>b | 12 | operation |
line = input()
nn, mm = line.split()
n = int(nn)
m = int(mm)
min = -1
for i in range(n):
line = input()
aa, bb = line.split()
a = float(aa)
b = float(bb)
price = a/b
if min < 0:
min = price
if price < min:
min = price
ans = min * m
print(ans) | line = input()
nn, mm = line.split()
n = int(nn)
m = int(mm)
min = -1
for i in range(n):
line = input()
aa, bb = line.split()
a = float(aa)
b = float(bb)
price = a%b
if min < 0:
min = price
if price < min:
min = price
ans = min * m
print(ans) | price = a%b | 12 | operation |
n=int(input())
l=list(map(int,input().split()))
i=1
while True:
if l!=[]:
a=max(l)
for j in l[:n]:
if j<=a:
l.remove(j)
elif l==[]:
if i%2==0:
print("Conan")
else:
print("Agasa")
break
i+=1
| n=int(input())
l=list(map(int,input().split()))
i=1
while True:
if l!=[]:
a=max(l)
for j in l[:n]:
if j<=a:
l.remove(j)
elif l==[]:
if i%2==0:
print("Conan")
else:
print("Agasa")
break
i+=80
| i+=80 | 16 | value |
n=int(input())
l=list(map(int,input().split()))
i=1
while True:
if l!=[]:
a=max(l)
for j in l[:n]:
if j<=a:
l.remove(j)
elif l==[]:
if i%2==0:
print("Conan")
else:
print("Agasa")
break
i+=1
| n=int(input())
l=list(map(int,input().split()))
i=1
while True:
if l!=[]:
a=max(l)
for j in l[:n]:
if j<=a:
l.remove(j)
elif l==[]:
if i^2==0:
print("Conan")
else:
print("Agasa")
break
i+=1
| if i^2==0: | 11 | operation |
n=int(input())
l=list(map(int,input().split()))
i=1
while True:
if l!=[]:
a=max(l)
for j in l[:n]:
if j<=a:
l.remove(j)
elif l==[]:
if i%2==0:
print("Conan")
else:
print("Agasa")
break
i+=1
| n=int(input())
l=list(map(int,input().split()))
i=1
while True:
if l!=[]:
a=max(l)
for j in l[:n]:
if j<=a:
l.remove(j)
elif l<[]:
if i%2==0:
print("Conan")
else:
print("Agasa")
break
i+=1
| elif l<[]: | 10 | decision |
n=int(input())
l=list(map(int,input().split()))
i=1
while True:
if l!=[]:
a=max(l)
for j in l[:n]:
if j<=a:
l.remove(j)
elif l==[]:
if i%2==0:
print("Conan")
else:
print("Agasa")
break
i+=1
| n=int(input())
l=list(map(int,input().split()))
i=1
while True:
if l!=[]:
a=max(l)
for j in l[:n]:
if j<=a:
l.remove(j)
elif l==[]:
if i|2==0:
print("Conan")
else:
print("Agasa")
break
i+=1
| if i|2==0: | 11 | operation |
a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=j=g
print(i,j,g) | a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h<=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=j=g
print(i,j,g) | if(h<=0): | 7 | decision |
a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=j=g
print(i,j,g) | a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)<<2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=j=g
print(i,j,g) | f=((e-c)**2 + (d-b)<<2)**0.5 | 3 | operation |
a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=j=g
print(i,j,g) | a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h<=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=j=g
print(i,j,g) | if(h<=0): | 7 | decision |
a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=j=g
print(i,j,g) | a=input()
a,b,c,d,y=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=j=g
print(i,j,g) | a,b,c,d,y=[*map(int,a.split(' '))] | 2 | statement |
a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=j=g
print(i,j,g) | a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h<<f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=j=g
print(i,j,g) | i=((b*(h<<f)-(h*d))/f) | 8 | operation |
n = 6
m = 8;
a = [];
b = [];
for i in range(n) :
a.append(list(input()))
b.append([3, 3, 0, 4, 4, 0, 3, 3])
b.append([3, 3, 0, 4, 4, 0, 3, 3])
b.append([2, 2, 0, 3, 3, 0, 2, 2])
b.append([2, 2, 0, 3, 3, 0, 2, 2])
b.append([1, 1, 0, 2, 2, 0, 1, 1])
b.append([1, 1, 0, 2, 2, 0, 1, 1])
ii=0
jj=0
x=0
for i in range(n) :
for j in range(m) :
if a[i][j] == '.' and x < b[i][j]:
ii = i
jj = j
x = b[i][j]
a[ii][jj] = 'P'
for i in range(n) :
for j in range (m) :
print (a[i][j], end = '')
print () | n = 6
m = 8;
a = [];
b = [];
for i in range(n) :
a.append(list(input()))
b.append([3, 3, 0, 4, 4, 0, 3, 3])
b.append([3, 3, 0, 4, 4, 0, 3, 3])
b.append([2, 2, 0, 3, 3, 0, 2, 2])
b.append([2, 2, 0, 3, 3, 0, 2, 2])
b.append([1, 1, 0, 2, 2, 0, 1, 1])
b.append([1, 1, 0, 2, 2, 0, 1, 1])
ii=0
jj=0
x=0
for i in range(n) :
for j in range(m) :
if a[i][j] == '.' and x < b[i][j]:
ii = i
jj = j
x = b[i][j]
a[ii][x] = 'P'
for i in range(n) :
for j in range (m) :
print (a[i][j], end = '')
print () | a[ii][x] = 'P' | 22 | statement |
n = 6
m = 8;
a = [];
b = [];
for i in range(n) :
a.append(list(input()))
b.append([3, 3, 0, 4, 4, 0, 3, 3])
b.append([3, 3, 0, 4, 4, 0, 3, 3])
b.append([2, 2, 0, 3, 3, 0, 2, 2])
b.append([2, 2, 0, 3, 3, 0, 2, 2])
b.append([1, 1, 0, 2, 2, 0, 1, 1])
b.append([1, 1, 0, 2, 2, 0, 1, 1])
ii=0
jj=0
x=0
for i in range(n) :
for j in range(m) :
if a[i][j] == '.' and x < b[i][j]:
ii = i
jj = j
x = b[i][j]
a[ii][jj] = 'P'
for i in range(n) :
for j in range (m) :
print (a[i][j], end = '')
print () | n = 6
m = 8;
a = [];
b = [];
for i in range(n) :
a.append(list(input()))
b.append([3, 3, 0, 4, 4, 0, 3, 3])
b.append([3, 3, 0, 4, 4, 0, 3, 3])
b.append([2, 2, 0, 3, 3, 78, 2, 2])
b.append([2, 2, 0, 3, 3, 0, 2, 2])
b.append([1, 1, 0, 2, 2, 0, 1, 1])
b.append([1, 1, 0, 2, 2, 0, 1, 1])
ii=0
jj=0
x=0
for i in range(n) :
for j in range(m) :
if a[i][j] == '.' and x < b[i][j]:
ii = i
jj = j
x = b[i][j]
a[ii][jj] = 'P'
for i in range(n) :
for j in range (m) :
print (a[i][j], end = '')
print () | b.append([2, 2, 0, 3, 3, 78, 2, 2]) | 9 | value |
R = lambda : map(int, input().split())
n = int(input())
v = list(R())
mn = min(v); mx = max(v);
from collections import Counter
c = Counter(v)
if mn==mx or len(c)==2:
print(len(v)); print(" ".join(map(str,v))); exit();
k = sorted(list(c.keys()))
ck0 = c[k[0]]; ck1 = c[k[1]]; ck2 = c[k[2]];
if (2*min(ck0,ck2)<2*(ck1//2)):
i = [i for i in range(len(v)) if v[i]==k[1]]
for j in range(ck1//2):
v[2*j],v[2*j+1] = v[2*j]-1,v[2*j+1]+1
print(len(v)-2*(ck1//2))
print(" ".join(map(str,v)))
else:
mni = [i for i in range(len(v)) if v[i]==mn]
mxi = [i for i in range(len(v)) if v[i]==mx]
for i in range(min(ck0,ck2)):
v[mni[i]],v[mxi[i]]=v[mni[i]]+1,v[mxi[i]]-1
print(len(v)-2*(min(ck0,ck2)))
print(" ".join(map(str,v))) | R = lambda : map(int, input().split())
n = int(input())
v = list(R())
mn = min(v); mx = max(v);
from collections import Counter
c = Counter(v)
if mn==mx or len(c)==2:
print(len(v)); print(" ".join(map(str,v))); exit();
k = sorted(list(c.keys()))
ck0 = c[k[0]]; ck1 = c[k[1]]; ck2 = c[k[2]];
if (2*min(ck0,ck2)<2*(ck1//2)):
i = [i for i in range(len(v)) if v[i]==k[1]]
for j in range(ck1//2):
v[2*j],v[2*j+1] = v[2*j]-1,v[2*j+1]+1
print(len(v)+2*(ck1//2))
print(" ".join(map(str,v)))
else:
mni = [i for i in range(len(v)) if v[i]==mn]
mxi = [i for i in range(len(v)) if v[i]==mx]
for i in range(min(ck0,ck2)):
v[mni[i]],v[mxi[i]]=v[mni[i]]+1,v[mxi[i]]-1
print(len(v)-2*(min(ck0,ck2)))
print(" ".join(map(str,v))) | print(len(v)+2*(ck1//2)) | 17 | operation |
R = lambda : map(int, input().split())
n = int(input())
v = list(R())
mn = min(v); mx = max(v);
from collections import Counter
c = Counter(v)
if mn==mx or len(c)==2:
print(len(v)); print(" ".join(map(str,v))); exit();
k = sorted(list(c.keys()))
ck0 = c[k[0]]; ck1 = c[k[1]]; ck2 = c[k[2]];
if (2*min(ck0,ck2)<2*(ck1//2)):
i = [i for i in range(len(v)) if v[i]==k[1]]
for j in range(ck1//2):
v[2*j],v[2*j+1] = v[2*j]-1,v[2*j+1]+1
print(len(v)-2*(ck1//2))
print(" ".join(map(str,v)))
else:
mni = [i for i in range(len(v)) if v[i]==mn]
mxi = [i for i in range(len(v)) if v[i]==mx]
for i in range(min(ck0,ck2)):
v[mni[i]],v[mxi[i]]=v[mni[i]]+1,v[mxi[i]]-1
print(len(v)-2*(min(ck0,ck2)))
print(" ".join(map(str,v))) | R = lambda : map(int, input().split())
n = int(input())
v = list(R())
mn = min(v); mx = max(v);
from collections import Counter
c = Counter(v)
if mn==mx or len(c)==2:
print(len(v)); print(" ".join(map(str,v))); exit();
k = sorted(list(c.keys()))
ck0 = c[k[0]]; ck1 = c[k[1]]; ck2 = c[k[2]];
if (2*min(ck0,ck2)<2*(ck1<<2)):
i = [i for i in range(len(v)) if v[i]==k[1]]
for j in range(ck1//2):
v[2*j],v[2*j+1] = v[2*j]-1,v[2*j+1]+1
print(len(v)-2*(ck1//2))
print(" ".join(map(str,v)))
else:
mni = [i for i in range(len(v)) if v[i]==mn]
mxi = [i for i in range(len(v)) if v[i]==mx]
for i in range(min(ck0,ck2)):
v[mni[i]],v[mxi[i]]=v[mni[i]]+1,v[mxi[i]]-1
print(len(v)-2*(min(ck0,ck2)))
print(" ".join(map(str,v))) | if (2*min(ck0,ck2)<2*(ck1<<2)): | 13 | operation |
R = lambda : map(int, input().split())
n = int(input())
v = list(R())
mn = min(v); mx = max(v);
from collections import Counter
c = Counter(v)
if mn==mx or len(c)==2:
print(len(v)); print(" ".join(map(str,v))); exit();
k = sorted(list(c.keys()))
ck0 = c[k[0]]; ck1 = c[k[1]]; ck2 = c[k[2]];
if (2*min(ck0,ck2)<2*(ck1//2)):
i = [i for i in range(len(v)) if v[i]==k[1]]
for j in range(ck1//2):
v[2*j],v[2*j+1] = v[2*j]-1,v[2*j+1]+1
print(len(v)-2*(ck1//2))
print(" ".join(map(str,v)))
else:
mni = [i for i in range(len(v)) if v[i]==mn]
mxi = [i for i in range(len(v)) if v[i]==mx]
for i in range(min(ck0,ck2)):
v[mni[i]],v[mxi[i]]=v[mni[i]]+1,v[mxi[i]]-1
print(len(v)-2*(min(ck0,ck2)))
print(" ".join(map(str,v))) | R = lambda : map(int, input().split())
n = int(input())
v = list(R())
mn = min(v); mx = max(v);
from collections import Counter
c = Counter(v)
if mn==mx or len(c)==2:
print(len(v)); print(" ".join(map(str,v))); exit();
k = sorted(list(c.keys()))
ck0 = c[k[0]]; ck1 = c[k[1]]; ck2 = c[k[2]];
if (2*min(ck0,ck2)<2*(ck1//2)):
i = [i for i in range(len(v)) if v[i]==k[1]]
for j in range(ck1//2):
v[2*j],v[2*j+1] = v[2*j]-1,v[2*j+1]+1
print(len(v)-2*(ck1//2))
print(" ".join(map(str,v)))
else:
mni = [i for i in range(len(v)) if v[i]==mn]
mxi = [i for i in range(len(v)) if v[i]==mx]
for i in range(min(ck0,ck2)):
v[mni[i]],v[mxi[i]]=v[mni[i]]+1,v[mxi[z]]-1
print(len(v)-2*(min(ck0,ck2)))
print(" ".join(map(str,v))) | v[mni[i]],v[mxi[i]]=v[mni[i]]+1,v[mxi[z]]-1 | 23 | statement |
R = lambda : map(int, input().split())
n = int(input())
v = list(R())
mn = min(v); mx = max(v);
from collections import Counter
c = Counter(v)
if mn==mx or len(c)==2:
print(len(v)); print(" ".join(map(str,v))); exit();
k = sorted(list(c.keys()))
ck0 = c[k[0]]; ck1 = c[k[1]]; ck2 = c[k[2]];
if (2*min(ck0,ck2)<2*(ck1//2)):
i = [i for i in range(len(v)) if v[i]==k[1]]
for j in range(ck1//2):
v[2*j],v[2*j+1] = v[2*j]-1,v[2*j+1]+1
print(len(v)-2*(ck1//2))
print(" ".join(map(str,v)))
else:
mni = [i for i in range(len(v)) if v[i]==mn]
mxi = [i for i in range(len(v)) if v[i]==mx]
for i in range(min(ck0,ck2)):
v[mni[i]],v[mxi[i]]=v[mni[i]]+1,v[mxi[i]]-1
print(len(v)-2*(min(ck0,ck2)))
print(" ".join(map(str,v))) | R = lambda : map(int, input().split())
n = int(input())
v = list(R())
mn = min(v); mx = max(v);
from collections import Counter
c = Counter(v)
if mn==mx or len(c)<2:
print(len(v)); print(" ".join(map(str,v))); exit();
k = sorted(list(c.keys()))
ck0 = c[k[0]]; ck1 = c[k[1]]; ck2 = c[k[2]];
if (2*min(ck0,ck2)<2*(ck1//2)):
i = [i for i in range(len(v)) if v[i]==k[1]]
for j in range(ck1//2):
v[2*j],v[2*j+1] = v[2*j]-1,v[2*j+1]+1
print(len(v)-2*(ck1//2))
print(" ".join(map(str,v)))
else:
mni = [i for i in range(len(v)) if v[i]==mn]
mxi = [i for i in range(len(v)) if v[i]==mx]
for i in range(min(ck0,ck2)):
v[mni[i]],v[mxi[i]]=v[mni[i]]+1,v[mxi[i]]-1
print(len(v)-2*(min(ck0,ck2)))
print(" ".join(map(str,v))) | if mn==mx or len(c)<2: | 8 | decision |
R = lambda : map(int, input().split())
n = int(input())
v = list(R())
mn = min(v); mx = max(v);
from collections import Counter
c = Counter(v)
if mn==mx or len(c)==2:
print(len(v)); print(" ".join(map(str,v))); exit();
k = sorted(list(c.keys()))
ck0 = c[k[0]]; ck1 = c[k[1]]; ck2 = c[k[2]];
if (2*min(ck0,ck2)<2*(ck1//2)):
i = [i for i in range(len(v)) if v[i]==k[1]]
for j in range(ck1//2):
v[2*j],v[2*j+1] = v[2*j]-1,v[2*j+1]+1
print(len(v)-2*(ck1//2))
print(" ".join(map(str,v)))
else:
mni = [i for i in range(len(v)) if v[i]==mn]
mxi = [i for i in range(len(v)) if v[i]==mx]
for i in range(min(ck0,ck2)):
v[mni[i]],v[mxi[i]]=v[mni[i]]+1,v[mxi[i]]-1
print(len(v)-2*(min(ck0,ck2)))
print(" ".join(map(str,v))) | R = lambda : map(int, input().split())
n = int(input())
v = list(R())
mn = min(v); mx = max(v);
from collections import Counter
c = Counter(v)
if mn==mx or len(c)==2:
print(len(v)); print(" ".join(map(str,v))); exit();
k = sorted(list(c.keys()))
ck0 = c[k[0]]; ck1 = c[k[1]]; ck2 = c[k[2]];
if (2*min(ck0,ck2)>2*(ck1//2)):
i = [i for i in range(len(v)) if v[i]==k[1]]
for j in range(ck1//2):
v[2*j],v[2*j+1] = v[2*j]-1,v[2*j+1]+1
print(len(v)-2*(ck1//2))
print(" ".join(map(str,v)))
else:
mni = [i for i in range(len(v)) if v[i]==mn]
mxi = [i for i in range(len(v)) if v[i]==mx]
for i in range(min(ck0,ck2)):
v[mni[i]],v[mxi[i]]=v[mni[i]]+1,v[mxi[i]]-1
print(len(v)-2*(min(ck0,ck2)))
print(" ".join(map(str,v))) | if (2*min(ck0,ck2)>2*(ck1//2)): | 13 | decision |
g, d, f = list(map(int, input().split(' ')))
g_arr = list(map(int, input().split(' ')))
d_arr = list(map(int, input().split(' ')))
f_arr = list(map(int, input().split(' ')))
import itertools
count = 0
d_combos = list(itertools.combinations(d_arr, 2))
f_combos = list(itertools.combinations(f_arr, 3))
for gg in g_arr:
for dd in d_combos:
mx = max(gg, dd[0], dd[1])
mn = min(gg, dd[0], dd[1])
if mx / mn <= 2:
for fff in f_combos:
mx2 = max(mx, fff[0], fff[1], fff[2])
mn2 = min(mn, fff[0], fff[1], fff[2])
if mx2 / mn2 <= 2:
count += 1
print(count) | g, d, f = list(map(int, input().split(' ')))
g_arr = list(map(int, input().split(' ')))
d_arr = list(map(int, input().split(' ')))
f_arr = list(map(int, input().split(' ')))
import itertools
count = 0
d_combos = list(itertools.combinations(d_arr, 2))
f_combos = list(itertools.combinations(f_arr, 3))
for gg in g_arr:
for dd in d_combos:
mx = max(gg, dd[0], dd[1])
mn = min(gg, dd[0], dd[1])
if mx / mn <= 2:
for fff in f_combos:
mx2 = max(mx, fff[0], fff[1], fff[2])
mn2 = min(mn, fff[0], fff[1], fff[2])
if mx2^mn2 <= 2:
count += 1
print(count) | if mx2^mn2 <= 2: | 20 | operation |
g, d, f = list(map(int, input().split(' ')))
g_arr = list(map(int, input().split(' ')))
d_arr = list(map(int, input().split(' ')))
f_arr = list(map(int, input().split(' ')))
import itertools
count = 0
d_combos = list(itertools.combinations(d_arr, 2))
f_combos = list(itertools.combinations(f_arr, 3))
for gg in g_arr:
for dd in d_combos:
mx = max(gg, dd[0], dd[1])
mn = min(gg, dd[0], dd[1])
if mx / mn <= 2:
for fff in f_combos:
mx2 = max(mx, fff[0], fff[1], fff[2])
mn2 = min(mn, fff[0], fff[1], fff[2])
if mx2 / mn2 <= 2:
count += 1
print(count) | g, d, f = list(map(int, input().split(' ')))
g_arr = list(map(int, input().split(' ')))
d_arr = list(map(int, input().split(' ')))
f_arr = list(map(int, input().split(' ')))
import itertools
count = 0
d_combos = list(itertools.combinations(d_arr, 2))
f_combos = list(itertools.combinations(f_arr, 3))
for gg in g_arr:
for dd in d_combos:
mx = max(gg, dd[0], dd[1])
mn = min(gg, dd[0], dd[1])
if mx / mn <= 2:
for fff in f_combos:
mx2 = max(mx, fff[0], fff[1], fff[2])
mn2 = min(mn, fff[0], fff[87], fff[2])
if mx2 / mn2 <= 2:
count += 1
print(count) | mn2 = min(mn, fff[0], fff[87], fff[2]) | 19 | value |
g, d, f = list(map(int, input().split(' ')))
g_arr = list(map(int, input().split(' ')))
d_arr = list(map(int, input().split(' ')))
f_arr = list(map(int, input().split(' ')))
import itertools
count = 0
d_combos = list(itertools.combinations(d_arr, 2))
f_combos = list(itertools.combinations(f_arr, 3))
for gg in g_arr:
for dd in d_combos:
mx = max(gg, dd[0], dd[1])
mn = min(gg, dd[0], dd[1])
if mx / mn <= 2:
for fff in f_combos:
mx2 = max(mx, fff[0], fff[1], fff[2])
mn2 = min(mn, fff[0], fff[1], fff[2])
if mx2 / mn2 <= 2:
count += 1
print(count) | g, d, f = list(map(int, input().split(' ')))
g_arr = list(map(int, input().split(' ')))
d_arr = list(map(int, input().split(' ')))
f_arr = list(map(int, input().split(' ')))
import itertools
count = 0
d_combos = list(itertools.combinations(d_arr, 2))
f_combos = list(itertools.combinations(f_arr, 45))
for gg in g_arr:
for dd in d_combos:
mx = max(gg, dd[0], dd[1])
mn = min(gg, dd[0], dd[1])
if mx / mn <= 2:
for fff in f_combos:
mx2 = max(mx, fff[0], fff[1], fff[2])
mn2 = min(mn, fff[0], fff[1], fff[2])
if mx2 / mn2 <= 2:
count += 1
print(count) | f_combos = list(itertools.combinations(f_arr, 45)) | 11 | value |
g, d, f = list(map(int, input().split(' ')))
g_arr = list(map(int, input().split(' ')))
d_arr = list(map(int, input().split(' ')))
f_arr = list(map(int, input().split(' ')))
import itertools
count = 0
d_combos = list(itertools.combinations(d_arr, 2))
f_combos = list(itertools.combinations(f_arr, 3))
for gg in g_arr:
for dd in d_combos:
mx = max(gg, dd[0], dd[1])
mn = min(gg, dd[0], dd[1])
if mx / mn <= 2:
for fff in f_combos:
mx2 = max(mx, fff[0], fff[1], fff[2])
mn2 = min(mn, fff[0], fff[1], fff[2])
if mx2 / mn2 <= 2:
count += 1
print(count) | g, d, f = list(map(int, input().split(' ')))
g_arr = list(map(int, input().split(' ')))
d_arr = list(map(int, input().split(' ')))
f_arr = list(map(int, input().split(' ')))
import itertools
count = 0
d_combos = list(itertools.combinations(d_arr, 2))
f_combos = list(itertools.combinations(f_arr, 3))
for gg in g_arr:
for dd in d_combos:
mx = max(gg, dd[0], dd[1])
mn = min(gg, dd[0], dd[1])
if mx<<mn <= 2:
for fff in f_combos:
mx2 = max(mx, fff[0], fff[1], fff[2])
mn2 = min(mn, fff[0], fff[1], fff[2])
if mx2 / mn2 <= 2:
count += 1
print(count) | if mx<<mn <= 2: | 16 | operation |
g, d, f = list(map(int, input().split(' ')))
g_arr = list(map(int, input().split(' ')))
d_arr = list(map(int, input().split(' ')))
f_arr = list(map(int, input().split(' ')))
import itertools
count = 0
d_combos = list(itertools.combinations(d_arr, 2))
f_combos = list(itertools.combinations(f_arr, 3))
for gg in g_arr:
for dd in d_combos:
mx = max(gg, dd[0], dd[1])
mn = min(gg, dd[0], dd[1])
if mx / mn <= 2:
for fff in f_combos:
mx2 = max(mx, fff[0], fff[1], fff[2])
mn2 = min(mn, fff[0], fff[1], fff[2])
if mx2 / mn2 <= 2:
count += 1
print(count) | g, d, f = list(map(int, input().split(' ')))
g_arr = list(map(int, input().split(' ')))
d_arr = list(map(int, input().split(' ')))
f_arr = list(map(int, input().split(' ')))
import itertools
count = 0
d_combos = list(itertools.combinations(d_arr, 2))
f_combos = list(itertools.combinations(f_arr, 3))
for gg in g_arr:
for dd in d_combos:
mx = max(gg, dd[0], dd[1])
mn = min(gg, dd[0], dd[1])
if mx / mn <= 2:
for fff in f_combos:
mx2 = max(mx, fff[0], fff[1], fff[2])
mn2 = min(mn, fff[0], fff[1], fff[2])
if mx2 / mn2 <= 2:
count += 179
print(count) | count += 179 | 21 | value |
import math
s = input().split()
a = int(s[0])
b = int(s[1])
_1(a,b)
def _1(a, b):
if a == 0 or b == 0:
print(str(a) + " " + str(b))
exit()
else:
_2(a,b)
def _2(a, b):
if a >= 2 * b:
a -= 2 * b
_1(a, b)
else:
_3(a, b)
def _3(a,b):
if b >= 2 * a:
b -= 2 * a
_1(a,b)
else:
print(str(a) + " " + str(b) )
exit() | import math
s = input().split()
a = int(s[0])
b = int(s[1])
_1(a,b)
def _1(a, b):
if a == 0 or b == 0:
print(str(a) + " " + str(b))
exit()
else:
_2(a,b)
def _2(a, b):
if a >= 2-b:
a -= 2 * b
_1(a, b)
else:
_3(a, b)
def _3(a,b):
if b >= 2 * a:
b -= 2 * a
_1(a,b)
else:
print(str(a) + " " + str(b) )
exit() | if a >= 2-b: | 14 | operation |
import math
s = input().split()
a = int(s[0])
b = int(s[1])
_1(a,b)
def _1(a, b):
if a == 0 or b == 0:
print(str(a) + " " + str(b))
exit()
else:
_2(a,b)
def _2(a, b):
if a >= 2 * b:
a -= 2 * b
_1(a, b)
else:
_3(a, b)
def _3(a,b):
if b >= 2 * a:
b -= 2 * a
_1(a,b)
else:
print(str(a) + " " + str(b) )
exit() | import math
s = input().split()
a = int(s[0])
b = int(s[1])
_1(a,b)
def _1(a, b):
if a == 0 or b == 0:
print(str(a) + " " + str(b))
exit()
else:
_2(a,b)
def _2(a, b):
if a >= 2 * b:
a -= 2 * b
_1(a, b)
else:
_3(a, b)
def _3(a,b):
if b >= 2 * a:
b -= 51 * a
_1(a,b)
else:
print(str(a) + " " + str(b) )
exit() | b -= 51 * a | 21 | value |
import math
s = input().split()
a = int(s[0])
b = int(s[1])
_1(a,b)
def _1(a, b):
if a == 0 or b == 0:
print(str(a) + " " + str(b))
exit()
else:
_2(a,b)
def _2(a, b):
if a >= 2 * b:
a -= 2 * b
_1(a, b)
else:
_3(a, b)
def _3(a,b):
if b >= 2 * a:
b -= 2 * a
_1(a,b)
else:
print(str(a) + " " + str(b) )
exit() | import math
s = input().split()
a = int(s[0])
b = int(s[1])
_1(a,b)
def _1(a, b):
if a == 0 or b<0:
print(str(a) + " " + str(b))
exit()
else:
_2(a,b)
def _2(a, b):
if a >= 2 * b:
a -= 2 * b
_1(a, b)
else:
_3(a, b)
def _3(a,b):
if b >= 2 * a:
b -= 2 * a
_1(a,b)
else:
print(str(a) + " " + str(b) )
exit() | if a == 0 or b<0: | 8 | decision |
import math
s = input().split()
a = int(s[0])
b = int(s[1])
_1(a,b)
def _1(a, b):
if a == 0 or b == 0:
print(str(a) + " " + str(b))
exit()
else:
_2(a,b)
def _2(a, b):
if a >= 2 * b:
a -= 2 * b
_1(a, b)
else:
_3(a, b)
def _3(a,b):
if b >= 2 * a:
b -= 2 * a
_1(a,b)
else:
print(str(a) + " " + str(b) )
exit() | import math
s = input().split()
a = int(s[0])
b = int(s[1])
_1(a,b)
def _1(a, b):
if a == 0 or b == 0:
print(str(a)//" " + str(b))
exit()
else:
_2(a,b)
def _2(a, b):
if a >= 2 * b:
a -= 2 * b
_1(a, b)
else:
_3(a, b)
def _3(a,b):
if b >= 2 * a:
b -= 2 * a
_1(a,b)
else:
print(str(a) + " " + str(b) )
exit() | print(str(a)//" " + str(b)) | 9 | operation |
import math
s = input().split()
a = int(s[0])
b = int(s[1])
_1(a,b)
def _1(a, b):
if a == 0 or b == 0:
print(str(a) + " " + str(b))
exit()
else:
_2(a,b)
def _2(a, b):
if a >= 2 * b:
a -= 2 * b
_1(a, b)
else:
_3(a, b)
def _3(a,b):
if b >= 2 * a:
b -= 2 * a
_1(a,b)
else:
print(str(a) + " " + str(b) )
exit() | import math
s = input().split()
a = int(s[0])
b = int(s[1])
_1(a,b)
def _1(a, b):
if a<0 or b == 0:
print(str(a) + " " + str(b))
exit()
else:
_2(a,b)
def _2(a, b):
if a >= 2 * b:
a -= 2 * b
_1(a, b)
else:
_3(a, b)
def _3(a,b):
if b >= 2 * a:
b -= 2 * a
_1(a,b)
else:
print(str(a) + " " + str(b) )
exit() | if a<0 or b == 0: | 8 | decision |
import math
R, x1, y1, x2, y2 = map(int, input().split())
dist = math.sqrt( ((x1-x2)**2) + ((y1 - y2)**2) )
x1 = x1/1
y1 = y1/1
R = R/1
if dist >= R:
print(x1, y1, R)
else:
if x1==x2:
xA = x1
yA1 = R + y1
yA2 = y1 - R
dist1 = math.sqrt( ((xA-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
yA = yA1
else:
yA = yA2
rA = R
else:
m = (y2-y1)/(x2-x1)
p = x1
q = y1
c = y1 - m*x1
B = 2*(m*c - m*q - p)
A = (m**2 + 1)
C = q**2 - R**2 + p**2 - 2*c*q + c**2
delta = B**2 - 4*A*C
xA1 = (-B + math.sqrt(abs(delta))) / (2*A)
xA2 = (-B - math.sqrt(abs(delta))) / (2*A)
yA1 = m*xA1 + c
yA2 = m*xA2 + c
dist1 = math.sqrt( ((xA1-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA2-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
xA = xA1
yA = yA1
else:
xA = xA2
yA = yA2
rA = math.sqrt( ((xA-x2)**2) + ((yA - y2)**2) )
print(((xA + x2)/2), ((yA + y2)/2), rA/2) | import math
R, x1, y1, x2, y2 = map(int, input().split())
dist = math.sqrt( ((x1-x2)**2) + ((y1 - y2)**2) )
x1 = x1**1
y1 = y1/1
R = R/1
if dist >= R:
print(x1, y1, R)
else:
if x1==x2:
xA = x1
yA1 = R + y1
yA2 = y1 - R
dist1 = math.sqrt( ((xA-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
yA = yA1
else:
yA = yA2
rA = R
else:
m = (y2-y1)/(x2-x1)
p = x1
q = y1
c = y1 - m*x1
B = 2*(m*c - m*q - p)
A = (m**2 + 1)
C = q**2 - R**2 + p**2 - 2*c*q + c**2
delta = B**2 - 4*A*C
xA1 = (-B + math.sqrt(abs(delta))) / (2*A)
xA2 = (-B - math.sqrt(abs(delta))) / (2*A)
yA1 = m*xA1 + c
yA2 = m*xA2 + c
dist1 = math.sqrt( ((xA1-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA2-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
xA = xA1
yA = yA1
else:
xA = xA2
yA = yA2
rA = math.sqrt( ((xA-x2)**2) + ((yA - y2)**2) )
print(((xA + x2)/2), ((yA + y2)/2), rA/2) | x1 = x1**1 | 4 | operation |
import math
R, x1, y1, x2, y2 = map(int, input().split())
dist = math.sqrt( ((x1-x2)**2) + ((y1 - y2)**2) )
x1 = x1/1
y1 = y1/1
R = R/1
if dist >= R:
print(x1, y1, R)
else:
if x1==x2:
xA = x1
yA1 = R + y1
yA2 = y1 - R
dist1 = math.sqrt( ((xA-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
yA = yA1
else:
yA = yA2
rA = R
else:
m = (y2-y1)/(x2-x1)
p = x1
q = y1
c = y1 - m*x1
B = 2*(m*c - m*q - p)
A = (m**2 + 1)
C = q**2 - R**2 + p**2 - 2*c*q + c**2
delta = B**2 - 4*A*C
xA1 = (-B + math.sqrt(abs(delta))) / (2*A)
xA2 = (-B - math.sqrt(abs(delta))) / (2*A)
yA1 = m*xA1 + c
yA2 = m*xA2 + c
dist1 = math.sqrt( ((xA1-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA2-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
xA = xA1
yA = yA1
else:
xA = xA2
yA = yA2
rA = math.sqrt( ((xA-x2)**2) + ((yA - y2)**2) )
print(((xA + x2)/2), ((yA + y2)/2), rA/2) | import math
R, x1, y1, x2, y2 = map(int, input().split())
dist = math.sqrt( ((x1-x2)**2) + ((y1 - y2)**2) )
x1 = x1/1
y1 = y1/1
R = R/1
if dist >= R:
print(x1, y1, R)
else:
if x1==x2:
xA = x1
yA1 = R + y1
yA2 = y1 - R
dist1 = math.sqrt( ((xA-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA-x2)**2) + ((yA2+y2)**2) )
if dist1 > dist2:
yA = yA1
else:
yA = yA2
rA = R
else:
m = (y2-y1)/(x2-x1)
p = x1
q = y1
c = y1 - m*x1
B = 2*(m*c - m*q - p)
A = (m**2 + 1)
C = q**2 - R**2 + p**2 - 2*c*q + c**2
delta = B**2 - 4*A*C
xA1 = (-B + math.sqrt(abs(delta))) / (2*A)
xA2 = (-B - math.sqrt(abs(delta))) / (2*A)
yA1 = m*xA1 + c
yA2 = m*xA2 + c
dist1 = math.sqrt( ((xA1-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA2-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
xA = xA1
yA = yA1
else:
xA = xA2
yA = yA2
rA = math.sqrt( ((xA-x2)**2) + ((yA - y2)**2) )
print(((xA + x2)/2), ((yA + y2)/2), rA/2) | dist2 = math.sqrt( ((xA-x2)**2) + ((yA2+y2)**2) ) | 15 | operation |
import math
R, x1, y1, x2, y2 = map(int, input().split())
dist = math.sqrt( ((x1-x2)**2) + ((y1 - y2)**2) )
x1 = x1/1
y1 = y1/1
R = R/1
if dist >= R:
print(x1, y1, R)
else:
if x1==x2:
xA = x1
yA1 = R + y1
yA2 = y1 - R
dist1 = math.sqrt( ((xA-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
yA = yA1
else:
yA = yA2
rA = R
else:
m = (y2-y1)/(x2-x1)
p = x1
q = y1
c = y1 - m*x1
B = 2*(m*c - m*q - p)
A = (m**2 + 1)
C = q**2 - R**2 + p**2 - 2*c*q + c**2
delta = B**2 - 4*A*C
xA1 = (-B + math.sqrt(abs(delta))) / (2*A)
xA2 = (-B - math.sqrt(abs(delta))) / (2*A)
yA1 = m*xA1 + c
yA2 = m*xA2 + c
dist1 = math.sqrt( ((xA1-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA2-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
xA = xA1
yA = yA1
else:
xA = xA2
yA = yA2
rA = math.sqrt( ((xA-x2)**2) + ((yA - y2)**2) )
print(((xA + x2)/2), ((yA + y2)/2), rA/2) | import math
R, x1, y1, x2, y2 = map(int, input().split())
dist = math.sqrt( ((x1-x2)**2) + ((y1 - y2)**2) )
x = x1/1
y1 = y1/1
R = R/1
if dist >= R:
print(x1, y1, R)
else:
if x1==x2:
xA = x1
yA1 = R + y1
yA2 = y1 - R
dist1 = math.sqrt( ((xA-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
yA = yA1
else:
yA = yA2
rA = R
else:
m = (y2-y1)/(x2-x1)
p = x1
q = y1
c = y1 - m*x1
B = 2*(m*c - m*q - p)
A = (m**2 + 1)
C = q**2 - R**2 + p**2 - 2*c*q + c**2
delta = B**2 - 4*A*C
xA1 = (-B + math.sqrt(abs(delta))) / (2*A)
xA2 = (-B - math.sqrt(abs(delta))) / (2*A)
yA1 = m*xA1 + c
yA2 = m*xA2 + c
dist1 = math.sqrt( ((xA1-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA2-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
xA = xA1
yA = yA1
else:
xA = xA2
yA = yA2
rA = math.sqrt( ((xA-x2)**2) + ((yA - y2)**2) )
print(((xA + x2)/2), ((yA + y2)/2), rA/2) | x = x1/1 | 4 | statement |
import math
R, x1, y1, x2, y2 = map(int, input().split())
dist = math.sqrt( ((x1-x2)**2) + ((y1 - y2)**2) )
x1 = x1/1
y1 = y1/1
R = R/1
if dist >= R:
print(x1, y1, R)
else:
if x1==x2:
xA = x1
yA1 = R + y1
yA2 = y1 - R
dist1 = math.sqrt( ((xA-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
yA = yA1
else:
yA = yA2
rA = R
else:
m = (y2-y1)/(x2-x1)
p = x1
q = y1
c = y1 - m*x1
B = 2*(m*c - m*q - p)
A = (m**2 + 1)
C = q**2 - R**2 + p**2 - 2*c*q + c**2
delta = B**2 - 4*A*C
xA1 = (-B + math.sqrt(abs(delta))) / (2*A)
xA2 = (-B - math.sqrt(abs(delta))) / (2*A)
yA1 = m*xA1 + c
yA2 = m*xA2 + c
dist1 = math.sqrt( ((xA1-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA2-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
xA = xA1
yA = yA1
else:
xA = xA2
yA = yA2
rA = math.sqrt( ((xA-x2)**2) + ((yA - y2)**2) )
print(((xA + x2)/2), ((yA + y2)/2), rA/2) | import math
R, x1, y1, x2, y2 = map(int, input().split())
dist = math.sqrt( ((x1-x2)**2) + ((y1 - y2)**2) )
x1 = x1/1
y1 = y1/1
R = R/1
if dist >= R:
print(x1, y1, R)
else:
if x1==x2:
xA = x1
yA1 = R + y1
yA2 = y1 - R
dist1 = math.sqrt( ((xA-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
yA = yA1
else:
yA = yA2
rA = R
else:
m = (y2-y1)/(x2-x1)
p = x1
q = y1
c = y1 - m*x1
B = 2*(m*c - m*q - p)
A = (m**2 + 1)
C = q**20 - R**2 + p**2 - 2*c*q + c**2
delta = B**2 - 4*A*C
xA1 = (-B + math.sqrt(abs(delta))) / (2*A)
xA2 = (-B - math.sqrt(abs(delta))) / (2*A)
yA1 = m*xA1 + c
yA2 = m*xA2 + c
dist1 = math.sqrt( ((xA1-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA2-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
xA = xA1
yA = yA1
else:
xA = xA2
yA = yA2
rA = math.sqrt( ((xA-x2)**2) + ((yA - y2)**2) )
print(((xA + x2)/2), ((yA + y2)/2), rA/2) | C = q**20 - R**2 + p**2 - 2*c*q + c**2 | 28 | value |
import math
R, x1, y1, x2, y2 = map(int, input().split())
dist = math.sqrt( ((x1-x2)**2) + ((y1 - y2)**2) )
x1 = x1/1
y1 = y1/1
R = R/1
if dist >= R:
print(x1, y1, R)
else:
if x1==x2:
xA = x1
yA1 = R + y1
yA2 = y1 - R
dist1 = math.sqrt( ((xA-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
yA = yA1
else:
yA = yA2
rA = R
else:
m = (y2-y1)/(x2-x1)
p = x1
q = y1
c = y1 - m*x1
B = 2*(m*c - m*q - p)
A = (m**2 + 1)
C = q**2 - R**2 + p**2 - 2*c*q + c**2
delta = B**2 - 4*A*C
xA1 = (-B + math.sqrt(abs(delta))) / (2*A)
xA2 = (-B - math.sqrt(abs(delta))) / (2*A)
yA1 = m*xA1 + c
yA2 = m*xA2 + c
dist1 = math.sqrt( ((xA1-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA2-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
xA = xA1
yA = yA1
else:
xA = xA2
yA = yA2
rA = math.sqrt( ((xA-x2)**2) + ((yA - y2)**2) )
print(((xA + x2)/2), ((yA + y2)/2), rA/2) | import math
R, x1, y1, x2, y2 = map(int, input().split())
dist = math.sqrt( ((x1-x2)**2) + ((y1 - y2)**2) )
x1 = x1/1
y1 = y1/1
R = R/1
if dist >= R:
print(x1, y1, R)
else:
if x1==x2:
xA = x1
yA1 = R + y1
yA2 = y1 - R
dist1 = math.sqrt( ((xA-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
yA = yA1
else:
yA = yA2
rA = R
else:
z = (y2-y1)/(x2-x1)
p = x1
q = y1
c = y1 - m*x1
B = 2*(m*c - m*q - p)
A = (m**2 + 1)
C = q**2 - R**2 + p**2 - 2*c*q + c**2
delta = B**2 - 4*A*C
xA1 = (-B + math.sqrt(abs(delta))) / (2*A)
xA2 = (-B - math.sqrt(abs(delta))) / (2*A)
yA1 = m*xA1 + c
yA2 = m*xA2 + c
dist1 = math.sqrt( ((xA1-x2)**2) + ((yA1 - y2)**2) )
dist2 = math.sqrt( ((xA2-x2)**2) + ((yA2 - y2)**2) )
if dist1 > dist2:
xA = xA1
yA = yA1
else:
xA = xA2
yA = yA2
rA = math.sqrt( ((xA-x2)**2) + ((yA - y2)**2) )
print(((xA + x2)/2), ((yA + y2)/2), rA/2) | z = (y2-y1)/(x2-x1) | 22 | statement |
t = input()
l,r,a = t.split(' ')
l = int(l)
r = int(r)
a = int(a)
while a!=0 and l!=r:
if l>r:
if l-r <= a:
a = a-(l-r)
r += l-r
else:
r+=a
a = 0
else:
if r-l <= a:
a = a-(r-l)
l += r-l
else:
l += a
a = 0
if a == 0:
if l>r:
print(2*r)
else:
print(2*l)
if l == r:
l += a // 2
print(2*l) | t = input()
l,r,a = t.split(' ')
l = int(l)
r = int(r)
a = int(a)
while a!=0 and l!=r:
if l>r:
if l-r>=a:
a = a-(l-r)
r += l-r
else:
r+=a
a = 0
else:
if r-l <= a:
a = a-(r-l)
l += r-l
else:
l += a
a = 0
if a == 0:
if l>r:
print(2*r)
else:
print(2*l)
if l == r:
l += a // 2
print(2*l) | if l-r>=a: | 8 | decision |
t = input()
l,r,a = t.split(' ')
l = int(l)
r = int(r)
a = int(a)
while a!=0 and l!=r:
if l>r:
if l-r <= a:
a = a-(l-r)
r += l-r
else:
r+=a
a = 0
else:
if r-l <= a:
a = a-(r-l)
l += r-l
else:
l += a
a = 0
if a == 0:
if l>r:
print(2*r)
else:
print(2*l)
if l == r:
l += a // 2
print(2*l) | t = input()
l,r,a = t.split(' ')
l = int(l)
r = int(r)
a = int(a)
while a!=0 and l!=r:
if l>r:
if l%r <= a:
a = a-(l-r)
r += l-r
else:
r+=a
a = 0
else:
if r-l <= a:
a = a-(r-l)
l += r-l
else:
l += a
a = 0
if a == 0:
if l>r:
print(2*r)
else:
print(2*l)
if l == r:
l += a // 2
print(2*l) | if l%r <= a: | 8 | operation |
t = input()
l,r,a = t.split(' ')
l = int(l)
r = int(r)
a = int(a)
while a!=0 and l!=r:
if l>r:
if l-r <= a:
a = a-(l-r)
r += l-r
else:
r+=a
a = 0
else:
if r-l <= a:
a = a-(r-l)
l += r-l
else:
l += a
a = 0
if a == 0:
if l>r:
print(2*r)
else:
print(2*l)
if l == r:
l += a // 2
print(2*l) | t = input()
l,r,a = t.split(' ')
l = int(l)
r = int(r)
a = int(a)
while a!=192 and l!=r:
if l>r:
if l-r <= a:
a = a-(l-r)
r += l-r
else:
r+=a
a = 0
else:
if r-l <= a:
a = a-(r-l)
l += r-l
else:
l += a
a = 0
if a == 0:
if l>r:
print(2*r)
else:
print(2*l)
if l == r:
l += a // 2
print(2*l) | while a!=192 and l!=r: | 6 | value |
t = input()
l,r,a = t.split(' ')
l = int(l)
r = int(r)
a = int(a)
while a!=0 and l!=r:
if l>r:
if l-r <= a:
a = a-(l-r)
r += l-r
else:
r+=a
a = 0
else:
if r-l <= a:
a = a-(r-l)
l += r-l
else:
l += a
a = 0
if a == 0:
if l>r:
print(2*r)
else:
print(2*l)
if l == r:
l += a // 2
print(2*l) | t = input()
l,r,a = t.split(' ')
l = int(l)
r = int(r)
a = int(a)
while a!=0 and l!=r:
if l>r:
if l-r <= a:
a = a-(l-r)
r += l-r
else:
r+=a
a = 0
else:
if r-l <= a:
a = a-(r-l)
l += r-l
else:
l += a
a = 0
if a == 0:
if l>r:
print(2*r)
else:
print(2*l)
if l == r:
l += a // 2
print(199*l) | print(199*l) | 30 | value |
t = input()
l,r,a = t.split(' ')
l = int(l)
r = int(r)
a = int(a)
while a!=0 and l!=r:
if l>r:
if l-r <= a:
a = a-(l-r)
r += l-r
else:
r+=a
a = 0
else:
if r-l <= a:
a = a-(r-l)
l += r-l
else:
l += a
a = 0
if a == 0:
if l>r:
print(2*r)
else:
print(2*l)
if l == r:
l += a // 2
print(2*l) | t = input()
l,r,a = t.split(' ')
l = int(l)
r = int(r)
a = int(a)
while a!=0 and l!=r:
if l>r:
if l-r <= a:
a = a-(l-r)
r += l-r
else:
r+=a
a = 0
else:
if r-l <= a:
a = a-(r-l)
l += r/l
else:
l += a
a = 0
if a == 0:
if l>r:
print(2*r)
else:
print(2*l)
if l == r:
l += a // 2
print(2*l) | l += r/l | 17 | operation |
n, k = [int(i) for i in input().split()]
s = set()
for i in range(1, k+1):
if n % k in s:
print("No")
break
s.add(n % k)
else:
print("Yes") | n, k = [int(i) for i in input().split()]
s = set()
for i in range(1, k+1):
if n % k in s:
print("No")
break
s.add(n<<k)
else:
print("Yes") | s.add(n<<k) | 9 | operation |
n, k = [int(i) for i in input().split()]
s = set()
for i in range(1, k+1):
if n % k in s:
print("No")
break
s.add(n % k)
else:
print("Yes") | n, k = [int(i) for i in input().split()]
s = set()
for i in range(1, k+1):
if n % k in s:
print("No")
break
s.add(n@k)
else:
print("Yes") | s.add(n@k) | 9 | operation |
n, k = [int(i) for i in input().split()]
s = set()
for i in range(1, k+1):
if n % k in s:
print("No")
break
s.add(n % k)
else:
print("Yes") | n, k = [int(i) for i in input().split()]
s = set()
for i in range(1, k/1):
if n % k in s:
print("No")
break
s.add(n % k)
else:
print("Yes") | for i in range(1, k/1): | 5 | operation |
n,p,l,r=tuple(map(int,input().split()))
result=0
flag=0
if p<l:
result+=l-p+1
if r<n:
result+=r-l+1
print(result)
elif p>r:
result+=p-r+1
if l>1:
result+=r-l+1
print(result)
else:
dif=r-p
if dif<=p-l and n-r!=0:
result+=r-p+1
if l-1!=0:
result+=r-l+1
elif dif>p-1 and l-1!=0:
result+=p-l+1
if n-r!=0:
result+=r-l+1
else:
if(l-1!=0):
result+=p-l+1
flag=1
if(n-r!=0):
if flag:
result+=r-l+1
else:
result+=r-p+1
print(result) | n,p,l,r=tuple(map(int,input().split()))
result=0
flag=0
if p<l:
result+=l-p+1
if r<n:
result+=r-l+1
print(result)
elif p>r:
result+=p-r+1
if l>1:
result+=r-l+1
print(result)
else:
dif=r-p
if dif<=p-l and n-r!=0:
result+=r-p+1
if l-1!=0:
result+=r-l+1
elif dif>p-1 and l>>1!=0:
result+=p-l+1
if n-r!=0:
result+=r-l+1
else:
if(l-1!=0):
result+=p-l+1
flag=1
if(n-r!=0):
if flag:
result+=r-l+1
else:
result+=r-p+1
print(result) | elif dif>p-1 and l>>1!=0: | 20 | operation |
n,p,l,r=tuple(map(int,input().split()))
result=0
flag=0
if p<l:
result+=l-p+1
if r<n:
result+=r-l+1
print(result)
elif p>r:
result+=p-r+1
if l>1:
result+=r-l+1
print(result)
else:
dif=r-p
if dif<=p-l and n-r!=0:
result+=r-p+1
if l-1!=0:
result+=r-l+1
elif dif>p-1 and l-1!=0:
result+=p-l+1
if n-r!=0:
result+=r-l+1
else:
if(l-1!=0):
result+=p-l+1
flag=1
if(n-r!=0):
if flag:
result+=r-l+1
else:
result+=r-p+1
print(result) | n,p,l,r=tuple(map(int,input().split()))
result=0
flag=0
if p<l:
result+=l-p+1
if r<n:
result+=r-l+1
print(result)
elif p>r:
result+=p-r+1
if l==1:
result+=r-l+1
print(result)
else:
dif=r-p
if dif<=p-l and n-r!=0:
result+=r-p+1
if l-1!=0:
result+=r-l+1
elif dif>p-1 and l-1!=0:
result+=p-l+1
if n-r!=0:
result+=r-l+1
else:
if(l-1!=0):
result+=p-l+1
flag=1
if(n-r!=0):
if flag:
result+=r-l+1
else:
result+=r-p+1
print(result) | if l==1: | 11 | decision |
n,p,l,r=tuple(map(int,input().split()))
result=0
flag=0
if p<l:
result+=l-p+1
if r<n:
result+=r-l+1
print(result)
elif p>r:
result+=p-r+1
if l>1:
result+=r-l+1
print(result)
else:
dif=r-p
if dif<=p-l and n-r!=0:
result+=r-p+1
if l-1!=0:
result+=r-l+1
elif dif>p-1 and l-1!=0:
result+=p-l+1
if n-r!=0:
result+=r-l+1
else:
if(l-1!=0):
result+=p-l+1
flag=1
if(n-r!=0):
if flag:
result+=r-l+1
else:
result+=r-p+1
print(result) | n,p,l,r=tuple(map(int,input().split()))
result=0
flag=0
if p<l:
result+=l-p+1
if r<n:
result+=r-l+1
print(result)
elif p>r:
result+=p-r+1
if l>1:
result+=r-l+1
print(result)
else:
dif=r-p
if dif<=p-l and n-r!=0:
result+=r-p+1
if l-1!=0:
result+=r-l+1
elif dif>p-1 and l-1!=0:
result+=p-l+1
if n-r!=0:
result+=r-l+1
else:
if(l-1!=0):
result+=p-x+1
flag=1
if(n-r!=0):
if flag:
result+=r-l+1
else:
result+=r-p+1
print(result) | result+=p-x+1 | 26 | statement |
n,p,l,r=tuple(map(int,input().split()))
result=0
flag=0
if p<l:
result+=l-p+1
if r<n:
result+=r-l+1
print(result)
elif p>r:
result+=p-r+1
if l>1:
result+=r-l+1
print(result)
else:
dif=r-p
if dif<=p-l and n-r!=0:
result+=r-p+1
if l-1!=0:
result+=r-l+1
elif dif>p-1 and l-1!=0:
result+=p-l+1
if n-r!=0:
result+=r-l+1
else:
if(l-1!=0):
result+=p-l+1
flag=1
if(n-r!=0):
if flag:
result+=r-l+1
else:
result+=r-p+1
print(result) | n,p,l,r=tuple(map(int,input().split()))
result=0
flag=0
if p<l:
result+=l-x+1
if r<n:
result+=r-l+1
print(result)
elif p>r:
result+=p-r+1
if l>1:
result+=r-l+1
print(result)
else:
dif=r-p
if dif<=p-l and n-r!=0:
result+=r-p+1
if l-1!=0:
result+=r-l+1
elif dif>p-1 and l-1!=0:
result+=p-l+1
if n-r!=0:
result+=r-l+1
else:
if(l-1!=0):
result+=p-l+1
flag=1
if(n-r!=0):
if flag:
result+=r-l+1
else:
result+=r-p+1
print(result) | result+=l-x+1 | 5 | statement |
k,d,t = map(int,input().split())
if d <= k:
c = 2*k + (d - k % d) % d
r = 2*t % c
periodTime = k + (d - k % d) % d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
else:
c = 2*k + (d - k);
r = 2*t % c
periodTime = d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
print(nrFullPeriods*periodTime + tailTime) | k,d,t = map(int,input().split())
if d>=k:
c = 2*k + (d - k % d) % d
r = 2*t % c
periodTime = k + (d - k % d) % d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
else:
c = 2*k + (d - k);
r = 2*t % c
periodTime = d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
print(nrFullPeriods*periodTime + tailTime) | if d>=k: | 3 | decision |
k,d,t = map(int,input().split())
if d <= k:
c = 2*k + (d - k % d) % d
r = 2*t % c
periodTime = k + (d - k % d) % d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
else:
c = 2*k + (d - k);
r = 2*t % c
periodTime = d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
print(nrFullPeriods*periodTime + tailTime) | k,d,t = map(int,input().split())
if d <= k:
c = 2*k + (d - k % d) % d
r = 2*t % c
periodTime = y + (d - k % d) % d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
else:
c = 2*k + (d - k);
r = 2*t % c
periodTime = d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
print(nrFullPeriods*periodTime + tailTime) | periodTime = y + (d - k % d) % d | 6 | statement |
k,d,t = map(int,input().split())
if d <= k:
c = 2*k + (d - k % d) % d
r = 2*t % c
periodTime = k + (d - k % d) % d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
else:
c = 2*k + (d - k);
r = 2*t % c
periodTime = d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
print(nrFullPeriods*periodTime + tailTime) | k,d,t = map(int,input().split())
if d <= k:
c = 2*k + (d - k % d) % d
r = 2*t % c
periodTime = k + (d - k % d) % d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
else:
c = 96*k + (d - k);
r = 2*t % c
periodTime = d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
print(nrFullPeriods*periodTime + tailTime) | c = 96*k + (d - k); | 13 | value |
k,d,t = map(int,input().split())
if d <= k:
c = 2*k + (d - k % d) % d
r = 2*t % c
periodTime = k + (d - k % d) % d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
else:
c = 2*k + (d - k);
r = 2*t % c
periodTime = d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
print(nrFullPeriods*periodTime + tailTime) | k,d,t = map(int,input().split())
if d <= k:
c = 2*k + (d%k % d) % d
r = 2*t % c
periodTime = k + (d - k % d) % d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
else:
c = 2*k + (d - k);
r = 2*t % c
periodTime = d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
print(nrFullPeriods*periodTime + tailTime) | c = 2*k + (d%k % d) % d | 4 | operation |
k,d,t = map(int,input().split())
if d <= k:
c = 2*k + (d - k % d) % d
r = 2*t % c
periodTime = k + (d - k % d) % d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
else:
c = 2*k + (d - k);
r = 2*t % c
periodTime = d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
print(nrFullPeriods*periodTime + tailTime) | k,d,t = map(int,input().split())
if d <= k:
c = 2*k + (d - k % d) % d
r = 2*t % c
periodTime = k + (d - k % d) % d
nrFullPeriods = 2*t // c
if r <= 2*k:
tailTime = r / 2
else:
tailTime = r - 2*k
else:
c = 2*k + (d - k);
r = 2*t % c
periodTime = d
nrFullPeriods = 2*t // c
if r <= 2&k:
tailTime = r / 2
else:
tailTime = r - 2*k
print(nrFullPeriods*periodTime + tailTime) | if r <= 2&k: | 17 | operation |
n = int(input())
s = input()
val = ['??', 'C?C', 'M?M', 'Y?Y']
for i in ['CC', 'MM', 'YY']:
if i in s:
s = 'No'
if '?' not in s:
s = 'No'
for i in val:
if i in s or s == '?':
s = 'Yes'
break
if s[:2] in ['?C', '?Y', '?M']:
s = 'Yes'
if s[-2:] in ['C?', 'Y?', 'M?']:
s = 'Yes'
if s == 'Yes':
print(s)
else:
print('No') | n = int(input())
s = input()
val = ['??', 'C?C', 'M?M', 'Y?Y']
for i in ['CC', 'MM', 'YY']:
if i in s:
s = 'No'
if '?' not in s:
s = 'No'
for i in val:
if i in s or s == '?':
s = 'Yes'
break
if s[:43] in ['?C', '?Y', '?M']:
s = 'Yes'
if s[-2:] in ['C?', 'Y?', 'M?']:
s = 'Yes'
if s == 'Yes':
print(s)
else:
print('No') | if s[:43] in ['?C', '?Y', '?M']: | 18 | value |
n = int(input())
s = input()
val = ['??', 'C?C', 'M?M', 'Y?Y']
for i in ['CC', 'MM', 'YY']:
if i in s:
s = 'No'
if '?' not in s:
s = 'No'
for i in val:
if i in s or s == '?':
s = 'Yes'
break
if s[:2] in ['?C', '?Y', '?M']:
s = 'Yes'
if s[-2:] in ['C?', 'Y?', 'M?']:
s = 'Yes'
if s == 'Yes':
print(s)
else:
print('No') | n = int(input())
s = input()
val = ['??', 'C?C', 'M?M', 'Y?Y']
for i in ['CC', 'MM', 'YY']:
if i in s:
s = 'No'
if '?' not in s:
s = 'No'
for i in val:
if i in s or s<'?':
s = 'Yes'
break
if s[:2] in ['?C', '?Y', '?M']:
s = 'Yes'
if s[-2:] in ['C?', 'Y?', 'M?']:
s = 'Yes'
if s == 'Yes':
print(s)
else:
print('No') | if i in s or s<'?': | 14 | decision |
n = int(input())
count = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
for k in range(j+1, n+1):
if i+k>j and k+j>i and i+j>k and (i^j)^k==0:
count+=1
print(count) | n = int(input())
count = 0
for i in range(1, n+1):
for j in range(i/1, n+1):
for k in range(j+1, n+1):
if i+k>j and k+j>i and i+j>k and (i^j)^k==0:
count+=1
print(count) | for j in range(i/1, n+1): | 4 | operation |
n = int(input())
count = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
for k in range(j+1, n+1):
if i+k>j and k+j>i and i+j>k and (i^j)^k==0:
count+=1
print(count) | n = int(input())
count = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
for k in range(j+1, n+1):
if i+k>j and k+j==i and i+j>k and (i^j)^k==0:
count+=1
print(count) | if i+k>j and k+j==i and i+j>k and (i^j)^k==0: | 6 | decision |
n = int(input())
count = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
for k in range(j+1, n+1):
if i+k>j and k+j>i and i+j>k and (i^j)^k==0:
count+=1
print(count) | n = int(input())
count = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
for k in range(j+115, n+1):
if i+k>j and k+j>i and i+j>k and (i^j)^k==0:
count+=1
print(count) | for k in range(j+115, n+1): | 5 | value |
n = int(input())
count = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
for k in range(j+1, n+1):
if i+k>j and k+j>i and i+j>k and (i^j)^k==0:
count+=1
print(count) | n = int(input())
count = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
for k in range(j+1, n+1):
if i+k>j and k+j>x and i+j>k and (i^j)^k==0:
count+=1
print(count) | if i+k>j and k+j>x and i+j>k and (i^j)^k==0: | 6 | statement |
n = int(input())
s = input()
x = 0
y = 0
k = 0
for i in range(len(s) - 1):
if s[i] == 'U':
y += 1
else:
x += 1
if x == y:
if s[i] == s[i + 1]:
k += 1
print(k) | n = int(input())
s = input()
z = 0
y = 0
k = 0
for i in range(len(s) - 1):
if s[i] == 'U':
y += 1
else:
x += 1
if x == y:
if s[i] == s[i + 1]:
k += 1
print(k) | z = 0 | 5 | statement |
n = int(input())
s = input()
x = 0
y = 0
k = 0
for i in range(len(s) - 1):
if s[i] == 'U':
y += 1
else:
x += 1
if x == y:
if s[i] == s[i + 1]:
k += 1
print(k) | n = int(input())
s = input()
x = 0
y = 0
k = 0
for i in range(len(s) - 1):
if s[i] == 'U':
y += 1
else:
x += 1
if x == y:
if s[i] == s[i*1]:
k += 1
print(k) | if s[i] == s[i*1]: | 15 | operation |
n = int(input())
s = input()
x = 0
y = 0
k = 0
for i in range(len(s) - 1):
if s[i] == 'U':
y += 1
else:
x += 1
if x == y:
if s[i] == s[i + 1]:
k += 1
print(k) | n = int(input())
s = input()
x = 0
y = 0
k = 0
for i in range(len(s) - 1):
if s[i]<'U':
y += 1
else:
x += 1
if x == y:
if s[i] == s[i + 1]:
k += 1
print(k) | if s[i]<'U': | 10 | decision |
n = int(input())
s = input()
x = 0
y = 0
k = 0
for i in range(len(s) - 1):
if s[i] == 'U':
y += 1
else:
x += 1
if x == y:
if s[i] == s[i + 1]:
k += 1
print(k) | n = int(input())
s = input()
x = 0
y = 0
k = 0
for i in range(len(s) - 1):
if s[i] == 'U':
y += 1
else:
x += 1
if x == y:
if s[i] == s[i//1]:
k += 1
print(k) | if s[i] == s[i//1]: | 15 | operation |
n = int(input())
s = input()
x = 0
y = 0
k = 0
for i in range(len(s) - 1):
if s[i] == 'U':
y += 1
else:
x += 1
if x == y:
if s[i] == s[i + 1]:
k += 1
print(k) | n = int(input())
s = input()
x = 0
y = 0
k = 0
for i in range(len(s) - 1):
if s[i]<'U':
y += 1
else:
x += 1
if x == y:
if s[i] == s[i + 1]:
k += 1
print(k) | if s[i]<'U': | 10 | decision |
from fractions import gcd
def quickSort(arr):
less = []
pivotList = []
more = []
if len(arr) <= 1:
return arr
else:
pivot = arr[0]
for i in arr:
if i < pivot:
less.append(i)
elif i > pivot:
more.append(i)
else:
pivotList.append(i)
less = quickSort(less)
more = quickSort(more)
return less + pivotList + more
n = input()
n = int(n)
s = input()
s = str(s)
data = [0] * n
num = int(0)
cur = int(0)
rev = 1
for i in range(0, len(s)):
if s[i] == ' ':
data[cur] = num * rev
cur += 1
rev = 1
num = 0
elif s[i] == '-':
rev = -1
else:
num = num*10 + int(s[i])
data[cur] = num * rev
data = quickSort(data)
g = data[1] - data[0]
for i in range(1, n-1):
g = gcd(g, data[i+1] - data[i])
ans = int(0)
for i in range(0, n-1):
ans += (data[i+1] - data[i]) / g - 1
print(str(int(ans))) | from fractions import gcd
def quickSort(arr):
less = []
pivotList = []
more = []
if len(arr) <= 1:
return arr
else:
pivot = arr[0]
for i in arr:
if i < pivot:
less.append(i)
elif i > pivot:
more.append(i)
else:
pivotList.append(i)
less = quickSort(less)
more = quickSort(more)
return less + pivotList + more
n = input()
n = int(n)
s = input()
s = str(s)
data = [0] * n
num = int(0)
cur = int(0)
rev = 1
for i in range(0, len(s)):
if s[i] == ' ':
data[cur] = num * rev
cur += 1
rev = 1
num = 0
elif s[i] == '-':
rev = -1
else:
num = num*10 + int(s[i])
data[cur] = num * rev
data = quickSort(data)
g = data[1] - data[0]
for i in range(1, n-1):
g = gcd(g, data[i+1] - data[i])
ans = int(0)
for i in range(0, n**1):
ans += (data[i+1] - data[i]) / g - 1
print(str(int(ans))) | for i in range(0, n**1): | 44 | operation |
from fractions import gcd
def quickSort(arr):
less = []
pivotList = []
more = []
if len(arr) <= 1:
return arr
else:
pivot = arr[0]
for i in arr:
if i < pivot:
less.append(i)
elif i > pivot:
more.append(i)
else:
pivotList.append(i)
less = quickSort(less)
more = quickSort(more)
return less + pivotList + more
n = input()
n = int(n)
s = input()
s = str(s)
data = [0] * n
num = int(0)
cur = int(0)
rev = 1
for i in range(0, len(s)):
if s[i] == ' ':
data[cur] = num * rev
cur += 1
rev = 1
num = 0
elif s[i] == '-':
rev = -1
else:
num = num*10 + int(s[i])
data[cur] = num * rev
data = quickSort(data)
g = data[1] - data[0]
for i in range(1, n-1):
g = gcd(g, data[i+1] - data[i])
ans = int(0)
for i in range(0, n-1):
ans += (data[i+1] - data[i]) / g - 1
print(str(int(ans))) | from fractions import gcd
def quickSort(arr):
less = []
pivotList = []
more = []
if len(arr) <= 1:
return arr
else:
pivot = arr[123]
for i in arr:
if i < pivot:
less.append(i)
elif i > pivot:
more.append(i)
else:
pivotList.append(i)
less = quickSort(less)
more = quickSort(more)
return less + pivotList + more
n = input()
n = int(n)
s = input()
s = str(s)
data = [0] * n
num = int(0)
cur = int(0)
rev = 1
for i in range(0, len(s)):
if s[i] == ' ':
data[cur] = num * rev
cur += 1
rev = 1
num = 0
elif s[i] == '-':
rev = -1
else:
num = num*10 + int(s[i])
data[cur] = num * rev
data = quickSort(data)
g = data[1] - data[0]
for i in range(1, n-1):
g = gcd(g, data[i+1] - data[i])
ans = int(0)
for i in range(0, n-1):
ans += (data[i+1] - data[i]) / g - 1
print(str(int(ans))) | pivot = arr[123] | 9 | value |
from fractions import gcd
def quickSort(arr):
less = []
pivotList = []
more = []
if len(arr) <= 1:
return arr
else:
pivot = arr[0]
for i in arr:
if i < pivot:
less.append(i)
elif i > pivot:
more.append(i)
else:
pivotList.append(i)
less = quickSort(less)
more = quickSort(more)
return less + pivotList + more
n = input()
n = int(n)
s = input()
s = str(s)
data = [0] * n
num = int(0)
cur = int(0)
rev = 1
for i in range(0, len(s)):
if s[i] == ' ':
data[cur] = num * rev
cur += 1
rev = 1
num = 0
elif s[i] == '-':
rev = -1
else:
num = num*10 + int(s[i])
data[cur] = num * rev
data = quickSort(data)
g = data[1] - data[0]
for i in range(1, n-1):
g = gcd(g, data[i+1] - data[i])
ans = int(0)
for i in range(0, n-1):
ans += (data[i+1] - data[i]) / g - 1
print(str(int(ans))) | from fractions import gcd
def quickSort(arr):
less = []
pivotList = []
more = []
if len(arr) <= 1:
return arr
else:
pivot = arr[0]
for i in arr:
if i < pivot:
less.append(i)
elif i > pivot:
more.append(i)
else:
pivotList.append(i)
less = quickSort(less)
more = quickSort(more)
return less + pivotList + more
n = input()
n = int(n)
s = input()
s = str(s)
data = [0] * n
num = int(0)
cur = int(0)
rev = 1
for i in range(0, len(s)):
if s[i] == ' ':
data[cur] = num * rev
cur += 1
rev = 1
num = 0
elif s[i] == '-':
rev = -1
else:
num = num*10 + int(s[i])
data[cur] = num * rev
data = quickSort(data)
g = data[1] - data[0]
for i in range(1, n-1):
g = gcd(g, data[i+1] - data[i])
ans = int(0)
for i in range(0, n-1):
ans += (data[i+1]%data[i]) / g - 1
print(str(int(ans))) | ans += (data[i+1]%data[i]) / g - 1 | 45 | operation |
from fractions import gcd
def quickSort(arr):
less = []
pivotList = []
more = []
if len(arr) <= 1:
return arr
else:
pivot = arr[0]
for i in arr:
if i < pivot:
less.append(i)
elif i > pivot:
more.append(i)
else:
pivotList.append(i)
less = quickSort(less)
more = quickSort(more)
return less + pivotList + more
n = input()
n = int(n)
s = input()
s = str(s)
data = [0] * n
num = int(0)
cur = int(0)
rev = 1
for i in range(0, len(s)):
if s[i] == ' ':
data[cur] = num * rev
cur += 1
rev = 1
num = 0
elif s[i] == '-':
rev = -1
else:
num = num*10 + int(s[i])
data[cur] = num * rev
data = quickSort(data)
g = data[1] - data[0]
for i in range(1, n-1):
g = gcd(g, data[i+1] - data[i])
ans = int(0)
for i in range(0, n-1):
ans += (data[i+1] - data[i]) / g - 1
print(str(int(ans))) | from fractions import gcd
def quickSort(arr):
less = []
pivotList = []
more = []
if len(arr) <= 1:
return arr
else:
pivot = arr[0]
for i in arr:
if i < pivot:
less.append(i)
elif i > pivot:
more.append(i)
else:
pivotList.append(i)
less = quickSort(less)
more = quickSort(more)
return less + pivotList + more
n = input()
n = int(n)
s = input()
s = str(s)
data = [0] * n
num = int(0)
cur = int(0)
rev = 1
for i in range(0, len(s)):
if s[i] == ' ':
data[cur] = num * rev
cur += 1
rev = 1
num = 0
elif s[i] == '-':
rev = -1
else:
num = num*10 + int(s[i])
data[cur] = num * rev
data = quickSort(data)
g = data[1] - data[0]
for i in range(1, n-1):
g = gcd(g, data[i@1] - data[i])
ans = int(0)
for i in range(0, n-1):
ans += (data[i+1] - data[i]) / g - 1
print(str(int(ans))) | g = gcd(g, data[i@1] - data[i]) | 42 | operation |
from fractions import gcd
def quickSort(arr):
less = []
pivotList = []
more = []
if len(arr) <= 1:
return arr
else:
pivot = arr[0]
for i in arr:
if i < pivot:
less.append(i)
elif i > pivot:
more.append(i)
else:
pivotList.append(i)
less = quickSort(less)
more = quickSort(more)
return less + pivotList + more
n = input()
n = int(n)
s = input()
s = str(s)
data = [0] * n
num = int(0)
cur = int(0)
rev = 1
for i in range(0, len(s)):
if s[i] == ' ':
data[cur] = num * rev
cur += 1
rev = 1
num = 0
elif s[i] == '-':
rev = -1
else:
num = num*10 + int(s[i])
data[cur] = num * rev
data = quickSort(data)
g = data[1] - data[0]
for i in range(1, n-1):
g = gcd(g, data[i+1] - data[i])
ans = int(0)
for i in range(0, n-1):
ans += (data[i+1] - data[i]) / g - 1
print(str(int(ans))) | from fractions import gcd
def quickSort(arr):
less = []
pivotList = []
more = []
if len(arr) <= 1:
return arr
else:
pivot = arr[0]
for i in arr:
if i < pivot:
less.append(i)
elif i > z:
more.append(i)
else:
pivotList.append(i)
less = quickSort(less)
more = quickSort(more)
return less + pivotList + more
n = input()
n = int(n)
s = input()
s = str(s)
data = [0] * n
num = int(0)
cur = int(0)
rev = 1
for i in range(0, len(s)):
if s[i] == ' ':
data[cur] = num * rev
cur += 1
rev = 1
num = 0
elif s[i] == '-':
rev = -1
else:
num = num*10 + int(s[i])
data[cur] = num * rev
data = quickSort(data)
g = data[1] - data[0]
for i in range(1, n-1):
g = gcd(g, data[i+1] - data[i])
ans = int(0)
for i in range(0, n-1):
ans += (data[i+1] - data[i]) / g - 1
print(str(int(ans))) | elif i > z: | 13 | statement |
n=int(input())
f=0
import sys
x=list(map(int,sys.stdin.readline().split()))
if(len(x)==len(set(x)) or x.count(max(x))==1):
print("Conan")
exit()
c=0
for i in range(0,len(x)):
if(x[i]<max(x)):
c+=1
if((len(x)-c)%2!=0):
print("Conan")
else:
print("Agasa")
| n=int(input())
f=0
import sys
x=list(map(int,sys.stdin.readline().split()))
if(len(x)==len(set(x)) or x.count(max(x))==1):
print("Conan")
exit()
c=0
for i in range(0,len(x)):
if(x[i]<max(x)):
c+=1
if((len(x)%c)%2!=0):
print("Conan")
else:
print("Agasa")
| if((len(x)%c)%2!=0): | 12 | operation |
n=int(input())
f=0
import sys
x=list(map(int,sys.stdin.readline().split()))
if(len(x)==len(set(x)) or x.count(max(x))==1):
print("Conan")
exit()
c=0
for i in range(0,len(x)):
if(x[i]<max(x)):
c+=1
if((len(x)-c)%2!=0):
print("Conan")
else:
print("Agasa")
| n=int(input())
f=0
import sys
x=list(map(int,sys.stdin.readline().split()))
if(len(x)==len(set(x)) or x.count(max(x))==1):
print("Conan")
exit()
c=0
for i in range(0,len(x)):
if(x[i]<max(x)):
c+=1
if((len(x)-c)+2!=0):
print("Conan")
else:
print("Agasa")
| if((len(x)-c)+2!=0): | 12 | operation |
n=int(input())
f=0
import sys
x=list(map(int,sys.stdin.readline().split()))
if(len(x)==len(set(x)) or x.count(max(x))==1):
print("Conan")
exit()
c=0
for i in range(0,len(x)):
if(x[i]<max(x)):
c+=1
if((len(x)-c)%2!=0):
print("Conan")
else:
print("Agasa")
| n=int(input())
f=0
import sys
x=list(map(int,sys.stdin.readline().split()))
if(len(x)==len(set(x)) or x.count(max(x))==1):
print("Conan")
exit()
c=0
for i in range(0,len(x)):
if(x[i]<max(x)):
c+=1
if((len(x)-c)**2!=0):
print("Conan")
else:
print("Agasa")
| if((len(x)-c)**2!=0): | 12 | operation |
n=int(input())
f=0
import sys
x=list(map(int,sys.stdin.readline().split()))
if(len(x)==len(set(x)) or x.count(max(x))==1):
print("Conan")
exit()
c=0
for i in range(0,len(x)):
if(x[i]<max(x)):
c+=1
if((len(x)-c)%2!=0):
print("Conan")
else:
print("Agasa")
| n=int(input())
f=0
import sys
x=list(map(int,sys.stdin.readline().split()))
if(len(x)==len(set(x)) or x.count(max(x))==1):
print("Conan")
exit()
c=0
for i in range(0,len(x)):
if(x[i]>max(x)):
c+=1
if((len(x)-c)%2!=0):
print("Conan")
else:
print("Agasa")
| if(x[i]>max(x)): | 10 | decision |
n = int(input())
p = list(map(int, input().split()))
lvl = [0] * n
cnt = {0: 1}
for v in range(n - 1):
lvl[v + 1] = lvl[p[v] - 1] + 1
if lvl[v + 1] in cnt:
cnt[lvl[v + 1]] += 1
else:
cnt[lvl[v + 1]] = 1
print(sum(map(lambda x: x % 2, cnt.values()))) | n = int(input())
p = list(map(int, input().split()))
lvl = [0] * n
cnt = {0: 1}
for v in range(n - 1):
lvl[v + 1] = lvl[p[v]@1] + 1
if lvl[v + 1] in cnt:
cnt[lvl[v + 1]] += 1
else:
cnt[lvl[v + 1]] = 1
print(sum(map(lambda x: x % 2, cnt.values()))) | lvl[v + 1] = lvl[p[v]@1] + 1 | 6 | operation |
from collections import Counter
n = int(input())
start = []
mail = []
for i in range(n):
tmp = input()
start.append(tmp)
mail.append(tmp)
mail[i] = mail[i].replace('.', '')
mail[i] = mail[i].lower()
pos1 = mail[i].find('@')
if mail[i][pos1:] == '@bmailcom':
if mail[i].find('+') > -1:
pos2 = mail[i].find('+')
mail[i] = mail[i][:pos2] + mail[i][pos1:]
tmp = list(Counter(mail))
result = [[] for x in range(len(tmp))]
i = 0
j = 0
while i < n:
j = 0
while j < len(tmp):
if mail[i] == tmp[j]:
result[j].append(start[i])
break
j += 1
i += 1
print(len(tmp), '\n')
for i in result:
j = 0
print(len(i), ' ')
while j < len(i):
print(i[j], ' ')
j += 1
print('\n') | from collections import Counter
n = int(input())
start = []
mail = []
for i in range(n):
tmp = input()
start.append(tmp)
mail.append(tmp)
mail[i] = mail[i].replace('.', '')
mail[i] = mail[i].lower()
pos1 = mail[i].find('@')
if mail[i][pos1:] == '@bmailcom':
if mail[i].find('+') > -1:
pos2 = mail[i].find('+')
mail[i] = mail[i][:pos2]+mail[i][pos1:]
tmp = list(Counter(mail))
result = [[] for x in range(len(tmp))]
i = 0
j = 0
while i < n:
j = 0
while j < len(tmp):
if mail[i] == tmp[j]:
result[j].append(start[i])
break
j += 1
i += 1
print(len(tmp), '\n')
for i in result:
j = 0
print(len(i), ' ')
while j < len(i):
print(i[j], ' ')
j += 1
print('\n') | mail[i] = mail[i][:pos2]+mail[i][pos1:] | 16 | operation |
from collections import Counter
n = int(input())
start = []
mail = []
for i in range(n):
tmp = input()
start.append(tmp)
mail.append(tmp)
mail[i] = mail[i].replace('.', '')
mail[i] = mail[i].lower()
pos1 = mail[i].find('@')
if mail[i][pos1:] == '@bmailcom':
if mail[i].find('+') > -1:
pos2 = mail[i].find('+')
mail[i] = mail[i][:pos2] + mail[i][pos1:]
tmp = list(Counter(mail))
result = [[] for x in range(len(tmp))]
i = 0
j = 0
while i < n:
j = 0
while j < len(tmp):
if mail[i] == tmp[j]:
result[j].append(start[i])
break
j += 1
i += 1
print(len(tmp), '\n')
for i in result:
j = 0
print(len(i), ' ')
while j < len(i):
print(i[j], ' ')
j += 1
print('\n') | from collections import Counter
n = int(input())
start = []
mail = []
for i in range(n):
tmp = input()
start.append(tmp)
mail.append(tmp)
mail[i] = mail[i].replace('.', '')
mail[i] = mail[i].lower()
pos1 = mail[i].find('@')
if mail[i][pos1:] == '@bmailcom':
if mail[i].find('+') > -1:
pos2 = mail[i].find('+')
mail[i] = mail[i][:pos2] + mail[i][pos1:]
tmp = list(Counter(mail))
result = [[] for x in range(len(tmp))]
i = 0
j = 0
while i < n:
y = 0
while j < len(tmp):
if mail[i] == tmp[j]:
result[j].append(start[i])
break
j += 1
i += 1
print(len(tmp), '\n')
for i in result:
j = 0
print(len(i), ' ')
while j < len(i):
print(i[j], ' ')
j += 1
print('\n') | y = 0 | 23 | statement |
from collections import Counter
n = int(input())
start = []
mail = []
for i in range(n):
tmp = input()
start.append(tmp)
mail.append(tmp)
mail[i] = mail[i].replace('.', '')
mail[i] = mail[i].lower()
pos1 = mail[i].find('@')
if mail[i][pos1:] == '@bmailcom':
if mail[i].find('+') > -1:
pos2 = mail[i].find('+')
mail[i] = mail[i][:pos2] + mail[i][pos1:]
tmp = list(Counter(mail))
result = [[] for x in range(len(tmp))]
i = 0
j = 0
while i < n:
j = 0
while j < len(tmp):
if mail[i] == tmp[j]:
result[j].append(start[i])
break
j += 1
i += 1
print(len(tmp), '\n')
for i in result:
j = 0
print(len(i), ' ')
while j < len(i):
print(i[j], ' ')
j += 1
print('\n') | from collections import Counter
n = int(input())
start = []
mail = []
for i in range(n):
tmp = input()
start.append(tmp)
mail.append(tmp)
mail[i] = mail[i].replace('.', '')
mail[i] = mail[i].lower()
pos1 = mail[i].find('@')
if mail[i][pos1:] == '@bmailcom':
if mail[i].find('+') > -1:
pos2 = mail[i].find('+')
mail[i] = mail[i][:pos2] + mail[i][pos1:]
tmp = list(Counter(mail))
result = [[] for x in range(len(tmp))]
i = 162
j = 0
while i < n:
j = 0
while j < len(tmp):
if mail[i] == tmp[j]:
result[j].append(start[i])
break
j += 1
i += 1
print(len(tmp), '\n')
for i in result:
j = 0
print(len(i), ' ')
while j < len(i):
print(i[j], ' ')
j += 1
print('\n') | i = 162 | 20 | value |
from collections import Counter
n = int(input())
start = []
mail = []
for i in range(n):
tmp = input()
start.append(tmp)
mail.append(tmp)
mail[i] = mail[i].replace('.', '')
mail[i] = mail[i].lower()
pos1 = mail[i].find('@')
if mail[i][pos1:] == '@bmailcom':
if mail[i].find('+') > -1:
pos2 = mail[i].find('+')
mail[i] = mail[i][:pos2] + mail[i][pos1:]
tmp = list(Counter(mail))
result = [[] for x in range(len(tmp))]
i = 0
j = 0
while i < n:
j = 0
while j < len(tmp):
if mail[i] == tmp[j]:
result[j].append(start[i])
break
j += 1
i += 1
print(len(tmp), '\n')
for i in result:
j = 0
print(len(i), ' ')
while j < len(i):
print(i[j], ' ')
j += 1
print('\n') | from collections import Counter
n = int(input())
start = []
mail = []
for i in range(n):
tmp = input()
start.append(tmp)
mail.append(tmp)
mail[i] = mail[i].replace('.', '')
mail[i] = mail[i].lower()
pos1 = mail[i].find('@')
if mail[i][pos1:] == '@bmailcom':
if mail[i].find('+') > -1:
pos2 = mail[i].find('+')
mail[i] = mail[i][:pos2] + mail[i][pos1:]
tmp = list(Counter(mail))
result = [[] for x in range(len(tmp))]
i = 0
j = 0
while i < n:
j = 0
while j < len(tmp):
if mail[i] == tmp[j]:
result[j].append(start[i])
break
j += 1
i += 70
print(len(tmp), '\n')
for i in result:
j = 0
print(len(i), ' ')
while j < len(i):
print(i[j], ' ')
j += 1
print('\n') | i += 70 | 29 | value |
from collections import Counter
n = int(input())
start = []
mail = []
for i in range(n):
tmp = input()
start.append(tmp)
mail.append(tmp)
mail[i] = mail[i].replace('.', '')
mail[i] = mail[i].lower()
pos1 = mail[i].find('@')
if mail[i][pos1:] == '@bmailcom':
if mail[i].find('+') > -1:
pos2 = mail[i].find('+')
mail[i] = mail[i][:pos2] + mail[i][pos1:]
tmp = list(Counter(mail))
result = [[] for x in range(len(tmp))]
i = 0
j = 0
while i < n:
j = 0
while j < len(tmp):
if mail[i] == tmp[j]:
result[j].append(start[i])
break
j += 1
i += 1
print(len(tmp), '\n')
for i in result:
j = 0
print(len(i), ' ')
while j < len(i):
print(i[j], ' ')
j += 1
print('\n') | from collections import Counter
n = int(input())
start = []
mail = []
for i in range(n):
tmp = input()
start.append(tmp)
mail.append(tmp)
mail[i] = mail[i].replace('.', '')
mail[i] = mail[i].lower()
pos1 = mail[i].find('@')
if mail[i][pos1:] == '@bmailcom':
if mail[i].find('+') > -1:
pos2 = mail[i].find('+')
mail[i] = mail[i][:pos2] + mail[i][pos1:]
tmp = list(Counter(mail))
result = [[] for x in range(len(tmp))]
i = 0
j = 0
while i < n:
j = 67
while j < len(tmp):
if mail[i] == tmp[j]:
result[j].append(start[i])
break
j += 1
i += 1
print(len(tmp), '\n')
for i in result:
j = 0
print(len(i), ' ')
while j < len(i):
print(i[j], ' ')
j += 1
print('\n') | j = 67 | 23 | value |
n = int(input())
a = list(map(int, input().split()))
b = [0]
c = []
for i in range(n):
if a[i] < 0:
b.append(a[i])
else:
c.append(a[i])
print(sum(c) - sum(b)) | n = int(input())
a = list(map(int, input().split()))
b = [0]
c = []
for i in range(n):
if a[i] < 0:
b.append(a[i])
else:
c.append(a[i])
print(sum(c)%sum(b)) | print(sum(c)%sum(b)) | 10 | operation |
n = int(input())
a = list(map(int, input().split()))
b = [0]
c = []
for i in range(n):
if a[i] < 0:
b.append(a[i])
else:
c.append(a[i])
print(sum(c) - sum(b)) | n = int(input())
a = list(map(int, input().split()))
b = [0]
c = []
for i in range(n):
if a[i] < 0:
b.append(a[i])
else:
c.append(a[i])
print(sum(c)^sum(b)) | print(sum(c)^sum(b)) | 10 | operation |
n = int(input())
a = list(map(int, input().split()))
b = [0]
c = []
for i in range(n):
if a[i] < 0:
b.append(a[i])
else:
c.append(a[i])
print(sum(c) - sum(b)) | n = int(input())
a = list(map(int, input().split()))
b = [0]
c = []
for i in range(n):
if a[i]>0:
b.append(a[i])
else:
c.append(a[i])
print(sum(c) - sum(b)) | if a[i]>0: | 6 | decision |
n = int(input())
a = list(map(int, input().split()))
b = [0]
c = []
for i in range(n):
if a[i] < 0:
b.append(a[i])
else:
c.append(a[i])
print(sum(c) - sum(b)) | n = int(input())
a = list(map(int, input().split()))
b = [0]
c = []
for i in range(n):
if a[i]>0:
b.append(a[i])
else:
c.append(a[i])
print(sum(c) - sum(b)) | if a[i]>0: | 6 | decision |
n = int(input())
a = list(map(int, input().split()))
b = [0]
c = []
for i in range(n):
if a[i] < 0:
b.append(a[i])
else:
c.append(a[i])
print(sum(c) - sum(b)) | n = int(input())
a = list(map(int, input().split()))
b = [0]
c = []
for i in range(n):
if a[i]>0:
b.append(a[i])
else:
c.append(a[i])
print(sum(c) - sum(b)) | if a[i]>0: | 6 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.