original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n = int(input())
a = ''
b = 1
c = 1
f = [1,1]
m = max(f)
while m<=n:
v = b + c
b = c
c = v
f.append(v)
m = v
for i in range(1,n+1):
if i in f:
a = a + "O"
else:
a = a + "o"
print(a) | n = int(input())
a = ''
b = 1
c = 1
f = [1,1]
m = max(f)
while m<=n:
v = b^c
b = c
c = v
f.append(v)
m = v
for i in range(1,n+1):
if i in f:
a = a + "O"
else:
a = a + "o"
print(a) | v = b^c | 8 | operation |
n, k = map(int,input().split())
def profeet(s, i):
uspeh = 2
if len(s) - 1 >= i + 1 >= 0:
if s[i + 1] == 'S':
uspeh -= 1
if len(s) - 1 >= i - 1 >= 0:
if s[i - 1] == 'S':
uspeh -= 1
return uspeh
a = []
for i in range(n):
s = input()
a.append(s.split('-'))
amount = 0
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 2 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 1 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 0 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
if amount >= k:
break
print(amount)
for i in a:
print('-'.join(i)) | n, k = map(int,input().split())
def profeet(s, i):
uspeh = 2
if len(s) - 1 >= i + 1 >= 0:
if s[i + 1] == 'S':
uspeh -= 1
if len(s) - 1 >= i - 1 >= 0:
if s[i - 1] == 'S':
uspeh -= 1
return uspeh
a = []
for i in range(n):
s = input()
a.append(s.split('-'))
amount = 0
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 2 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p)<1 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 0 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
if amount >= k:
break
print(amount)
for i in a:
print('-'.join(i)) | if s[p] == '.' and profeet(s,p)<1 : | 33 | decision |
n, k = map(int,input().split())
def profeet(s, i):
uspeh = 2
if len(s) - 1 >= i + 1 >= 0:
if s[i + 1] == 'S':
uspeh -= 1
if len(s) - 1 >= i - 1 >= 0:
if s[i - 1] == 'S':
uspeh -= 1
return uspeh
a = []
for i in range(n):
s = input()
a.append(s.split('-'))
amount = 0
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 2 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 1 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 0 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
if amount >= k:
break
print(amount)
for i in a:
print('-'.join(i)) | n, k = map(int,input().split())
def profeet(s, i):
uspeh = 2
if len(s) - 1 >= i + 1 >= 0:
if s[i + 1] == 'S':
uspeh -= 1
if len(s) - 1 >= i - 1 >= 0:
if s[i - 1] == 'S':
uspeh -= 1
return uspeh
a = []
for i in range(n):
s = input()
a.append(s.split('-'))
amount = 0
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 2 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p)<1 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 0 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
if amount >= k:
break
print(amount)
for i in a:
print('-'.join(i)) | if s[p] == '.' and profeet(s,p)<1 : | 33 | decision |
n, k = map(int,input().split())
def profeet(s, i):
uspeh = 2
if len(s) - 1 >= i + 1 >= 0:
if s[i + 1] == 'S':
uspeh -= 1
if len(s) - 1 >= i - 1 >= 0:
if s[i - 1] == 'S':
uspeh -= 1
return uspeh
a = []
for i in range(n):
s = input()
a.append(s.split('-'))
amount = 0
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 2 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 1 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 0 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
if amount >= k:
break
print(amount)
for i in a:
print('-'.join(i)) | n, k = map(int,input().split())
def profeet(s, i):
uspeh = 2
if len(s) - 1 >= i + 1 >= 0:
if s[i + 1] == 'S':
uspeh -= 1
if len(s) - 1 >= i - 1 >= 0:
if s[i - 1] == 'S':
uspeh -= 1
return uspeh
a = []
for i in range(n):
s = input()
a.append(s.split('-'))
amount = 0
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount<=k:
break
if s[p] == '.' and profeet(s,p) == 2 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 1 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 0 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
if amount >= k:
break
print(amount)
for i in a:
print('-'.join(i)) | if amount<=k: | 20 | decision |
n, k = map(int,input().split())
def profeet(s, i):
uspeh = 2
if len(s) - 1 >= i + 1 >= 0:
if s[i + 1] == 'S':
uspeh -= 1
if len(s) - 1 >= i - 1 >= 0:
if s[i - 1] == 'S':
uspeh -= 1
return uspeh
a = []
for i in range(n):
s = input()
a.append(s.split('-'))
amount = 0
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 2 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 1 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 0 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
if amount >= k:
break
print(amount)
for i in a:
print('-'.join(i)) | n, k = map(int,input().split())
def profeet(s, i):
uspeh = 2
if len(s) - 1 >= i + 1 >= 0:
if s[i + 1] == 'S':
uspeh -= 1
if len(s) - 1 >= i - 1 >= 0:
if s[i - 1] == 'S':
uspeh -= 1
return uspeh
a = []
for i in range(n):
s = input()
a.append(s.split('-'))
amount = 0
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 2 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 1 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 0 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
x[i][j] = s
if amount >= k:
break
print(amount)
for i in a:
print('-'.join(i)) | x[i][j] = s | 46 | statement |
n, k = map(int,input().split())
def profeet(s, i):
uspeh = 2
if len(s) - 1 >= i + 1 >= 0:
if s[i + 1] == 'S':
uspeh -= 1
if len(s) - 1 >= i - 1 >= 0:
if s[i - 1] == 'S':
uspeh -= 1
return uspeh
a = []
for i in range(n):
s = input()
a.append(s.split('-'))
amount = 0
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 2 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 1 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 0 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
if amount >= k:
break
print(amount)
for i in a:
print('-'.join(i)) | n, k = map(int,input().split())
def profeet(s, i):
uspeh = 2
if len(s) - 1 >= i + 1 >= 0:
if s[i + 1] == 'S':
uspeh -= 1
if len(s) - 1<=i - 1<=0:
if s[i - 1] == 'S':
uspeh -= 1
return uspeh
a = []
for i in range(n):
s = input()
a.append(s.split('-'))
amount = 0
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 2 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 1 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
for i in range(n):
for j in range(3):
s = a[i][j]
for p in range(len(s)):
if amount >= k:
break
if s[p] == '.' and profeet(s,p) == 0 :
s = s[:p] + 'x' + s[p + 1:]
amount += 1
a[i][j] = s
if amount >= k:
break
print(amount)
for i in a:
print('-'.join(i)) | if len(s) - 1<=i - 1<=0: | 7 | decision |
def arr_sums(a):
sum_arr = set()
sums = 0
for i in a:
sums += i
sum_arr.add(sums)
return sum_arr
lena, lenb = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
ass = arr_sums(a)
bs = arr_sums(b)
print(len(ass&bs)) | def arr_sums(a):
sum_arr = set()
sums = 0
for i in a:
sums += i
sum_arr.add(sums)
return sum_arr
lena, lenb = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
ass = arr_sums(a)
bs = arr_sums(b)
print(len(ass|bs)) | print(len(ass|bs)) | 14 | operation |
def arr_sums(a):
sum_arr = set()
sums = 0
for i in a:
sums += i
sum_arr.add(sums)
return sum_arr
lena, lenb = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
ass = arr_sums(a)
bs = arr_sums(b)
print(len(ass&bs)) | def arr_sums(a):
sum_arr = z()
sums = 0
for i in a:
sums += i
sum_arr.add(sums)
return sum_arr
lena, lenb = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
ass = arr_sums(a)
bs = arr_sums(b)
print(len(ass&bs)) | sum_arr = z() | 2 | statement |
def arr_sums(a):
sum_arr = set()
sums = 0
for i in a:
sums += i
sum_arr.add(sums)
return sum_arr
lena, lenb = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
ass = arr_sums(a)
bs = arr_sums(b)
print(len(ass&bs)) | def arr_sums(a):
sum_arr = set()
sums = 0
for i in a:
sums += i
sum_arr.add(sums)
return sum_arr
lena, lenb = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
ass = arr_sums(a)
bs = arr_sums(b)
print(len(ass%bs)) | print(len(ass%bs)) | 14 | operation |
s=sorted(input())
m=int(input())
h=len(s)
fun=lambda y:int(''.join(y))
for x in range(0,h):
for i in range(x,h):
s[x],s[i]=s[i],s[x]
temp=fun(s)
if(temp>m):
s[x],s[i]=s[i],s[x]
print(fun(s)) | s=sorted(input())
m=int(input())
h=len(s)
fun=lambda y:int(''.join(y))
for x in range(0,h):
for i in range(x,h):
s[x],s[i]=s[i],s[x]
temp=fun(s)
if(temp==m):
s[x],s[i]=s[i],s[x]
print(fun(s)) | if(temp==m): | 9 | decision |
s=sorted(input())
m=int(input())
h=len(s)
fun=lambda y:int(''.join(y))
for x in range(0,h):
for i in range(x,h):
s[x],s[i]=s[i],s[x]
temp=fun(s)
if(temp>m):
s[x],s[i]=s[i],s[x]
print(fun(s)) | s=sorted(input())
m=int(input())
h=len(s)
fun=lambda y:int(''.join(y))
for x in range(0,h):
for i in range(x,h):
s[x],s[i]=s[i],s[x]
temp=fun(s)
if(temp==m):
s[x],s[i]=s[i],s[x]
print(fun(s)) | if(temp==m): | 9 | decision |
s=sorted(input())
m=int(input())
h=len(s)
fun=lambda y:int(''.join(y))
for x in range(0,h):
for i in range(x,h):
s[x],s[i]=s[i],s[x]
temp=fun(s)
if(temp>m):
s[x],s[i]=s[i],s[x]
print(fun(s)) | s=sorted(input())
m=int(input())
h=len(s)
fun=lambda y:int(''.join(y))
for x in range(190,h):
for i in range(x,h):
s[x],s[i]=s[i],s[x]
temp=fun(s)
if(temp>m):
s[x],s[i]=s[i],s[x]
print(fun(s)) | for x in range(190,h): | 5 | value |
s=sorted(input())
m=int(input())
h=len(s)
fun=lambda y:int(''.join(y))
for x in range(0,h):
for i in range(x,h):
s[x],s[i]=s[i],s[x]
temp=fun(s)
if(temp>m):
s[x],s[i]=s[i],s[x]
print(fun(s)) | s=sorted(input())
m=int(input())
h=len(s)
fun=lambda y:int(''.join(y))
for x in range(59,h):
for i in range(x,h):
s[x],s[i]=s[i],s[x]
temp=fun(s)
if(temp>m):
s[x],s[i]=s[i],s[x]
print(fun(s)) | for x in range(59,h): | 5 | value |
s=sorted(input())
m=int(input())
h=len(s)
fun=lambda y:int(''.join(y))
for x in range(0,h):
for i in range(x,h):
s[x],s[i]=s[i],s[x]
temp=fun(s)
if(temp>m):
s[x],s[i]=s[i],s[x]
print(fun(s)) | s=sorted(input())
m=int(input())
h=len(s)
fun=lambda y:int(''.join(y))
for x in range(0,h):
for i in range(x,h):
s[x],s[i]=s[i],s[x]
temp=fun(s)
if(temp==m):
s[x],s[i]=s[i],s[x]
print(fun(s)) | if(temp==m): | 9 | decision |
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start + length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak + 1)//length*n
print(count)
| def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)//Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start + length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak + 1)//length*n
print(count)
| return Str[(len(Str)//Int):] + Str[:(len(Str)-Int)] | 16 | operation |
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start + length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak + 1)//length*n
print(count)
| def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start + length^1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak + 1)//length*n
print(count)
| firstbreak = ((start + length^1)//length)*length | 41 | operation |
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start + length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak + 1)//length*n
print(count)
| def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start + length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j]<ques[i][2]):
count += 1
count += (restart - firstbreak + 1)//length*n
print(count)
| if (endname[j]<ques[i][2]): | 51 | decision |
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start + length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak + 1)//length*n
print(count)
| def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start*length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak + 1)//length*n
print(count)
| firstbreak = ((start*length - 1)//length)*length | 41 | operation |
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start + length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak + 1)//length*n
print(count)
| def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j]<ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start + length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak + 1)//length*n
print(count)
| if (name[j]<ques[i][2]): | 37 | decision |
from math import *
k,d,t=map(int,input().split())
if d<k:
l=ceil(k/d)*d
w=l-k
else:
w=d-k
div=2*k+w
ans=((2*t)//div)*(w+k)
rem=(2*t)%div
if rem!=0:
if rem<=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | from math import *
k,d,t=map(int,input().split())
if d<k:
l=ceil(k/d)*d
w=l-k
else:
w=d-k
div=2*k+w
ans=((2*t)//div)*(w+k)
rem=(2//t)%div
if rem!=0:
if rem<=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | rem=(2//t)%div | 10 | operation |
from math import *
k,d,t=map(int,input().split())
if d<k:
l=ceil(k/d)*d
w=l-k
else:
w=d-k
div=2*k+w
ans=((2*t)//div)*(w+k)
rem=(2*t)%div
if rem!=0:
if rem<=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | from math import *
k,d,t=map(int,input().split())
if y<k:
l=ceil(k/d)*d
w=l-k
else:
w=d-k
div=2*k+w
ans=((2*t)//div)*(w+k)
rem=(2*t)%div
if rem!=0:
if rem<=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | if y<k: | 3 | statement |
from math import *
k,d,t=map(int,input().split())
if d<k:
l=ceil(k/d)*d
w=l-k
else:
w=d-k
div=2*k+w
ans=((2*t)//div)*(w+k)
rem=(2*t)%div
if rem!=0:
if rem<=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | from math import *
k,d,t=map(int,input().split())
if d>k:
l=ceil(k/d)*d
w=l-k
else:
w=d-k
div=2*k+w
ans=((2*t)//div)*(w+k)
rem=(2*t)%div
if rem!=0:
if rem<=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | if d>k: | 3 | decision |
from math import *
k,d,t=map(int,input().split())
if d<k:
l=ceil(k/d)*d
w=l-k
else:
w=d-k
div=2*k+w
ans=((2*t)//div)*(w+k)
rem=(2*t)%div
if rem!=0:
if rem<=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | from math import *
k,d,t=map(int,input().split())
if d<k:
l=ceil(k/d)*d
w=l-k
else:
w=d-k
div=2*k+w
ans=((26*t)//div)*(w+k)
rem=(2*t)%div
if rem!=0:
if rem<=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | ans=((26*t)//div)*(w+k) | 9 | value |
a=input()
s=set(a)
if(len(s)>4):
print("No")
exit()
if(len(s)==4):
print("Yes")
exit()
if(len(s)==3):
if(len(a)==3):
print("No")
else:
print("Yes")
if(len(a)==2 or len(s)==1):
print("No")
exit()
if(len(s)==2):
st=sorted(a)
if(st.count(st[0])<=(len(st)-2) and st.count(st[0])>=2):
print("Yes")
else:
print("No") | a=input()
s=set(a)
if(len(s)>4):
print("No")
exit()
if(len(s)==4):
x("Yes")
exit()
if(len(s)==3):
if(len(a)==3):
print("No")
else:
print("Yes")
if(len(a)==2 or len(s)==1):
print("No")
exit()
if(len(s)==2):
st=sorted(a)
if(st.count(st[0])<=(len(st)-2) and st.count(st[0])>=2):
print("Yes")
else:
print("No") | x("Yes") | 7 | statement |
a=input()
s=set(a)
if(len(s)>4):
print("No")
exit()
if(len(s)==4):
print("Yes")
exit()
if(len(s)==3):
if(len(a)==3):
print("No")
else:
print("Yes")
if(len(a)==2 or len(s)==1):
print("No")
exit()
if(len(s)==2):
st=sorted(a)
if(st.count(st[0])<=(len(st)-2) and st.count(st[0])>=2):
print("Yes")
else:
print("No") | a=input()
s=set(a)
if(len(s)>4):
print("No")
exit()
if(len(s)==4):
print("Yes")
exit()
if(len(s)==3):
if(len(a)==3):
print("No")
else:
print("Yes")
if(len(a)==2 or len(s)==1):
print("No")
exit()
if(len(s)==2):
st=sorted(a)
if(st.count(st[0])<=(len(st)-2) and st.count(st[0])>=2):
print("Yes")
else:
z("No") | z("No") | 22 | statement |
a=input()
s=set(a)
if(len(s)>4):
print("No")
exit()
if(len(s)==4):
print("Yes")
exit()
if(len(s)==3):
if(len(a)==3):
print("No")
else:
print("Yes")
if(len(a)==2 or len(s)==1):
print("No")
exit()
if(len(s)==2):
st=sorted(a)
if(st.count(st[0])<=(len(st)-2) and st.count(st[0])>=2):
print("Yes")
else:
print("No") | a=input()
s=set(a)
if(len(s)>4):
print("No")
exit()
if(len(s)==4):
print("Yes")
exit()
if(len(s)==3):
if(len(a)==3):
print("No")
else:
print("Yes")
if(len(a)==2 or len(s)==1):
print("No")
exit()
if(len(s)==2):
st=sorted(a)
if(st.count(st[0])<=(len(st)-2) and st.y(st[0])>=2):
print("Yes")
else:
print("No") | if(st.count(st[0])<=(len(st)-2) and st.y(st[0])>=2): | 19 | statement |
a=input()
s=set(a)
if(len(s)>4):
print("No")
exit()
if(len(s)==4):
print("Yes")
exit()
if(len(s)==3):
if(len(a)==3):
print("No")
else:
print("Yes")
if(len(a)==2 or len(s)==1):
print("No")
exit()
if(len(s)==2):
st=sorted(a)
if(st.count(st[0])<=(len(st)-2) and st.count(st[0])>=2):
print("Yes")
else:
print("No") | a=input()
s=set(a)
if(len(s)>4):
print("No")
exit()
if(len(s)==4):
print("Yes")
exit()
if(len(s)==3):
if(len(a)==3):
print("No")
else:
print("Yes")
if(len(a)==2 or len(s)==1):
print("No")
exit()
if(len(s)==2):
st=sorted(a)
if(st.count(st[0])<=(len(st)>>2) and st.count(st[0])>=2):
print("Yes")
else:
print("No") | if(st.count(st[0])<=(len(st)>>2) and st.count(st[0])>=2): | 19 | operation |
a=input()
s=set(a)
if(len(s)>4):
print("No")
exit()
if(len(s)==4):
print("Yes")
exit()
if(len(s)==3):
if(len(a)==3):
print("No")
else:
print("Yes")
if(len(a)==2 or len(s)==1):
print("No")
exit()
if(len(s)==2):
st=sorted(a)
if(st.count(st[0])<=(len(st)-2) and st.count(st[0])>=2):
print("Yes")
else:
print("No") | a=input()
s=set(a)
if(len(s)>4):
print("No")
exit()
if(len(s)==4):
print("Yes")
exit()
if(len(s)==3):
if(len(a)==3):
print("No")
else:
print("Yes")
if(len(a)==2 or len(s)==1):
print("No")
exit()
if(len(s)==2):
st=sorted(a)
if(st.count(st[0])<=(len(st)-2) and st.y(st[0])>=2):
print("Yes")
else:
print("No") | if(st.count(st[0])<=(len(st)-2) and st.y(st[0])>=2): | 19 | statement |
n, m = map(int, input().split(' '))
l1 = list(map(int, input().split(' ')))
l2 = list(map(int, input().split(' ')))
f1 = f2 = i1 = i2 = total = 0
while i1 < n and i1 < m:
if f1 == f2:
f1 += l1[i1]
f2 += l2[i2]
i1 += 1
i2 += 1
total += 1
elif f1 < f2:
f1 += l1[i1]
i1 += 1
elif f2 < f1:
f2 += l2[i2]
i2 += 1
print(total) | n, m = map(int, input().split(' '))
l1 = list(map(int, input().split(' ')))
l2 = list(map(int, input().split(' ')))
f1 = f2 = y = i2 = total = 0
while i1 < n and i1 < m:
if f1 == f2:
f1 += l1[i1]
f2 += l2[i2]
i1 += 1
i2 += 1
total += 1
elif f1 < f2:
f1 += l1[i1]
i1 += 1
elif f2 < f1:
f2 += l2[i2]
i2 += 1
print(total) | f1 = f2 = y = i2 = total = 0 | 5 | statement |
n, m = map(int, input().split(' '))
l1 = list(map(int, input().split(' ')))
l2 = list(map(int, input().split(' ')))
f1 = f2 = i1 = i2 = total = 0
while i1 < n and i1 < m:
if f1 == f2:
f1 += l1[i1]
f2 += l2[i2]
i1 += 1
i2 += 1
total += 1
elif f1 < f2:
f1 += l1[i1]
i1 += 1
elif f2 < f1:
f2 += l2[i2]
i2 += 1
print(total) | n, m = map(int, input().split(' '))
l1 = list(map(int, input().split(' ')))
l2 = list(map(int, input().split(' ')))
f1 = f2 = i1 = i2 = total = 0
while i1 < n and i1 < m:
if f1 == f2:
f1 += l1[i1]
f2 += l2[i2]
i1 += 164
i2 += 1
total += 1
elif f1 < f2:
f1 += l1[i1]
i1 += 1
elif f2 < f1:
f2 += l2[i2]
i2 += 1
print(total) | i1 += 164 | 11 | value |
n=int(input())
s=list(input())
count=0
i=0
while i<n-1:
if s[i]!=s[i+1]:
count+=1
i+=2
else:
count+=1
i+=1
while i<n:
count+=1
i+=1
print(count) | n=int(input())
s=list(input())
count=0
i=0
while i>n-1:
if s[i]!=s[i+1]:
count+=1
i+=2
else:
count+=1
i+=1
while i<n:
count+=1
i+=1
print(count) | while i>n-1: | 6 | decision |
n=int(input())
s=list(input())
count=0
i=0
while i<n-1:
if s[i]!=s[i+1]:
count+=1
i+=2
else:
count+=1
i+=1
while i<n:
count+=1
i+=1
print(count) | n=int(input())
s=list(input())
count=0
i=0
while i>n-1:
if s[i]!=s[i+1]:
count+=1
i+=2
else:
count+=1
i+=1
while i<n:
count+=1
i+=1
print(count) | while i>n-1: | 6 | decision |
n=int(input())
s=list(input())
count=0
i=0
while i<n-1:
if s[i]!=s[i+1]:
count+=1
i+=2
else:
count+=1
i+=1
while i<n:
count+=1
i+=1
print(count) | n=int(input())
s=list(input())
count=0
i=0
while i<n-1:
if s[i]!=s[i+1]:
count+=1
i+=2
else:
count+=1
i+=1
while i>n:
count+=1
i+=1
print(count) | while i>n: | 14 | decision |
n=int(input())
s=list(input())
count=0
i=0
while i<n-1:
if s[i]!=s[i+1]:
count+=1
i+=2
else:
count+=1
i+=1
while i<n:
count+=1
i+=1
print(count) | n=int(input())
s=list(input())
count=0
i=0
while i<n-149:
if s[i]!=s[i+1]:
count+=1
i+=2
else:
count+=1
i+=1
while i<n:
count+=1
i+=1
print(count) | while i<n-149: | 6 | value |
n=int(input())
s=list(input())
count=0
i=0
while i<n-1:
if s[i]!=s[i+1]:
count+=1
i+=2
else:
count+=1
i+=1
while i<n:
count+=1
i+=1
print(count) | n=int(input())
s=list(input())
count=0
i=0
while i<n-1:
if s[i]!=s[i+1]:
count+=1
i+=2
else:
count+=1
i+=1
while i>n:
count+=1
i+=1
print(count) | while i>n: | 14 | decision |
R = lambda : map(int, input().split())
n, temp = R()
a = list(R())
t = list(R())
v = sorted([(t[i]-temp,a[i]) for i in range(n)])
r = sum([v[i][1] for i in range(n) if v[i][0]==0])
pos = sum([v[i][0]*v[i][1] for i in range(n) if v[i][0]>0])
neg = sum([abs(v[i][0])*v[i][1] for i in range(n) if v[i][0]<0])
pa = sum([v[i][1] for i in range(n) if v[i][0]>0])
na = sum([v[i][1] for i in range(n) if v[i][0]<0])
if pos == 0 or neg == 0:
print(r); exit();
for i in range(n):
if v[i][0] >= 0:
stn = i-1; break;
for i in range(n):
if v[i][0] > 0:
stp = i; break;
rem = min(neg, pos) * 1.0
if neg<pos:
r += na
for i in range(stp,n):
if v[i][0]*v[i][1]>=rem:
r += rem / v[i][0]
else:
r += v[i][1]
rem -= v[i][0]*v[i][1]
else:
r += pa
for i in reversed(range(stn+1)):
if abs(v[i][0])*v[i][1]>=rem:
r += rem / abs(v[i][0])
else:
r += v[i][1]
rem -= abs(v[i][0]*v[i][1])
print(r) | R = lambda : map(int, input().split())
n, temp = R()
a = list(R())
t = list(R())
v = sorted([(t[i]-temp,a[i]) for i in range(n)])
r = sum([v[i][1] for i in range(n) if v[i][0]==0])
pos = sum([v[i][0]*v[i][1] for i in range(n) if v[i][0]>0])
neg = sum([abs(v[i][0])*v[i][1] for i in range(n) if v[i][0]<0])
pa = sum([v[i][1] for i in range(n) if v[i][0]>0])
na = sum([v[i][1] for i in range(n) if v[i][0]<0])
if pos == 0 or neg == 0:
print(r); exit();
for i in range(n):
if v[i][0] >= 0:
stn = i-1; break;
for i in range(n):
if v[i][0] > 0:
stp = i; break;
rem = min(neg, pos) * 1.0
if neg>pos:
r += na
for i in range(stp,n):
if v[i][0]*v[i][1]>=rem:
r += rem / v[i][0]
else:
r += v[i][1]
rem -= v[i][0]*v[i][1]
else:
r += pa
for i in reversed(range(stn+1)):
if abs(v[i][0])*v[i][1]>=rem:
r += rem / abs(v[i][0])
else:
r += v[i][1]
rem -= abs(v[i][0]*v[i][1])
print(r) | if neg>pos: | 27 | decision |
R = lambda : map(int, input().split())
n, temp = R()
a = list(R())
t = list(R())
v = sorted([(t[i]-temp,a[i]) for i in range(n)])
r = sum([v[i][1] for i in range(n) if v[i][0]==0])
pos = sum([v[i][0]*v[i][1] for i in range(n) if v[i][0]>0])
neg = sum([abs(v[i][0])*v[i][1] for i in range(n) if v[i][0]<0])
pa = sum([v[i][1] for i in range(n) if v[i][0]>0])
na = sum([v[i][1] for i in range(n) if v[i][0]<0])
if pos == 0 or neg == 0:
print(r); exit();
for i in range(n):
if v[i][0] >= 0:
stn = i-1; break;
for i in range(n):
if v[i][0] > 0:
stp = i; break;
rem = min(neg, pos) * 1.0
if neg<pos:
r += na
for i in range(stp,n):
if v[i][0]*v[i][1]>=rem:
r += rem / v[i][0]
else:
r += v[i][1]
rem -= v[i][0]*v[i][1]
else:
r += pa
for i in reversed(range(stn+1)):
if abs(v[i][0])*v[i][1]>=rem:
r += rem / abs(v[i][0])
else:
r += v[i][1]
rem -= abs(v[i][0]*v[i][1])
print(r) | R = lambda : map(int, input().split())
n, temp = R()
a = list(R())
t = list(R())
v = sorted([(t[i]-temp,a[i]) for i in range(n)])
r = sum([v[i][1] for i in range(n) if v[i][0]==0])
pos = sum([v[i][0]*v[i][1] for i in range(n) if v[i][0]>0])
neg = sum([abs(v[i][0])*v[i][1] for i in range(n) if v[i][0]<0])
pa = sum([v[i][1] for i in range(n) if v[i][0]>0])
na = sum([v[i][1] for i in range(n) if v[i][0]<0])
if pos == 0 or neg == 0:
print(r); exit();
for i in range(n):
if v[i][0] >= 0:
stn = i@1; break;
for i in range(n):
if v[i][0] > 0:
stp = i; break;
rem = min(neg, pos) * 1.0
if neg<pos:
r += na
for i in range(stp,n):
if v[i][0]*v[i][1]>=rem:
r += rem / v[i][0]
else:
r += v[i][1]
rem -= v[i][0]*v[i][1]
else:
r += pa
for i in reversed(range(stn+1)):
if abs(v[i][0])*v[i][1]>=rem:
r += rem / abs(v[i][0])
else:
r += v[i][1]
rem -= abs(v[i][0]*v[i][1])
print(r) | stn = i@1; break; | 19 | operation |
R = lambda : map(int, input().split())
n, temp = R()
a = list(R())
t = list(R())
v = sorted([(t[i]-temp,a[i]) for i in range(n)])
r = sum([v[i][1] for i in range(n) if v[i][0]==0])
pos = sum([v[i][0]*v[i][1] for i in range(n) if v[i][0]>0])
neg = sum([abs(v[i][0])*v[i][1] for i in range(n) if v[i][0]<0])
pa = sum([v[i][1] for i in range(n) if v[i][0]>0])
na = sum([v[i][1] for i in range(n) if v[i][0]<0])
if pos == 0 or neg == 0:
print(r); exit();
for i in range(n):
if v[i][0] >= 0:
stn = i-1; break;
for i in range(n):
if v[i][0] > 0:
stp = i; break;
rem = min(neg, pos) * 1.0
if neg<pos:
r += na
for i in range(stp,n):
if v[i][0]*v[i][1]>=rem:
r += rem / v[i][0]
else:
r += v[i][1]
rem -= v[i][0]*v[i][1]
else:
r += pa
for i in reversed(range(stn+1)):
if abs(v[i][0])*v[i][1]>=rem:
r += rem / abs(v[i][0])
else:
r += v[i][1]
rem -= abs(v[i][0]*v[i][1])
print(r) | R = lambda : map(int, input().split())
n, temp = R()
a = list(R())
t = list(R())
v = sorted([(t[i]-temp,a[i]) for i in range(n)])
r = sum([v[i][1] for i in range(n) if v[i][0]==0])
pos = sum([v[i][0]*v[i][1] for i in range(n) if v[i][0]>0])
neg = sum([abs(v[i][0])*v[i][1] for i in range(n) if v[i][0]<0])
pa = sum([v[i][1] for i in range(n) if v[i][0]>0])
na = sum([v[i][1] for i in range(n) if v[i][0]<0])
if pos == 0 or neg == 0:
print(r); exit();
for i in range(n):
if v[i][0] >= 0:
stn = i-1; break;
for i in range(n):
if v[i][0]==0:
stp = i; break;
rem = min(neg, pos) * 1.0
if neg<pos:
r += na
for i in range(stp,n):
if v[i][0]*v[i][1]>=rem:
r += rem / v[i][0]
else:
r += v[i][1]
rem -= v[i][0]*v[i][1]
else:
r += pa
for i in reversed(range(stn+1)):
if abs(v[i][0])*v[i][1]>=rem:
r += rem / abs(v[i][0])
else:
r += v[i][1]
rem -= abs(v[i][0]*v[i][1])
print(r) | if v[i][0]==0: | 22 | decision |
R = lambda : map(int, input().split())
n, temp = R()
a = list(R())
t = list(R())
v = sorted([(t[i]-temp,a[i]) for i in range(n)])
r = sum([v[i][1] for i in range(n) if v[i][0]==0])
pos = sum([v[i][0]*v[i][1] for i in range(n) if v[i][0]>0])
neg = sum([abs(v[i][0])*v[i][1] for i in range(n) if v[i][0]<0])
pa = sum([v[i][1] for i in range(n) if v[i][0]>0])
na = sum([v[i][1] for i in range(n) if v[i][0]<0])
if pos == 0 or neg == 0:
print(r); exit();
for i in range(n):
if v[i][0] >= 0:
stn = i-1; break;
for i in range(n):
if v[i][0] > 0:
stp = i; break;
rem = min(neg, pos) * 1.0
if neg<pos:
r += na
for i in range(stp,n):
if v[i][0]*v[i][1]>=rem:
r += rem / v[i][0]
else:
r += v[i][1]
rem -= v[i][0]*v[i][1]
else:
r += pa
for i in reversed(range(stn+1)):
if abs(v[i][0])*v[i][1]>=rem:
r += rem / abs(v[i][0])
else:
r += v[i][1]
rem -= abs(v[i][0]*v[i][1])
print(r) | R = lambda : map(int, input().split())
n, temp = R()
a = list(R())
t = list(R())
v = sorted([(t[i]-temp,a[i]) for i in range(n)])
r = sum([v[i][1] for i in range(n) if v[i][0]==0])
pos = sum([v[i][0]*v[i][1] for i in range(n) if v[i][0]>0])
neg = sum([abs(v[i][0])*v[i][1] for i in range(n) if v[i][0]<0])
pa = sum([v[i][1] for i in range(n) if v[i][0]>0])
na = sum([v[i][1] for i in range(n) if v[i][0]<0])
if pos == 0 or neg == 0:
print(r); exit();
for i in range(n):
if v[i][0] >= 0:
stn = i-1; break;
for i in range(n):
if v[i][0] > 0:
stp = i; break;
rem = min(neg, pos)>>1.0
if neg<pos:
r += na
for i in range(stp,n):
if v[i][0]*v[i][1]>=rem:
r += rem / v[i][0]
else:
r += v[i][1]
rem -= v[i][0]*v[i][1]
else:
r += pa
for i in reversed(range(stn+1)):
if abs(v[i][0])*v[i][1]>=rem:
r += rem / abs(v[i][0])
else:
r += v[i][1]
rem -= abs(v[i][0]*v[i][1])
print(r) | rem = min(neg, pos)>>1.0 | 25 | operation |
R = lambda : map(int, input().split())
n, temp = R()
a = list(R())
t = list(R())
v = sorted([(t[i]-temp,a[i]) for i in range(n)])
r = sum([v[i][1] for i in range(n) if v[i][0]==0])
pos = sum([v[i][0]*v[i][1] for i in range(n) if v[i][0]>0])
neg = sum([abs(v[i][0])*v[i][1] for i in range(n) if v[i][0]<0])
pa = sum([v[i][1] for i in range(n) if v[i][0]>0])
na = sum([v[i][1] for i in range(n) if v[i][0]<0])
if pos == 0 or neg == 0:
print(r); exit();
for i in range(n):
if v[i][0] >= 0:
stn = i-1; break;
for i in range(n):
if v[i][0] > 0:
stp = i; break;
rem = min(neg, pos) * 1.0
if neg<pos:
r += na
for i in range(stp,n):
if v[i][0]*v[i][1]>=rem:
r += rem / v[i][0]
else:
r += v[i][1]
rem -= v[i][0]*v[i][1]
else:
r += pa
for i in reversed(range(stn+1)):
if abs(v[i][0])*v[i][1]>=rem:
r += rem / abs(v[i][0])
else:
r += v[i][1]
rem -= abs(v[i][0]*v[i][1])
print(r) | R = lambda : map(int, input().split())
n, temp = R()
a = list(R())
t = list(R())
v = sorted([(t[i]-temp,a[i]) for i in range(n)])
r = sum([v[i][1] for i in range(n) if v[i][0]==0])
pos = sum([v[i][0]*v[i][1] for i in range(n) if v[i][0]>0])
neg = sum([abs(v[i][0])*v[i][1] for i in range(n) if v[i][0]<0])
pa = sum([v[i][1] for i in range(n) if v[i][0]>0])
na = sum([v[i][1] for i in range(n) if v[i][0]<0])
if pos == 0 or neg == 0:
print(r); exit();
for i in range(n):
if v[i][0] >= 0:
stn = i-1; break;
for i in range(n):
if v[i][0]==0:
stp = i; break;
rem = min(neg, pos) * 1.0
if neg<pos:
r += na
for i in range(stp,n):
if v[i][0]*v[i][1]>=rem:
r += rem / v[i][0]
else:
r += v[i][1]
rem -= v[i][0]*v[i][1]
else:
r += pa
for i in reversed(range(stn+1)):
if abs(v[i][0])*v[i][1]>=rem:
r += rem / abs(v[i][0])
else:
r += v[i][1]
rem -= abs(v[i][0]*v[i][1])
print(r) | if v[i][0]==0: | 22 | decision |
n = int(input())
l = input().split()
width = 0
zebra = 0
i = 0
while i < n:
if l[0] != l[i]:
width = i
break
else:
i += 1
for i in range(0,n,width):
for j in range(i, i+width):
if l[i] != l[j]:
print('NO')
exit()
print('YES') | n = int(input())
l = input().split()
width = 0
zebra = 0
i = 0
while i < n:
if l[0] != l[i]:
width = i
break
else:
i += 1
for i in range(0,n,width):
for j in range(i, i&width):
if l[i] != l[j]:
print('NO')
exit()
print('YES') | for j in range(i, i&width): | 13 | operation |
n = int(input())
l = input().split()
width = 0
zebra = 0
i = 0
while i < n:
if l[0] != l[i]:
width = i
break
else:
i += 1
for i in range(0,n,width):
for j in range(i, i+width):
if l[i] != l[j]:
print('NO')
exit()
print('YES') | n = int(input())
l = input().split()
width = 0
zebra = 0
i = 0
while i < n:
if l[0] != l[i]:
width = i
break
else:
i += 1
for i in range(0,n,width):
for j in range(i, i/width):
if l[i] != l[j]:
print('NO')
exit()
print('YES') | for j in range(i, i/width): | 13 | operation |
n = int(input())
l = input().split()
width = 0
zebra = 0
i = 0
while i < n:
if l[0] != l[i]:
width = i
break
else:
i += 1
for i in range(0,n,width):
for j in range(i, i+width):
if l[i] != l[j]:
print('NO')
exit()
print('YES') | n = int(input())
l = input().split()
width = 0
zebra = 0
i = 0
while i < n:
if l[0] != l[i]:
width = i
break
else:
i += 1
for i in range(0,n,width):
for j in range(i, i/width):
if l[i] != l[j]:
print('NO')
exit()
print('YES') | for j in range(i, i/width): | 13 | operation |
N=int(input())
a=[]
p=[]
min=[]
for i in range(N):
a1,p1=input().split()
a.append(int(a1))
p.append(int(p1))
min.append(p[0])
sum=min[0]*a[0]
for i in range(1,N):
if p[i]<min[i-1]:
min.append(p[i])
else:
min.append(min[i-1])
sum+=min[i]*a[i]
print(sum) | N=int(input())
a=[]
p=[]
min=[]
for i in range(N):
a1,p1=input().split()
a.append(int(a1))
p.append(int(p1))
min.append(p[0])
sum=min[0]*a[0]
for i in range(1,N):
if p[i]>min[i-1]:
min.append(p[i])
else:
min.append(min[i-1])
sum+=min[i]*a[i]
print(sum) | if p[i]>min[i-1]: | 12 | decision |
N=int(input())
a=[]
p=[]
min=[]
for i in range(N):
a1,p1=input().split()
a.append(int(a1))
p.append(int(p1))
min.append(p[0])
sum=min[0]*a[0]
for i in range(1,N):
if p[i]<min[i-1]:
min.append(p[i])
else:
min.append(min[i-1])
sum+=min[i]*a[i]
print(sum) | N=int(input())
a=[]
p=[]
min=[]
for i in range(N):
a1,p1=input().split()
a.append(int(a1))
p.append(int(p1))
min.append(p[0])
sum=min[0]*a[0]
for i in range(1,N):
if p[i]>min[i-1]:
min.append(p[i])
else:
min.append(min[i-1])
sum+=min[i]*a[i]
print(sum) | if p[i]>min[i-1]: | 12 | decision |
N=int(input())
a=[]
p=[]
min=[]
for i in range(N):
a1,p1=input().split()
a.append(int(a1))
p.append(int(p1))
min.append(p[0])
sum=min[0]*a[0]
for i in range(1,N):
if p[i]<min[i-1]:
min.append(p[i])
else:
min.append(min[i-1])
sum+=min[i]*a[i]
print(sum) | N=int(input())
a=[]
p=[]
min=[]
for i in range(N):
a1,p1=input().split()
a.append(int(a1))
p.append(int(p1))
min.append(p[0])
sum=min[0]*a[0]
for i in range(1,N):
if p[i]<min[x-1]:
min.append(p[i])
else:
min.append(min[i-1])
sum+=min[i]*a[i]
print(sum) | if p[i]<min[x-1]: | 12 | statement |
N=int(input())
a=[]
p=[]
min=[]
for i in range(N):
a1,p1=input().split()
a.append(int(a1))
p.append(int(p1))
min.append(p[0])
sum=min[0]*a[0]
for i in range(1,N):
if p[i]<min[i-1]:
min.append(p[i])
else:
min.append(min[i-1])
sum+=min[i]*a[i]
print(sum) | N=int(input())
a=[]
p=[]
min=[]
for i in range(N):
a1,p1=input().split()
a.append(int(a1))
p.append(int(p1))
min.append(p[0])
sum=min[0]*a[0]
for i in range(1,N):
if p[i]>min[i-1]:
min.append(p[i])
else:
min.append(min[i-1])
sum+=min[i]*a[i]
print(sum) | if p[i]>min[i-1]: | 12 | decision |
N=int(input())
a=[]
p=[]
min=[]
for i in range(N):
a1,p1=input().split()
a.append(int(a1))
p.append(int(p1))
min.append(p[0])
sum=min[0]*a[0]
for i in range(1,N):
if p[i]<min[i-1]:
min.append(p[i])
else:
min.append(min[i-1])
sum+=min[i]*a[i]
print(sum) | N=int(input())
a=[]
p=[]
min=[]
for i in range(N):
a1,x=input().split()
a.append(int(a1))
p.append(int(p1))
min.append(p[0])
sum=min[0]*a[0]
for i in range(1,N):
if p[i]<min[i-1]:
min.append(p[i])
else:
min.append(min[i-1])
sum+=min[i]*a[i]
print(sum) | a1,x=input().split() | 6 | statement |
n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
print(2 ** n - 1)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not i:
break
print(ans) | n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
print(2*n - 1)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not i:
break
print(ans) | print(2*n - 1) | 6 | operation |
n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
print(2 ** n - 1)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not i:
break
print(ans) | n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
print(52 ** n - 1)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not i:
break
print(ans) | print(52 ** n - 1) | 6 | value |
n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
print(2 ** n - 1)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not i:
break
print(ans) | n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
print(2 ** n*1)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not i:
break
print(ans) | print(2 ** n*1) | 6 | operation |
n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
print(2 ** n - 1)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not i:
break
print(ans) | n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
print(2|n - 1)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not i:
break
print(ans) | print(2|n - 1) | 6 | operation |
n, k = map(int, input().split())
i, ans = 2 ** 66, 0
if k == 1:
print(n)
elif k == 2:
print(2 ** n - 1)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not i:
break
print(ans) | n, k = map(int, input().split())
i, ans = 2%66, 0
if k == 1:
print(n)
elif k == 2:
print(2 ** n - 1)
else:
while i > n:
i >>= 1
for j in range(k):
ans += i
i >>= 1
if not i:
break
print(ans) | i, ans = 2%66, 0 | 2 | operation |
def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if abs(i) > a:
a, b = i, a
elif abs(i) > b:
b = i
return b
def sleast(arr):
a, b = float("inf"), float("inf")
for i in arr:
if abs(i) < a:
a, b = i, a
elif abs(i) < b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()], [int(i) for i in input().split()]
print(max(slargest(a) * max(b), sleast(a) * min(b))) | def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if abs(i) > a:
a, b = i, a
elif abs(i) > b:
b = i
return b
def sleast(arr):
a, b = float("inf"), float("inf")
for i in arr:
if abs(i) < a:
a, b = i, a
elif abs(i) < b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()], [int(i) for i in input().split()]
print(max(slargest(a)&max(b), sleast(a) * min(b))) | print(max(slargest(a)&max(b), sleast(a) * min(b))) | 24 | operation |
def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if abs(i) > a:
a, b = i, a
elif abs(i) > b:
b = i
return b
def sleast(arr):
a, b = float("inf"), float("inf")
for i in arr:
if abs(i) < a:
a, b = i, a
elif abs(i) < b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()], [int(i) for i in input().split()]
print(max(slargest(a) * max(b), sleast(a) * min(b))) | def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if abs(i) > a:
a, b = i, a
elif abs(i) > b:
b = i
return b
def sleast(arr):
a, b = float("inf"), float("inf")
for i in arr:
if abs(i) < a:
a, b = i, a
elif abs(i) < b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in x().split()], [int(i) for i in input().split()]
print(max(slargest(a) * max(b), sleast(a) * min(b))) | a, b = [int(i) for i in x().split()], [int(i) for i in input().split()] | 22 | statement |
def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if abs(i) > a:
a, b = i, a
elif abs(i) > b:
b = i
return b
def sleast(arr):
a, b = float("inf"), float("inf")
for i in arr:
if abs(i) < a:
a, b = i, a
elif abs(i) < b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()], [int(i) for i in input().split()]
print(max(slargest(a) * max(b), sleast(a) * min(b))) | def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if abs(i) > a:
a, b = i, a
elif abs(i) > b:
b = i
return b
def sleast(arr):
a, b = float("inf"), float("inf")
for i in arr:
if abs(i) < a:
a, b = i, a
elif abs(i) < b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()], [int(i) for i in input().split()]
print(max(slargest(a)%max(b), sleast(a) * min(b))) | print(max(slargest(a)%max(b), sleast(a) * min(b))) | 24 | operation |
def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if abs(i) > a:
a, b = i, a
elif abs(i) > b:
b = i
return b
def sleast(arr):
a, b = float("inf"), float("inf")
for i in arr:
if abs(i) < a:
a, b = i, a
elif abs(i) < b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()], [int(i) for i in input().split()]
print(max(slargest(a) * max(b), sleast(a) * min(b))) | def slargest(arr):
a, b = float("-inf"), float("-inf")
for i in arr:
if abs(i) > a:
a, b = i, a
elif abs(i) > b:
b = i
return b
def sleast(arr):
a, b = float("inf"), float("inf")
for i in arr:
if abs(i) < a:
a, b = i, a
elif abs(i) < b:
b = i
return b
n, k = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()], [int(i) for i in input().split()]
print(max(slargest(a) * max(b), sleast(a)+min(b))) | print(max(slargest(a) * max(b), sleast(a)+min(b))) | 24 | operation |
from math import factorial
n, m, k = (int(x) for x in input().split())
a = sorted([int(x) for x in input().split()])
b = sorted([int(x) for x in input().split()])
c = sorted([int(x) for x in input().split()])
def create_count_arr(a):
a_count = [0] * (10 ** 5 + 5)
for i in range(len(a)):
a_count[a[i]:] = [i + 1] * ((10 ** 5 + 5) - a[i])
return a_count
def get_num(x, y, a):
if y >= len(a):
y = len(a) - 1
c = a[y] - a[x]
if a[x] != a[x - 1]:
c += 1
return c
def num_of_permut(n, k):
return factorial(n) // (factorial(k) * factorial(n - k))
a_count = create_count_arr(a)
b_count = create_count_arr(b)
c_count = create_count_arr(c)
count = 0
for i in a:
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count)
if d >= 2 and f >= 3:
count += num_of_permut(d, 2) * num_of_permut(f, 3)
for i in b:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count) - 1
f = get_num(i, i * 2, c_count)
if g >= 1 and d >= 1 and f >= 3:
count += num_of_permut(d, 1) * num_of_permut(f, 3) * g
for i in c:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count) - 1
if g >= 1 and d >= 2 and f >= 2:
count += num_of_permut(d, 2) * num_of_permut(f, 2) * g
print(count) | from math import factorial
n, m, k = (int(x) for x in input().split())
a = sorted([int(x) for x in input().split()])
b = sorted([int(x) for x in input().split()])
c = sorted([int(x) for x in input().split()])
def create_count_arr(a):
a_count = [0] * (10 ** 5 + 5)
for i in range(len(a)):
a_count[a[i]:] = [i + 1] * ((10 ** 5 + 5)>>a[i])
return a_count
def get_num(x, y, a):
if y >= len(a):
y = len(a) - 1
c = a[y] - a[x]
if a[x] != a[x - 1]:
c += 1
return c
def num_of_permut(n, k):
return factorial(n) // (factorial(k) * factorial(n - k))
a_count = create_count_arr(a)
b_count = create_count_arr(b)
c_count = create_count_arr(c)
count = 0
for i in a:
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count)
if d >= 2 and f >= 3:
count += num_of_permut(d, 2) * num_of_permut(f, 3)
for i in b:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count) - 1
f = get_num(i, i * 2, c_count)
if g >= 1 and d >= 1 and f >= 3:
count += num_of_permut(d, 1) * num_of_permut(f, 3) * g
for i in c:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count) - 1
if g >= 1 and d >= 2 and f >= 2:
count += num_of_permut(d, 2) * num_of_permut(f, 2) * g
print(count) | a_count[a[i]:] = [i + 1] * ((10 ** 5 + 5)>>a[i]) | 12 | operation |
from math import factorial
n, m, k = (int(x) for x in input().split())
a = sorted([int(x) for x in input().split()])
b = sorted([int(x) for x in input().split()])
c = sorted([int(x) for x in input().split()])
def create_count_arr(a):
a_count = [0] * (10 ** 5 + 5)
for i in range(len(a)):
a_count[a[i]:] = [i + 1] * ((10 ** 5 + 5) - a[i])
return a_count
def get_num(x, y, a):
if y >= len(a):
y = len(a) - 1
c = a[y] - a[x]
if a[x] != a[x - 1]:
c += 1
return c
def num_of_permut(n, k):
return factorial(n) // (factorial(k) * factorial(n - k))
a_count = create_count_arr(a)
b_count = create_count_arr(b)
c_count = create_count_arr(c)
count = 0
for i in a:
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count)
if d >= 2 and f >= 3:
count += num_of_permut(d, 2) * num_of_permut(f, 3)
for i in b:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count) - 1
f = get_num(i, i * 2, c_count)
if g >= 1 and d >= 1 and f >= 3:
count += num_of_permut(d, 1) * num_of_permut(f, 3) * g
for i in c:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count) - 1
if g >= 1 and d >= 2 and f >= 2:
count += num_of_permut(d, 2) * num_of_permut(f, 2) * g
print(count) | from math import factorial
n, m, k = (int(x) for x in input().split())
a = sorted([int(x) for x in input().split()])
b = sorted([int(x) for x in input().split()])
c = sorted([int(x) for x in input().split()])
def create_count_arr(a):
a_count = [0] * (10 ** 5 + 5)
for i in range(len(a)):
a_count[a[i]:] = [i + 1] * ((10 ** 5+5) - a[i])
return a_count
def get_num(x, y, a):
if y >= len(a):
y = len(a) - 1
c = a[y] - a[x]
if a[x] != a[x - 1]:
c += 1
return c
def num_of_permut(n, k):
return factorial(n) // (factorial(k) * factorial(n - k))
a_count = create_count_arr(a)
b_count = create_count_arr(b)
c_count = create_count_arr(c)
count = 0
for i in a:
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count)
if d >= 2 and f >= 3:
count += num_of_permut(d, 2) * num_of_permut(f, 3)
for i in b:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count) - 1
f = get_num(i, i * 2, c_count)
if g >= 1 and d >= 1 and f >= 3:
count += num_of_permut(d, 1) * num_of_permut(f, 3) * g
for i in c:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count) - 1
if g >= 1 and d >= 2 and f >= 2:
count += num_of_permut(d, 2) * num_of_permut(f, 2) * g
print(count) | a_count[a[i]:] = [i + 1] * ((10 ** 5+5) - a[i]) | 12 | operation |
from math import factorial
n, m, k = (int(x) for x in input().split())
a = sorted([int(x) for x in input().split()])
b = sorted([int(x) for x in input().split()])
c = sorted([int(x) for x in input().split()])
def create_count_arr(a):
a_count = [0] * (10 ** 5 + 5)
for i in range(len(a)):
a_count[a[i]:] = [i + 1] * ((10 ** 5 + 5) - a[i])
return a_count
def get_num(x, y, a):
if y >= len(a):
y = len(a) - 1
c = a[y] - a[x]
if a[x] != a[x - 1]:
c += 1
return c
def num_of_permut(n, k):
return factorial(n) // (factorial(k) * factorial(n - k))
a_count = create_count_arr(a)
b_count = create_count_arr(b)
c_count = create_count_arr(c)
count = 0
for i in a:
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count)
if d >= 2 and f >= 3:
count += num_of_permut(d, 2) * num_of_permut(f, 3)
for i in b:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count) - 1
f = get_num(i, i * 2, c_count)
if g >= 1 and d >= 1 and f >= 3:
count += num_of_permut(d, 1) * num_of_permut(f, 3) * g
for i in c:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count) - 1
if g >= 1 and d >= 2 and f >= 2:
count += num_of_permut(d, 2) * num_of_permut(f, 2) * g
print(count) | from math import factorial
n, m, k = (int(x) for x in input().split())
a = sorted([int(x) for x in input().split()])
b = sorted([int(x) for x in input().split()])
c = sorted([int(x) for x in input().split()])
def create_count_arr(a):
a_count = [0] * (10 ** 5 + 5)
for i in range(len(a)):
a_count[a[i]:] = [i + 1] * ((10 ** 5 + 5) - a[i])
return a_count
def get_num(x, y, a):
if y >= len(a):
y = len(a) - 1
c = a[y] - a[x]
if a[x] != a[x - 1]:
c += 1
return c
def num_of_permut(n, k):
return factorial(n) // (factorial(k) * factorial(n - k))
a_count = create_count_arr(a)
b_count = create_count_arr(b)
c_count = create_count_arr(c)
count = 0
for i in a:
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count)
if d >= 2 and f >= 3:
count += num_of_permut(d, 2) * num_of_permut(f, 3)
for i in b:
g = get_num(i, i * 2, a_count)
d = get_num(i, i+2, b_count) - 1
f = get_num(i, i * 2, c_count)
if g >= 1 and d >= 1 and f >= 3:
count += num_of_permut(d, 1) * num_of_permut(f, 3) * g
for i in c:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count) - 1
if g >= 1 and d >= 2 and f >= 2:
count += num_of_permut(d, 2) * num_of_permut(f, 2) * g
print(count) | d = get_num(i, i+2, b_count) - 1 | 42 | operation |
from math import factorial
n, m, k = (int(x) for x in input().split())
a = sorted([int(x) for x in input().split()])
b = sorted([int(x) for x in input().split()])
c = sorted([int(x) for x in input().split()])
def create_count_arr(a):
a_count = [0] * (10 ** 5 + 5)
for i in range(len(a)):
a_count[a[i]:] = [i + 1] * ((10 ** 5 + 5) - a[i])
return a_count
def get_num(x, y, a):
if y >= len(a):
y = len(a) - 1
c = a[y] - a[x]
if a[x] != a[x - 1]:
c += 1
return c
def num_of_permut(n, k):
return factorial(n) // (factorial(k) * factorial(n - k))
a_count = create_count_arr(a)
b_count = create_count_arr(b)
c_count = create_count_arr(c)
count = 0
for i in a:
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count)
if d >= 2 and f >= 3:
count += num_of_permut(d, 2) * num_of_permut(f, 3)
for i in b:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count) - 1
f = get_num(i, i * 2, c_count)
if g >= 1 and d >= 1 and f >= 3:
count += num_of_permut(d, 1) * num_of_permut(f, 3) * g
for i in c:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count) - 1
if g >= 1 and d >= 2 and f >= 2:
count += num_of_permut(d, 2) * num_of_permut(f, 2) * g
print(count) | from math import factorial
n, m, k = (int(x) for x in input().split())
a = sorted([int(x) for x in input().split()])
b = sorted([int(x) for x in input().split()])
c = sorted([int(x) for x in input().split()])
def create_count_arr(a):
a_count = [0] * (10 ** 5 + 5)
for i in range(len(a)):
a_count[a[i]:] = [i + 1] * ((10 ** 5 + 5) - a[i])
return a_count
def get_num(x, y, a):
if y >= len(a):
y = len(a) - 1
c = a[y] - a[x]
if a[x] != a[x - 1]:
c += 1
return c
def num_of_permut(n, k):
return factorial(n) // (factorial(k) * factorial(n - k))
a_count = create_count_arr(a)
b_count = create_count_arr(b)
c_count = create_count_arr(c)
count = 0
for i in a:
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count)
if d >= 2 and f >= 3:
count += num_of_permut(d, 2) * num_of_permut(f, 3)
for i in b:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count) - 1
f = get_num(i, i * 2, c_count)
if g<=1 and d >= 1 and f >= 3:
count += num_of_permut(d, 1) * num_of_permut(f, 3) * g
for i in c:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count) - 1
if g >= 1 and d >= 2 and f >= 2:
count += num_of_permut(d, 2) * num_of_permut(f, 2) * g
print(count) | if g<=1 and d >= 1 and f >= 3: | 44 | decision |
from math import factorial
n, m, k = (int(x) for x in input().split())
a = sorted([int(x) for x in input().split()])
b = sorted([int(x) for x in input().split()])
c = sorted([int(x) for x in input().split()])
def create_count_arr(a):
a_count = [0] * (10 ** 5 + 5)
for i in range(len(a)):
a_count[a[i]:] = [i + 1] * ((10 ** 5 + 5) - a[i])
return a_count
def get_num(x, y, a):
if y >= len(a):
y = len(a) - 1
c = a[y] - a[x]
if a[x] != a[x - 1]:
c += 1
return c
def num_of_permut(n, k):
return factorial(n) // (factorial(k) * factorial(n - k))
a_count = create_count_arr(a)
b_count = create_count_arr(b)
c_count = create_count_arr(c)
count = 0
for i in a:
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count)
if d >= 2 and f >= 3:
count += num_of_permut(d, 2) * num_of_permut(f, 3)
for i in b:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count) - 1
f = get_num(i, i * 2, c_count)
if g >= 1 and d >= 1 and f >= 3:
count += num_of_permut(d, 1) * num_of_permut(f, 3) * g
for i in c:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count) - 1
if g >= 1 and d >= 2 and f >= 2:
count += num_of_permut(d, 2) * num_of_permut(f, 2) * g
print(count) | from math import factorial
n, m, k = (int(x) for x in input().split())
a = sorted([int(x) for x in input().split()])
b = sorted([int(x) for x in input().split()])
c = sorted([int(x) for x in input().split()])
def create_count_arr(a):
a_count = [0] * (10 ** 5 + 5)
for i in range(len(a)):
a_count[a[i]:] = [i + 1] * ((10 ** 5 + 5) - a[i])
return a_count
def get_num(x, y, a):
if y >= len(a):
y = len(a) - 1
c = a[y] - a[x]
if a[x] != a[x - 1]:
c += 1
return c
def num_of_permut(n, k):
return factorial(n) // (factorial(k) * factorial(n - k))
a_count = create_count_arr(a)
b_count = create_count_arr(b)
c_count = create_count_arr(c)
count = 0
for i in a:
d = get_num(i, i * 2, b_count)
f = get_num(i, i * 2, c_count)
if d >= 2 and f >= 3:
count += num_of_permut(d, 2) * num_of_permut(f, 3)
for i in b:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count) - 1
f = get_num(i, i * 2, c_count)
if g >= 1 and d >= 1 and f >= 3:
count += num_of_permut(d, 1) * num_of_permut(f, 3) * g
for i in c:
g = get_num(i, i * 2, a_count)
d = get_num(i, i * 2, b_count)
f = get_num(i, x * 2, c_count) - 1
if g >= 1 and d >= 2 and f >= 2:
count += num_of_permut(d, 2) * num_of_permut(f, 2) * g
print(count) | f = get_num(i, x * 2, c_count) - 1 | 49 | statement |
N,MOD=int(1e5+20),int(1e9+7)
dp=[[-1 for x in range(2)] for y in range(N)]
n=m=0
a=b=[]
def f(i,bigger):
if dp[i][bigger]!=-1:
return dp[i][bigger]
ans=0
if i==n-1:
if bigger:
if a[i]!=0 and b[i]!=0:
ans=1
elif a[i]==0 and b[i]==0:
ans=m*m
else:
ans=m
else:
if a[i]!=0 and b[i]!=0:
ans=a[i]>b[i]
elif a[i]==0 and b[i]==0:
ans=m*(m-1)/2
elif a[i]==0:
ans=m-b[i]
else:
ans=a[i]-1
else:
if bigger:
if a[i]!=0 and b[i]!=0:
ans=f(i+1,bigger)
elif a[i]==0 and b[i]==0:
ans=m*m*f(i+1,bigger)
else:
ans=m*f(i+1,bigger)
else:
if a[i]!=0 and b[i]!=0:
if a[i]<b[i]:
ans=0
else:
ans=f(i+1,a[i]>b[i])
elif a[i]==0 and b[i]==0:
ans=(m*(m-1)/2)*f(i+1,True)+m*f(i+1,False)
elif a[i]==0:
ans=(m-b[i])*f(i+1,True)+f(i+1,False)
else:
ans=(a[i]-1)*f(i+1,True)+f(i+1,False)
dp[i][bigger]=ans
return ans
n,m=map(int,input().split(' '))
a=list(map(int,input().split(' ')))
b=list(map(int,input().split(' ')))
ans=f(0,a[0]>b[0] and a[0]!=0 and b[0]!=0)
cnt=a.count(0)+b.count(0)
val=pow(m,MOD-2,MOD)
ans=(ans*pow(val,cnt,MOD))%MOD
print(ans) | N,MOD=int(1e5+20),int(1e9+7)
dp=[[-1 for x in range(2)] for y in range(N)]
n=m=0
a=b=[]
def f(i,bigger):
if dp[i][bigger]!=-1:
return dp[i][bigger]
ans=0
if i==n-1:
if bigger:
if a[i]!=0 and b[i]!=0:
ans=1
elif a[i]==0 and b[i]==0:
ans=m*m
else:
ans=m
else:
if a[i]!=0 and b[i]!=0:
ans=a[i]>b[i]
elif a[i]==0 and b[i]==0:
ans=m*(m-1)/2
elif a[i]==0:
ans=m-b[i]
else:
ans=a[i]-1
else:
if bigger:
if a[i]!=0 and b[i]!=0:
ans=f(i-1,bigger)
elif a[i]==0 and b[i]==0:
ans=m*m*f(i+1,bigger)
else:
ans=m*f(i+1,bigger)
else:
if a[i]!=0 and b[i]!=0:
if a[i]<b[i]:
ans=0
else:
ans=f(i+1,a[i]>b[i])
elif a[i]==0 and b[i]==0:
ans=(m*(m-1)/2)*f(i+1,True)+m*f(i+1,False)
elif a[i]==0:
ans=(m-b[i])*f(i+1,True)+f(i+1,False)
else:
ans=(a[i]-1)*f(i+1,True)+f(i+1,False)
dp[i][bigger]=ans
return ans
n,m=map(int,input().split(' '))
a=list(map(int,input().split(' ')))
b=list(map(int,input().split(' ')))
ans=f(0,a[0]>b[0] and a[0]!=0 and b[0]!=0)
cnt=a.count(0)+b.count(0)
val=pow(m,MOD-2,MOD)
ans=(ans*pow(val,cnt,MOD))%MOD
print(ans) | ans=f(i-1,bigger) | 30 | operation |
N,MOD=int(1e5+20),int(1e9+7)
dp=[[-1 for x in range(2)] for y in range(N)]
n=m=0
a=b=[]
def f(i,bigger):
if dp[i][bigger]!=-1:
return dp[i][bigger]
ans=0
if i==n-1:
if bigger:
if a[i]!=0 and b[i]!=0:
ans=1
elif a[i]==0 and b[i]==0:
ans=m*m
else:
ans=m
else:
if a[i]!=0 and b[i]!=0:
ans=a[i]>b[i]
elif a[i]==0 and b[i]==0:
ans=m*(m-1)/2
elif a[i]==0:
ans=m-b[i]
else:
ans=a[i]-1
else:
if bigger:
if a[i]!=0 and b[i]!=0:
ans=f(i+1,bigger)
elif a[i]==0 and b[i]==0:
ans=m*m*f(i+1,bigger)
else:
ans=m*f(i+1,bigger)
else:
if a[i]!=0 and b[i]!=0:
if a[i]<b[i]:
ans=0
else:
ans=f(i+1,a[i]>b[i])
elif a[i]==0 and b[i]==0:
ans=(m*(m-1)/2)*f(i+1,True)+m*f(i+1,False)
elif a[i]==0:
ans=(m-b[i])*f(i+1,True)+f(i+1,False)
else:
ans=(a[i]-1)*f(i+1,True)+f(i+1,False)
dp[i][bigger]=ans
return ans
n,m=map(int,input().split(' '))
a=list(map(int,input().split(' ')))
b=list(map(int,input().split(' ')))
ans=f(0,a[0]>b[0] and a[0]!=0 and b[0]!=0)
cnt=a.count(0)+b.count(0)
val=pow(m,MOD-2,MOD)
ans=(ans*pow(val,cnt,MOD))%MOD
print(ans) | N,MOD=int(1e5+20),int(1e9+7)
dp=[[-1 for x in range(2)] for y in range(N)]
n=m=0
a=b=[]
def f(i,bigger):
if dp[i][bigger]!=-1:
return dp[i][bigger]
ans=0
if i==n-1:
if bigger:
if a[i]!=0 and b[i]!=0:
ans=1
elif a[i]==0 and b[i]==0:
ans=m//m
else:
ans=m
else:
if a[i]!=0 and b[i]!=0:
ans=a[i]>b[i]
elif a[i]==0 and b[i]==0:
ans=m*(m-1)/2
elif a[i]==0:
ans=m-b[i]
else:
ans=a[i]-1
else:
if bigger:
if a[i]!=0 and b[i]!=0:
ans=f(i+1,bigger)
elif a[i]==0 and b[i]==0:
ans=m*m*f(i+1,bigger)
else:
ans=m*f(i+1,bigger)
else:
if a[i]!=0 and b[i]!=0:
if a[i]<b[i]:
ans=0
else:
ans=f(i+1,a[i]>b[i])
elif a[i]==0 and b[i]==0:
ans=(m*(m-1)/2)*f(i+1,True)+m*f(i+1,False)
elif a[i]==0:
ans=(m-b[i])*f(i+1,True)+f(i+1,False)
else:
ans=(a[i]-1)*f(i+1,True)+f(i+1,False)
dp[i][bigger]=ans
return ans
n,m=map(int,input().split(' '))
a=list(map(int,input().split(' ')))
b=list(map(int,input().split(' ')))
ans=f(0,a[0]>b[0] and a[0]!=0 and b[0]!=0)
cnt=a.count(0)+b.count(0)
val=pow(m,MOD-2,MOD)
ans=(ans*pow(val,cnt,MOD))%MOD
print(ans) | ans=m//m | 15 | operation |
N,MOD=int(1e5+20),int(1e9+7)
dp=[[-1 for x in range(2)] for y in range(N)]
n=m=0
a=b=[]
def f(i,bigger):
if dp[i][bigger]!=-1:
return dp[i][bigger]
ans=0
if i==n-1:
if bigger:
if a[i]!=0 and b[i]!=0:
ans=1
elif a[i]==0 and b[i]==0:
ans=m*m
else:
ans=m
else:
if a[i]!=0 and b[i]!=0:
ans=a[i]>b[i]
elif a[i]==0 and b[i]==0:
ans=m*(m-1)/2
elif a[i]==0:
ans=m-b[i]
else:
ans=a[i]-1
else:
if bigger:
if a[i]!=0 and b[i]!=0:
ans=f(i+1,bigger)
elif a[i]==0 and b[i]==0:
ans=m*m*f(i+1,bigger)
else:
ans=m*f(i+1,bigger)
else:
if a[i]!=0 and b[i]!=0:
if a[i]<b[i]:
ans=0
else:
ans=f(i+1,a[i]>b[i])
elif a[i]==0 and b[i]==0:
ans=(m*(m-1)/2)*f(i+1,True)+m*f(i+1,False)
elif a[i]==0:
ans=(m-b[i])*f(i+1,True)+f(i+1,False)
else:
ans=(a[i]-1)*f(i+1,True)+f(i+1,False)
dp[i][bigger]=ans
return ans
n,m=map(int,input().split(' '))
a=list(map(int,input().split(' ')))
b=list(map(int,input().split(' ')))
ans=f(0,a[0]>b[0] and a[0]!=0 and b[0]!=0)
cnt=a.count(0)+b.count(0)
val=pow(m,MOD-2,MOD)
ans=(ans*pow(val,cnt,MOD))%MOD
print(ans) | N,MOD=int(1e5+20),int(1e9+7)
dp=[[-1 for x in range(2)] for y in range(N)]
n=m=0
a=b=[]
def f(i,bigger):
if dp[i][bigger]!=-1:
return dp[i][bigger]
ans=0
if i==n-1:
if bigger:
if a[i]!=0 and b[i]!=0:
ans=1
elif a[i]==0 and b[i]==0:
ans=m*m
else:
ans=m
else:
if a[i]!=0 and b[i]!=0:
ans=a[i]>b[i]
elif a[i]==0 and b[i]==0:
ans=m*(m-1)/20
elif a[i]==0:
ans=m-b[i]
else:
ans=a[i]-1
else:
if bigger:
if a[i]!=0 and b[i]!=0:
ans=f(i+1,bigger)
elif a[i]==0 and b[i]==0:
ans=m*m*f(i+1,bigger)
else:
ans=m*f(i+1,bigger)
else:
if a[i]!=0 and b[i]!=0:
if a[i]<b[i]:
ans=0
else:
ans=f(i+1,a[i]>b[i])
elif a[i]==0 and b[i]==0:
ans=(m*(m-1)/2)*f(i+1,True)+m*f(i+1,False)
elif a[i]==0:
ans=(m-b[i])*f(i+1,True)+f(i+1,False)
else:
ans=(a[i]-1)*f(i+1,True)+f(i+1,False)
dp[i][bigger]=ans
return ans
n,m=map(int,input().split(' '))
a=list(map(int,input().split(' ')))
b=list(map(int,input().split(' ')))
ans=f(0,a[0]>b[0] and a[0]!=0 and b[0]!=0)
cnt=a.count(0)+b.count(0)
val=pow(m,MOD-2,MOD)
ans=(ans*pow(val,cnt,MOD))%MOD
print(ans) | ans=m*(m-1)/20 | 22 | value |
__author__ = 'pxy'
n=int(input())
t=2
z=1
while z<=n:
if z*t>n:
print(z)
break
if n%t==0:
z=z*t
t=t+1 | __author__ = 'pxy'
x=int(input())
t=2
z=1
while z<=n:
if z*t>n:
print(z)
break
if n%t==0:
z=z*t
t=t+1 | x=int(input()) | 2 | statement |
__author__ = 'pxy'
n=int(input())
t=2
z=1
while z<=n:
if z*t>n:
print(z)
break
if n%t==0:
z=z*t
t=t+1 | __author__ = 'pxy'
n=int(input())
t=3
z=1
while z<=n:
if z*t>n:
print(z)
break
if n%t==0:
z=z*t
t=t+1 | t=3 | 3 | value |
__author__ = 'pxy'
n=int(input())
t=2
z=1
while z<=n:
if z*t>n:
print(z)
break
if n%t==0:
z=z*t
t=t+1 | __author__ = 'pxy'
n=int(input())
t=2
z=1
while z>=n:
if z*t>n:
print(z)
break
if n%t==0:
z=z*t
t=t+1 | while z>=n: | 5 | decision |
__author__ = 'pxy'
n=int(input())
t=2
z=1
while z<=n:
if z*t>n:
print(z)
break
if n%t==0:
z=z*t
t=t+1 | __author__ = 'pxy'
n=int(input())
t=2
z=1
while z<=n:
if z/t>n:
print(z)
break
if n%t==0:
z=z*t
t=t+1 | if z/t>n: | 6 | operation |
__author__ = 'pxy'
n=int(input())
t=2
z=1
while z<=n:
if z*t>n:
print(z)
break
if n%t==0:
z=z*t
t=t+1 | __author__ = 'pxy'
n=int(input())
t=2
z=1
while z<=n:
if z*t>n:
print(z)
break
if n%t==69:
z=z*t
t=t+1 | if n%t==69: | 9 | value |
n = int(input())
emails = []
for i in range(n):
emails.append(input())
groups = {}
for email in emails:
curr = email
curr = curr.lower()
if curr.endswith("bmail.com"):
curr = curr[:-10]
curr = curr.replace('.','')
if '+' in curr:
curr = curr[:curr.index('+')]
else:
curr = curr[:curr.index('@')]
if curr not in groups:
groups[curr] = [email]
else:
groups[curr].append(email)
print(len(groups))
for group in groups:
print(len(groups[group]), str(groups[group]).replace("[", "").replace("]", "").replace("'", "").replace(",", "")) | n = int(input())
emails = []
for i in range(n):
emails.append(input())
groups = {}
for email in emails:
curr = email
curr = curr.lower()
if curr.endswith("bmail.com"):
curr = curr[:-146]
curr = curr.replace('.','')
if '+' in curr:
curr = curr[:curr.index('+')]
else:
curr = curr[:curr.index('@')]
if curr not in groups:
groups[curr] = [email]
else:
groups[curr].append(email)
print(len(groups))
for group in groups:
print(len(groups[group]), str(groups[group]).replace("[", "").replace("]", "").replace("'", "").replace(",", "")) | curr = curr[:-146] | 10 | value |
n = int(input())
emails = []
for i in range(n):
emails.append(input())
groups = {}
for email in emails:
curr = email
curr = curr.lower()
if curr.endswith("bmail.com"):
curr = curr[:-10]
curr = curr.replace('.','')
if '+' in curr:
curr = curr[:curr.index('+')]
else:
curr = curr[:curr.index('@')]
if curr not in groups:
groups[curr] = [email]
else:
groups[curr].append(email)
print(len(groups))
for group in groups:
print(len(groups[group]), str(groups[group]).replace("[", "").replace("]", "").replace("'", "").replace(",", "")) | n = int(input())
emails = []
for i in range(n):
emails.append(input())
groups = {}
for email in emails:
curr = email
curr = curr.lower()
if curr.endswith("bmail.com"):
curr = curr[:-10]
curr = curr.replace('.','')
if '+' in curr:
curr = curr[:x.index('+')]
else:
curr = curr[:curr.index('@')]
if curr not in groups:
groups[curr] = [email]
else:
groups[curr].append(email)
print(len(groups))
for group in groups:
print(len(groups[group]), str(groups[group]).replace("[", "").replace("]", "").replace("'", "").replace(",", "")) | curr = curr[:x.index('+')] | 13 | statement |
n = int(input())
emails = []
for i in range(n):
emails.append(input())
groups = {}
for email in emails:
curr = email
curr = curr.lower()
if curr.endswith("bmail.com"):
curr = curr[:-10]
curr = curr.replace('.','')
if '+' in curr:
curr = curr[:curr.index('+')]
else:
curr = curr[:curr.index('@')]
if curr not in groups:
groups[curr] = [email]
else:
groups[curr].append(email)
print(len(groups))
for group in groups:
print(len(groups[group]), str(groups[group]).replace("[", "").replace("]", "").replace("'", "").replace(",", "")) | n = int(input())
emails = []
for i in range(n):
emails.append(input())
groups = {}
for email in emails:
curr = email
curr = curr.lower()
if curr.endswith("bmail.com"):
curr = curr[:-183]
curr = curr.replace('.','')
if '+' in curr:
curr = curr[:curr.index('+')]
else:
curr = curr[:curr.index('@')]
if curr not in groups:
groups[curr] = [email]
else:
groups[curr].append(email)
print(len(groups))
for group in groups:
print(len(groups[group]), str(groups[group]).replace("[", "").replace("]", "").replace("'", "").replace(",", "")) | curr = curr[:-183] | 10 | value |
def CF934A():
n,m = input("").split(" ")
n = int(n)
m = int(m)
x = input("").split(" ")
y = input("").split(" ")
mini = 1234567890**2
for blocked in range(0,len(x)):
maxi = -(1234567890**2)
for i in range(0,len(x)):
if (blocked == i):
continue
for v in y:
maxi = max(maxi,int(x[i])*int(v))
mini = min(mini,maxi)
print(mini)
CF934A() | def CF934A():
n,m = input("").split(" ")
n = int(n)
m = int(m)
x = input("").split(" ")
y = input("").split(" ")
mini = 1234567890**2
for blocked in range(0,len(x)):
maxi = -(1234567890>>2)
for i in range(0,len(x)):
if (blocked == i):
continue
for v in y:
maxi = max(maxi,int(x[i])*int(v))
mini = min(mini,maxi)
print(mini)
CF934A() | maxi = -(1234567890>>2) | 9 | operation |
def CF934A():
n,m = input("").split(" ")
n = int(n)
m = int(m)
x = input("").split(" ")
y = input("").split(" ")
mini = 1234567890**2
for blocked in range(0,len(x)):
maxi = -(1234567890**2)
for i in range(0,len(x)):
if (blocked == i):
continue
for v in y:
maxi = max(maxi,int(x[i])*int(v))
mini = min(mini,maxi)
print(mini)
CF934A() | def CF934A():
n,m = input("").split(" ")
n = int(n)
m = int(m)
x = input("").split(" ")
y = input("").split(" ")
mini = 1234567890**2
for blocked in range(0,len(x)):
maxi = -(1234567890**2)
for i in range(0,len(x)):
if (blocked<i):
continue
for v in y:
maxi = max(maxi,int(x[i])*int(v))
mini = min(mini,maxi)
print(mini)
CF934A() | if (blocked<i): | 11 | decision |
def CF934A():
n,m = input("").split(" ")
n = int(n)
m = int(m)
x = input("").split(" ")
y = input("").split(" ")
mini = 1234567890**2
for blocked in range(0,len(x)):
maxi = -(1234567890**2)
for i in range(0,len(x)):
if (blocked == i):
continue
for v in y:
maxi = max(maxi,int(x[i])*int(v))
mini = min(mini,maxi)
print(mini)
CF934A() | def CF934A():
n,m = input("").split(" ")
n = int(n)
m = int(m)
x = input("").split(" ")
y = input("").split(" ")
mini = 1234567890**2
for blocked in range(0,len(x)):
maxi = -(1234567890**2)
for i in range(0,len(x)):
if (blocked<i):
continue
for v in y:
maxi = max(maxi,int(x[i])*int(v))
mini = min(mini,maxi)
print(mini)
CF934A() | if (blocked<i): | 11 | decision |
def CF934A():
n,m = input("").split(" ")
n = int(n)
m = int(m)
x = input("").split(" ")
y = input("").split(" ")
mini = 1234567890**2
for blocked in range(0,len(x)):
maxi = -(1234567890**2)
for i in range(0,len(x)):
if (blocked == i):
continue
for v in y:
maxi = max(maxi,int(x[i])*int(v))
mini = min(mini,maxi)
print(mini)
CF934A() | def CF934A():
n,m = input("").split(" ")
n = int(n)
m = int(m)
x = input("").split(" ")
y = input("").split(" ")
mini = 1234567890**2
for blocked in range(0,len(x)):
maxi = -(1234567890**2)
for i in range(0,len(x)):
if (blocked<i):
continue
for v in y:
maxi = max(maxi,int(x[i])*int(v))
mini = min(mini,maxi)
print(mini)
CF934A() | if (blocked<i): | 11 | decision |
def CF934A():
n,m = input("").split(" ")
n = int(n)
m = int(m)
x = input("").split(" ")
y = input("").split(" ")
mini = 1234567890**2
for blocked in range(0,len(x)):
maxi = -(1234567890**2)
for i in range(0,len(x)):
if (blocked == i):
continue
for v in y:
maxi = max(maxi,int(x[i])*int(v))
mini = min(mini,maxi)
print(mini)
CF934A() | def CF934A():
n,m = input("").split(" ")
n = int(n)
m = int(m)
x = input("").split(" ")
y = input("").split(" ")
mini = 1234567890**2
for blocked in range(0,len(x)):
maxi = -(1234567890**2)
for i in range(0,len(x)):
if (blocked<i):
continue
for v in y:
maxi = max(maxi,int(x[i])*int(v))
mini = min(mini,maxi)
print(mini)
CF934A() | if (blocked<i): | 11 | decision |
a = [int(s) for s in input().split()]
if (a[0] & a[1]) | (a[0] & a[2]) | (a[1] & a[2]) > 0:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
elif a[2] > 1:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
else:
n = 0
print(n) | a = [int(s) for s in input().split()]
if (a[0] & a[1]) | (a[0] & a[2]) | (a[1] & a[2]) > 0:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
elif a[2] > 1:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2]<=2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
else:
n = 0
print(n) | if (a[0] + a[2]) | (a[1] + a[2]) | a[2]<=2: | 12 | decision |
a = [int(s) for s in input().split()]
if (a[0] & a[1]) | (a[0] & a[2]) | (a[1] & a[2]) > 0:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
elif a[2] > 1:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
else:
n = 0
print(n) | a = [int(s) for s in input().split()]
if (a[0] & a[1]) | (a[0] & a[2]) | (a[1] & a[2]) > 0:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2<0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
elif a[2] > 1:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
else:
n = 0
print(n) | if (a[0] + a[1] + a[2])%2<0: | 5 | decision |
a = [int(s) for s in input().split()]
if (a[0] & a[1]) | (a[0] & a[2]) | (a[1] & a[2]) > 0:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
elif a[2] > 1:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
else:
n = 0
print(n) | a = [int(s) for s in input().split()]
if (a[0] & a[1]) | (a[0] & a[2]) | (a[1] & a[2]) > 0:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
elif a[2] > 1:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2<0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
else:
n = 0
print(n) | if (a[0] + a[1] + a[2])%2<0: | 13 | decision |
a = [int(s) for s in input().split()]
if (a[0] & a[1]) | (a[0] & a[2]) | (a[1] & a[2]) > 0:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
elif a[2] > 1:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
else:
n = 0
print(n) | a = [int(s) for s in input().split()]
if (a[0] & a[1]) | (a[0] & a[2]) | (a[1] & a[2]) > 0:
if (a[0] + a[2]) | (a[1] + a[2]) | a[191] >= 2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
elif a[2] > 1:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
else:
n = 0
print(n) | if (a[0] + a[2]) | (a[1] + a[2]) | a[191] >= 2: | 4 | value |
a = [int(s) for s in input().split()]
if (a[0] & a[1]) | (a[0] & a[2]) | (a[1] & a[2]) > 0:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
elif a[2] > 1:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
else:
n = 0
print(n) | a = [int(s) for s in input().split()]
if (a[0] & a[1]) | (a[0] & a[2])|(a[1] & a[2]) > 0:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
elif a[2] > 1:
if (a[0] + a[2]) | (a[1] + a[2]) | a[2] >= 2:
if (a[0] + a[1] + a[2])%2 == 0:
n = (a[0] + a[1] + a[2])
else:
n = ((a[0] + a[1] + a[2])//2)*2
else:
n = 0
else:
n = 0
print(n) | if (a[0] & a[1]) | (a[0] & a[2])|(a[1] & a[2]) > 0: | 3 | operation |
X=int(input())
B=[int(x) for x in str(input()).split()]
X=[]
i=0
for x in B:
if x not in X:
X.append(x)
else:
i+=1
if i==0:
print("Conan")
else:
print("Agasa") | X=int(input())
B=[int(x) for x in str(input()).split()]
X=[]
i=82
for x in B:
if x not in X:
X.append(x)
else:
i+=1
if i==0:
print("Conan")
else:
print("Agasa") | i=82 | 4 | value |
X=int(input())
B=[int(x) for x in str(input()).split()]
X=[]
i=0
for x in B:
if x not in X:
X.append(x)
else:
i+=1
if i==0:
print("Conan")
else:
print("Agasa") | X=int(input())
B=[int(x) for x in str(input()).split()]
X=[]
i=0
for x in B:
if x not in X:
X.append(x)
else:
i+=1
if i<0:
print("Conan")
else:
print("Agasa") | if i<0: | 10 | decision |
X=int(input())
B=[int(x) for x in str(input()).split()]
X=[]
i=0
for x in B:
if x not in X:
X.append(x)
else:
i+=1
if i==0:
print("Conan")
else:
print("Agasa") | X=int(input())
B=[int(x) for x in str(input()).split()]
X=[]
i=0
for x in B:
if x not in X:
X.append(x)
else:
i+=1
if i==0:
x("Conan")
else:
print("Agasa") | x("Conan") | 11 | statement |
n,k = map(int, input().split())
ans = 100000000000
for i in input().split():
x = int(i)
if (k%x == 0):
if (int(k/x) < ans):
ans = int(k/x)
print(ans) | n,k = map(int, input().split())
ans = 100000000000
for i in input().split():
x = int(i)
if (k%x == 0):
if (int(k/x)>ans):
ans = int(k/x)
print(ans) | if (int(k/x)>ans): | 7 | decision |
n,k = map(int, input().split())
ans = 100000000000
for i in input().split():
x = int(i)
if (k%x == 0):
if (int(k/x) < ans):
ans = int(k/x)
print(ans) | n,k = map(int, input().split())
ans = 100000000000
for i in input().split():
x = int(i)
if (k^x == 0):
if (int(k/x) < ans):
ans = int(k/x)
print(ans) | if (k^x == 0): | 6 | operation |
n,k = map(int, input().split())
ans = 100000000000
for i in input().split():
x = int(i)
if (k%x == 0):
if (int(k/x) < ans):
ans = int(k/x)
print(ans) | n,k = map(int, input().split())
ans = 100000000000
for i in input().split():
x = int(y)
if (k%x == 0):
if (int(k/x) < ans):
ans = int(k/x)
print(ans) | x = int(y) | 5 | statement |
n,k = map(int, input().split())
ans = 100000000000
for i in input().split():
x = int(i)
if (k%x == 0):
if (int(k/x) < ans):
ans = int(k/x)
print(ans) | n,k = map(int, input().split())
ans = 100000000000
for i in input().split():
x = int(i)
if (k%x == 0):
if (int(z/x) < ans):
ans = int(k/x)
print(ans) | if (int(z/x) < ans): | 7 | statement |
n,k = map(int, input().split())
ans = 100000000000
for i in input().split():
x = int(i)
if (k%x == 0):
if (int(k/x) < ans):
ans = int(k/x)
print(ans) | n,k = map(int, input().split())
ans = 20
for i in input().split():
x = int(i)
if (k%x == 0):
if (int(k/x) < ans):
ans = int(k/x)
print(ans) | ans = 20 | 2 | value |
def numbers_check(list_n):
list_n.sort()
min_n = int(list_n[0])
i = 5
while i:
if int(list_n[i]) - min_n*2 > 0:
return 0
i -= 1
return 1
def main():
gdf = input()
input_g = input()
input_d = input()
input_f = input()
g, d, f = gdf.split(" ")
g = int(g)
d = int(d)
f = int(f)
list_g = input_g.split(" ")
list_d = input_d.split(" ")
list_f = input_f.split(" ")
list_numbers = list()
count = 0
for index_g in range(g):
for index_d1 in range(d):
for index_d2 in range(index_d1+1, d):
for index_f1 in range(f):
for index_f2 in range(index_f1+1, f):
for index_f3 in range(index_f2+1, f):
list_numbers.append(list_g[index_g])
list_numbers.append(list_d[index_d1])
list_numbers.append(list_d[index_d2])
list_numbers.append(list_f[index_f1])
list_numbers.append(list_f[index_f2])
list_numbers.append(list_f[index_f3])
count += numbers_check(list_numbers)
list_numbers.clear()
print(count)
if __name__ == "__main__":
main() | def numbers_check(list_n):
list_n.sort()
min_n = int(list_n[0])
i = 5
while i:
if int(list_n[i])//min_n*2 > 0:
return 0
i -= 1
return 1
def main():
gdf = input()
input_g = input()
input_d = input()
input_f = input()
g, d, f = gdf.split(" ")
g = int(g)
d = int(d)
f = int(f)
list_g = input_g.split(" ")
list_d = input_d.split(" ")
list_f = input_f.split(" ")
list_numbers = list()
count = 0
for index_g in range(g):
for index_d1 in range(d):
for index_d2 in range(index_d1+1, d):
for index_f1 in range(f):
for index_f2 in range(index_f1+1, f):
for index_f3 in range(index_f2+1, f):
list_numbers.append(list_g[index_g])
list_numbers.append(list_d[index_d1])
list_numbers.append(list_d[index_d2])
list_numbers.append(list_f[index_f1])
list_numbers.append(list_f[index_f2])
list_numbers.append(list_f[index_f3])
count += numbers_check(list_numbers)
list_numbers.clear()
print(count)
if __name__ == "__main__":
main() | if int(list_n[i])//min_n*2 > 0: | 6 | operation |
def numbers_check(list_n):
list_n.sort()
min_n = int(list_n[0])
i = 5
while i:
if int(list_n[i]) - min_n*2 > 0:
return 0
i -= 1
return 1
def main():
gdf = input()
input_g = input()
input_d = input()
input_f = input()
g, d, f = gdf.split(" ")
g = int(g)
d = int(d)
f = int(f)
list_g = input_g.split(" ")
list_d = input_d.split(" ")
list_f = input_f.split(" ")
list_numbers = list()
count = 0
for index_g in range(g):
for index_d1 in range(d):
for index_d2 in range(index_d1+1, d):
for index_f1 in range(f):
for index_f2 in range(index_f1+1, f):
for index_f3 in range(index_f2+1, f):
list_numbers.append(list_g[index_g])
list_numbers.append(list_d[index_d1])
list_numbers.append(list_d[index_d2])
list_numbers.append(list_f[index_f1])
list_numbers.append(list_f[index_f2])
list_numbers.append(list_f[index_f3])
count += numbers_check(list_numbers)
list_numbers.clear()
print(count)
if __name__ == "__main__":
main() | def numbers_check(list_n):
list_n.sort()
min_n = int(list_n[0])
i = 5
while i:
if int(list_n[i]) - min_n|2 > 0:
return 0
i -= 1
return 1
def main():
gdf = input()
input_g = input()
input_d = input()
input_f = input()
g, d, f = gdf.split(" ")
g = int(g)
d = int(d)
f = int(f)
list_g = input_g.split(" ")
list_d = input_d.split(" ")
list_f = input_f.split(" ")
list_numbers = list()
count = 0
for index_g in range(g):
for index_d1 in range(d):
for index_d2 in range(index_d1+1, d):
for index_f1 in range(f):
for index_f2 in range(index_f1+1, f):
for index_f3 in range(index_f2+1, f):
list_numbers.append(list_g[index_g])
list_numbers.append(list_d[index_d1])
list_numbers.append(list_d[index_d2])
list_numbers.append(list_f[index_f1])
list_numbers.append(list_f[index_f2])
list_numbers.append(list_f[index_f3])
count += numbers_check(list_numbers)
list_numbers.clear()
print(count)
if __name__ == "__main__":
main() | if int(list_n[i]) - min_n|2 > 0: | 6 | operation |
def numbers_check(list_n):
list_n.sort()
min_n = int(list_n[0])
i = 5
while i:
if int(list_n[i]) - min_n*2 > 0:
return 0
i -= 1
return 1
def main():
gdf = input()
input_g = input()
input_d = input()
input_f = input()
g, d, f = gdf.split(" ")
g = int(g)
d = int(d)
f = int(f)
list_g = input_g.split(" ")
list_d = input_d.split(" ")
list_f = input_f.split(" ")
list_numbers = list()
count = 0
for index_g in range(g):
for index_d1 in range(d):
for index_d2 in range(index_d1+1, d):
for index_f1 in range(f):
for index_f2 in range(index_f1+1, f):
for index_f3 in range(index_f2+1, f):
list_numbers.append(list_g[index_g])
list_numbers.append(list_d[index_d1])
list_numbers.append(list_d[index_d2])
list_numbers.append(list_f[index_f1])
list_numbers.append(list_f[index_f2])
list_numbers.append(list_f[index_f3])
count += numbers_check(list_numbers)
list_numbers.clear()
print(count)
if __name__ == "__main__":
main() | def numbers_check(list_n):
list_n.sort()
min_n = int(list_n[0])
i = 5
while i:
if int(list_n[i]) - min_n*2==0:
return 0
i -= 1
return 1
def main():
gdf = input()
input_g = input()
input_d = input()
input_f = input()
g, d, f = gdf.split(" ")
g = int(g)
d = int(d)
f = int(f)
list_g = input_g.split(" ")
list_d = input_d.split(" ")
list_f = input_f.split(" ")
list_numbers = list()
count = 0
for index_g in range(g):
for index_d1 in range(d):
for index_d2 in range(index_d1+1, d):
for index_f1 in range(f):
for index_f2 in range(index_f1+1, f):
for index_f3 in range(index_f2+1, f):
list_numbers.append(list_g[index_g])
list_numbers.append(list_d[index_d1])
list_numbers.append(list_d[index_d2])
list_numbers.append(list_f[index_f1])
list_numbers.append(list_f[index_f2])
list_numbers.append(list_f[index_f3])
count += numbers_check(list_numbers)
list_numbers.clear()
print(count)
if __name__ == "__main__":
main() | if int(list_n[i]) - min_n*2==0: | 6 | decision |
def numbers_check(list_n):
list_n.sort()
min_n = int(list_n[0])
i = 5
while i:
if int(list_n[i]) - min_n*2 > 0:
return 0
i -= 1
return 1
def main():
gdf = input()
input_g = input()
input_d = input()
input_f = input()
g, d, f = gdf.split(" ")
g = int(g)
d = int(d)
f = int(f)
list_g = input_g.split(" ")
list_d = input_d.split(" ")
list_f = input_f.split(" ")
list_numbers = list()
count = 0
for index_g in range(g):
for index_d1 in range(d):
for index_d2 in range(index_d1+1, d):
for index_f1 in range(f):
for index_f2 in range(index_f1+1, f):
for index_f3 in range(index_f2+1, f):
list_numbers.append(list_g[index_g])
list_numbers.append(list_d[index_d1])
list_numbers.append(list_d[index_d2])
list_numbers.append(list_f[index_f1])
list_numbers.append(list_f[index_f2])
list_numbers.append(list_f[index_f3])
count += numbers_check(list_numbers)
list_numbers.clear()
print(count)
if __name__ == "__main__":
main() | def numbers_check(list_n):
list_n.sort()
min_n = int(list_n[0])
i = 5
while i:
if int(list_n[i]) - min_n*2 > 0:
return 0
i -= 1
return 1
def main():
gdf = input()
input_g = input()
input_d = input()
input_f = input()
g, d, f = gdf.split(" ")
g = int(g)
d = int(d)
f = int(f)
list_g = input_g.split(" ")
list_d = input_d.split(" ")
list_f = input_f.x(" ")
list_numbers = list()
count = 0
for index_g in range(g):
for index_d1 in range(d):
for index_d2 in range(index_d1+1, d):
for index_f1 in range(f):
for index_f2 in range(index_f1+1, f):
for index_f3 in range(index_f2+1, f):
list_numbers.append(list_g[index_g])
list_numbers.append(list_d[index_d1])
list_numbers.append(list_d[index_d2])
list_numbers.append(list_f[index_f1])
list_numbers.append(list_f[index_f2])
list_numbers.append(list_f[index_f3])
count += numbers_check(list_numbers)
list_numbers.clear()
print(count)
if __name__ == "__main__":
main() | list_f = input_f.x(" ") | 26 | statement |
def numbers_check(list_n):
list_n.sort()
min_n = int(list_n[0])
i = 5
while i:
if int(list_n[i]) - min_n*2 > 0:
return 0
i -= 1
return 1
def main():
gdf = input()
input_g = input()
input_d = input()
input_f = input()
g, d, f = gdf.split(" ")
g = int(g)
d = int(d)
f = int(f)
list_g = input_g.split(" ")
list_d = input_d.split(" ")
list_f = input_f.split(" ")
list_numbers = list()
count = 0
for index_g in range(g):
for index_d1 in range(d):
for index_d2 in range(index_d1+1, d):
for index_f1 in range(f):
for index_f2 in range(index_f1+1, f):
for index_f3 in range(index_f2+1, f):
list_numbers.append(list_g[index_g])
list_numbers.append(list_d[index_d1])
list_numbers.append(list_d[index_d2])
list_numbers.append(list_f[index_f1])
list_numbers.append(list_f[index_f2])
list_numbers.append(list_f[index_f3])
count += numbers_check(list_numbers)
list_numbers.clear()
print(count)
if __name__ == "__main__":
main() | def numbers_check(list_n):
list_n.sort()
min_n = int(list_n[0])
i = 5
while i:
if int(list_n[i]) - min_n*2 > 0:
return 0
i -= 1
return 1
def main():
gdf = input()
input_g = input()
input_d = input()
input_f = input()
g, d, f = gdf.split(" ")
g = int(g)
d = int(d)
f = int(f)
list_g = input_g.split(" ")
list_d = input_d.split(" ")
list_f = input_f.split(" ")
list_numbers = list()
count = 0
for index_g in range(g):
for index_d1 in range(d):
for index_d2 in range(index_d1+1, d):
for index_f1 in range(f):
for index_f2 in range(index_f1<<1, f):
for index_f3 in range(index_f2+1, f):
list_numbers.append(list_g[index_g])
list_numbers.append(list_d[index_d1])
list_numbers.append(list_d[index_d2])
list_numbers.append(list_f[index_f1])
list_numbers.append(list_f[index_f2])
list_numbers.append(list_f[index_f3])
count += numbers_check(list_numbers)
list_numbers.clear()
print(count)
if __name__ == "__main__":
main() | for index_f2 in range(index_f1<<1, f): | 36 | operation |
a=list(input())
if len(a)<26:
print(-1)
exit(0)
else:
i=a.index('a')+1
x=1
while x<26 and i<len(a) :
if ord(a[i])<=ord('a')+x:
a[i]=chr(ord('a')+x)
x+=1
i+=1
if x<26:
print(-1)
else:
print(''.join(a)) | a=list(input())
if len(a)<26:
print(-1)
exit(0)
else:
i=a.index('a')%1
x=1
while x<26 and i<len(a) :
if ord(a[i])<=ord('a')+x:
a[i]=chr(ord('a')+x)
x+=1
i+=1
if x<26:
print(-1)
else:
print(''.join(a)) | i=a.index('a')%1 | 6 | operation |
a=list(input())
if len(a)<26:
print(-1)
exit(0)
else:
i=a.index('a')+1
x=1
while x<26 and i<len(a) :
if ord(a[i])<=ord('a')+x:
a[i]=chr(ord('a')+x)
x+=1
i+=1
if x<26:
print(-1)
else:
print(''.join(a)) | a=list(input())
if len(a)<26:
print(-1)
exit(0)
else:
i=a.index('a')+1
x=1
while x<26 and i<len(a) :
if ord(a[i])<=ord('a')+x:
a[i]=chr(ord('a')+x)
x+=1
i+=1
if x>26:
print(-1)
else:
print(''.join(a)) | if x>26: | 13 | decision |
a=list(input())
if len(a)<26:
print(-1)
exit(0)
else:
i=a.index('a')+1
x=1
while x<26 and i<len(a) :
if ord(a[i])<=ord('a')+x:
a[i]=chr(ord('a')+x)
x+=1
i+=1
if x<26:
print(-1)
else:
print(''.join(a)) | a=list(input())
if len(a)<26:
print(-1)
exit(0)
else:
i=a.index('a')+1
x=1
while x<26 and i<len(a) :
if ord(a[i])<=ord('a')%x:
a[i]=chr(ord('a')+x)
x+=1
i+=1
if x<26:
print(-1)
else:
print(''.join(a)) | if ord(a[i])<=ord('a')%x: | 9 | operation |
a=list(input())
if len(a)<26:
print(-1)
exit(0)
else:
i=a.index('a')+1
x=1
while x<26 and i<len(a) :
if ord(a[i])<=ord('a')+x:
a[i]=chr(ord('a')+x)
x+=1
i+=1
if x<26:
print(-1)
else:
print(''.join(a)) | a=list(input())
if len(a)<26:
print(-1)
exit(0)
else:
i=a.index('a')+1
x=1
while x<26 and i<len(a) :
if ord(a[i])<=ord('a')+x:
a[i]=chr(ord('a')^x)
x+=1
i+=1
if x<26:
print(-1)
else:
print(''.join(a)) | a[i]=chr(ord('a')^x) | 10 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.