結果

問題 No.1657 Sum is Prime (Easy Version)
ユーザー ansainansain
提出日時 2021-08-27 21:48:28
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 178 ms / 2,000 ms
コード長 1,486 bytes
コンパイル時間 291 ms
コンパイル使用メモリ 81,984 KB
実行使用メモリ 92,352 KB
最終ジャッジ日時 2024-11-21 01:35:41
合計ジャッジ時間 4,939 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
#from math import isqrt, prod, comb #python3.8(notpypy)
#from bisect import bisect_left, bisect_right
from functools import lru_cache, reduce
#from heapq import heappush, heappop, heapify, heappushpop, heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#numba @njit(i1(i4[:], i8[:, :]),cache=True) i4i8 2,i1
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError, maximum_bipartite_matching,
    maximum_flow, minimum_spanning_tree
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k # n/k
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)
def main():
mod = 10**9+7
mod2 = 998244353
l,r=map(int, input().split())
hurui=[1]*(2*10**6+8)
ans=0
for i in range(2,2*10**6+5):
if hurui[i]:
if l<=i<=r:
ans+=1
if i!=2 and l<=i//2 and i//2+1<=r:
ans+=1
for j in range(i*2,2*10**6+3,i):
hurui[j]=0
print(ans)
if __name__ == '__main__':
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0