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 |
|---|---|---|---|---|---|---|---|
p02708 |
N, K = map(int,input().split())
ans = 0
MOD = 10**9+7
for i in range(K,N+1):
num = ((2*N-i+1)*i)//2 - ((i-1)*i)//2
ans+=num%MOD
ans%=MOD
print(ans) |
N, K = map(int,input().split())
ans = 0
MOD = 10**9+7
for i in range(K,N+2):
num = ((2*N-i+1)*i)//2 - ((i-1)*i)//2 +1
ans+=num%MOD
ans%=MOD
print(ans) | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 463,612 | 463,613 | u311488536 | python |
p02707 | n=int(input())
a=list(map(int,input().split()))
a1=[0]*(n+1)
for i in range(n-1):
a1[a[i]]+=1
print(a1)
for j in range(1,n+1):
print(a1[j])
| n=int(input())
a=list(map(int,input().split()))
a1=[0]*(n+1)
for i in range(n-1):
a1[a[i]]+=1
for j in range(1,n+1):
print(a1[j])
| [
"call.remove"
] | 463,650 | 463,651 | u518064858 | python |
p02708 | n, k = map(int, input().split())
a = 0
for i in range(k, n+2):
a += n*k + k - k**2 + 1
ans = a % (10**9+7)
print(ans) | n, k = map(int, input().split())
a = 0
for i in range(k, n+2):
a += (n*i + i - i**2 + 1)
ans = a % (10**9+7)
print(ans) | [
"identifier.change",
"expression.operation.binary.change"
] | 463,718 | 463,719 | u363421241 | python |
p02708 | N, K = map(int, input().split())
ans = 0
for i in range(K, N+2):
ans += i * (N-i+1) + 1
print(ans%(10**7+7)) | N, K = map(int, input().split())
ans = 0
for i in range(K, N+2):
ans += i * (N-i+1) + 1
print(ans%(10**9+7)) | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 463,739 | 463,740 | u595375942 | python |
p02708 | import sys
input = lambda: sys.stdin.readline().strip("\r\n")
n, k = map(int, input().split())
mod = 10**9 + 7
ans = 0
for i in range(k, n+2):
mini = i*(i+1)//2
maxi = (n+1)*(n+2)//2 - (n+1-i)*(n+1-i+1)//2
ans += maxi - mini
print(ans % mod)
| import sys
input = lambda: sys.stdin.readline().strip("\r\n")
n, k = map(int, input().split())
mod = 10**9 + 7
ans = 0
for i in range(k, n+2):
mini = i*(i+1)//2
maxi = (n+1)*(n+2)//2 - (n+1-i)*(n+1-i+1)//2
ans += maxi - mini + 1
print(ans % mod)
| [
"expression.operation.binary.add"
] | 463,752 | 463,753 | u139216533 | python |
p02708 | n,k=map(int,input().split())
res=0
for i in range(k,n+2):
res+=(2*n-i+1)/2*i-(i/2*(i-1))+1
print(res)
print("{}".format(int(res%(10**9+7)))) | n,k=map(int,input().split())
res=0
for i in range(k,n+2):
res+=(2*n-i+1)/2*i-(i/2*(i-1))+1
#print(res)
print("{}".format(int(res%(10**9+7)))) | [
"call.remove"
] | 463,756 | 463,757 | u080475902 | python |
p02708 | import itertools
def main():
N,K = map(int, input().split())
MOD = pow(10,9)+7
# 和としてありうる種類数が知りたい
# 10^100が非常に大きいので、選ぶ個数が異なる時、必ず和は異なる事が分かるので、
# 10^100を取り除いて、0,1,2,...,N-1,N という要素数(N+1)の数列からm個とるときに、
# ありうる和の種類数を求めて、K<=m<=N+1でシグマすると考えられる
# ここで、数列からm個とる時の和でありうるのは、
# 最小値: 小さい順にm個 -> 0+1+...... | import itertools
def main():
N,K = map(int, input().split())
MOD = pow(10,9)+7
# 和としてありうる種類数が知りたい
# 10^100が非常に大きいので、選ぶ個数が異なる時、必ず和は異なる事が分かるので、
# 10^100を取り除いて、0,1,2,...,N-1,N という要素数(N+1)の数列からm個とるときに、
# ありうる和の種類数を求めて、K<=m<=N+1でシグマすると考えられる
# ここで、数列からm個とる時の和でありうるのは、
# 最小値: 小さい順にm個 -> 0+1+...... | [] | 463,764 | 463,765 | u432251613 | python |
p02708 | N = list(map(int, input().split()))
N = NK[0]; K = NK[1]
result = 0
for i in range(K,N+2):
result += i*(N-i+1) +1
print(result)
| NK = list(map(int, input().split()))
N = NK[0]; K = NK[1]
result = 0
for i in range(K,N+2):
result += i*(N-i+1) +1
result = result%1000000007
print(result) | [
"assignment.variable.change",
"identifier.change"
] | 463,768 | 463,769 | u904081717 | python |
p02708 | # -*- 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.remove"
] | 463,772 | 463,773 | u952022797 | python |
p02708 | N,M = map(int,input().split())
s = 0
for i in range(K,N+2):
s += i*N +1 - i*(i -1)
print(s%(10**9 +7)) | N,K = map(int,input().split())
s = 0
for i in range(K,N+2):
s += i*N +1 - i*(i -1)
print(s%(10**9 +7)) | [
"assignment.variable.change",
"identifier.change"
] | 463,784 | 463,785 | u607074939 | python |
p02708 | N,M = int(input().split())
s = 0
for i in range(K,N+2):
s += i*N +1 - i*(i -1)
print(s%(10**9 +7)) | N,K = map(int,input().split())
s = 0
for i in range(K,N+2):
s += i*N +1 - i*(i -1)
print(s%(10**9 +7)) | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.function.change",
"call.arguments.add"
] | 463,786 | 463,785 | u607074939 | python |
p02708 | N, K = map(int, input().split())
ans = 0
for k in range(K, N+1):
mi = k*(k-1)//2
ma = k*(2*N-k+1)//2
ans += ma - mi + 1
ans %= 1000000007
print(ans)
| N, K = map(int, input().split())
ans = 0
for k in range(K, N+2):
mi = k*(k-1)//2
ma = k*(2*N-k+1)//2
ans += ma - mi + 1
ans %= 1000000007
print(ans)
| [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 463,787 | 463,788 | u045939752 | python |
p02708 | from collections import deque
import sys
import bisect
import math
import itertools
from queue import deque
from math import gcd
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inp_list(): return list(map(int, sys.stdin.readline().split()))
def lcm(x, y): return (x * ... | from collections import deque
import sys
import bisect
import math
import itertools
from queue import deque
from math import gcd
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inp_list(): return list(map(int, sys.stdin.readline().split()))
def lcm(x, y): return (x * ... | [
"expression.operation.binary.remove"
] | 463,801 | 463,802 | u390901183 | python |
p02708 | from collections import deque
import sys
import bisect
import math
import itertools
from queue import deque
from math import gcd
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inp_list(): return list(map(int, sys.stdin.readline().split()))
def lcm(x, y): return (x * ... | from collections import deque
import sys
import bisect
import math
import itertools
from queue import deque
from math import gcd
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inp_list(): return list(map(int, sys.stdin.readline().split()))
def lcm(x, y): return (x * ... | [
"expression.operation.binary.add"
] | 463,803 | 463,802 | u390901183 | python |
p02708 | N,K = map(int,input().split())
cnt = [0]*(N-K+2)
cnt_all = 0
mod = 1000000007
for i in range(K,N+2):
cnt[i] = i*N - i*(i-1) + 1
for i in range(N-K+2):
cnt_all += cnt[i]
print(cnt_all % mod)
| N,K = map(int,input().split())
cnt = [0]*(N-K+2)
cnt_all = 0
mod = 1000000007
for i in range(K,N+2):
cnt[i-K] = i*N - i*(i-1) + 1
for i in range(N-K+2):
cnt_all += cnt[i]
print(cnt_all % mod) | [
"assignment.change"
] | 463,823 | 463,824 | u464440434 | python |
p02708 | n, k = map(int, input().split())
total = 0
for i in range(k, n+2):
total += i(n+1-i) + 1
total %= 10**9 + 7
print(total) | n, k = map(int, input().split())
total = 0
for i in range(k, n+2):
total += i*(n+1-i) + 1
total %= 10**9 + 7
print(total)
| [] | 463,847 | 463,848 | u408375121 | python |
p02708 | N,K=map(int,input().split())
ans=0
kari=[i for i in range(N+1)]
for i in range(K,N+2):
saidai=(N+N-i+1)*i//2
saisyou=(i-1)*i//2
ans+=saidai-saisyou+1
ans%=10**+7
print(ans) | N,K=map(int,input().split())
ans=0
kari=[i for i in range(N+1)]
for i in range(K,N+2):
saidai=(N+N-i+1)*i//2
saisyou=(i-1)*i//2
ans+=saidai-saisyou+1
ans%=10**9+7
print(ans) | [] | 463,889 | 463,890 | u671211357 | python |
p02708 | n, k = map(int, input().split())
cnt = 0
MOD = 1000000007
for i in range(k, n+2):
left = i*(i-1)//2
right = i*(2*n-i+1)//2
add = right - left + 1
cnt += add%MOD
print(cnt) | n, k = map(int, input().split())
cnt = 0
MOD = 1000000007
for i in range(k, n+2):
left = i*(i-1)//2
right = i*(2*n-i+1)//2
add = right - left + 1
cnt = (cnt+add)%MOD
print(cnt) | [
"assignment.value.change"
] | 463,904 | 463,905 | u054559808 | python |
p02708 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate, combinations
from math import sqrt, ceil, floor
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from math import gcd
import sys
d... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate, combinations
from math import sqrt, ceil, floor
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from math import gcd
import sys
d... | [] | 463,908 | 463,909 | u279460955 | python |
p02708 | N, K = map(int, input().split())
mod = 10**9 + 7
ans = 0
for i in range(K, N + 2):
l = N - i + 1
ans += ((N + l) * (N - l + 1) // 2) - ((i - 1)*i // 2)
print(ans % mod) | N, K = map(int, input().split())
mod = 10**9 + 7
ans = 0
for i in range(K, N + 2):
l = N - i + 1
ans += ((l + N) * (N - l + 1) // 2) - ((i - 1)*i // 2) + 1
print(ans % mod) | [
"expression.operation.binary.remove"
] | 463,936 | 463,937 | u760802228 | python |
p02708 | N,K=map(int,input().split())
mod = (10**9) +7
def counts(n,k):
if k==1:
return N
else:
return k*N -k*(k-1) +1
total =0
for k in range(K,N+2):
total += int(counts(N,k))
print(total%mod) | N,K=map(int,input().split())
mod = (10**9) +7
def counts(n,k):
if k==1:
return N+1
else:
return k*N - k*( k - 1 ) + 1
total =0
for k in range(K,N+2):
total += int(counts(N,k))
print(total%mod) | [
"expression.operation.binary.add"
] | 463,950 | 463,951 | u485319545 | python |
p02708 | N,K=map(int,input().split())
mod = (10**9) +7
def counts(n,k):
if k==1:
return N
else:
return k*N -k*(k-1) +1
total =0
for k in range(K,N+2):
total += counts(N,k)
print(total%mod) | N,K=map(int,input().split())
mod = (10**9) +7
def counts(n,k):
if k==1:
return N+1
else:
return k*N - k*( k - 1 ) + 1
total =0
for k in range(K,N+2):
total += int(counts(N,k))
print(total%mod) | [
"call.add",
"call.arguments.change"
] | 463,952 | 463,951 | u485319545 | python |
p02708 | a,b=map(int,input().split(" "))
print(a,b)
min=0
max=0
count=0
for i in range(b,a+2):
min = int((i-1)*i/2)
max = int((2*a-i+1)*i/2)
count+=max-min+1
print(count%1000000007) | a,b=map(int,input().split(" "))
#print(a,b)
min=0
max=0
count=0
for i in range(b,a+2):
min = int((i-1)*i/2)
max = int((2*a-i+1)*i/2)
count+=max-min+1
print(count%1000000007) | [
"call.remove"
] | 463,968 | 463,969 | u924276527 | python |
p02708 |
n, k = map(int, input().split())
ans = 0
mod = 10**9+7
for i in range(k, n+2):
ans += int(n*(n+1)/2 - (n-i)*(n-i+1)/2 - (i-1)*i/2 + 1)
print(ans)
'''
n, k = map(int, input().split())
ans = 0
for i in range(k, n+2):
a = 0.5*i*(i-1)
b = 0.5*n*(n+1)-0.5*(n-i)*(n-i+1)
ans += int(b-a+1)
print(ans % (10**... |
n, k = map(int, input().split())
ans = 0
mod = 10**9+7
for i in range(k, n+2):
ans += int(n*(n+1)/2 - (n-i)*(n-i+1)/2 - (i-1)*i/2 + 1)
print(ans % mod)
'''
n, k = map(int, input().split())
ans = 0
for i in range(k, n+2):
a = 0.5*i*(i-1)
b = 0.5*n*(n+1)-0.5*(n-i)*(n-i+1)
ans += int(b-a+1)
print(ans %... | [
"expression.operation.binary.add"
] | 463,977 | 463,978 | u737758066 | python |
p02708 | import sys
import os
import math
import string
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = ... | import sys
import os
import math
import string
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = ... | [
"expression.operation.binary.add"
] | 463,992 | 463,993 | u634079249 | python |
p02708 | mod=100000007
n,k=list(map(int,input().split(" ")))
sum=0
for i in range(k,n+2):
sum=sum+i*(n-i+1)+1
print(sum%mod)
| mod=1000000007
n,k=list(map(int,input().split(" ")))
sum=0
for i in range(k,n+2):
sum=sum+i*(n-i+1)+1
print(sum%mod)
| [
"literal.number.integer.change",
"assignment.value.change"
] | 463,994 | 463,995 | u437351386 | python |
p02708 | N,K = map(int,input().split())
Ans = [0]*(N+2)
Sum_Ans = 0
def solution(N,K,Ans,Sum_Ans):
for i in range(K,N+2):
#max[i] = (2*N - i + 1)*i / 2
#min[i] = i*(i - 1) / 2
Ans[i] = i*(N - i + 1)
Sum_Ans += Ans[i]
print(Sum_Ans%(10**9 + 7))
solution(N,K,Ans,Sum_Ans) | N,K = map(int,input().split())
Ans = [0]*(N+2)
Sum_Ans = 0
def solution(N,K,Ans,Sum_Ans):
for i in range(K,N+2):
#max[i] = (2*N - i + 1)*i / 2
#min[i] = i*(i - 1) / 2
Ans[i] = i*(N - i + 1) + 1
Sum_Ans += Ans[i]
print(Sum_Ans%(10**9 + 7))
solution(N,K,Ans,Sum_Ans... | [
"assignment.change"
] | 464,005 | 464,006 | u572343785 | python |
p02708 | N, K = map(int, input().split())
mod = 10 ** 9 + 7
ans = 0
min_x, max_x = 0, N
for i in range(1, N+1):
min_x += i
max_x += N-i
if i+1 < K: continue
ans += max_x - min_x + 1
ans %= mod
print(ans)
| N, K = map(int, input().split())
mod = 10 ** 9 + 7
ans = 0
min_x, max_x = 0, 0
for i in range(N+1):
min_x += i
max_x += N-i
if i+1 < K: continue
ans += max_x - min_x + 1
ans %= mod
print(ans)
| [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 464,011 | 464,012 | u814781830 | python |
p02708 | n,k = map(int,input().split())
ans = 0
for i in range(k,n+2):
ans += (i*(n-i+1) + 1)
print(ans) | n,k = map(int,input().split())
ans = 0
for i in range(k,n+2):
ans += (i*(n-i+1) + 1)
ans %= 1000000007
print(ans) | [] | 464,015 | 464,016 | u859987056 | python |
p02708 | a, b = map(int, input().split())
mod = pow(10,9) + 7
def cal(a,i):
min = i*(i-1)/2
max = a*(a-1)/2 - (a-i)*(a-i-1)/2
return max - min + 1
count = 0
for i in range(a-b+2):
count += cal(a,i+b)
print(count % mod)
| a, b = map(int, input().split())
mod = pow(10,9) + 7
def cal(a,i):
min = i*(i-1)/2
max = a*(a-1)/2 - (a-i)*(a-i-1)/2
return max - min + 1
count = 0
for i in range(a-b+2):
count += cal(a+1,i+b)
print(int(count % mod)) | [
"call.add",
"call.arguments.change"
] | 464,034 | 464,033 | u927373043 | python |
p02708 | n,k=list(map(int,input().split()))
result = 0
for i in range(k,n+2):
result += n*i-i*i+i+1
print(result) | n,k=list(map(int,input().split()))
result = 0
for i in range(k,n+2):
result += n*i-i*i+i+1
print(result%1000000007) | [
"expression.operation.binary.add"
] | 464,035 | 464,036 | u747391638 | python |
p02708 | N, K = map(int,input().split())
ans = sum([i*N-i*(i-1)+1 for i in range(K,N+2)])
print(ans) | N, K = map(int,input().split())
ans = sum([i*N-i*(i-1)+1 for i in range(K,N+2)])
ans%= 1000000007
print(ans) | [] | 464,040 | 464,041 | u890570193 | python |
p02708 | import numpy as np
n, k = map(int, input().split())
MOD = 10 ** 9 + 7
ref = np.array(list(range(n + 1)), dtype='int64')
max_sum = np.sum(ref[-k + 1:])
min_sum = np.sum(ref[:k - 1])
if k == 1:
max_sum = ref[n]
ans = 0
for i in range(k, n + 2):
min_sum += ref[i - 1]
max_sum += ref[-i]
ans += max_sum - ... | import numpy as np
n, k = map(int, input().split())
MOD = 10 ** 9 + 7
ref = np.array(list(range(n + 1)), dtype='int64')
max_sum = np.sum(ref[-k + 1:])
min_sum = np.sum(ref[:k - 1])
if k == 1:
max_sum = min_sum = 0
ans = 0
for i in range(k, n + 2):
min_sum += ref[i - 1]
max_sum += ref[-i]
ans += max_s... | [] | 464,042 | 464,043 | u307622233 | python |
p02708 | N, K = map(int, input().split(' '))
count = 0
for n in range(K, N+2):
count += n*(N-n+1) + 1
print(count) | N, K = map(int, input().split(' '))
count = 0
for n in range(K, N+2):
count += n*(N-n+1) + 1
count %= 1000000007
print(count) | [] | 464,051 | 464,052 | u565448206 | python |
p02708 | # D - Sum of Large Numbers
from itertools import accumulate
def main():
N, K = map(int, input().split())
MOD = 10 ** 9 + 7
cumsum_left = tuple(accumulate(range(N + 1)))
cumsum_right = tuple(accumulate(reversed(range(N + 1))))
total = sum(r - 1 + 1 for l, r in zip(cumsum_left[K - 1 :], cumsum_right... | # D - Sum of Large Numbers
from itertools import accumulate
def main():
N, K = map(int, input().split())
MOD = 10 ** 9 + 7
cumsum_left = tuple(accumulate(range(N + 1)))
cumsum_right = tuple(accumulate(reversed(range(N + 1))))
total = sum(r - l + 1 for l, r in zip(cumsum_left[K - 1 :], cumsum_right... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 464,069 | 464,070 | u077291787 | python |
p02708 | MOD = 10 ** 9 + 7
n, k = map(int, input().split())
def calc(a):
smallest = a * (a-1) / 2
largest = smallest + a * (n-a+1)
return latgest -smallest + 1
ans = 0
for a in range(k, n+2):
ans += calc(a)
ans %= MOD
print(ans) | MOD = 10 ** 9 + 7
n, k = map(int, input().split())
def calc(a):
smallest = a * (a-1) // 2
largest = smallest + a * (n-a+1)
return largest - smallest + 1
ans = 0
for a in range(k, n+2):
ans += calc(a)
ans %= MOD
print(ans)
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change",
"function.return_value.change"
] | 464,077 | 464,076 | u160169132 | python |
p02708 | from typing import NoReturn
def my_sum(start: int, end: int):
if start < 0:
return my_sum(1 - start, end)
elif start > 1:
return my_sum(1, end) - my_sum(1, start - 1)
else:
return end * (end + 1) // 2
def main() -> NoReturn:
n, k = map(int, input().split()) # type: int, int
... | from typing import NoReturn
def my_sum(start: int, end: int):
if start < 0:
return my_sum(1 - start, end)
elif start > 1:
return my_sum(1, end) - my_sum(1, start - 1)
else:
return end * (end + 1) // 2
def main() -> NoReturn:
n, k = map(int, input().split()) # type: int, int
... | [
"assignment.change"
] | 464,082 | 464,083 | u945200821 | python |
p02708 | n,k=map(int,input().split())
ans=0
for i in range(k,n+2):
miin=i*(i-1)/2
maax=i*(2*n-i+1)/2
ans+=maax-miin+1
print(int(ans)%10**9+7) | n,k=map(int,input().split())
ans=0
for i in range(k,n+2):
miin=i*(i-1)/2
maax=i*(2*n-i+1)/2
ans+=maax-miin+1
print(int(ans)%(10**9+7)) | [
"call.arguments.change"
] | 464,086 | 464,087 | u958053648 | python |
p02708 | N, K = map(int, input().split())
mod = 10 ** 9 + 7
ans = 0
tmp = 0
for i in range(K-1):
tmp += i
for i in range(K, N + 1):
tmp += K - 1
ans += K * N - tmp * 2 + 1
ans = ans % mod
print(ans)
| N, K = map(int, input().split())
mod = 10 ** 9 + 7
ans = 0
tmp = 0
for i in range(K-1):
tmp += i
for i in range(K, N + 2):
tmp += i - 1
ans += i * N - tmp * 2 + 1
ans = ans % mod
print(ans) | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"identifier.change"
] | 464,088 | 464,089 | u944643608 | python |
p02708 | def mapint_inp():
return map(int, input().split())
def intinp():
return int(input())
N, K = mapint_inp()
MOD = 10*9+7
ans = 0
for i in range(K, N+2):
mn = i*(i-1) // 2
mx = i*(2*N-i+1) // 2
ans += mx - mn + 1
print(ans%MOD) | def mapint_inp():
return map(int, input().split())
def intinp():
return int(input())
N, K = mapint_inp()
MOD = 10**9+7
ans = 0
for i in range(K, N+2):
mn = i*(i-1) // 2
mx = i*(2*N-i+1) // 2
ans += mx - mn + 1
print(ans%MOD) | [
"assignment.value.change",
"expression.operation.binary.change"
] | 464,093 | 464,094 | u601575292 | python |
p02708 | N, K = map(int, input().split())
MOD = 10 ** 9 + 7
LOW, HIGH = 0, N
ans = 0
if K >= 1:
ans += (HIGH - LOW + 1)
for i in range(2, N + 2):
LOW += i - 1
HIGH += N - i + 1
LOW %= MOD
HIGH %= MOD
if i >= K:
ans += (HIGH - LOW + 1)
ans %= MOD
print(ans)
| N, K = map(int, input().split())
MOD = 10 ** 9 + 7
LOW, HIGH = 0, N
ans = 0
if 1 >= K:
ans += (HIGH - LOW + 1)
for i in range(2, N + 2):
LOW += i - 1
HIGH += N - i + 1
LOW %= MOD
HIGH %= MOD
if i >= K:
ans += (HIGH - LOW + 1)
ans %= MOD
print(ans)
| [
"control_flow.branch.if.condition.change"
] | 464,105 | 464,106 | u075012704 | python |
p02708 | n,k= list(map(int, input().split()))
mod=10**9+7
ans=0
for i in range(k,n+2):
min=(i-1)*i//2
max=((n+1)+(n-i+1))*i//2
ans+=max-min+1
print(ans % mod) | n,k= list(map(int, input().split()))
mod=10**9+7
ans=0
for i in range(k,n+2):
min=(i-1)*i//2
max=((n+1)+(n-i))*i//2
ans+=max-min+1
print(ans % mod) | [
"expression.operation.binary.remove"
] | 464,122 | 464,123 | u185405877 | python |
p02708 | n,k= list(map(int, input().split()))
mod=10**9+7
ans=0
for i in range(k,n+2):
min=(i-1)*i//2
max=((n+1)+(n-i+1))*i//2
ans+=max-min
print(ans % mod) | n,k= list(map(int, input().split()))
mod=10**9+7
ans=0
for i in range(k,n+2):
min=(i-1)*i//2
max=((n+1)+(n-i))*i//2
ans+=max-min+1
print(ans % mod) | [
"expression.operation.binary.remove"
] | 464,124 | 464,123 | u185405877 | python |
p02708 | # -*- coding: utf-8 -*-
"""
Created on Sun Apr 19 21:27:49 2020
@author: arute
"""
from sys import stdin
import time
import numpy as np
import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
############################################
# read data f... | # -*- coding: utf-8 -*-
"""
Created on Sun Apr 19 21:27:49 2020
@author: arute
"""
from sys import stdin
import time
import numpy as np
import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
############################################
# read data ... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 464,151 | 464,152 | u250102437 | python |
p02708 | import numpy as np
n,k=map(int,input().split())
sum=0
k=k+1
for i in range(k,n+2):
#print(i,(i+1)*n-i*(i+1)+1)
sum=sum+i*n-i*(i-1)+1
print(int(sum)%(10e9+7)) | import numpy as np
n,k=map(int,input().split())
sum=0
k=k
for i in range(k,n+2):
#print(i,i*n-i*(i-1)+1)
sum=sum+i*n-i*(i-1)+1
#print(int(sum))
print(int(int(sum)%(1e9+7))) | [
"expression.operation.binary.remove",
"call.add",
"literal.number.float.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 464,206 | 464,207 | u728483880 | python |
p02708 | n,k=map(int,input().split())
count=0
for i in range(n+1):
if i<k:
continue
elif i>=k:
mini=i*(i-1)//2
a=n*(n+1)//2
b=(n-i)*(n-i+1)//2
maxi=a-b
total=maxi-mini+1
count+=total
print(count%(10**9+7))
| n,k=map(int,input().split())
count=0
for i in range(n+2):
if i<k:
continue
elif i>=k:
mini=i*(i-1)//2
a=n*(n+1)//2
b=(n-i)*(n-i+1)//2
maxi=a-b
total=maxi-mini+1
count+=total
ans=count%(10**9+7)
print(ans)
| [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"call.add"
] | 464,278 | 464,279 | u443854804 | python |
p02708 | list = input().split()
N = int(list[0])
K = int(list[1])
i = K
s = 0
def sum(a,b):
i=0
i = (a + b)*(b - a + 1)/2
return i
while i <= N + 1:
#print(sum(N-i+1,N) + sum(0,i-1))
s = s + sum(N-i+1,N) - sum(0,i-1) + 1
i += 1
print(s % 10**9+7) | list = input().split()
N = int(list[0])
K = int(list[1])
i = K
s = 0
def sum(a,b):
i=0
i = (a + b)*(b - a + 1)/2
return i
while i <= N + 1:
#print(sum(N-i+1,N) + sum(0,i-1))
s = s + sum(N-i+1,N) - sum(0,i-1) + 1
i += 1
print(int(s % (10**9+7))) | [
"call.arguments.add",
"call.arguments.change"
] | 464,305 | 464,304 | u449446168 | python |
p02708 | def touSum(a,l):
return int(((l-a+1)*(a+l))/2)
N,K = map(int,input().split())
maxSum = touSum(1,N)
print(maxSum)
con = 0
for i in range(K,N+1+1):
#print(str(i)+":"+str(touSum(1,i-1))+":"+str(touSum((1+N)-i,N)))
if touSum(1,i-1)>maxSum:
print(con)
break
else:
con += touSum((1+N)-... | def touSum(a,l):
return int(((l-a+1)*(a+l))/2)
N,K = map(int,input().split())
maxSum = touSum(1,N)
#print(maxSum)
con = 0
for i in range(K,N+1+1):
#print(str(i)+":"+str(touSum(1,i-1))+":"+str(touSum((1+N)-i,N)))
if touSum(1,i-1)>maxSum:
print(con)
break
else:
con += touSum((1+N)... | [
"call.remove"
] | 464,327 | 464,328 | u334703235 | python |
p02708 | N,K = list(map(int,input().split()))
import math
ans = 0
for i in range(K,N+2):
if i == 1:
ans += N + 1
if i == 2:
ans += 2*N - 1
else:
ans += N*i - i*(i-1) + 1
print(ans % (10**9 + 7)) | N,K = list(map(int,input().split()))
ans = 0
for i in range(K,N+2):
if i == 1:
ans += N + 1
elif i == 2:
ans += 2*N - 1
else:
ans += N*i - i*(i-1) + 1
print(ans % (10**9 + 7)) | [
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 464,347 | 464,348 | u666771982 | python |
p02708 | n,k = (int(x) for x in input().split())
for i in range(k,n+2):
base = n*i -(i*(i-1)) +1
# print(base)
res = res+ base
resu = res%1000000007
print(resu) | n,k = (int(x) for x in input().split())
res = 0
for i in range(k,n+2):
base = n*i -(i*(i-1)) +1
res = res+ base
resu = res%1000000007
print(resu) | [
"assignment.add"
] | 464,357 | 464,358 | u519923151 | python |
p02708 | n,k = map(int,input().split())
ans = 0
for i in range(k,n+2):
ans += (n-i+1)*i+1
print(ans) | n,k = map(int,input().split())
ans = 0
for i in range(k,n+2):
ans += (n-i+1)*i+1
print(ans%1000000007) | [
"expression.operation.binary.add"
] | 464,359 | 464,360 | u179508038 | python |
p02708 | n, k = map(int, input().split())
ans = 0
for i in range(k, n+1):
ans += i * (n - i + 1) + 1
ans %= 1000000007
print(ans) | n, k = map(int, input().split())
ans = 0
for i in range(k, n+2):
ans += i * (n - i + 1) + 1
ans %= 1000000007
print(ans) | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 464,373 | 464,374 | u306033313 | python |
p02708 | n, k = map(int, input().split())
MOD = 10**9+7
ans = 0
for i in range(k, n+2):
ans += (2*n-k+1)*k//2-(k+1)*k//2+1
ans %= MOD
print(ans % MOD)
| n, k = map(int, input().split())
MOD = 10**9+7
ans = 0
for i in range(k, n+2):
ans += (2*n-i+1)*i//2-(i-1)*i//2+1
ans %= MOD
print(ans % MOD)
| [
"identifier.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 464,375 | 464,376 | u790710233 | python |
p02708 | N, K = map(int, input().split())
mod = 1000000000+7
z=0
zz = ((N-K+1)+N)*K//2 - (0+(K-1))*K//2 + 1
zz = zz % mod
for x in range(K+1, N+3):
print(zz)
z = (z + zz) % mod
zz += (N-x+1) - (x-1)
zz = zz % mod
#
print(z)
| N, K = map(int, input().split())
mod = 1000000000+7
z=0
zz = ((N-K+1)+N)*K//2 - (0+(K-1))*K//2 + 1
zz = zz % mod
for x in range(K+1, N+3):
# print(zz)
z = (z + zz) % mod
zz += (N-x+1) - (x-1)
zz = zz % mod
#
print(z)
| [
"call.remove"
] | 464,385 | 464,386 | u537142137 | python |
p02708 | N,K=map(int,input().split())
r=0
md=10*9+7
for k in range(K,N+2):
r += k*(N-k+1)+1
print(r%md)
| N,K=map(int,input().split())
r=0
md=10**9+7
for k in range(K,N+2):
r += k*(N-k+1)+1
print(r%md)
| [
"assignment.value.change",
"expression.operation.binary.change"
] | 464,394 | 464,395 | u113971909 | python |
p02708 | n, k = map(int, input().split())
mod = 10 * 9 + 7
ans = 0
for i in range(k, n+2):
ans += int(n*(n+1)/2 - (n-i)*(n - i + 1)/2 - (i-1)*i/2 + 1)
print(ans%mod) | n, k = map(int, input().split())
mod = 10 ** 9 + 7
ans = 0
for i in range(k, n+2):
ans += int(n*(n+1)/2 - (n-i)*(n - i + 1)/2 - (i-1)*i/2 + 1)
print(ans%mod) | [
"assignment.value.change",
"expression.operation.binary.change"
] | 464,434 | 464,435 | u699089116 | python |
p02708 | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7
N, K = map(int, readline().split())
N = N + 1
lower = None
upper = None
answer = 0
for k in range(K, N+1):
if lower is None:
lower = sum(ran... | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7
N, K = map(int, readline().split())
N = N + 1
lower = None
upper = None
answer = 0
for k in range(K, N+1):
if lower is None:
lower = sum(ran... | [
"expression.operation.binary.remove"
] | 464,436 | 464,437 | u016881126 | python |
p02708 | N,K = map(int,input().split())
M = 10**9 + 7
T = pow(10,100,M)
ans = 0
for k in range(K, N+2):
ans += (2*N-k+1)*k//2 - k*(k-1)//2 + 1
print(ans) | N,K = map(int,input().split())
M = 10**9 + 7
T = pow(10,100,M)
ans = 0
for k in range(K, N+2):
ans += (2*N-k+1)*k//2 - k*(k-1)//2 + 1
ans %= M
print(ans) | [] | 464,465 | 464,466 | u345966487 | python |
p02708 | N, K = map(int, input("").split(" "))
cnt = 0
for i in range(K, N+2):
start_idx = 0
end_idx = 0
#for j in range(i):
# start_idx += j
start_idx = (i-1) * (i)//2
#for j in range(i):
# end_idx += (N-j)
end_idx = (i)*N - start_idx
#print( end_idx - start_idx+1)
cnt += (end_idx - start_idx+1)... | N, K = map(int, input("").split(" "))
cnt = 0
for i in range(K, N+2):
start_idx = 0
end_idx = 0
#for j in range(i):
# start_idx += j
start_idx = (i-1) * (i)//2
#for j in range(i):
# end_idx += (N-j)
end_idx = (i)*N - start_idx
#print( end_idx - start_idx+1)
cnt += (end_idx - start_idx+1... | [
"expression.operation.binary.change",
"call.arguments.change",
"io.output.change"
] | 464,474 | 464,475 | u212263866 | python |
p02708 | import numpy
N, K = map(int, input().split(' '))
right = 0
s = 0
for i in range(K, N+2):
mi = (i-1)*i/2
ma = (2*N-i+1)*i/2
s += (ma - mi) + 1
print(int(s%(1e7+7)))
| import numpy
N, K = map(int, input().split(' '))
right = 0
s = 0
for i in range(K, N+2):
mi = (i-1)*i/2
ma = (2*N-i+1)*i/2
s += (ma - mi) + 1
print(int(s%(1e9+7)))
| [
"literal.number.float.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 464,482 | 464,483 | u982152304 | python |
p02708 | from scipy.special import comb
n, k = map(int, input().split())
ans = 0
for i in range(k, n+2):
ans += ((n*2-i+1)*i)/2 - i*(i-1)/2 + 1
#print(ans)
print(int(ans%(10**9+7)))
| n, k = map(int, input().split())
ans = 0
for i in range(k, n+2):
ans += ((n*2-i+1)*i)/2 - i*(i-1)/2 + 1
#print(ans)
print(int(ans%(10**9+7)))
| [] | 464,500 | 464,501 | u624617831 | python |
p02708 | n,k=list(map(int,input().split()))
s=0
for i in range(k,n+2):
s+=i*(2*n-i+1)+1
print(s%(1000000007)) | n,k=list(map(int,input().split()))
s=0
for i in range(k,n+2):
s+=i*(n-i+1)+1
print(s%(1000000007)) | [
"expression.operation.binary.remove"
] | 464,502 | 464,503 | u509739538 | python |
p02708 | n, k = map(int, input().split())
def sum2(nums):
res = 0
for num in nums:
res += num
res %= 1000000007
return res
sum2(1 + l * (n + 1 - l) for l in range(k, n + 2)) | n, k = map(int, input().split())
def sum2(nums):
res = 0
for num in nums:
res += num
res %= 1000000007
return res
print(sum2(1 + l * (n + 1 - l) for l in range(k, n + 2))) | [
"call.add",
"call.arguments.change"
] | 464,507 | 464,508 | u401830498 | python |
p02708 | N, K = map(int, input().split())
MOD = 10**9+7
def resolve():
ans = 0
for i in range(K, N+2):
ans += calc(i)
print(ans%MOD)
def calc(i):
minv = i * (i-1) // 2
maxv = minv + i * (N - i + 1)
print(minv, maxv)
return maxv-minv+1
if __name__ == '__main__':
resolve() | N, K = map(int, input().split())
MOD = 10**9+7
def resolve():
ans = 0
for i in range(K, N+2):
ans += calc(i)
print(ans%MOD)
def calc(i):
minv = i * (i-1) // 2
maxv = minv + i * (N - i + 1)
return maxv-minv+1
if __name__ == '__main__':
resolve() | [
"call.remove"
] | 464,519 | 464,520 | u822961851 | python |
p02708 | n,k=map(int,input().split())
s=0
for i in range(k,n+2):
s+=(n-i+1)*i+1
print(s) | n,k=map(int,input().split())
s=0
for i in range(k,n+2):
s+=i*(n-i+1)+1
print(s%1000000007)
| [
"expression.operation.binary.remove"
] | 464,521 | 464,522 | u354126779 | python |
p02708 | N,K = map(int,input().split())
a =0
for i in range(K,N+2):
a = a + ((N+N-i+1)*i/2-(i-1)*(i)/2+1)
print(int(a%10**9+7)) | N,K = map(int,input().split())
a =0
for i in range(K,N+2):
a = a + ((N+N-i+1)*i/2-(i-1)*(i)/2+1)
print(int(a % (10**9+7))) | [
"call.arguments.change"
] | 464,541 | 464,542 | u929768294 | python |
p02708 | N,K = map(int,input().split())
a =0
for i in range(K,N+2):
a = a + ((N+N-i+1)*i/2-(i-1)*(i)/2+1)
print(a%10**9+7) | N,K = map(int,input().split())
a =0
for i in range(K,N+2):
a = a + ((N+N-i+1)*i/2-(i-1)*(i)/2+1)
print(int(a % (10**9+7))) | [
"call.arguments.add",
"call.arguments.change"
] | 464,543 | 464,542 | u929768294 | python |
p02708 | N,K = map(int,input().split())
ans = 0
mod = 10**9+7
for k in range(K,N+2):
ans += (k*(N-k+1)+1) % mod
print(ans)
| N,K = map(int,input().split())
ans = 0
mod = 10**9+7
for k in range(K,N+2):
ans += (k*(N-k+1)+1)
print(ans % mod)
| [
"expression.operation.binary.remove"
] | 464,544 | 464,545 | u267300160 | python |
p02708 | MOD = 10**9+7
N,K = map(int,input().split())
cnt = 0
for k in range(K,N+2):
t = (N-k+1)*k
cnt += t
cnt %= MOD
print(cnt) | MOD = 10**9+7
N,K = map(int,input().split())
cnt = 0
for k in range(K,N+2):
t = (N-k+1)*k+1
cnt += t
cnt %= MOD
print(cnt) | [
"assignment.change"
] | 464,546 | 464,547 | u327466606 | python |
p02708 | n,k=map(int,input().split())
s=[]
count=0
for i in range(n+1):
count+=i
s.append(count)
t=[n]
tmp=n
for i in range(1,n+1):
tmp-=1
t.append(t[i-1]+tmp)
print(t)
ans=0
for i in range(k-1,n+1):
ans+=t[i]-s[i]+1
ans%=(10**9+7)
print(ans) | n,k=map(int,input().split())
s=[]
count=0
for i in range(n+1):
count+=i
s.append(count)
t=[n]
tmp=n
for i in range(1,n+1):
tmp-=1
t.append(t[i-1]+tmp)
# print(t)
ans=0
for i in range(k-1,n+1):
ans+=t[i]-s[i]+1
ans%=(10**9+7)
print(ans) | [
"call.remove"
] | 464,554 | 464,555 | u905974390 | python |
p02708 | MOD = 10 ** 9 + 7
def calc(a):
smallest = a * (a-1) // 2
largest = smallest + a * (n-a+1)
return largest - smallest + 1
n, k = map(int, input().split())
ans = 0
for a in range(k, n+2):
ans += calc(a)
ans % MOD
print(ans)
| MOD = 10 ** 9 + 7
def calc(a):
smallest = a * (a-1) // 2
largest = smallest + a * (n-a+1)
return largest - smallest + 1
n, k = map(int, input().split())
ans = 0
for a in range(k, n+2):
ans += calc(a)
ans %= MOD
print(ans)
| [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 464,560 | 464,561 | u861141787 | python |
p02708 | N, K = map(int, input().split())
MOD = 1000000007
small = 0
large = 0
res = 0
for i in range(K-1):
small += i
large += N-i
for i in range(K, N+2):
small += i-1
large += N - i +1
gap = large - small +1
res += gap
print(res)
| N, K = map(int, input().split())
MOD = 1000000007
small = 0
large = 0
res = 0
for i in range(K-1):
small += i
large += N-i
for i in range(K, N+2):
small += i-1
large += N - i +1
gap = large - small +1
res += gap
print(res%MOD)
| [
"expression.operation.binary.add"
] | 464,564 | 464,565 | u511457539 | python |
p02708 | N, K = map(int, input().split())
MOD = 10**9 + 7
ans = 0
for k in range(K, N+2):
l = (k*(2*N-k+1)//2)%MOD
a = (k*(k-1)//2)%MOD
ans += (l-a+1)%MOD
print(ans) | N, K = map(int, input().split())
MOD = 10**9 + 7
ans = 0
for k in range(K, N+2):
l = (k*(2*N-k+1)//2)%MOD
a = (k*(k-1)//2)%MOD
ans += (l-a+1)%MOD
print(ans%MOD) | [
"expression.operation.binary.add"
] | 464,566 | 464,567 | u785213188 | python |
p02708 | n,k=map(int,input().split())
ans=0
mod=10**9+7
for i in range(k,n+2):
ans+=(2*n-i)*i//2-i*(i+1)//2+1
ans%=mod
print(ans)
| n,k=map(int,input().split())
ans=0
mod=10**9+7
for i in range(k,n+2):
ans+=(2*n-i+1)*i//2-i*(i-1)//2+1
ans%=mod
print(ans) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 464,570 | 464,571 | u225388820 | python |
p02708 | n,k=map(int,input().split())
ans=0
mod=10**9+7
for i in range(k,n+2):
ans+=(2*n)*i//2-i*(i-1)//2+1
ans%=mod
print(ans)
| n,k=map(int,input().split())
ans=0
mod=10**9+7
for i in range(k,n+2):
ans+=(2*n-i+1)*i//2-i*(i-1)//2+1
ans%=mod
print(ans) | [
"expression.operation.binary.add"
] | 464,572 | 464,571 | u225388820 | python |
p02708 | n,k=map(int,input().split())
mod=10**9+7
ans=0
for i in range(k,n+2):
ans+=((2*n-i+1)*i//2-i*(i-1)//2+1)%mod
print(ans) | n,k=map(int,input().split())
mod=10**9+7
ans=0
for i in range(k,n+2):
ans+=(2*n-i+1)*i//2-i*(i-1)//2+1
ans%=mod
print(ans) | [] | 464,575 | 464,576 | u568576853 | python |
p02708 | n,k=map(int,input().split())
mod=10**9+7
ans=0
for i in range(k,n+2):
ans+=((2*n-i+1)*i//2-i*(i-1)//2)%mod
print(ans) | n,k=map(int,input().split())
mod=10**9+7
ans=0
for i in range(k,n+2):
ans+=(2*n-i+1)*i//2-i*(i-1)//2+1
ans%=mod
print(ans) | [] | 464,577 | 464,576 | u568576853 | python |
p02708 | # -*- coding: utf-8 -*-
from sys import stdin
from operator import itemgetter
from collections import deque
from collections import Counter
import math
import pprint
from functools import reduce
# stdin = open("sample.txt")
def keta(kazu):
kazu_str = str(kazu)
kazu_list = [int(kazu_str[i]) for i in range(0, le... | # -*- coding: utf-8 -*-
from sys import stdin
from operator import itemgetter
from collections import deque
from collections import Counter
import math
import pprint
from functools import reduce
# stdin = open("sample.txt")
def keta(kazu):
kazu_str = str(kazu)
kazu_list = [int(kazu_str[i]) for i in range(0, le... | [
"call.arguments.change"
] | 464,595 | 464,596 | u595353654 | python |
p02709 | def sep():
return map(int,input().strip().split(" "))
def lis():
return list(sep())
n=int(input())
ar=lis()
data=[]
for i in range(n):
data.append((ar[i],i))
data.sort(reverse=True)
dp = [[0] * (n+1) for _ in range(n+1)]
for i in range(n):
a, p = data[i]
for j in range(i+1):
dp[i+1][j+1] =... | def sep():
return map(int,input().strip().split(" "))
def lis():
return list(sep())
n=int(input())
ar=lis()
data=[]
for i in range(n):
data.append((ar[i],i))
data.sort(reverse=True)
dp = [[0] * (n+1) for _ in range(n+1)]
for i in range(n):
a, p = data[i]
for j in range(i+1):
dp[i+1][j+1] =... | [
"call.remove"
] | 464,602 | 464,603 | u304602561 | python |
p02709 | n = int(input())
a = list(map(int,input().split()))
b = []
for i in range(n):
b.append([a[i],i])
b.sort()
b = b[::-1]
print(b)
dp = [[0]* (n+1) for i in range(n+1)]
cnt = 0
for i,j in b:
for k in range(cnt+1):
dp[cnt-k][k+1] = max(dp[cnt-k][k] + abs(n-1-j-k)*i,dp[cnt-k][k+1])
dp[cnt-k+1][k] = ma... | n = int(input())
a = list(map(int,input().split()))
b = []
for i in range(n):
b.append([a[i],i])
b.sort()
b = b[::-1]
#print(b)
dp = [[0]* (n+1) for i in range(n+1)]
cnt = 0
for i,j in b:
for k in range(cnt+1):
dp[cnt-k][k+1] = max(dp[cnt-k][k] + abs(n-1-j-k)*i,dp[cnt-k][k+1])
dp[cnt-k+1][k] = m... | [
"call.remove"
] | 464,625 | 464,626 | u970737570 | python |
p02709 | n = int(input())
a = list(map(int, input().split()))
babies = [(a, i) for i, a in enumerate(a)]
babies.sort(reverse=True)
dp = [[0 for _ in range(n)] for _ in range(n)]
ans = 0
for l in range(n):
for r in range(n):
if l+r == n:
ans = max(ans, dp[l][r])
break
activeness, ind = babies[l+r]
dp[... | n = int(input())
a = list(map(int, input().split()))
babies = [(a, i) for i, a in enumerate(a)]
babies.sort(reverse=True)
dp = [[0 for _ in range(n+1)] for _ in range(n+1)]
ans = 0
for l in range(n):
for r in range(n):
if l+r == n:
ans = max(ans, dp[l][r])
break
activeness, ind = babies[l+r]
... | [
"control_flow.loop.range.bounds.upper.change",
"assignment.change"
] | 464,687 | 464,688 | u408375121 | python |
p02709 | import sys
sys.setrecursionlimit(2 ** 2000)
n = int(input())
a = list(map(int, input().split()))
a = [(i, v) for i, v in enumerate(a)]
a.sort(key=lambda x: x[1], reverse=True)
dp = [[-1] * (m + 1) for m in range(n + 1)]
# m: 何人選んだか, l: 左を選んだ人数
def f(m, l):
if m == n: return 0
if dp[m][l] != -1: return dp[m][l]... | import sys
sys.setrecursionlimit(2000 * 2)
n = int(input())
a = list(map(int, input().split()))
a = [(i, v) for i, v in enumerate(a)]
a.sort(key=lambda x: x[1], reverse=True)
dp = [[-1] * (m + 1) for m in range(n + 1)]
# m: 何人選んだか, l: 左を選んだ人数
def f(m, l):
if m == n: return 0
if dp[m][l] != -1: return dp[m][l]
... | [
"expression.operation.binary.remove"
] | 464,697 | 464,698 | u157020659 | python |
p02709 | N = int(input())
def solve(a, i, prev):
r = N - len(prev) - i + 1
p = -i*a
for j, s in enumerate(prev):
yield max(p+abs(j-i)*a, s+abs(j+r)*a)
p = s
yield s+abs(len(prev)-i)*a
pd = [0]
A = map(int, input().split())
for a,i in sorted(((a, i) for i, a in enumerate(A, 1)), reverse=True):
pd = [*solve(a,... | N = int(input())
def solve(a, i, prev):
r = N - len(prev) - i + 1
p = -i*a
for j, s in enumerate(prev):
yield max(p+abs(j-i)*a, s+abs(j+r)*a)
p = s
yield s+abs(len(prev)-i)*a
pd = [0]
A = map(int, input().split())
for a,i in sorted(((a, i) for i, a in enumerate(A, 1)), reverse=True):
pd = [*solve(a,... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 464,705 | 464,706 | u837673618 | python |
p02709 | N = int(input())
def solve(a, i, prev):
r = N - len(prev) - i + 1
p = -i*a
for j, s in enumerate(prev):
yield max(p+abs(j-i)*a, s+abs(j+r)*a)
p = s
yield s+abs(len(prev)-i)*a
pd = [0]
A = map(int, input().split())
for a,i in sorted(((a, i) for i, a in enumerate(A, 1)), reverse=True):
pd = [*solve(a,... | N = int(input())
def solve(a, i, prev):
r = N - len(prev) - i + 1
p = -i*a
for j, s in enumerate(prev):
yield max(p+abs(j-i)*a, s+abs(j+r)*a)
p = s
yield s+abs(len(prev)-i)*a
pd = [0]
A = map(int, input().split())
for a,i in sorted(((a, i) for i, a in enumerate(A, 1)), reverse=True):
pd = [*solve(a,... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 464,707 | 464,706 | u837673618 | python |
p02709 | from collections import *
from itertools import *
N = int(input())
A = map(int, input().split())
SA = SB = 0
ABI = sorted(((b:=max(N-i, i-1)*a, SA:=SA+a, SB:=SB+b) and (a, b, i) for i, a in enumerate(A, 1)), reverse=True)
prev = {0:0}
prev_max = 0
for k, (a, b, i) in enumerate(ABI, 1):
curr = defaultdict(int)
cu... | from collections import *
from itertools import *
N = int(input())
A = map(int, input().split())
SA = SB = 0
ABI = sorted(((b:=max(N-i, i-1)*a, SA:=SA+a, SB:=SB+b) and (a, b, i) for i, a in enumerate(A, 1)), reverse=True)
prev = {0:0}
prev_max = 0
for k, (a, b, i) in enumerate(ABI):
curr = defaultdict(int)
curr_... | [
"call.arguments.change",
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 464,710 | 464,711 | u837673618 | python |
p02709 | from collections import *
from itertools import *
N = int(input())
A = map(int, input().split())
SA = SB = 0
ABI = sorted(((b:=max(N-i, i-1)*a, SA:=SA+a, SB:=SB+b) and (a, b, i) for i, a in enumerate(A, 1)), reverse=True)
prev = {0:0}
prev_max = 0
for k, (a, b, i) in enumerate(ABI, 1):
curr = defaultdict(int)
cu... | from collections import *
from itertools import *
N = int(input())
A = map(int, input().split())
SA = SB = 0
ABI = sorted(((b:=max(N-i, i-1)*a, SA:=SA+a, SB:=SB+b) and (a, b, i) for i, a in enumerate(A, 1)), reverse=True)
prev = {0:0}
prev_max = 0
for k, (a, b, i) in enumerate(ABI):
curr = defaultdict(int)
curr_... | [
"call.arguments.change"
] | 464,710 | 464,712 | u837673618 | python |
p02709 | N = int(input())*400
A = list(map(int,input().split()))*400
A = [[a,i] for a,i in zip(A,range(1,N+1))]
A = sorted(A,reverse=True)
INF = float('inf')
dp = [[-INF] * (N+1) for _ in range(N+1)]
dp[0][0] = 0
ans = 0
for x_y in range(1,N+1):
a = A[x_y-1]
for x in range(x_y+1):
y = x_y-x
if x==0:
dp[x][y] =... | N = int(input())
A = list(map(int,input().split()))
A = [[a,i] for a,i in zip(A,range(1,N+1))]
A = sorted(A,reverse=True)
INF = float('inf')
dp = [[-INF] * (N+1) for _ in range(N+1)]
dp[0][0] = 0
ans = 0
for x_y in range(1,N+1):
a = A[x_y-1]
for x in range(x_y+1):
y = x_y-x
if x==0:
dp[x][y] = dp[x][y... | [
"expression.operation.binary.remove"
] | 464,791 | 464,792 | u268554510 | python |
p02709 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**7)
from pprint import pprint as pp
from pprint import pformat as pf
import pysnooper # @pysnooper.snoop() # debug
import math
#from sortedcontainers import SortedList, SortedDict, SortedSet # no in atcoder
import bisect
class Solver:... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**7)
from pprint import pprint as pp
from pprint import pformat as pf
import math
#from sortedcontainers import SortedList, SortedDict, SortedSet # no in atcoder
import bisect
class Solver:
def __init__(self, n, students):
... | [] | 464,880 | 464,881 | u060894033 | python |
p02711 | nums = list(str(input()))
if "7" in nums:
print("YES")
else:
print("NO") | nums = list(str(input()))
if "7" in nums:
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 465,006 | 465,007 | u305237878 | python |
p02711 | # A Lucky 7
N = input()
for n in N:
if n == "7":
print("Yes")
else:
print("No") | # A Lucky 7
N = input()
for n in N:
if n == "7":
print("Yes")
exit()
else:
print("No") | [
"call.add"
] | 465,008 | 465,009 | u929217794 | python |
p02711 | N = list(input())
if 7 in N:
print('Yes')
else:
print('No') | N = list(input())
if '7' in N:
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change"
] | 465,014 | 465,015 | u966207392 | python |
p02711 | N=input()
if N.find('7') > 0:
print('Yes')
else:
print('No') | N=input()
#print (N.find('7'))
if N.find('7') !=-1:
print('Yes')
else:
print('No') | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 465,038 | 465,039 | u127981515 | python |
p02711 | def index(n):
result = "OK" if '7' in n else "NO"
return result
print(index(str(input()))) | def index(n):
result = "Yes" if '7' in n else "No"
return result
print(index(str(input()))) | [
"literal.string.change",
"assignment.value.change",
"literal.string.case.change"
] | 465,050 | 465,051 | u783229284 | python |
p02711 | n = input()
if n.count(7) == 0:
print("No")
else:
print("Yes") | n = input()
if n.count("7") == 0:
print("No")
else:
print("Yes") | [
"control_flow.branch.if.condition.change"
] | 465,058 | 465,059 | u175590965 | python |
p02711 | N = list(input())
print(N)
if "7" in N:
print("Yes")
else:
print("No") | N = list(input())
if "7" in N:
print("Yes")
else:
print("No") | [
"call.remove"
] | 465,065 | 465,066 | u273242084 | python |
p02711 | flag = False
for i in input():
if i == '7':
print('Yes')
flag = True
if not flag:
print('No') | flag = False
for i in input():
if i == '7':
print('Yes')
flag = True
break
if not flag:
print('No') | [
"control_flow.break.add"
] | 465,067 | 465,068 | u964707702 | python |
p02711 | n = list(input())
print("Yes") if all([i == "7" for i in n]) else print("No")
| n = list(input())
print("Yes") if any([i == "7" for i in n]) else print("No")
| [
"identifier.change",
"call.function.change"
] | 465,069 | 465,070 | u279695802 | python |
p02709 | from collections import defaultdict
#dpa[(0,0)] = 0
n = int(input())
a = list(map(int, input().split()))
d = {}
for i in range(n):
d[i] = a[i]
dp = defaultdict(lambda: 0)
i = 0
x = 0
y = 0
maxr = 0
for k,v in sorted(d.items(), key=lambda x: -x[1]):
i+=1
# print(k,": ",v)
for j in range(i+1):
if j == 0:
mi... | from collections import defaultdict
#dpa[(0,0)] = 0
n = int(input())
a = list(map(int, input().split()))
d = {}
for i in range(n):
d[i] = a[i]
dp = defaultdict(lambda: 0)
i = 0
x = 0
y = 0
maxr = 0
for k,v in sorted(d.items(), key=lambda x: -x[1]):
i+=1
# print(k,": ",v)
for j in range(i+1):
if j == 0:
mi... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 465,092 | 465,093 | u969808621 | python |
p02709 | n = int(input())
a = list(map(int, input().split()))
dp = [[-1] * (n+1) for i in range(n+1)]
A = []
for i in range(n):
A.append([a[i], i])
A.sort(reverse=True)
for i in range(1, n+1):
for j in range(i+1):
if j == 0:
dp[j][i-j] = dp[j][i-j-1] + A[i-1][0] * abs(n-i-A[i-1][1])
elif j ==... | n = int(input())
a = list(map(int, input().split()))
dp = [[0] * (n+1) for i in range(n+1)]
A = []
for i in range(n):
A.append([a[i], i])
A.sort(reverse=True)
for i in range(1, n+1):
for j in range(i+1):
if j == 0:
dp[j][i-j] = dp[j][i-j-1] + A[i-1][0] * abs(n-i-A[i-1][1])
elif j == ... | [
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.unary.remove"
] | 465,094 | 465,095 | u535236942 | python |
p02709 | n = int(input())
a = list(map(int,input().split()))
ans = 0
place = [0]*n
active = sorted(a,reverse=True)
for i in range(n):
place[i] = a.index(active[i])
a[a.index(active[i])] = -1
#dp[x][y] x,y:0~n+1 (x[-1]=x[n+1]=0にすることで端の処理を楽にする)
dp = [[0 for i in range(n+2)]for j in range(n+2)]
for i in range(n):
dp[... | n = int(input())
a = list(map(int,input().split()))
ans = 0
place = [0]*n
active = sorted(a,reverse=True)
for i in range(n):
place[i] = a.index(active[i])
a[a.index(active[i])] = -1
#dp[x][y] x,y:0~n+1 (x[-1]=x[n+1]=0にすることで端の処理を楽にする)
dp = [[0 for i in range(n+2)]for j in range(n+2)]
for i in range(n):
dp[... | [
"call.remove"
] | 465,100 | 465,101 | u179508038 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.