input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
k,s = list(map(int,input().split()))
cnt = 0
for x in range(k+1):
for y in range(k+1):
if s-(x+y) >=0 and s-(x+y) <= k:
cnt += 1
print(cnt) |
k,s = list(map(int,input().split()))
def est():
cnt = 0
for x in range(k+1):
for y in range(k+1):
if s-(x+y) >=0 and s-(x+y) <= k:
cnt += 1
return cnt
print((est())) | p03835 |
k,s = list(map(int,input().split()))
#x + y + z = s z < k
counter = 0
for i in range(k + 1):
if i > s:
break
for j in range(k + 1):
if i + j > s :
break
z = s - i - j
if 0 <= z and z <= k:
counter += 1
print(counter)
| k,s = list(map(int,input().split()))
#x + y + z = s z < k
counter = 0
for i in range(k + 1):
for j in range(k + 1):
z = s - i - j
if 0 <= z and z <= k:
counter += 1
print(counter)
| p03835 |
# https://atcoder.jp/contests/abc051/tasks/abc051_b
# n n,
K, S = list(map(int, input().split()))
# initialize
ans = 0
# logic: 全探索: 基本形
for i in range(K + 1):
if i + K + 1 + K + 1 < S:
continue
for j in range(K + 1):
if i + j + K + 1 < S:
continue
if 0 <= S - i - j <= K:
ans += 1
print(ans)
| k,s=list(map(int,input().split()))
count=0
for a in range(k+1):
for b in range(k+1):
if 0<=s-a-b<=k:
count+=1
print(count) | p03835 |
# n n,
k, s = list(map(int, input().split()))
# initialize
ans = 0
# logic: 全探索: 基本形
for i in range(k + 1):
for j in range(k + 1):
if 0 <= s - i - j <= k:
ans += 1
print(ans)
| # https://atcoder.jp/contests/abc051/tasks/abc051_b
# n n,
k, s = list(map(int, input().split()))
# initialize
ans = 0
# logic: 全探索: 基本形
for i in range(k + 1):
for j in range(k + 1):
if 0 <= s - i - j <= k:
ans += 1
print(ans)
| p03835 |
K,S = list(map(int,input().split()))
count = 0
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):
if i+j+k == S:
count+=1
print(count) | K, S = list(map(int, input().split()))
count = 0
for X in range(K+1):
for Y in range(K+1):
if 0 <= S-X-Y <= K:
count += 1
print(count) | p03835 |
k, s = list(map(int, input().split()))
ans = 0
for x in range(min(s, k) + 1):
for y in range(min(s-x, k) + 1):
for z in range(min(s-x-y, k) + 1):
if x + y + z == s:
ans += 1
else:
print(ans) | k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
for y in range(k+1):
z = s - x - y
if 0 <= z <= k:
ans += 1
else:
print(ans) | p03835 |
K, S = list(map(int, input().split()))
answer = 0
for x in range(K+1):
for y in range(K+1):
if S - x - y <= K and S -x-y >=0:
answer += 1
print(answer) | k, s = list(map(int, input().split()))
count = 0
for x in range(k+1):
for y in range(k+1):
if 0 <= s - x - y <= k:
count += 1
print(count)
| p03835 |
k, s = list(map(int, input().split()))
c = 0
for x in range(k+1):
for y in range(x, k+1):
for z in range(y, k+1):
if x+y+z == s:
if x == y == z:
c += 1
elif x == y or y == z:
c += 3
else:
c += 6
print(c) | k, s = list(map(int, input().split()))
c = 0
for x in range(k+1):
for y in range(x, k+1):
z = s-x-y
if y <= z <= k:
if x == y == z:
c += 1
elif x == y or y == z:
c += 3
else:
c += 6
print(c) | p03835 |
K , S = list(map(int , input().split()))
count = 0
for i in range(0 , K + 1):
for j in range(0 , K + 1):
for k in range(0 , K + 1):
if i + j + k == S:
count += 1
print(count)
| K , S = list(map(int,input().split()))
cnt = 0
for x in range(K + 1):
for y in range(K + 1):
if x + y > S:
continue
z = S - x - y
if z <= K:
cnt += 1
print(cnt) | p03835 |
K , S = list(map(int,input().split()))
cnt = 0
for x in range(K + 1):
for y in range(K + 1):
if x + y > S:
continue
z = S - x - y
if z <= K:
cnt += 1
print(cnt) | K , S = list(map(int,input().split()))
ans = 0
for i in range(K + 1):
for j in range(K + 1):
k = S - i - j
if K >= k >= 0:
ans += 1
print(ans)
| p03835 |
K, S = list(map(int, input().split()))
counter = 0
for h in range(K + 1):
for i in range(K + 1):
for j in range(K + 1):
if h + i + j == S:
counter += 1
print(counter) | K, S = list(map(int, input().split()))
counter = 0
for h in range(K + 1):
for i in range(K + 1):
j = S - h - i
if j <= K and j >= 0:
counter += 1
print(counter) | p03835 |
K, S = list(map(int, input().split()))
ans = 0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
if x+y+z == S:
ans += 1
print(ans)
| K, S = list(map(int, input().split()))
ans = 0
for x in range(K+1):
for y in range(K+1):
z = S - x - y
if 0 <= z and z <= K:
ans += 1
print(ans)
| p03835 |
K,S = list(map(int,input().split()))
count = 0
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):
if i + j + k == S:
count += 1
print(count) | K,S = list(map(int,input().split()))
count = 0
for i in range(K+1):
for j in range(K+1):
if 0 <= S - (i+j) <= K:
count += 1
print(count) | p03835 |
K, S = list(map(int, input().split()))
cnt = 0
for i in range(K+1):
for j in range(i, K+1):
if 0 <= S - i - j <= K:
if i == j:
cnt += 1
else:
cnt += 2
print(cnt) | K, S = list(map(int, input().split()))
X = (S + 2) * (S + 1)
if S - K - 1 >= 0:
X -= 3 * (S - K + 1) * (S - K)
if S - 2 * K - 2 >= 0:
X += 3 * (S - 2 * K) * (S - 2 * K - 1)
print((X // 2)) | p03835 |
K,S = list(map(int, input().split()))
def binaly_serch(ls,k):#lsはリスト、kが求めたいもの
ls.sort()
n = len(ls)
s = 0
e = n#あえてls から一つ出たのにしておく。このおかげでk = ls[n-1]の時でも探索できる
while int(e - s) >= 1:#intでcastして繰り下がった方を見て、e = bという条件にしてるからこれで全部探せる
b = int((s+e)/2)
if ls[b] == k:
return True
elif ls[b] < k:
s = b + 1
else:
e = b
return False
ans = 0
kls = [i for i in range(K+1)]
for i in range(K+1):
for j in range(K+1):
if S-(i+j) > K:
continue
else:
if binaly_serch(kls,S-(i+j)):
ans += 1
print(ans)
| K,S = list(map(int, input().split()))
ans = 0
for i in range(K+1):
for j in range(K+1):
z = S-(i+j)
if 0<= z and z <= K:
ans += 1
print(ans)
| p03835 |
from sys import stdin
k,s = [int(x) for x in stdin.readline().rstrip().split()]
point = 0
for i in range(k+1):
for j in range(k+1):
for k in range(k+1):
if i + k + j == s:
point += 1
print(point) | from sys import stdin
k,s = [int(x) for x in stdin.readline().rstrip().split()]
point = 0
for i in range(k+1):
for j in range(k+1):
if 0<= s-i-j <= k:
point += 1
print(point) | p03835 |
K, S = list(map(int, input().split()))
ret = 0
for x in range(K + 1):
for y in range(K + 1):
if x + y > S:
break
for z in range(K + 1):
if x + y + z == S:
ret += 1
if x + y + z >= S:
break
print(ret) | K, S = list(map(int, input().split()))
ret = 0
for x in range(K + 1):
for y in range(K + 1):
if x + y <= S and S - x - y <= K:
ret += 1
print(ret) | p03835 |
k,s = list(map(int,input().split()))
cnt = 0
for i in range(k+1):
for j in range(k+1):
for l in range(k+1):
Sum = i+j+l
if Sum==s:
cnt +=1
print(cnt) | k,s = list(map(int,input().split()))
cnt = 0
for i in range(k+1):
for j in range(k+1):
z = s-i-j
if z<=k and z>=0:
cnt +=1
print(cnt) | p03835 |
k,s=input().split()
k,s=int(k),int(s)
c=0
for i in range(k+1):
s1=s-i
if s1<0:
break
for j in range(k+1):
s2=s1-j
if s2<0:
break
if 0<=s2<=k:
c+=1
print(c)
| k,s=list(map(int,input().split()))
cnt=0
for i in range(k+1):
for j in range(k+1):
if 0<=s-i-j<=k:
cnt+=1
print(cnt)
| p03835 |
K,S = [int(i) for i in input().split()]
patterns = 0
for x in range(K+1) :
x = int(x)
for y in range(K+1) :
y = int(y)
z = S - x - y
if (0 <= z and z <= K) :
patterns += 1
print(patterns)
| K,S = [int(i) for i in input().split()]
patterns = 0
for x in range(K+1) :
for y in range(K+1) :
z = S - x - y
if (0 <= z and z <= K) :
patterns += 1
print(patterns)
| p03835 |
K, S=list(map(int, input().split()))
c=0
for i in range(0, S+1):
for j in range(0, i+1):
if j<=K and i-j<=K and S-i<=K:
c+=1
print(c) | K, S=list(map(int, input().split()))
c=0
for i in range(0, min(2*K+1, S+1)):
for j in range(0, min(K+1,i+1)):
if j<=K and i-j<=K and S-i<=K:
c+=1
print(c) | p03835 |
K,S = list(map(int, input().split()))
ans = 0
for z in range(K+1):
ans += max(0, min(2*K-S+z+1, S-z+1))
print(ans) | K,S = list(map(int, input().split()))
print((sum(max(0, min(2*K-S+z+1, S-z+1)) for z in range(K+1)))) | p03835 |
k,s=list(map(int,input().split()))
val=list(range(0, k+1))
n=len(val)
ans=0
for i in range(n):
if val[i]>s:
break
for j in range(n):
if val[i]+val[j]>s:
break
if s-(val[i]+val[j]) in val:
ans+=1
continue
print(ans)
| k, s=list(map(int, input().split()))
ans=0
for x in range(0, k+1):
if x>s:
break
for y in range(0, k+1):
if x+y>s:
break
z=s-x-y
if 0<=z and z<=k:
ans+=1
continue
print(ans) | p03835 |
k, s = list(map(int, input().split()))
x = [n for n in range(0, k+1)]
y = [m for m in range(0, k+1)]
z = [l for l in range(0, k+1)]
cnt = 0
for i in range(k+1):
for j in range(k+1):
for t in range(k+1):
if(x[i] + y[j] + z[t] == s):
cnt += 1
print(cnt) | k, s = list(map(int, input().split()))
cnt = 0
for x in range(k+1):
for y in range(k+1):
z = s - (x+y)
if(z >= 0 and z <= k):
cnt += 1
print(cnt) | p03835 |
def main():
k, s = list(map(int, input().split()))
res = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x + y + z == s:
res += 1
print(res)
if __name__ == '__main__':
main() | def main():
k, s = list(map(int, input().split()))
res = 0
for x in range(k+1):
for y in range(k+1):
z = s - (x + y)
if z <= k and z >= 0:
res += 1
print(res)
if __name__ == '__main__':
main() | p03835 |
from itertools import combinations
n, m = [int(i) for i in input().split(' ')]
x_list = [int(i) for i in input().split(' ')]
y_list = [int(i) for i in input().split(' ')]
total = 0
for x1, x2 in combinations(x_list, 2):
for y1, y2 in combinations(y_list,2):
total += (x2-x1)*(y2-y1)
print((int(total % (10**9+7)))) | n, m = [int(i) for i in input().split(' ')]
x_list = [int(i) for i in input().split(' ')]
y_list = [int(i) for i in input().split(' ')]
x_res = 0
for i in range(n):
x_res += (i-(n-i-1))*x_list[i]
y_res = 0
for j in range(m):
y_res += (j-(m-j-1))*y_list[j]
print(((x_res*y_res) % (10**9+7))) | p03762 |
import sys
input = sys.stdin.readline
def main():
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
X = [x[i+1]-x[i] for i in range(n-1)]
Y = [y[i+1]-y[i] for i in range(m-1)]
mod = pow(10, 9)+7
for i in range(n-1):
X[i] = X[i]*(n-i-1)*(i+1)%mod
sum_x = sum(X)%mod
ans = 0
for j in range(m-1):
ans += sum_x*Y[j]*(m-j-1)*(j+1)%mod
ans %= mod
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
def main():
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
X = [x[i+1]-x[i] for i in range(n-1)]
Y = [y[i+1]-y[i] for i in range(m-1)]
mod = pow(10, 9)+7
for i in range(n-1):
X[i] = X[i]*(n-i-1)*(i+1)%mod
sum_x = sum(X)%mod
for i in range(m-1):
Y[i] = Y[i]*(m-i-1)*(i+1)%mod
sum_y = sum(Y)%mod
ans = sum_x*sum_y%mod
print(ans)
if __name__ == "__main__":
main()
| p03762 |
n, m = list(map(int, input().split()))
x = [x for x in map(int, input().split())]
y = [y for y in map(int, input().split())]
ans = 0
for i in range(n-1):
for j in range(m-1):
v = (i+1)*(n-1-i) * (j+1)*(m-1-j) #面積係数
x_width = x[i+1] - x[i]
y_width = y[j+1] - y[j]
ans += v * x_width * y_width #面積係数*最小長方形面積
print((ans%1000000007)) | n, m = list(map(int, input().split()))
x = [x for x in map(int, input().split())]
y = [y for y in map(int, input().split())]
sum_x = 0
sum_y = 0
ans = 0
for i in range(n):
sum_x += (2*i - n + 1) * x[i]
for j in range(m):
sum_y += (2*j - m + 1) * y[j]
ans = sum_x * sum_y
print((ans%1000000007)) | p03762 |
n, m = list(map(int, input().split()))
x = [x for x in map(int, input().split())]
y = [y for y in map(int, input().split())]
sum_x = 0
sum_y = 0
ans = 0
for i in range(n):
sum_x += (2*i - n + 1) * x[i]
for j in range(m):
sum_y += (2*j - m + 1) * y[j]
ans = sum_x * sum_y
print((ans%1000000007)) | n, m = list(map(int, input().split()))
X = sorted([int(x) for x in input().split()])
Y = sorted([int(x) for x in input().split()])
mod = 1000000007
def diffSum(X): #Σ(X[j]-X[i]) 1<=i<j<=N
l = len(X)
Res = [(2*i-l+1)*X[i] for i in range(l)]
return sum(Res)%mod
print((diffSum(X)*diffSum(Y)%mod)) | p03762 |
import sys
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
n,m = MI()
x,y = LI(),LI()
mod = 10**9+7
n,m = n-1,m-1
dx = [x[i+1]-x[i] for i in range(n)]
dy = [y[i+1]-y[i] for i in range(m)]
if n % 2 == 0:
rx = [i*(n+1-i) for i in range(1,n//2+1)] + [i*(n+1-i) for i in range(n//2,0,-1)]
else:
rx = [i*(n+1-i) for i in range(1,n//2+2)] + [i*(n+1-i) for i in range(n//2,0,-1)]
if m % 2 == 0:
ry = [i*(m+1-i) for i in range(1,m//2+1)] + [i*(m+1-i) for i in range(m//2,0,-1)]
else:
ry = [i*(m+1-i) for i in range(1,m//2+2)] + [i*(m+1-i) for i in range(m//2,0,-1)]
a = 0
for i,j in zip(dx,rx):
a += i*j
a %= mod
b = 0
for i,j in zip(dy,ry):
b += i*j
b %= mod
print(((a*b) % mod))
| import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
N,M = MI()
X = LI()
Y = LI()
mod = 10**9+7
r = sum((i*(N-i)*(X[i]-X[i-1])) % mod for i in range(1,N))
r %= mod
ans = 0
for i in range(1,M):
ans += r*i*(M-i)*(Y[i]-Y[i-1]) % mod
ans %= mod
print(ans)
| p03762 |
n,m=[int(x) for x in input().split()]
x=[int(x) for x in input().split()]
y=[int(x) for x in input().split()]
from itertools import product
mod=10**9+7
ans=0
for i,j in product(list(range(1,n)),list(range(1,m))):
ans=ans+(x[i]-x[i-1])*(y[j]-y[j-1])*i*(n-i)*j*(m-j)
print((ans%mod)) | n,m=[int(x) for x in input().split()]
x=[int(x) for x in input().split()]
y=[int(x) for x in input().split()]
mod=10**9+7
ans=0
ysum=0
for j in range(1,m):
ysum+=(y[j]-y[j-1])*j*(m-j)
for i in range(1,n):
ans=ans+(x[i]-x[i-1])*i*(n-i)*ysum
print((ans%mod)) | p03762 |
mod = int(1e9+7)
n, m = [int(num) for num in input().split()]
x = [int(x) for x in input().split()]
y = [int(y) for y in input().split()]
sumx = 0
for i in range(n-1):
sumx += sum(x[i+1:]) - x[i] * ((n-1) - (i+1) + 1)
sumy = 0
for k in range(m-1):
sumy += sum(y[k+1:]) - y[k] * ((m-1) - (k+1) + 1)
ans = ((sumx % mod) * (sumy % mod)) % mod
print(ans) | # 予めsx, syを全て計算しておく
# このとき漸化式を使えば毎回全ての話を求める必要がない
mod = int(1e9+7)
n, m = [int(num) for num in input().split()]
x = [int(x) for x in input().split()]
y = [int(y) for y in input().split()]
sx = [0] * n
sx[0] = x[0]
for i in range(n-1):
sx[i+1] = sx[i] + x[i+1]
sxd = 0
for i in range(n-1):
sxd += ((sx[n-1] - sx[i]) - x[i] * ((n-1) - (i+1) + 1)) % mod
sy = [0] * m
sy[0] = y[0]
for k in range(m-1):
sy[k+1] = sy[k] + y[k+1]
syd = 0
for k in range(m-1):
syd += ((sy[m-1] - sy[k]) - y[k] * ((m-1) - (k+1) + 1)) % mod
ans = ((sxd % mod) * (syd % mod)) % mod
print(ans) | p03762 |
MOD = 10 ** 9 + 7
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
# 前計算
for i in range(n - 1):
x[i] = x[i + 1] - x[i]
for i in range(m - 1):
y[i] = y[i + 1] - y[i]
N = [n - 1]
for i in range(n - 3, 0, -2):
N.append(N[-1] + i)
# N.append((N[i] + (n - 1 - 2 * (i + 1))) % MOD)
M = [m - 1]
for i in range(m - 3, 0, -2):
M.append(M[-1] + i)
# M.append((M[i] + (m - 1- 2 * (i + 1))) % MOD)
if N[0] % 2 == 0:
N += N[::-1]
elif N[0] != 1:
N += N[1::-1]
if M[0] % 2 == 0:
M += M[::-1]
elif M[0] != 1:
M += M[1::-1]
# print (x)
# print (y)
# print (N)
# print (M)
if len(x) - 1 > len(N):
while True:
pass
if len(y) - 1 > len(M):
while True:
pass
X_sum = 0
for i in range(n - 1):
X_sum += x[i] * N[i]
X_sum %= MOD
Y_sum = 0
for i in range(m - 1):
Y_sum += y[i] * M[i]
Y_sum %= MOD
print(((X_sum * Y_sum) % MOD)) | MOD = 10 ** 9 + 7
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
# 前計算
for i in range(n - 1):
x[i] = x[i + 1] - x[i]
for i in range(m - 1):
y[i] = y[i + 1] - y[i]
N = [n - 1]
for i in range(n - 3, 0, -2):
N.append(N[-1] + i)
# N.append((N[i] + (n - 1 - 2 * (i + 1))) % MOD)
M = [m - 1]
for i in range(m - 3, 0, -2):
M.append(M[-1] + i)
# M.append((M[i] + (m - 1- 2 * (i + 1))) % MOD)
if N[0] % 2 == 0:
N += N[::-1]
elif N[0] != 1:
N += N[-2::-1]
if M[0] % 2 == 0:
M += M[::-1]
elif M[0] != 1:
M += M[-2::-1]
# print (x)
# print (y)
# print (N)
# print (M)
if len(x) - 1 > len(N):
while True:
pass
if len(y) - 1 > len(M):
while True:
pass
X_sum = 0
for i in range(n - 1):
X_sum += x[i] * N[i]
X_sum %= MOD
Y_sum = 0
for i in range(m - 1):
Y_sum += y[i] * M[i]
Y_sum %= MOD
print(((X_sum * Y_sum) % MOD)) | p03762 |
MOD = 10 ** 9 + 7
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
# 前計算
for i in range(n - 1):
x[i] = x[i + 1] - x[i]
for i in range(m - 1):
y[i] = y[i + 1] - y[i]
N = [n - 1]
for i in range(n - 3, 0, -2):
N.append(N[-1] + i)
# N.append((N[i] + (n - 1 - 2 * (i + 1))) % MOD)
M = [m - 1]
for i in range(m - 3, 0, -2):
M.append(M[-1] + i)
# M.append((M[i] + (m - 1- 2 * (i + 1))) % MOD)
if N[0] % 2 == 0:
N += N[::-1]
elif N[0] != 1:
N += N[-2::-1]
if M[0] % 2 == 0:
M += M[::-1]
elif M[0] != 1:
M += M[-2::-1]
# print (x)
# print (y)
# print (N)
# print (M)
if len(x) - 1 > len(N):
while True:
pass
if len(y) - 1 > len(M):
while True:
pass
X_sum = 0
for i in range(n - 1):
X_sum += x[i] * N[i]
X_sum %= MOD
Y_sum = 0
for i in range(m - 1):
Y_sum += y[i] * M[i]
Y_sum %= MOD
print(((X_sum * Y_sum) % MOD)) | MOD = 10 ** 9 + 7
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
x_sum = 0
for k, value in enumerate(x):
x_sum += (2 * (k + 1) - n - 1) * value
x_sum %= MOD
y_sum = 0
for k, value in enumerate(y):
y_sum += (2 * (k + 1) - m - 1) * value
y_sum %= MOD
print(((x_sum * y_sum) % MOD))
| p03762 |
import sys
n,m = [int(x) for x in sys.stdin.readline().split()]
x = [int(x) for x in sys.stdin.readline().split()]
y = [int(x) for x in sys.stdin.readline().split()]
r = 0
mod = 10**9+7
for i in range(n):
for j in range(i+1,n):
dx = x[j]-x[i]
for k in range(m):
for l in range(k+1,m):
dy = y[l]-y[k]
r += dx*dy
tr = r%mod
print(tr) | import sys
n,m = [int(x) for x in sys.stdin.readline().split()]
x = [int(x) for x in sys.stdin.readline().split()]
y = [int(x) for x in sys.stdin.readline().split()]
r = 0
mod = 10**9+7
def sumof(a,b):
s = 0
for i in range(a):
s += (2*(i+1)-a-1)*b[i]
s %= mod
return s
r = (sumof(n,x)*sumof(m,y))%mod
print(r) | p03762 |
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]
class mint:
def __init__(self, x):
self.__x = x % md
def __str__(self):
return str(self.__x)
def __add__(self, other):
if isinstance(other, mint): other = other.__x
return mint(self.__x + other)
def __sub__(self, other):
if isinstance(other, mint): other = other.__x
return mint(self.__x - other)
def __rsub__(self, other):
return mint(other - self.__x)
def __mul__(self, other):
if isinstance(other, mint): other = other.__x
return mint(self.__x * other)
__radd__ = __add__
__rmul__ = __mul__
def __truediv__(self, other):
if isinstance(other, mint): other = other.__x
return mint(self.__x * pow(other, md - 2, md))
def __pow__(self, power, modulo=None):
return mint(pow(self.__x, power, md))
md=10**9+7
def main():
n,m=MI()
xx=LI()
yy=LI()
ans=mint(0)
for i in range(n-1):
for j in range(m-1):
s=(xx[i+1]-xx[i])*(yy[j+1]-yy[j])
ans+=s*(i+1)*(n-i-1)*(j+1)*(m-j-1)
print(ans)
main()
| import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]
class mint:
def __init__(self, x):
self.__x = x % md
def __str__(self):
return str(self.__x)
def __add__(self, other):
if isinstance(other, mint): other = other.__x
return mint(self.__x + other)
def __sub__(self, other):
if isinstance(other, mint): other = other.__x
return mint(self.__x - other)
def __rsub__(self, other):
return mint(other - self.__x)
def __mul__(self, other):
if isinstance(other, mint): other = other.__x
return mint(self.__x * other)
__radd__ = __add__
__rmul__ = __mul__
def __truediv__(self, other):
if isinstance(other, mint): other = other.__x
return mint(self.__x * pow(other, md - 2, md))
def __pow__(self, power, modulo=None):
return mint(pow(self.__x, power, md))
md=10**9+7
def main():
n,m=MI()
xx=LI()
yy=LI()
ans=mint(0)
byj=mint(0)
for j in range(m - 1):
byj+=(j+1)*(m-j-1)*(yy[j+1]-yy[j])
for i in range(n-1):
ans+=(xx[i+1]-xx[i])*(i+1)*(n-i-1)*byj
print(ans)
main()
| p03762 |
n, m = input().split()
n = int(n)
m = int(m)
x = [int(i) for i in input().split()]
y = [int(i) for i in input().split()]
s = 0
for i in range(n-1):
for j in range(i+1, n):
for k in range(m-1):
for l in range(k+1,m):
tate = x[j] - x[i]
yoko = y[l] - y[k]
s += tate * yoko
s %= (10**9 + 7)
print(s)
| n, m = input().split()
n = int(n)
m = int(m)
x = [int(i) for i in input().split()]
y = [int(i) for i in input().split()]
def sum(a, n):
sum_a = 0
for i in range(0, n):
sum_a += i * a[i] - (n-1-i) * a[i]
return sum_a
sum_x = sum(x,n)
sum_y = sum(y,m)
s = sum_x * sum_y % (10**9 + 7)
print(s) | p03762 |
# -*- coding: utf-8 -*-
import sys
import os
import math
n, m = list(map(int, input().split()))
X = list(map(int, input().split()))
Y = list(map(int, input().split()))
def sum_len(A):
all = 0
for i in range(len(A)):
for j in range(i+1, len(A)):
l = A[j] - A[i]
all += l
return all
a = 10**9 + 7
xl = sum_len(X)
yl = sum_len(Y)
print((xl * yl % a)) | # -*- coding: utf-8 -*-
import sys
import os
import math
n, m = list(map(int, input().split()))
X = list(map(int, input().split()))
Y = list(map(int, input().split()))
def sum_len(A):
all_sum = 0
previous_sum = 0
for i in range(1, len(A)):
now_sum = previous_sum + i * (A[i] - A[i-1])
all_sum += now_sum
previous_sum = now_sum
return all_sum
a = 10**9 + 7
xl = sum_len(X)
yl = sum_len(Y)
#print(xl)
#print(yl)
print((xl * yl % a)) | p03762 |
# -*- coding: utf-8 -*-
n, m = input().split()
x = input().split()
y = input().split()
width = [abs(int(x[i])-int(x[j])) for i in range(len(x)-1) for j in range(i+1, len(x))]
height = [abs(int(y[i])-int(y[j])) for i in range(len(y)-1) for j in range(i+1, len(y))]
sum = 0
for w in width:
for h in height:
sum = sum + w * h
print((sum % (10 ** 9 + 7)))
| # -*- coding: utf-8 -*-
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
def sum_length(x, n):
all_sum = 0
prev_sum = 0
for i in range(1, n):
cur_sum = prev_sum + (x[i] - x[i-1]) * i
all_sum = all_sum + cur_sum
prev_sum = cur_sum
return all_sum
sumx = sum_length(x, n)
sumy = sum_length(y, m)
print((sumx * sumy % 1000000007)) | p03762 |
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
sum_x = 0
for i in range(0, n):
tmp_x = x[i]
sum_x += sum(list([ele for ele in ([ele - tmp_x for ele in x]) if ele > 0]))
sum_y = 0
for i in range(0, m):
tmp_y = y[i]
sum_y += sum(list([ele for ele in ([ele - tmp_y for ele in y]) if ele > 0]))
ans = sum_x * sum_y
divide_num = pow(10, 9) + 7
print((ans % divide_num))
| n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
sum_x = 0
for i in range(0, n):
sum_x += i * x[i] - (n - (i + 1)) * x[i]
sum_y = 0
for i in range(0, m):
sum_y += i * y[i] - (m - (i + 1)) * y[i]
ans = sum_x * sum_y
divide_num = pow(10, 9) + 7
print((ans % divide_num))
| p03762 |
n, m = list(map(int, input().split()))
x = [int(i) for i in input().split()]
y = [int(i) for i in input().split()]
MOD = 10 ** 9 + 7
ret = 0
for i in range(1, m) :
for j in range(1, n) :
ret += (x[j]-x[j-1])*(y[i]-y[i-1])*(n-j)*(m-i)*i*j%MOD
ret %= MOD
print(ret)
| n, m = list(map(int, input().split()))
x = [int(i) for i in input().split()]
y = [int(i) for i in input().split()]
MOD = 10 ** 9 + 7
sx = 0
pre = 0
for i in range(1, n) :
pre += (x[i]-x[i-1]) * i
sx += pre
sx %= MOD
sy = 0
pre = 0
for i in range(1, m) :
pre += (y[i]-y[i-1]) * i
sy += pre
sy %= MOD
print((sx*sy%MOD)) | p03762 |
mod = 10 ** 9 + 7
def mod_mul(a, b):
return a * b % mod
N, M = list(map(int, input().split()))
*x, = list(map(int, input().split()))
*y, = list(map(int, input().split()))
sx = sum(mod_mul(_x, i - (N - 1 - i)) for i, _x in enumerate(x)) # _x * i - _x * (N - 1 - i)
sy = sum(mod_mul(_y, i - (M - 1 - i)) for i, _y in enumerate(y)) # _y * i - _y * (M - 1 - i)
print((sx * sy % mod))
| def main():
MOD = 10 ** 9 + 7
N, M = list(map(int, input().split()))
*x, = list(map(int, input().split()))
*y, = list(map(int, input().split()))
sx = 0
for i, x_ in enumerate(x, 1):
sx = (sx + x_ * ((i - 1) - (N - i))) % MOD
sy = 0
for i, y_ in enumerate(y, 1):
sy = (sy + y_ * ((i - 1) - (M - i))) % MOD
ans = sx * sy % MOD
print(ans)
if __name__ == '__main__':
main()
# ある矩形の面積は
# (x1-x0)(y1-y0)
# x,yの各要素はx1,x0,y1,y0として何回出現するか?
# 1-indexedで、i番目の要素が
# x1として数えられるのは,
# 相方のx0の候補数 = 1-indexedのx0のインデックス = i-1
# x0として数えられるのは、
# 相方のx1の候補数 = 1-indexedのN-x0のインデックス = N-i
| p03762 |
# -*- coding: utf-8 -*-
import sys
from itertools import accumulate
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
N, M = MAP()
A = LIST()
B = LIST()
# データの持ち方を座標から区間長にして累積和
A2 = []
for i in range(N-1):
A2.append(A[i+1] - A[i])
B2 = []
for i in range(M-1):
B2.append(B[i+1] - B[i])
A2 = [0] + list(accumulate(A2))
B2 = [0] + list(accumulate(B2))
# 縦横独立に、累積和の全区間総和を取る
lsm = rsm = 0
for i in range(N):
lsm += A2[i] * (N-i-1)
rsm += A2[i] * i
lsm %= MOD
rsm %= MOD
h = rsm - lsm
lsm = rsm = 0
for i in range(M):
lsm += B2[i] * (M-i-1)
rsm += B2[i] * i
lsm %= MOD
rsm %= MOD
w = rsm - lsm
ans = h * w % MOD
print(ans)
| # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
N, M = MAP()
A = LIST()
B = LIST()
# 縦横独立に、全区間総和を取る
lsm = rsm = 0
for i in range(N):
lsm += A[i] * (N-i-1)
rsm += A[i] * i
lsm %= MOD
rsm %= MOD
h = rsm - lsm
lsm = rsm = 0
for i in range(M):
lsm += B[i] * (M-i-1)
rsm += B[i] * i
lsm %= MOD
rsm %= MOD
w = rsm - lsm
ans = h * w % MOD
print(ans)
| p03762 |
# -*- coding: utf-8 -*-
# 整数の入力
n,m= list(map(int, input().split()))
x=list(map(int, input().split()))
y=list(map(int, input().split()))
yoko=0
tate=0
for i in range (0,n-1):
for j in range (i+1,n):
yoko+=x[j]-x[i]
for i in range (0,m-1):
for j in range (i+1,m):
tate+=y[j]-y[i]
print((yoko*tate%(10**9+7))) | # -*- coding: utf-8 -*-
# 整数の入力
n,m= list(map(int, input().split()))
x=list(map(int, input().split()))
y=list(map(int, input().split()))
yoko=0
tate=0
for i in range (0,len(x)):
yoko+=(n-2*i-1)*x[i]
for i in range (0,len(y)):
tate+=(m-2*i-1)*y[i]
print((yoko*tate%(10**9+7))) | p03762 |
n, m = list(map(int, input().split()))
X = list(map(int, input().split()))
Y = list(map(int, input().split()))
MOD = 10**9+7
ans = 0
for i in range(n-1):
for j in range(m-1):
t = (X[i+1]-X[i]) * (Y[j+1]-Y[j])
t %= MOD
t *= (n-i-1)*(i+1)
t %= MOD
t *= (m-j-1)*(j+1)
t %= MOD
ans += t
ans %= MOD
print(ans) | n, m = list(map(int, input().split()))
X = list(map(int, input().split()))
Y = list(map(int, input().split()))
MOD = 10**9+7
sx, sy = 0, 0
for i in range(n):
t = 2*i+1-n
t *= X[i]
t %= MOD
sx += t
sx %= MOD
for j in range(m):
t = 2*j+1-m
t *= Y[j]
t %= MOD
sy += t
sy %= MOD
print((sx*sy%MOD)) | p03762 |
n,m=list(map(int,input().split()))
x=list(map(int,input().split()))
y=list(map(int,input().split()))
ans=0
for i in range(n-1):
for j in range(m-1):
ans=(ans+(x[i+1]-x[i])*(y[j+1]-y[j])*(i+1)*(n-1-i)*(j+1)*(m-1-j))%(10**9+7)
print(ans) | n,m=list(map(int,input().split()))
x=list(map(int,input().split()))
y=list(map(int,input().split()))
X=0
Y=0
for i in range(n-1):X=(X+(x[i+1]-x[i])*(i+1)*(n-1-i))%(10**9+7)
for i in range(m-1):Y=(Y+(y[i+1]-y[i])*(i+1)*(m-1-i))%(10**9+7)
print((X*Y%(10**9+7))) | p03762 |
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
mod = 10**9+7
ans = 0
for i in range(n-1):
for j in range(m-1):
s = ((x[i+1] - x[i])*(y[j+1] - y[j]))%mod
ans = (ans + s * (((i+1) * (n-i-1))%mod) * (((j+1) * (m-j-1))%mod)) % mod
print(ans)
| n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
mod = 10**9+7
ans = 0
y01 = (y[1] - y[0])%mod
ynum = m-1
for i in range(n-1):
s = (((x[i+1] - x[i])%mod) * y01) % mod
xnum = (i+1) * (n-i-1)
ans = (ans + (s*xnum*ynum) % mod) % mod
band = ans
inv = [0] * (m + 1)
inv[1] = 1
for i in range(2, m):
inv[i] = mod - inv[mod % i] * (mod // i) % mod
for j in range(1, m-1):
band = (((((band * inv[j])%mod) * inv[m-j])%mod) * (((j+1) * (m-j-1))%mod))%mod
band = ((band * ((y[j+1] - y[j])%mod))%mod * pow(((y[j]-y[j-1])%mod), mod-2, mod))%mod
ans = (ans + band)%mod
print(ans)
| p03762 |
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**4
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
n,m = list(map(int,input().split()))
X = sorted(list(map(int,input().split())))
Y = sorted(list(map(int,input().split())))
ans = 0
for i in range(n - 1):
for j in range(m - 1):
S = (X[i + 1] - X[i]) * (Y[j + 1] - Y[j])
num = (i + 1) * (n - (i + 1)) * (j + 1) * (m - (j + 1))
S *= num
S %= 10 ** 9 + 7
ans += S
ans %= 10 ** 9 + 7
print(ans)
| 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**4
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
n,m = list(map(int,input().split()))
X = [0] + sorted(list(map(int,input().split())))
Y = [0] + sorted(list(map(int,input().split())))
sum1 = 0
sum2 = 0
MOD = 10 ** 9 + 7
for i in range(1, n + 1):
sum1 += ((i - 1)*X[i] - (n - i)*X[i]) % MOD
for i in range(1, m + 1):
sum2 += ((i - 1)*Y[i] - (m - i)*Y[i])%MOD
print((sum1 * sum2 % MOD))
| p03762 |
import sys
readline = sys.stdin.readline
N,M = list(map(int,readline().split()))
X = list(map(int,readline().split()))
Y = list(map(int,readline().split()))
DIV = 10 ** 9 + 7
# カウントする回数分X,Y軸ともに辺の長さを伸ばしていって巨大な長方形を作るイメージ
# X軸の、長さLの辺を3回数える場合、L * 2分X軸の辺の長さを伸ばす。
# X軸Y軸ともに各辺を数える回数が分かれば、巨大な長方形の面積はその積で求められる
#
# X軸について、i番目の辺は、((i - 1) + 1) * (N - i)回数える
# 例：4番目の辺の場合
# ...X..
# Xより左から4通り（0も含むため） * Xより右から3通り(0も含むため)
# この回数分、辺の長さを掛けることを全ての辺に対して行った総和がX軸の辺の総量
# Y軸についても同じものを求めて、掛け合わせたものが答え
xsum = 0
for i in range(1, len(X)):
# i番目の辺は、長さX[i] - X[i - 1]
edge = X[i] - X[i - 1]
# i番目の辺は((i - 1) + 1) * (N - i)回数える
times = i * (N - i)
xsum += ((edge % DIV) * (times % DIV)) % DIV
xsum %= DIV
ysum = 0
for i in range(1, len(Y)):
# i番目の辺は、長さY[i] - Y[i - 1]
edge = Y[i] - Y[i - 1]
# i番目の辺は((i - 1) + 1) * (M - i)回数える
times = i * (M - i)
ysum += ((edge % DIV) * (times % DIV)) % DIV
ysum %= DIV
print(((xsum * ysum) % DIV)) | import sys
readline = sys.stdin.readline
N,M = list(map(int,readline().split()))
X = list(map(int,readline().split()))
Y = list(map(int,readline().split()))
DIV = 10 ** 9 + 7
def f(V):
vsum = 0
for i in range(1, len(V)):
vsum += (((V[i] - V[i - 1]) % DIV) * ((i * (len(V) - i)) % DIV)) % DIV
vsum %= DIV
return vsum
print(((f(X) * f(Y)) % DIV)) | p03762 |
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(eval(input())) # n=1
def inpm(): return list(map(int,input().split())) # x=1,y=2
def inpl(): return list(map(int, input().split())) # a=[1,2,3,4,5,...,n]
def inpls(): return list(input().split()) # a=['1','2','3',...,'n']
def inplm(n): return list(int(eval(input())) for _ in range(n)) # x=[] 複数行
def inplL(n): return [list(eval(input())) for _ in range(n)]
def inplT(n): return [tuple(eval(input())) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)] # [[2,2,2,2],[1,1,1,1],[3,3,3,3]]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)]) # [[1,1,1,1],[2,2,2,2],[3,3,3,3]]
def main():
n,m = inpm()
x = inpl()
y = inpl()
N = [0 for _ in range(n-1)]
M = [0 for _ in range(m-1)]
cnt = n-1
plus = 0
for i in range(n-1):
plus += cnt
N[i] = plus
N[-i-1] = plus
cnt -= 2
if cnt <= 0:
break
cnt = m-1
plus = 0
for i in range(m-1):
plus += cnt
M[i] = plus
M[-i-1] = plus
cnt -= 2
if cnt <= 0:
break
ans = 0
for i in range(n-1):
for j in range(m-1):
area = ((x[i+1]-x[i])*(y[j+1]-y[j])) % mod
area = (area*N[i]) % mod
area = (area*M[j]) % mod
ans = (ans+area) % mod
print(ans)
if __name__ == "__main__":
main() | import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(eval(input())) # n=1
def inpm(): return list(map(int,input().split())) # x=1,y=2
def inpl(): return list(map(int, input().split())) # a=[1,2,3,4,5,...,n]
def inpls(): return list(input().split()) # a=['1','2','3',...,'n']
def inplm(n): return list(int(eval(input())) for _ in range(n)) # x=[] 複数行
def inplL(n): return [list(eval(input())) for _ in range(n)]
def inplT(n): return [tuple(eval(input())) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)] # [[2,2,2,2],[1,1,1,1],[3,3,3,3]]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)]) # [[1,1,1,1],[2,2,2,2],[3,3,3,3]]
def main():
n,m = inpm()
x = inpl()
y = inpl()
X = 0
Y = 0
cntX, cntY = n-1, m-1
for i in range(n-1,-1,-1):
X += x[i]*cntX
X %= mod
cntX -= 2
for i in range(m-1,-1,-1):
Y += y[i]*cntY
Y %= mod
cntY -= 2
print(((X*Y)%mod))
if __name__ == "__main__":
main() | p03762 |
def d_igeta(N, M, X, Y):
tmp1 = 0
tmp2 = 0
for k, x in enumerate(X):
k += 1
tmp1 += (k - 1) * x - (N - k) * x
for k, y in enumerate(Y):
k += 1
tmp2 += (k - 1) * y - (M - k) * y
return (tmp1 * tmp2) % (10**9 + 7)
N,M = [int(i) for i in input().split()]
X = [int(i) for i in input().split()]
Y = [int(i) for i in input().split()]
print((d_igeta(N, M, X, Y))) | def d_rectangles(MOD=10**9 + 7):
N, M = [int(i) for i in input().split()]
X = [int(i) for i in input().split()]
Y = [int(i) for i in input().split()]
ans1 = sum([x * (2 * k - N - 1) for k, x in enumerate(X, 1)])
ans2 = sum([y * (2 * k - M - 1) for k, y in enumerate(Y, 1)])
return (ans1 * ans2) % MOD
print((d_rectangles())) | p03762 |
MOD = 10 ** 9 + 7
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
Y = list(map(int, input().split()))
SUM = 0
for i in range(N):
for j in range(M):
pos = i * j + (N - i - 1) * (M - j - 1)
neg = i * (M - j - 1) + (N - i - 1) * j
SUM = (SUM + X[i] * Y[j] * (pos - neg)) % MOD
print(SUM)
| MOD = 10 ** 9 + 7
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
Y = list(map(int, input().split()))
x_sum = 0
for i in range(N):
x_sum = (x_sum + X[i] * (N - i - 1) - X[i] * i) % MOD
y_sum = 0
for i in range(M):
y_sum = (y_sum + Y[i] * (M - i - 1) - Y[i] * i) % MOD
result = (x_sum * y_sum) % MOD
print(result)
| p03762 |
def rren(): return list(map(int, input().split()))
n, m = rren()
x = rren()
y = rren()
ans = 0
for now_x in range(n-1):
for now_y in range(m-1):
S = (x[now_x+1]-x[now_x])*(y[now_y+1]-y[now_y])
count = (now_x+1)*(n-now_x-1)*(now_y+1)*(m-now_y-1)
ans = (ans + S*count) % 1000000007
print(ans) | def rren(): return list(map(int, input().split()))
n, m = rren()
x = rren()
y = rren()
ans = 0
x_sum = 0
y_sum = 0
for now_x in range(n):
x_sum += x[now_x] * (now_x - (n-1 - now_x))
for now_y in range(m):
y_sum += y[now_y] * (now_y - (m-1 - now_y))
print((x_sum * y_sum % 1000000007))
| p03762 |
print(('a' if input().islower() else 'A'))
| print(('Aa'[input().islower()])) | p02627 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
N = readline().strip()
n = ord(N)
low = list(range(97, 97+ 26))
if n in low:
print("a")
else:
print("A")
if __name__ == "__main__":
main()
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
a = readline().strip()
print(("a" if a.islower() else "A"))
if __name__ == "__main__":
main()
| p02627 |
X = int(eval(input()))
def is_prime_number(number):
is_dividable = lambda divided, divider: divided % divider == 0
result = all([not is_dividable(number, divider) for divider in range(2, number)])
return result
answer = X
while True:
if is_prime_number(answer): break
answer += 1
print(answer)
| import math
X = int(eval(input()))
def is_prime_number(number):
is_dividable = lambda divided, divider: divided % divider == 0
result = all([not is_dividable(number, divider) for divider in range(2, int(math.sqrt(number)))])
return result
answer = X
while True:
if is_prime_number(answer): break
answer += 1
print(answer)
| p02819 |
x=int(eval(input()))
flag=0
while(1):
flag=0
for i in range(2,int(x/2+1)):
if x%i==0:
flag=1
x+=1
break
if flag==0:
print(x)
break
| n=int(eval(input()))
flag=1
for i in range(n,10*n):
j=2
flag=1
while(j<=int(i**(0.5))):
if(i%j==0):
flag=0
break
j+=1
if(flag==1):
print(i)
break | p02819 |
x = int(eval(input()))
prime_list = []
for n in range(2, 55049):
is_prime = True
for m in prime_list:
if n % m == 0:
is_prime = False
break
if is_prime:
if x <= n:
print(n)
exit(0)
prime_list.append(n)
bigger_prime_list = [55049,55051,55057,55061,55073,55079,55103,55109,55117,55127,55147,55163,55171,55201,55207,55213,55217,55219,55229,55243,55249,55259,55291,55313,55331,55333,55337,55339,55343,55351,55373,55381,55399,55411,55439,55441,55457,55469,55487,55501,55511,55529,55541,55547,55579,55589,55603,55609,55619,55621,55631,55633,55639,55661,55663,55667,55673,55681,55691,55697,55711,55717,55721,55733,55763,55787,55793,55799,55807,55813,55817,55819,55823,55829,55837,55843,55849,55871,55889,55897,55901,55903,55921,55927,55931,55933,55949,55967,55987,55997,56003,56009,56039,56041,56053,56081,56087,56093,56099,56101,56113,56123,56131,56149,56167,56171,56179,56197,56207,56209,56237,56239,56249,56263,56267,56269,56299,56311,56333,56359,56369,56377,56383,56393,56401,56417,56431,56437,56443,56453,56467,56473,56477,56479,56489,56501,56503,56509,56519,56527,56531,56533,56543,56569,56591,56597,56599,56611,56629,56633,56659,56663,56671,56681,56687,56701,56711,56713,56731,56737,56747,56767,56773,56779,56783,56807,56809,56813,56821,56827,56843,56857,56873,56891,56893,56897,56909,56911,56921,56923,56929,56941,56951,56957,56963,56983,56989,56993,56999,57037,57041,57047,57059,57073,57077,57089,57097,57107,57119,57131,57139,57143,57149,57163,57173,57179,57191,57193,57203,57221,57223,57241,57251,57259,57269,57271,57283,57287,57301,57329,57331,57347,57349,57367,57373,57383,57389,57397,57413,57427,57457,57467,57487,57493,57503,57527,57529,57557,57559,57571,57587,57593,57601,57637,57641,57649,57653,57667,57679,57689,57697,57709,57713,57719,57727,57731,57737,57751,57773,57781,57787,57791,57793,57803,57809,57829,57839,57847,57853,57859,57881,57899,57901,57917,57923,57943,57947,57973,57977,57991,58013,58027,58031,58043,58049,58057,58061,58067,58073,58099,58109,58111,58129,58147,58151,58153,58169,58171,58189,58193,58199,58207,58211,58217,58229,58231,58237,58243,58271,58309,58313,58321,58337,58363,58367,58369,58379,58391,58393,58403,58411,58417,58427,58439,58441,58451,58453,58477,58481,58511,58537,58543,58549,58567,58573,58579,58601,58603,58613,58631,58657,58661,58679,58687,58693,58699,58711,58727,58733,58741,58757,58763,58771,58787,58789,58831,58889,58897,58901,58907,58909,58913,58921,58937,58943,58963,58967,58979,58991,58997,59009,59011,59021,59023,59029,59051,59053,59063,59069,59077,59083,59093,59107,59113,59119,59123,59141,59149,59159,59167,59183,59197,59207,59209,59219,59221,59233,59239,59243,59263,59273,59281,59333,59341,59351,59357,59359,59369,59377,59387,59393,59399,59407,59417,59419,59441,59443,59447,59453,59467,59471,59473,59497,59509,59513,59539,59557,59561,59567,59581,59611,59617,59621,59627,59629,59651,59659,59663,59669,59671,59693,59699,59707,59723,59729,59743,59747,59753,59771,59779,59791,59797,59809,59833,59863,59879,59887,59921,59929,59951,59957,59971,59981,59999,60013,60017,60029,60037,60041,60077,60083,60089,60091,60101,60103,60107,60127,60133,60139,60149,60161,60167,60169,60209,60217,60223,60251,60257,60259,60271,60289,60293,60317,60331,60337,60343,60353,60373,60383,60397,60413,60427,60443,60449,60457,60493,60497,60509,60521,60527,60539,60589,60601,60607,60611,60617,60623,60631,60637,60647,60649,60659,60661,60679,60689,60703,60719,60727,60733,60737,60757,60761,60763,60773,60779,60793,60811,60821,60859,60869,60887,60889,60899,60901,60913,60917,60919,60923,60937,60943,60953,60961,61001,61007,61027,61031,61043,61051,61057,61091,61099,61121,61129,61141,61151,61153,61169,61211,61223,61231,61253,61261,61283,61291,61297,61331,61333,61339,61343,61357,61363,61379,61381,61403,61409,61417,61441,61463,61469,61471,61483,61487,61493,61507,61511,61519,61543,61547,61553,61559,61561,61583,61603,61609,61613,61627,61631,61637,61643,61651,61657,61667,61673,61681,61687,61703,61717,61723,61729,61751,61757,61781,61813,61819,61837,61843,61861,61871,61879,61909,61927,61933,61949,61961,61967,61979,61981,61987,61991,62003,62011,62017,62039,62047,62053,62057,62071,62081,62099,62119,62129,62131,62137,62141,62143,62171,62189,62191,62201,62207,62213,62219,62233,62273,62297,62299,62303,62311,62323,62327,62347,62351,62383,62401,62417,62423,62459,62467,62473,62477,62483,62497,62501,62507,62533,62539,62549,62563,62581,62591,62597,62603,62617,62627,62633,62639,62653,62659,62683,62687,62701,62723,62731,62743,62753,62761,62773,62791,62801,62819,62827,62851,62861,62869,62873,62897,62903,62921,62927,62929,62939,62969,62971,62981,62983,62987,62989,63029,63031,63059,63067,63073,63079,63097,63103,63113,63127,63131,63149,63179,63197,63199,63211,63241,63247,63277,63281,63299,63311,63313,63317,63331,63337,63347,63353,63361,63367,63377,63389,63391,63397,63409,63419,63421,63439,63443,63463,63467,63473,63487,63493,63499,63521,63527,63533,63541,63559,63577,63587,63589,63599,63601,63607,63611,63617,63629,63647,63649,63659,63667,63671,63689,63691,63697,63703,63709,63719,63727,63737,63743,63761,63773,63781,63793,63799,63803,63809,63823,63839,63841,63853,63857,63863,63901,63907,63913,63929,63949,63977,63997,64007,64013,64019,64033,64037,64063,64067,64081,64091,64109,64123,64151,64153,64157,64171,64187,64189,64217,64223,64231,64237,64271,64279,64283,64301,64303,64319,64327,64333,64373,64381,64399,64403,64433,64439,64451,64453,64483,64489,64499,64513,64553,64567,64577,64579,64591,64601,64609,64613,64621,64627,64633,64661,64663,64667,64679,64693,64709,64717,64747,64763,64781,64783,64793,64811,64817,64849,64853,64871,64877,64879,64891,64901,64919,64921,64927,64937,64951,64969,64997,65003,65011,65027,65029,65033,65053,65063,65071,65089,65099,65101,65111,65119,65123,65129,65141,65147,65167,65171,65173,65179,65183,65203,65213,65239,65257,65267,65269,65287,65293,65309,65323,65327,65353,65357,65371,65381,65393,65407,65413,65419,65423,65437,65447,65449,65479,65497,65519,65521,65537,65539,65543,65551,65557,65563,65579,65581,65587,65599,65609,65617,65629,65633,65647,65651,65657,65677,65687,65699,65701,65707,65713,65717,65719,65729,65731,65761,65777,65789,65809,65827,65831,65837,65839,65843,65851,65867,65881,65899,65921,65927,65929,65951,65957,65963,65981,65983,65993,66029,66037,66041,66047,66067,66071,66083,66089,66103,66107,66109,66137,66161,66169,66173,66179,66191,66221,66239,66271,66293,66301,66337,66343,66347,66359,66361,66373,66377,66383,66403,66413,66431,66449,66457,66463,66467,66491,66499,66509,66523,66529,66533,66541,66553,66569,66571,66587,66593,66601,66617,66629,66643,66653,66683,66697,66701,66713,66721,66733,66739,66749,66751,66763,66791,66797,66809,66821,66841,66851,66853,66863,66877,66883,66889,66919,66923,66931,66943,66947,66949,66959,66973,66977,67003,67021,67033,67043,67049,67057,67061,67073,67079,67103,67121,67129,67139,67141,67153,67157,67169,67181,67187,67189,67211,67213,67217,67219,67231,67247,67261,67271,67273,67289,67307,67339,67343,67349,67369,67391,67399,67409,67411,67421,67427,67429,67433,67447,67453,67477,67481,67489,67493,67499,67511,67523,67531,67537,67547,67559,67567,67577,67579,67589,67601,67607,67619,67631,67651,67679,67699,67709,67723,67733,67741,67751,67757,67759,67763,67777,67783,67789,67801,67807,67819,67829,67843,67853,67867,67883,67891,67901,67927,67931,67933,67939,67943,67957,67961,67967,67979,67987,67993,68023,68041,68053,68059,68071,68087,68099,68111,68113,68141,68147,68161,68171,68207,68209,68213,68219,68227,68239,68261,68279,68281,68311,68329,68351,68371,68389,68399,68437,68443,68447,68449,68473,68477,68483,68489,68491,68501,68507,68521,68531,68539,68543,68567,68581,68597,68611,68633,68639,68659,68669,68683,68687,68699,68711,68713,68729,68737,68743,68749,68767,68771,68777,68791,68813,68819,68821,68863,68879,68881,68891,68897,68899,68903,68909,68917,68927,68947,68963,68993,69001,69011,69019,69029,69031,69061,69067,69073,69109,69119,69127,69143,69149,69151,69163,69191,69193,69197,69203,69221,69233,69239,69247,69257,69259,69263,69313,69317,69337,69341,69371,69379,69383,69389,69401,69403,69427,69431,69439,69457,69463,69467,69473,69481,69491,69493,69497,69499,69539,69557,69593,69623,69653,69661,69677,69691,69697,69709,69737,69739,69761,69763,69767,69779,69809,69821,69827,69829,69833,69847,69857,69859,69877,69899,69911,69929,69931,69941,69959,69991,69997,70001,70003,70009,70019,70039,70051,70061,70067,70079,70099,70111,70117,70121,70123,70139,70141,70157,70163,70177,70181,70183,70199,70201,70207,70223,70229,70237,70241,70249,70271,70289,70297,70309,70313,70321,70327,70351,70373,70379,70381,70393,70423,70429,70439,70451,70457,70459,70481,70487,70489,70501,70507,70529,70537,70549,70571,70573,70583,70589,70607,70619,70621,70627,70639,70657,70663,70667,70687,70709,70717,70729,70753,70769,70783,70793,70823,70841,70843,70849,70853,70867,70877,70879,70891,70901,70913,70919,70921,70937,70949,70951,70957,70969,70979,70981,70991,70997,70999,71011,71023,71039,71059,71069,71081,71089,71119,71129,71143,71147,71153,71161,71167,71171,71191,71209,71233,71237,71249,71257,71261,71263,71287,71293,71317,71327,71329,71333,71339,71341,71347,71353,71359,71363,71387,71389,71399,71411,71413,71419,71429,71437,71443,71453,71471,71473,71479,71483,71503,71527,71537,71549,71551,71563,71569,71593,71597,71633,71647,71663,71671,71693,71699,71707,71711,71713,71719,71741,71761,71777,71789,71807,71809,71821,71837,71843,71849,71861,71867,71879,71881,71887,71899,71909,71917,71933,71941,71947,71963,71971,71983,71987,71993,71999,72019,72031,72043,72047,72053,72073,72077,72089,72091,72101,72103,72109,72139,72161,72167,72169,72173,72211,72221,72223,72227,72229,72251,72253,72269,72271,72277,72287,72307,72313,72337,72341,72353,72367,72379,72383,72421,72431,72461,72467,72469,72481,72493,72497,72503,72533,72547,72551,72559,72577,72613,72617,72623,72643,72647,72649,72661,72671,72673,72679,72689,72701,72707,72719,72727,72733,72739,72763,72767,72797,72817,72823,72859,72869,72871,72883,72889,72893,72901,72907,72911,72923,72931,72937,72949,72953,72959,72973,72977,72997,73009,73013,73019,73037,73039,73043,73061,73063,73079,73091,73121,73127,73133,73141,73181,73189,73237,73243,73259,73277,73291,73303,73309,73327,73331,73351,73361,73363,73369,73379,73387,73417,73421,73433,73453,73459,73471,73477,73483,73517,73523,73529,73547,73553,73561,73571,73583,73589,73597,73607,73609,73613,73637,73643,73651,73673,73679,73681,73693,73699,73709,73721,73727,73751,73757,73771,73783,73819,73823,73847,73849,73859,73867,73877,73883,73897,73907,73939,73943,73951,73961,73973,73999,74017,74021,74027,74047,74051,74071,74077,74093,74099,74101,74131,74143,74149,74159,74161,74167,74177,74189,74197,74201,74203,74209,74219,74231,74257,74279,74287,74293,74297,74311,74317,74323,74353,74357,74363,74377,74381,74383,74411,74413,74419,74441,74449,74453,74471,74489,74507,74509,74521,74527,74531,74551,74561,74567,74573,74587,74597,74609,74611,74623,74653,74687,74699,74707,74713,74717,74719,74729,74731,74747,74759,74761,74771,74779,74797,74821,74827,74831,74843,74857,74861,74869,74873,74887,74891,74897,74903,74923,74929,74933,74941,74959,75011,75013,75017,75029,75037,75041,75079,75083,75109,75133,75149,75161,75167,75169,75181,75193,75209,75211,75217,75223,75227,75239,75253,75269,75277,75289,75307,75323,75329,75337,75347,75353,75367,75377,75389,75391,75401,75403,75407,75431,75437,75479,75503,75511,75521,75527,75533,75539,75541,75553,75557,75571,75577,75583,75611,75617,75619,75629,75641,75653,75659,75679,75683,75689,75703,75707,75709,75721,75731,75743,75767,75773,75781,75787,75793,75797,75821,75833,75853,75869,75883,75913,75931,75937,75941,75967,75979,75983,75989,75991,75997,76001,76003,76031,76039,76079,76081,76091,76099,76103,76123,76129,76147,76157,76159,76163,76207,76213,76231,76243,76249,76253,76259,76261,76283,76289,76303,76333,76343,76367,76369,76379,76387,76403,76421,76423,76441,76463,76471,76481,76487,76493,76507,76511,76519,76537,76541,76543,76561,76579,76597,76603,76607,76631,76649,76651,76667,76673,76679,76697,76717,76733,76753,76757,76771,76777,76781,76801,76819,76829,76831,76837,76847,76871,76873,76883,76907,76913,76919,76943,76949,76961,76963,76991,77003,77017,77023,77029,77041,77047,77069,77081,77093,77101,77137,77141,77153,77167,77171,77191,77201,77213,77237,77239,77243,77249,77261,77263,77267,77269,77279,77291,77317,77323,77339,77347,77351,77359,77369,77377,77383,77417,77419,77431,77447,77471,77477,77479,77489,77491,77509,77513,77521,77527,77543,77549,77551,77557,77563,77569,77573,77587,77591,77611,77617,77621,77641,77647,77659,77681,77687,77689,77699,77711,77713,77719,77723,77731,77743,77747,77761,77773,77783,77797,77801,77813,77839,77849,77863,77867,77893,77899,77929,77933,77951,77969,77977,77983,77999,78007,78017,78031,78041,78049,78059,78079,78101,78121,78137,78139,78157,78163,78167,78173,78179,78191,78193,78203,78229,78233,78241,78259,78277,78283,78301,78307,78311,78317,78341,78347,78367,78401,78427,78437,78439,78467,78479,78487,78497,78509,78511,78517,78539,78541,78553,78569,78571,78577,78583,78593,78607,78623,78643,78649,78653,78691,78697,78707,78713,78721,78737,78779,78781,78787,78791,78797,78803,78809,78823,78839,78853,78857,78877,78887,78889,78893,78901,78919,78929,78941,78977,78979,78989,79031,79039,79043,79063,79087,79103,79111,79133,79139,79147,79151,79153,79159,79181,79187,79193,79201,79229,79231,79241,79259,79273,79279,79283,79301,79309,79319,79333,79337,79349,79357,79367,79379,79393,79397,79399,79411,79423,79427,79433,79451,79481,79493,79531,79537,79549,79559,79561,79579,79589,79601,79609,79613,79621,79627,79631,79633,79657,79669,79687,79691,79693,79697,79699,79757,79769,79777,79801,79811,79813,79817,79823,79829,79841,79843,79847,79861,79867,79873,79889,79901,79903,79907,79939,79943,79967,79973,79979,79987,79997,79999,80021,80039,80051,80071,80077,80107,80111,80141,80147,80149,80153,80167,80173,80177,80191,80207,80209,80221,80231,80233,80239,80251,80263,80273,80279,80287,80309,80317,80329,80341,80347,80363,80369,80387,80407,80429,80447,80449,80471,80473,80489,80491,80513,80527,80537,80557,80567,80599,80603,80611,80621,80627,80629,80651,80657,80669,80671,80677,80681,80683,80687,80701,80713,80737,80747,80749,80761,80777,80779,80783,80789,80803,80809,80819,80831,80833,80849,80863,80897,80909,80911,80917,80923,80929,80933,80953,80963,80989,81001,81013,81017,81019,81023,81031,81041,81043,81047,81049,81071,81077,81083,81097,81101,81119,81131,81157,81163,81173,81181,81197,81199,81203,81223,81233,81239,81281,81283,81293,81299,81307,81331,81343,81349,81353,81359,81371,81373,81401,81409,81421,81439,81457,81463,81509,81517,81527,81533,81547,81551,81553,81559,81563,81569,81611,81619,81629,81637,81647,81649,81667,81671,81677,81689,81701,81703,81707,81727,81737,81749,81761,81769,81773,81799,81817,81839,81847,81853,81869,81883,81899,81901,81919,81929,81931,81937,81943,81953,81967,81971,81973,82003,82007,82009,82013,82021,82031,82037,82039,82051,82067,82073,82129,82139,82141,82153,82163,82171,82183,82189,82193,82207,82217,82219,82223,82231,82237,82241,82261,82267,82279,82301,82307,82339,82349,82351,82361,82373,82387,82393,82421,82457,82463,82469,82471,82483,82487,82493,82499,82507,82529,82531,82549,82559,82561,82567,82571,82591,82601,82609,82613,82619,82633,82651,82657,82699,82721,82723,82727,82729,82757,82759,82763,82781,82787,82793,82799,82811,82813,82837,82847,82883,82889,82891,82903,82913,82939,82963,82981,82997,83003,83009,83023,83047,83059,83063,83071,83077,83089,83093,83101,83117,83137,83177,83203,83207,83219,83221,83227,83231,83233,83243,83257,83267,83269,83273,83299,83311,83339,83341,83357,83383,83389,83399,83401,83407,83417,83423,83431,83437,83443,83449,83459,83471,83477,83497,83537,83557,83561,83563,83579,83591,83597,83609,83617,83621,83639,83641,83653,83663,83689,83701,83717,83719,83737,83761,83773,83777,83791,83813,83833,83843,83857,83869,83873,83891,83903,83911,83921,83933,83939,83969,83983,83987,84011,84017,84047,84053,84059,84061,84067,84089,84121,84127,84131,84137,84143,84163,84179,84181,84191,84199,84211,84221,84223,84229,84239,84247,84263,84299,84307,84313,84317,84319,84347,84349,84377,84389,84391,84401,84407,84421,84431,84437,84443,84449,84457,84463,84467,84481,84499,84503,84509,84521,84523,84533,84551,84559,84589,84629,84631,84649,84653,84659,84673,84691,84697,84701,84713,84719,84731,84737,84751,84761,84787,84793,84809,84811,84827,84857,84859,84869,84871,84913,84919,84947,84961,84967,84977,84979,84991,85009,85021,85027,85037,85049,85061,85081,85087,85091,85093,85103,85109,85121,85133,85147,85159,85193,85199,85201,85213,85223,85229,85237,85243,85247,85259,85297,85303,85313,85331,85333,85361,85363,85369,85381,85411,85427,85429,85439,85447,85451,85453,85469,85487,85513,85517,85523,85531,85549,85571,85577,85597,85601,85607,85619,85621,85627,85639,85643,85661,85667,85669,85691,85703,85711,85717,85733,85751,85781,85793,85817,85819,85829,85831,85837,85843,85847,85853,85889,85903,85909,85931,85933,85991,85999,86011,86017,86027,86029,86069,86077,86083,86111,86113,86117,86131,86137,86143,86161,86171,86179,86183,86197,86201,86209,86239,86243,86249,86257,86263,86269,86287,86291,86293,86297,86311,86323,86341,86351,86353,86357,86369,86371,86381,86389,86399,86413,86423,86441,86453,86461,86467,86477,86491,86501,86509,86531,86533,86539,86561,86573,86579,86587,86599,86627,86629,86677,86689,86693,86711,86719,86729,86743,86753,86767,86771,86783,86813,86837,86843,86851,86857,86861,86869,86923,86927,86929,86939,86951,86959,86969,86981,86993,87011,87013,87037,87041,87049,87071,87083,87103,87107,87119,87121,87133,87149,87151,87179,87181,87187,87211,87221,87223,87251,87253,87257,87277,87281,87293,87299,87313,87317,87323,87337,87359,87383,87403,87407,87421,87427,87433,87443,87473,87481,87491,87509,87511,87517,87523,87539,87541,87547,87553,87557,87559,87583,87587,87589,87613,87623,87629,87631,87641,87643,87649,87671,87679,87683,87691,87697,87701,87719,87721,87739,87743,87751,87767,87793,87797,87803,87811,87833,87853,87869,87877,87881,87887,87911,87917,87931,87943,87959,87961,87973,87977,87991,88001,88003,88007,88019,88037,88069,88079,88093,88117,88129,88169,88177,88211,88223,88237,88241,88259,88261,88289,88301,88321,88327,88337,88339,88379,88397,88411,88423,88427,88463,88469,88471,88493,88499,88513,88523,88547,88589,88591,88607,88609,88643,88651,88657,88661,88663,88667,88681,88721,88729,88741,88747,88771,88789,88793,88799,88801,88807,88811,88813,88817,88819,88843,88853,88861,88867,88873,88883,88897,88903,88919,88937,88951,88969,88993,88997,89003,89009,89017,89021,89041,89051,89057,89069,89071,89083,89087,89101,89107,89113,89119,89123,89137,89153,89189,89203,89209,89213,89227,89231,89237,89261,89269,89273,89293,89303,89317,89329,89363,89371,89381,89387,89393,89399,89413,89417,89431,89443,89449,89459,89477,89491,89501,89513,89519,89521,89527,89533,89561,89563,89567,89591,89597,89599,89603,89611,89627,89633,89653,89657,89659,89669,89671,89681,89689,89753,89759,89767,89779,89783,89797,89809,89819,89821,89833,89839,89849,89867,89891,89897,89899,89909,89917,89923,89939,89959,89963,89977,89983,89989,90001,90007,90011,90017,90019,90023,90031,90053,90059,90067,90071,90073,90089,90107,90121,90127,90149,90163,90173,90187,90191,90197,90199,90203,90217,90227,90239,90247,90263,90271,90281,90289,90313,90353,90359,90371,90373,90379,90397,90401,90403,90407,90437,90439,90469,90473,90481,90499,90511,90523,90527,90529,90533,90547,90583,90599,90617,90619,90631,90641,90647,90659,90677,90679,90697,90703,90709,90731,90749,90787,90793,90803,90821,90823,90833,90841,90847,90863,90887,90901,90907,90911,90917,90931,90947,90971,90977,90989,90997,91009,91019,91033,91079,91081,91097,91099,91121,91127,91129,91139,91141,91151,91153,91159,91163,91183,91193,91199,91229,91237,91243,91249,91253,91283,91291,91297,91303,91309,91331,91367,91369,91373,91381,91387,91393,91397,91411,91423,91433,91453,91457,91459,91463,91493,91499,91513,91529,91541,91571,91573,91577,91583,91591,91621,91631,91639,91673,91691,91703,91711,91733,91753,91757,91771,91781,91801,91807,91811,91813,91823,91837,91841,91867,91873,91909,91921,91939,91943,91951,91957,91961,91967,91969,91997,92003,92009,92033,92041,92051,92077,92083,92107,92111,92119,92143,92153,92173,92177,92179,92189,92203,92219,92221,92227,92233,92237,92243,92251,92269,92297,92311,92317,92333,92347,92353,92357,92363,92369,92377,92381,92383,92387,92399,92401,92413,92419,92431,92459,92461,92467,92479,92489,92503,92507,92551,92557,92567,92569,92581,92593,92623,92627,92639,92641,92647,92657,92669,92671,92681,92683,92693,92699,92707,92717,92723,92737,92753,92761,92767,92779,92789,92791,92801,92809,92821,92831,92849,92857,92861,92863,92867,92893,92899,92921,92927,92941,92951,92957,92959,92987,92993,93001,93047,93053,93059,93077,93083,93089,93097,93103,93113,93131,93133,93139,93151,93169,93179,93187,93199,93229,93239,93241,93251,93253,93257,93263,93281,93283,93287,93307,93319,93323,93329,93337,93371,93377,93383,93407,93419,93427,93463,93479,93481,93487,93491,93493,93497,93503,93523,93529,93553,93557,93559,93563,93581,93601,93607,93629,93637,93683,93701,93703,93719,93739,93761,93763,93787,93809,93811,93827,93851,93871,93887,93889,93893,93901,93911,93913,93923,93937,93941,93949,93967,93971,93979,93983,93997,94007,94009,94033,94049,94057,94063,94079,94099,94109,94111,94117,94121,94151,94153,94169,94201,94207,94219,94229,94253,94261,94273,94291,94307,94309,94321,94327,94331,94343,94349,94351,94379,94397,94399,94421,94427,94433,94439,94441,94447,94463,94477,94483,94513,94529,94531,94541,94543,94547,94559,94561,94573,94583,94597,94603,94613,94621,94649,94651,94687,94693,94709,94723,94727,94747,94771,94777,94781,94789,94793,94811,94819,94823,94837,94841,94847,94849,94873,94889,94903,94907,94933,94949,94951,94961,94993,94999,95003,95009,95021,95027,95063,95071,95083,95087,95089,95093,95101,95107,95111,95131,95143,95153,95177,95189,95191,95203,95213,95219,95231,95233,95239,95257,95261,95267,95273,95279,95287,95311,95317,95327,95339,95369,95383,95393,95401,95413,95419,95429,95441,95443,95461,95467,95471,95479,95483,95507,95527,95531,95539,95549,95561,95569,95581,95597,95603,95617,95621,95629,95633,95651,95701,95707,95713,95717,95723,95731,95737,95747,95773,95783,95789,95791,95801,95803,95813,95819,95857,95869,95873,95881,95891,95911,95917,95923,95929,95947,95957,95959,95971,95987,95989,96001,96013,96017,96043,96053,96059,96079,96097,96137,96149,96157,96167,96179,96181,96199,96211,96221,96223,96233,96259,96263,96269,96281,96289,96293,96323,96329,96331,96337,96353,96377,96401,96419,96431,96443,96451,96457,96461,96469,96479,96487,96493,96497,96517,96527,96553,96557,96581,96587,96589,96601,96643,96661,96667,96671,96697,96703,96731,96737,96739,96749,96757,96763,96769,96779,96787,96797,96799,96821,96823,96827,96847,96851,96857,96893,96907,96911,96931,96953,96959,96973,96979,96989,96997,97001,97003,97007,97021,97039,97073,97081,97103,97117,97127,97151,97157,97159,97169,97171,97177,97187,97213,97231,97241,97259,97283,97301,97303,97327,97367,97369,97373,97379,97381,97387,97397,97423,97429,97441,97453,97459,97463,97499,97501,97511,97523,97547,97549,97553,97561,97571,97577,97579,97583,97607,97609,97613,97649,97651,97673,97687,97711,97729,97771,97777,97787,97789,97813,97829,97841,97843,97847,97849,97859,97861,97871,97879,97883,97919,97927,97931,97943,97961,97967,97973,97987,98009,98011,98017,98041,98047,98057,98081,98101,98123,98129,98143,98179,98207,98213,98221,98227,98251,98257,98269,98297,98299,98317,98321,98323,98327,98347,98369,98377,98387,98389,98407,98411,98419,98429,98443,98453,98459,98467,98473,98479,98491,98507,98519,98533,98543,98561,98563,98573,98597,98621,98627,98639,98641,98663,98669,98689,98711,98713,98717,98729,98731,98737,98773,98779,98801,98807,98809,98837,98849,98867,98869,98873,98887,98893,98897,98899,98909,98911,98927,98929,98939,98947,98953,98963,98981,98993,98999,99013,99017,99023,99041,99053,99079,99083,99089,99103,99109,99119,99131,99133,99137,99139,99149,99173,99181,99191,99223,99233,99241,99251,99257,99259,99277,99289,99317,99347,99349,99367,99371,99377,99391,99397,99401,99409,99431,99439,99469,99487,99497,99523,99527,99529,99551,99559,99563,99571,99577,99581,99607,99611,99623,99643,99661,99667,99679,99689,99707,99709,99713,99719,99721,99733,99761,99767,99787,99793,99809,99817,99823,99829,99833,99839,99859,99871,99877,99881,99901,99907,99923,99929,99961,99971,99989,99991,100003]
for n in bigger_prime_list:
if x <= n:
print(n)
break
| def crivo(n):
primos = [True] * n
primos[0] = primos[1] = False
i = 2
while i * i < n:
if primos[i] == True:
for j in range(2*i, n, i):
primos[j] = False
i += 1
return primos
def main():
primos = crivo(100004)
x = int(eval(input()))
for i in range(x, 100004):
if primos[i]:
print(i)
break
main() | p02819 |
n = int(eval(input()))
pr = []
i = 2
while(True):
for p in pr:
if(i % p == 0):break
else:
if(i >= n):
print(i)
exit()
pr.append(i)
i += 1
| import random
def is_prime(q,k=50):
q = abs(q)
if q == 2: return True
if q < 2 or q&1 == 0: return False
d = (q-1)>>1
while d&1 == 0:
d >>= 1
for i in range(k):
a = random.randint(1,q-1)
t = d
y = pow(a,t,q)
while t != q-1 and y != 1 and y != q-1:
y = pow(y,2,q)
t <<= 1
if y != q-1 and t&1 == 0:
return False
return True
n = int(eval(input()))
i = n
while(not is_prime(i)):i += 1
print(i)
| p02819 |
x=int(eval(input()))
ans=x-1
cnt=0
while cnt==0:
cnt=1
ans+=1
for i in range(2,ans):
if ans%i==0:
cnt=0
print(ans) | x=int(eval(input()))
ans=x-1
cnt=0
while cnt==0:
cnt=1
ans+=1
for i in range(2,ans):
if ans%i==0:
cnt=0
break
print(ans) | p02819 |
X = int(eval(input()))
def is_prime(x):
if x == 2:
return True
if x % 2 == 0:
return False
else:
for i in range(3, x, 2):
if x % i == 0:
return False
return True
a = X
if (X % 2 == 0) & (X > 2):
a += 1
while 1:
if is_prime(a):
print(a)
break
else:
a += 2
| import math
X = int(eval(input()))
def is_prime(x):
if x == 2:
return True
if x % 2 == 0:
return False
else:
for i in range(3, int(math.sqrt(x))+1, 2):
if x % i == 0:
return False
return True
a = X
if (X % 2 == 0) & (X > 2):
a += 1
while 1:
if is_prime(a):
print(a)
break
else:
a += 2
| p02819 |
from bisect import bisect
def main():
maxa2 = 200000
maxa2 = max(6, maxa2) # maxa2が6未満だとエラーになる
p = [False if i % 2 == 0 or i % 3 == 0 or i % 5 == 0 else True for i in range(maxa2)]
p[0] = p[1] = False
p[2] = p[3] = p[5] = True
for is1 in range(3, maxa2, 2):
for is2 in range(is1 ** 2, maxa2, is1):
p[is2] = False
prime_list = [i for i, b in enumerate(p) if b]
x = int(eval(input()))
if x in prime_list:
print(x)
else:
xp = bisect(prime_list, x)
r = prime_list[xp]
print(r)
if __name__ == '__main__':
main() | from math import sqrt, ceil
def main():
x = int(eval(input()))
while True:
for i1 in range(2, ceil(sqrt(x))):
if x % i1 == 0:
x += 1
break
else:
break
print(x)
if __name__ == '__main__':
main()
| p02819 |
x = int(eval(input()))
num = 101000
arr = list(range(2,num))
arr = set(arr)
primes = {2}
prime = min(arr)
while prime < num-500:
primes.add(prime)
nonprime = {prime * i for i in range(1,num//prime + 2)}
arr = arr.difference(nonprime)
prime = min(arr)
sol = {i for i in primes if i >= x}
print((min(sol))) | x = int(eval(input()))
num = 100200
arr = list(range(2,num))
arr = set(arr)
primes = {2}
floor = int(num**0.5)+2
prime = min(arr)
while prime < floor:
prime = min(arr)
primes.add(prime)
nonprime = {prime * i for i in range(1,num//prime + 2)}
arr = arr.difference(nonprime)
primes = primes.union(arr)
sol = {i for i in primes if i >= x}
print((min(sol))) | p02819 |
# ABC149 C - Next Prime
X = int(eval(input()))
def isPrime(n):
cnt = 0
for i in range(1, n + 1):
if n % i == 0:
cnt += 1
if cnt == 2:
return True
else:
return False
while True:
if isPrime(X):
print(X)
break
else:
X += 1 | # ABC149 C - Next Prime
X = int(eval(input()))
def isPrime(n):
for i in range(2, n):
if n % i == 0:
return False
return True
while True:
if isPrime(X):
print(X)
break
else:
X += 1 | p02819 |
x= int(eval(input()))
a = [2]
n = 2
while a[-1] < x:
n += 1
if all(n%i for i in a):
a.append(n)
print(n) | def f(n):
if n==2:return 2
for i in range(2,[n, 5][n>5]):
if i**n%n != i:
return f(n+1)
return n
print((f(int(eval(input()))))) | p02819 |
x=int(eval(input()))
cont=0
for i in range(x,10**12):
for j in range(2,i):
if i%j==0:
cont+=1
if cont==0:
print(i)
exit()
cont=0 | x=int(eval(input()))
j=x
while True:
cnt=0
for i in range(2,j+1):
if j%i==0:
cnt+=1
if cnt==1:
print(j)
exit()
else:
j+=1 | p02819 |
x = int(eval(input()))
flg = 0
def isPrimenum(n):
if n < 2:
return False
if n == 2:
return True
for p in range(2, n):
if n % p == 0:
return False
return True
while flg == 0:
if isPrimenum(x) == True:
flg = 1
break
x += 1
print (x)
| import math
n = int(eval(input()))
def check(s):
if s == 1:
return False
for i in range(2, int(math.sqrt(s)) + 1):
if s%i == 0:
return False
return True
for i in range(n,10**6):
if check(i):
print (i)
exit()
| p02819 |
#探索範囲増やすとどのくらい時間が伸びるのか
x=int(eval(input()))
def is_prime(p):
cnt=0
for i in range(2,p):
if p%i==0:
cnt+=1
if cnt==0:
return True
#2からp-1までみて、cntが0ならpは素数
else:
return False
#print(*[(x,is_prime(x)) for x in range(1,10+1)])
num=x
while True:
if is_prime(num):
ans=num
break
num+=1
print(ans)
| x=int(eval(input()))
mod=10**7+9
for i in range(x,mod):
if not any(i%j==0 for j in range(2,i+1-1)):
ans=i
break
print(ans) | p02819 |
import math
for i in range(int(eval(input())),100004):
ri = math.floor(i**0.5) + 1
for j in range(ri):
for k in range(ri,i):
if j*k == i:
break
else:
continue
break
else:
print(i)
break | for i in range(int(eval(input())),100004):
for j in range(2, i):
if i % j == 0:
break
else:
print(i)
break | p02819 |
n = int(eval(input()))
while 1:
for i in range(2, n):
if n % i == 0:
break
else:
print(n)
break
n += 1 | x=int(eval(input()))
while 1:
if all(x%i for i in range(2,int(x**.5)+1)):
print(x); break
x+=1 | p02819 |
import math
x=int(eval(input()))
def is_prime(x):
ma = math.ceil(math.sqrt(x))
for i in range(2,ma):
if x%i==0:
return False
else:
return True
while(1):
if x==1:
x+=1
continue
if is_prime(x):
print(x)
break
x+=1 | import math
x=int(eval(input()))
def is_prime(x):
ma = math.ceil(math.sqrt(x))
for i in range(2,ma+1):
if x%i==0:
return False
else:
return True
while(1):
if x==1:
x+=1
continue
elif x==2:
print(x)
break
if is_prime(x):
print(x)
break
x+=1 | p02819 |
X = int(eval(input()))
LEN = int(1e6)
p = [True] * LEN
p[0] = False
p[1] = False
for i in range(LEN):
if p[i]:
for j in range(i * 2, LEN, i):
p[j] = False
for i in range(X, LEN):
if p[i]:
print(i)
exit()
| X = int(eval(input()))
LEN = int(1e6)
p = [True] * LEN
p[0] = False
p[1] = False
for i in range(LEN):
if p[i]:
if i >= X:
print(i)
exit()
for j in range(i * 2, LEN, i):
p[j] = False
| p02819 |
#coding:utf-8
import math
import collections
def prime():
prime = [2, 3]
for i in range(5, 1000000, 2):
flag = True
for j in range(1, len(prime)):
if prime[j] ** 2 > i:
break
if i % prime[j] == 0:
flag = False
break
if flag:
prime.append(i)
return prime
if __name__ == "__main__":
x = int(eval(input()))
prime = prime()
#print(prime)
for num in prime:
if int(num) >= x:
print(num)
break | #coding:utf-8
import math
#素数判定
def prime(n):
if n == 2:
return True
elif (n < 2) or (n % 2 == 0):
return False
else:
i = 3
while i <= math.sqrt(n):
if n % i == 0:
return False
i += 2
return True
if __name__ == "__main__":
x = int(eval(input()))
num = x
while prime(num) == False:
num += 1
print(num) | p02819 |
def nprime(x):
prim=[]
i=1
while(1):
i+=1
non=False
for num in prim:
if i%num==0:
non=True
break
if non:
continue
elif(i>=x):
return i
prim.append(i)
print((nprime(int(eval(input()))))) | import math
def prim(x):
for i in range(2,math.floor(math.sqrt(x))):
if not x%i:
return 0
return 1
def np(x):
while(1):
if prim(x):
return x
else:
x+=1
print((np(int(eval(input()))))) | p02819 |
import math
x=int(eval(input()))
flag=True
if x==2:
print(x)
else:
while flag:
i=2
f=True
while i<x and f:
if x%i==0:
f=False
i+=1
if f==True:
print(x)
flag=False
else:
x+=1
| import math
x=int(eval(input()))
flag=True
if x==2:
print(x)
else:
while flag:
i=2
f=True
while i<math.sqrt(x) and f:
if x%i==0:
f=False
i+=1
if f==True:
print(x)
flag=False
else:
x+=1
| p02819 |
X=int(eval(input()))
f=False
a=X
if X==2:
print("2")
exit()
while f==False:
for i in range(2,a+1):
if a%i==0:
break
if i==a-1:
f=True
a+=1
print((a-1))
| X=int(eval(input()))
f=False
a=X
if X==2 or X==3:
print(X)
exit()
while f==False:
for i in range(2,int(a**0.5)+1):
if a%i==0:
break
if i==int(a**0.5):
f=True
a+=1
print((a-1)) | p02819 |
MAX=200000
def get_prime(x):
is_prime = [True] * 200000
for i in range(2,MAX):
if is_prime[i] and i >= x:
return i
elif is_prime[i]:
for j in range(2 * i, MAX, i):
is_prime[j] = False
print((get_prime(int(eval(input())))))
| # Original Submission At: https://atcoder.jp/contests/abc149/submissions/16823042
import sys
sys.setrecursionlimit(1000000)
x= int(eval(input()))
def prime_check(num,count):
if (num % count) != 0:
if num <= count**2:
print(num)
else:
prime_check(num,count+1)
else :
prime_check(num+1,2)
if x==2 :
print((2))
else:
prime_check(x,2)
| p02819 |
# Original Submission At: https://atcoder.jp/contests/abc149/submissions/16823042
import sys
sys.setrecursionlimit(1000000)
x= int(eval(input()))
def prime_check(num,count):
if (num % count) != 0:
if num <= count**2:
print(num)
else:
prime_check(num,count+1)
else :
prime_check(num+1,2)
if x==2 :
print((2))
else:
prime_check(x,2)
| # Original Submission At: https://atcoder.jp/contests/abc149/submissions/16823042
x= int(eval(input()))
def prime_check(num,count):
while True:
while num % count == 0:
num = num + 1
count = 2
if num <= count**2:
print(num)
break
else:
count = count + 1
if x==2 :
print((2))
else:
prime_check(x,2)
| p02819 |
import math
x = int(eval(input()))
n = 10**6
flag = [True]*(n+1)
for i in range(4, n+1, 2):
flag[i] = False
t = int(n**0.5)+1
for i in range(3, t, 2):
for j in range(i+i, n+1, i):
flag[j] = False
for i in range(x,n+1):
if flag[i]:
print(i)
exit() | x = int(eval(input()))
n = 10**6
nums = [True]*(n+1)
nums[0] = nums[1] = False
for i in range(4, n+1, 2): nums[i] = False
for i in range(3, int(n**0.5)+1, 2):
if nums[i]:
for j in range(i+i, n, i):
nums[j] = False
while True:
if nums[x]:
print(x)
break
x += 1 | p02819 |
x = int(eval(input()))
n = 10**6
nums = [True]*(n+1)
nums[0] = nums[1] = False
for i in range(4, n+1, 2): nums[i] = False
for i in range(3, int(n**0.5)+1, 2):
if nums[i]:
for j in range(i+i, n, i):
nums[j] = False
while True:
if nums[x]:
print(x)
break
x += 1 | x = int(eval(input()))
flag = [True]*(10**6+1)
flag[0] = flag[1] = False
for i in range(4, 10**6+1,2): flag[i] = False
for i in range(3, int((10**6)**0.5)+1, 2):
if flag[i]:
for j in range(i+i, 10**6+1, i): flag[j] = False
while True:
if flag[x]:
print(x)
exit()
x += 1 | p02819 |
x = int(eval(input()))
flag = [True]*(10**6+1)
flag[0] = flag[1] = False
for i in range(4, 10**6+1,2): flag[i] = False
for i in range(3, int((10**6)**0.5)+1, 2):
if flag[i]:
for j in range(i+i, 10**6+1, i): flag[j] = False
while True:
if flag[x]:
print(x)
exit()
x += 1 | x = int(eval(input()))
nums = [True]*(10**6)
n = int(10**6**0.5)
for i in range(4, 10**6, 2): nums[i] = False
for i in range(3, n, 2):
if nums[i]:
for j in range(i+i, 10**6, i): nums[j] = False
while True:
if nums[x]:
print(x)
break
x += 1 | p02819 |
def solve():
from bisect import bisect_right, bisect, bisect_left
x = int(eval(input()))
n = 100100
primes = set(range(2, n + 1))
for i in range(2, int(n ** 0.5 + 1)):
if i not in primes:
i += 1
else:
ran = list(range(i * 2, n + 1, i))
primes.difference_update(ran)
primes = list(primes)
y = bisect_left(primes, x)
print((primes[y]))
solve()
| def solve():
x = int(eval(input()))
def is_prime(n):
for i in range(2, int(x ** 0.5) + 1):
if n % i == 0:
return False
return True
while not is_prime(x):
x += 1
print(x)
solve()
| p02819 |
def check(num):
if num > 1:
for i in range(2, num):
if (num % i) == 0:
return False
break
else:
return True
else:
return False
a = int(eval(input()))
for i in range(a, 100500):
if check(i):
print(i)
break | def is_prime(num):
i = 5
while (i * i <= num):
if num % i == 0 or num % (i+2) ==0:
return False
i+=6
return True if num > 1 and num <=3 else False if num % 2 == 0 or num % 3 == 0 or num <=1 else True
k = int(eval(input()))
if is_prime(k):
print(k)
else:
while(not is_prime(k)):
k +=1
print(k) | p02819 |
X = int(eval(input()))
n = 2 * X
is_prime = [False] * 2 + [True] * (n - 1)
for i in range(2, int(n ** 0.5) + 1): # 素数候補
if not is_prime[i]: continue
for j in range(2 * i, n + 1, i):
is_prime[j] = False
for i in range(X, n):
if is_prime[i]:
print(i)
break | X = int(eval(input()))
p = X
while True:
for j in range(2, int(p ** 0.5) + 1):
if p % j == 0: break
else:
break
p += 1
print(p) | p02819 |
import sys
input=sys.stdin.readline
X = int(eval(input()))
prime = [2]
if X == 2:
print((2))
else:
for i in range(2,X):
c = 0
for j in prime:
if i % j == 0:
c = 1
break
if c == 0:
prime.append(i)
for i in range(X,X + 1000):
c = 0
for j in prime:
if i % j == 0:
c = 1
break
if c == 0:
print(i)
break | import sys
input=sys.stdin.readline
import math
X = int(eval(input()))
if X == 2:
print((2))
else:
x = math.ceil(math.sqrt(X))
for i in range(X,X+1000):
c = 0
for j in range(2,x+1):
if i % j == 0:
c = 1
break
if c == 0:
print(i)
break | p02819 |
#!/usr/bin/env python3
# -*- coding:utf-8 -*-
def prime(ulim=10**5+10):
cands = [2] + list(range(3, ulim, 2))
while len(cands) != 0:
prime = cands.pop(0)
cands = [x for x in cands if x%prime != 0]
yield prime
if __name__=='__main__':
x = int(eval(input()))
for p in prime():
if p >= x:
print(p)
break | #!/usr/bin/env python3
# -*- coding:utf-8 -*-
from math import sqrt
def prime(ulim=10**5+10):
cands = [2] + list(range(3, ulim, 2))
primes = []
while True:
prime = cands.pop(0)
primes.append(prime)
if prime > sqrt(ulim):
primes += cands
break
cands = [x for x in cands if x%prime != 0]
return primes
if __name__=='__main__':
x = int(eval(input()))
for p in prime():
if p >= x:
print(p)
break | p02819 |
X=int(eval(input()))
flag=1
if X==2:
flag=0
while(flag==1):
for i in range(2,X+1):
if(X%i==0):
X+=1
break
if(i==X-1):
flag=0
break
print(X) | X=int(eval(input()))
def prime(N):
for i in range(2,N-1):
if N%i==0:
return -1
return N
for x in range(X,10**10):
if prime(x)==x:
print(x)
break | p02819 |
import bisect
x = int(eval(input()))
def get_prime(n):
if n <= 1: return []
limit = int(n**0.5)
prime = [2]
data = [i+1 for i in range(2,n,2)]
while limit >= data[0]:
prime.append(data[0])
data = [j for j in data if j % data[0] != 0]
return prime + data
l = get_prime(10**5+3)
i = bisect.bisect_right(l, x)
if l[i-1] == x: print(x)
else: print((l[i])) | x = int(eval(input()))
def is_prime(n):
if n <= 1: return False
for i in range(2, int(n**0.5)+1):
if n % i == 0: return False
return True
if not is_prime(x):
while not is_prime(x):
x += 1
print(x) | p02819 |
prims = list()
prims.append(2)
base = int(eval(input()))
def _is_prim(n):
global prims
for p in prims:
if n == p:
return True
elif n % p == 0:
return False
return True
# 入力値までの素数を作る
for n in range(base):
if n < 2:
continue
elif n % 2 == 0:
continue
elif _is_prim(n):
prims.append(n)
# 作った素数値で。。。
while not _is_prim(base):
base += 1
print(base)
| import math
prims = list()
prims.append(2)
base = int(eval(input()))
def _is_prim(n):
global prims
for p in prims:
if n == p:
return True
elif n % p == 0:
return False
return True
# 入力値の平方根までの素数を作る
rt = int(math.sqrt(base))
for n in range(rt):
if n < 2:
continue
elif n % 2 == 0:
continue
elif _is_prim(n):
prims.append(n)
# 作った素数値で。。。
while not _is_prim(base):
base += 1
print(base) | p02819 |
n = int(eval(input()))
const = 10**5+100
a = [i for i in range(2,const+1)]
prime = []
for i in a:
prime.append(i)
if i > int(n**0.5):
break
a = [j for j in a if j % i != 0]
prime += a
ans = [i for i in a if i >= n][0]
print(ans) | import sys
n = int(eval(input()))
while True:
for i in range(2, int(n**0.5+1)):
if n % i == 0:
break
else:
print(n)
sys.exit()
n = n + 1 | p02819 |
X = int(eval(input()))
def notco(x, lst):
for i in range(len(lst)):
if x % lst[i] == 0:
return False
return True
def minp(x):
primes = [2]
i = 3
while(primes[len(primes)-1] < x):
if notco(i, primes):
primes.append(i)
i += 1
return primes[len(primes)-1]
print((minp(X))) | X = int(eval(input()))
def isprime(x):
for i in range(2, x//2+1):
if x % i == 0:
return False
return True
def minp(x):
res = x
while True:
if isprime(res):
return res
res += 1
print((minp(X)))
| p02819 |
x = int(eval(input()))
tmp = 0
if x == 2:
print((2))
exit()
for i in range(x,10**111):
for j in range(2,(i//2)+2):
tmp += 1
if i%j == 0:
break
elif tmp == (i//2):
print(i)
exit()
| x = int(eval(input()))
tmp = 0
if x == 2:
print((2))
exit()
for i in range(x,10**111):
for j in range(2,(i//2)+2):
tmp += 1
if i%j == 0:
tmp = 0
break
elif tmp == (i//2):
print(i)
exit() | p02819 |
maxA = 10**6
X = int(eval(input()))
def getIsPrimes(n):
isPrimes = [False]*2 + [True]*(n-1)
for x in range(2*2, n+1, 2):
isPrimes[x] = False
for d in range(3, int(n**0.5)+1):
if isPrimes[d]:
for x in range(d*d, n+1, d):
isPrimes[x] = False
return isPrimes
isPrimes = getIsPrimes(maxA)
for i in range(X, maxA+1):
if isPrimes[i]:
print(i)
break
| maxA = 10**5 + 3
X = int(eval(input()))
def isPrime(x):
for d in range(2, int(x**0.5)+1):
if x%d == 0:
return False
return x != 1
for i in range(X, maxA+1):
if isPrime(i):
print(i)
break
| p02819 |
# -*- Coding: utf-8 -*-
x = int(eval(input()))
min_sosu = x
flg_found = False
for i in range(x, 1000000):
for j in range(2, i*i):
if i%j == 0 and j < x:
break
if i%j == 0 and j >= x and i == j:
min_sosu = i
flg_found = True
print(min_sosu)
break
if flg_found:
break
| # -*- Coding: utf-8 -*-
import math
def is_prime(x):
if x <=1:
return False
for i in range(2, int(math.sqrt(x)+1)):
if x%i == 0:
return False
return True
x = int(eval(input()))
while(not is_prime(x)): x+=1
print(x) | p02819 |
X = int(eval(input()))
while True:
flag = True
for i in range(2, X):
if X % i == 0:
flag = False
if flag: break
X += 1
print(X) | X = int(eval(input()))
# 順に素数判定を行えばよい
def is_prime(x):
if x <= 1:
return False
for i in range(2, x):
if x % i == 0:
return False
return True
p = X
while not is_prime(p):
p += 1
print(p) | p02819 |
N = int(eval(input()))
while True:
judge = 1
for i in range(2, N):
if N % i == 0:
judge *= N % i #素数だとjudgeが0にならない
break
else:
judge *= N % i #素数だとjudgeが0にならない
if judge >= 1:
print(N)
exit()
N += 1 | import math
def is_prime(n):
for k in range(2, int(math.sqrt(n)+1)):
if n % k == 0:
return False
return True
N = int(eval(input()))
while True:
if is_prime(N):
print(N)
exit()
N += 1
| p02819 |
X = int(eval(input()))
memo = [None]*(2*X)
for i,v in enumerate(memo):
if i < 2:
continue
if v is None:
memo[i] = True
for j in range(i*2, 2*X, i):
memo[j] = False
print((next(i+X for i,v in enumerate(memo[X:]) if v))) |
# 素因数分解
def prime_factors(n):
i = 2
while i * i <= n:
if n % i:
i += 1
else:
n //= i
yield i
if n > 1:
yield n
from itertools import count
X = int(eval(input()))
for x in count(X):
if len(tuple(prime_factors(x))) == 1:
print(x)
break | p02819 |
x = int(eval(input()))
while True:
for i in range(2, x):
if x % i == 0:
break
else:
print(x)
break
x += 1
| x = int(eval(input()))
while True:
for i in range(2, int(x**0.5+1)):
if x % i == 0:
break
else:
print(x)
break
x += 1
| p02819 |
x = int(eval(input()))
if x == 2:
print((2))
exit()
i = 3
f = False
while True:
if x % 2 == 0:
x += 1
continue
while i * i <= x:
if x % i == 0:
i += 2
f = True
break
else:
i += 2
if not f:
print(x)
exit()
x += 1
i = 3
f = False | x = int(eval(input()))
i = 2
while True:
while i * i <= x:
if x % i == 0:
break
i += 1
else:
print(x)
exit()
i = 2
x += 1 | p02819 |
def is_prime(n):
if n == 1:
return False
return all(n % i != 0 for i in range(2, int(n**0.5) + 1))
x = int(eval(input()))
print((min(i for i in range(x, 100004) if is_prime(i)))) | def is_prime(n):
if n == 1:
return False
return all(n % i != 0 for i in range(2, int(n**0.5) + 1))
x = int(eval(input()))
while not is_prime(x):
x += 1
print(x) | p02819 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.