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... | 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:
... | 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:
re... | 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)
p... | 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 ra... | 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 ra... | 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... | 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:
... | 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 ... | 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)
... | # 予め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):
sx... | 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)
... | 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)
... | 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)
... | 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) * ... | 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[... | 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
... | 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 ... | 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 ... | 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] - ... | 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)
... | 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]
... | # -*- 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-... | 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:... | # -*- 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
... | 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... | 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(... | 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
... | 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 - ... | 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):
... | 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 rang... | # -*- 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 ... | 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*ta... | # -*- 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... | 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((s... | 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... | 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
ban... | 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.ap... | 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.ap... | 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軸ともに各辺を数える回数が分かれば、巨大な長方形の面積はその積で求められる
#
# ... | 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
vs... | 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(): re... | 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(): re... | 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 =... | 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 *... | 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] *... | 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
r... | 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
... | 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
... | 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(ans... | 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,... | 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()))... | 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 ... | 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
... | 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 ... | 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}
... | 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... | 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 +... | # 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):
... | 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(... | 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
... | #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_... | 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:
... | 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)
... | 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)
... | # 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
els... | 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))
pr... | 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)
... | 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)... | 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,... | 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)
... | 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 >... | #!/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 i... | 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 = bis... | 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
el... | 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:
cont... | 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 = 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... | 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_sos... | # -*- 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:
... | 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 = 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.