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 |
|---|---|---|---|---|---|---|---|
p02701 | n = int(input)
lis = [input() for i in range(n)]
print(len(set(lis)))
| n = int(input())
lis = [input() for i in range(n)]
print(len(set(lis)))
| [
"call.add"
] | 453,880 | 453,881 | u162612857 | python |
p02701 | import collections
N=int(input())
L=[input() for i in range(N)]
C = collections.Counter(L)
D = list(C.values())
E=sum(D)
print(E) | import collections
N=int(input())
L=[input() for i in range(N)]
C = collections.Counter(L)
D = list(C.values())
print(len(D)) | [
"call.remove"
] | 453,884 | 453,885 | u250061066 | python |
p02701 | N = int(input())
n_list = []
for i in range(N):
n_list.append(input())
print(len(dict(Counter(n_list)))) | from collections import Counter
N = int(input())
n_list = []
for i in range(N):
n_list.append(input())
print(len(dict(Counter(n_list)))) | [] | 453,894 | 453,895 | u140191608 | python |
p02701 | n=input()
s=[0]*n
for i in range(n):
s[i]=input()
se=set(s)
print(len(se)) | n=int(input())
s=[0]*n
for i in range(n):
s[i]=input()
se=set(s)
print(len(se)) | [
"call.add",
"call.arguments.change"
] | 453,906 | 453,907 | u041351774 | python |
p02701 | from collections import defaultdict
def solve():
N = int(input())
A = [input() for _ in range(N)]
d = defaultdict(int)
for a in A:
d[a] += 1
return len(d)
# print(solve())
# def solve()が@return voidのとき
solve() | from collections import defaultdict
def solve():
N = int(input())
A = [input() for _ in range(N)]
d = defaultdict(int)
for a in A:
d[a] += 1
return len(d)
print(solve())
# def solve()が@return voidのとき
#solve()
| [
"call.add",
"call.arguments.change"
] | 453,929 | 453,930 | u112317104 | python |
p02701 | N = int(input())
ans = {}
for i in range(N):
ans.add(input())
print(len(ans)) | N = int(input())
ans = set()
for i in range(N):
ans.add(input())
print(len(ans)) | [
"call.arguments.change"
] | 453,910 | 453,911 | u432098488 | python |
p02701 | from collections import defaultdict
a = defaultdict(int)
n = int(input())
for i in range(n):
w = input()
a[w] += 1
print(max(a.values())) | from collections import defaultdict
a = defaultdict(int)
n = int(input())
for i in range(n):
w = input()
a[w] += 1
print(len(a.items())) | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 453,923 | 453,924 | u755117996 | python |
p02701 | n=int(input())
#n,k=list(map(int,input().split()))
ans=defaultdict(int)
for i in range(n):
s=input()
ans[s]+=1
print(len(ans.keys())) | from collections import defaultdict
n=int(input())
#n,k=list(map(int,input().split()))
ans=defaultdict(int)
for i in range(n):
s=input()
ans[s]+=1
print(len(ans.keys()))
| [] | 453,933 | 453,934 | u664373116 | python |
p02702 | S = input()
N = len(S)
counter = [0] * 2019
counter[0] = 1
T = 0
R = 1
for i in range(N):
T = (T + R * int(S[n - i - 1])) % 2019
R = 10 * R % 2019
counter[T] += 1
ans = 0
for i in range(2019):
m = counter[i]
ans += m * (m - 1) // 2
print(ans) | S = input()
N = len(S)
counter = [0] * 2019
counter[0] = 1
T = 0
R = 1
for i in range(N):
T = (T + R * int(S[N - i - 1])) % 2019
R = 10 * R % 2019
counter[T] += 1
ans = 0
for i in range(2019):
m = counter[i]
ans += m * (m - 1) // 2
print(ans) | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 453,941 | 453,942 | u202560873 | python |
p02702 | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) for x in s... | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) for x in s... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 453,943 | 453,944 | u941753895 | python |
p02702 | def egcd(a, b):
"""Returns a triple (g, x, y), such that ax + by = g = gcd(a,b).
Assumes a, b >= 0, and that at least one of them is > 0.
Bounds on output values: |x|, |y| <= max(a, b)."""
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b % a, a)
return (g, x - (b // a... | def egcd(a, b):
"""Returns a triple (g, x, y), such that ax + by = g = gcd(a,b).
Assumes a, b >= 0, and that at least one of them is > 0.
Bounds on output values: |x|, |y| <= max(a, b)."""
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b % a, a)
return (g, x - (b // a... | [
"identifier.replace.add",
"literal.replace.remove"
] | 453,949 | 453,950 | u884657429 | python |
p02702 | def inN():
return int(input())
def inL():
return list(map(int,input().split()))
def inNL(n):
return [list(map(int,input().split())) for i in range(n)]
s = input()
n = int(s)
l = len(s)
cnt = 0
mod = [0]*2019
m = 0
for i in range(l):
m = (int(s[l-1-i])*pow(10,i,2019) + m)%2019
mod[m] += 1
cnt += mo... | def inN():
return int(input())
def inL():
return list(map(int,input().split()))
def inNL(n):
return [list(map(int,input().split())) for i in range(n)]
s = input()
n = int(s)
l = len(s)
cnt = 0
mod = [0]*2019
m = 0
for i in range(l):
m = (int(s[l-1-i])*pow(10,i,2019) + m)%2019
mod[m] += 1
cnt += mo... | [
"call.arguments.change"
] | 453,955 | 453,956 | u802781234 | python |
p02702 | import sys
S = input()[::-1]
c = [0] * 2019
c[0] = 1
num = 0
d = 1
for a in S:
num += int(a) * d
num %= 2019
d *= 10
d %= 2019
c[num] += 1
a = 0
for i in c:
a += i * (i - 1) // 2
| import sys
S = input()[::-1]
c = [0] * 2019
c[0] = 1
num = 0
d = 1
for a in S:
num += int(a) * d
num %= 2019
d *= 10
d %= 2019
c[num] += 1
a = 0
for i in c:
a += i * (i - 1) // 2
print(a)
| [
"call.add"
] | 453,969 | 453,970 | u380854465 | python |
p02702 | # s = list(input())
s = list(str(10**200000))
n = len(s)
ans = 0
s.reverse()
# print(s)
x = 1
tot = 0
count = [0]*2019
for i in range(n):
count[tot]+=1
tot += int(s[i])*x
# print(tot)
tot %= 2019
ans += count[tot]
x = x*10%2019
print(ans) | s = list(input())
# s = list(str(10**200000))
n = len(s)
ans = 0
s.reverse()
# print(s)
x = 1
tot = 0
count = [0]*2019
for i in range(n):
count[tot]+=1
tot += int(s[i])*x
# print(tot)
tot %= 2019
ans += count[tot]
x = x*10%2019
print(ans) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 453,971 | 453,972 | u802234211 | python |
p02702 | from collections import Counter
S = input()[::-1]
MOD = 2019
X = [0]
for i, s in enumerate(S):
X.append((X[-1] + int(s) * pow(10, i, MOD)) %MOD)
print(X)
C = Counter(X)
ans = 0
for v in C.values():
ans += v * (v-1) // 2
print(ans) | from collections import Counter
S = input()[::-1]
MOD = 2019
X = [0]
for i, s in enumerate(S):
X.append((X[-1] + int(s) * pow(10, i, MOD)) % MOD)
C = Counter(X)
ans = 0
for v in C.values():
ans += v * (v - 1) // 2
print(ans) | [
"call.remove"
] | 453,987 | 453,988 | u861886710 | python |
p02702 | s=input()
l=len(s)
se=dict()
k=0
for i in range(l-1,-1,-1):
k+=(pow(10,l-1-i,2019)*int(s[i]))
k%=2019
if k in se:
se[k]+=1
else:
se[k]=1
ans=0
for j in se:
if se[j]>1:
ans+=(i*(i-1)//2)
if j==0:
ans+=i
print(ans) | s=input()
l=len(s)
se=dict()
k=0
for i in range(l-1,-1,-1):
k+=(pow(10,l-1-i,2019)*int(s[i]))
k%=2019
if k in se:
se[k]+=1
else:
se[k]=1
ans=0
for j in se:
i=se[j]
if i>1:
ans+=(i*(i-1)//2)
if j==0:
ans+=i
print(ans) | [
"assignment.variable.change",
"control_flow.branch.if.add"
] | 453,993 | 453,994 | u163783894 | python |
p02702 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def solve(S):
dp = [0] * 2019
pow10 = 1
answer = 0
for x in S[::-1]:
dp[0] += 1
x = x * pow10 % 2019
newdp = [0] * 2019
for i in range(x, 2019):
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def solve(S):
dp = [0] * 2019
pow10 = 1
answer = 0
for x in S[::-1]:
dp[0] += 1
x = x * pow10 % 2019
newdp = [0] * 2019
for i in range(2019-x):
... | [
"call.arguments.change"
] | 454,007 | 454,008 | u102461423 | python |
p02702 | from collections import Counter
S = str(input())
memo = [0]
d = 0
mod = 2019
for s in S[::-1]:
tmp = int(s) * pow(10, d, mod) % mod
tmp = memo[-1] + tmp
memo.appemd(tmp%mod)
d += 1
c = Counter(memo)
ans = sum(v * (v-1)/2 for v in c.values())
print(ans)
| from collections import Counter
S = str(input())
memo = [0]
d = 0
mod = 2019
for s in S[::-1]:
tmp = int(s) * pow(10, d, mod) % mod
tmp = memo[-1] + tmp
memo.append(tmp%mod)
d += 1
c = Counter(memo)
ans = sum(v * (v-1)/2 for v in c.values())
print(int(ans))
| [
"identifier.change",
"call.add",
"call.arguments.change"
] | 454,011 | 454,012 | u110199424 | python |
p02702 | #dpでできないかな？
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappus... | #dpでできないかな？
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappus... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 454,017 | 454,018 | u029000441 | python |
p02702 | S = input()
cnt = [0]*2019
cnt[0] = 1
n = 0
t = 1
for i in reversed(S):
n += i*t
n %= 2019
cnt[n] += 1
t *= 10
t %= 2019
print(sum(i*(i-1)//2 for i in cnt)) | S = input()
cnt = [0]*2019
cnt[0] = 1
n = 0
t = 1
for i in reversed(S):
n += int(i)*t
n %= 2019
cnt[n] += 1
t *= 10
t %= 2019
print(sum(i*(i-1)//2 for i in cnt)) | [
"call.add",
"call.arguments.change"
] | 454,058 | 454,059 | u514118270 | python |
p02702 | s=list(map(int,list(input())))
#print(s)
#modで考える
# 2019100を
# 2019100%2019 と100%1019
#同じmodの組み合わせ
#右から見ていく
mod=[0]*2019
tmp=0
ten=1
#hoge=""
for ii in range(len(s)):
i=len(s)-ii-1
if ii==0:
ten=1
else:
ten=(ten*10)%2019
tmp=((tmp+s[i]*ten)%2019)
#hoge=str(s[i])+hoge
#print... | s=list(map(int,list(input())))
#print(s)
#modで考える
# 2019100を
# 2019100%2019 と100%1019
#同じmodの組み合わせ
#右から見ていく
mod=[0]*2019
tmp=0
ten=1
#hoge=""
for ii in range(len(s)):
i=len(s)-ii-1
if ii==0:
ten=1
else:
ten=(ten*10)%2019
tmp=((tmp+s[i]*ten)%2019)
#hoge=str(s[i])+hoge
#print... | [
"call.arguments.change"
] | 454,105 | 454,106 | u588794534 | python |
p02702 | s=input()
"""
◆エッセンス1：割り切れるとは、二つに分けた数字のmodが一緒
例)
1817181712114の
18171が2019で割り切れるかどうかを判断する。
18171は(181712114-2114)/10000となるので、
181712114mod2019＝2114mod2019の時、2019で割り切れる。
1817181712114mod2019
817181712114mod2019
17181712114mod2019
7181712114mod2019
181712114mod2019
81712114mod2019
1712114mod2019... | s=input()
"""
◆エッセンス1：割り切れるとは、二つに分けた数字のmodが一緒
例)
1817181712114の
18171が2019で割り切れるかどうかを判断する。
18171は(181712114-2114)/10000となるので、
181712114mod2019＝2114mod2019の時、2019で割り切れる。
1817181712114mod2019
817181712114mod2019
17181712114mod2019
7181712114mod2019
181712114mod2019
81712114mod2019
1712114mod2019... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 454,107 | 454,108 | u588794534 | python |
p02702 | from collections import Counter
S = input()
S = S + '0'
mod = 2019
p = [-1] * len(S)
r = 0
d = 1
for i,s in enumerate(S[::-1]):
t = int(s)%mod
r += t*d
r %= mod
d = d*10%mod
p[i] = r
ans = 0
c = Counter(p)
for k,n in c.most_common():
if n > 1:
ans += n//2
else:break
print(ans) | from collections import Counter
S = input()
S = S + '0'
mod = 2019
p = [-1] * len(S)
r = 0
d = 1
for i,s in enumerate(S[::-1]):
t = int(s)%mod
r += t*d
r %= mod
d = d*10%mod
p[i] = r
ans = 0
c = Counter(p)
for k,n in c.most_common():
if n > 1:
ans += n*(n-1)//2
else:break
print(ans) | [
"expression.operation.binary.add"
] | 454,148 | 454,149 | u971124021 | python |
p02702 | S = input()[::-1]
cur = 0
mods = Counter()
mods[0] += 1
MOD = 2019
for i,d in enumerate(S):
cur += int(d) * pow(10, i, MOD)
mods[cur%MOD] += 1
res = 0
for k,v in mods.items():
res += (v * (v-1) // 2)
print(res) | from collections import Counter
S = input()[::-1]
cur = 0
mods = Counter()
mods[0] += 1
MOD = 2019
for i,d in enumerate(S):
cur += int(d) * pow(10, i, MOD)
mods[cur%MOD] += 1
res = 0
for k,v in mods.items():
res += (v * (v-1) // 2)
print(res) | [] | 454,162 | 454,163 | u723711163 | python |
p02702 | import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue
# import numpy as np
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
n... | import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue
# import numpy as np
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
n... | [
"literal.number.integer.change"
] | 454,224 | 454,225 | u888337853 | python |
p02702 | S = input()
r = 1
arr = [0]
for c in S[::-1]:
arr.append((arr[-1] + int(c) * r) % 2019)
r *= 10
r %= 2019
from collections import Counter
ctr = Counter(arr)
ans = 0
for v in ctr.values():
ans += v*v(v-1)//2
print(ans) | S = input()
r = 1
arr = [0]
for c in S[::-1]:
arr.append((arr[-1] + int(c) * r) % 2019)
r *= 10
r %= 2019
from collections import Counter
ctr = Counter(arr)
ans = 0
for v in ctr.values():
ans += v*(v-1)//2
print(ans) | [] | 454,228 | 454,229 | u449863068 | python |
p02702 | s = input()
s = list(reversed(s))
n = len(s)
dp1 = [0]*n
dp2 = [0]*n
counting = [0]*2019
counitng[0] += 1
dp1[0] = 1
dp2[0] = int(s[0])
counting[dp2[0]] += 1
if n >= 2:
for i in range(1,n):
dp1[i] = (10*dp1[i-1]) % 2019
dp2[i] = (int(s[i])*dp1[i]+dp2[i-1]) % 2019
counting[dp2[i]] += 1
#print... | s = input()
s = list(reversed(s))
n = len(s)
dp1 = [0]*n
dp2 = [0]*n
counting = [0]*2019
counting[0] += 1
dp1[0] = 1
dp2[0] = int(s[0])
counting[dp2[0]] += 1
if n >= 2:
for i in range(1,n):
dp1[i] = (10*dp1[i-1]) % 2019
dp2[i] = (int(s[i])*dp1[i]+dp2[i-1]) % 2019
counting[dp2[i]] += 1
#print... | [
"identifier.change"
] | 454,237 | 454,238 | u449822557 | python |
p02702 | def cal(S):
N = len(S)
num,cnt = 0,0
mod = 2019
rem = [0 for _ in range(mod)]
for i in range(N):
num = (num + int(S[N-1-i]) * pow(10,i,mod)) % mod
rem[num] += 1
output = (rem[0] * rem[0] + 1) // 2
for i in range(1,mod):
output += rem[i] * (rem[i]-1) // 2
return ... | def cal(S):
N = len(S)
num,cnt = 0,0
mod = 2019
rem = [0 for _ in range(mod)]
for i in range(N):
num = (num + int(S[N-1-i]) * pow(10,i,mod)) % mod
rem[num] += 1
output = rem[0] * (rem[0] + 1) // 2
for i in range(1,mod):
output += rem[i] * (rem[i]-1) // 2
return ... | [] | 454,248 | 454,249 | u571867512 | python |
p02702 | import math
#import numpy as np
import queue
from collections import deque,defaultdict
import heapq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
def main():
s = list(map(int,ipt()))[::-1]
d ... | import math
#import numpy as np
import queue
from collections import deque,defaultdict
import heapq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
def main():
s = list(map(int,input()))[::-1]
... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 454,257 | 454,258 | u169350228 | python |
p02702 | from collections import Counter
s = input()
ans = 0
mods = [0]
s = [int(a) for a in s[::-1]]
x = 0
for i in range(len(s)):
x += s[i] * pow(10, i, 2019)
mods.append(x%2019)
mods = Counter(mods)
for k in mods.keys():
counts = mods[k]
ans += counts // 2
print(ans) | from collections import Counter
s = input()
ans = 0
mods = [0]
s = [int(a) for a in s[::-1]]
x = 0
for i in range(len(s)):
x += s[i] * pow(10, i, 2019)
mods.append(x%2019)
mods = Counter(mods)
for k in mods.keys():
counts = mods[k]
ans += counts * (counts-1) // 2
print(ans) | [
"expression.operation.binary.add"
] | 454,303 | 454,304 | u511501183 | python |
p02702 | import math
def comb_count(n, r):
return math.factorial(n) // math.factorial(r) * math.factorial(n - r)
S = input()[::-1]
ans = 0
mods = [0] * 2019 #余りが0~2018
mods[0] = 1
current = 0
tmp = 1
for i in range(len(S)):
current = int(S[i]) * tmp + current
mod = current % 2019
mods[mod] += 1
tmp = tmp... | import math
def comb_count(n, r):
return math.factorial(n) // math.factorial(r) // math.factorial(n - r)
S = input()[::-1]
ans = 0
mods = [0] * 2019 #余りが0~2018
mods[0] = 1
current = 0
tmp = 1
for i in range(len(S)):
current = int(S[i]) * tmp + current
mod = current % 2019
mods[mod] += 1
tmp = tm... | [
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 454,312 | 454,311 | u982591663 | python |
p02702 | import math
def comb_count(n, r):
return math.factorial(n) // math.factorial(r) * math.factorial(n - r)
S = input()[::-1]
ans = 0
mods = [0] * 2019 #余りが0~2018
mods[0] = 1
current = 0
tmp = 1
for i in range(len(S)):
current = int(S[i]) * tmp + current % 2019
mod = current % 2019
mods[mod] += 1
tm... | import math
def comb_count(n, r):
return math.factorial(n) // math.factorial(r) // math.factorial(n - r)
S = input()[::-1]
ans = 0
mods = [0] * 2019 #余りが0~2018
mods[0] = 1
current = 0
tmp = 1
for i in range(len(S)):
current = int(S[i]) * tmp + current
mod = current % 2019
mods[mod] += 1
tmp = tm... | [
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 454,313 | 454,311 | u982591663 | python |
p02702 | import math
def comb_count(n, r):
return math.factorial(n) // math.factorial(r) * math.factorial(n - r)
S = input()[::-1]
ans = 0
mods = [0] * 2019 #余りが0~2018
mods[0] = 1
current = 0
tmp = 1
for i in range(len(S)):
current = int(S[i]) * tmp + current % 2019
mod = current % 2019
mods[mod] += 1
tm... | import math
def comb_count(n, r):
return math.factorial(n) // math.factorial(r) // math.factorial(n - r)
S = input()[::-1]
ans = 0
mods = [0] * 2019 #余りが0~2018
mods[0] = 1
current = 0
tmp = 1
for i in range(len(S)):
current = int(S[i]) * tmp + current
mod = current % 2019
mods[mod] += 1
tmp = tm... | [
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 454,314 | 454,311 | u982591663 | python |
p02702 | import math
def comb_count(n, r):
return math.factorial(n) // math.factorial(r) * math.factorial(n - r)
S = input()[::-1]
ans = 0
mods = [0] * 2019 #余りが0~2018
mods[0] = 1
current = 0
tmp = 1
for i in range(len(S)):
current = int(S[i]) * tmp + current
mod = current % 2019
mods[mod] += 1
tmp = tmp... | import math
def comb_count(n, r):
return math.factorial(n) // math.factorial(r) // math.factorial(n - r)
S = input()[::-1]
ans = 0
mods = [0] * 2019 #余りが0~2018
mods[0] = 1
current = 0
tmp = 1
for i in range(len(S)):
current = (int(S[i]) * tmp + current)
mod = current % 2019
# ans += mods[mod]
mo... | [
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 454,312 | 454,315 | u982591663 | python |
p02702 | import math
def comb_count(n, r):
return math.factorial(n) // math.factorial(r) * math.factorial(n - r)
S = input()[::-1]
ans = 0
mods = [0] * 2019 #余りが0~2018
mods[0] = 1
current = 0
tmp = 1
for i in range(len(S)):
current = int(S[i]) * tmp + current % 2019
mod = current % 2019
mods[mod] += 1
tm... | import math
def comb_count(n, r):
return math.factorial(n) // math.factorial(r) // math.factorial(n - r)
S = input()[::-1]
ans = 0
mods = [0] * 2019 #余りが0~2018
mods[0] = 1
current = 0
tmp = 1
for i in range(len(S)):
current = (int(S[i]) * tmp + current)
mod = current % 2019
# ans += mods[mod]
mo... | [
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 454,313 | 454,315 | u982591663 | python |
p02702 | import math
def comb_count(n, r):
return math.factorial(n) // math.factorial(r) * math.factorial(n - r)
S = input()[::-1]
ans = 0
mods = [0] * 2019 #余りが0~2018
mods[0] = 1
current = 0
tmp = 1
for i in range(len(S)):
current = int(S[i]) * tmp + current % 2019
mod = current % 2019
mods[mod] += 1
tm... | import math
def comb_count(n, r):
return math.factorial(n) // math.factorial(r) // math.factorial(n - r)
S = input()[::-1]
ans = 0
mods = [0] * 2019 #余りが0~2018
mods[0] = 1
current = 0
tmp = 1
for i in range(len(S)):
current = (int(S[i]) * tmp + current) % 2019
mod = current % 2019
# ans += mods[mod]... | [
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 454,313 | 454,316 | u982591663 | python |
p02702 | import math
def comb_count(n, r):
return math.factorial(n) // math.factorial(r) * math.factorial(n - r)
S = input()[::-1]
ans = 0
mods = [0] * 2019 #余りが0~2018
mods[0] = 1
current = 0
tmp = 1
for i in range(len(S)):
current = int(S[i]) * tmp + current % 2019
mod = current % 2019
mods[mod] += 1
tm... | import math
def comb_count(n, r):
return math.factorial(n) // math.factorial(r) // math.factorial(n - r)
S = input()[::-1]
ans = 0
mods = [0] * 2019 #余りが0~2018
mods[0] = 1
current = 0
tmp = 1
for i in range(len(S)):
current = (int(S[i]) * tmp + current) % 2019
mod = current % 2019
# ans += mods[mod]... | [
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 454,314 | 454,316 | u982591663 | python |
p02702 | p=d=2019
z=[0]*p
for i,j in enumerate(input()[::-1]):
d=d+int(j)*pow(10,i,p)
z[d%p]+=1
r=z[0]
for i in a:
r+=i*(i-1)//2
print(r) | p=d=2019
z=[0]*p
for i,j in enumerate(input()[::-1]):
d+=int(j)*pow(10,i,p)
z[d%p]+=1
r=z[0]
for i in z:
r+=i*(i-1)//2
print(r) | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change",
"identifier.change"
] | 454,319 | 454,320 | u509739538 | python |
p02702 | p=d=2019
z=[0]*p
for i,j in enumerate(input()[::-1]):
d=d+int(j)*pow(10,i,p)
z[d%p]+=1
r=z[0]
for i in a:
r+=i*(i-1)//2
print(r) | p=d=2019
z=[0]*p
for i,j in enumerate(input()[::-1]):
d=d+int(j)*pow(10,i,p)
z[d%p]+=1
r=z[0]
for i in z:
r+=i*(i-1)//2
print(r) | [
"identifier.change"
] | 454,319 | 454,321 | u509739538 | python |
p02702 | s = input()[::-1]
mod = 2019
cnt = [0] * mod
x = 1
cnt[0] = 1
total = 0
for s in s:
total = int(s) * x
total %= mod
cnt[total] += 1
x *= 10
ans = sum(i*(i-1)//2 for i in cnt)
print(ans)
| s = input()[::-1]
mod = 2019
cnt = [0] * mod
x = 1
cnt[0] = 1
total = 0
for s in s:
total += int(s) * x
total %= mod
cnt[total] += 1
x *= 10
x %= mod
ans = sum(i*(i-1)//2 for i in cnt)
print(ans)
| [
"assignment.value.change"
] | 454,363 | 454,362 | u646412443 | python |
p02702 | import sys,bisect,math
sys.setrecursionlimit(15000)
s = sys.stdin.readline().rstrip()
cum = [0]*(len(s)+1)#cumulative sum
import collections
d = collections.defaultdict(int)
d[0] = 1
ret = 0
dig = 1
for i in range(len(s))[::-1]:
cum[i]=(int(s[i])*dig+cum[i+1])%2019
dig == (dig*10)%2019
#cum[i+1]=int(s[i:])... | # n = int(sys.stdin.readline())
import sys,bisect,math
sys.setrecursionlimit(15000)
s = sys.stdin.readline().rstrip()
cum = [0]*(len(s)+1)#cumulative sum
import collections
d = collections.defaultdict(int)
d[0] = 1
ret = 0
dig = 1
for i in range(len(s))[::-1]:
cum[i]=(int(s[i])*dig+cum[i+1])%2019
dig = (dig*10... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 454,368 | 454,369 | u829796346 | python |
p02702 | s=input()
s= s[::-1]
S=[0,]
cnt=[0]*2019
cnt[0]=1
d=1
num=0
for i in range(len(s)):
num += int(s[i])*d
num %= 2019
d *= 10
d%= 2019
# S.append((int(S[i]) + int(s[i]) * 10**i) % 2019)
cnt[num]+=1
ans=0
for i in cnt:
ans += i*(i-1) //2 | s=input()
s= s[::-1]
S=[0,]
cnt=[0]*2019
cnt[0]=1
d=1
num=0
for i in range(len(s)):
num += int(s[i])*d
num %= 2019
d *= 10
d%= 2019
# S.append((int(S[i]) + int(s[i]) * 10**i) % 2019)
cnt[num]+=1
ans=0
for i in cnt:
ans += i*(i-1) //2
print(ans) | [
"call.add"
] | 454,370 | 454,371 | u521866787 | python |
p02702 | S = input()
X = [0]*2019
X[0] = 1
d = 1
a = 0
for s in reversed(S):
a = ((ord(s) - ord('0'))*d + a)%2019
d = d*10%2019
print(a)
X[a] += 1
ans = sum(x*(x-1)//2 for x in X)
print(ans)
| S = input()
X = [0]*2019
X[0] = 1
d = 1
a = 0
for s in reversed(S):
a = ((ord(s) - ord('0'))*d + a)%2019
d = d*10%2019
X[a] += 1
ans = sum(x*(x-1)//2 for x in X)
print(ans)
| [
"call.remove"
] | 454,372 | 454,373 | u729417323 | python |
p02702 | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq imp... | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq imp... | [
"expression.operation.binary.add"
] | 454,422 | 454,423 | u952022797 | python |
p02702 | import collections
mod = 2019
def main():
S = list(input())
lenS = len(S)
Smod2019 = [0] * lenS
tmp = 0
for i in range(lenS):
tmp += (pow(10, i, mod)*int(S[-(i+1)]))%mod
Smod2019[i] = tmp%mod
cnt = collections.Counter(Smod2019)
cntitems = cnt.items()
ans = 0
#p... | import collections
mod = 2019
def main():
S = list(input())
lenS = len(S)
Smod2019 = [0] * lenS
tmp = 0
for i in range(lenS):
tmp += (pow(10, i, mod)*int(S[-(i+1)]))%mod
Smod2019[i] = tmp%mod
cnt = collections.Counter(Smod2019)
cntitems = cnt.items()
ans = 0
#p... | [] | 454,443 | 454,444 | u125545880 | python |
p02702 | '''
[point 1]
1817181712114 の部分 "18171"について考える...
181710000 / 10000 ≡ 0 (MOD 2019) ならば、2019の倍数
181710000 ≡ 0 (MOD 2019) でよい
[point 2]
181710000
=
181712114
-
2114
なので、特定区間の値 は 累積和の差 から瞬時に求められる。
さらに、181710000 ≡ 0 (MOD 2019) を考えると、
0 ≡ 181712114 - 2114
→ 181712114 ≡ 21... | '''
[point 1]
1817181712114 の部分 "18171"について考える...
181710000 / 10000 ≡ 0 (MOD 2019) ならば、2019の倍数
181710000 ≡ 0 (MOD 2019) でよい
[point 2]
181710000
=
181712114
-
2114
なので、特定区間の値 は 累積和の差 から瞬時に求められる。
さらに、181710000 ≡ 0 (MOD 2019) を考えると、
0 ≡ 181712114 - 2114
→ 181712114 ≡ 21... | [
"call.remove"
] | 454,445 | 454,446 | u402629484 | python |
p02702 | def main():
s = input()[::-1]
l = len(s)
n = 2019
dp = [0]*n
wk = 0
r = 1
for i in range(l):
wk += int(s[i])*r
wk %= n
dp[wk] += 1
r*= 10
r %= n
print(sum([i*(i-1)//2 for i in dp]))
main() | def main():
s = input()[::-1]
l = len(s)
n = 2019
dp = [0]*n
wk = 0
r = 1
for i in range(l):
wk += int(s[i])*r
wk %= n
dp[wk] += 1
r*= 10
r %= n
print(dp[0]+sum([i*(i-1)//2 for i in dp]))
main() | [
"expression.operation.binary.add"
] | 454,447 | 454,448 | u857759499 | python |
p02702 | s=str(input())
n=len(s)
ans=0
l=[0 for i in range(2019)]
now=l[int(s[n-1])]
r=1
for i in range(1,n+1):
now=(now+int(s[-i])*r)%2019
l[now]+=1
r=r*10
r=r%2019
ans+=l[0]
l[0]=0
for i in l:
ans+=int(i*(i-1)//2)
print(ans)
#print(l) | s=str(input())
n=len(s)
ans=0
l=[0 for i in range(2019)]
now=l[int(s[n-1])]
r=1
for i in range(1,n+1):
now=(now+int(s[-i])*r)%2019
l[now]+=1
r=r*10
r=r%2019
ans+=l[0]
for i in l:
ans+=int(i*(i-1)//2)
print(ans)
#print(l) | [
"assignment.remove"
] | 454,449 | 454,450 | u864273141 | python |
p02702 | s=input()
n=len(s)
l=[0]*2019
l[0]=1
k=0
mod=2019
r=1
for i in range(n-1,-1,-1):
k+=int(s[i])*r
r*=10
r%=mod
l[k]+=1
ans=0
for i in l:
ans+=i*(i-1)//2
print(ans)
| s=input()
n=len(s)
l=[0]*2019
l[0]=1
k=0
mod=2019
r=1
for i in range(n-1,-1,-1):
k+=int(s[i])*r
k%=mod
r*=10
r%=mod
l[k]+=1
ans=0
for i in l:
ans+=i*(i-1)//2
print(ans)
| [] | 454,455 | 454,456 | u482743994 | python |
p02702 | import collections
s = input()
n = len(s)
mod_list = [0]
T = 0
for i in range(n):
T += int(s[-1-i])*pow(10, i, 2019)%2019
T = T%2019
mod_list.append(T)
res = collections.Counter(mod_list)
cnt = 0
for d in res.values:
cnt += int(d*(d-1)/2)
print(cnt) | import collections
s = input()
n = len(s)
mod_list = [0]
T = 0
for i in range(n):
T += int(s[-1-i])*pow(10, i, 2019)%2019
T = T%2019
mod_list.append(T)
res = collections.Counter(mod_list)
cnt = 0
for d in res.values():
cnt += int(d*(d-1)/2)
print(cnt) | [
"call.add"
] | 454,484 | 454,485 | u789199177 | python |
p02702 | S=input()
T=len(S)
a=0
d=1
mod=[0]*2019
mod[0]+=1
for i in range(T):
a+=(int(S[T-i-1])*(d))%2019
b=a%2019
mod[b]+=1
d*=10
d%=2019
c=0
for i in range(2019):
if mod[i]>=2:
c+= mod[b]*(mod[b]-1)/2
print(int(c))
| S=input()
T=len(S)
a=0
d=1
mod=[0]*2019
mod[0]+=1
for i in range(T):
a+=(int(S[T-i-1])*(d))%2019
b=a%2019
mod[b]+=1
d*=10
d%=2019
c=0
for i in range(2019):
if mod[i]>=2:
c+= mod[i]*(mod[i]-1)/2
print(int(c)) | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 454,486 | 454,487 | u387774811 | python |
p02702 | S = input()
N = len(S)
map_ = [-1] * 2019
map_[0] = 0
ans = 0
now = 0
for i in range(0, N + 1):
now = (now + int(S[N - i - 1]) * pow(10, i, 2019)) % 2019
map_[now] += 1
ans += map_[now]
print(ans) | S = input()
N = len(S)
map_ = [-1] * 2019
map_[0] = 0
ans = 0
now = 0
for i in range(0, N):
now = (now + int(S[N - i - 1]) * pow(10, i, 2019)) % 2019
map_[now] += 1
ans += map_[now]
print(ans)
| [
"expression.operation.binary.remove"
] | 454,502 | 454,503 | u910426639 | python |
p02701 | N = int(input())
S = []
for i in range(N):
S.append(input())
s = sorted(S)
count = 1
for i in range(2,N):
if s[i] != s[i-1]:
count += 1
print(count) | N = int(input())
S = []
for i in range(N):
S.append(input())
s = sorted(S)
count = 1
for i in range(1,N):
if s[i] != s[i-1]:
count += 1
print(count) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 454,521 | 454,522 | u183976155 | python |
p02701 | N = int(input())
S = ["" for _ in range(N)]
num = 1
for i in range(N):
S[i] = input()
List = sorted(S)
for j in range(N-1):
if S[j] != S[j+1]:
num += 1
print(num) | N = int(input())
S = ["" for _ in range(N)]
num = 1
for i in range(N):
S[i] = input()
List = sorted(S)
for j in range(N-1):
if List[j] != List[j+1]:
num += 1
print(num) | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 454,525 | 454,526 | u870559097 | python |
p02701 | n = int(input())
s = [input() for i in range(3)]
ans_set = set(s)
print(len(ans_set)) | n = int(input())
s = [input() for i in range(n)]
ans_set = set(s)
print(len(ans_set)) | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 454,527 | 454,528 | u986884213 | python |
p02701 | a=int(input())
list1=[]
for i in range(a+1):
list1.append(input())
print(len(list(set(list1)))) | a=int(input())
list1=[]
for i in range(a):
list1.append(input())
print(len(list(set(list1)))) | [
"expression.operation.binary.remove"
] | 454,539 | 454,540 | u876295560 | python |
p02701 | a=int(input())
list1=[]
for i in range(a+1):
list1.append(input())
print(len(list(set(list1)))) | a=int(input())
list1=[]
for i in range(a):
list1.append(input())
print(len(list(set(list1)))) | [
"expression.operation.binary.remove"
] | 454,541 | 454,540 | u876295560 | python |
p02702 | def main():
S = input()
work, temp = [0] * 2019, 0
work[0] = 1
a = 1
for s in S:
temp += int(s) * a
work[temp%2019] += 1
a *= 10
a %= 2019
print(sum([w*(w-1)//2 for w in work]))
main() | def main():
S = input()
work, temp = [0] * 2019, 0
work[0] = 1
a = 1
for s in S[::-1]:
temp += int(s) * a
work[temp%2019] += 1
a *= 10
a %= 2019
print(sum([w*(w-1)//2 for w in work]))
main() | [] | 454,558 | 454,559 | u060736237 | python |
p02702 | s=list(input())
s=s[::-1]
l=len(s)
mod=2019
count=[0]*2019
count[0]=1
num=0
seki=1
for i in range(l):
num+=(int(s[i])*(seki))%mod
count[num]+=1
seki=(seki*10)%mod
ans=0
for i in range(2019):
N=count[i]
ans+=N*(N-1)//2
print(ans) | s=list(input())
s=s[::-1]
l=len(s)
mod=2019
count=[0]*2019
count[0]=1
num=0
seki=1
for i in range(l):
num+=int(s[i])*seki
num=num%mod
count[num]+=1
seki=(seki*10)%mod
ans=0
for i in range(2019):
N=count[i]
ans+=N*(N-1)//2
print(ans) | [] | 454,595 | 454,596 | u548303713 | python |
p02702 | s=input()[::-1]
ans=0
u=0
d=1
l=[0]*2019
l[0]=1
for i in map(int,s):
u=u+(i*d)%2019
l[u]+=1
d=d*10%2019
for i in l:
ans+=i*(i-1)//2
print(ans)
| s=input()[::-1]
ans=0
u=0
d=1
l=[0]*2019
l[0]=1
for i in map(int,s):
u=(u+(i*d)%2019)%2019
l[u]+=1
d=d*10%2019
for i in l:
ans+=i*(i-1)//2
print(ans)
| [
"assignment.change"
] | 454,607 | 454,608 | u384124931 | python |
p02702 | s=input()[::-1]
ans=0
u=0
d=1
l=[0]*2019
l[0]=1
for i in map(int,s):
u=(u+i*d%2019)
l[u]+=1
d=d*10%2019
for i in l:
ans+=i*(i-1)//2
print(ans)
| s=input()[::-1]
ans=0
u=0
d=1
l=[0]*2019
l[0]=1
for i in map(int,s):
u=(u+(i*d)%2019)%2019
l[u]+=1
d=d*10%2019
for i in l:
ans+=i*(i-1)//2
print(ans)
| [
"assignment.change"
] | 454,609 | 454,608 | u384124931 | python |
p02702 | S = input()
s = list(S)
for i in range(len(s)):
s[i] = int(s[i])
p = []
p.append(s[len(s)-1])
for i in range(1,len(s)):
p.append((p[i-1]+s[len(s)-i-1]*pow(10,i,2019))%2019)
p.sort()
u = 0
for i in range(len(p)):
if p[i] == 0:
u = u+1
else:
break
r = 1
q = []
for i in range(len(p)-1):
... | S = input()
s = list(S)
for i in range(len(s)):
s[i] = int(s[i])
p = []
p.append(s[len(s)-1])
for i in range(1,len(s)):
p.append((p[i-1]+s[len(s)-i-1]*pow(10,i,2019))%2019)
p.sort()
u = 0
for i in range(len(p)):
if p[i] == 0:
u = u+1
else:
break
r = 1
q = []
for i in range(len(p)-1):
... | [
"call.add"
] | 454,625 | 454,626 | u342563578 | python |
p02702 | # coding: utf-8
# Your code here!
def main():
from functools import reduce
import collections
S = list(map(int,input().rstrip()))
N=len(S)
mod_list = [0]
for i in range(1,N+1):
new1 =pow(10,i-1,2019)
new = (new1*S[-i]+mod_list[-1])%2019
print(new)
mod_list.a... | # coding: utf-8
# Your code here!
def main():
from functools import reduce
import collections
S = list(map(int,input().rstrip()))
N=len(S)
mod_list = [0]
for i in range(1,N+1):
new1 =pow(10,i-1,2019)
new = (new1*S[-i]+mod_list[-1])%2019
#print(new)
mod_list.... | [
"call.remove"
] | 454,627 | 454,628 | u385649291 | python |
p02702 | from operator import mul
from functools import reduce
import numpy as np
#def ConZ(i):
#z_num = i+int(i*(i-1)/2)
#return z_num
#def ConN(i):
#n_num = int(i*(i-1)/2)
#return n_num
def cmb(n):
over = reduce(mul, range(n, n - 2, -1))
under = reduce(mul, range(1,2 + 1))
return over // under
S... | from operator import mul
from functools import reduce
import numpy as np
#def ConZ(i):
#z_num = i+int(i*(i-1)/2)
#return z_num
#def ConN(i):
#n_num = int(i*(i-1)/2)
#return n_num
def cmb(n):
over = reduce(mul, range(n, n - 2, -1))
under = reduce(mul, range(1,2 + 1))
return over // under
S... | [
"call.remove"
] | 454,633 | 454,634 | u863964720 | python |
p02702 | input()
s=s[::-1]
n=len(s)
count=[0]*2019
count[0]=1
num,d=0,1
for i in s:
num+=int(i)*d
num%=2019
d*=10
d%=2019
count[num]+=1
ans=0
for i in count:
ans+=i*(i-1)//2
print(ans) | s=input()
s=s[::-1]
n=len(s)
count=[0]*2019
count[0]=1
num,d=0,1
for i in s:
num+=int(i)*d
num%=2019
d*=10
d%=2019
count[num]+=1
ans=0
for i in count:
ans+=i*(i-1)//2
print(ans) | [
"assignment.add"
] | 454,653 | 454,654 | u022843632 | python |
p02702 | nput()
s=s[::-1]
n=len(s)
count=[0]*2019
count[0]=1
num,d=0,1
for i in s:
num+=int(i)*d
num%=2019
d*=10
d%=2019
count[num]+=1
ans=0
for i in count:
ans+=i*(i-1)//2
print(ans) | s=input()
s=s[::-1]
n=len(s)
count=[0]*2019
count[0]=1
num,d=0,1
for i in s:
num+=int(i)*d
num%=2019
d*=10
d%=2019
count[num]+=1
ans=0
for i in count:
ans+=i*(i-1)//2
print(ans) | [
"assignment.variable.change"
] | 454,655 | 454,654 | u022843632 | python |
p02702 | S = input()
p = 2019
N = len(S)
t = [0]*(N+1)
for i in range(N-1,-1,-1):
k = (int(S[i]) * pow(10,N-i-1,p))%p
t[i] = (t[i+1]+k)%p
t= t[:N]
cnt = [0]*p
for i in range(N):
cnt[t[i]]+=1
ans = 0
for i in range(p):
m = cnt[i]
if i == 0 and m > 0:
ans += 1 + (m*(m-1))//2
else:
ans += (m*(m-1))//2
print(an... | S = input()
p = 2019
N = len(S)
t = [0]*(N+1)
for i in range(N-1,-1,-1):
k = (int(S[i]) * pow(10,N-i-1,p))%p
t[i] = (t[i+1]+k)%p
t= t[:N]
cnt = [0]*p
for i in range(N):
cnt[t[i]]+=1
ans = 0
for i in range(p):
m = cnt[i]
if i == 0 and m > 0:
ans += (m*(m+1))//2
else:
ans += (m*(m-1))//2
print(ans) | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 454,661 | 454,662 | u250828304 | python |
p02702 | s=input()
s=s[::-1]
n=len(s)
count=[0]*2019
num,d=0,1
for i in s:
num+=int(i)*d
num%=2019
d*=10
d%=2019
count[num]+=1
ans=0
for i in count:
ans+=i*(i-1)//2
print(ans)
| s=input()
s=s[::-1]
n=len(s)
count=[0]*2019
count[0]=1
num,d=0,1
for i in s:
num+=int(i)*d
num%=2019
d*=10
d%=2019
count[num]+=1
ans=0
for i in count:
ans+=i*(i-1)//2
print(ans)
| [
"assignment.add"
] | 454,672 | 454,673 | u884601206 | python |
p02702 | s=input()
res=0
t=1
p=[0]*2019
for i in map(int,s[::-1]):
res+=i*t
res%=2019
p[res]+=1
t*=10
t%=2019
print(p[0]+sum((i*(i-1)//2) for i in p[1:])) | s=input()
res=0
t=1
p=[0]*2019
for i in map(int,s[::-1]):
res+=i*t
res%=2019
p[res]+=1
t*=10
t%=2019
print(p[0]+sum((i*(i-1)//2) for i in p)) | [] | 454,678 | 454,679 | u568576853 | python |
p02702 | import sys
input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]
IN=lambda : map(int, input().split())
LIN=lambda : list(IN())
mod=1000000007
#+++++
def main2():
#a = int(input())
#b , c = IN()
s = input()
#s='1'*3000
s=[int(c) for c in s]
ll=len(s)
ret_count=0
fo... | import sys
input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]
IN=lambda : map(int, input().split())
LIN=lambda : list(IN())
mod=1000000007
#+++++
def main2():
#a = int(input())
#b , c = IN()
s = input()
#s='1'*3000
s=[int(c) for c in s]
ll=len(s)
ret_count=0
fo... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 454,684 | 454,685 | u505830998 | python |
p02702 | S = list(input())
N = len(S)
ans = 0
cnt = [0] * 2019
a=1
s=0
for i in range(N)[::-1]:
s = int(S[i])*a+s
a*=10
a = a%2019
cnt[s % 2019] += 1
s=s%2019
ans += cnt[0]
for i in range(1, 2019):
ans += cnt[i] * (cnt[i] - 1) // 2
print(ans)
| S = list(input())
N = len(S)
ans = 0
cnt = [0] * 2019
a = 1
s = 0
for i in range(N)[::-1]:
s = int(S[i]) * a + s
a *= 10
a = a % 2019
cnt[s % 2019] += 1
s = s % 2019
ans += cnt[0]
for i in range(2019):
ans += cnt[i] * (cnt[i] - 1) // 2
print(ans)
| [
"call.arguments.change"
] | 454,729 | 454,730 | u069172538 | python |
p02702 | from collections import Counter
S = input()
#S = "1"*20000
p = 2019
N = len(S)
m = [(int(S[i]) * pow(10, N-i, p)) % p for i in range(N)]
# m の mod 累積和
r = [0] * N
r[0] = m[0]
for ri in range(1, N):
r[ri] = (r[ri-1] + m[ri]) % p
# この r[i] が一致するような区間が答えになるのでこれをもとめる
c = Counter(r)
ans = 0
for ci in [cv for cv in... | from collections import Counter
S = input()
p = 2019
N = len(S)
# p は 10 と互いに素なのであんまり桁のずれは関係ないはずなので、とりあえず位は大きいのに合わせる
m = [(int(S[i]) * pow(10, N-i, p)) % p for i in range(N)]# m は各桁の mod
# m の mod 累積和をもとめる
r = [0] * N
r[0] = m[0]
for ri in range(1, N):
r[ri] = (r[ri-1] + m[ri]) % p
# この r[i] が一致するような区間が答えになるので... | [
"identifier.replace.add",
"literal.replace.remove"
] | 454,733 | 454,734 | u767664985 | python |
p02702 | from collections import Counter
S = input()
#S = "1"*20000
p = 2019
N = len(S)
m = [(int(S[i]) * pow(10, N-i, p)) % p for i in range(N)]
# m の mod 累積和
r = [0] * N
r[0] = m[0]
for ri in range(1, N):
r[ri] = (r[ri-1] + m[ri]) % p
# この r[i] が一致するような区間が答えになるのでこれをもとめる
c = Counter(r)
ans = 0
for ci in [cv for cv in... | from collections import Counter
S = input()
#S = "1"*20000
p = 2019 # 10 と互いに素なのであんまり桁のずれは関係ない？
N = len(S)
# m は各桁の累積和
m = [(int(S[i]) * pow(10, N-i, p)) % p for i in range(N)]
# m の mod 累積和
r = [0] * N
r[0] = m[0]
for ri in range(1, N):
r[ri] = (r[ri-1] + m[ri]) % p
# この r[i] が一致するような区間が答えになるのでこれをもとめる
c = Cou... | [
"identifier.replace.add",
"literal.replace.remove"
] | 454,733 | 454,735 | u767664985 | python |
p02702 | s = input()
MOD = 2019
r = [0]*MOD
r[0] = 1
z = 0
t = 0
for i in reversed(s):
z = int(i) * pow(10,t,m) + z
z %= MOD
r[z] += 1
t += 1
print(sum(i*(i-1)//2 for i in r))
| s = input()
MOD = 2019
r = [0]*MOD
r[0] = 1
z = 0
t = 0
for i in reversed(s):
z = int(i) * pow(10,t,MOD) + z
z %= MOD
r[z] += 1
t += 1
print(sum(i*(i-1)//2 for i in r))
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 454,778 | 454,779 | u788703383 | python |
p02702 | s = input()
n = len(s)
m = 2019
a = 0
r = [0 for _ in range(m+1)]
r[0] = 1
for i in range(0,n):
z = (int(s[n-i-1])*pow(10,i,m) + z)%m
a += r[z]
r[z] += 1
print(a)
| s = input()
n = len(s)
m = 2019
a = 0
r = [0 for _ in range(m+1)]
r[0] = 1
z = 0
for i in range(0,n):
z = (int(s[n-i-1])*pow(10,i,m) + z)%m
a += r[z]
r[z] += 1
print(a)
| [
"assignment.add"
] | 454,780 | 454,781 | u788703383 | python |
p02702 | """
import random
import functools
import copy
import bisect
import array
import re
import collections
import heapq
import itertools
import string
import math
from operator import itemgetter as ig
from bisect import bisect_left, bisect_right, insort_left, insort_right
from itertools import permutations, combinations, p... | """
import random
import functools
import copy
import bisect
import array
import re
import collections
import heapq
import fractions
import itertools
import string
import math
from operator import itemgetter as ig
from bisect import bisect_left, bisect_right, insort_left, insort_right
from itertools import permutations... | [] | 454,797 | 454,798 | u840579553 | python |
p02702 | """
import random
import functools
import copy
import bisect
import array
import re
import collections
import heapq
import fractions
import itertools
import string
import math
from operator import itemgetter as ig
from bisect import bisect_left, bisect_right, insort_left, insort_right
from itertools import permutations... | """
import random
import functools
import copy
import bisect
import array
import re
import collections
import heapq
import fractions
import itertools
import string
import math
from operator import itemgetter as ig
from bisect import bisect_left, bisect_right, insort_left, insort_right
from itertools import permutations... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 454,799 | 454,798 | u840579553 | python |
p02702 | from collections import Counter
S = input()
N = len(S)
dp = [0] * N
dp[N-1] = int(S[N-1])
times = 10
for i in reversed(range(N-1)):
dp[i-1] = (dp[i] + times * int(S[i-1])) % 2019
times *= 10
times %= 2019
T = Counter(dp)
ans = T[0]
for t in T.values():
ans += t*(t-1)//2
print(ans) | from collections import Counter
S = input()
N = len(S)
dp = [0] * N
dp[N-1] = int(S[N-1])
times = 10
for i in reversed(range(1, N)):
dp[i-1] = (dp[i] + times * int(S[i-1])) % 2019
times *= 10
times %= 2019
T = Counter(dp)
ans = T[0]
for t in T.values():
ans += t*(t-1)//2
print(ans) | [
"expression.operation.binary.remove",
"call.arguments.add"
] | 454,800 | 454,801 | u855710796 | python |
p02702 | from collections import defaultdict
S = list(input())[::-1]
n = len(S)
d = defaultdict(int)
d[0] += 1
res = 0
for i, s in enumerate(S):
res += int(s)*pow(10, i, 6)
res %= 6
d[res] += 1
ans = 0
for v in d.values():
ans += v*(v-1)//2
print(ans) | from collections import defaultdict
S = list(input())[::-1]
n = len(S)
d = defaultdict(int)
d[0] += 1
res = 0
for i, s in enumerate(S):
res += int(s)*pow(10, i, 2019)
res %= 2019
d[res] += 1
ans = 0
for v in d.values():
ans += v*(v-1)//2
print(ans) | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 454,807 | 454,808 | u175034939 | python |
p02702 | s = input()
n = 0
ans = 0
mods = [0]*p
mods[0] = 1
for i, j in enumerate(reversed(s)):
n += int(j)*pow(10, i, 2019)
n %= 2019
mods[n] += 1
for i in mods:
ans += i*(i-1)//2
print(ans) | s = input()
n = 0
ans = 0
mods = [0]*2019
mods[0] = 1
for i, j in enumerate(reversed(s)):
n += int(j)*pow(10, i, 2019)
n %= 2019
mods[n] += 1
for i in mods:
ans += i*(i-1)//2
print(ans) | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 454,830 | 454,831 | u764215612 | python |
p02702 | s=input()
n=0
ans=0
A=[0]*2019
A[0]=1
for i,j in enumerate(reversed(s)):
n=(n+int(j)*pow(10,i,2019))%2019
print(i,n)
A[n]+=1
for i in A:
ans+=i*(i-1)//2
print(ans) | s=input()
n=0
ans=0
A=[0]*2019
A[0]=1
for i,j in enumerate(reversed(s)):
n=(n+int(j)*pow(10,i,2019))%2019
#print(i,n)
A[n]+=1
for i in A:
ans+=i*(i-1)//2
print(ans) | [
"call.remove"
] | 454,841 | 454,842 | u572142121 | python |
p02702 | from math import pow
n = input()
MOD = 2019
ans = 0
dp = [0]*MOD
dp[0] = 1
temp = 0
for i in range(len(n)):
temp = (temp+int(n[-i-1])*int(pow(10, i))) % MOD
dp[temp] += 1
for item in dp:
if item > 1:
ans += item*(item-1)//2
print(ans)
| n = input()
MOD = 2019
ans = 0
dp = [0]*MOD
dp[0] = 1
temp = 0
for i in range(len(n)):
temp = (temp+int(n[-i-1])*int(pow(10, i, MOD))) % MOD
dp[temp] += 1
for item in dp:
if item > 1:
ans += item*(item-1)//2
print(ans)
| [
"call.arguments.add"
] | 454,860 | 454,861 | u135346354 | python |
p02702 | def solve():
s = input()
n = len(s)
mod = 2019
reminder = [0]*mod
pre_rem = 0
for i in range(n):
pre_rem = (int(s[n-i-1])*pow(10, i, mod) + pre_rem) % mod
reminder[pre_rem] += 1
ans = reminder[0]
for rem_num in reminder[1:]:
if rem_num >= 2:
ans += ... | def solve():
s = input()
n = len(s)
mod = 2019
reminder = [0]*mod
pre_rem = 0
for i in range(n):
pre_rem = (int(s[n-i-1])*pow(10, i, mod) + pre_rem) % mod
reminder[pre_rem] += 1
ans = reminder[0]
for rem_num in reminder:
if rem_num >= 2:
ans += (rem... | [] | 454,862 | 454,863 | u914948583 | python |
p02702 | def solve():
s = input()
n = len(s)
mod = 2019
reminder = [0]*mod
pre_rem = 0
for i in range(n):
pre_rem = (int(s[n-i-1])*pow(10, i, mod) + pre_rem) % mod
reminder[pre_rem] += 1
ans = reminder[0]
for rem_num in reminder[1:]:
if rem_num >= 2:
ans += ... | def solve():
s = input()
n = len(s)
mod = 2019
reminder = [0]*mod
pre_rem = 0
for i in range(n):
pre_rem = (int(s[n-i-1])*pow(10, i, mod) + pre_rem) % mod
reminder[pre_rem] += 1
ans = reminder[0]
for rem_num in reminder:
if rem_num >= 2:
ans += (rem... | [] | 454,864 | 454,863 | u914948583 | python |
p02702 | def solve():
s = input()
n = len(s)
mod = 2019
reminder = [0]*mod
pre_rem = 0
for i in range(n):
pre_rem = (int(s[n-i-1])*pow(10, i) + pre_rem) % mod
reminder[pre_rem] += 1
ans = reminder[0] # そのまま割り切れる奴ら
for rem_num in reminder[1:]: # _nC_2をしてる
if rem_num >=... | def solve():
s = input()
n = len(s)
mod = 2019
reminder = [0]*mod
pre_rem = 0
for i in range(n):
pre_rem = (int(s[n-i-1])*pow(10, i, mod) + pre_rem) % mod
reminder[pre_rem] += 1
ans = reminder[0]
for rem_num in reminder:
if rem_num >= 2:
ans += (rem... | [
"call.arguments.add"
] | 454,865 | 454,863 | u914948583 | python |
p02702 | S = list(input())
for i in range(len(S)):
S[i] = int(S[i])
A = [S[len(S)-1]]
mod = 2019
for i in range(1,len(S)):
A.append((S[len(S)-i-1]*pow(10,i,mod)+A[i-1]) % mod)
from collections import Counter
c = Counter(A)
ans = c[0]
for i in range(1,2019):
if c[i] >= 2:
ans += (c[i]*(c[i]-1)) //2
pr... | S = list(input())
for i in range(len(S)):
S[i] = int(S[i])
A = [S[len(S)-1]]
mod = 2019
for i in range(1,len(S)):
A.append((S[len(S)-i-1]*pow(10,i,mod)+A[i-1]) % mod)
from collections import Counter
c = Counter(A)
ans = c[0]
for i in range(0,2019):
if c[i] >= 2:
ans += (c[i]*(c[i]-1)) //2
pr... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"expression.operation.binary.remove"
] | 454,884 | 454,885 | u119148115 | python |
p02702 | S = list(input())
for i in range(len(S)):
S[i] = int(S[i])
A = [S[len(S)-1]]
mod = 2019
for i in range(1,len(S)):
A.append((S[len(S)-i-1]*pow(10,i,mod)+A[i-1]) % mod)
from collections import Counter
c = Counter(A)
ans = c[0]
for i in range(1,2019):
if c[i] >= 2:
ans += (c[i]*(c[i]-1)) //2
pr... | S = list(input())
for i in range(len(S)):
S[i] = int(S[i])
A = [S[len(S)-1]]
mod = 2019
for i in range(1,len(S)):
A.append((S[len(S)-i-1]*pow(10,i,mod)+A[i-1]) % mod)
from collections import Counter
c = Counter(A)
ans = c[0]
for i in range(0,2019):
if c[i] >= 2:
ans += (c[i]*(c[i]-1)) //2
pr... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 454,886 | 454,885 | u119148115 | python |
p02702 | S=list(input())
S.reverse()
N=len(S)
R=[0]*N
R10=[0]*N
m=2019
K=0
R10[0]=1
R[0]=int(S[0])%m
for i in range(1,N):
R10[i]=(R10[i-1]*10)%m
R[i]=(R[i-1]+int(S[i])*R10[i])%m
print(R)
d={}
for i in range(2019):
d[i]=0
for i in range(N):
d[R[i]]+=1
ans=0
for i in range(2019):
if i == 0:
ans += d[... | S=list(input())
S.reverse()
N=len(S)
R=[0]*N
R10=[0]*N
m=2019
K=0
R10[0]=1
R[0]=int(S[0])%m
for i in range(1,N):
R10[i]=(R10[i-1]*10)%m
R[i]=(R[i-1]+int(S[i])*R10[i])%m
d={}
for i in range(2019):
d[i]=0
for i in range(N):
d[R[i]]+=1
ans=0
for i in range(2019):
if i == 0:
ans += d[i]
... | [
"call.remove"
] | 454,894 | 454,895 | u224353074 | python |
p02702 | d = {0: 1}
s, p = 0, 1
for c in reversed(input()):
s = (s + p * int(c)) % 2019
d[s] = d.get(s, 0) + 1
p = p * 10 % 2019
print(sum(x * (x - 1) // 2 for x in d))
| d = {0: 1}
s, p = 0, 1
for c in reversed(input()):
s = (s + p * int(c)) % 2019
d[s] = d.get(s, 0) + 1
p = p * 10 % 2019
print(sum(x * (x - 1) // 2 for x in d.values()))
| [
"call.add"
] | 454,905 | 454,906 | u021019433 | python |
p02702 | mod_673 = [1] * 672
for i in range(1,672):
mod_673[i] = (mod_673[i -1] * 10) % 672
S = input()
S = S[::-1]
A = [0] * (len(S) + 1)
B = [0] * (len(S) + 1)
x = 0
Ans = [[0] * 3 for i in range(673)]
for i in range(1, len(S) + 1):
A[i] = (A[i - 1] + int(S[i - 1]) * mod_673[(i - 1) % 672]) % 673
B[i] = (B[i - 1]... | mod_673 = [1] * 672
for i in range(1,672):
mod_673[i] = (mod_673[i -1] * 10) % 673
S = input()
S = S[::-1]
A = [0] * (len(S) + 1)
B = [0] * (len(S) + 1)
x = 0
Ans = [[0] * 3 for i in range(673)]
for i in range(1, len(S) + 1):
A[i] = (A[i - 1] + int(S[i - 1]) * mod_673[(i - 1) % 672]) % 673
B[i] = (B[i - 1]... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 454,918 | 454,919 | u092646083 | python |
p02702 | mod_673 = [1] * 673
for i in range(1,673):
mod_673[i] = (mod_673[i -1] * 10) % 673
S = input()
S = S[::-1]
A = [0] * (len(S) + 1)
B = [0] * (len(S) + 1)
x = 0
Ans = [[0] * 3 for i in range(673)]
for i in range(1, len(S) + 1):
A[i] = (A[i - 1] + int(S[i - 1]) * mod_673[(i - 1) % 673]) % 673
B[i] = (B[i - 1]... | mod_673 = [1] * 672
for i in range(1,672):
mod_673[i] = (mod_673[i -1] * 10) % 673
S = input()
S = S[::-1]
A = [0] * (len(S) + 1)
B = [0] * (len(S) + 1)
x = 0
Ans = [[0] * 3 for i in range(673)]
for i in range(1, len(S) + 1):
A[i] = (A[i - 1] + int(S[i - 1]) * mod_673[(i - 1) % 672]) % 673
B[i] = (B[i - 1]... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"variable_access.subscript.index.change"
] | 454,920 | 454,919 | u092646083 | python |
p02702 | mod_673 = [1] * 672
for i in range(1,672):
mod_673[i] = (mod_673[i -1] * 10) % 673
S = input()
S = S[::-1]
A = [0] * (len(S) + 1)
B = [0] * (len(S) + 1)
x = 0
Ans = [[0] * 3 for i in range(673)]
for i in range(1, len(S) + 1):
A[i] = (A[i - 1] + int(S[i - 1]) * mod_673[(i - 1) % 673]) % 673
B[i] = (B[i - 1]... | mod_673 = [1] * 672
for i in range(1,672):
mod_673[i] = (mod_673[i -1] * 10) % 673
S = input()
S = S[::-1]
A = [0] * (len(S) + 1)
B = [0] * (len(S) + 1)
x = 0
Ans = [[0] * 3 for i in range(673)]
for i in range(1, len(S) + 1):
A[i] = (A[i - 1] + int(S[i - 1]) * mod_673[(i - 1) % 672]) % 673
B[i] = (B[i - 1]... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 454,921 | 454,919 | u092646083 | python |
p02702 | S=input()
from collections import defaultdict
d=defaultdict(int)
n=len(S)
b=0
for i in range(n):
a=int(S[n-i-1])
b+=a*pow(10,i,2019)
b%=2019
d[b]+=1
ans=0
for k,v in d.items():
if k==0:
ans+=v
else:
ans+=v*(v-1)//2
print(ans) | S=input()
from collections import defaultdict
d=defaultdict(int)
n=len(S)
b=0
for i in range(n):
a=int(S[n-i-1])
b+=a*pow(10,i,2019)
b%=2019
d[b]+=1
ans=0
for k,v in d.items():
if k==0:
ans+=v
ans+=v*(v-1)//2
print(ans) | [] | 454,922 | 454,923 | u173148629 | python |
p02702 | from functools import lru_cache
from tqdm import tqdm
S=input()
count=[0 for i in range(2019)]
length=len(S)
#S=int(S)
S=S+'0'
S=S[::-1]
_S=0
base=1
for i,s in enumerate(S):
_S=base*int(s)+_S
count[_S%2019]+=1
base*=10
base=base%2019
_S=_S%2019
retval=0
for key in range(2019):
retval+=cou... | from functools import lru_cache
S=input()
count=[0 for i in range(2019)]
length=len(S)
#S=int(S)
S=S+'0'
S=S[::-1]
_S=0
base=1
for i,s in enumerate(S):
_S=base*int(s)+_S
count[_S%2019]+=1
base*=10
base=base%2019
_S=_S%2019
retval=0
for key in range(2019):
retval+=count[key]*(count[key]-1)... | [] | 454,926 | 454,927 | u922952729 | python |
p02702 | import sys
readline = sys.stdin.readline
S = readline().strip()
S = list(map(int, S))
N = len(S)
P = 2019
rems = [0] * N
a = 1
b = 0
for i in range(N):
b = (b + (a * S[N - i - 1]) % P) % P
rems[N - i - 1] = b
a = a * 10 % P
rems = rems + [0]
counts = [0] * P
for i in range(len(rems)):
counts[rems[... | import sys
readline = sys.stdin.readline
S = readline().strip()
S = list(map(int, S))
N = len(S)
P = 2019
rems = [0] * N
a = 1
b = 0
for i in range(N):
b = (b + (a * S[N - i - 1]) % P) % P
rems[N - i - 1] = b
a = a * 10 % P
rems = rems + [0]
counts = [0] * P
for i in range(len(rems)):
counts[rems[... | [
"call.remove"
] | 454,972 | 454,973 | u780465569 | python |
p02702 |
S = list(map(int, list(input())))
mod = 2019
ss = [0]
tmp = 0
for i, s in enumerate(S[::-1]):
tmp += s * pow(10, i, mod)
tmp %= mod
ss.append(tmp)
cnts = [0] * 2018
ans = 0
for s in ss:
ans += cnts[s]
cnts[s] += 1
print(ans)
|
S = list(map(int, list(input())))
mod = 2019
ss = [0]
tmp = 0
for i, s in enumerate(S[::-1]):
tmp += s * pow(10, i, mod)
tmp %= mod
ss.append(tmp)
cnts = [0] * 2019
ans = 0
for s in ss:
ans += cnts[s]
cnts[s] += 1
print(ans)
| [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 455,013 | 455,014 | u333945892 | python |
p02703 | from heapq import heappush, heappop
inf = float('inf')
def dijkstra(graph:list, node:int, start:int) -> list:
dist = [inf]*node
dist[start] = 0
heap = [(0,start)]
while heap:
cost,thisNode = heappop(heap)
for NextCost,NextNode in graph[thisNode]:
dist_cand = dist[thisNode]+N... | from heapq import heappush, heappop
inf = float('inf')
def dijkstra(graph:list, node:int, start:int) -> list:
dist = [inf]*node
dist[start] = 0
heap = [(0,start)]
while heap:
cost,thisNode = heappop(heap)
for NextCost,NextNode in graph[thisNode]:
dist_cand = dist[thisNode]+N... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 455,156 | 455,157 | u170201762 | python |
p02705 | r=input()
print(2*3.14*r) | r=int(input())
print(2*3.14*r) | [
"call.add",
"call.arguments.change"
] | 455,210 | 455,211 | u428341537 | python |
p02705 | R = int(input())
import math
pi = math.pi
print(2 * pi * R ** 2)
| R = int(input())
import math
pi = math.pi
print(2 * pi * R) | [
"expression.operation.binary.remove"
] | 455,218 | 455,219 | u237634011 | python |
p02705 | r=float(input())
print(r*3.14159) | r=float(input())
print(r*3.14159*2) | [
"expression.operation.binary.add"
] | 455,241 | 455,242 | u854931881 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.