input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
class UnionFind(object):
def __init__(self, n=1):
self.par = [i for i in range(n)]
self.rank = [0 for _ in range(n)]
self.size = [1 for _ in range(n)]
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.pa... | class UnionFind(object):
def __init__(self, n=1):
self.par = [i for i in range(n)]
self.rank = [0 for _ in range(n)]
self.size = [1 for _ in range(n)]
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.pa... | p02540 |
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
self.min_y = [N]*n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find... | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
self.min_y = [N]*n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find... | p02540 |
import sys,os,io
input = sys.stdin.readline
#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
N = int(input())
A = [list(map(int, input().split())) for _ in range(N)]
y_to_i = [0]*(N+1)
for i,(x,y) in enumerate(A):
y_to_i[y] = i
A.sort()
ans = [0]*N
from bisect import *
lis = []
cum_max = N
... | import sys,os,io
input = sys.stdin.readline
#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
N = int(input())
A = [list(map(int, input().split())) for _ in range(N)]
y_to_i = [0]*(N+1)
for i,(x,y) in enumerate(A):
y_to_i[y] = i
A.sort()
ans = [0]*N
from bisect import *
rem_max = N
cum_max = 0
... | p02540 |
from bisect import bisect_left
from collections import Counter
import sys
def main():
input = sys.stdin.readline
N = int(input().rstrip())
# Union-Find
parent = list(range(N))
rank = [1] * N
def get_root(node):
if parent[node] == node:
return node
root = get_roo... | from bisect import bisect_left
from collections import Counter
import sys
def main():
input = sys.stdin.readline
N = int(input().rstrip())
# Union-Find
parent = list(range(N))
rank = [1] * N
def get_root(node):
if parent[node] == node:
return node
root = get_roo... | p02540 |
a,b=list(map(int,input().split()));print(([a+b,a+b-24][a+b>=24])) | a,b=list(map(int,input().split()));print(((a+b)%24)) | p03773 |
a,b=list(map(int,input().split()))
m=a+b
if m>=24:
print((int(m-24)))
else:
print((int(m))) | a, b = list(map(int, input().split()))
ans = a+b
if ans >=24:
ans = ans-24
print(ans) | p03773 |
A,B=list(map(int,input().split()))
print(((A+B)%24)) | print((sum(map(int,input().split()))%24)) | p03773 |
a,b=list(map(int,input().split()));print(((a+b)%24)) | print((eval(input().replace(*' +'))%24)) | p03773 |
print((sum(map(int,input().split()))%24)) | A,B = list(map(int,input().split()))
print(((A+B)%24)) | p03773 |
A, B = list(map(int,input().split()))
t = A+B
if(t < 24):
print(t)
else:
print((t-24)) | A, B = list(map(int,input().split()))
print(((A+B)%24)) | p03773 |
import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
from collections import Counter
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdi... | import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
from collections import Counter
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdi... | p02815 |
import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
from collections import Counter
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdi... | MOD = 10 ** 9 + 7
N = int(eval(input()))
C = list(sorted(map(int, input().split()), reverse=True))
ans = 0
pow_list = [1] * (N + 1)
for i in range(1, N + 1):
pow_list[i] = (2 * pow_list[i - 1]) % MOD
base = pow_list[N]
# 基本戦略:コストが一番高いものを一番最後に変更する
for i, c in enumerate(C):
now = pow_list[N - i - 1]... | p02815 |
import sys
sys.setrecursionlimit(10**6)
N = int(eval(input()))
C = list(map(int, input().split()))
C.sort()
MOD = 10**9 + 7
ans = 0
# どうも公式ドキュメントによると、組み込み関数のpowの第三引数に値渡すとMODとってくれるらしいので、完全に無駄
def pow_mod(x, n, mod):
if n == 0:
return 1 % mod
elif n % 2 == 0:
y = pow_mod(x, n//... | """
"""
import sys
sys.setrecursionlimit(10**6)
N = int(eval(input()))
C = list(map(int, input().split()))
C.sort()
MOD = 10**9 + 7
ans = 0
# どうも公式ドキュメントによると、組み込み関数のpowの第三引数に値渡すとMODとってくれるらしいので、完全に無駄
def pow_mod(x, n, mod):
if n == 0:
return 1 % mod
elif n % 2 == 0:
... | p02815 |
MOD = 1000000007
N = int(eval(input()))
C = list(map(int,input().split()))
C.sort(reverse=True)
ans = 0
if N > 1:
for i in range(N):
ans += C[i]*(2+i)*pow(2,N-2,MOD)*pow(2,N,MOD)
ans %= MOD
else:
ans = 2*C[0]%MOD
print(ans) | MOD = 1000000007
N = int(eval(input()))
C = list(map(int,input().split()))
C.sort(reverse=True)
ans = 0
for i in range(N):
ans += C[i]*(2+i)*pow(4,N-1,MOD)
ans %= MOD
print(ans) | p02815 |
MOD=10**9+7
N=int(eval(input()))
C=list(map(int, input().split()))
C.sort(reverse=True)
out=0
for i in range(N):
out+=(pow(2, N-1)+pow(2, N-2)*i)*C[i]
out%=MOD
out=out*pow(2, N, MOD)
print((int(out%MOD))) | MOD=10**9+7
N=int(eval(input()))
if N==1:
C=int(eval(input()))
print((2*C%MOD))
exit()
C=list(map(int, input().split()))
C.sort(reverse=True)
out=0
tmp1=pow(2, N-1, MOD)
tmp2=pow(2, N-2, MOD)
for i in range(N):
out+=(tmp1+tmp2*i)*C[i]
out%=MOD
out=out*pow(2, N, MOD)
print((int(out%MOD))) | p02815 |
n = int(eval(input()))
a = list(map(int,input().split()))
a.sort(reverse=True)
mod = 10 ** 9 + 7
ans = 1
for _ in range(n):
ans *= 2
cef = [ans//2]
for i in range(n-1):
tmp = cef[-1] + ans // 4
tmp %= mod
cef.append(tmp)
son = 0
for i in range(n):
son += cef[i] * a[i]
son %= mod
ans *= son
... | n = int(eval(input()))
a = list(map(int,input().split()))
a.sort(reverse=True)
mod = 10 ** 9 + 7
ans = 1
for _ in range(2*n-2):
ans *= 2
ans %= mod
cef = [i+2 for i in range(n)]
for i in range(n):
a[i] *= cef[i]
ans *= sum(a)
ans %= mod
print(ans) | p02815 |
number=10**9+7
n=int(eval(input()))
c=list(map(int, input().split()))
c.sort(reverse=True)
sum=0
for i in range(1, n+1):
sum=(sum+(4**(n-1))*(i+1)*c[i-1])%number
print(sum)
|
number=10**9+7
n=int(eval(input()))
c=list(map(int, input().split()))
c.sort(reverse=True)
sum=0
for i in range(1, n+1):
sum=(sum+(pow(4, (n-1), number))*(i+1)*c[i-1])%number
print(sum)
| p02815 |
mod=10**9+7
n=int(eval(input()))
arr=list(map(int,input().split()))
arr=sorted(arr)
ans=0
for i in range(n):
ans+=pow(2,2*n-2,mod)*(n-i+1)*arr[i]
ans%=mod
print((int(ans))) | mod=10**9+7
n=int(eval(input()))
arr=list(map(int,input().split()))
arr=sorted(arr)
ans=0
total=pow(2,2*n-2,mod)
for i in range(n):
ans+=total*(n-i+1)*arr[i]
ans%=mod
print((int(ans)))
| p02815 |
import sys
n = int(eval(input()))
c_ls = [int(i) for i in sys.stdin.readline().split()]
c_ls.sort(reverse=True)
MOD = 10 ** 9 + 7
res = 0
for i, c in enumerate(c_ls):
res += (2 ** (n - 2) * (i + 2)) * c % MOD
res %= MOD
res = res * (2 ** n) % MOD
print((int(res))) | import sys
n = int(eval(input()))
c_ls = [int(i) for i in sys.stdin.readline().split()]
c_ls.sort(reverse=True)
MOD = 10 ** 9 + 7
res = 0
for i, c in enumerate(c_ls):
res += (i + 2) * c % MOD
res %= MOD
res = res * (4 ** (n - 1)) % MOD
print((int(res))) | p02815 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | p02815 |
MOD = 10**9+7
n = int(eval(input()))
c = list(map(int, input().split()))
c.sort(reverse=True)
cnt = 0
pt = [2**i for i in range(n+1)]
for i, x in enumerate(c):
r = n-i-1
cnt += (pt[i] + (0 if i <= 0 else pt[i-1]) * i) * pt[r] * x
cnt %= MOD
print((cnt * (pt[n] % MOD) % MOD))
| MOD = 10**9+7
n = int(eval(input()))
c = list(map(int, input().split()))
c.sort(reverse=True)
cnt = 0
a, b = 2**(n-1), 0 if n <= 1 else 2**(n-2)
for i, x in enumerate(c):
cnt += (a + b*i) * x
print((cnt * (2 ** n % MOD) % MOD))
| p02815 |
MOD = 10 ** 9 + 7
N = int(eval(input()))
C = list(map(int, input().split()))
C.sort()
if N == 1:
print((2 * C[0] % MOD))
exit()
lst = [0] * (N + 3)
lst[0] = 1
for i in range(1, N + 3):
lst[i] = (lst[i - 1] * 2) % MOD
ANS = 0
for i, c in enumerate(C):
ANS += c * (N + 1 - i)
ANS ... | MOD = 10 ** 9 + 7
N = int(eval(input()))
C = list(map(int, input().split()))
C.sort()
if N == 1:
print((2 * C[0] % MOD))
exit()
ANS = 0
for i, c in enumerate(C):
ANS += c * (N + 1 - i)
ANS *= pow(2, N - 2, MOD)
ANS %= MOD
ANS *= pow(2, N, MOD)
print((ANS % MOD)) | p02815 |
N = int(eval(input()))
C = list(map(int, input().split()))
MOD = 10 ** 9 + 7
C.sort()
C = C[::-1]
a0 = 2 ** (N - 1)
d = 2 ** (N - 2)
answer = 0
for i in range(N):
answer = (answer + (a0 + d * i) * C[i]) % MOD
answer = (answer * pow(2, N, MOD)) % MOD
print((int(answer))) | N = int(eval(input()))
C = list(map(int, input().split()))
MOD = 10 ** 9 + 7
C.sort()
C = C[::-1]
a0 = pow(2, N - 1, MOD)
d = pow(2, N - 2, MOD) if N - 2 >= 0 else 0
answer = 0
for i in range(N):
answer = (answer + (a0 + d * i) * C[i]) % MOD
answer = (answer * pow(2, N, MOD)) % MOD
print((int(answer)... | p02815 |
MOD = 10**9 + 7
N = int(eval(input()))
Cs = list(map(int, input().split()))
As = [1]
accA = 1
m = 2
for i in range(1, N):
A = (accA + m) % MOD
As.append(A)
accA = (accA + A) % MOD
m = m * 2 % MOD
m = 1
for i in reversed(list(range(N))):
As[i] = As[i] * m % MOD
m = m * 2 % MOD... | MOD = 10**9 + 7
N = int(eval(input()))
Cs = list(map(int, input().split()))
Cs.sort(reverse=True)
pow2 = pow(2, 2*N-2, MOD)
ans = 0
for i, C in enumerate(Cs, start=1):
ans += C*(i+1)*pow2
ans %= MOD
print(ans)
| p02815 |
class cmbs(object):
def __init__(self, mod):
self.mod = mod
self.g1 = [1, 1]
self.g2 = [1, 1]
inverse = [0, 1]
for i in range(2, 10 ** 6 + 1):
self.g1.append((self.g1[-1] * i) % mod)
inverse.append((-inverse[mod % i] * (mod // i)) % mod)
... | class cmbs(object):
def __init__(self, mod):
self.mod = mod
self.g1 = [1, 1]
self.g2 = [1, 1]
inverse = [0, 1]
for i in range(2, 10 ** 6 + 1):
self.g1.append((self.g1[-1] * i) % mod)
inverse.append((-inverse[mod % i] * (mod // i)) % mod)
... | p02815 |
n = int(eval(input()))
C = list(map(int, input().split()))
mod = 10**9 + 7
if n == 1:
ans = 2 * C[0]
ans %= mod
print(ans)
exit()
ans = 0
pattern = 2 ** (n-1)
C.sort(reverse=True)
for c in C:
ans += (c * pattern) % mod
pattern += 2 ** (n-2)
pattern %= mod
ans %= mo... | n = int(eval(input()))
C = list(map(int, input().split()))
mod = 10**9 + 7
if n == 1:
ans = 2 * C[0]
ans %= mod
print(ans)
exit()
ans = 0
pattern = 2 ** (n-1) % mod
d = 2 ** (n-2) % mod
C.sort(reverse=True)
for c in C:
ans += (c * pattern) % mod
pattern += d
pattern %=... | p02815 |
import os
import sys
# from libs.debug import debug
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
N = int(sys.stdin.buffer.readline())
C = list(map(int, sys.stdin.buffer.readline().sp... | import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
N = int(sys.stdin.buffer.readline())
C = list(map(int, sys.stdin.buffer.readline().split()))
C.sort(reverse=True)
a... | p02815 |
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7 #出力の制限
N = 10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.ap... | N,*C = list(map(int, open(0).read().split()))
MOD = 10**9+7
p2 = [1]*(2*N+1)
for i in range(1,2*N+1):
p2[i] = p2[i-1]*2%MOD
C.sort()
ans = 0
for i,c in enumerate(C):
n = N-1-i
ans += c*(n*p2[n-1]+p2[n])*p2[N+i]%MOD
print((ans%MOD)) | p02815 |
N=int(eval(input()))
C=list(map(int,input().split()))
C.sort()
mod=10**9+7
ans=0
for i in range(N):
ans+=C[i]*(N-i+1)
ans%=mod
p=pow(4,N-1,mod)
print(((ans*p)%mod))
| import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
"""
Sは全部0と仮定して良い，最後に2^N倍
Cはソートしておく，後ろから使う．
iは0indexとする
各C[i]ごとに見るか，そうしたら，それが何番目かによって寄与が決まる
i桁目なので左にi桁あるけど，これは通り数にしか関与しない
右側にN-i-1(=a... | p02815 |
import sys
import math
from collections import defaultdict
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def II(): return list(map(int, input().split()))
def III(): return list(map(int, input().split()))
def Line(N,num):... | import sys
import math
from collections import defaultdict
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def II(): return list(map(int, input().split()))
def III(): return list(map(int, input().split()))
def Line(N,num):... | p02815 |
N = int(eval(input()))
C = [int(i) for i in input().split()]
mod = 10 ** 9 + 7
C.sort()
ret = 0
for i in range(N) :
rest = N - i - 1
if rest == 0 :
ret += C[i] * pow(4, i, mod) * pow(2, N - i, mod) * pow(2, rest, mod) % mod
else :
ret += C[i] * pow(4, i, mod) * pow(2, N - i, mod) * (rest + 2... | N = int(eval(input()))
C = [int(i) for i in input().split()]
mod = 10 ** 9 + 7
C.sort()
ret = 0
P = pow(4, N - 1, mod)
for i in range(N) :
ret += C[i] * P * (N - i + 1) % mod
ret %= mod
print(ret) | p02815 |
import itertools
num = int(eval(input()))
l = list(map(int, input().split()))
total = 0
for i in range(1, num+1):
for diff_num in itertools.combinations(l, i):
diff_num = sorted(list(diff_num))
for j in range(len(diff_num)):
total += diff_num[j] * (len(diff_num) - j)
total... | # coding: utf-8
# Your code here!
num = int(eval(input()))
costs = sorted(list(map(int, input().split())), reverse = True)
total = 0
for i in range(1, num+1):
total += (i + 1) * costs[i-1]
ans = (total * (4 ** (num - 1))) % (10 ** 9 + 7)
print(ans) | p02815 |
def main():
n=int(eval(input()))
a=list(map(int,input().split()))
mod=10**9+7
if n==1:
print((2*a[0]%mod))
return
a.sort(key=lambda x:-x)
mod=10**9+7
ans=0
for i in range(n):
ans=(ans+pow(2,n-2,mod)*a[i]*(i+2))%mod
ans=ans*pow(2,n,mod)%mod
pri... | def main():
n=int(eval(input()))
a=list(map(int,input().split()))
mod=10**9+7
if n==1:
print((2*a[0]%mod))
return
a.sort(key=lambda x:-x)
mod=10**9+7
ans=sum([a[i]*(i+2)%mod for i in range(n)])
ans=ans*pow(2,n,mod)*pow(2,n-2,mod)%mod
print(ans)
main() | p02815 |
MOD = 10**9 + 7
n = int(eval(input()))
c = list(map(int, input().split()))
c.sort()
if n > 1:
ans = 0
for i in range(n):
m = (1 << (n - 1)) + (1 << (n - 2)) * (n - 1 - i)
ans += c[i] * m
ans %= MOD
for i in range(n):
ans *= 2
ans %= MOD
else:
ans... | MOD = 10**9 + 7
n = int(eval(input()))
c = list(map(int, input().split()))
c.sort()
if n > 1:
ans = 0
x = (1 << (n - 1)) % MOD
y = (1 << (n - 2)) % MOD
for i in range(n):
m = x + (y * (n - 1 - i)) % MOD
m %= MOD
ans += c[i] * m
ans %= MOD
for i in ran... | p02815 |
from math import factorial
N = int(eval(input()))
C = list(map(int, input().split()))
C.sort()
MOD = 1000000007
ans = 0
if N == 1:
ans = C[0]*2 % MOD
else:
for i in range(N):
for j in range(i,N):
ans = (ans + 2**(i+N)*(N-j)*C[i]*factorial(N-i-1)//(factorial(N-j-1)*factorial(j-i))) % MOD
prin... | n = int(eval(input()))
c = list(map(int, input().split()))
c.sort()
MOD = 1000000007
ans = 0
P = pow(4, n-1, MOD)
if n == 1:
ans = c[0]*2 % MOD
else:
for i in range(n):
ans += P*c[i]*(n+1-i)
ans %= MOD
print(ans) | p02815 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
a = a[::-1]
M = 10**9+7
ans = 0
ans += a[0]*(pow(2, 0, M))*pow(2, n-1,M)
for i in range(1,n):
... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(eval(input()))
a = list(map(int, input().split()))
M = 10**9+7
pp = [None]*n
v = 1
for i in range(n):
pp[i] = v
v *= 2
v %= M
a.sort()
a ... | p02815 |
N=int(eval(input()))
c=sorted([int(i) for i in input().split()])
mod=10**9+7
ans=0
for i in range(N):
ans+=(c[i]*(((N-i+1)*pow(2,(N-2)%(mod-1),mod))%mod))%mod
ans%=mod
print(((ans*pow(2,N,mod))%mod)) | N=int(eval(input()))
c=list(map(int,input().split()))
c.sort()
m=10**9+7
ans=0
for i in range(N):
ans+=(c[i]*(N-i+1)*pow(2,(N-2)%(m-1),m))%m
print(((ans*pow(2,N,m))%m)) | p02815 |
N=int(eval(input()))
c=list(map(int,input().split()))
c.sort()
m=10**9+7
ans=0
for i in range(N):
ans+=(c[i]*(N-i+1)*pow(2,(N-2)%(m-1),m))%m
print(((ans*pow(2,N,m))%m)) | N=int(eval(input()));c=sorted(list(map(int,input().split())));m=10**9+7;ans=0
for i in range(N):ans+=c[i]*(N-i+1)*pow(2,2*N-2,m)
print((ans%m)) | p02815 |
# 解説放送を見た
# https://youtu.be/9MphwmIsO7Q?t=5738
def main():
mod = 10 ** 9 + 7
n = int(eval(input()))
*c, = list(map(int, input().split()))
c.sort()
pw = [1 << j for j in range(n + 1)]
ret = 0
for l, x in enumerate(c):
r = n - 1 - l # lxr
ret = (ret + x *... | # 解説放送を見た
# https://youtu.be/9MphwmIsO7Q?t=5738
def main():
mod = 10 ** 9 + 7
n = int(eval(input()))
*c, = list(map(int, input().split()))
c.sort()
pw = [1]
t = 1
for _ in range(n):
t = t * 2 % mod
pw.append(t)
ret = 0
for l, x in enumerate(c):
... | p02815 |
def resolve():
MOD = 10 ** 9 + 7
N = int(eval(input()))
C = sorted(map(int, input().split()))
P = [1] * (N + 1)
for i in range(N):
P[i + 1] *= P[i] * 2
ans = 0
for i in range(N):
# 各ビットの係数: (2^r + 2^r-1 * r) * 2^l
l, r = i, N - i - 1
now = P[r]
... |
def resolve():
MOD = 10 ** 9 + 7
N = int(eval(input()))
C = sorted(map(int, input().split()))
P = [1] * (N + 1)
for i in range(N):
P[i + 1] *= P[i] * 2
P[i + 1] %= MOD
ans = 0
for i in range(N):
# 各ビットの係数: (2^r + 2^r-1 * r) * 2^l
l, r = i, N - i -... | p02815 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [l... | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [l... | p02815 |
def solve():
ans = 0
N = int(eval(input()))
C = list(map(int, input().split()))
C.sort()
mod = 10**9+7
for i in range(N):
ans += C[i]*(N+1-i)
ans %= mod
ans = ans*pow(2,2*N-2,mod)%mod
return ans
print((solve())) | def solve():
ans = 0
N = int(eval(input()))
C = list(map(int, input().split()))
C.sort()
mod = 10**9+7
for i in range(N):
ans += C[i]*(N+1-i)
ans = ans*pow(2,2*N-2)%mod
return ans
print((solve())) | p02815 |
N = int(eval(input()))
c = list(map(int, input().split()))
c.sort(reverse = True)
mod = 10 ** 9 + 7
tmp = 2 ** (N - 1)
d = tmp // 2
ans = 0
for ci in c:
ans += (ci * tmp) % mod
ans %= mod
tmp = (tmp + d) % mod
print(((ans * 2 ** N) % mod))
| N = int(eval(input()))
c = list(map(int, input().split()))
c.sort(reverse = True)
mod = 10 ** 9 + 7
tmp = (2 ** (N - 1)) % mod
d = (2 ** (N - 2)) % mod
ans = 0
for ci in c:
ans += (ci * tmp) % mod
ans %= mod
tmp = (tmp + d) % mod
print(((ans * 2 ** N) % mod))
| p02815 |
MOD = 10 ** 9 + 7
def modFact(n):
global MOD
if n == 1:
return 1
else:
return (n * modFact(n - 1)) % MOD
def prepare(n):
global MOD
modFacts = [0] * (n + 1)
modFacts[0] = 1
for i in range(n):
modFacts[i + 1] = (modFacts[i] * (i + 1)) % MOD
i... | MOD = 10 ** 9 + 7
N = int(eval(input()))
C = list(map(int, input().split()))
C.sort(reverse=True)
mod4 = [0] * (N + 1)
mod4[0] = 1
for i in range(N):
mod4[i + 1] = (mod4[i] * 4) % MOD
ans = 0
N4 = mod4[N - 1]
for i, c in enumerate(C):
j = i + 1
ans += N4 * (j + 1) * c
ans %= MOD
... | p02815 |
import heapq
N = int(eval(input()))
C = list(map(int, input().split()))
ans = 0
if N != 1:
heapq.heapify(C)
for i in range(N):
c = heapq.heappop(C)
ans += c * (N + 1 - i) * (2 ** (N - 2))
ans %= 10 ** 9 + 7
ans *= 2 ** N
else:
ans = C[0] * 2
ans %= 10 ** 9 + ... | N = int(eval(input()))
C = list(map(int, input().split()))
C.sort()
ans = 0
mod = 10 ** 9 + 7
pattern = (2 ** (N - 2)) % mod
if N != 1:
for i in range(N):
c = C[i]
ans += c * (N + 1 - i) * pattern
ans %= mod
ans *= 2 ** N
else:
ans = C[0] * 2
ans %= mod
p... | p02815 |
#E
n=int(eval(input()))
C=sorted(list(map(int,input().split())))
mod=10**9+7
sum=0
for i in range(n):
l=i #その桁より左側の桁数(関係ないやつ)
r=n-i #その桁より右側の個数(その桁自身も含む、1の個数を数えるやつ)
if r==1:
ans=2**l%mod
ans=ans*C[i]%mod
sum=(sum+ans)%mod
else:
ans=2**(r-1)%mod
ans=(... | #E
n=int(eval(input()))
C=sorted(list(map(int,input().split())))
mod=10**9+7
pow2=[1]
for i in range(n+5): #2の累乗(mod 10**9+7)のテーブル作成
pow2.append(pow2[i]*2%mod)
sum=0
for i in range(n):
l=i #その桁より左側の桁数(関係ないやつ)
r=n-i #その桁より右側の個数(その桁自身も含む、1の個数を数えるやつ)
if r==1:
ans=pow2[l]
an... | p02815 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import heapq
mod = 10**9+7
n, *clst = list(map(int, read().split()))
if n == 1:
print((2*clst[0] % mod))
quit()
heapq.heapify(clst)
res=0
q=2**(n-1)+(n-1)*2**(n-2)
for i in range(n):
h... | import sys
read = sys.stdin.buffer.read
mod=10**9+7
n, *clst = list(map(int, read().split()))
if n == 1:
print((clst[0]*2%mod))
quit()
clst.sort(reverse=True)
res=sum(i*item for i, item in enumerate(clst,2))
print(((4**(n-1)*res)%mod)) | p02815 |
n = int(eval(input()))
c = list(map(int,input().split()))
mod = 10**9+7
c.sort()
ans = 0
for i in range(n):
ans += c[i]*(2+n-1-i)*4**(n-1)
ans %= mod
ans %= mod
print(ans) | n = int(eval(input()))
c = list(map(int,input().split()))
mod = 10**9+7
c.sort()
ans = 0
for i in range(n):
ans += c[i]*(2+n-1-i)*pow(4,n-1,mod)
ans %= mod
ans %= mod
print(ans) | p02815 |
n = int(eval(input()))
c = sorted([int(_) for _ in input().split()])
mod = 10**9 + 7
ans = 0
for i in range(n):
ans += c[i] * 2**(2 * n - 2) * (n - i + 1)
ans %= mod
print(ans)
| n = int(eval(input()))
c = sorted([int(_) for _ in input().split()])
mod = 10**9 + 7
ans = 0
for i in range(n):
ans += c[i] * pow(2, 2 * n - 2, mod) * (n - i + 1)
ans %= mod
print(ans)
| p02815 |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush... | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush... | p02815 |
MOD=10**9+7
N=int(eval(input()))
C=sorted(map(int,input().split()))
p=pow(4,N-1,MOD)
ans=0
for i in range(N):
res=p*C[i]*(N-i+1)
ans=(ans+res)%MOD
print(ans) | M=10**9+7
N=int(eval(input()))
print((pow(4,N-1,M)*sum([C*(N-i+1)%M for i,C in enumerate(sorted(map(int,input().split())))])%M)) | p02815 |
def slove():
import sys
input = sys.stdin.readline
ls = list("CODEFESTIVAL2016")
s = str(input().rstrip('\n'))
cnt = 0
for i in range(len(s)):
if ls[i] != s[i]:
cnt += 1
print(cnt)
if __name__ == '__main__':
slove()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
s = str(readline().rstrip().decode('utf-8'))
cs = "CODEFESTIVAL2016"
cnt = 0
for i in range(len(cs)):
if s[i] != cs[i]:
cnt += 1
print(cnt)
if __name__ == '__main__':
so... | p03970 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
"""
逆再生。長さL以上になるものをくっつけられる。
一度L以上になったらそこだけ見ていけばよい
"""
N,L = list(map(int,input().split()))
A = [int(x) for x in input().split()]
A2 = [x+y for x,y in zip(A,A[1:])]
M = max(A2)
i = A2.index(M)
if M < L:
answer = ['Impossible']
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import itertools
# 和がL以上の2つをつなぐ
# 和がL以上のものが1つ作れたら、その周辺だけ処理していけばよい
N,L,*A = list(map(int,read().split()))
S = [0] + [x+y for x,y in zip(A,A[1:])]
M = max(S)
i = S.index(M)
if M < L:
... | p04035 |
import heapq
N, K = map(int, input().split())
A = list(map(int, input().split()))
knot = []
for i in range(N - 1):
heapq.heappush(knot, (-A[i]-A[i+1], i))
ans = []
seen = [False]*N
while knot:
L, i = heapq.heappop(knot)
L = -L
if seen[i]:
continue
if L < K:
break
... |
def know(N, K, A):
isOK = False
for i in range(1, N):
if A[i] + A[i - 1] >= K:
isOK = True
first = i
if not isOK:
return ["Impossible"]
ans = [first]
for i in range(first + 1, N):
ans.append(i)
for i in range(first - 1, 0, -1):
... | p04035 |
dp=[[1<<30 for _ in range(1001)] for _ in range(1001)]
dp[0][0]=0
n,m=list(map(int,input().split()))
d=[int(eval(input())) for _ in range(n)]+[0]
c=[int(eval(input())) for _ in range(m)]+[0]
for i in range(m):
for j in range(n+1):
if dp[i][j]< dp[i+1][j]:dp[i+1][j]=dp[i][j]
e=d[j]*c[i]
... | dp=[[1<<30 for _ in range(1001)] for _ in range(1001)]
dp[0][0]=0
n,m=list(map(int,input().split()))
d=[int(eval(input())) for _ in range(n)]+[0]
c=[int(eval(input())) for _ in range(m)]+[0]
for i in range(m):
for j in range(n+1):
if dp[i][j]< dp[i+1][j]:dp[i+1][j]=dp[i][j]
e=d[j]*c[i]
... | p00534 |
INF = 10 ** 20
n, m = list(map(int, input().split()))
dist = []
weth = []
for _ in range(n):
dist.append(int(eval(input())))
for _ in range(m):
weth.append(int(eval(input())))
dp = [INF] * (n + 1)
dp[0] = 0
for i in range(m):
for j in range(n, 0, -1):
dp[j] = min(dp[j], dp[j - 1] + dist[j - 1]... | INF = 10 ** 20
n, m = list(map(int, input().split()))
dist = [int(eval(input())) for _ in range(n)]
weth = [int(eval(input())) for _ in range(m)]
dp = [INF] * (n + 1)
dp[0] = 0
for i in range(m):
for j in range(n, 0, -1):
dp[j] = min(dp[j], dp[j - 1] + dist[j - 1] * weth[i])
print((dp[n]))
| p00534 |
while 1:
n,l = list(map(int,input().split()))
if n == 0: break
tube = [[] for i in range(l-1)]
for i in range(1,n+1):
d,p = input().split()
tube[int(p)-1].append(i if d == "R" else -i)
t = num = 0
while sum(len(ele) for ele in tube) != 0:
for s in [-1,1]:
... | while 1:
n,l = list(map(int,input().split()))
if n == 0: break
R = [0]*(l-1)
L = [0]*(l-1)
for i in range(1,n+1):
d,p = input().split()
p = int(p)-1
if d == "R": R[p] = i
else: L[p] = i
t = num = 0
while sum(R)+sum(L) != 0:
if R[-1] > 0: nu... | p00915 |
N, A, B = list(map(int, input().split()))
ans = 0
for i in range(N+1):
t_sum = 0
for e in str(i):
t_sum += int(e)
if A<= t_sum <= B:
ans += i
print(ans) | N, A, B = list(map(int, input().split()))
ans = 0
for i in range(1, N+1):
if A <= sum(int(x) for x in str(i)) <= B:
ans += i
print(ans) | p03478 |
a,b,c=list(map(int,input().split()))
count=0
for i in range(a+1):
A=list(str(i))
s=0
for k in range(len(A)):
s+=int(A[k])
if b<=s<=c:
count+=i
print(count)
| N, A, B = list(map(int, input().split()))
print((sum(i for i in range(1, N+1) if A <= sum(map(int, str(i))) <= B))) | p03478 |
n, a, b = list(map(int, input().split()))
ans = []
for i in range(1, n+1):
if a <= sum(map(int, list(str(i)))) <= b:
ans.append(i)
print((sum(ans))) | n, a, b = list(map(int, input().split()))
ans = 0
for i in range(1, n+1):
if a <= sum(map(int, list(str(i)))) <= b:
ans += i
print(ans) | p03478 |
N, A, B = list(map(int, input().split()))
res = 0
for i in range(N+1):
if A <= sum([int(s) for s in str(i)]) <= B:
res += i
print(res) | n,a,b = list(map(int,input().split()))
s = 0
for i in range(n+1):
if a <= sum([int(j) for j in str(i)]) <= b:
s += i
print(s) | p03478 |
n,a,b = list(map(int,input().split()))
ans = 0
for i in range(n+1):
keta_wa = 0
x = i
while x != 0:
keta_wa += int(x % 10)
x /= 10
#print(keta_wa,x)
if a <= keta_wa <= b:
ans += i
print(ans) | n,a,b = list(map(int,input().split()))
ans = 0
for i in range(n+1):
keta_wa = 0
x = i
while x != 0:
keta_wa += int(x % 10)
x = int(x /10)
#print(keta_wa,x)
if a <= keta_wa <= b:
ans += i
print(ans) | p03478 |
a, b, c = list(map(int, input().split()))
y = 0
for x in range(a):
if b <= sum(list(map(int, list(str(x+1))))) <= c:y += x + 1
print(y) | a, b, c = list(map(int, input().split()))
total = 0
for x in range(a+1):
z = x
d = 0
while z != 0:
d += z % 10
z = z // 10
if b <= d <= c:total += x
print(total)
| p03478 |
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n,a,b=list(map(int, input().split()))
l=[]
for i in range(1,n+1):
cnt=0
for j in range(len(str(i))):
cnt+=int(str(i)[j])
if a<=cnt<=b:
l.append(i)
print((sum(l)))
reso... |
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n,a,b=list(map(int, input().split()))
ans=0
for i in range(1,n+1):
cnt=0
for j in str(i):
cnt+=int(j)
if a<=cnt<=b:
ans+=i
print(ans)
resolve() | p03478 |
def FindSumOfDigits(n):
Sum=0
while(n>0):
Sum+=(int(n%10))
n=n/10
return Sum
N,A,B=list(map(int,input().split()))
ans=0
ans_list=[]
sumlist=[]
for i in range(1,N+1):
sumlist.append(FindSumOfDigits(i))
if A<=FindSumOfDigits(i)<=B:
ans+=i
ans_list.append... | def FindSumOfDigits(n):
Sum=0
while(n>0):
Sum+=(int(n%10))
n=n/10
return Sum
N,A,B=list(map(int,input().split()))
ans=0
#ans_list=[]
#sumlist=[]
for i in range(1,N+1):
#sumlist.append(FindSumOfDigits(i))
if A<=FindSumOfDigits(i)<=B:
ans+=i
#ans_list.ap... | p03478 |
def FindSumOfDigits(n):
Sum=0
while(n>0):
Sum+=(int(n%10))
n=n/10
return Sum
N,A,B=list(map(int,input().split()))
ans=0
#ans_list=[]
#sumlist=[]
for i in range(1,N+1):
#sumlist.append(FindSumOfDigits(i))
if A<=FindSumOfDigits(i)<=B:
ans+=i
#ans_list.ap... | N,A,B=list(map(int,input().split()))
cnt=0
for n in range(1,N+1):
total=0
total+=n%10
total+=int(n/10)%10
total+=int((n/10)/10)%10
total+=int(((n/10)/10)/10)%10
total+=int((((n/10)/10)/10)/10)%10
if A<=total<=B:
cnt+=n
print(cnt) | p03478 |
from functools import reduce
n,a,b = [int(x) for x in input().split(" ")]
ans = 0
for ni in range(a,n+1):
if ni <= 9 :
if a <= ni and ni <= b:
ans += ni
else:
add_each_dig = reduce(lambda x, y: int(x) + int(y), str(ni) )
if a <= add_each_dig and add_each_dig <= b... | from functools import reduce
n,a,b = [int(x) for x in input().split(" ")]
ans = 0
for ni in range(a,n+1):
add_each_dig = int(reduce(lambda x, y: int(x) + int(y), str(ni) ))
if a <= add_each_dig and add_each_dig <= b:
ans += ni
print(ans) | p03478 |
N, A, B = (int(x) for x in input().split())
Ans = [i if A <= sum(int(x) for x in list(str(i))) <= B else 0 for i in range(1,N+1)]
print((sum(Ans))) | def myfunc(A, B):
def resfunc(x):
if A <= sum(map(int,list(str(x)))) <=B:
return x
else:
return 0
return resfunc
N, A, B = list(map(int, input().split()))
print((sum(map(myfunc(A,B), list(range(1, N+1)))))) | p03478 |
N, A, B = list(map(int, input().split()))
res = 0
for i in range(N+1):
if A <= sum([int(s) for s in str(i)]) <= B:
res += i
print(res) | N, A, B = list(map(int, input().split()))
def keta_sum(x):
m = 0
while x:
m += x%10
x //= 10
return(m)
res = 0
for i in range(N+1):
if A <= keta_sum(i) <= B:
res += i
print(res) | p03478 |
# ABC083B - Some Sums
n, a, b = list(map(int, input().split()))
answer = 0
for i in range(n + 1):
total = sum(list(map(int, list(str(i)))))
if a <= total <= b:
answer += i
print(answer) | # ABC083B - Some Sums
n, a, b = list(map(int, input().rstrip().split()))
total = 0
for i in range(1, n + 1):
if a <= sum(list(map(int, list(str(i))))) <= b:
total += i
print(total) | p03478 |
n,a,b = list(map(int,input().split()))
ans = 0
for i in range(n+1):
c = sum(int(j) for j in str(i))
if c >= a and c <= b:
ans += i
print(ans) | n,a,b=list(map(int,input().split()))
ans=0
for i in range(1,n+1):
temp=0
for j in str(i):
temp+=int(j)
if temp>=a and temp<=b:
ans+=int(i)
print(ans) | p03478 |
def f(n):
return sum([int(i) for i in str(n)])
N, A, B = list(map(int, input().split()))
L = [f(i) for i in range(1, 1 + N)]
print((sum([i + 1 for i, l in enumerate(L) if A <= l <= B])))
| def f(n):
return sum([int(i) for i in str(n)])
N, A, B = list(map(int, input().split()))
print((sum([i for i in range(1, 1 + N) if A <= f(i) <= B])))
| p03478 |
n, a, b = list(map(int, input().split()))
result = 0
for i in range(1, n+1):
total = 0
t = i
for j in range(5):
total += t%10
t = t // 10
if a <= total <= b:
result += i
print(result)
| n, a, b = list(map(int, input().split()))
total = 0
for i in range(1, n+1):
n = i
tmp = 0
while(n > 0):
tmp += n % 10
n = n // 10
if a <= tmp <= b:
total += i
print(total) | p03478 |
N,A,B = list(map(int, input().split()))
s = 0
for i in range(1,N+1):
if A<=sum(map(int, str(i)))<=B:
s+=i
print(s) | N,A,B = list(map(int, input().split()))
print((sum(i for i in range(1,N+1) if A<=sum(map(int, str(i)))<=B))) | p03478 |
import functools
n = list(map(int,input().split()))
ans = 0
for i in range(n[0]+1):
s = list(map(int,str(i)))
sum = functools.reduce(lambda a,b: a+b, s)
if n[1]<= sum and sum <= n[2]:
ans+=i
print(ans) | from functools import reduce
n = list(map(int,input().split()))
ans = 0
for i in range(n[0]+1):
s = list(map(int,str(i)))
sum = reduce(lambda a,b: a+b, s)
if n[1]<= sum and sum <= n[2]:
ans+=i
print(ans) | p03478 |
n, a, b = list(map(int, input().split()))
s = [0]*5
ans = 0
for i in range(n+1):
s[0] = i // 10000
s[1] = (i % 10000) // 1000
s[2] = (i % 1000) // 100
s[3] = (i % 100) // 10
s[4] = (i % 10) // 1
temp = s[0]*10000+s[1]*1000+s[2]*100+s[3]*10+s[4]
if a <= sum(s) and sum(s) <= b:
... | def sum_digits(n):
sum = 0
while n > 0:
sum += n % 10
n = n // 10
return sum
n, a, b = list(map(int, input().split()))
s = [0]*5
ans = 0
for i in range(n+1):
temp = sum_digits(i)
if a <= temp and temp <= b:
ans += i
print(ans) | p03478 |
def main():
n, a, b = list(map(int, input().split()))
sumv = 0
for x in range(a, n+1):
num = sum([int(i) for i in str(x)])
if num >= a and num <= b: sumv += x
print(sumv)
if __name__ == '__main__':
main() | def sum_digit(x):
sumv = 0
while x > 0:
t = x % 10
sumv += t
x = x // 10
return sumv
if __name__ == '__main__':
n, a, b = list(map(int, input().split()))
ans = 0
for num in range(a, n+1):
sumv = sum_digit(num)
if a <= sumv and sumv <= b:
... | p03478 |
N, A, B = list(map(int, input().split()))
ans = 0
for i in range(1, N + 1):
if A <= sum([int(c) for c in str(i)]) <= B:
ans += i
print(ans) | def digit_sum(x):
res = 0
while x != 0:
res += x%10
x //= 10
return res
[N,A,B] = list(map(int,input().split()))
ans = 0
for i in range(1,N+1):
if A <= digit_sum(i) <= B:
ans += i
print(ans)
| p03478 |
N, A, B = list(map(int, input().split()))
tot = 0
for i in range(1, N+1):
s = 0
for c in list(str(i)):
s += int(c)
if A<= s <=B:
tot += i
print(tot) | N, A, B = list(map(int, input().split()))
tot = 0
for i in range(1, N+1):
q = i
s = 0
while q > 0:
q, r = divmod(q, 10) #;print(i, q, r, s)
s += r
if A<= s <=B:
tot += i #;print(i)
print(tot) | p03478 |
def main():
N, A, B = list(map(int,input().split()))
#print('N:%d A:%d B: %d' % (N,A,B))
answer = []
for i in range(N+1):
s = sum( map(int,list(str(i)) )) # list of int -> sum
if s >= A and s <= B: answer.append(i)
#print('i:%d s:%d' % (i,s))
print((sum(answer)))
... | import sys
def main():
input = sys.stdin.readline()
N, A, B = list(map(int,input.split()))
#print('N:%d A:%d B: %d' % (N,A,B))
answer = []
for i in range(N+1):
s = sum( map(int,list(str(i)) )) # list of int -> sum
if s >= A and s <= B: answer.append(i)
#print('i:%... | p03478 |
x, min, max = input().rstrip().split()
digit = len(x)
ans = 0
i = int(x)
while i > 0:
num = sum(list(map(int, str(i))))
if int(min) <= num <=int(max):
ans += i
i = i - 1
print(ans)
| x, min, max = input().rstrip().split()
ans = 0
i = int(x)
while i > 0:
num = sum(list(map(int, str(i))))
if int(min) <= num <=int(max):
ans += i
i = i - 1
print(ans)
| p03478 |
x, min, max = input().rstrip().split()
ans = 0
for i in range(int(x) + 1):
if int(min) <= sum(map(int, str(i))) <=int(max):
ans += i
print(ans)
| x, min, max = list(map(int, input().split()))
ans = 0
for i in range(x+1):
if min <= sum(map(int, str(i))) <= max:
ans += i
print(ans)
| p03478 |
N, A, B = list(map(int, input().rstrip().split(' ')))
LIST_RESULT = []
for i in range(1, N+1):
str_i = str(i)
l = len(str_i)
sum_tmp = 0
for x in range(l):
sum_tmp += int(str_i[x])
if A <= sum_tmp and sum_tmp <= B:
LIST_RESULT.append(i)
sum_result = sum(LIST_RESULT)... | # coding: utf-8
"""this is python work script"""
def solve(N, A, B):
LIST_RESULT = []
for i in range(1, N + 1):
str_i = str(i)
l = len(str_i)
sum_tmp = 0
for x in range(l):
sum_tmp += int(str_i[x])
if A <= sum_tmp and sum_tmp <= B:
LIS... | p03478 |
# coding: utf-8
"""this is python work script"""
def solve(N, A, B):
LIST_RESULT = []
for i in range(1, N + 1):
str_i = str(i)
l = len(str_i)
sum_tmp = 0
for x in range(l):
sum_tmp += int(str_i[x])
if A <= sum_tmp and sum_tmp <= B:
LIS... | # coding: utf-8
"""this is python work script"""
def sum_num(i):
sum_tmp = 0
p = i
for _ in range(5):
p, mod = divmod(p, 10)
sum_tmp += mod
if p == 0:
break
return sum_tmp
def solve(N, num_min, num_max):
"""solve problem"""
result = 0
for i ... | p03478 |
n, a, b = list(map(int,input().split()))
ans = 0
for i in range(1, n + 1):
if a <= sum(list(map(int, list(str(i))))) <= b:
ans += i
print(ans)
| n, a, b = list(map(int,input().split()))
ans = 0
for i in range(1, n + 1):
sum = 0
j = i
while j != 0:
sum += j % 10
j = j // 10
if a <= sum <= b:
ans += i
print(ans)
| p03478 |
# Problem: https://atcoder.jp/contests/abc083/tasks/abc083_b
# Python 1st Try
import sys
# from collections import defaultdict
# import heapq,copy
# from collections import deque
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(i... | # Problem: https://atcoder.jp/contests/abc083/tasks/abc083_b
# Python 2nd Try
import sys
# from collections import defaultdict
# import heapq,copy
# from collections import deque
intm1 = lambda x: int(x) - 1
intp1 = lambda x: int(x) + 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readl... | p03478 |
n_a_b = list(map(int,input().split()))
ans = 0
plus = 0
for i in range(0,n_a_b[0]+1,1):
num = i
for j in range(5):
plus = plus + num % 10
num = int(num /10)
if i < 0:
break
if n_a_b[1] <= plus and plus <= n_a_b[2]:
ans = ans + i
plus = 0
... | n_a_b = list(map(int,input().split()))
ans = 0
plus = 0
for i in range(0,n_a_b[0]+1,1):
num = i
for j in range(5):
plus = plus + num % 10
num = int(num /10)
if n_a_b[1] <= plus and plus <= n_a_b[2]:
ans = ans + i
plus = 0
print(ans) | p03478 |
n, a, b = list(map(int, input().split()))
digit_sum_sum = 0
for num in range(1,n+1):
digit_sum = 0
for i in str(num):
digit_sum += int(i)
if a <= digit_sum <= b:
digit_sum_sum += num
print(digit_sum_sum)
| n,a,b = list(map(str,input().split()))
# al = list(map(int,input().split()))
a = int(a)
b = int(b)
lst = []
for x in range(1,int(n)+1):
total = 0
for i in str(x):
total += int(i)
if a <= total <= b:
lst.append(x)
print((sum(lst))) | p03478 |
N, A, B = list(map(int, input().split()))
ans = 0
for i in range(1, N+1):
x = (sum(list(map(int, list(str(i))))))
if A <= x <= B:
ans += i
print(ans) | N, A, B = list(map(int, input().split()))
ans = 0
def sumDigits(n):
sum = 0
while n != 0:
sum += n % 10
n = n // 10
return sum
for i in range(N+1):
x = sumDigits(i)
if A <= x <= B:
ans += i
print(ans) | p03478 |
N, A, B = list(map(int, input().split()))
m = 0
for n in range(1, N + 1):
C = []
n1 = n
for k in range(4, -1, -1):
C.append(int(n1 / (10 ** k)))
n1 -= C[4 - k] * (10 ** k)
if A <= sum(C) <= B:
m += n
print(m)
| n, a, b = list(map(int, input().split()))
ans = 0
for k in range(1, n+1):
if a <= sum(map(int, str(k))) <= b:
ans += k
print(ans)
| p03478 |
N, A, B = list(map(int, input().split()))
n = []
for i in range(1, N+1):
a = 0
for x in range(len(str(i))):
a += int(str(i)[x])
if a >= A and a <= B:
n.append(i)
print((sum(n))) | N, A, B = list(map(int, input().split()))
ans = 0
for i in range(1, N+1):
a = list(str(i))
c = 0
for j in range(len(a)):
c += int(a[j])
if A <= c <= B:
ans += i
print(ans)
| p03478 |
n,a,b=list(map(int,input().split()))
ans=0
for i in range(1,n+1):
if a<=sum(map(int,list(str(i))))<=b:
ans+=i
print(ans) | n,a,b=list(map(int,input().split()))
print((sum(i for i in range(n+1) if a<=sum(map(int,str(i)))<=b))) | p03478 |
N, A, B = list(map(int, input().split()))
ans = 0
for i in range(N+1):
lis = [int(i) for i in str(i)]
if A <= sum(lis) <= B:
num = ""
for j in lis:
num += str(j)
ans += int(num)
print(ans) | N, A, B = list(map(int, input().split()))
ans = 0
for i in range(1,N+1):
if A <= sum([int(x) for x in str(i)]) <= B:
ans += i
print(ans) | p03478 |
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
def main():
n, a, b = (int(x) for x in sys.stdin.read().split())
total = 0
for i in range(1, n+1):
s = sum(list(int(x) for x in str(i)))
if a <= s <... | import sys
n, a, b = list(map(int, sys.stdin.readline().split()))
def main():
res = 0
for i in range(1, n+1):
s = sum([int(d) for d in str(i)])
if a <= s <= b:
res += i
return res
if __name__ == '__main__':
ans = main()
print(ans) | p03478 |
ans=0
n,a,b=list(map(int,input().split()))
for i in range(1,n+1):
s=list(str(i))
s1=list(map(int, list(s)))
tmp=sum(s1)
if a<=tmp<=b:
ans+=int("".join(s))
print(ans) | n,a,b=list(map(int,input().split()))
print((sum(i for i in range(n+1) if a<=sum(map(int,str(i)))<=b))) | p03478 |
n, a, b = list(map(int, input().split()))
ans = 0
for i in range(1, n + 1):
s = sum(list(map(int, list(str(i)))))
if a <= s and s <= b:
ans += i
print(ans)
| n, a, b = list(map(int, input().split()))
ans = 0
for i in range(1, n + 1):
j = i
d = 0
while j != 0:
d += j % 10
j //= 10
if a <= d and d <= b:
ans += i
print(ans) | p03478 |
n,a,b=list(map(int,input().split()))
ans = 0
l = list(range(1, n+1))
def digitSum(n):
# 数値を文字列に変換
s = str(n)
# １文字ずつ数値化し配列にする。
array = list(map(int, s))
# 合計値を返す
return sum(array)
# print(digitSum(123))
# => 6
# print(digitSum(35829))
# => 27
for i in l:
if a <= digitSum... | n, a, b = list(map(int, input().split()))
ans = 0
for i in range(1, n+1):
if a <= sum([int(c) for c in str(i)]) <= b:
ans += i
print(ans)
| p03478 |
length,mi,ma = list(map(int,input().split()))
summ = 0
for i in range(1,length + 1):
digits = len(str(i))
digits_summary = 0
for j in range(digits):
digits_summary += int(str(i)[j])
if mi<=digits_summary and digits_summary<=ma:
summ += i
else:
pass
print(summ) | length,mi,ma = list(map(int,input().split()))
summ = 0
for i in range(1,length + 1):
s = str(i)
arr = list(map(int,s))
su = sum(arr)
if(su <= ma and su >= mi):
summ += i
print(summ)
| p03478 |
import math
n, a, b = list(map(int, input().split()))
sum_all = 0
for i in range(1, n + 1):
sum_n = 0
m = i
while(m > 0):
sum_n += math.floor(m % 10)
m /= 10
if a <= sum_n <= b:
sum_all += i
print(sum_all) | n, a, b = list(map(int, input().split()))
sum_all = 0
for i in range(1, n + 1):
m = str(i)
sum_m = 0
for j in range(len(m)):
sum_m += int(m[j])
if a <= sum_m <= b:
sum_all += i
print(sum_all) | p03478 |
N,A,B=list(map(int,input().split()))
def add(n,a,b):
res=sum(map(int,list(str(n))))
return n if res>=a and res<=b else 0
ans=0
for i in range(1,N+1):
ans+=add(i,A,B)
print(ans) | N, A, B = list(map(int, input().split()))
def digit_sum(n):
res = 0
while n:
res += n % 10
n //= 10
return res
answer = 0
for i in range(1, N + 1):
if A <= digit_sum(i) <= B:
answer += i
print(answer) | p03478 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.