結果
問題 | No.1653 Squarefree |
ユーザー | ansain |
提出日時 | 2021-08-20 23:02:33 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,844 bytes |
コンパイル時間 | 229 ms |
コンパイル使用メモリ | 82,328 KB |
実行使用メモリ | 254,176 KB |
最終ジャッジ日時 | 2024-10-14 06:18:58 |
合計ジャッジ時間 | 38,775 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 82 ms
76,408 KB |
testcase_02 | AC | 81 ms
76,644 KB |
testcase_03 | AC | 97 ms
79,744 KB |
testcase_04 | AC | 87 ms
76,272 KB |
testcase_05 | AC | 85 ms
76,336 KB |
testcase_06 | AC | 82 ms
76,016 KB |
testcase_07 | AC | 86 ms
76,220 KB |
testcase_08 | AC | 87 ms
76,604 KB |
testcase_09 | AC | 84 ms
77,164 KB |
testcase_10 | AC | 84 ms
76,192 KB |
testcase_11 | AC | 1,260 ms
253,756 KB |
testcase_12 | AC | 1,261 ms
253,628 KB |
testcase_13 | AC | 1,288 ms
253,536 KB |
testcase_14 | AC | 1,305 ms
253,172 KB |
testcase_15 | AC | 1,298 ms
253,764 KB |
testcase_16 | AC | 1,321 ms
253,540 KB |
testcase_17 | AC | 1,318 ms
253,848 KB |
testcase_18 | AC | 1,332 ms
253,812 KB |
testcase_19 | AC | 1,328 ms
253,432 KB |
testcase_20 | AC | 1,423 ms
253,780 KB |
testcase_21 | AC | 1,331 ms
253,572 KB |
testcase_22 | AC | 1,420 ms
253,864 KB |
testcase_23 | AC | 1,399 ms
253,444 KB |
testcase_24 | WA | - |
testcase_25 | AC | 1,333 ms
253,560 KB |
testcase_26 | AC | 1,322 ms
253,660 KB |
testcase_27 | AC | 1,321 ms
253,436 KB |
testcase_28 | AC | 1,312 ms
253,660 KB |
testcase_29 | AC | 1,326 ms
253,896 KB |
testcase_30 | AC | 1,346 ms
253,452 KB |
testcase_31 | AC | 1,337 ms
253,760 KB |
testcase_32 | AC | 1,440 ms
253,564 KB |
testcase_33 | AC | 1,307 ms
253,312 KB |
testcase_34 | AC | 1,287 ms
253,840 KB |
testcase_35 | AC | 1,302 ms
253,492 KB |
testcase_36 | AC | 87 ms
77,008 KB |
testcase_37 | AC | 86 ms
77,316 KB |
testcase_38 | AC | 86 ms
76,380 KB |
testcase_39 | AC | 84 ms
77,020 KB |
testcase_40 | AC | 82 ms
76,316 KB |
ソースコード
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) 引数i4配列、i8 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]*(10**6+10) lr={i:i for i in range(l,r+1)} check={i:1 for i in range(l,r+1)} for i in range(2,10**6+7): if hurui[i]: for j in range(i*2,10**6+7,i): hurui[j]=0 for j in range((l//i)*i,r+1,i): if l<=j<=r: cnt=0 while lr[j]%i==0: cnt+=1 lr[j]//=i if cnt>=2: check[j]=0 def c(x): sq=sqrt(x) return sq.is_integer() and int(sq)**2==x print(sum(1 for i in range(l,r+1) if check[i] and not(c(i)))+int(l==1)) if __name__ == '__main__': main()