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 |
|---|---|---|---|---|---|---|---|
p02713 | import math
K = int(input())
s = 0
for a in range(1,K+1):
for b in range(1,K+1):
x = math.gcd(a,b)
for c in range(1,K+1):
s += gcd(x,c)
print(s) | import math
K = int(input())
s = 0
for a in range(1,K+1):
for b in range(1,K+1):
x = math.gcd(a,b)
for c in range(1,K+1):
s += math.gcd(x,c)
print(s)
| [] | 475,469 | 475,470 | u229429359 | python |
p02713 | import math
K = int(input())
tmp = 0
cnt = 0
for a in range(1, K+1):
for b in range(1, K+1):
tmp = math.gcd(a, b)
cnt = sum([math.gcd(tmp, c) for c in range(1, K+1)])
print(cnt) | import math
K = int(input())
tmp = 0
cnt = 0
for a in range(1, K+1):
for b in range(1, K+1):
tmp = math.gcd(a, b)
cnt += sum([math.gcd(tmp, c) for c in range(1, K+1)])
print(cnt)
| [
"assignment.value.change"
] | 475,471 | 475,472 | u450147945 | python |
p02713 | def main():
from math import gcd
K = int(input())
result = 0
for a in range(1, K + 1):
for b in range(1, K + 1):
t = gcd(a, b)
for c in range(1, K + 1):
result += gcd(t, c)
print(result) | def main():
from math import gcd
K = int(input())
result = 0
for a in range(1, K + 1):
for b in range(1, K + 1):
t = gcd(a, b)
for c in range(1, K + 1):
result += gcd(t, c)
print(result)
main() | [
"call.add"
] | 475,479 | 475,480 | u123745130 | python |
p02713 | from math import gcd
K=int(input())+1
sum=0
for i in range(1,K):
for j in range(1,K):
for k in range(1,K):
sum+=gcd(gcd(1,j),k)
print(sum) | from math import gcd
K=int(input())+1
sum=0
for i in range(1,K):
for j in range(1,K):
for k in range(1,K):
sum+=gcd(gcd(i,j),k)
print(sum) | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 475,507 | 475,508 | u054729397 | python |
p02713 | import math
K = int(input())
res = sum([math.gcd(math.gcd(a, 1), c) for a in range(1,K+1) for b in range(1,K+1) for c in range(1,K+1)])
print(res) | import math
K = int(input())
res = sum([math.gcd(math.gcd(a, b), c) for a in range(1,K+1) for b in range(1,K+1) for c in range(1,K+1)])
print(res)
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 475,509 | 475,510 | u813174766 | python |
p02713 | from math import gcd
K = int(input())
sum = 0
for a in range(K + 1):
for b in range(K + 1):
for c in range(K + 1):
sum += gcd(gcd(a, b), c)
print(sum)
| from math import gcd
K = int(input())
sum = 0
for a in range(1, K + 1):
for b in range(1, K + 1):
for c in range(1, K + 1):
sum += gcd(gcd(a, b), c)
print(sum)
| [
"call.arguments.add"
] | 475,511 | 475,512 | u704658587 | python |
p02713 | import itertools
def gcd(a, b):
while b:
a, b = b, a % b
return a
def gcd_3(a,b,c):
a = gcd(gcd(a,b),c)
return a
k = int(input())
ans = 0
num = list(itertools.combinations_with_replacement(range(1,k+1),3))
print(num)
for l in num:
a,b,c = l
if a==b==c:
ans += a
elif a!=b!... | import itertools
def gcd(a, b):
while b:
a, b = b, a % b
return a
def gcd_3(a,b,c):
a = gcd(gcd(a,b),c)
return a
k = int(input())
ans = 0
num = list(itertools.combinations_with_replacement(range(1,k+1),3))
for l in num:
a,b,c = l
if a==b==c:
ans += a
elif a!=b!=c:
... | [
"call.remove"
] | 475,518 | 475,519 | u181295070 | python |
p02713 | import math
k = int(input())
ans = 0
for i in range(1,k+1):
for j in range(1,k+1):
num = min(i,j)
for l in range(1,k+1):
ans += math.gcd(num,l)
print(ans) | import math
k = int(input())
ans = 0
for i in range(1,k+1):
for j in range(1,k+1):
num = math.gcd(i,j)
for l in range(1,k+1):
ans += math.gcd(num,l)
print(ans) | [
"assignment.value.change"
] | 475,541 | 475,542 | u971091945 | python |
p02713 | import math
from functools import reduce
import numpy as np
from itertools import combinations
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
s = int(input())
qwe = np.arange(s+1)
sum = (1+s)*s/2
for i in range(1, s+1):
for j in range(i + 1, s+... | import math
from functools import reduce
import numpy as np
from itertools import combinations
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
s = int(input())
qwe = np.arange(s+1)
sum = (1+s)*s/2
for i in range(1, s+1):
for j in range(i + 1, s+... | [
"expression.operation.binary.add"
] | 475,551 | 475,552 | u532031128 | python |
p02713 | def u(a,b):
if(a<b):
z = b
b = a
a = z
r = a % b
while(r!=0):
a = b
b = r
r = a % b
return b
l = int(input())
s = 0
for i in range(1,l+1):
for i2 in range(1,l+1):
z = u(i,i2)
for i3 in range(1,l+1):
z2 = u(z,i3)
s+=z2
print (s) | def u(a,b):
if(a<b):
z = b
b = a
a = z
r = a % b
while(r!=0):
a = b
b = r
r = a % b
return b
l = int(input())
s = 0
for i in range(1,l+1):
for i2 in range(1,l+1):
z = u(i,i2)
for i3 in range(1,l+1):
z2 = u(i3,z)
s+=z2
print (s) | [
"call.arguments.change",
"call.arguments.add"
] | 475,563 | 475,562 | u762292470 | python |
p02713 | import math
k = int(input())
box = []
for i in range(1,k+1):
for j in range(1,k+1):
gap = math.gcd(i,j)
if gap == 1:
box.append(1*k)
else:
for l in range(1,k+1):
gap2 = math.gcd(gap,l)
box.append(gap2)
print(sum(box))
print(box) | import math
k = int(input())
box = []
for i in range(1,k+1):
for j in range(1,k+1):
gap = math.gcd(i,j)
if gap == 1:
box.append(1*k)
else:
for l in range(1,k+1):
gap2 = math.gcd(gap,l)
box.append(gap2)
print(sum(box))
| [
"call.remove"
] | 475,574 | 475,575 | u626467464 | python |
p02713 | def gcd2(a,b):
x, y = max(a, b), min(a, b)
if x % y == 0:
return y
else:
while x % y != 0:
x, y = y, x % y
return x
K = int(input())
s = [gcd2(a, b) for a in range(1, K+1) for b in range(a+1, K+1)]
t = [2 * gcd2(a, b) for a in range(1, K+1) for b in s]
n = [gcd2(a, b) f... | def gcd2(a,b):
x, y = max(a, b), min(a, b)
if x % y == 0:
return y
else:
while x % y != 0:
x, y = y, x % y
return y
K = int(input())
s = [gcd2(a, b) for a in range(1, K+1) for b in range(a+1, K+1)]
t = [2 * gcd2(a, b) for a in range(1, K+1) for b in s]
n = [gcd2(a, b) f... | [
"identifier.change",
"function.return_value.change"
] | 475,593 | 475,594 | u599004729 | python |
p02713 | import math
from functools import reduce
from numba import jit
@jit
def gcd(*nums):
return reduce(math.gcd, nums)
input_num = int(input()) + 1
result = 0
for a in range(1, input_num):
for b in range(1, input_num):
for c in range(1, input_num):
result += gcd(a, b, c)
print(result)
| import math
from functools import reduce
def gcd(*nums):
return reduce(math.gcd, nums)
input_num = int(input()) + 1
result = 0
for a in range(1, input_num):
for b in range(1, input_num):
for c in range(1, input_num):
result += gcd(a, b, c)
print(result)
| [] | 475,597 | 475,598 | u509007899 | python |
p02713 | # coding: utf-8
import math
from functools import reduce
K = int(input())
tmp = []
c = 0
for i in range(K):
for j in range(K):
tmp.append(math.gcd(i + 1, j + 1))
c = c + 1
tmp2 = []
for k in tmp:
for m in range(K):
tmp2.append(math.gcd(k, m+1))
print("sum:",sum(tmp2)) | # coding: utf-8
import math
from functools import reduce
K = int(input())
tmp = []
c = 0
for i in range(K):
for j in range(K):
tmp.append(math.gcd(i + 1, j + 1))
c = c + 1
tmp2 = []
for k in tmp:
for m in range(K):
tmp2.append(math.gcd(k, m+1))
print(sum(tmp2)) | [
"call.arguments.change"
] | 475,609 | 475,610 | u102223485 | python |
p02713 | N = int(input())
sum=0
import math
for i in range(N):
for j in range(N):
t=gcd(i+1,j+1)
for k in range(N):
sum =sum + gcd(t, k+1)
print(sum)
| N = int(input())
sum=0
import math
for i in range(N):
for j in range(N):
t=math.gcd(i+1,j+1)
for k in range(N):
sum =sum + math.gcd(t, k+1)
print(sum) | [] | 475,611 | 475,612 | u241544828 | python |
p02713 | from math import gcd
k = int(input())
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
ans += gcd(gcd(a, b), c)
print(c) | from math import gcd
k = int(input())
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
ans += gcd(gcd(a, b), c)
print(ans) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 475,613 | 475,614 | u525882286 | python |
p02713 | from math import gcd
k=200
ans=0
for i in range(1,k+1):
for j in range(i,k+1):
for k in range(j,k+1):
s=len(set([i,j,k]))
if s==1:
p=1
elif s==2:
p=3
elif s==3:
p=6
tmp=gcd(i,j)
tmp= p*gcd... | from math import gcd
k=int(input())
ans=0
for i in range(1,k+1):
for j in range(i,k+1):
for k in range(j,k+1):
s=len(set([i,j,k]))
if s==1:
p=1
elif s==2:
p=3
elif s==3:
p=6
tmp=gcd(i,j)
t... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 475,623 | 475,624 | u103208639 | python |
p02713 | import math
from functools import reduce
K = int(input())
result = 0
def gcd(*numbers):
return reduce(math.gcd, numbers)
for a in range(0, K+1):
for b in range(0, K+1):
for c in range(0, K+1):
result += gcd(a, b, c)
print(result) | import math
from functools import reduce
K = int(input())
result = 0
def gcd(*numbers):
return reduce(math.gcd, numbers)
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
result += gcd(a, b, c)
print(result) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 475,627 | 475,628 | u578647703 | python |
p02713 | import math
K = 200
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
tmp = math.gcd(i,j)
for k in range(1,K+1):
ans += math.gcd(tmp,k)
print(ans) | import math
K = int(input())
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
tmp = math.gcd(i,j)
for k in range(1,K+1):
ans += math.gcd(tmp,k)
print(ans) | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 475,629 | 475,630 | u580362735 | python |
p02713 | import math
k = int(input())
ans = (k+1)*k//2
tttt = [[0]*(k+1) for _ in range(k+1)]
for i in range(1, k+1):
for j in range(1, k+1):
if i == j:
continue
else:
if tttt[i][j] != 0:
g = tttt[i][j]
ans += 3*g
else:
g = math.gcd(i,j)
tttt[i][j] = g
tttt[j][... | import math
k = int(input())
ans = (k+1)*k//2
tttt = [[0]*(k+1) for _ in range(k+1)]
for i in range(1, k+1):
for j in range(1, k+1):
if i == j:
continue
else:
if tttt[i][j] != 0:
g = tttt[i][j]
ans += 3*g
else:
g = math.gcd(i,j)
tttt[i][j] = g
tttt[j][... | [
"identifier.change",
"expression.operation.binary.change"
] | 475,641 | 475,642 | u720636500 | python |
p02713 | import math
k=int(input())
ans=0
for i in range(1,k+1):
for j in range(i,k+1):
for l in range(j,k+1):
if i==j and j==l:
ans+=i
# print(i,j,l)
elif i==j or j==k:
ans+=3*math.gcd(i,l)
# p... | import math
k=int(input())
ans=0
for i in range(1,k+1):
for j in range(i,k+1):
for l in range(j,k+1):
if i==j and j==l:
ans+=i
# print(i,j,l)
elif i==j or j==l:
ans+=3*math.gcd(i,l)
# p... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 475,660 | 475,661 | u235210692 | python |
p02713 | from math import gcd
K=int(input())
ans = 0
for a in range(1,K+1):
for b in range(a,K+1):
for c in range(b,K+1):
ans += gcd(gcd(a,b),c)
print(ans) | from math import gcd
K=int(input())
ans = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
ans += gcd(gcd(a,b),c)
print(ans)
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 475,673 | 475,674 | u474423089 | python |
p02713 | import math
from functools import reduce
from itertools import product
import numpy
def gcd(*numbers):
return reduce(math.gcd, numbers)
n = int(input())
l = product(range(1, 1+n), repeat=3)
print(numpy.cumsum([gcd(*i) for i in l])) | import math
from functools import reduce
from itertools import product
def gcd(*numbers):
return reduce(math.gcd, numbers)
n = int(input())
l = product(range(1, 1+n), repeat=3)
print(sum([gcd(*i) for i in l])) | [
"call.arguments.change",
"io.output.change"
] | 475,696 | 475,697 | u368657799 | python |
p02713 | n = input()
total = 0
#a > b
def gcd(a,b):
if b == 0:
return a
return gcd(b, a % b)
total = total + n * (n+1) / 2
for i in range(n):
for j in range(i+1,n):
total = total + 6 * gcd(j+1,i+1)
for i in range(n):
for j in range(i+1,n):
for k in range(j+1,n):
l = gcd(j+1,k+1)
if i < l:
total = total ... | n = int(input())
total = 0
#a > b
def gcd(a,b):
if b == 0:
return a
return gcd(b, a % b)
total = total + n * (n+1) / 2
for i in range(n):
for j in range(i+1,n):
total = total + 6 * gcd(j+1,i+1)
for i in range(n):
for j in range(i+1,n):
for k in range(j+1,n):
l = gcd(j+1,k+1)
if i < l:
total = t... | [
"call.add",
"call.arguments.change"
] | 475,700 | 475,701 | u568334289 | python |
p02713 | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(input())
ans = 0
memo = {}
for i in range(1,K+1,2):
for j in range(1,K+1,2):
for k in range(1,K+1,2):
ans += gcd(i,j,k)
print(ans)
| import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(input())
ans = 0
memo = {}
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
ans += gcd(i,j,k)
print(ans)
| [
"call.arguments.change"
] | 475,702 | 475,703 | u285443936 | python |
p02713 | def resolve():
K = int(input())
temp = 0
for i in range(1, K + 1, 1):
for j in range(1, K + 1, 1):
for k in range(1, K + 1, 1):
Result = math.gcd(i, j)
temp += math.gcd(Result, k)
print(temp)
resolve() | import math
def resolve():
K = int(input())
temp = 0
for i in range(1, K + 1, 1):
for j in range(1, K + 1, 1):
for k in range(1, K + 1, 1):
Result = math.gcd(i, j)
temp += math.gcd(Result, k)
print(temp)
resolve() | [
"assignment.value.change",
"identifier.change"
] | 475,709 | 475,710 | u673506152 | python |
p02713 | import math
from functools import reduce
import itertools
def gcd_list(numbers):
return reduce(math.gcd, numbers)
k = int(input())
items = list(range(1, k+1))
ans = 6 * sum(items)
ans += sum([6 * gcd_list(item) for item in itertools.combinations(items, 2)])
ans += sum([6 * gcd_list(item) for item in itertools.com... | import math
from functools import reduce
import itertools
def gcd_list(numbers):
return reduce(math.gcd, numbers)
k = int(input())
items = list(range(1, k+1))
ans = sum(items)
ans += sum([6 * gcd_list(item) for item in itertools.combinations(items, 2)])
ans += sum([6 * gcd_list(item) for item in itertools.combina... | [
"expression.operation.binary.remove"
] | 475,717 | 475,718 | u310012552 | python |
p02713 | import math
from functools import reduce
K = 200
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans = 0
for i in range(1, K+1):
for j in range(i, K+1):
for k in range(j, K+1):
if i == j and j ==k:
ans += i
elif i==j or j==k or i==k:
ans +=... | import math
from functools import reduce
K = int(input())
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans = 0
for i in range(1, K+1):
for j in range(i, K+1):
for k in range(j, K+1):
if i == j and j ==k:
ans += i
elif i==j or j==k or i==k:
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 475,723 | 475,724 | u590230319 | python |
p02713 | import math
k = int(input())
sum = 0
for a in range(k - 2):
for b in range(a + 1, k - 1):
for c in range(b + 1, k):
sum += 6 * math.gcd(a + 1, math.gcd(b + 1, c + 1))
for a in range(k - 1):
for b in range(a + 1, k):
sum += 3 * math.gcd(a + 1, b + 1)
sum += k * (k + 1) // 2
print... | import math
k = int(input())
sum = 0
for a in range(k - 2):
for b in range(a + 1, k - 1):
for c in range(b + 1, k):
sum += 6 * math.gcd(a + 1, math.gcd(b + 1, c + 1))
for a in range(k - 1):
for b in range(a + 1, k):
sum += 6 * math.gcd(a + 1, b + 1)
sum += k * (k + 1) // 2
print... | [
"literal.number.integer.change",
"expression.operation.binary.change"
] | 475,729 | 475,730 | u135961419 | python |
p02713 | k = int(input())
ans = 0
for i in range(1, k+1):
for j in range(1, k+1):
key = gcd(i, j)
for n in range(1, k+1):
ans += gcd(key, n)
print(ans) | from math import gcd
k = int(input())
ans = 0
for i in range(1, k+1):
for j in range(1, k+1):
key = gcd(i, j)
for n in range(1, k+1):
ans += gcd(key, n)
print(ans) | [] | 475,737 | 475,738 | u021548497 | python |
p02713 | import math
k = 200
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
ans += math.gcd(math.gcd(a, b), c)
print(ans)
| import math
k = int(input())
ans = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
ans += math.gcd(math.gcd(a, b), c)
print(ans)
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 475,741 | 475,742 | u733774002 | python |
p02713 | import math
import functools
k = int(input())
sum = 0
for i in range(1, k+1):
for j in range(1, k+1):
for l in range(1, k+i):
sum += functools.reduce(math.gcd, (i, j, l))
print(sum) | import math
import functools
k = int(input())
sum = 0
for i in range(1, k+1):
for j in range(1, k+1):
for l in range(1, k+1):
sum += functools.reduce(math.gcd, (i, j, l))
print(sum)
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 475,743 | 475,744 | u737756998 | python |
p02713 | import math
K = int(input())
gcd = [[[0]* K for _ in range(K)] for _ in range(K)]
ans = 0
for a in range(K):
for b in range(K):
for c in range(K):
if gcd[a][b][c] == 0:
res = math.gcd(math.gcd(a,b),c)
gcd[a][b][c] = res
gcd[b][c][a] = res
... | import math
K = int(input())
gcd = [[[0]* K for _ in range(K)] for _ in range(K)]
ans = 0
for a in range(K):
for b in range(K):
for c in range(K):
if gcd[a][b][c] == 0:
res = math.gcd(math.gcd(a+1,b+1),c+1)
gcd[a][b][c] = res
gcd[b][c][a] = res
... | [
"assignment.change"
] | 475,747 | 475,748 | u801049006 | python |
p02713 | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
n= int(input())
ans = 0
for i in range(1, k+1):
for j in range(1, k+1):
for k in range(1, k+1):
ans += gcd(i, j, k)
print(ans) | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
n= int(input())
ans = 0
for i in range(1, n+1):
for j in range(1, n+1):
for k in range(1, n+1):
ans += gcd(i, j, k)
print(ans) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 475,767 | 475,768 | u209426189 | python |
p02713 | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
n= int(input())
ans = 0
for i in range(1, k+1):
for j in range(1, k+1):
for k in range(1, k+1):
ans += gcd(i, j, k)
print(ans) | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
n= int(input())
ans = 0
for i in range(1, n+1):
for j in range(1, n+1):
for k in range(1, n+1):
ans += gcd(i, j, k)
print(ans) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 475,769 | 475,768 | u209426189 | python |
p02713 | k = int(input())
ans = 0
import math
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
f = gcd(i,j)
ff = gcd(f,l)
ans += ff
print(ans) | k = int(input())
ans = 0
import math
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
f = math.gcd(i,j)
ff = math.gcd(f,l)
ans += ff
print(ans)
| [] | 475,776 | 475,777 | u075595666 | python |
p02713 | from math import gcd
n = int(input())
sum = 0
for i in range(1, n + 1):
for j in range(1, i):
for k in range(1, j):
sum+=6*gcd(gcd(k,j),i)
sum+=3*gcd(j,i)
sum+=i
print(sum) | from math import gcd
n = int(input())
sum = 0
for i in range(1, n + 1):
for j in range(1, i):
for k in range(1, j):
sum += 6 * gcd(gcd(k, j), i)
sum += 6 * gcd(j, i)
sum += i
print(sum)
| [
"literal.number.integer.change",
"expression.operation.binary.change"
] | 475,801 | 475,802 | u391157755 | python |
p02713 | import math
k=int(input())
A=[[0 for i in range(k+1)] for j in range(k+1)]
s2=0
for i in range(1,k+1):
for j in range(1,k+1):
if i!=j:
s2=s2+math.gcd(i,j)
A[i][j]=math.gcd(i,j)
s1=0
for i in range(1,k-1):
for j in range(i+1,k):
for l in range(i+2,k+1):
s1=s1+A... | import math
k=int(input())
A=[[0 for i in range(k+1)] for j in range(k+1)]
s2=0
for i in range(1,k+1):
for j in range(1,k+1):
if i!=j:
s2=s2+math.gcd(i,j)
A[i][j]=math.gcd(i,j)
s1=0
for i in range(1,k-1):
for j in range(i+1,k):
for l in range(j+1,k+1):
s1=s1+A... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"literal.number.integer.change"
] | 475,803 | 475,804 | u239653493 | python |
p02713 | def gcd(m, n):
while n:
m, n = n, m % n
return m
K = int(input())
ans = 0
for a in range(1, K + 1):
for b in range(a + 1, K + 1):
for c in range(b + 1, K + 1):
_ans = gcd(gcd(a, b), c)
if a == b and b == c:
ans += _ans
elif a == b or b == ... | def gcd(m, n):
while n:
m, n = n, m % n
return m
K = int(input())
ans = 0
for a in range(1, K + 1):
for b in range(a, K + 1):
for c in range(b, K + 1):
_ans = gcd(gcd(a, b), c)
if a == b and b == c:
ans += _ans
elif a == b or b == c:
... | [
"expression.operation.binary.remove"
] | 475,820 | 475,821 | u807864121 | python |
p02713 | from math import gcd
k = int(input())
gcdl = [[0 for i in range(k + 1)]for i in range(k+1)]
for i in range(1, k + 1):
for j in range(1, k + 1):
gcdl[i][j] = gcd(i, j)
s = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
for l in range(1, k + 1):
s += gcdl[i][gcdl[j][k]]
print(s... | from math import gcd
k = int(input())
gcdl = [[0 for i in range(k + 1)] for i in range(k + 1)]
for i in range(1, k + 1):
for j in range(1, k + 1):
gcdl[i][j] = gcd(i, j)
s = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
for l in range(1, k + 1):
s += gcdl[i][gcdl[j][l]]
prin... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 475,828 | 475,829 | u202634017 | python |
p02713 | import math
n = int(input())
ans = 0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
ans += math.gcd(i, gcd(j,k))
print(ans) | import math
n = int(input())
ans = 0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
ans += math.gcd(i, math.gcd(j,k))
print(ans)
| [
"identifier.change"
] | 475,830 | 475,831 | u945157177 | python |
p02713 | import math
K=200
ans=0
for a in range(1,K+1):
for b in range(a,K+1):
for c in range(b,K+1):
tempgcd=math.gcd(a,b)
if a==b or b==c or a==c:
if a==b and b==c:
ans=ans+math.gcd(tempgcd,c)
else:
ans=ans+3*math.gcd(tempgcd,c)
... | import math
K=int(input())
ans=0
for a in range(1,K+1):
for b in range(a,K+1):
for c in range(b,K+1):
tempgcd=math.gcd(a,b)
if a==b or b==c or a==c:
if a==b and b==c:
ans=ans+math.gcd(tempgcd,c)
else:
ans=ans+3*math.gcd(temp... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 475,843 | 475,844 | u046158516 | python |
p02713 | import math
from functools import reduce
#K = int(input())
K = 200
def gcd(*numbers):
return reduce(math.gcd, numbers)
sum = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
sum += gcd(a, b, c)
print(sum) | import math
from functools import reduce
K = int(input())
def gcd(*numbers):
return reduce(math.gcd, numbers)
sum = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
sum += gcd(a, b, c)
print(sum) | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 475,845 | 475,846 | u655663334 | python |
p02713 | import math
from functools import reduce
k=int(input())
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans=0
for i in range(1,k+1):
for j in range(i,k+1):
for l in range(j,k+1):
if l==i:
ans+=gcd(i,j,l)
elif i==j or j==l:
ans+=2*gcd(i,j,l)
else:
ans+=gcd(i,j,l)
p... | import math
from functools import reduce
k=int(input())
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans=0
for i in range(1,k+1):
for j in range(i,k+1):
for l in range(j,k+1):
if l==i:
ans+=gcd(i,j,l)
elif i==j or j==l:
ans+=3*gcd(i,j,l)
else:
ans+=6*gcd(i,j,l)... | [
"literal.number.integer.change",
"expression.operation.binary.change"
] | 475,853 | 475,854 | u864273141 | python |
p02713 | import math
from functools import reduce
k=int(input())
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans=0
for i in range(1,k+1):
for j in range(j,k+1):
for l in range(l,k+1):
if l==i:
ans+=gcd(i,j,l)
elif i==j or j==l:
ans+=2*gcd(i,j,l)
else:
ans+=gcd(i,j,l)
p... | import math
from functools import reduce
k=int(input())
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans=0
for i in range(1,k+1):
for j in range(i,k+1):
for l in range(j,k+1):
if l==i:
ans+=gcd(i,j,l)
elif i==j or j==l:
ans+=3*gcd(i,j,l)
else:
ans+=6*gcd(i,j,l)... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"literal.number.integer.change",
"expression.operation.binary.change"
] | 475,855 | 475,854 | u864273141 | python |
p02713 | import math
import itertools
# a = 6
# b = 4
#
# print(math.gcd(a, b))
k = int(input())
kk = k + 1
ans = 0
for i in range(1, kk):
# print(i)
for ii in rangea(1, kk):
# print(ii)
for iii in range(1, kk):
# print((i,ii,iii))
gcd2 = math.gcd(ii, iii)
gcd3 = math... | import math
import itertools
# a = 6
# b = 4
#
# print(math.gcd(a, b))
k = int(input())
kk = k + 1
ans = 0
for i in range(1, kk):
# print(i)
for ii in range(1, kk):
# print(ii)
for iii in range(1, kk):
# print((i,ii,iii))
gcd2 = math.gcd(ii, iii)
gcd3 = math.... | [
"identifier.change",
"call.function.change"
] | 475,861 | 475,862 | u824734140 | python |
p02713 | k=int(input())+1
l=[]
for a in range(1,k):
for b in range(1,k):
for c in range(1,k):
l.append(math.gcd(a,math.gcd(b,c)))
print (sum(l)) | import math
k=int(input())+1
l=[]
for a in range(1,k):
for b in range(1,k):
for c in range(1,k):
l.append(math.gcd(a,math.gcd(b,c)))
print (sum(l)) | [] | 475,863 | 475,864 | u013202780 | python |
p02713 | def gcd_base(a, b):
while b!=0:
a, b = b, a%b
return a
def gcd(num_list):
ans = 0
for i in num_list:
ans = gcd_base(ans, i)
return ans
k = int(input())
ans = 0
for i in range(1, k-1):
for j in range(i+1, k):
for l in range(j+1, k+1):
ans += 6*gcd([i,j,k])
fo... | def gcd_base(a, b):
while b!=0:
a, b = b, a%b
return a
def gcd(num_list):
ans = 0
for i in num_list:
ans = gcd_base(ans, i)
return ans
k = int(input())
ans = 0
for i in range(1, k-1):
for j in range(i+1, k):
for l in range(j+1, k+1):
ans += 6*gcd([i,j,l])
fo... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.integer.change"
] | 475,865 | 475,866 | u318127926 | python |
p02713 | from functools import reduce
from itertools import product
def gcd(a, b):
while b: a, b = b, a % b
return a
def gcd_list(A): return reduce(gcd, A)
K = int(input())
S = K * (K + 1) // 2
for a, b in combinations(range(1, K+1), 2):
S += 6 * gcd(a, b)
for a, b, c in combinations(range(1, K+1), 3):
S += 6... | from functools import reduce
from itertools import combinations
def gcd(a, b):
while b: a, b = b, a % b
return a
def gcd_list(A): return reduce(gcd, A)
K = int(input())
S = K * (K + 1) // 2
for a, b in combinations(range(1, K+1), 2):
S += 6 * gcd(a, b)
for a, b, c in combinations(range(1, K+1), 3):
S... | [
"identifier.change"
] | 475,879 | 475,880 | u497046426 | python |
p02713 | def main(): #startline-------------------------------------------
k = int(input())
ans = 0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
ans += gcd(gcd(i,j),l)
print(ans)
if __name__ == "__main__":
main() #endline===========================... | from math import gcd
def main(): #startline-------------------------------------------
k = int(input())
ans = 0
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
ans += gcd(gcd(i,j),l)
print(ans)
if __name__ == "__main__":
main() #endline======... | [] | 475,883 | 475,884 | u928784113 | python |
p02713 | import math
K=int(input())
S=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
S+=gcd(gcd(i,j),k)
print(S) | from math import gcd
K=int(input())
S=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
S+=gcd(gcd(i,j),k)
print(S) | [] | 475,900 | 475,901 | u585963734 | python |
p02713 | from math import gcd
k = int(input())
ans = 0
for a in range(1,k+1):
for b in range(a,k+1):
ab = gcd(a,b)
for c in range(c,k+1):
g = gcd(ab,c)
if a == b == c:
ans += g
elif a!=b!=c!=a:
ans += g*6
else:
ans += g*3
print(ans)
| from math import gcd
k = int(input())
ans = 0
for a in range(1,k+1):
for b in range(a,k+1):
ab = gcd(a,b)
for c in range(b,k+1):
g = gcd(ab,c)
if a == b == c:
ans += g
elif a != b !=c != a:
ans += g*6
else:
ans += g*3
print(ans)
| [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 475,906 | 475,907 | u145600939 | python |
p02713 | from math import gcd
k=int(input())
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
for g in range(1,k+1):
ans += math.gcd(math.gcd(i,j), g)
print(ans) | from math import gcd
k=int(input())
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
for g in range(1,k+1):
ans += gcd(gcd(i,j), g)
print(ans) | [] | 475,908 | 475,909 | u749770850 | python |
p02713 | from math import gcd
k=int(input())
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
for k in range(1,k+1):
ans += math.gcd(math.gcd(i,j), k)
print(ans) | from math import gcd
k=int(input())
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
for g in range(1,k+1):
ans += gcd(gcd(i,j), g)
print(ans) | [
"identifier.change",
"call.arguments.change"
] | 475,910 | 475,909 | u749770850 | python |
p02713 | import math
K = int(input())
ans = 0
for a in range(1, K + 1):
for b in range(a, K + 1):
d = math.gcd(a, b)
for c in range(b, K + 1):
d = math.gcd(d, c)
if a == b == c:
m = 1
elif a == b or b == c or c == a:
m = 3
else... | import math
K = int(input())
ans = 0
for a in range(1, K + 1):
for b in range(a, K + 1):
ab = math.gcd(a, b)
for c in range(b, K + 1):
abc = math.gcd(ab, c)
if a == b == c:
m = 1
elif a == b or b == c or c == a:
m = 3
... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 475,911 | 475,912 | u197955752 | python |
p02713 | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(input())
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
total += gcd(i,j,k)
print(total) | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(input())
total = K*K
for i in range(2,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
total += gcd(i,j,k)
print(total) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 475,920 | 475,919 | u957872856 | python |
p02713 | import math
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(input())
ans = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
ans += gcd(a, b, c)
print(ans) | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(input())
ans = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
ans += gcd(a, b, c)
print(ans) | [] | 475,921 | 475,922 | u449863068 | python |
p02713 | from functools import reduce
import math
import sys
K = int(input())
def gcd(*args):
return reduce(math.gcd, args)
if K==1:
print("1")
elif K==2:
print("9")
sys.exit()
ans = K * (K+1)//2
for i in range(1,K):
for j in range(i+1,K+1):
ans += 6*math.gcd(i,j)
for i in range(1,K-1):
for j in range... | from functools import reduce
import math
import sys
K = int(input())
def gcd(*args):
return reduce(math.gcd, args)
if K==1:
print("1")
sys.exit()
elif K==2:
print("9")
sys.exit()
ans = K * (K+1)//2
for i in range(1,K):
for j in range(i+1,K+1):
ans += 6*math.gcd(i,j)
for i in range(1,K-1):
f... | [
"call.add"
] | 475,925 | 475,926 | u220121083 | python |
p02713 | from math import gcd
key = int(input())
sin = 0
for i in range(1,k+1):
for j in range(1,k+1):
tmp = gcd(i,j)
for m in range(1,k+1):
sin += gcd(m,tmp)
print(sin) | from math import gcd
key = int(input())
sin = 0
for i in range(1,key+1):
for j in range(1,key+1):
temp = gcd(i,j)
for m in range(1,key+1):
sin += gcd(m,temp)
print(sin) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"assignment.variable.change"
] | 475,929 | 475,930 | u955123468 | python |
p02713 | from collections import defaultdict
import math
# N, K = map(int, input().split(' '))
N = int(input())
wa = 0
d = defaultdict(set)
d[1].add(1)
for i in range(2, 201):
for j in range(i-1, 0, -1):
if i % j == 0:
d[i].add(j)
for i in range(1, N+1):
for j in range(1, N+1):
for k in ran... | from collections import defaultdict
import math
# N, K = map(int, input().split(' '))
N = int(input())
wa = 0
d = defaultdict(set)
d[1].add(1)
for i in range(2, 201):
for j in range(i, 0, -1):
if i % j == 0:
d[i].add(j)
for i in range(1, N+1):
for j in range(1, N+1):
for k in range... | [
"expression.operation.binary.remove"
] | 475,941 | 475,942 | u360061665 | python |
p02713 | import math
K=int(input())
r=0
for i in range(1,K+1):
for j in range(1,K+1):
a=math.gcd(i,j)
for k in range(K+1):
b=math.gcd(a,k)
r+=b
print(r) | import math
K=int(input())
r=0
for i in range(1,K+1):
for j in range(1,K+1):
a=math.gcd(i,j)
for k in range(1,K+1):
b=math.gcd(a,k)
r+=b
print(r) | [
"call.arguments.add"
] | 475,953 | 475,954 | u031115006 | python |
p02713 | N = int(input())
ans = 0
for a in range(1, N + 1):
for b in range(1, N + 1):
tmp = math.gcd(a, b)
for c in range(1, N + 1):
ans += math.gcd(tmp, c)
print(ans) | import math
N = int(input())
ans = 0
for a in range(1, N + 1):
for b in range(1, N + 1):
tmp = math.gcd(a, b)
for c in range(1, N + 1):
ans += math.gcd(tmp, c)
print(ans) | [] | 475,957 | 475,958 | u833990553 | python |
p02713 | def gcd(a, b):
while b:
a, b = b, a % b
return a
K = int(input())
ans = 0
for a in range(1, K+1):
for b in range(1, K+1):
gcd = gcd(a, b)
for c in range(1, K+1):
ans += gcd(gcd, c)
print(ans) | def gcd(a, b):
while b:
a, b = b, a % b
return a
K = int(input())
ans = 0
for a in range(1, K+1):
for b in range(1, K+1):
d = gcd(a, b)
for c in range(1, K+1):
ans += gcd(d, c)
print(ans) | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change"
] | 475,961 | 475,962 | u732870425 | python |
p02713 | import math
K = int(input())
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
ab = math.gcd(a, b)
for k in range(1,K+1):
ans += math.gcd(ab, c)
print(ans) | import math
K = int(input())
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
ij = math.gcd(i, j)
for k in range(1,K+1):
ans += math.gcd(ij, k)
print(ans) | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.arguments.change"
] | 475,963 | 475,964 | u050641473 | python |
p02713 | import math
K = int(input())
sum = 0
for a in range(1, K+1) :
for b in range(1 , K+1) :
tmp = math.gcd(a, b)
for c in range(1 , K+1) :
sum = sum + math.gcd(a, tmp)
print(sum)
| import math
K = int(input())
sum = 0
for a in range(1, K+1) :
for b in range(1 , K+1) :
tmp = math.gcd(a, b)
for c in range(1 , K+1) :
sum = sum + math.gcd(tmp, c)
print(sum)
| [
"call.arguments.change",
"call.arguments.add"
] | 475,965 | 475,966 | u062808720 | python |
p02713 | import math
K = int(input())
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
x = math.gcd(i, j)
for k in range(1, K+1):
count += math.gcd(x, k)
print(ans) | import math
K = int(input())
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
x = math.gcd(i, j)
for k in range(1, K+1):
ans += math.gcd(x, k)
print(ans) | [
"identifier.change"
] | 475,967 | 475,968 | u686036872 | python |
p02713 | import math
gcd = math.gcd()
ans = 0
k = int(input())
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
ans += gcd(i,gcd(j,l))
print(ans)
| import math
gcd = math.gcd
ans = 0
k = int(input())
for i in range(1,k+1):
for j in range(1,k+1):
for l in range(1,k+1):
ans += gcd(i,gcd(j,l))
print(ans)
| [
"call.arguments.change"
] | 475,976 | 475,977 | u401487574 | python |
p02713 | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
N = int(input())
cnt = 0
for i in range(1, N+1):
for j in range(i, N + 1):
for k in range(j, N + 1):
cnt += gcd(i, j, k)
print(cnt) | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
N = int(input())
cnt = 0
for i in range(1, N+1):
for j in range(1, N + 1):
for k in range(1, N + 1):
cnt += gcd(i, j, k)
print(cnt) | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 475,978 | 475,979 | u692054751 | python |
p02713 | import math
N = int(input())
sum_ = 1+N
#sum_ = 0
for i in range(1, 1+N):
for j in range(1, 1+N):
a = math.gcd(i, j)
for k in range(1, 1+N):
sum_ += math.gcd(a, k)
print(sum_) | import math
N = int(input())
#sum_ = 1+N
sum_ = 0
for i in range(1, 1+N):
for j in range(1, 1+N):
a = math.gcd(i, j)
for k in range(1, 1+N):
sum_ += math.gcd(a, k)
print(sum_) | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 475,985 | 475,986 | u552533086 | python |
p02713 | k = int(input())
s = 0
for a in range(1, k+1):
for b in range(1, k+1):
ab = math.gcd(a, b)
for c in range(1, k+1):
s += math.gcd(ab, c)
print(s)
| import math
k = int(input())
s = 0
for a in range(1, k+1):
for b in range(1, k+1):
ab = math.gcd(a, b)
for c in range(1, k+1):
s += math.gcd(ab, c)
print(s)
| [] | 475,987 | 475,988 | u558489851 | python |
p02714 | n = int(input())
s = list(input())
Rcount = 0
Gcount = 0
Bcount = 0
cnt = 0
for i in range(len(s)):
if s[i] == "R":
Rcount += 1
elif s[i] == "G":
Gcount += 1
elif s[i] == "B":
Bcount += 1
RGB = Rcount * Gcount * Bcount
for i in range(1,len... | n = int(input())
s = list(input())
Rcount = 0
Gcount = 0
Bcount = 0
cnt = 0
for i in range(len(s)):
if s[i] == "R":
Rcount += 1
elif s[i] == "G":
Gcount += 1
elif s[i] == "B":
Bcount += 1
RGB = Rcount * Gcount * Bcount
for i in range(1,(le... | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 476,045 | 476,046 | u432853936 | python |
p02714 | from sys import stdin
n = int(input())
s = stdin.readline()
r = 0
g = 0
b = 0
for i in range(n):
if s[i] == "R":
r += 1
elif s[i] == "G":
g += 1
else:
b += 1
count1 = r*g*b
count2 = 0
for i in range(0,n-3):
for j in range(i+1,n-2):
if 2*j-i<=n-1:
if (s[i] != ... | from sys import stdin
n = int(input())
s = stdin.readline()
r = 0
g = 0
b = 0
for i in range(n):
if s[i] == "R":
r += 1
elif s[i] == "G":
g += 1
else:
b += 1
count1 = r*g*b
count2 = 0
for i in range(0,n-2):
for j in range(i+1,n-1):
if 2*j-i<=n-1:
if (s[i] != ... | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 476,136 | 476,137 | u050805798 | python |
p02714 | N=int(input())
S=list(input())
a=[0]*4
for i in range(N):
if S[i]=='R':a[0]+=1
if S[i]=='G':a[1]+=1
if S[i]=='B':a[2]+=1
for i in range(N):
for j in range(i+1,N):
k=j+(j-i)
if k>=N:
break
else:
if S[i]!=S[j] and S[j]!=S[k] and S[k]!=S[i] and j-i==k-j:
a[3]+=1
print(a)
prin... | N=int(input())
S=list(input())
a=[0]*4
for i in range(N):
if S[i]=='R':a[0]+=1
if S[i]=='G':a[1]+=1
if S[i]=='B':a[2]+=1
for i in range(N):
for j in range(i+1,N):
k=j+(j-i)
if k>=N:
break
else:
if S[i]!=S[j] and S[j]!=S[k] and S[k]!=S[i] and j-i==k-j:
a[3]+=1
print(a[0]*a[... | [
"call.remove"
] | 476,165 | 476,166 | u585963734 | python |
p02714 | import sys
input = sys.stdin.readline
def main():
n = int(input())
s_li = list(input().rstrip())
r_li = []
g_li = []
b_li = []
for i in range(n):
if s_li[i] == 'R':
r.append(i)
elif s_li[i] == 'G':
g.append(i)
elif s_li[i] == 'B':
b.... | import sys
input = sys.stdin.readline
def main():
n = int(input())
s_li = list(input().rstrip())
r_li = []
g_li = []
b_li = []
for i in range(n):
if s_li[i] == 'R':
r_li.append(i)
elif s_li[i] == 'G':
g_li.append(i)
elif s_li[i] == 'B':
... | [
"identifier.change"
] | 476,218 | 476,219 | u227550284 | python |
p02714 | n = int(input())
s = input()
arr = []
R = len(list(filter(lambda x:x == 'R', s)))
G = len(list(filter(lambda x:x == 'G', s)))
B = len(list(filter(lambda x:x == 'B', s)))
tot = R*G*B
for i in range(n):
for j in range(i+1, n):
k = 2*j-i
if k > n:
continue
if (s[i] != s[j]) & (s[i] != s[k]) & (s[j] !... | n = int(input())
s = input()
arr = []
R = len(list(filter(lambda x:x == 'R', s)))
G = len(list(filter(lambda x:x == 'G', s)))
B = len(list(filter(lambda x:x == 'B', s)))
tot = R*G*B
for i in range(n):
for j in range(i+1, n):
k = 2*j-i
if k >= n:
continue
if (s[i] != s[j]) and (s[i] != s[k]) and (s... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 476,225 | 476,224 | u819593641 | python |
p02714 | import sys
def input():
return sys.stdin.readline()[:-1]
N = int(input())
S = input()
from collections import defaultdict
d = defaultdict(int)
for i in range(N):
s = S[i]
d[s] += 1
cnt = 0
for i in range(N-2):
for j in range(i,N-1):
k = 2*j - i
if k <= N-1 and (S[i] != S[j] and S[j] !... | import sys
def input():
return sys.stdin.readline()[:-1]
N = int(input())
S = input()
from collections import defaultdict
d = defaultdict(int)
for i in range(N):
s = S[i]
d[s] += 1
cnt = 0
for i in range(N-2):
for j in range(i,N-1):
k = 2*j - i
if k <= N-1 and (S[i] != S[j] and S[j] !... | [
"call.add"
] | 476,227 | 476,228 | u514401521 | python |
p02714 | N = int(input())
s = input()
r_cnt = s.count('R')
g_cnt = s.count('G')
b_cnt = s.count('B')
ans = r_cnt * g_cnt * b_cnt
for i in range(N):
for j in range(i,N):
k = 2*j - i
if k > N:
break
elif S[i]!=S[j] and S[j]!=S[k] and S[k]!=S[i]:
ans -= 1
print(ans) | N = int(input())
S = input()
r_cnt = S.count('R')
g_cnt = S.count('G')
b_cnt = S.count('B')
ans = r_cnt * g_cnt * b_cnt
for i in range(N):
for j in range(i,N):
k = 2*j - i
if k >= N:
break
if S[i]!=S[j] and S[j]!=S[k] and S[k]!=S[i]:
ans -= 1
# print(i,j,... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 476,231 | 476,232 | u168832623 | python |
p02714 | N = int(input())
s = input()
r_cnt = s.count('R')
g_cnt = s.count('G')
b_cnt = s.count('B')
ans = r_cnt * g_cnt * b_cnt
for i in range(N):
for j in range(i,N):
k = 2*j - i
if k >= N:
break
elif S[i]!=S[j] and S[j]!=S[k] and S[k]!=S[i]:
ans -= 1
print(ans) | N = int(input())
S = input()
r_cnt = S.count('R')
g_cnt = S.count('G')
b_cnt = S.count('B')
ans = r_cnt * g_cnt * b_cnt
for i in range(N):
for j in range(i,N):
k = 2*j - i
if k >= N:
break
if S[i]!=S[j] and S[j]!=S[k] and S[k]!=S[i]:
ans -= 1
# print(i,j,... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 476,233 | 476,232 | u168832623 | python |
p02714 | n = int(input())
s = input()
R = []
G = []
B = []
for i in range(n):
if(s[i] == 'R'):
R.append(i)
elif(s[i] == 'G'):
G.append(i)
else:
B.append(i)
samu = len(R) * len(G) * len(B)
for i in R:
for j in G:
k = int(2 * j - i)
if(k < n):
if(s[k] == 'B'):... | n = int(input())
s = input()
R = []
G = []
B = []
for i in range(n):
if(s[i] == 'R'):
R.append(i)
elif(s[i] == 'G'):
G.append(i)
else:
B.append(i)
samu = len(R) * len(G) * len(B)
for i in R:
for j in G:
k = int(2 * j - i)
if(0 <= k < n):
if(s[k] == ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 476,269 | 476,270 | u749742659 | python |
p02714 | def main():
N = int(input())
S = input()
from collections import Counter
c = Counter(S)
result = 1
if len(list(c.values())) < 3:
return 0
for v in c.values():
result *= v
piyo = (N-3) // 2
for p in range(piyo+1):
for i in range(N-1 - 2*p -2 + 1):
a... | def main():
N = int(input())
S = input()
from collections import Counter
c = Counter(S)
result = 1
if len(list(c.values())) < 3:
print(0)
return
for v in c.values():
result *= v
piyo = (N-3) // 2
for p in range(piyo+1):
for i in range(N-1 - 2*p -2 + 1)... | [
"call.add"
] | 476,277 | 476,278 | u060736237 | python |
p02714 | from sys import stdin
def S(): return stdin.readline().rstrip()
def I(): return int(stdin.readline().rstrip())
n = I()
s = list(S())
r = s.count('R')
g = s.count('G')
b = s.count('B')
ans = r*g*b
for i in range(n-1):
for j in range(1,int(n/2)):
if i-j<0 or n<=i+j:
break
else:
... | from sys import stdin
def S(): return stdin.readline().rstrip()
def I(): return int(stdin.readline().rstrip())
n = I()
s = list(S())
r = s.count('R')
g = s.count('G')
b = s.count('B')
ans = r*g*b
for i in range(n-1):
for j in range(1,n):
if i-j<0 or n<=i+j:
break
else:
i... | [
"call.remove",
"call.arguments.change"
] | 476,305 | 476,306 | u844895214 | python |
p02714 | n = int(input())
s = input()
r = s.count('R')
g = s.count('G')
b = s.count('B')
ans = r*g*b
for i in range(n-2):
for j in range(i+1, n-1):
k = 2j - i
if k >= n:
break
if s[i]!=s[j] and s[k]!= s[i] and s[j]!=s[k]:
ans -= 1
print(ans)
| n = int(input())
s = input()
r = s.count('R')
g = s.count('G')
b = s.count('B')
ans = r*g*b
for i in range(n-2):
for j in range(i+1, n-1):
k = 2*j - i
if k >= n:
break
if s[i]!=s[j] and s[k]!= s[i] and s[j]!=s[k]:
ans -= 1
print(ans)
| [] | 476,307 | 476,308 | u771167374 | python |
p02714 | n = int(input())
s = input()
R = []
G = []
B = []
cnt = 0
for i in range(n):
if s[i] == 'R':
R.append(i)
elif s[i] == 'G':
G.append(i)
else:
B.append(i)
ans = len(R) * len(G) * len(B)
for i in range(1,n-2):
for j in range(i,n-1):
k = 2 * j - i
if k >= n:
... | n = int(input())
s = input()
R = []
G = []
B = []
cnt = 0
for i in range(n):
if s[i] == 'R':
R.append(i)
elif s[i] == 'G':
G.append(i)
else:
B.append(i)
ans = len(R) * len(G) * len(B)
for i in range(n-2):
for j in range(i,n-1):
k = 2 * j - i
if k >= n:
... | [
"call.arguments.change"
] | 476,331 | 476,332 | u806779442 | python |
p02714 | N=int(input())
S=input()
R=S.count("R")
G=S.count("G")
B=S.count("B")
if R==0 or G==0 or B==0:
print(0)
ans=R*G*B
for i in range(N-2):
for j in range(i+1,N-1):
if S[i]==S[j]:continue
n=2*j-i
if n>=N:continue
if S[i]!=S[n] and S[j]!=S[n]:
ans-=1
print(ans) | N=int(input())
S=input()
R=S.count("R")
G=S.count("G")
B=S.count("B")
if R==0 or G==0 or B==0:
print(0)
exit()
ans=R*G*B
for i in range(N-2):
for j in range(i+1,N-1):
if S[i]==S[j]:continue
n=2*j-i
if n>=N:continue
if S[i]!=S[n] and S[j]!=S[n]:
ans-=1
print(an... | [
"call.add"
] | 476,341 | 476,342 | u948524308 | python |
p02714 | def main():
n, s = int(input()), input()
r, g, b = 0, 0, 0
for i in s:
if i == 'R':
r += 1
if i == 'G':
g += 1
if i == 'b':
b += 1
ans = r * g * b
s = tuple(s)
v = {'R', 'G', 'B'}
for i in range(n - 2):
for j in range(n // ... | def main():
n, s = int(input()), input()
r, g, b = 0, 0, 0
for i in s:
if i == 'R':
r += 1
if i == 'G':
g += 1
if i == 'B':
b += 1
ans = r * g * b
s = tuple(s)
v = {'R', 'G', 'B'}
for i in range(n - 2):
for j in range(n // ... | [
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 476,357 | 476,358 | u127499732 | python |
p02714 | N = int(input())
S = input()
ans = S.count("R") * S.count("G") * S.count("B")
for i in range(N):
for j in range(i+1,N):
k = j-i+j
if k<N and S[k]!=S[j] and S[k]!=S[j] and S[i]!=S[j]:
ans -= 1
print(ans) | N = int(input())
S = list(input())
ans = S.count("R") * S.count("G") * S.count("B")
for i in range(N):
for j in range(i+1,N):
k = j-i+j
if k<N and S[k]!=S[i] and S[k]!=S[j] and S[i]!=S[j]:
ans -= 1
print(ans) | [
"call.add",
"call.arguments.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 476,418 | 476,419 | u107269063 | python |
p02714 | N = int(input())
S = list(input())
A = S.count("R") * S.count("G") * S.count("B")
for i in range(N-3):
for j in range(i+1, N-1):
k = j-i+j
if k<N and S[k] != S[j] and S[k] != S[i] and S[i] !=S[j]:
A -= 1
print(A)
| N = int(input())
S = list(input())
A = S.count("R") * S.count("G") * S.count("B")
for i in range(N):
for j in range(i+1, N):
k = j-i+j
if k<N and S[k] != S[j] and S[k] != S[i] and S[i] !=S[j]:
A -= 1
print(A)
| [
"expression.operation.binary.remove"
] | 476,426 | 476,425 | u352402050 | python |
p02714 | N=int(input())
S=input()
r,g,b = S.count('R'),S.count('G'),S.count('B')
total = r*g*b
count = 0
for d in range(1,N//2):
for i in range(N-2*d):
if S[i]!=S[i+d] and S[i+d]!=S[i+2*d] and S[i+2*d] != S[i]:
count+=1
print(total-count)
| N=int(input())
S=input()
r,g,b = S.count('R'),S.count('G'),S.count('B')
total = r*g*b
count = 0
for d in range(1,N):
for i in range(N-2*d):
if S[i]!=S[i+d] and S[i+d]!=S[i+2*d] and S[i+2*d] != S[i]:
count+=1
print(total-count)
| [
"expression.operation.binary.remove"
] | 476,429 | 476,430 | u221061152 | python |
p02714 | from collections import Counter
n=int(input())
s=input()
c=Counter(s)
ans=c['R']*c['G']*c['B']
lim=n//2
for i in range(1,n//2):
for j in range(i,n-i):
l=s[j-i]
m=s[j]
r=s[j+i]
if l!=m and m!=r and r!=l:
ans-=1
print(ans) | from collections import Counter
n=int(input())
s=input()
c=Counter(s)
ans=c['R']*c['G']*c['B']
lim=n//2
for i in range(1,n//2+1):
for j in range(i,n-i):
l=s[j-i]
m=s[j]
r=s[j+i]
if l!=m and m!=r and r!=l:
ans-=1
print(ans) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 476,455 | 476,456 | u094191970 | python |
p02714 | n=int(input())
s=input()
r=s.count('R')
g=s.count('G')
b=s.count('B')
cnt=0
for i in range(n-2):
for j in range(1, min(i+1, n-i)):
if (s[i] != s[i-j]) and (s[i] != s[i+j]) and (s[i-j] != s[i+j]):
cnt += 1
print(r*g*b-cnt) | n=int(input())
s=input()
r=s.count('R')
g=s.count('G')
b=s.count('B')
cnt=0
for i in range(n-1):
for j in range(1, min(i+1, n-i)):
if (s[i] != s[i-j]) and (s[i] != s[i+j]) and (s[i-j] != s[i+j]):
cnt += 1
print(r*g*b-cnt) | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 476,499 | 476,500 | u496009935 | python |
p02714 |
def solve(N, S):
ans = 0
R, G, B = 0, 0, 0
for i in range(N):
if S[i] == "R":
R += 1
elif S[i] == "G":
G += 1
else:
B += 1
ans = R * G * B
idx = 0
dif = 1
while dif <= N//2+1:
while idx + dif + dif < N:
if S[i... |
def solve(N, S):
ans = 0
R, G, B = 0, 0, 0
for i in range(N):
if S[i] == "R":
R += 1
elif S[i] == "G":
G += 1
else:
B += 1
# print(R, G, B, R*G*B)
ans = R * G * B
dif = 1
while dif <= N//2+1:
idx = 0
while idx + di... | [
"assignment.remove",
"assignment.add"
] | 476,558 | 476,559 | u383713431 | python |
p02714 | from numba import jit
n=int(input())
s=input()
R=[]
G=[]
B=[]
@jit
def f():
for i in range(n):
if s[i]=="R":
R.append(i)
elif s[i]=="G":
G.append(i)
else:
B.append(i)
r=len(R)
g=len(G)
b=len(B)
if r==0 or g==0 or b==0:
return 0
else:
ans=r*g*b
m=0
for j in ran... | n=int(input())
s=input()
R=[]
G=[]
B=[]
def f():
for i in range(n):
if s[i]=="R":
R.append(i)
elif s[i]=="G":
G.append(i)
else:
B.append(i)
r=len(R)
g=len(G)
b=len(B)
if r==0 or g==0 or b==0:
return 0
else:
ans=r*g*b
m=0
for j in range(1,n-1):
for k in ran... | [] | 476,589 | 476,590 | u979823197 | python |
p02714 | n=int(input())
s=input()
d={'R':0,'G':0,'B':0}
for i in s:
d[i]+=1
ans=1
for i in d:
ans*=d[i]
for k in range(n//2):
for i in range(n-2*k):
if len(set([s[i],s[i+k],s[i+2*k]]))==3:ans-=1
print(ans) | n=int(input())
s=input()
d={'R':0,'G':0,'B':0}
for i in s:
d[i]+=1
ans=1
for i in d:
ans*=d[i]
for k in range(n//2+1):
for i in range(n-2*k):
if len(set([s[i],s[i+k],s[i+2*k]]))==3:ans-=1
print(ans) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 476,665 | 476,666 | u730769327 | python |
p02714 | import sys
input = sys.stdin.readline
def main():
n= int(input())
s = str(input().rstrip())
r= s.count('R')
g=s.count('G')
b = s.count('B')
ans = 0
for i in range(2):
for j in range(i+1, (n+i+1)//2):
k = 2*j-i
t = {s[i], s[j], s[k]}
if len(t) ==3:
... | import sys
input = sys.stdin.readline
def main():
n= int(input())
s = str(input().rstrip())
r= s.count('R')
g=s.count('G')
b = s.count('B')
ans = 0
for i in range(n-2):
for j in range(i+1, (n+i+1)//2):
k = 2*j-i
t = {s[i], s[j], s[k]}
if len(t) ==3... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 476,761 | 476,762 | u137226361 | python |
p02714 | import collections
n=int(input())
S=input()
s=collections.Counter(S)
print(s)
ans=s['R']*s['G']*s['B']
for i in range(n):
for d in range(n):
j=i+d
k=j+d
if k>n-1:
break
if S[i]!=S[j] and S[j]!=S[k] and S[k]!=S[i]:
ans-=1
print(ans) | #162D
#RGB Triplets
import collections
n=int(input())
S=input()
s=collections.Counter(S)
ans=s['R']*s['G']*s['B']
for i in range(n):
for d in range(n):
j=i+d
k=j+d
if k>n-1:
break
if S[i]!=S[j] and S[j]!=S[k] and S[k]!=S[i]:
ans-=1
print(ans) | [
"call.remove"
] | 476,785 | 476,786 | u658915215 | python |
p02714 | from collections import Counter
n = int(input())
s = input()
cnt = Counter(s)
ans = cnt['R'] * cnt['G'] * cnt['B']
for i in range(n):
for j in range(n):
k = 2 * j - i
if k > n-1:
break
if 1 < j < k and s[i] != s[j] and s[j] != s[k] and s[i] != s[k]:
ans -= 1
print(... | from collections import Counter
n = int(input())
s = input()
cnt = Counter(s)
ans = cnt['R'] * cnt['G'] * cnt['B']
for i in range(n):
for j in range(n):
k = 2 * j - i
if k > n-1:
break
if i < j < k and s[i] != s[j] and s[j] != s[k] and s[i] != s[k]:
ans -= 1
print(... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 476,797 | 476,798 | u801049006 | python |
p02714 | N = int(input())
S = input()
count_R = 0
count_G = 0
count_B = 0
count = 0
for i in range(N):
if S[i] == 'R':
count_R = count_R+1
elif S[i] == 'G':
count_G = count_G+1
else:
count_B = count_B+1
count = count_R*count_G*count_B
for i in range(N):
for j in range(i+1,N):
if S[i] !... | N = int(input())
S = input()
count_R = 0
count_G = 0
count_B = 0
count = 0
for i in range(N):
if S[i] == 'R':
count_R = count_R+1
elif S[i] == 'G':
count_G = count_G+1
else:
count_B = count_B+1
count = count_R*count_G*count_B
for i in range(N):
for j in range(i+1,N):
if S[i] !... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 476,801 | 476,802 | u119947188 | python |
p02714 | N = int(input())
S = list(input())
R = [0]*N
G = [0]*N
B = [0]*N
for i in range(N):
if S[i]=="R":
R[i] += 1
elif S[i] == "G":
G[i] += 1
else:
B[i] += 1
ans = sum(R)*sum(G)*sum(B)
for i in range(N):
for j in range(i+1,min((N+3)//2,N)):
k = 2*j-i
if k<N:
... | N = int(input())
S = list(input())
R = [0]*N
G = [0]*N
B = [0]*N
for i in range(N):
if S[i]=="R":
R[i] += 1
elif S[i] == "G":
G[i] += 1
else:
B[i] += 1
ans = sum(R)*sum(G)*sum(B)
for i in range(N):
for j in range(i+1,min((N+i+3)//2,N)):
k = 2*j-i
if k<N:
... | [
"expression.operation.binary.add"
] | 476,812 | 476,813 | u212786022 | python |
p02714 | n = int(input())
s = input()
r = s.count('R')
g = s.count('G')
b = s.count('B')
ans = r * g * b
for i in range(n):
for d in range(1, n):
j = i + d
k = j + d
if k > n:
break
if s[i] != s[j] and s[i] != s[k] and s[j] != s[k]:
ans -= 1
print(ans) | n = int(input())
s = input()
r = s.count('R')
g = s.count('G')
b = s.count('B')
ans = r * g * b
for i in range(n):
for d in range(1, n):
j = i + d
k = j + d
if k >= n:
break
if s[i] != s[j] and s[i] != s[k] and s[j] != s[k]:
ans -= 1
print(ans) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 476,827 | 476,828 | u970267139 | python |
p02714 | n = int(input())
s = input()
r = []
g = []
b = [0]*4000
for i,j in enumerate(s):
if j == 'R':
r.append(i)
if j == 'G':
g.append(i)
if j == 'B':
b[i] += 1
cnt = len(r)*len(g)*sum(b)
for i in r:
for j in g:
if b[2*j-i] == 1 :
cnt -= 1
if b[2*i-j] == 1 :
cnt -= 1
if (i+j)%2 == 0... | n = int(input())
s = input()
r = []
g = []
b = [0]*40000
for i,j in enumerate(s):
if j == 'R':
r.append(i)
if j == 'G':
g.append(i)
if j == 'B':
b[i] += 1
cnt = len(r)*len(g)*sum(b)
for i in r:
for j in g:
if b[2*j-i] == 1 :
cnt -= 1
if b[2*i-j] == 1 :
cnt -= 1
if (i+j)%2 == ... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 476,841 | 476,842 | u760569096 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.