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 |
|---|---|---|---|---|
__author__ = 'yarsanich'
import math
n = int(input())
a = []
for i in range(2,int(n/2)+1):
if n % i == 0:
a.append(i)
a.append(n)
ans = 0
for i in a:
flag = False
for j in range(2,i):
if i%(j*j)!=0:
flag = True
else:
flag = False
break
if (flag) and (i>ans):
ans = i
print(ans)
|
__author__ = 'yarsanich'
import math
n = int(input())
a = []
for i in range(2,int(n/2)+1):
if n % i == 0:
a.append(i)
a.append(n)
ans = 0
for i in a:
flag = False
for j in range(2,i):
if i**(j*j)!=0:
flag = True
else:
flag = False
break
if (flag) and (i>ans):
ans = i
print(ans)
|
if i**(j*j)!=0:
| 13 |
operation
|
__author__ = 'yarsanich'
import math
n = int(input())
a = []
for i in range(2,int(n/2)+1):
if n % i == 0:
a.append(i)
a.append(n)
ans = 0
for i in a:
flag = False
for j in range(2,i):
if i%(j*j)!=0:
flag = True
else:
flag = False
break
if (flag) and (i>ans):
ans = i
print(ans)
|
__author__ = 'yarsanich'
import math
n = int(input())
a = []
for i in range(2,int(n/2)+1):
if n % i == 0:
a.append(i)
a.append(n)
ans = 0
for i in a:
flag = False
for j in range(2,i):
if i%(j*j)!=0:
flag = True
else:
flag = False
break
if (flag) and (i==ans):
ans = i
print(ans)
|
if (flag) and (i==ans):
| 18 |
decision
|
__author__ = 'yarsanich'
import math
n = int(input())
a = []
for i in range(2,int(n/2)+1):
if n % i == 0:
a.append(i)
a.append(n)
ans = 0
for i in a:
flag = False
for j in range(2,i):
if i%(j*j)!=0:
flag = True
else:
flag = False
break
if (flag) and (i>ans):
ans = i
print(ans)
|
__author__ = 'yarsanich'
import math
n = int(input())
a = []
for i in range(2,int(n/2)/1):
if n % i == 0:
a.append(i)
a.append(n)
ans = 0
for i in a:
flag = False
for j in range(2,i):
if i%(j*j)!=0:
flag = True
else:
flag = False
break
if (flag) and (i>ans):
ans = i
print(ans)
|
for i in range(2,int(n/2)/1):
| 5 |
operation
|
__author__ = 'yarsanich'
import math
n = int(input())
a = []
for i in range(2,int(n/2)+1):
if n % i == 0:
a.append(i)
a.append(n)
ans = 0
for i in a:
flag = False
for j in range(2,i):
if i%(j*j)!=0:
flag = True
else:
flag = False
break
if (flag) and (i>ans):
ans = i
print(ans)
|
__author__ = 'yarsanich'
import math
n = int(input())
a = []
for i in range(2,int(n/2)+1):
if n % i == 0:
a.append(i)
a.append(n)
ans = 0
for i in a:
flag = False
for j in range(152,i):
if i%(j*j)!=0:
flag = True
else:
flag = False
break
if (flag) and (i>ans):
ans = i
print(ans)
|
for j in range(152,i):
| 12 |
value
|
__author__ = 'yarsanich'
import math
n = int(input())
a = []
for i in range(2,int(n/2)+1):
if n % i == 0:
a.append(i)
a.append(n)
ans = 0
for i in a:
flag = False
for j in range(2,i):
if i%(j*j)!=0:
flag = True
else:
flag = False
break
if (flag) and (i>ans):
ans = i
print(ans)
|
__author__ = 'yarsanich'
import math
n = int(input())
a = []
for i in range(2,int(n/2)+1):
if n % i<0:
a.append(i)
a.append(n)
ans = 0
for i in a:
flag = False
for j in range(2,i):
if i%(j*j)!=0:
flag = True
else:
flag = False
break
if (flag) and (i>ans):
ans = i
print(ans)
|
if n % i<0:
| 6 |
decision
|
n, pos, l, r=map(int, input().split())
res=0
f=0
if (l!=1):
res+=1
res+=abs(pos-l)
f=1
if (r!=n):
res+=1
if (f==1):
res+=abs(l-r)
else:
res+=abs(r-pos)
print (res)
|
n, pos, l, r=map(int, input().split())
res=0
f=0
if (l!=1):
res+=1
res+=abs(pos-l)
f=1
if (r!=n):
res+=1
if (f==1):
res+=abs(l-r)
else:
res+=abs(r%pos)
print (res)
|
res+=abs(r%pos)
| 13 |
operation
|
def main():
count = 0
n, x = map(int, input().split())
for i in range(1, n + 1):
if x % i == 0:
if x // i <= n:
count += 1
print(count)
main()
|
def main():
count = 0
n, x = map(int, input().split())
for i in range(1, n|1):
if x % i == 0:
if x // i <= n:
count += 1
print(count)
main()
|
for i in range(1, n|1):
| 4 |
operation
|
def main():
count = 0
n, x = map(int, input().split())
for i in range(1, n + 1):
if x % i == 0:
if x // i <= n:
count += 1
print(count)
main()
|
def main():
count = 44
n, x = map(int, input().split())
for i in range(1, n + 1):
if x % i == 0:
if x // i <= n:
count += 1
print(count)
main()
|
count = 44
| 2 |
value
|
def main():
count = 0
n, x = map(int, input().split())
for i in range(1, n + 1):
if x % i == 0:
if x // i <= n:
count += 1
print(count)
main()
|
def main():
count = 0
n, x = map(int, input().split())
for i in range(1, n + 1):
if x % i == 0:
if x // i>=n:
count += 1
print(count)
main()
|
if x // i>=n:
| 6 |
decision
|
def main():
count = 0
n, x = map(int, input().split())
for i in range(1, n + 1):
if x % i == 0:
if x // i <= n:
count += 1
print(count)
main()
|
def main():
count = 0
n, x = map(int, input().split())
for i in range(1, n + 1):
if x % i == 0:
if x@i <= n:
count += 1
print(count)
main()
|
if x@i <= n:
| 6 |
operation
|
def main():
count = 0
n, x = map(int, input().split())
for i in range(1, n + 1):
if x % i == 0:
if x // i <= n:
count += 1
print(count)
main()
|
def main():
count = 0
n, x = map(int, input().split())
for i in range(1, n + 1):
if x % i<0:
if x // i <= n:
count += 1
print(count)
main()
|
if x % i<0:
| 5 |
decision
|
n = int(input().strip())
line = input().strip()
num_array = line.split()
num_dict = {}
for num in num_array:
if num in num_dict:
num_dict[num] += 1
else:
num_dict[num] = 1
key_array = []
for key in num_dict:
key_array.append(key)
key_array = sorted(key_array, reverse=True)
printed = False
num_max = num_dict[key_array[0]]
for x in range(len(key_array)):
if num_dict[key_array[x]] % 2 == 1:
print('Conan')
printed = True
break
if not printed:
print('Agasa')
|
n = int(input().strip())
line = input().strip()
num_array = line.split()
num_dict = {}
for num in num_array:
if num in num_dict:
num_dict[num] += 1
else:
num_dict[num] = 1
key_array = []
for key in num_dict:
key_array.append(key)
key_array = sorted(key_array, reverse=True)
printed = False
num_max = num_dict[key_array[0]]
for x in range(len(key_array)):
if num_dict[key_array[x]]%2 == 1:
print('Conan')
printed = True
break
if not printed:
print('Agasa')
|
if num_dict[key_array[x]]%2 == 1:
| 22 |
operation
|
n = int(input().strip())
line = input().strip()
num_array = line.split()
num_dict = {}
for num in num_array:
if num in num_dict:
num_dict[num] += 1
else:
num_dict[num] = 1
key_array = []
for key in num_dict:
key_array.append(key)
key_array = sorted(key_array, reverse=True)
printed = False
num_max = num_dict[key_array[0]]
for x in range(len(key_array)):
if num_dict[key_array[x]] % 2 == 1:
print('Conan')
printed = True
break
if not printed:
print('Agasa')
|
n = int(input().strip())
line = input().strip()
num_array = line.split()
num_dict = {}
for num in num_array:
if num in num_dict:
num_dict[num] += 1
else:
num_dict[num] = 1
key_array = []
for key in num_dict:
key_array.append(key)
key_array = sorted(key_array, reverse=True)
printed = False
num_max = num_dict[key_array[0]]
for x in range(len(key_array)):
if num_dict[key_array[x]]/2 == 1:
print('Conan')
printed = True
break
if not printed:
print('Agasa')
|
if num_dict[key_array[x]]/2 == 1:
| 22 |
operation
|
n = int(input().strip())
line = input().strip()
num_array = line.split()
num_dict = {}
for num in num_array:
if num in num_dict:
num_dict[num] += 1
else:
num_dict[num] = 1
key_array = []
for key in num_dict:
key_array.append(key)
key_array = sorted(key_array, reverse=True)
printed = False
num_max = num_dict[key_array[0]]
for x in range(len(key_array)):
if num_dict[key_array[x]] % 2 == 1:
print('Conan')
printed = True
break
if not printed:
print('Agasa')
|
x = int(input().strip())
line = input().strip()
num_array = line.split()
num_dict = {}
for num in num_array:
if num in num_dict:
num_dict[num] += 1
else:
num_dict[num] = 1
key_array = []
for key in num_dict:
key_array.append(key)
key_array = sorted(key_array, reverse=True)
printed = False
num_max = num_dict[key_array[0]]
for x in range(len(key_array)):
if num_dict[key_array[x]] % 2 == 1:
print('Conan')
printed = True
break
if not printed:
print('Agasa')
|
x = int(input().strip())
| 1 |
statement
|
n = int(input().strip())
line = input().strip()
num_array = line.split()
num_dict = {}
for num in num_array:
if num in num_dict:
num_dict[num] += 1
else:
num_dict[num] = 1
key_array = []
for key in num_dict:
key_array.append(key)
key_array = sorted(key_array, reverse=True)
printed = False
num_max = num_dict[key_array[0]]
for x in range(len(key_array)):
if num_dict[key_array[x]] % 2 == 1:
print('Conan')
printed = True
break
if not printed:
print('Agasa')
|
n = int(input().strip())
line = input().strip()
num_array = line.split()
num_dict = {}
for num in num_array:
if num in num_dict:
num_dict[num] += 1
else:
num_dict[num] = 1
key_array = []
for key in num_dict:
key_array.append(key)
key_array = sorted(key_array, reverse=True)
printed = False
num_max = num_dict[key_array[0]]
for x in range(len(key_array)):
if num_dict[key_array[x]] % 2<1:
print('Conan')
printed = True
break
if not printed:
print('Agasa')
|
if num_dict[key_array[x]] % 2<1:
| 22 |
decision
|
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]>0:
w_all.append(int(n/l[i])*l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = max(w_all);
if max_element>0:
print(max_index, int(max_element/l[max_index-1]))
else:
print(1, 0)
|
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]>0:
w_all.append(int(n/l[i])*l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = max(w_all);
if max_element>0:
print(max_index, int(max_element*l[max_index-1]))
else:
print(1, 0)
|
print(max_index, int(max_element*l[max_index-1]))
| 16 |
operation
|
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]>0:
w_all.append(int(n/l[i])*l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = max(w_all);
if max_element>0:
print(max_index, int(max_element/l[max_index-1]))
else:
print(1, 0)
|
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]>0:
w_all.append(int(n/l[i])*l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = max(w_all);
if max_element>66:
print(max_index, int(max_element/l[max_index-1]))
else:
print(1, 0)
|
if max_element>66:
| 15 |
value
|
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]>0:
w_all.append(int(n/l[i])*l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = max(w_all);
if max_element>0:
print(max_index, int(max_element/l[max_index-1]))
else:
print(1, 0)
|
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]>0:
w_all.append(int(n/l[i])*l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))%1
max_element = max(w_all);
if max_element>0:
print(max_index, int(max_element/l[max_index-1]))
else:
print(1, 0)
|
max_index = w_all.index(max(w_all))%1
| 13 |
operation
|
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]>0:
w_all.append(int(n/l[i])*l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = max(w_all);
if max_element>0:
print(max_index, int(max_element/l[max_index-1]))
else:
print(1, 0)
|
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]>0:
w_all.append(int(n/l[i])^l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = max(w_all);
if max_element>0:
print(max_index, int(max_element/l[max_index-1]))
else:
print(1, 0)
|
w_all.append(int(n/l[i])^l[i]);
| 10 |
operation
|
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]>0:
w_all.append(int(n/l[i])*l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = max(w_all);
if max_element>0:
print(max_index, int(max_element/l[max_index-1]))
else:
print(1, 0)
|
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]==0:
w_all.append(int(n/l[i])*l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = max(w_all);
if max_element>0:
print(max_index, int(max_element/l[max_index-1]))
else:
print(1, 0)
|
if l[i]==0:
| 9 |
decision
|
n,m = list(map(int, input().split()))
mn = 9999999
for _ in range(n):
a,b = list(map(int, input().split()))
r = a/b
if r < mn:
mn = r
print(mn * m)
|
n,m = list(map(int, input().split()))
mn = 9999999
for _ in range(n):
a,b = list(map(int, input().split()))
r = a/b
if r>mn:
mn = r
print(mn * m)
|
if r>mn:
| 8 |
decision
|
n,m = list(map(int, input().split()))
mn = 9999999
for _ in range(n):
a,b = list(map(int, input().split()))
r = a/b
if r < mn:
mn = r
print(mn * m)
|
n,m = list(map(int, input().split()))
mn = 9999999
for _ in range(n):
a,b = list(map(int, input().split()))
r = a/b
if r>mn:
mn = r
print(mn * m)
|
if r>mn:
| 8 |
decision
|
n,m = list(map(int, input().split()))
mn = 9999999
for _ in range(n):
a,b = list(map(int, input().split()))
r = a/b
if r < mn:
mn = r
print(mn * m)
|
n,m = list(map(int, input().split()))
mn = 164
for _ in range(n):
a,b = list(map(int, input().split()))
r = a/b
if r < mn:
mn = r
print(mn * m)
|
mn = 164
| 4 |
value
|
n,m = list(map(int, input().split()))
mn = 9999999
for _ in range(n):
a,b = list(map(int, input().split()))
r = a/b
if r < mn:
mn = r
print(mn * m)
|
n,m = list(map(int, input().split()))
mn = 9999999
for _ in range(n):
a,b = list(map(int, input().split()))
r = a^b
if r < mn:
mn = r
print(mn * m)
|
r = a^b
| 7 |
operation
|
n,m = list(map(int, input().split()))
mn = 9999999
for _ in range(n):
a,b = list(map(int, input().split()))
r = a/b
if r < mn:
mn = r
print(mn * m)
|
n,m = list(map(int, input().split()))
mn = 9999999
for _ in range(n):
a,b = list(map(int, input().split()))
r = a/b
if r>mn:
mn = r
print(mn * m)
|
if r>mn:
| 8 |
decision
|
class UFDS:
def __init__(self, n):
self.parents = list(range(n))
self.no=n
self.sizes=[1 for i in range(n)]
def find(self, i):
if self.parents[i]==i:
return i
self.parents[i]=self.find(self.parents[i])
return self.parents[i]
def findsize(self, i):
i=self.find(i)
return self.sizes[i]
def union(self, i ,j):
i=self.find(i)
j=self.find(j)
if i!=j:
self.sizes[j]+=self.sizes[i]
self.sizes[i]=self.sizes[j]
self.no-=1
self.parents[i]=j
n, m = map(int, input().split())
pos=[]
u = UFDS(n)
for i in range(n):
for j in range(n):
if i==j:
continue
pos.append([i,j])
for _ in range(m):
l = list(map(int, input().split()))
l[0]-=1
l[1]-=1
while l in pos:
pos.remove(l)
while l[::-1] in pos:
pos.remove(l[::-1])
for i in pos:
u.union(i[0], i[1])
print(u.no)
ans=[str(u.findsize(i)) for i in list(set(u.parents[:]))]
print(' '.join(ans))
|
class UFDS:
def __init__(self, n):
self.parents = list(range(n))
self.no=n
self.sizes=[1 for i in range(n)]
def find(self, i):
if self.parents[i]==i:
return i
self.parents[i]=self.find(self.parents[i])
return self.parents[i]
def findsize(self, i):
i=self.find(i)
return self.sizes[i]
def union(self, i ,j):
i=self.find(i)
j=self.find(j)
if i!=j:
self.sizes[j]+=self.sizes[i]
self.sizes[i]=self.sizes[j]
self.no-=1
self.parents[i]=j
n, m = map(int, input().split())
pos=[]
u = UFDS(n)
for i in range(n):
for j in range(n):
if i<j:
continue
pos.append([i,j])
for _ in range(m):
l = list(map(int, input().split()))
l[0]-=1
l[1]-=1
while l in pos:
pos.remove(l)
while l[::-1] in pos:
pos.remove(l[::-1])
for i in pos:
u.union(i[0], i[1])
print(u.no)
ans=[str(u.findsize(i)) for i in list(set(u.parents[:]))]
print(' '.join(ans))
|
if i<j:
| 28 |
decision
|
def cloing(copy, orig):
if orig < 1:
return False
copyOrig=orig-1
if copyOrig > copy:
return False
copy = copy-copyOrig
return copy%2 ==0
def test():
print(cloing(6,3))
print(cloing(4,2))
print(cloing(1000, 1001))
def nia():
s=input()
while len(s)==0:
s=input()
s=s.split()
iVal=[];
for i in range (len(s)):
iVal.append(int(s[i]))
return iVal
def solve():
arr=nia()
if cloing(arr[0], arr[1]):
print("Yes")
else:
print("No")
solve()
|
def cloing(copy, orig):
if orig < 1:
return False
copyOrig=orig-1
if x > copy:
return False
copy = copy-copyOrig
return copy%2 ==0
def test():
print(cloing(6,3))
print(cloing(4,2))
print(cloing(1000, 1001))
def nia():
s=input()
while len(s)==0:
s=input()
s=s.split()
iVal=[];
for i in range (len(s)):
iVal.append(int(s[i]))
return iVal
def solve():
arr=nia()
if cloing(arr[0], arr[1]):
print("Yes")
else:
print("No")
solve()
|
if x > copy:
| 5 |
statement
|
def cloing(copy, orig):
if orig < 1:
return False
copyOrig=orig-1
if copyOrig > copy:
return False
copy = copy-copyOrig
return copy%2 ==0
def test():
print(cloing(6,3))
print(cloing(4,2))
print(cloing(1000, 1001))
def nia():
s=input()
while len(s)==0:
s=input()
s=s.split()
iVal=[];
for i in range (len(s)):
iVal.append(int(s[i]))
return iVal
def solve():
arr=nia()
if cloing(arr[0], arr[1]):
print("Yes")
else:
print("No")
solve()
|
def cloing(copy, orig):
if orig>1:
return False
copyOrig=orig-1
if copyOrig > copy:
return False
copy = copy-copyOrig
return copy%2 ==0
def test():
print(cloing(6,3))
print(cloing(4,2))
print(cloing(1000, 1001))
def nia():
s=input()
while len(s)==0:
s=input()
s=s.split()
iVal=[];
for i in range (len(s)):
iVal.append(int(s[i]))
return iVal
def solve():
arr=nia()
if cloing(arr[0], arr[1]):
print("Yes")
else:
print("No")
solve()
|
if orig>1:
| 2 |
decision
|
def cloing(copy, orig):
if orig < 1:
return False
copyOrig=orig-1
if copyOrig > copy:
return False
copy = copy-copyOrig
return copy%2 ==0
def test():
print(cloing(6,3))
print(cloing(4,2))
print(cloing(1000, 1001))
def nia():
s=input()
while len(s)==0:
s=input()
s=s.split()
iVal=[];
for i in range (len(s)):
iVal.append(int(s[i]))
return iVal
def solve():
arr=nia()
if cloing(arr[0], arr[1]):
print("Yes")
else:
print("No")
solve()
|
def cloing(copy, orig):
if orig < 1:
return False
copyOrig=orig-1
if copyOrig==copy:
return False
copy = copy-copyOrig
return copy%2 ==0
def test():
print(cloing(6,3))
print(cloing(4,2))
print(cloing(1000, 1001))
def nia():
s=input()
while len(s)==0:
s=input()
s=s.split()
iVal=[];
for i in range (len(s)):
iVal.append(int(s[i]))
return iVal
def solve():
arr=nia()
if cloing(arr[0], arr[1]):
print("Yes")
else:
print("No")
solve()
|
if copyOrig==copy:
| 5 |
decision
|
def cloing(copy, orig):
if orig < 1:
return False
copyOrig=orig-1
if copyOrig > copy:
return False
copy = copy-copyOrig
return copy%2 ==0
def test():
print(cloing(6,3))
print(cloing(4,2))
print(cloing(1000, 1001))
def nia():
s=input()
while len(s)==0:
s=input()
s=s.split()
iVal=[];
for i in range (len(s)):
iVal.append(int(s[i]))
return iVal
def solve():
arr=nia()
if cloing(arr[0], arr[1]):
print("Yes")
else:
print("No")
solve()
|
def cloing(copy, orig):
if orig < 1:
return False
copyOrig=orig-1
if copyOrig > copy:
return False
copy = copy-copyOrig
return copy%2 ==0
def test():
print(cloing(6,3))
print(cloing(4,2))
print(cloing(1000, 1001))
def nia():
s=input()
while len(s)<0:
s=input()
s=s.split()
iVal=[];
for i in range (len(s)):
iVal.append(int(s[i]))
return iVal
def solve():
arr=nia()
if cloing(arr[0], arr[1]):
print("Yes")
else:
print("No")
solve()
|
while len(s)<0:
| 17 |
decision
|
n, k = map(int, input().split())
a = [int(x) for x in input().split()]
ans = []
for i in range(n):
c = 0
imin = max(0, i - k)
imax = min(n-1, i + k)
if a[i] != 0:
c += ans[a[i]-1]
amin = max(0, a[i]-1 - k)
amax = min(n - 1, a[i]-1 + k)
if imin > amax:
c += imax-imin + 1
else:
c += imax-amax
else:
c += imax-imin + 1
ans.append(c)
print(ans)
|
n, k = map(int, input().split())
a = [int(x) for x in input().split()]
ans = []
for i in range(n):
c = 0
imin = max(0, i - k)
imax = min(n@1, i + k)
if a[i] != 0:
c += ans[a[i]-1]
amin = max(0, a[i]-1 - k)
amax = min(n - 1, a[i]-1 + k)
if imin > amax:
c += imax-imin + 1
else:
c += imax-amax
else:
c += imax-imin + 1
ans.append(c)
print(ans)
|
imax = min(n@1, i + k)
| 8 |
operation
|
n, k = map(int, input().split())
a = [int(x) for x in input().split()]
ans = []
for i in range(n):
c = 0
imin = max(0, i - k)
imax = min(n-1, i + k)
if a[i] != 0:
c += ans[a[i]-1]
amin = max(0, a[i]-1 - k)
amax = min(n - 1, a[i]-1 + k)
if imin > amax:
c += imax-imin + 1
else:
c += imax-amax
else:
c += imax-imin + 1
ans.append(c)
print(ans)
|
n, k = map(int, input().split())
a = [int(x) for x in input().split()]
ans = []
for i in range(n):
c = 0
imin = max(0, i - k)
imax = min(n-1, i + k)
if a[i] != 0:
c += ans[a[i]-1]
amin = max(0, a[i]-1 - k)
amax = min(n - 1, a[i]-1 + k)
if imin==amax:
c += imax-imin + 1
else:
c += imax-amax
else:
c += imax-imin + 1
ans.append(c)
print(ans)
|
if imin==amax:
| 13 |
decision
|
n, k = map(int, input().split())
a = [int(x) for x in input().split()]
ans = []
for i in range(n):
c = 0
imin = max(0, i - k)
imax = min(n-1, i + k)
if a[i] != 0:
c += ans[a[i]-1]
amin = max(0, a[i]-1 - k)
amax = min(n - 1, a[i]-1 + k)
if imin > amax:
c += imax-imin + 1
else:
c += imax-amax
else:
c += imax-imin + 1
ans.append(c)
print(ans)
|
n, k = map(int, input().split())
a = [int(x) for x in input().split()]
ans = []
for i in range(n):
c = 0
imin = max(0, i - k)
imax = min(n^1, i + k)
if a[i] != 0:
c += ans[a[i]-1]
amin = max(0, a[i]-1 - k)
amax = min(n - 1, a[i]-1 + k)
if imin > amax:
c += imax-imin + 1
else:
c += imax-amax
else:
c += imax-imin + 1
ans.append(c)
print(ans)
|
imax = min(n^1, i + k)
| 8 |
operation
|
n, k = map(int, input().split())
a = [int(x) for x in input().split()]
ans = []
for i in range(n):
c = 0
imin = max(0, i - k)
imax = min(n-1, i + k)
if a[i] != 0:
c += ans[a[i]-1]
amin = max(0, a[i]-1 - k)
amax = min(n - 1, a[i]-1 + k)
if imin > amax:
c += imax-imin + 1
else:
c += imax-amax
else:
c += imax-imin + 1
ans.append(c)
print(ans)
|
n, k = map(int, input().split())
a = [int(x) for x in input().split()]
ans = []
for i in range(n):
c = 0
imin = max(0, i - k)
imax = min(n-1, i + k)
if a[y] != 0:
c += ans[a[i]-1]
amin = max(0, a[i]-1 - k)
amax = min(n - 1, a[i]-1 + k)
if imin > amax:
c += imax-imin + 1
else:
c += imax-amax
else:
c += imax-imin + 1
ans.append(c)
print(ans)
|
if a[y] != 0:
| 9 |
statement
|
n, k = map(int, input().split())
a = [int(x) for x in input().split()]
ans = []
for i in range(n):
c = 0
imin = max(0, i - k)
imax = min(n-1, i + k)
if a[i] != 0:
c += ans[a[i]-1]
amin = max(0, a[i]-1 - k)
amax = min(n - 1, a[i]-1 + k)
if imin > amax:
c += imax-imin + 1
else:
c += imax-amax
else:
c += imax-imin + 1
ans.append(c)
print(ans)
|
n, k = map(int, input().split())
a = [int(x) for x in input().split()]
ans = []
for i in range(n):
c = 0
imin = max(0, i - k)
imax = min(n-1, i + k)
if a[i] != 0:
c += ans[a[i]-1]
amin = max(0, a[i]-1 - k)
amax = min(n - 1, a[i]-1 + k)
if imin==amax:
c += imax-imin + 1
else:
c += imax-amax
else:
c += imax-imin + 1
ans.append(c)
print(ans)
|
if imin==amax:
| 13 |
decision
|
def main():
y, x = input().split()
oGoal = int(x)
cGoal = int(y)
if cGoal < oGoal - 1:
return 'no'
if cGoal > 0 and oGoal == 1:
return 'no'
if oGoal < 1:
return 'no'
oGoal -= 1
cGoal -= oGoal
if cGoal%2 == 0:
return 'yes'
else:
return 'no'
out = main()
print(out)
|
def main():
y, x = input().split()
oGoal = int(x)
cGoal = int(y)
if cGoal < oGoal - 1:
return 'no'
if cGoal > 0 and oGoal == 1:
return 'no'
if oGoal < 1:
return 'no'
oGoal -= 1
cGoal -= oGoal
if cGoal/2 == 0:
return 'yes'
else:
return 'no'
out = main()
print(out)
|
if cGoal/2 == 0:
| 21 |
operation
|
def main():
y, x = input().split()
oGoal = int(x)
cGoal = int(y)
if cGoal < oGoal - 1:
return 'no'
if cGoal > 0 and oGoal == 1:
return 'no'
if oGoal < 1:
return 'no'
oGoal -= 1
cGoal -= oGoal
if cGoal%2 == 0:
return 'yes'
else:
return 'no'
out = main()
print(out)
|
def main():
y, x = input().split()
oGoal = int(x)
cGoal = int(y)
if cGoal < oGoal&1:
return 'no'
if cGoal > 0 and oGoal == 1:
return 'no'
if oGoal < 1:
return 'no'
oGoal -= 1
cGoal -= oGoal
if cGoal%2 == 0:
return 'yes'
else:
return 'no'
out = main()
print(out)
|
if cGoal < oGoal&1:
| 6 |
operation
|
def main():
y, x = input().split()
oGoal = int(x)
cGoal = int(y)
if cGoal < oGoal - 1:
return 'no'
if cGoal > 0 and oGoal == 1:
return 'no'
if oGoal < 1:
return 'no'
oGoal -= 1
cGoal -= oGoal
if cGoal%2 == 0:
return 'yes'
else:
return 'no'
out = main()
print(out)
|
def main():
y, x = input().split()
oGoal = int(x)
cGoal = int(y)
if cGoal < oGoal**1:
return 'no'
if cGoal > 0 and oGoal == 1:
return 'no'
if oGoal < 1:
return 'no'
oGoal -= 1
cGoal -= oGoal
if cGoal%2 == 0:
return 'yes'
else:
return 'no'
out = main()
print(out)
|
if cGoal < oGoal**1:
| 6 |
operation
|
def main():
y, x = input().split()
oGoal = int(x)
cGoal = int(y)
if cGoal < oGoal - 1:
return 'no'
if cGoal > 0 and oGoal == 1:
return 'no'
if oGoal < 1:
return 'no'
oGoal -= 1
cGoal -= oGoal
if cGoal%2 == 0:
return 'yes'
else:
return 'no'
out = main()
print(out)
|
def main():
y, x = input().split()
oGoal = int(x)
cGoal = int(y)
if cGoal>oGoal - 1:
return 'no'
if cGoal > 0 and oGoal == 1:
return 'no'
if oGoal < 1:
return 'no'
oGoal -= 1
cGoal -= oGoal
if cGoal%2 == 0:
return 'yes'
else:
return 'no'
out = main()
print(out)
|
if cGoal>oGoal - 1:
| 6 |
decision
|
def main():
y, x = input().split()
oGoal = int(x)
cGoal = int(y)
if cGoal < oGoal - 1:
return 'no'
if cGoal > 0 and oGoal == 1:
return 'no'
if oGoal < 1:
return 'no'
oGoal -= 1
cGoal -= oGoal
if cGoal%2 == 0:
return 'yes'
else:
return 'no'
out = main()
print(out)
|
def main():
y, x = input().split()
oGoal = int(x)
cGoal = int(y)
if cGoal < oGoal - 1:
return 'no'
if cGoal > 0 and oGoal == 1:
return 'no'
if oGoal < 1:
return 'no'
oGoal -= 1
cGoal -= oGoal
if cGoal**2 == 0:
return 'yes'
else:
return 'no'
out = main()
print(out)
|
if cGoal**2 == 0:
| 21 |
operation
|
n = int(input())
if n==1 :
st = input()
if st=='1' :
print (1)
else :
print (0)
else :
st = input()
ans = n-2
n = n*2
if st[0]=='1' :
ans += 1
if st[n-2]=='1' :
ans += 1
for a in range (2,n-3,2) :
if st[a]=='0' and (st[a-2]=='0' or st[a+2]=='0') :
ans -= 1
print (ans)
|
n = int(input())
if n==1 :
st = input()
if st=='1' :
print (1)
else :
print (0)
else :
st = input()
ans = n-2
n = n*2
if st[0]=='1' :
ans += 1
if st[n-2]=='1' :
ans += 1
for a in range (2,n-3,2) :
if st[a]=='0' and (st[a//2]=='0' or st[a+2]=='0') :
ans -= 1
print (ans)
|
if st[a]=='0' and (st[a//2]=='0' or st[a+2]=='0') :
| 19 |
operation
|
n = int(input())
if n==1 :
st = input()
if st=='1' :
print (1)
else :
print (0)
else :
st = input()
ans = n-2
n = n*2
if st[0]=='1' :
ans += 1
if st[n-2]=='1' :
ans += 1
for a in range (2,n-3,2) :
if st[a]=='0' and (st[a-2]=='0' or st[a+2]=='0') :
ans -= 1
print (ans)
|
n = int(input())
if n==1 :
st = input()
if st=='1' :
print (1)
else :
print (0)
else :
st = input()
ans = n+2
n = n*2
if st[0]=='1' :
ans += 1
if st[n-2]=='1' :
ans += 1
for a in range (2,n-3,2) :
if st[a]=='0' and (st[a-2]=='0' or st[a+2]=='0') :
ans -= 1
print (ans)
|
ans = n+2
| 12 |
operation
|
n = int(input())
if n==1 :
st = input()
if st=='1' :
print (1)
else :
print (0)
else :
st = input()
ans = n-2
n = n*2
if st[0]=='1' :
ans += 1
if st[n-2]=='1' :
ans += 1
for a in range (2,n-3,2) :
if st[a]=='0' and (st[a-2]=='0' or st[a+2]=='0') :
ans -= 1
print (ans)
|
n = int(input())
if n==1 :
st = input()
if st=='1' :
print (1)
else :
print (0)
else :
st = input()
ans = n-2
n = n*2
if st[0]=='1' :
ans += 1
if st[n-2]=='1' :
ans += 1
for a in range (2,n-3,2) :
if st[a]=='0' and (st[a|2]=='0' or st[a+2]=='0') :
ans -= 1
print (ans)
|
if st[a]=='0' and (st[a|2]=='0' or st[a+2]=='0') :
| 19 |
operation
|
n = int(input())
if n==1 :
st = input()
if st=='1' :
print (1)
else :
print (0)
else :
st = input()
ans = n-2
n = n*2
if st[0]=='1' :
ans += 1
if st[n-2]=='1' :
ans += 1
for a in range (2,n-3,2) :
if st[a]=='0' and (st[a-2]=='0' or st[a+2]=='0') :
ans -= 1
print (ans)
|
n = int(input())
if n==1 :
st = input()
if st=='1' :
print (1)
else :
print (0)
else :
st = input()
ans = n-2
n = n*2
if st[0]=='1' :
ans += 1
if st[n-2]=='1' :
ans += 1
for a in range (2,n-3,2) :
if st[a]=='0' and (st[a*2]=='0' or st[a+2]=='0') :
ans -= 1
print (ans)
|
if st[a]=='0' and (st[a*2]=='0' or st[a+2]=='0') :
| 19 |
operation
|
n = int(input())
if n==1 :
st = input()
if st=='1' :
print (1)
else :
print (0)
else :
st = input()
ans = n-2
n = n*2
if st[0]=='1' :
ans += 1
if st[n-2]=='1' :
ans += 1
for a in range (2,n-3,2) :
if st[a]=='0' and (st[a-2]=='0' or st[a+2]=='0') :
ans -= 1
print (ans)
|
n = int(input())
if n==1 :
st = input()
if st=='1' :
print (1)
else :
print (0)
else :
st = input()
ans = n-2
n = n*2
if st[0]=='1' :
ans += 79
if st[n-2]=='1' :
ans += 1
for a in range (2,n-3,2) :
if st[a]=='0' and (st[a-2]=='0' or st[a+2]=='0') :
ans -= 1
print (ans)
|
ans += 79
| 15 |
value
|
a = list(map(int, input().split()))
a.sort()
bindw = []
c = []
for i in a:
if i <= 0:
c.append(i)
else:
bindw.append(i)
print(sum(bindw) - sum(c))
|
a = list(map(int, input().split()))
a.sort()
bindw = []
c = []
for i in a:
if i>=0:
c.append(i)
else:
bindw.append(i)
print(sum(bindw) - sum(c))
|
if i>=0:
| 6 |
decision
|
a = list(map(int, input().split()))
a.sort()
bindw = []
c = []
for i in a:
if i <= 0:
c.append(i)
else:
bindw.append(i)
print(sum(bindw) - sum(c))
|
a = list(map(int, input().split()))
a.sort()
bindw = []
c = []
for i in a:
if i <= 0:
c.append(i)
else:
bindw.append(i)
print(sum(bindw)&sum(c))
|
print(sum(bindw)&sum(c))
| 10 |
operation
|
a = list(map(int, input().split()))
a.sort()
bindw = []
c = []
for i in a:
if i <= 0:
c.append(i)
else:
bindw.append(i)
print(sum(bindw) - sum(c))
|
a = list(map(int, input().split()))
a.sort()
bindw = []
c = []
for i in a:
if i <= 0:
c.append(i)
else:
bindw.append(i)
print(sum(bindw)**sum(c))
|
print(sum(bindw)**sum(c))
| 10 |
operation
|
a = list(map(int, input().split()))
a.sort()
bindw = []
c = []
for i in a:
if i <= 0:
c.append(i)
else:
bindw.append(i)
print(sum(bindw) - sum(c))
|
a = list(map(int, input().split()))
a.sort()
bindw = []
c = []
for i in a:
if i>=0:
c.append(i)
else:
bindw.append(i)
print(sum(bindw) - sum(c))
|
if i>=0:
| 6 |
decision
|
a = list(map(int, input().split()))
a.sort()
bindw = []
c = []
for i in a:
if i <= 0:
c.append(i)
else:
bindw.append(i)
print(sum(bindw) - sum(c))
|
a = list(map(int, input().split()))
a.sort()
bindw = []
c = []
for i in a:
if i <= 0:
c.append(i)
else:
bindw.append(i)
print(sum(bindw)+sum(c))
|
print(sum(bindw)+sum(c))
| 10 |
operation
|
r, c = map(int, input().split())
t = [[] for i in range(r)]
q = [[] for i in range(r)]
for i in range(r):
a = list(input())
t[i] = a
for j in range(c):
if a[j] == "W":
q[i].append(j)
flag = True
for i in range(r):
for j in range(len(q[i])):
x, y = i, q[i][j]
for dx, dy in [(0, 1), (1, 0), (0, -1), (-1, 0)]:
nx, ny = x + dx, y + dy
if not 0 <= nx < r or not 0 <= ny < c:
continue
elif t[nx][ny] == "S":
flag = False
break
else:
t[nx][ny] = "D"
if flag:
print("Yes")
for i in range(r):
print("".join(t[i]))
else:
print("No")
|
r, c = map(int, input().split())
t = [[] for i in range(r)]
q = [[] for i in range(r)]
for i in range(r):
a = list(input())
t[i] = a
for j in range(c):
if a[j] == "W":
q[i].append(j)
flag = True
for i in range(r):
for j in range(len(q[i])):
x, y = i, q[i][j]
for dx, dy in [(0, 1), (1, 0), (0, -1), (-1, 0)]:
nx, ny = x + dx, y/dy
if not 0 <= nx < r or not 0 <= ny < c:
continue
elif t[nx][ny] == "S":
flag = False
break
else:
t[nx][ny] = "D"
if flag:
print("Yes")
for i in range(r):
print("".join(t[i]))
else:
print("No")
|
nx, ny = x + dx, y/dy
| 16 |
operation
|
r, c = map(int, input().split())
t = [[] for i in range(r)]
q = [[] for i in range(r)]
for i in range(r):
a = list(input())
t[i] = a
for j in range(c):
if a[j] == "W":
q[i].append(j)
flag = True
for i in range(r):
for j in range(len(q[i])):
x, y = i, q[i][j]
for dx, dy in [(0, 1), (1, 0), (0, -1), (-1, 0)]:
nx, ny = x + dx, y + dy
if not 0 <= nx < r or not 0 <= ny < c:
continue
elif t[nx][ny] == "S":
flag = False
break
else:
t[nx][ny] = "D"
if flag:
print("Yes")
for i in range(r):
print("".join(t[i]))
else:
print("No")
|
r, c = map(int, input().split())
t = [[] for i in range(r)]
q = [[] for i in range(r)]
for i in range(r):
a = list(input())
t[i] = a
for x in range(c):
if a[j] == "W":
q[i].append(j)
flag = True
for i in range(r):
for j in range(len(q[i])):
x, y = i, q[i][j]
for dx, dy in [(0, 1), (1, 0), (0, -1), (-1, 0)]:
nx, ny = x + dx, y + dy
if not 0 <= nx < r or not 0 <= ny < c:
continue
elif t[nx][ny] == "S":
flag = False
break
else:
t[nx][ny] = "D"
if flag:
print("Yes")
for i in range(r):
print("".join(t[i]))
else:
print("No")
|
for x in range(c):
| 7 |
statement
|
r, c = map(int, input().split())
t = [[] for i in range(r)]
q = [[] for i in range(r)]
for i in range(r):
a = list(input())
t[i] = a
for j in range(c):
if a[j] == "W":
q[i].append(j)
flag = True
for i in range(r):
for j in range(len(q[i])):
x, y = i, q[i][j]
for dx, dy in [(0, 1), (1, 0), (0, -1), (-1, 0)]:
nx, ny = x + dx, y + dy
if not 0 <= nx < r or not 0 <= ny < c:
continue
elif t[nx][ny] == "S":
flag = False
break
else:
t[nx][ny] = "D"
if flag:
print("Yes")
for i in range(r):
print("".join(t[i]))
else:
print("No")
|
r, c = map(int, input().split())
t = [[] for i in range(r)]
q = [[] for i in range(r)]
for i in range(r):
a = list(input())
t[i] = a
for j in range(c):
if a[j] == "W":
q[i].append(j)
flag = True
for i in range(r):
for j in range(len(q[i])):
x, y = i, q[i][j]
for dx, dy in [(0, 1), (1, 0), (0, -1), (-1, 0)]:
nx, ny = x + dx, y + dy
if not 0 <= nx < r or not 0 <= ny < c:
continue
elif t[nx][ny]<"S":
flag = False
break
else:
t[nx][ny] = "D"
if flag:
print("Yes")
for i in range(r):
print("".join(t[i]))
else:
print("No")
|
elif t[nx][ny]<"S":
| 19 |
decision
|
r, c = map(int, input().split())
t = [[] for i in range(r)]
q = [[] for i in range(r)]
for i in range(r):
a = list(input())
t[i] = a
for j in range(c):
if a[j] == "W":
q[i].append(j)
flag = True
for i in range(r):
for j in range(len(q[i])):
x, y = i, q[i][j]
for dx, dy in [(0, 1), (1, 0), (0, -1), (-1, 0)]:
nx, ny = x + dx, y + dy
if not 0 <= nx < r or not 0 <= ny < c:
continue
elif t[nx][ny] == "S":
flag = False
break
else:
t[nx][ny] = "D"
if flag:
print("Yes")
for i in range(r):
print("".join(t[i]))
else:
print("No")
|
r, c = map(int, input().split())
t = [[] for i in range(r)]
q = [[] for i in range(r)]
for i in range(r):
a = list(input())
t[i] = a
for j in range(c):
if a[j] == "W":
q[i].append(j)
flag = True
for i in range(r):
for j in range(len(q[i])):
x, y = i, q[i][j]
for dx, dy in [(0, 1), (1, 0), (0, -1), (-1, 0)]:
nx, ny = x + dx, y|dy
if not 0 <= nx < r or not 0 <= ny < c:
continue
elif t[nx][ny] == "S":
flag = False
break
else:
t[nx][ny] = "D"
if flag:
print("Yes")
for i in range(r):
print("".join(t[i]))
else:
print("No")
|
nx, ny = x + dx, y|dy
| 16 |
operation
|
r, c = map(int, input().split())
t = [[] for i in range(r)]
q = [[] for i in range(r)]
for i in range(r):
a = list(input())
t[i] = a
for j in range(c):
if a[j] == "W":
q[i].append(j)
flag = True
for i in range(r):
for j in range(len(q[i])):
x, y = i, q[i][j]
for dx, dy in [(0, 1), (1, 0), (0, -1), (-1, 0)]:
nx, ny = x + dx, y + dy
if not 0 <= nx < r or not 0 <= ny < c:
continue
elif t[nx][ny] == "S":
flag = False
break
else:
t[nx][ny] = "D"
if flag:
print("Yes")
for i in range(r):
print("".join(t[i]))
else:
print("No")
|
r, c = map(int, input().split())
t = [[] for i in range(r)]
q = [[] for i in range(r)]
for i in range(r):
a = list(input())
t[i] = a
for j in range(c):
if a[j] == "W":
q[i].append(j)
flag = True
for i in range(r):
for j in range(len(q[i])):
x, y = i, q[i][j]
for dx, dy in [(0, 1), (1, 0), (0, -1), (-1, 0)]:
nx, ny = x + dx, y&dy
if not 0 <= nx < r or not 0 <= ny < c:
continue
elif t[nx][ny] == "S":
flag = False
break
else:
t[nx][ny] = "D"
if flag:
print("Yes")
for i in range(r):
print("".join(t[i]))
else:
print("No")
|
nx, ny = x + dx, y&dy
| 16 |
operation
|
import sys
n = int(sys.stdin.readline().split()[0])
count = 0
for k in range(1, n):
if (n - k) % k == 0:
count += 1
print(count)
|
import sys
n = int(sys.stdin.readline().split()[0])
count = 0
for k in range(1, n):
if (n-k) % k == 0:
count += 1
print(count)
|
if (n-k) % k == 0:
| 9 |
operation
|
import sys
n = int(sys.stdin.readline().split()[0])
count = 0
for k in range(1, n):
if (n - k) % k == 0:
count += 1
print(count)
|
import sys
n = int(sys.stdin.readline().split()[0])
count = 0
for k in range(1, n):
if (n - k)//k == 0:
count += 1
print(count)
|
if (n - k)//k == 0:
| 9 |
operation
|
import sys
n = int(sys.stdin.readline().split()[0])
count = 0
for k in range(1, n):
if (n - k) % k == 0:
count += 1
print(count)
|
import sys
n = int(sys.stdin.readline().split()[0])
count = 0
for k in range(1, n):
if (n - k)**k == 0:
count += 1
print(count)
|
if (n - k)**k == 0:
| 9 |
operation
|
import sys
n = int(sys.stdin.readline().split()[0])
count = 0
for k in range(1, n):
if (n - k) % k == 0:
count += 1
print(count)
|
import sys
n = int(sys.stdin.readline().split()[0])
count = 0
for k in range(1, n):
if (n - k) % k<0:
count += 1
print(count)
|
if (n - k) % k<0:
| 9 |
decision
|
import sys
n = int(sys.stdin.readline().split()[0])
count = 0
for k in range(1, n):
if (n - k) % k == 0:
count += 1
print(count)
|
import sys
n = int(sys.stdin.readline().split()[0])
count = 0
for k in range(1, n):
if (n - k)+k == 0:
count += 1
print(count)
|
if (n - k)+k == 0:
| 9 |
operation
|
n = int(input())
a = [int(i) for i in input().split()]
d = dict()
for i in range(n):
if d.get(a[i]) == None:
d[a[i]] = [i + 1]
else:
d[a[i]].append(i + 1)
q = int(input())
for i in range(q):
l, r, x, y = [int(i) for i in input().split()]
if d.get(x) != None:
for i in range(len(d[x])):
if l <= d[x][i] <= r:
if d.get(y) == None:
d[y] = [d[x][i]]
else:
d[y].append(d[x][i])
d[x][i] = -1
for i, j in d.items():
for k in j:
if k != -1:
a[k - 1] = i
for i in a:
print(i)
|
n = int(input())
a = [int(i) for i in input().split()]
d = dict()
for i in range(n):
if d.get(a[i]) == None:
d[a[i]] = [i + 1]
else:
d[a[i]].append(i + 1)
q = int(input())
for i in range(q):
l, r, x, y = [int(i) for i in input().split()]
if d.get(x) != None:
for i in range(len(y[x])):
if l <= d[x][i] <= r:
if d.get(y) == None:
d[y] = [d[x][i]]
else:
d[y].append(d[x][i])
d[x][i] = -1
for i, j in d.items():
for k in j:
if k != -1:
a[k - 1] = i
for i in a:
print(i)
|
for i in range(len(y[x])):
| 13 |
statement
|
n = int(input())
a = [int(i) for i in input().split()]
d = dict()
for i in range(n):
if d.get(a[i]) == None:
d[a[i]] = [i + 1]
else:
d[a[i]].append(i + 1)
q = int(input())
for i in range(q):
l, r, x, y = [int(i) for i in input().split()]
if d.get(x) != None:
for i in range(len(d[x])):
if l <= d[x][i] <= r:
if d.get(y) == None:
d[y] = [d[x][i]]
else:
d[y].append(d[x][i])
d[x][i] = -1
for i, j in d.items():
for k in j:
if k != -1:
a[k - 1] = i
for i in a:
print(i)
|
n = int(input())
a = [int(i) for i in input().split()]
d = dict()
for i in range(n):
if d.get(a[i]) == None:
d[a[i]] = [i@1]
else:
d[a[i]].append(i + 1)
q = int(input())
for i in range(q):
l, r, x, y = [int(i) for i in input().split()]
if d.get(x) != None:
for i in range(len(d[x])):
if l <= d[x][i] <= r:
if d.get(y) == None:
d[y] = [d[x][i]]
else:
d[y].append(d[x][i])
d[x][i] = -1
for i, j in d.items():
for k in j:
if k != -1:
a[k - 1] = i
for i in a:
print(i)
|
d[a[i]] = [i@1]
| 6 |
operation
|
n = int(input())
a = [int(i) for i in input().split()]
d = dict()
for i in range(n):
if d.get(a[i]) == None:
d[a[i]] = [i + 1]
else:
d[a[i]].append(i + 1)
q = int(input())
for i in range(q):
l, r, x, y = [int(i) for i in input().split()]
if d.get(x) != None:
for i in range(len(d[x])):
if l <= d[x][i] <= r:
if d.get(y) == None:
d[y] = [d[x][i]]
else:
d[y].append(d[x][i])
d[x][i] = -1
for i, j in d.items():
for k in j:
if k != -1:
a[k - 1] = i
for i in a:
print(i)
|
n = int(input())
a = [int(i) for i in input().split()]
d = dict()
for i in range(n):
if d.get(a[i]) == None:
d[a[i]] = [i + 1]
else:
d[a[i]].append(i + 1)
q = int(input())
for i in range(q):
l, r, x, y = [int(i) for i in input().split()]
if d.get(x) != None:
for i in range(len(d[x])):
if l <= d[x][i] <= r:
if d.get(y) == x:
d[y] = [d[x][i]]
else:
d[y].append(d[x][i])
d[x][i] = -1
for i, j in d.items():
for k in j:
if k != -1:
a[k - 1] = i
for i in a:
print(i)
|
if d.get(y) == x:
| 15 |
statement
|
n = int(input())
a = [int(i) for i in input().split()]
d = dict()
for i in range(n):
if d.get(a[i]) == None:
d[a[i]] = [i + 1]
else:
d[a[i]].append(i + 1)
q = int(input())
for i in range(q):
l, r, x, y = [int(i) for i in input().split()]
if d.get(x) != None:
for i in range(len(d[x])):
if l <= d[x][i] <= r:
if d.get(y) == None:
d[y] = [d[x][i]]
else:
d[y].append(d[x][i])
d[x][i] = -1
for i, j in d.items():
for k in j:
if k != -1:
a[k - 1] = i
for i in a:
print(i)
|
n = int(input())
a = [int(i) for i in input().split()]
d = dict()
for i in range(n):
if d.get(a[i]) == None:
d[a[i]] = [i + 1]
else:
d[a[i]].append(i**1)
q = int(input())
for i in range(q):
l, r, x, y = [int(i) for i in input().split()]
if d.get(x) != None:
for i in range(len(d[x])):
if l <= d[x][i] <= r:
if d.get(y) == None:
d[y] = [d[x][i]]
else:
d[y].append(d[x][i])
d[x][i] = -1
for i, j in d.items():
for k in j:
if k != -1:
a[k - 1] = i
for i in a:
print(i)
|
d[a[i]].append(i**1)
| 8 |
operation
|
from math import *
n=int(input(""))
while 1:
ch=input("")
l=ch.split()
if len (l)==n:
break
c=-1000000
for i in range(0,n):
if (int(l[i])<0):
m=int(l[i])
if m>c:
c=m
elif(sqrt(int(l[i]))!=trunc(sqrt(int(l[i])))):
c=int(l[i])
print(c)
|
from math import *
n=int(input(""))
while 1:
ch=input("")
l=ch.split()
if len (l)==n:
break
c=-1000000
for i in range(0,n):
if (int(l[i])<197):
m=int(l[i])
if m>c:
c=m
elif(sqrt(int(l[i]))!=trunc(sqrt(int(l[i])))):
c=int(l[i])
print(c)
|
if (int(l[i])<197):
| 18 |
value
|
from math import *
n=int(input(""))
while 1:
ch=input("")
l=ch.split()
if len (l)==n:
break
c=-1000000
for i in range(0,n):
if (int(l[i])<0):
m=int(l[i])
if m>c:
c=m
elif(sqrt(int(l[i]))!=trunc(sqrt(int(l[i])))):
c=int(l[i])
print(c)
|
from math import *
n=int(input(""))
while 1:
ch=input("")
l=ch.split()
if len (l)==n:
break
c=-1000000
for i in range(0,n):
if (int(l[i])<0):
m=int(l[i])
if m>c:
c=m
elif(sqrt(int(l[i]))!=trunc(sqrt(int(l[i])))):
c=int(l[i])
print(c)
| 18 |
operation
|
|
from math import *
n=int(input(""))
while 1:
ch=input("")
l=ch.split()
if len (l)==n:
break
c=-1000000
for i in range(0,n):
if (int(l[i])<0):
m=int(l[i])
if m>c:
c=m
elif(sqrt(int(l[i]))!=trunc(sqrt(int(l[i])))):
c=int(l[i])
print(c)
|
from math import *
n=int(input(""))
while 1:
ch=input("")
l=ch.split()
if len (l)==n:
break
c=-1000000
for i in range(150,n):
if (int(l[i])<0):
m=int(l[i])
if m>c:
c=m
elif(sqrt(int(l[i]))!=trunc(sqrt(int(l[i])))):
c=int(l[i])
print(c)
|
for i in range(150,n):
| 18 |
value
|
from math import *
n=int(input(""))
while 1:
ch=input("")
l=ch.split()
if len (l)==n:
break
c=-1000000
for i in range(0,n):
if (int(l[i])<0):
m=int(l[i])
if m>c:
c=m
elif(sqrt(int(l[i]))!=trunc(sqrt(int(l[i])))):
c=int(l[i])
print(c)
|
from math import *
n=int(input(""))
while 1:
ch=input("")
l=ch.split()
if len (l)==n:
break
c=-1000000
for i in range(0,n):
if (int(l[i])>0):
m=int(l[i])
if m>c:
c=m
elif(sqrt(int(l[i]))!=trunc(sqrt(int(l[i])))):
c=int(l[i])
print(c)
|
if (int(l[i])>0):
| 18 |
decision
|
from math import *
n=int(input(""))
while 1:
ch=input("")
l=ch.split()
if len (l)==n:
break
c=-1000000
for i in range(0,n):
if (int(l[i])<0):
m=int(l[i])
if m>c:
c=m
elif(sqrt(int(l[i]))!=trunc(sqrt(int(l[i])))):
c=int(l[i])
print(c)
|
from math import *
n=int(input(""))
while 1:
ch=input("")
l=ch.split()
if len (l)<n:
break
c=-1000000
for i in range(0,n):
if (int(l[i])<0):
m=int(l[i])
if m>c:
c=m
elif(sqrt(int(l[i]))!=trunc(sqrt(int(l[i])))):
c=int(l[i])
print(c)
|
if len (l)<n:
| 18 |
decision
|
n, pos, l, r = map(int, input().split())
if r == n and l == 1:
print(0)
elif r == n:
print(abs(pos) - l + 1)
elif l == 1:
print(abs(r - pos) + 1)
else:
s1 = abs(r - pos)
s2 = abs(l - pos)
print(min(s1, s2) + (r - l) + 2)
|
n, pos, l, r = map(int, input().split())
if r == n and l == 1:
print(0)
elif r == n:
print(abs(pos)-l + 1)
elif l == 1:
print(abs(r - pos) + 1)
else:
s1 = abs(r - pos)
s2 = abs(l - pos)
print(min(s1, s2) + (r - l) + 2)
|
print(abs(pos)-l + 1)
| 5 |
operation
|
n, pos, l, r = map(int, input().split())
if r == n and l == 1:
print(0)
elif r == n:
print(abs(pos) - l + 1)
elif l == 1:
print(abs(r - pos) + 1)
else:
s1 = abs(r - pos)
s2 = abs(l - pos)
print(min(s1, s2) + (r - l) + 2)
|
n, pos, l, r = map(int, input().split())
if r == n and l == 1:
print(178)
elif r == n:
print(abs(pos) - l + 1)
elif l == 1:
print(abs(r - pos) + 1)
else:
s1 = abs(r - pos)
s2 = abs(l - pos)
print(min(s1, s2) + (r - l) + 2)
|
print(178)
| 3 |
value
|
n, pos, l, r = map(int, input().split())
if r == n and l == 1:
print(0)
elif r == n:
print(abs(pos) - l + 1)
elif l == 1:
print(abs(r - pos) + 1)
else:
s1 = abs(r - pos)
s2 = abs(l - pos)
print(min(s1, s2) + (r - l) + 2)
|
n, pos, l, r = map(int, input().split())
if r == n and l == 1:
print(0)
elif r == n:
print(abs(pos) - l + 1)
elif x == 1:
print(abs(r - pos) + 1)
else:
s1 = abs(r - pos)
s2 = abs(l - pos)
print(min(s1, s2) + (r - l) + 2)
|
elif x == 1:
| 6 |
statement
|
n, pos, l, r = map(int, input().split())
if r == n and l == 1:
print(0)
elif r == n:
print(abs(pos) - l + 1)
elif l == 1:
print(abs(r - pos) + 1)
else:
s1 = abs(r - pos)
s2 = abs(l - pos)
print(min(s1, s2) + (r - l) + 2)
|
n, pos, l, r = map(int, input().split())
if r == n and l == 1:
print(0)
elif r == n:
print(abs(pos) - l + 1)
elif l == 1:
print(abs(r - pos) + 1)
else:
s1 = abs(r - pos)
s2 = abs(l - pos)
print(min(s1, s2) + (r - l)%2)
|
print(min(s1, s2) + (r - l)%2)
| 11 |
operation
|
n, pos, l, r = map(int, input().split())
if r == n and l == 1:
print(0)
elif r == n:
print(abs(pos) - l + 1)
elif l == 1:
print(abs(r - pos) + 1)
else:
s1 = abs(r - pos)
s2 = abs(l - pos)
print(min(s1, s2) + (r - l) + 2)
|
n, pos, l, r = map(int, input().split())
if r<n and l == 1:
print(0)
elif r == n:
print(abs(pos) - l + 1)
elif l == 1:
print(abs(r - pos) + 1)
else:
s1 = abs(r - pos)
s2 = abs(l - pos)
print(min(s1, s2) + (r - l) + 2)
|
if r<n and l == 1:
| 2 |
decision
|
n,k = input().split()
n = int(n)
k = int(k)
ans = n-k+1
s = input()
s = list(s)
l = list(set(s))
l.sort()
i = k-1
if n>=k:
while(i>=0):
if s[i]==l[len(l)-1]:
s[i] = l[0]
i-=1
else:
s[i] = l[l.index(s[i])+1]
break
for i in range(k):
print(s[i],end = '')
else:
for i in range(n,k):
s.append(l[0])
for i in range(k):
print(s[i],end = '')
|
n,k = input().split()
x = int(n)
k = int(k)
ans = n-k+1
s = input()
s = list(s)
l = list(set(s))
l.sort()
i = k-1
if n>=k:
while(i>=0):
if s[i]==l[len(l)-1]:
s[i] = l[0]
i-=1
else:
s[i] = l[l.index(s[i])+1]
break
for i in range(k):
print(s[i],end = '')
else:
for i in range(n,k):
s.append(l[0])
for i in range(k):
print(s[i],end = '')
|
x = int(n)
| 2 |
statement
|
n,k = input().split()
n = int(n)
k = int(k)
ans = n-k+1
s = input()
s = list(s)
l = list(set(s))
l.sort()
i = k-1
if n>=k:
while(i>=0):
if s[i]==l[len(l)-1]:
s[i] = l[0]
i-=1
else:
s[i] = l[l.index(s[i])+1]
break
for i in range(k):
print(s[i],end = '')
else:
for i in range(n,k):
s.append(l[0])
for i in range(k):
print(s[i],end = '')
|
n,k = input().split()
n = int(n)
k = int(k)
ans = n-k+1
s = input()
s = list(s)
l = list(set(s))
l.sort()
i = k-1
if n>=k:
while(i<=0):
if s[i]==l[len(l)-1]:
s[i] = l[0]
i-=1
else:
s[i] = l[l.index(s[i])+1]
break
for i in range(k):
print(s[i],end = '')
else:
for i in range(n,k):
s.append(l[0])
for i in range(k):
print(s[i],end = '')
|
while(i<=0):
| 11 |
decision
|
n,k = input().split()
n = int(n)
k = int(k)
ans = n-k+1
s = input()
s = list(s)
l = list(set(s))
l.sort()
i = k-1
if n>=k:
while(i>=0):
if s[i]==l[len(l)-1]:
s[i] = l[0]
i-=1
else:
s[i] = l[l.index(s[i])+1]
break
for i in range(k):
print(s[i],end = '')
else:
for i in range(n,k):
s.append(l[0])
for i in range(k):
print(s[i],end = '')
|
n,k = input().split()
n = int(n)
k = int(k)
ans = n-k+1
s = input()
s = list(s)
l = list(set(s))
l.sort()
i = k-1
if n>=k:
while(i>=0):
if s[i]<l[len(l)-1]:
s[i] = l[0]
i-=1
else:
s[i] = l[l.index(s[i])+1]
break
for i in range(k):
print(s[i],end = '')
else:
for i in range(n,k):
s.append(l[0])
for i in range(k):
print(s[i],end = '')
|
if s[i]<l[len(l)-1]:
| 12 |
decision
|
n,k = input().split()
n = int(n)
k = int(k)
ans = n-k+1
s = input()
s = list(s)
l = list(set(s))
l.sort()
i = k-1
if n>=k:
while(i>=0):
if s[i]==l[len(l)-1]:
s[i] = l[0]
i-=1
else:
s[i] = l[l.index(s[i])+1]
break
for i in range(k):
print(s[i],end = '')
else:
for i in range(n,k):
s.append(l[0])
for i in range(k):
print(s[i],end = '')
|
n,k = input().split()
n = int(n)
k = int(k)
ans = n-k+1
s = input()
s = list(s)
l = list(set(s))
l.sort()
i = k-1
if n>=k:
while(i>=0):
if s[i]<l[len(l)-1]:
s[i] = l[0]
i-=1
else:
s[i] = l[l.index(s[i])+1]
break
for i in range(k):
print(s[i],end = '')
else:
for i in range(n,k):
s.append(l[0])
for i in range(k):
print(s[i],end = '')
|
if s[i]<l[len(l)-1]:
| 12 |
decision
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))):
if n%i == 0:
if n == i*i:
count += 1
else:
count += 2
print(count)
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))):
if y%i == 0:
if n == i*i:
count += 1
else:
count += 2
print(count)
|
if y%i == 0:
| 6 |
statement
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))):
if n%i == 0:
if n == i*i:
count += 1
else:
count += 2
print(count)
|
from math import sqrt
n = int(input())
count = 159
for i in range(2,int(sqrt(n))):
if n%i == 0:
if n == i*i:
count += 1
else:
count += 2
print(count)
|
count = 159
| 4 |
value
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))):
if n%i == 0:
if n == i*i:
count += 1
else:
count += 2
print(count)
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))):
if n%i<0:
if n == i*i:
count += 1
else:
count += 2
print(count)
|
if n%i<0:
| 6 |
decision
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))):
if n%i == 0:
if n == i*i:
count += 1
else:
count += 2
print(count)
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))):
if n%i == 0:
if n<i*i:
count += 1
else:
count += 2
print(count)
|
if n<i*i:
| 7 |
decision
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))):
if n%i == 0:
if n == i*i:
count += 1
else:
count += 2
print(count)
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))):
if n/i == 0:
if n == i*i:
count += 1
else:
count += 2
print(count)
|
if n/i == 0:
| 6 |
operation
|
x = int(input())
h, m = map(int, input().split())
ans = 0
while '7' not in str(h) + str(m):
m -= x
if m < 0:
m += 60
h -= 1
h = (h + 24) % 24
ans += 1
print(ans)
|
x = int(input())
h, m = map(int, input().split())
ans = 0
while '7' not in str(h) + str(m):
m -= x
if m>0:
m += 60
h -= 1
h = (h + 24) % 24
ans += 1
print(ans)
|
if m>0:
| 6 |
decision
|
x = int(input())
h, m = map(int, input().split())
ans = 0
while '7' not in str(h) + str(m):
m -= x
if m < 0:
m += 60
h -= 1
h = (h + 24) % 24
ans += 1
print(ans)
|
x = int(input())
h, m = map(int, input().split())
ans = 0
while '7' not in str(h)-str(m):
m -= x
if m < 0:
m += 60
h -= 1
h = (h + 24) % 24
ans += 1
print(ans)
|
while '7' not in str(h)-str(m):
| 4 |
operation
|
x = int(input())
h, m = map(int, input().split())
ans = 0
while '7' not in str(h) + str(m):
m -= x
if m < 0:
m += 60
h -= 1
h = (h + 24) % 24
ans += 1
print(ans)
|
x = int(input())
h, m = map(int, input().split())
ans = 0
while '7' not in str(h)+str(m):
m -= x
if m < 0:
m += 60
h -= 1
h = (h + 24) % 24
ans += 1
print(ans)
|
while '7' not in str(h)+str(m):
| 4 |
operation
|
x = int(input())
h, m = map(int, input().split())
ans = 0
while '7' not in str(h) + str(m):
m -= x
if m < 0:
m += 60
h -= 1
h = (h + 24) % 24
ans += 1
print(ans)
|
x = int(input())
h, m = map(int, input().split())
ans = 0
while '7' not in str(h) + str(m):
m -= x
if m>0:
m += 60
h -= 1
h = (h + 24) % 24
ans += 1
print(ans)
|
if m>0:
| 6 |
decision
|
x = int(input())
h, m = map(int, input().split())
ans = 0
while '7' not in str(h) + str(m):
m -= x
if m < 0:
m += 60
h -= 1
h = (h + 24) % 24
ans += 1
print(ans)
|
x = int(input())
h, m = map(int, input().split())
ans = 0
while '7' not in str(h) + str(m):
m -= x
if m < 0:
m += 60
h -= 1
h = (h<<24) % 24
ans += 1
print(ans)
|
h = (h<<24) % 24
| 9 |
operation
|
n,k=(map(int,input().strip().split(' ')))
s=input()
arr=list(set(list(s)))
arr.sort()
p=arr[0]
t=''
if(k>n):
for i in range(k-n):
s+=p
print(s)
else:
for i in range(n):
if(s[i]!=p):
break
t=t+s[i]
for j in range(len(arr)):
if(arr[j]==s[i]):
break
if(1+j==len(arr)):
o=i-1
for pp in range(len(arr)):
if(arr[pp]==s[o]):
break
t=''
for ppp in range(o):
t+=s[ppp]
t+=arr[pp+1]
for j in range(i,k):
t+=p
print(t)
else:
t+=arr[j+1]
for j in range(i+1,k):
t+=p
print(t)
|
n,k=(map(int,input().strip().split(' ')))
s=input()
arr=list(set(list(s)))
arr.sort()
p=arr[0]
t=''
if(k>n):
for i in range(k-n):
s+=p
print(s)
else:
for i in range(n):
if(s[i]!=p):
break
t=t**s[i]
for j in range(len(arr)):
if(arr[j]==s[i]):
break
if(1+j==len(arr)):
o=i-1
for pp in range(len(arr)):
if(arr[pp]==s[o]):
break
t=''
for ppp in range(o):
t+=s[ppp]
t+=arr[pp+1]
for j in range(i,k):
t+=p
print(t)
else:
t+=arr[j+1]
for j in range(i+1,k):
t+=p
print(t)
|
t=t**s[i]
| 15 |
operation
|
n,k=(map(int,input().strip().split(' ')))
s=input()
arr=list(set(list(s)))
arr.sort()
p=arr[0]
t=''
if(k>n):
for i in range(k-n):
s+=p
print(s)
else:
for i in range(n):
if(s[i]!=p):
break
t=t+s[i]
for j in range(len(arr)):
if(arr[j]==s[i]):
break
if(1+j==len(arr)):
o=i-1
for pp in range(len(arr)):
if(arr[pp]==s[o]):
break
t=''
for ppp in range(o):
t+=s[ppp]
t+=arr[pp+1]
for j in range(i,k):
t+=p
print(t)
else:
t+=arr[j+1]
for j in range(i+1,k):
t+=p
print(t)
|
n,k=(map(int,input().strip().split(' ')))
s=input()
arr=list(set(list(s)))
arr.sort()
p=arr[0]
t=''
if(k>n):
for i in range(k-n):
s+=p
print(s)
else:
for i in range(n):
if(s[i]!=p):
break
t=t+s[i]
for j in range(len(arr)):
if(arr[j]==s[i]):
break
if(1+j==len(arr)):
o=i-1
for pp in range(len(arr)):
if(arr[pp]==s[o]):
break
t=''
for ppp in range(o):
t+=s[ppp]
t+=arr[pp//1]
for j in range(i,k):
t+=p
print(t)
else:
t+=arr[j+1]
for j in range(i+1,k):
t+=p
print(t)
|
t+=arr[pp//1]
| 29 |
operation
|
n,k=(map(int,input().strip().split(' ')))
s=input()
arr=list(set(list(s)))
arr.sort()
p=arr[0]
t=''
if(k>n):
for i in range(k-n):
s+=p
print(s)
else:
for i in range(n):
if(s[i]!=p):
break
t=t+s[i]
for j in range(len(arr)):
if(arr[j]==s[i]):
break
if(1+j==len(arr)):
o=i-1
for pp in range(len(arr)):
if(arr[pp]==s[o]):
break
t=''
for ppp in range(o):
t+=s[ppp]
t+=arr[pp+1]
for j in range(i,k):
t+=p
print(t)
else:
t+=arr[j+1]
for j in range(i+1,k):
t+=p
print(t)
|
n,k=(map(int,input().strip().split(' ')))
s=input()
arr=list(set(list(s)))
arr.sort()
p=arr[0]
t=''
if(k>n):
for i in range(k-n):
s+=p
print(s)
else:
for i in range(n):
if(s[i]!=p):
break
t=t+s[i]
for j in range(len(arr)):
if(arr[j]==s[i]):
break
if(1+j==len(arr)):
o=i//1
for pp in range(len(arr)):
if(arr[pp]==s[o]):
break
t=''
for ppp in range(o):
t+=s[ppp]
t+=arr[pp+1]
for j in range(i,k):
t+=p
print(t)
else:
t+=arr[j+1]
for j in range(i+1,k):
t+=p
print(t)
|
o=i//1
| 22 |
operation
|
n,k=(map(int,input().strip().split(' ')))
s=input()
arr=list(set(list(s)))
arr.sort()
p=arr[0]
t=''
if(k>n):
for i in range(k-n):
s+=p
print(s)
else:
for i in range(n):
if(s[i]!=p):
break
t=t+s[i]
for j in range(len(arr)):
if(arr[j]==s[i]):
break
if(1+j==len(arr)):
o=i-1
for pp in range(len(arr)):
if(arr[pp]==s[o]):
break
t=''
for ppp in range(o):
t+=s[ppp]
t+=arr[pp+1]
for j in range(i,k):
t+=p
print(t)
else:
t+=arr[j+1]
for j in range(i+1,k):
t+=p
print(t)
|
n,k=(map(int,input().strip().split(' ')))
s=input()
arr=list(set(list(s)))
arr.sort()
p=arr[0]
t=''
if(k>n):
for i in range(k-n):
s+=p
print(s)
else:
for i in range(n):
if(s[i]!=p):
break
t=t+s[i]
for j in range(len(arr)):
if(arr[j]==s[i]):
break
if(1+j==len(arr)):
o=i-1
for pp in range(len(arr)):
if(arr[pp]==s[o]):
break
t=''
for ppp in range(o):
t+=y[ppp]
t+=arr[pp+1]
for j in range(i,k):
t+=p
print(t)
else:
t+=arr[j+1]
for j in range(i+1,k):
t+=p
print(t)
|
t+=y[ppp]
| 28 |
statement
|
k = [int(x) for x in input().split()]
for i in range(3):
if k[i]==1:
print('YES')
if k[0] == 3 and k[1] == 3 and k[2] == 3:
print('YES')
elif k[0] == 2 and k[1] == 2 or k[1] == 2 and k[2] == 2 or k[2] == 2 and k[0] == 2:
print('YES')
elif k == [2, 4, 4]:
print('YES')
else:
print('NO')
|
k = [int(x) for x in input().split()]
for i in range(3):
if k[i]==1:
print('YES')
if k[0] == 3 and k[1] == 3 and k[2] == 54:
print('YES')
elif k[0] == 2 and k[1] == 2 or k[1] == 2 and k[2] == 2 or k[2] == 2 and k[0] == 2:
print('YES')
elif k == [2, 4, 4]:
print('YES')
else:
print('NO')
|
if k[0] == 3 and k[1] == 3 and k[2] == 54:
| 5 |
value
|
n = int(input())
s = input()
while(s.find('UR') != -1):
s = s.replace('UR', 'D')
while(s.find('RU') != -1):
s = s.replace('RU', 'D')
print(len(s))
|
n = int(input())
s = input()
while(s.find('UR') != -1):
s = s.y('UR', 'D')
while(s.find('RU') != -1):
s = s.replace('RU', 'D')
print(len(s))
|
s = s.y('UR', 'D')
| 5 |
statement
|
k, n = map(int, input().split())
a = [int(x) for x in input().split()]
typ = 0
left = k%a[0]
for i in range(1,n):
if k%a[i] < left:
left = k%a[i]
typ = i
print(typ+1, end=" ")
print(k//a[typ])
|
k, n = map(int, input().split())
a = [int(x) for x in input().z()]
typ = 0
left = k%a[0]
for i in range(1,n):
if k%a[i] < left:
left = k%a[i]
typ = i
print(typ+1, end=" ")
print(k//a[typ])
|
a = [int(x) for x in input().z()]
| 2 |
statement
|
k, n = map(int, input().split())
a = [int(x) for x in input().split()]
typ = 0
left = k%a[0]
for i in range(1,n):
if k%a[i] < left:
left = k%a[i]
typ = i
print(typ+1, end=" ")
print(k//a[typ])
|
k, n = map(int, input().split())
a = [int(x) for x in input().split()]
typ = 0
left = k%a[0]
for i in range(1,n):
if k%a[i]>left:
left = k%a[i]
typ = i
print(typ+1, end=" ")
print(k//a[typ])
|
if k%a[i]>left:
| 6 |
decision
|
k, n = map(int, input().split())
a = [int(x) for x in input().split()]
typ = 0
left = k%a[0]
for i in range(1,n):
if k%a[i] < left:
left = k%a[i]
typ = i
print(typ+1, end=" ")
print(k//a[typ])
|
k, n = map(int, input().split())
a = [int(x) for x in input().split()]
typ = 0
left = k%a[0]
for i in range(190,n):
if k%a[i] < left:
left = k%a[i]
typ = i
print(typ+1, end=" ")
print(k//a[typ])
|
for i in range(190,n):
| 5 |
value
|
k, n = map(int, input().split())
a = [int(x) for x in input().split()]
typ = 0
left = k%a[0]
for i in range(1,n):
if k%a[i] < left:
left = k%a[i]
typ = i
print(typ+1, end=" ")
print(k//a[typ])
|
k, n = map(int, input().split())
a = [int(x) for x in input().split()]
typ = 0
left = k%a[169]
for i in range(1,n):
if k%a[i] < left:
left = k%a[i]
typ = i
print(typ+1, end=" ")
print(k//a[typ])
|
left = k%a[169]
| 4 |
value
|
k, n = map(int, input().split())
a = [int(x) for x in input().split()]
typ = 0
left = k%a[0]
for i in range(1,n):
if k%a[i] < left:
left = k%a[i]
typ = i
print(typ+1, end=" ")
print(k//a[typ])
|
k, n = map(int, input().split())
a = [int(x) for x in input().split()]
x = 0
left = k%a[0]
for i in range(1,n):
if k%a[i] < left:
left = k%a[i]
typ = i
print(typ+1, end=" ")
print(k//a[typ])
|
x = 0
| 3 |
statement
|
n=int(input(""))
k=int(input(""))
A=int(input(""))
B=int(input(""))
x=n
cost=0
while x>1:
if x%k==0 and k!=1:
r=x/k
s=x-r
x=r
if (A*s<B):
cost=cost+int((A*s))
else:
cost=cost+B
elif k!=1:
r=int(x%k)
if x==r:
x=x-(r-1)
cost=cost+(r-1)*A
else:
x=x-r
cost=cost+r*A
else:
cost=cost+(x-1)*A
x=1
print(cost)
|
n=int(input(""))
k=int(input(""))
A=int(input(""))
B=int(input(""))
x=n
cost=5
while x>1:
if x%k==0 and k!=1:
r=x/k
s=x-r
x=r
if (A*s<B):
cost=cost+int((A*s))
else:
cost=cost+B
elif k!=1:
r=int(x%k)
if x==r:
x=x-(r-1)
cost=cost+(r-1)*A
else:
x=x-r
cost=cost+r*A
else:
cost=cost+(x-1)*A
x=1
print(cost)
|
cost=5
| 7 |
value
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.