problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02819 | x = int(input())
n = 10 ** 5
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes.difference_update(range(i*2, n+1, i))
primes = list(primes)
import bisect
b = bisect.bisect_right(primes, x)
if x == primes[b - 1]:
print(x)
else:
print(primes[b]) | x = int(input())
n = 2 *(10 ** 5)
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes.difference_update(range(i*2, n+1, i))
primes = list(primes)
import bisect
b = bisect.bisect_right(primes, x)
if x == primes[b - 1]:
print(x)
else:
print(primes[b]) | [
"assignment.change"
] | 624,777 | 624,778 | u644516473 | python |
p02819 | X = int(input())
X = X + 1
prime = None
while True:
for i in range(2, X):
if X % i == 0:
break
else:
prime = X
if prime != None:
break
else:
X += 1
print(prime) | X = int(input())
prime = None
while True:
for i in range(2, X):
if X % i == 0:
break
else:
prime = X
if prime != None:
break
else:
X += 1
print(prime) | [
"assignment.remove"
] | 624,784 | 624,785 | u488272873 | python |
p02819 | X = int(input())
X = X + 1
prime = None
while True:
for i in range(2, X):
if X % i == 0:
break
else:
prime = X
if prime != None:
break
else:
X += 1
print(X) | X = int(input())
prime = None
while True:
for i in range(2, X):
if X % i == 0:
break
else:
prime = X
if prime != None:
break
else:
X += 1
print(prime) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 624,786 | 624,785 | u488272873 | python |
p02819 | import sys
from math import gcd
def main():
N = int(input())
primenumbers = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 24... | import sys
from math import gcd
def main():
N = int(input())
primenumbers = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 24... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 624,787 | 624,788 | u703225154 | python |
p02819 | import sys
x = int(input())
i = 2
INF = 100001-x
while (i <= x):
if (x%i == 0 and x != i):
break
if (x % i == 0 and x == i):
print(x)
sys.exit()
i += 1
while (x <= INF):
i = 2
while(i <= x):
if (i % 2 == 0):
i += 1
continue
if (x % 2 ... | import sys
x = int(input())
i = 2
INF = 100000000
while (i <= x):
if (x%i == 0 and x != i):
break
if (x % i == 0 and x == i):
print(x)
sys.exit()
i += 1
while (x < INF):
i = 2
while(i <= x):
if (i % 2 == 0):
i += 1
continue
if (x % 2 ... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 624,803 | 624,804 | u244416763 | python |
p02819 | from itertools import count
X = int(input())
pn = [2]
for L in count(3):
chk = True
for L2 in pn:
if L % L2 == 0:
break
else:
pn.append(L)
if L >= X:
print(L)
break | from itertools import count
X = int(input())
pn = []
for L in count(2):
chk = True
for L2 in pn:
if L % L2 == 0:
break
else:
pn.append(L)
if L >= X:
print(L)
break | [
"literal.number.integer.change",
"call.arguments.change"
] | 624,805 | 624,806 | u526603504 | python |
p02819 | x=int(input())
import math
for i in range(x+1, 10**5+100000):
flag=True
e = math.floor(math.sqrt(x))
for j in range(2, e+1):
if i%j == 0:
flag=False
break
if flag==True:
print(i)
exit() | x=int(input())
import math
for i in range(x, 10**5+100000):
flag=True
e = math.floor(math.sqrt(x))
for j in range(2, e+1):
if i%j == 0:
flag=False
break
if flag==True:
print(i)
exit() | [
"expression.operation.binary.remove"
] | 624,813 | 624,814 | u717265305 | python |
p02819 | x=int(input())
import math
for i in range(x+1, 10**5+1000):
flag=True
e = math.floor(math.sqrt(x))
for j in range(2, e+1):
if i%j == 0:
flag=False
break
if flag==True:
print(i)
exit() | x=int(input())
import math
for i in range(x, 10**5+100000):
flag=True
e = math.floor(math.sqrt(x))
for j in range(2, e+1):
if i%j == 0:
flag=False
break
if flag==True:
print(i)
exit() | [
"expression.operation.binary.remove",
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,815 | 624,814 | u717265305 | python |
p02819 | X =int(input())
def f(n):
for i in range(2,int(n**0.5)+1):
if n%i == 0:
return False
return True
for i in range(X,100004):
if f(i):
return(i)
break
| X =int(input())
def f(n):
for i in range(2,int(n**0.5)+1):
if n%i == 0:
return False
return True
for i in range(X,100004):
if f(i):
print(i)
break
| [
"function.return_value.change"
] | 624,818 | 624,819 | u557494880 | python |
p02819 | x = int(input())
import math
def primes(n):
a = [True] * (n + 1)
a[0] = False
a[1] = False
for i in range(2, int(math.sqrt(n))+1):
for j in range(i * 2, n + 1, i):
a[j] = False
return [i for i in range(n + 1) if a[i]==True]
a = primes(x*2)
b = [a[i] for i in range(len(a)) if a... | x = int(input())
import math
def primes(n):
a = [True] * (n + 1)
a[0] = False
a[1] = False
for i in range(2, int(math.sqrt(n))+1):
for j in range(i * 2, n + 1, i):
a[j] = False
return [i for i in range(n + 1) if a[i]==True]
a = primes(x*5)
b = [a[i] for i in range(len(a)) if a... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change"
] | 624,822 | 624,823 | u246217175 | python |
p02819 | X=int(input())
n=10**5+1
primes=set(range(2,n+1))
for i in range(2,int(n**0.5+1)):
primes.difference_update(range(i*2,n+1,i))
primes=list(primes)
for i in range(X,n):
if i in primes:
print(i)
break | X=int(input())
n=10**6+1
primes=set(range(2,n+1))
for i in range(2,int(n**0.5+1)):
primes.difference_update(range(i*2,n+1,i))
primes=list(primes)
for i in range(X,n):
if i in primes:
print(i)
break | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 624,824 | 624,825 | u506858457 | python |
p02819 | import math
X = int(input())
def qprime(n):
if n<2:return False
elif n==2:return True
elif n%2==0:return False
for i in range(3,math.floor(math.sqrt(n))+1,2):
if n % i == 0:return False
return True
for i in range(X,100000):
if qprime(i):
print(i)
break
| import math
X = int(input())
def qprime(n):
if n<2:return False
elif n==2:return True
elif n%2==0:return False
for i in range(3,math.floor(math.sqrt(n))+1,2):
if n % i == 0:return False
return True
for i in range(X,10000000):
if qprime(i):
print(i)
break
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,826 | 624,827 | u170410075 | python |
p02819 | import numpy as np
number = int(input())
if number == 2:
print(number)
else:
first = 0
for i in range(2, number):
if number%i == 0:
first = 1
break
if first == 0:
print(number)
else:
for i in range(number, 100000):
flag = 0
fo... | import numpy as np
number = int(input())
if number == 2:
print(number)
else:
first = 0
for i in range(2, number):
if number%i == 0:
first = 1
break
if first == 0:
print(number)
else:
for i in range(number + 1, 1000000000000):
flag = 0
... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,833 | 624,834 | u370217787 | python |
p02819 | import math
n=int(input())
def is_prime(n):
if n <= 1:
return False
if n == 2:
return True
if n % 2 == 0:
return False
for i in range(3, math.ceil(math.sqrt(n)), 2):
if n % i == 0:
return False
return True
for i in range(n, 10**5+1):
if is_prime(... | import math
n=int(input())
def is_prime(n):
if n <= 1:
return False
if n == 2:
return True
if n % 2 == 0:
return False
for i in range(3, math.ceil(math.sqrt(n)), 2):
if n % i == 0:
return False
return True
for i in range(n, 10**6):
if is_prime(i)... | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 624,835 | 624,836 | u259265086 | python |
p02819 | import math
x = int(input())
def isPrime(n):
if n == 2:
return True
if n % 2 == 0:
return False
# nの平方根まで計算する
m = math.floor(math.sqrt(n)) + 1
for p in range(3, m, 2):
if n % p == 0:
return False
return True
for i in range(x+1, x+200):
if isPrime(i):
... | import math
x = int(input())
def isPrime(n):
if n == 2:
return True
if n % 2 == 0:
return False
# nの平方根まで計算する
m = math.floor(math.sqrt(n)) + 1
for p in range(3, m, 2):
if n % p == 0:
return False
return True
for i in range(x, x+200):
if isPrime(i):
... | [
"expression.operation.binary.remove"
] | 624,845 | 624,846 | u595289165 | python |
p02819 | # coding: utf-8
def is_prime2(q,k=100):
q = abs(q)
if q == 2: return True
if q < 2 or q&1 == 0: return False
for i in xrange(3,k):
x,y = q,i
while y:
x, y = y, x % y
if x != 1: continue
if pow(i, q-1, q) != 1:
return False
return True
X = int(input())
for i in range(X,10**5+4):... | # coding: utf-8
def is_prime2(q,k=100):
q = abs(q)
if q == 2: return True
if q < 2 or q&1 == 0: return False
for i in range(3,k):
x,y = q,i
while y:
x, y = y, x % y
if x != 1: continue
if pow(i, q-1, q) != 1:
return False
return True
X = int(input())
for i in range(X,10**5+4... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 624,847 | 624,848 | u691746545 | python |
p02819 | A = int(input())
i = 0
S = 0
B = int(math.sqrt(A))
while i == 0:
S = 0
B = int(math.sqrt(A))
for n in range(2,B + 1):
if A % n == 0:
A += 1
S = 1
break
if S == 0:
print(A)
exit() | import math
A = int(input())
i = 0
S = 0
B = int(math.sqrt(A))
while i == 0:
S = 0
B = int(math.sqrt(A))
for n in range(2,B + 1):
if A % n == 0:
A += 1
S = 1
break
if S == 0:
print(A)
exit() | [] | 624,854 | 624,855 | u188745744 | python |
p02819 | import math
A = int(input())
i = 0
S = 0
B = int(math.sqrt(A))
while i == 0:
S = 0
B = int(math.sqrt(A))
for n in range(2,B + 1):
if A % n == 0:
print("A")
A += 1
S = 1
break
if S == 0:
print(A)
exit() | import math
A = int(input())
i = 0
S = 0
B = int(math.sqrt(A))
while i == 0:
S = 0
B = int(math.sqrt(A))
for n in range(2,B + 1):
if A % n == 0:
A += 1
S = 1
break
if S == 0:
print(A)
exit() | [
"call.remove"
] | 624,857 | 624,855 | u188745744 | python |
p02819 | import math
def is_prime(x):
if x < 2: return False # 2未満に素数はない
if x == 2 or x == 3 or x == 5: return True # 2,3,5は素数
if x % 2 == 0 or x % 3 == 0 or x % 5 == 0: return False # 2,3,5の倍数は合成数
# ためし割り: 疑似素数(2でも3でも5でも割り切れない数字)で次々に割っていく
prime = 7
step = 4
while prime <= math.sqrt(x):
if ... | import math
def is_prime(x):
if x < 2: return False # 2未満に素数はない
if x == 2 or x == 3 or x == 5: return True # 2,3,5は素数
if x % 2 == 0 or x % 3 == 0 or x % 5 == 0: return False # 2,3,5の倍数は合成数
# ためし割り: 疑似素数(2でも3でも5でも割り切れない数字)で次々に割っていく
prime = 7
step = 4
while prime <= math.sqrt(x):
if ... | [
"expression.operation.binary.add"
] | 624,862 | 624,863 | u866374539 | python |
p02819 | X=input()
X=X-1
a=0
b=1
while b==1:
X=X+1
a=0
for i in range(2,X):
if X%i==0:
a=a+1
if a==0:
print(X)
break;
| X=int(input())
X=X-1
a=0
b=1
while b==1:
X=X+1
a=0
for i in range(2,X):
if X%i==0:
a=a+1
if a==0:
print(X)
break;
| [
"call.add",
"call.arguments.change"
] | 624,864 | 624,865 | u311176548 | python |
p02819 | l = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347,... | l = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347,... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 624,870 | 624,871 | u995861601 | python |
p02819 | import pyperclip
ps = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,4... | ps = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443... | [] | 624,878 | 624,879 | u593934357 | python |
p02819 | x=int(input())
import math
def is_prime(n):
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
for i in range(x,10**5):
if is_prime(i)==True:
print(i)
exit()
| x=int(input())
import math
def is_prime(n):
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
for i in range(x,10**6):
if is_prime(i)==True:
print(i)
exit() | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,882 | 624,883 | u652569315 | python |
p02819 | import math
serach_number = 10 ** 5 + 4
def sieve_of_eratosthenes(target):
dest = int(math.sqrt(target))
target_list = list(range(2, target + 1))
prime_list = []
while True:
num_min = min(target_list)
if num_min >= dest:
prime_list.extend(target_list)
break
... | import math
serach_number = 10 ** 5 + 4
def sieve_of_eratosthenes(target):
dest = int(math.sqrt(target))
target_list = list(range(2, target + 1))
prime_list = []
while True:
num_min = min(target_list)
if num_min >= dest:
prime_list.extend(target_list)
break
... | [
"expression.operation.binary.remove"
] | 624,894 | 624,895 | u355661029 | python |
p02819 | import sys
x=int(input())
if x==2:
print(2)
sys.exit()
for i in range(x,10**5+1):
for j in range(2,round(i**0.5)+1):
if i%j==0:
break
if j==round(i**0.5) and i%j!=0:
print(i)
sys.exit() | import sys
x=int(input())
if x==2:
print(2)
sys.exit()
for i in range(x,10**5+4):
for j in range(2,round(i**0.5)+1):
if i%j==0:
break
if j==round(i**0.5) and i%j!=0:
print(i)
sys.exit()
| [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,898 | 624,899 | u527261492 | python |
p02819 | x = int(input())
import math
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
if x==2:
print(2)
elif x%2==0:
for i in range(1,100,2):
if is_prime(x+i):
print(x+i)
exit()... | x = int(input())
import math
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
if x==2:
print(2)
elif x%2==0:
for i in range(1,10000,2):
if is_prime(x+i):
print(x+i)
exit... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.loop.range.bounds.lower.change"
] | 624,908 | 624,909 | u255673886 | python |
p02819 | # C
X = int(input())
# 一覧を求める
import numpy as np
def seachPrimeNum(N):
max = int(np.sqrt(N))
seachList = [i for i in range(2,N+1)]
primeNum = []
while seachList[0] <= max:
primeNum.append(seachList[0])
tmp = seachList[0]
seachList = [i for i in seachList if i % tmp != 0]
pr... | # C
X = int(input())
# 一覧を求める
import numpy as np
def seachPrimeNum(N):
max = int(np.sqrt(N))
seachList = [i for i in range(2,N+1)]
primeNum = []
while seachList[0] <= max:
primeNum.append(seachList[0])
tmp = seachList[0]
seachList = [i for i in seachList if i % tmp != 0]
pr... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 624,916 | 624,917 | u663093503 | python |
p02819 | def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
x = int(input())
while not is_prime(x):
x+=1
print(x) | import math
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
x = int(input())
while not is_prime(x):
x+=1
print(x) | [] | 624,930 | 624,931 | u898967808 | python |
p02819 | #--import&define---------------------
import math
import sys
input = sys.stdin.readline
def yes():
print("Yes")
def no():
print("No")
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
for j in range(i * 2, n + 1, i):
... | #--import&define---------------------
import math
import sys
input = sys.stdin.readline
def yes():
print("Yes")
def no():
print("No")
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
for j in range(i * 2, n + 1, i):
... | [
"expression.operation.binary.remove"
] | 624,934 | 624,935 | u098679988 | python |
p02819 | x = int(input())
nn = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, ... | x = int(input())
nn = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 624,940 | 624,941 | u693933222 | python |
p02819 | import math
import bisect
# 0以上整数x「未満」の素数をリストに格納して返す
def primes(x):
if x < 2: return []
primes = [i for i in range(x)]
primes[1] = 0
for prime in primes:
if prime > math.sqrt(x): break
if prime == 0: continue
for non_prime in range(2 * prime, x, prime): primes[non_prime] = 0
... | import math
import bisect
# 0以上整数x「未満」の素数をリストに格納して返す
def primes(x):
if x < 2: return []
primes = [i for i in range(x)]
primes[1] = 0
for prime in primes:
if prime > math.sqrt(x): break
if prime == 0: continue
for non_prime in range(2 * prime, x, prime): primes[non_prime] = 0
... | [
"expression.operation.binary.remove"
] | 624,942 | 624,943 | u707498674 | python |
p02819 | N=int(input())
def soinsuu(n):
t=n//2
for i in range(2,t):
if n%i==0:
return True
return False
MAX=10**5
for i in range(N,MAX+1):
if not soinsuu(i):
print(i)
break
| N=int(input())
def soinsuu(n):
t=n//2
for i in range(2,t):
if n%i==0:
return True
return False
MAX=10**10
for i in range(N,MAX+1):
if not soinsuu(i):
print(i)
break
| [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 624,946 | 624,947 | u825378567 | python |
p02819 | x = int(input())
def primes(z, n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if (... | x = int(input())
def primes(z, n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if (... | [
"call.arguments.change",
"call.arguments.add"
] | 624,961 | 624,962 | u226912938 | python |
p02819 | x = int(input())
def primes(z, n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if (i... | x = int(input())
def primes(z, n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if (... | [
"call.arguments.change",
"call.arguments.add"
] | 624,963 | 624,962 | u226912938 | python |
p02819 | import math
x = int(input())
def check(x):
for i in range(2, int(math.sqrt(x) + 1)):
if x % i == 0:
return False
return True
for i in range(x, 100000):
if check(i) == True:
print(i)
break | import math
x = int(input())
def check(x):
for i in range(2, int(math.sqrt(x) + 1)):
if x % i == 0:
return False
return True
for i in range(x, 200000):
if check(i) == True:
print(i)
break | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,970 | 624,971 | u485566817 | python |
p02819 | import math
x = int(input())
def check(x):
for i in range(2, int(math.sqrt(x) + 1)):
if x % i == 0:
return False
return True
for i in range(x, 10000):
if check(i) == True:
print(i)
break | import math
x = int(input())
def check(x):
for i in range(2, int(math.sqrt(x) + 1)):
if x % i == 0:
return False
return True
for i in range(x, 200000):
if check(i) == True:
print(i)
break | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,972 | 624,971 | u485566817 | python |
p02819 | n= int(input())
def isprime(n):
if (n <= 1) :
return False
if (n <= 3) :
return True
if (n % 2 == 0 or n % 3 == 0) :
return False
i = 5
while(i * i <= n) :
if (n % i == 0 or n % (i + 2) == 0) :
return False
i = i + 6
return True
def fun(... | n= int(input())
def isprime(n):
if (n <= 1) :
return False
if (n <= 3) :
return True
if (n % 2 == 0 or n % 3 == 0) :
return False
i = 5
while(i * i <= n) :
if (n % i == 0 or n % (i + 2) == 0) :
return False
i = i + 6
return True
def fun(... | [
"expression.operation.binary.remove"
] | 624,978 | 624,979 | u278792700 | python |
p02819 | def isPrime(n):
for i in range(2,N):
if N%i == 0:
return False
def find_next_prime(n):
return find_prime_in_range(n, 2*n)
def find_prime_in_range(a, b):
for p in range(a, b):
for i in range(2, p):
if p % i == 0:
break
else:
re... | def isPrime(n):
for i in range(2,N):
if N%i == 0:
return False
return True
def find_next_prime(n):
return find_prime_in_range(n, 2*n)
def find_prime_in_range(a, b):
for p in range(a, b):
for i in range(2, p):
if p % i == 0:
break
... | [
"control_flow.return.add"
] | 624,980 | 624,981 | u697601622 | python |
p02819 | def check(num):
if num > 1:
for i in range(2, num):
if (num % i) == 0:
return False
break
else:
return True
else:
return False
a = int(input())
for i in range(a, 100000):
if check(i):
print(i)
break | def check(num):
if num > 1:
for i in range(2, num):
if (num % i) == 0:
return False
break
else:
return True
else:
return False
a = int(input())
for i in range(a, 100500):
if check(i):
print(i)
break | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,984 | 624,985 | u075109824 | python |
p02819 | def check(num):
if num > 1:
for i in range(2, num):
if (num % i) == 0:
return False
break
else:
return True
else:
return False
a = int(input())
for i in range(a, 100000):
if check(i):
print(i)
break | def check(num):
if num > 1:
for i in range(2, num):
if (num % i) == 0:
return False
break
else:
return True
else:
return False
a = int(input())
for i in range(a, 100500):
if check(i):
print(i)
break | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 624,986 | 624,985 | u075109824 | python |
p02819 | n = 100000
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes.difference_update(range(i*2, n+1, i))
primes=list(primes)
x=int(input())
for i in primes:
if i>=x:
print(i)
exit()
| n = 200000
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes.difference_update(range(i*2, n+1, i))
primes=list(primes)
x=int(input())
for i in primes:
if i>=x:
print(i)
exit()
| [
"literal.number.integer.change",
"assignment.value.change"
] | 624,987 | 624,988 | u121921603 | python |
p02819 | import sys
x = int(input())
if x == 2:
print(2)
sys.exit()
prime = [2]
for i in range(3, 1000000, 2):
all(i % p != 0 for p in prime) and prime.append(i)
if i > x and i in prime:
print(i)
sys.exit() | import sys
x = int(input())
if x == 2:
print(2)
sys.exit()
prime = [2]
for i in range(3, 1000000, 2):
all(i % p != 0 for p in prime) and prime.append(i)
if i >= x and i in prime:
print(i)
sys.exit() | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 624,995 | 624,996 | u204842730 | python |
p02819 | import sys
x = int(input())
if x == 2:
print(2)
sys.exit()
prime = [2]
for i in range(3, 1000000, 2):
all(i % p != 0 for p in prime) and prime.append(i)
if i > x:
print(i)
sys.exit() | import sys
x = int(input())
if x == 2:
print(2)
sys.exit()
prime = [2]
for i in range(3, 1000000, 2):
all(i % p != 0 for p in prime) and prime.append(i)
if i >= x and i in prime:
print(i)
sys.exit() | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 624,998 | 624,996 | u204842730 | python |
p02819 | import numpy as np
import math
def get_sieve_of_eratosthenes(n):
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
while True:
p = data[0]
if limit <= p:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
x = in... | import numpy as np
import math
def get_sieve_of_eratosthenes(n):
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
while True:
p = data[0]
if limit <= p:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
x = int(i... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change"
] | 625,001 | 625,002 | u952939556 | python |
p02819 | import numpy as np
import math
def get_sieve_of_eratosthenes(n):
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
while True:
p = data[0]
if limit <= p:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
x = in... | import numpy as np
import math
def get_sieve_of_eratosthenes(n):
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
while True:
p = data[0]
if limit <= p:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
x = int(i... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change"
] | 625,003 | 625,002 | u952939556 | python |
p02819 | import numpy as np
import math
def get_sieve_of_eratosthenes(n):
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
while True:
p = data[0]
if limit <= p:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
x = int(i... | import numpy as np
import math
def get_sieve_of_eratosthenes(n):
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
while True:
p = data[0]
if limit <= p:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
x = int(i... | [
"expression.operator.compare.change",
"assignment.value.change",
"call.arguments.change"
] | 625,004 | 625,002 | u952939556 | python |
p02819 | import math
def isPrime(k):
if k % 2 == 0 and k != 2:
return False
limitDivisor = math.floor(math.sqrt(k)) + 1
for divisor in range(2, limitDivisor):
if k % divisor == 0:
return False
return k
x = int(input())
limitX = 2 * x - 1
for i in range(x + 1, limitX):
if is... | import math
def isPrime(k):
if k % 2 == 0 and k != 2:
return False
limitDivisor = math.floor(math.sqrt(k)) + 1
for divisor in range(2, limitDivisor):
if k % divisor == 0:
return False
return k
x = int(input())
limitX = 2 * x - 1
for i in range(x, limitX):
if isPrim... | [
"expression.operation.binary.remove"
] | 625,005 | 625,006 | u887524368 | python |
p02819 | import sys
x = int(input())
if x == 2 or x == 3:
print(x)
sys.exit()
for i in range(10):
for j in range(2, int(x/2)+1):
if (x%j == 0):
break
if (j == int(x/2)):
print(x)
sys.exit()
x += 1
| import sys
x = int(input())
if x == 2 or x == 3:
print(x)
sys.exit()
for i in range(10000):
for j in range(2, int(x/2)+1):
if (x%j == 0):
break
if (j == int(x/2)):
print(x)
sys.exit()
x += 1
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 625,009 | 625,010 | u054562155 | python |
p02819 | primes = [2]
x = int(input())
for i in range(3, x * 2):
is_p = True
for p in primes:
if i < p * p:
break
if i % p == 0:
is_p = False
break
if is_p:
primes.append(i)
print([i for i in primes if i > x][0])
| primes = [2]
x = int(input())
for i in range(3, x * 2):
is_p = True
for p in primes:
if i < p * p:
break
if i % p == 0:
is_p = False
break
if is_p:
primes.append(i)
print([i for i in primes if i >= x][0])
| [
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 625,011 | 625,012 | u605917063 | python |
p02819 | def isPrime(n):
if n == 2:
return True
for p in range(2, n):
if n % p == 0:
return False
return True
x = float(input())
while True:
if isPrime(x):
print(x)
break
x = x+1 | def isPrime(n):
if n == 2:
return True
for p in range(2, n):
if n % p == 0:
return False
return True
x = int(input())
while True:
if isPrime(x):
print(x)
break
x = x+1 | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 625,017 | 625,018 | u475848010 | python |
p02820 | n,k = map(int, input().split())
r, s, p = map(int, input().split())
T = list(str(input()))
ans = 0
S = [-1]*n
for i in range(n):
if i <= k-1:
if T[i] == 'r':
S[i] = 'p'
ans += p
elif T[i] == 's':
S[i] = 'r'
ans += r
else:
S[i] = 's'... | n,k = map(int, input().split())
r, s, p = map(int, input().split())
T = list(str(input()))
ans = 0
S = [-1]*n
for i in range(n):
if i <= k-1:
if T[i] == 'r':
S[i] = 'p'
ans += p
elif T[i] == 's':
S[i] = 'r'
ans += r
else:
S[i] = 's'... | [
"literal.string.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 625,021 | 625,022 | u186838327 | python |
p02820 | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input()
wins = {"p":"s", "r":"p", "s":"r"}
points = {"p":S, "r":P, "s":R}
hands = []
ans = 0
for i in range(N):
if i - K < 0:
hands.append(wins[T[i]])
ans += points[T[i]]
else:
if hands[i-K] == wins[T[i]]:
... | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input()
wins = {"p":"s", "r":"p", "s":"r"}
points = {"p":S, "r":P, "s":R}
hands = []
ans = 0
for i in range(N):
if i - K < 0:
hands.append(wins[T[i]])
ans += points[T[i]]
else:
if hands[i-K] == wins[T[i]]:
... | [
"call.arguments.change"
] | 625,043 | 625,044 | u383713431 | python |
p02820 | n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = input()
ans = 0
for i in range(n):
if((i - k) < 0):
if(t[i] == 'r'):ans += p
elif(t[i] == 's'):ans += r
else:ans += s
continue
else:
if(t[i-k] == t[i]):t = t[:i] + 'n' + t[i+1:]
else:
... | n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = input()
ans = 0
for i in range(n):
if((i - k) < 0):
if(t[i] == 'r'):ans += p
elif(t[i] == 's'):ans += r
else:ans += s
continue
else:
if(t[i-k] == t[i]):t = t[:i] + 'n' + t[i+1:]
else:
... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 625,054 | 625,055 | u855866205 | python |
p02820 | n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = input()
ans = 0
for i in range(n):
if((i - k) < 0):
if(t[i] == 'r'):ans += p
elif(t[i] == 's'):ans += r
else:ans += s
continue
else:
if(t[i-k] == t[i]):t = t[:i] + 'n' + t[i+1:]
else:
... | n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = input()
ans = 0
for i in range(n):
if ((i - k) < 0):
if (t[i] == 'r'):
ans += p
elif (t[i] == 's'):
ans += r
else:
ans += s
continue
else:
if (t[i - k] == t[i]):
... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 625,054 | 625,056 | u855866205 | python |
p02820 | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input()
score = {"r":P, "s":R, "p":S}
m = {"r":"p", "s":"r", "p":"s"}
command= []
mm = []
ans = 0
for i, t in enumerate(T):
if t == "r":
c = "p"
point = P
elif t == "s":
cc ="r"
point = R
elif t == "p":
... | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input()
score = {"r":P, "s":R, "p":S}
m = {"r":"p", "s":"r", "p":"s"}
command= []
mm = []
ans = 0
for i, t in enumerate(T):
if t == "r":
c = "p"
point = P
elif t == "s":
c ="r"
point = R
elif t == "p":
... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change"
] | 625,070 | 625,071 | u861886710 | python |
p02820 | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input()
score = {"r":P, "s":R, "p":S}
m = {"r":"p", "s":"r", "p":"s"}
command= []
mm = []
ans = 0
for i, t in enumerate(T):
if t == "r":
c = "p"
point = P
elif t == "s":
cc ="r"
point = R
elif t == "p":
... | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input()
score = {"r":P, "s":R, "p":S}
m = {"r":"p", "s":"r", "p":"s"}
command= []
mm = []
ans = 0
for i, t in enumerate(T):
if t == "r":
c = "p"
point = P
elif t == "s":
c ="r"
point = R
elif t == "p":
... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"control_flow.branch.if.condition.change",
"literal.string.change"
] | 625,072 | 625,071 | u861886710 | python |
p02820 | N,K=map(int,input().split())
R,S,P=map(int,input().split())
T=list(input())
ans=0
for j in range(len(T)):
if j<=K:
if T[j]=='r':
ans+=P
elif T[j]=='s':
ans+=R
else:
ans+=S
elif j>K and T[j]!=T[j-K]:
if T[j]=='r':
ans+=P
el... | N,K=map(int,input().split())
R,S,P=map(int,input().split())
T=list(input())
ans=0
for j in range(len(T)):
if j<K:
if T[j]=='r':
ans+=P
elif T[j]=='s':
ans+=R
else:
ans+=S
elif j>=K and T[j]!=T[j-K]:
if T[j]=='r':
ans+=P
el... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 625,083 | 625,084 | u634282234 | python |
p02820 | def myAnswer(N:int,K:int,R:int,S:int,P:int,T:str) -> int:
dic = {"r":R,"s":S,"p":P}
dic2 = {"r":["p","r"],"s":["r","s"],"p":["s","p"]}
total = 0
ans = []
for n in range(N):
target = T[n]
if(n < K):
ans.append(dic2[target][0])
total += dic[dic2[target][0]]
else:
... |
def myAnswer(N:int,K:int,R:int,S:int,P:int,T:str) -> int:
dic = {"r":R,"s":S,"p":P}
dic2 = {"r":["p","-"],"s":["r","-"],"p":["s","-"]}
total = 0
ans = []
for n in range(N):
target = T[n]
if(n < K):
ans.append(dic2[target][0])
total += dic[dic2[target][0]]
else:
... | [
"literal.string.change",
"assignment.value.change"
] | 625,096 | 625,097 | u301624971 | python |
p02820 | def main():
input = stdin.buffer.readline
n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = input()[:-1].decode()
ans = 0
result = [False] * n
for i in range(n):
if k <= i and t[i] == t[i - k] and result[i - k]:
continue
if t[i] == 'r':
... | from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = input()[:-1].decode()
ans = 0
result = [False] * n
for i in range(n):
if k <= i and t[i] == t[i - k] and result[i - k]:
... | [] | 625,115 | 625,116 | u390727364 | python |
p02820 | n,k = map(int,input().split())
r,s,p = map(int,input().split())
t = input()
#rのときpの点、sのときｒ、ｐのときｓ
from collections import Counter
taka = ''
ans = 0
for te in t[:k]:
if te == 'r':
taka += 'p'
ans += p
elif te == 's':
taka += 'r'
ans += r
else:
taka += 's'
an... | n,k = map(int,input().split())
r,s,p = map(int,input().split())
t = input()
#rのときpの点、sのときｒ、ｐのときｓ
from collections import Counter
taka = ''
ans = 0
for te in t[:k]:
if te == 'r':
taka += 'p'
ans += p
elif te == 's':
taka += 'r'
ans += r
else:
taka += 's'
an... | [
"literal.string.change"
] | 625,133 | 625,134 | u843318346 | python |
p02820 | n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = list(input())
win = []
ans = 0
for i in range(n):
if t[i] == "r":
win.append("p")
elif t[i] == "s":
win.append("r")
else:
win.append("s")
for i in range(n):
if i >= k:
if win[i] == win[i - k]:
... | n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = list(input())
win = []
ans = 0
for i in range(n):
if t[i] == "r":
win.append("p")
elif t[i] == "s":
win.append("r")
else:
win.append("s")
for i in range(n):
if i >= k:
if win[i] == win[i - k]:
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 625,135 | 625,136 | u038620042 | python |
p02820 | # 149D
n, k = map(int, input().split())
point={}
point['s'],point['p'],point['r'] = map(int, input().split())
s = input()
ans =0
before = [0]*k
for i in range(len(s)):
if i > k:
if (s[i] == s[i-k]) & (before[i%k]==1):
before[i%k] = 0
else:
ans += point[s[i]]
befo... | # 149D
n, k = map(int, input().split())
point={}
point['s'],point['p'],point['r'] = map(int, input().split())
s = input()
ans =0
before = [0]*k
for i in range(len(s)):
if i >= k:
if (s[i] == s[i-k]) & (before[i%k]==1):
before[i%k] = 0
else:
ans += point[s[i]]
bef... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 625,147 | 625,148 | u303739137 | python |
p02820 | import math
import sys
n, k = map(int, sys.stdin.readline().rstrip().split())
r, s, p = map(int, sys.stdin.readline().rstrip().split())
t = sys.stdin.readline().rstrip()
ans = 0
sim = []
for i, ti in enumerate(t):
if ti == 'r':
if i >= k and sim[i - k] == 'p':
sim.append('x')
else:
... | import math
import sys
n, k = map(int, sys.stdin.readline().rstrip().split())
r, s, p = map(int, sys.stdin.readline().rstrip().split())
t = sys.stdin.readline().rstrip()
ans = 0
sim = []
for i, ti in enumerate(t):
if ti == 'r':
if i >= k and sim[i - k] == 'p':
sim.append('x')
else:
... | [
"call.remove"
] | 625,160 | 625,161 | u478888932 | python |
p02820 | # -*- coding: utf-8 -*-
# D
import sys
# 再起回数上限変更
# sys.setrecursionlimit(1000000)
N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = list(input())
score = [R, S, P]
# Kのあまりごとに独立して計算する
ans = 0
num = N // K + 1
def vic_sol(s):
if s == 'r':
return 2
if s == 's':
return 0... | # -*- coding: utf-8 -*-
# D
import sys
# 再起回数上限変更
# sys.setrecursionlimit(1000000)
N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = list(input())
score = [R, S, P]
# Kのあまりごとに独立して計算する
ans = 0
num = N // K + 1
def vic_sol(s):
if s == 'r':
return 2
if s == 's':
return 0... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 625,166 | 625,167 | u265154666 | python |
p02820 | import collections
N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = list(input())
for i in range(N-K):
if T[i] == T[i+K]:
T[i+K] = "a"
c = colelctions.Counter(T)
print(c["r"]*P + c["s"]*R + c["p"]*S) | import collections
N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = list(input())
for i in range(N-K):
if T[i] == T[i+K]:
T[i+K] = "a"
c = collections.Counter(T)
print(c["r"]*P + c["s"]*R + c["p"]*S) | [
"assignment.value.change",
"identifier.change"
] | 625,176 | 625,177 | u686036872 | python |
p02820 | #D
n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = list(input())
# g=r点 t=s点 p=p点
ans = 0
for i in range(n):
if t[i] == "r":
if i >= k and t[i - k] == "r":
t[i] = 'm'#iの手以外の手
else:
ans += p
if t[i] == "t":
if i >= k and t[i - k] == "t":
... | #D
n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = list(input())
# r=r点 s=s点 p=p点
ans = 0
for i in range(n):
if t[i] == "r":
if i >= k and t[i - k] == "r":
t[i] = 'm'#iの手以外の手
else:
ans += p
if t[i] == "s":
if i >= k and t[i - k] == "s":
... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 625,182 | 625,183 | u490489966 | python |
p02820 | #D
n, k = map(int(), input().split())
r, s, p = map(int(), input().split())
t = list(input())
# g=r点 t=s点 p=p点
ans = 0
for i in range(n):
if t[i] == "r":
if i >= k and t[i - k] == "r":
t[i] = 'm'#iの手以外の手
else:
ans += p
if t[i] == "t":
if i >= k and t[i - k] == "t"... | #D
n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = list(input())
# r=r点 s=s点 p=p点
ans = 0
for i in range(n):
if t[i] == "r":
if i >= k and t[i - k] == "r":
t[i] = 'm'#iの手以外の手
else:
ans += p
if t[i] == "s":
if i >= k and t[i - k] == "s":
... | [
"call.arguments.change",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 625,184 | 625,183 | u490489966 | python |
p02820 | N,K=map(int,input().split())
R,S,P=map(int,input().split())
T=input()
l=[]
ans=0
for i in range(N):
if len(l)<K:
if T[i]=="r":
l.append("p")
ans+=P
elif T[i]=="s":
l.append("r")
ans+=R
else:
l.append("S")
ans+=S
elif... | N,K=map(int,input().split())
R,S,P=map(int,input().split())
T=input()
l=[]
ans=0
for i in range(N):
if len(l)<K:
if T[i]=="r":
l.append("p")
ans+=P
elif T[i]=="s":
l.append("r")
ans+=R
else:
l.append("s")
ans+=S
elif... | [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 625,194 | 625,195 | u349444371 | python |
p02820 | n, k = (int(x) for x in input().split())
r, s, p = (int(x) for x in input().split())
t_ch = input()
t=[]
for i in range(n):
t.append(t_ch[i])
for i in range(k-1, n):
if t[i] == t[i-k]:
t[i]=0
for i in range(0,n):
if t[i]=="r":
t[i]=p
elif t[i]=="p":
t[i]=s
elif t[i]=="s":
... | n, k = (int(x) for x in input().split())
r, s, p = (int(x) for x in input().split())
t_ch = input()
t=[]
for i in range(n):
t.append(t_ch[i])
for i in range(k, n):
if t[i] == t[i-k]:
t[i]=0
for i in range(0,n):
if t[i]=="r":
t[i]=p
elif t[i]=="p":
t[i]=s
elif t[i]=="s":
... | [
"expression.operation.binary.remove"
] | 625,205 | 625,206 | u207137484 | python |
p02820 | n, k = (int(x) for x in input().split())
r, s, p = (int(x) for x in input().split())
t_ch = input()
t=[]
for i in range(n):
t.append(t_ch[i])
for i in range(k-1, n):
if t[i] == t[i-k]:
t[i]=0
print(t)
for i in range(0,n):
if t[i]=="r":
t[i]=p
elif t[i]=="p":
t[i]=s
elif t[i... | n, k = (int(x) for x in input().split())
r, s, p = (int(x) for x in input().split())
t_ch = input()
t=[]
for i in range(n):
t.append(t_ch[i])
for i in range(k, n):
if t[i] == t[i-k]:
t[i]=0
for i in range(0,n):
if t[i]=="r":
t[i]=p
elif t[i]=="p":
t[i]=s
elif t[i]=="s":
... | [
"expression.operation.binary.remove",
"call.remove"
] | 625,207 | 625,206 | u207137484 | python |
p02820 | N,K=map(int,input().split())
R,S,P=map(int,input().split())
T=str(input())
rec=[]
ans=0
def win(hand):
if hand=='r':
return ['p',P]
elif hand=='s':
return ['r',R]
else:
return ['s',S]
def gap(hand):
if hand=='r':
return 's'
elif hand=='s':
return 'p'
el... | N,K=map(int,input().split())
R,S,P=map(int,input().split())
T=str(input())
rec=[]
ans=0
def win(hand):
if hand=='r':
return ['p',P]
elif hand=='s':
return ['r',R]
else:
return ['s',S]
def gap(hand):
if hand=='r':
return 's'
elif hand=='s':
return 'p'
el... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 625,208 | 625,209 | u523545435 | python |
p02820 | n,k=map(int,input().split())
r,s,p=map(int,input().split())
t=input()
dp=[0]*n
a = {"r":p, "s":r, "p":s}
for i in range(n):
if i>=k and t[i]==t[i-k]: # どうせ得点できないので、次に影響しないように'x'
dp[i]=0
t[i]='x'
else:
dp[i]=d[t[i]]
print(sum(dp)) | n,k=map(int,input().split())
r,s,p=map(int,input().split())
t=list(input())
dp=[0]*n
a = {"r":p, "s":r, "p":s}
for i in range(n):
if i>=k and t[i]==t[i-k]: # どうせ得点できないので、次に影響しないように'x'
dp[i]=0
t[i]='x'
else:
dp[i]=a[t[i]]
print(sum(dp)) | [
"call.add",
"call.arguments.change",
"assignment.value.change",
"identifier.change"
] | 625,218 | 625,219 | u755801379 | python |
p02820 | n,k=map(int,input().split())
r,s,p=map(int,input().split())
t=input()
score=0
scorei=0
myans=[]
myansi=""
for i in range(n):
if(t[i]=="r"):
myansi="p"
scorei=p
elif(t[i]=="s"):
myansi="r"
scorei=r
else:
myansi="s"
scorei=s
if(i>=k and myansi==myans[i-k])... | n,k=map(int,input().split())
r,s,p=map(int,input().split())
t=input()
score=0
scorei=0
myans=[]
myansi=""
for i in range(n):
if(t[i]=="r"):
myansi="p"
scorei=p
elif(t[i]=="s"):
myansi="r"
scorei=r
else:
myansi="s"
scorei=s
if(i>=k and myansi==myans[i-k])... | [] | 625,220 | 625,221 | u010090035 | python |
p02820 | N,K = map(int, input().split())
R,S,P = map(int, input().split())
T = input()
ans = 0
a = -(-N//K)
r = N%K
T2 = T + 'x'*r
li = []
for i in range(K):
st = ''
for j in range(a):
c = T2[j*K + i]
if st == '':
st += c
elif st[0] == c:
st += c
else:
... | N,K = map(int, input().split())
R,S,P = map(int, input().split())
T = input()
ans = 0
a = -(-N//K)
r = N%K
T2 = T + 'x'*(K - r)
li = []
for i in range(K):
st = ''
for j in range(a):
c = T2[j*K + i]
if st == '':
st += c
elif st[0] == c:
st += c
else:
... | [] | 625,226 | 625,227 | u197078193 | python |
p02820 | n,k=list(map(int,input().split()))
r,p,s=list(map(int,input().split()))
t=input()
vic=""
ans=0
for i in t:
if i=="r":
vic+="p"
if i=="p":
vic+="s"
if i=="s":
vic+="r"
#print(vic[:k])
for i in vic[:k]:
if i=="r":
ans+=r
elif i=="p":
ans+=p
elif i=="s":
... | n,k=list(map(int,input().split()))
r,s,p=list(map(int,input().split()))
t=input()
vic=""
ans=0
for i in t:
if i=="r":
vic+="p"
if i=="p":
vic+="s"
if i=="s":
vic+="r"
#print(vic[:k])
for i in vic[:k]:
if i=="r":
ans+=r
elif i=="p":
ans+=p
elif i=="s":
... | [] | 625,237 | 625,238 | u664373116 | python |
p02820 | N,K=map(int,input().split())
R,S,P=map(int,input().split()) #RSP グーチョキパー
T=list(input())
c=0
def jan(a):
if a=="r":
return P
elif a=="s":
return R
elif a=="p":
return S
else:
return 0
for i in range(1,N):
if T[i]==T[i-1]:
T[i]="o"
for i in range(1,K+1): #m... | N,K=map(int,input().split())
R,S,P=map(int,input().split()) #RSP グーチョキパー
T=list(input())
c=0
def jan(a):
if a=="r":
return P
elif a=="s":
return R
elif a=="p":
return S
else:
return 0
for i in range(K,N):
if T[i-K]==T[i]:
T[i]="o"
for i in range(1,K+1): #m... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 625,259 | 625,260 | u173148629 | python |
p02820 | n,k = map(int,input().split())
r,s,p = map(int,input().split())
T = int(input())
scores = {'r':p,'s':r,'p':s}
ans = 0
memo = []
for i in range(n):
if i < k:
ans += scores[T[i]]
memo.append(T[i])
else:
if memo[i-k] == T[i]:
memo.append('N')
else:
ans += scores[T[i]]
memo.append(... | n,k = map(int,input().split())
r,s,p = map(int,input().split())
T = input()
scores = {'r':p,'s':r,'p':s}
ans = 0
memo = []
for i in range(n):
if i < k:
ans += scores[T[i]]
memo.append(T[i])
else:
if memo[i-k] == T[i]:
memo.append('N')
else:
ans += scores[T[i]]
memo.append(T[i])... | [
"call.remove",
"call.arguments.change"
] | 625,265 | 625,266 | u103902792 | python |
p02820 | n,k=map(int,input().split())
scores=list(map(int,input().split()))
t=input()
winner={'r':2,'s':0,'p':1}
ans=0
for i in range(k):
ts=''
for j in range(n):
if k*j+i>=n:
break
ts+=t[k*j+i]
print(ts)
ts+='?'
l=len(ts)
hand=ts[0]
cnt=1
for j in range(1,l):
if hand==ts[j]:
cnt+=1
e... | n,k=map(int,input().split())
scores=list(map(int,input().split()))
t=input()
winner={'r':2,'s':0,'p':1}
ans=0
for i in range(k):
ts=''
for j in range(n):
if k*j+i>=n:
break
ts+=t[k*j+i]
ts+='?'
l=len(ts)
hand=ts[0]
cnt=1
for j in range(1,l):
if hand==ts[j]:
cnt+=1
else:
a... | [
"call.remove"
] | 625,269 | 625,270 | u163320134 | python |
p02820 | [N,K] = list(map(int,input().split()))
[R,S,P] = list(map(int,input().split()))
T = input()
j_l = "rsp"
kachi = lambda k : j_l[ (j_l.find(T[k]) + 2) % 3 ]#勝つ手を表示する
rireki = []#出した手の履歴
score = [0,0,0] #出した手の回数を記録
for i in range(N):
if i-K >= 0: #K番目以降
if kachi(i) != rireki[i-K]: #K回前の出した手と比べて、被ってない時、勝ち手を出す
... | [N,K] = list(map(int,input().split()))
[R,S,P] = list(map(int,input().split()))
T = input()
j_l = "rsp"
kachi = lambda k : j_l[ (j_l.find(T[k]) + 2) % 3 ]#勝つ手を表示する
rireki = []#出した手の履歴
score = [0,0,0] #出した手の回数を記録
for i in range(N):
if i-K >= 0: #K番目以降
if kachi(i) != rireki[i-K]: #K回前の出した手と比べて、被ってない時、勝ち手を出す
... | [
"call.arguments.change"
] | 625,273 | 625,274 | u674574659 | python |
p02820 | N,K = [int(i) for i in input().rstrip().split(' ')]
R,S,P = [int(i) for i in input().rstrip().split(' ')]
r = 0
T = input()
te = ["p","r","s"]
point = {"p":P,"r":R,"s":S}
Play = []
for i,t in enumerate(T):
best = te[te.index(t)-1]
if Play[i-K] != best if i >= K else True:
Play += [best]
r += poi... | N,K = [int(i) for i in input().rstrip().split(' ')]
R,S,P = [int(i) for i in input().rstrip().split(' ')]
r = 0
T = input()
te = ["p","r","s"]
point = {"p":P,"r":R,"s":S}
Play = []
for i,t in enumerate(T):
best = te[te.index(t)-1]
if Play[i-K] != best if i >= K else True:
Play += [best]
r += poi... | [] | 625,291 | 625,292 | u164029270 | python |
p02820 | import sys, re
from collections import deque, defaultdict, Counter
from math import floor, ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, dig... | import sys, re
from collections import deque, defaultdict, Counter
from math import floor, ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, dig... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 625,303 | 625,304 | u279493135 | python |
p02820 | n,k=map(int, input().split())
r,s,p=map(int, input().split())
t=input()
ans=0
for i in range(k):
u=s[i::k]
u=u.replace("rr", "rx")
u=u.replace("pp", "px")
u=u.replace("ss", "sx")
ans+=u.count("s")*r
ans+=u.count("p")*s
ans+=u.count("r")*p
print(ans) | n,k=map(int, input().split())
r,s,p=map(int, input().split())
t=input()
ans=0
for i in range(k):
u=t[i::k]
u=u.replace("rr", "rx")
u=u.replace("pp", "px")
u=u.replace("ss", "sx")
ans+=u.count("s")*r
ans+=u.count("p")*s
ans+=u.count("r")*p
print(ans) | [
"assignment.value.change",
"identifier.change"
] | 625,327 | 625,328 | u762540523 | python |
p02820 | N,K= [int(i) for i in input().split()]
R,S,P= [int(i) for i in input().split()]
n=input()
C=N//K + 1
s=0
for i in range(K):
m=""
for j in range(i,N,K):
if n[j] =='r':
if j < K:
s+=P
m ='r'
... | N,K= [int(i) for i in input().split()]
R,S,P= [int(i) for i in input().split()]
n=input()
C=N//K + 1
s=0
for i in range(K):
m=""
for j in range(i,N,K):
if n[j] =='r':
if j < K:
s+=P
m ='r'
... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 625,329 | 625,330 | u295294832 | python |
p02820 | """
N K
R S P
T
"""
ln1 = input().split()
ln2 = input().split()
ln3 = input().split()
N, K = int(ln1[0]), int(ln1[1])
R, S, P = int(ln2[0]), int(ln2[1]), int(ln2[2])
T = ln3
point = 0
result = []
def janken_result(te):
if te == "r":
return P
elif te == "s":
return R
elif te == "p":
... | """
N K
R S P
T
"""
ln1 = input().split()
ln2 = input().split()
ln3 = input().split()
N, K = int(ln1[0]), int(ln1[1])
R, S, P = int(ln2[0]), int(ln2[1]), int(ln2[2])
T = ln3[0]
point = 0
result = []
def janken_result(te):
if te == "r":
return P
elif te == "s":
return R
elif te == "p":
... | [
"call.arguments.change",
"expression.operation.unary.add"
] | 625,352 | 625,353 | u257447294 | python |
p02820 | N, K = map(int, input().split(' '))
R, S, P = map(int, input().split(' '))
T = list(input())
print(T)
score = 0
A = T
for i in range(N-K):
if T[i] == T[i+K]:
A[i+K] = 'a'
for i in range(N):
if A[i] == 'r':
score += P
elif A[i] == 's':
score += R
elif A[i] == 'p':
score += S
print(score) | N, K = map(int, input().split(' '))
R, S, P = map(int, input().split(' '))
T = list(input())
score = 0
A = T
for i in range(N-K):
if T[i] == T[i+K]:
A[i+K] = 'a'
for i in range(N):
if A[i] == 'r':
score += P
elif A[i] == 's':
score += R
elif A[i] == 'p':
score += S
print(score) | [
"call.remove"
] | 625,357 | 625,358 | u847861620 | python |
p02820 | n,k=map(int,input().split())
r,s,p=map(int,input().split())
t=input()
point=0
l=[]
point_list=[r,s,p]
kind=['r','s','p','r']
for i in range(n):
for j in range(len(kind)-1):
if t[i]==kind[j]:
if i-k>=0 and t[i]==kind[l[i-k]+1]:
if i+k<n and t[i+k]==kind[j+1]:
if j==2:j=-1
l.append... | n,k=map(int,input().split())
r,s,p=map(int,input().split())
t=input()
point=0
l=[]
point_list=[r,s,p]
kind=['r','s','p','r']
for i in range(n):
for j in range(len(kind)-1):
if t[i]==kind[j]:
if i-k>=0 and t[i]==kind[l[i-k]+1]:
if i+k<n and t[i+k]==kind[j+1]:
if j==2:j=-1
l.append... | [
"call.remove"
] | 625,373 | 625,374 | u575239123 | python |
p02820 | #!/usr/bin/env python3
# a 回目、b 回目を考えたとき、a mod K と b mod K の値が異なれば、a, b それぞれの回で独立に手を選べる。
# mod K の値に応じて、N 回のジャンケンを K 個のグループに分けたとき、各グループに対して、最大何点取れるかを考えればよい。
# あるグループで最大何点取れるかは、前回の手を覚えておきながら DP or 貪欲法で求めればよい。
n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = str(input())
# print(n, k, r, s, p, t... | #!/usr/bin/env python3
# a 回目、b 回目を考えたとき、a mod K と b mod K の値が異なれば、a, b それぞれの回で独立に手を選べる。
# mod K の値に応じて、N 回のジャンケンを K 個のグループに分けたとき、各グループに対して、最大何点取れるかを考えればよい。
# あるグループで最大何点取れるかは、前回の手を覚えておきながら DP or 貪欲法で求めればよい。
n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = str(input())
# print(n, k, r, s, p, t... | [] | 625,379 | 625,380 | u705857261 | python |
p02820 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factori... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factori... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 625,390 | 625,391 | u499381410 | python |
p02820 | def main():
[n, k] = [int(i) for i in input().split()]
[r, s, p] = [int(i) for i in input().split()]
T = input()
my = T.replace("r", "hoge").replace("s", "r").replace("p", "s").replace("hoge", "p")
for i in range(k, n):
if my[i] == my[i-k]:
my = my[:i] + "l" + my[i+1:]
print(my)
print(my.... | def main():
[n, k] = [int(i) for i in input().split()]
[r, s, p] = [int(i) for i in input().split()]
T = input()
my = T.replace("r", "hoge").replace("s", "r").replace("p", "s").replace("hoge", "p")
for i in range(k, n):
if my[i] == my[i-k]:
my = my[:i] + "l" + my[i+1:]
print(my.count("r")*... | [
"call.remove"
] | 625,392 | 625,393 | u954534284 | python |
p02820 | n, k = map(int, input().split(' '))
r, s, p = map(int, input().split(' '))
t = input()
dasita_te = []
score = 0
for i, c in enumerate(t):
if c == "r":
if (i >= k and dasita_te[i - k] != "p") or i < k:
score += p
dasita_te.append("p")
else:
dasita_te.append("-")... | n, k = map(int, input().split(' '))
r, s, p = map(int, input().split(' '))
t = input()
dasita_te = []
score = 0
for i, c in enumerate(t):
if c == "r":
if (i >= k and dasita_te[i - k] != "p") or i < k:
score += p
dasita_te.append("p")
else:
dasita_te.append("-")... | [
"call.remove"
] | 625,405 | 625,406 | u654386293 | python |
p02820 | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = list(input())
hands = ['r', 's', 'p']
for i,t in enumerate(T):
if t == 'r':
T[i] = 'p'
elif t == 's':
T[i] = 'r'
else:
T[i] = 's'
point = 0
for i,t in enumerate(T):
if i+1 <= K:
if t == 'r':
... | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = list(input())
hands = ['r', 's', 'p']
for i,t in enumerate(T):
if t == 'r':
T[i] = 'p'
elif t == 's':
T[i] = 'r'
else:
T[i] = 's'
point = 0
for i,t in enumerate(T):
if i+1 <= K:
if t == 'r':
... | [
"call.remove"
] | 625,411 | 625,412 | u164368835 | python |
p02820 | import math
import sys
INF = 10**10
(N, K) = list(map(int,input().split()))
(R, S, P) = list(map(int,input().split()))
T = input()
#print(N,K)
#print(R,S,P)
#print(T)
def maxp(s):
vr = 0
vs = 0
vp = 0
for i in range(0,len(s)):
if s[i] == 'r':
nvr = 0 + max(vs,vp)
nvs =... | import math
import sys
INF = 10**10
(N, K) = list(map(int,input().split()))
(R, S, P) = list(map(int,input().split()))
T = input()
#print(N,K)
#print(R,S,P)
#print(T)
def maxp(s):
vr = 0
vs = 0
vp = 0
for i in range(0,len(s)):
if s[i] == 'r':
nvr = 0 + max(vs,vp)
nvs =... | [
"call.add"
] | 625,415 | 625,416 | u068692021 | python |
p02820 | n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = list(input())
hand = {"r" : p, "s" : r, "p" : s}
ans = 0
for i in range(n-k):
temp= i-k
if temp >=0 and t[i]==t[temp]:
t[i]=""
else:
ans+=hand[t[i]]
print(ans) | n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = list(input())
hand = {"r" : p, "s" : r, "p" : s}
ans = 0
for i in range(n):
temp= i-k
if temp >=0 and t[i]==t[temp]:
t[i]=" "
else:
ans+=hand[t[i]]
print(ans) | [
"expression.operation.binary.remove",
"literal.string.change",
"assignment.value.change"
] | 625,421 | 625,422 | u357230322 | python |
p02820 | n,k = map(int,input().split())
r,s,p = map(int,input().split())
t = input()
#dp[i][ｊ]:=i番目までで、最後にｊを出したときの点数の最大値
dp = [[-10**9]*3for i in range(n+10)]
for i in range(k):
dp[i][0],dp[i][1],dp[i][2] = 0,0,0
for i in range(k):
for j in range(n//k+3):
if i > n-1:continue
if t[i] == "r":
... | n,k = map(int,input().split())
r,s,p = map(int,input().split())
t = input()
#dp[i][ｊ]:=i番目までで、最後にｊを出したときの点数の最大値
dp = [[-10**9]*3for i in range(n+k)]
for i in range(k):
dp[i][0],dp[i][1],dp[i][2] = 0,0,0
for i in range(k):
for j in range(n//k+3):
if i > n-1:continue
if t[i] == "r":
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 625,429 | 625,430 | u818349438 | python |
p02820 | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input()
optimal = {'r':'p', 's':'r', 'p':'s'}
point = {'r':R, 's':S, 'p':P}
ans = 0
A = []
for i in range(0, N):
if i <= K-1:
A.append(optimal[T[i]])
ans = ans + point[A[i]]
elif A[i-K] != optimal[T[i]]:
A.append(... | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input()
optimal = {'r':'p', 's':'r', 'p':'s'}
point = {'r':R, 's':S, 'p':P}
ans = 0
A = []
for i in range(0, N):
if i <= K-1:
A.append(optimal[T[i]])
ans = ans + point[A[i]]
elif A[i-K] != optimal[T[i]]:
A.append(... | [
"literal.string.change",
"call.arguments.change"
] | 625,446 | 625,447 | u304621853 | python |
p02820 | n, k = [int(x) for x in input().split()]
r, s, p = [int(x) for x in input().split()] # グー：r チョキ：s パー：p
t = list(input())
addscoremap = {'r': p, 's': r, 'p': s}
score = 0
for i in range(n):
if (0 < i-k) and (t[i] == t[i-k]):
t[i] = 'x'
continue
score += addscoremap[t[i]]
print(score)
| n, k = [int(x) for x in input().split()]
r, s, p = [int(x) for x in input().split()] # グー：r チョキ：s パー：p
t = list(input())
addscoremap = {'r': p, 's': r, 'p': s}
score = 0
for i in range(n):
if (0 <= i-k) and (t[i] == t[i-k]):
t[i] = 'x'
continue
score += addscoremap[t[i]]
print(score)
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 625,456 | 625,457 | u864213970 | python |
p02820 | n,k=map(int,input().split())
r,s,p=map(int,input().split())
t=list(input())
d=[]
ct=0
for i in range(k):
for j in range(i,n-i,k):
d.append(t[j])
for l in range(len(d)-1):
if d[l]==d[l+1]:
d[l+1]='out'
#print(d,i,n,k)
ct+=d.count('r')*p+d.count('s')*r+d.count('p')*s
d=[]
... | n,k=map(int,input().split())
r,s,p=map(int,input().split())
t=list(input())
d=[]
ct=0
for i in range(k):
#for m in range(k):
# if (n-1-m)%k==
for j in range(i,n,k):
d.append(t[j])
for l in range(len(d)-1):
if d[l]==d[l+1]:
d[l+1]='out'
# print(d,i,n,k)
ct+=d.count('... | [
"expression.operation.binary.remove"
] | 625,458 | 625,459 | u811132356 | python |
p02820 | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input()
List = [[] for k in range(K)]
for n in range(N):
List[n % K].append(T[n])
point = {'r': P, 's': R, 'p': S}
print(List)
score = 0
for k in range(K):
L = List[k]
count = 1
length = len(L)
for i in range(length):
... | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input()
List = [[] for k in range(K)]
for n in range(N):
List[n % K].append(T[n])
point = {'r': P, 's': R, 'p': S}
score = 0
for k in range(K):
L = List[k]
count = 1
length = len(L)
for i in range(length):
try:
... | [
"call.remove"
] | 625,463 | 625,464 | u997641430 | python |
p02820 | n,k = map(int,input().split())
r,s,p = map(int,input().split())
t = input()
l = {'r':'p','s':'r','p':'s'}
L = ['' for i in range(n)]
tmp = ['r','s','p']
for i in range(n):
x = t[i]
if (i - k) >= 0 and L[i-k] == l[x]:
tmp.remove(L[i-k])
if (i + k) <= n and l[t[i+k]] != l[x]:
tmp.remov... | n,k = map(int,input().split())
r,s,p = map(int,input().split())
t = input()
l = {'r':'p','s':'r','p':'s'}
L = ['' for i in range(n)]
tmp = ['r','s','p']
for i in range(n):
x = t[i]
if (i - k) >= 0 and L[i-k] == l[x]:
tmp.remove(L[i-k])
if (i + k) <= (n-1) and l[t[i+k]] != l[x]:
tmp.r... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 625,469 | 625,470 | u207576418 | python |
p02820 | def points(me, you, R, S, P):
hand_map = {
'r':'p',
's':'r',
'p':'s'
}
if hand_map[you] == me:
if me == 'r':
return R
elif me =='p':
return P
elif me =='s':
return S
else:
return 0
def main():
N, K = lis... | def points(me, you, R, S, P):
hand_map = {
'r':'p',
's':'r',
'p':'s'
}
if hand_map[you] == me:
if me == 'r':
return R
elif me =='p':
return P
elif me =='s':
return S
else:
return 0
def main():
N, K = lis... | [
"assignment.value.change"
] | 625,481 | 625,482 | u544587633 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.