結果
問題 | No.1653 Squarefree |
ユーザー | XD |
提出日時 | 2021-11-10 20:06:27 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 69 ms / 2,000 ms |
コード長 | 2,995 bytes |
コンパイル時間 | 1,526 ms |
コンパイル使用メモリ | 168,476 KB |
実行使用メモリ | 13,568 KB |
最終ジャッジ日時 | 2024-11-21 11:19:22 |
合計ジャッジ時間 | 5,039 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 63 ms
13,440 KB |
testcase_01 | AC | 19 ms
5,632 KB |
testcase_02 | AC | 19 ms
5,760 KB |
testcase_03 | AC | 19 ms
5,760 KB |
testcase_04 | AC | 19 ms
5,632 KB |
testcase_05 | AC | 20 ms
5,504 KB |
testcase_06 | AC | 20 ms
5,760 KB |
testcase_07 | AC | 19 ms
5,632 KB |
testcase_08 | AC | 19 ms
5,504 KB |
testcase_09 | AC | 19 ms
5,760 KB |
testcase_10 | AC | 19 ms
5,760 KB |
testcase_11 | AC | 57 ms
13,312 KB |
testcase_12 | AC | 53 ms
13,440 KB |
testcase_13 | AC | 63 ms
13,440 KB |
testcase_14 | AC | 62 ms
13,440 KB |
testcase_15 | AC | 64 ms
13,440 KB |
testcase_16 | AC | 62 ms
13,440 KB |
testcase_17 | AC | 67 ms
13,440 KB |
testcase_18 | AC | 66 ms
13,568 KB |
testcase_19 | AC | 66 ms
13,568 KB |
testcase_20 | AC | 65 ms
13,440 KB |
testcase_21 | AC | 65 ms
13,440 KB |
testcase_22 | AC | 64 ms
13,568 KB |
testcase_23 | AC | 65 ms
13,568 KB |
testcase_24 | AC | 60 ms
13,440 KB |
testcase_25 | AC | 60 ms
13,568 KB |
testcase_26 | AC | 60 ms
13,440 KB |
testcase_27 | AC | 64 ms
13,440 KB |
testcase_28 | AC | 61 ms
13,568 KB |
testcase_29 | AC | 63 ms
13,440 KB |
testcase_30 | AC | 67 ms
13,440 KB |
testcase_31 | AC | 64 ms
13,440 KB |
testcase_32 | AC | 66 ms
13,568 KB |
testcase_33 | AC | 69 ms
13,440 KB |
testcase_34 | AC | 65 ms
13,440 KB |
testcase_35 | AC | 69 ms
13,440 KB |
testcase_36 | AC | 19 ms
5,632 KB |
testcase_37 | AC | 19 ms
5,632 KB |
testcase_38 | AC | 19 ms
5,504 KB |
testcase_39 | AC | 19 ms
5,632 KB |
testcase_40 | AC | 20 ms
5,760 KB |
ソースコード
#include <bits/stdc++.h> #define forn(i,s,t) for(register int i=(s); i<=(t); ++i) #define forl(i,s,t) for(register i64 i=(s); i<=(t); ++i) #define form(i,s,t) for(register int i=(s); i>=(t); --i) #define rep(i,s,t) for(register int i=(s); i<(t); ++i) #define IT(u) for(register int i=G[u]; i; i=E[i].nxt) using namespace std; namespace FASTIO { const int SIZ = 1 << 26 | 1; char ibuf[SIZ], obuf[SIZ], *iS = ibuf, *iT = ibuf, *oS = obuf, *oT = obuf + SIZ - 1, qwq[60], qaq; #define gc() (iS == iT && (iT = (iS = ibuf) + fread(ibuf, 1, SIZ, stdin), iS == iT) ? EOF : *iS++) template<typename T> inline void Rdn(T& A) { register bool fl = 0; register char ch = gc(); A = 0; while(!isdigit(ch)) fl = (ch == '-'), ch = gc(); while(isdigit(ch)) A = (A * 10) + (ch & 15), ch = gc(); fl && (A = -A); } inline void Rdn(char& c) {while((c = gc()) == ' ' || c == '\n' || c == '\r');} inline void Rdn(char* s) { while((*s = gc()) == ' ' || *s == '\n' || *s == '\r') ; if(*s == EOF) return ; while(*s != ' ' && *s != '\n' && *s != '\r' && *s != EOF) *(++s) = gc(); *s = 0; } template<typename T, typename ...U> inline void Rdn(T& A, U& ...B) {Rdn(A), Rdn(B...);} inline void flush() {fwrite(obuf, 1, oS - obuf, stdout), oS = obuf;} inline void pc(char c) {*oS ++ = c; if(oS == oT) flush();} template<typename T> inline void Wtn(T A) { if(!A) return pc('0'); if(A < 0) pc('-'), A = -A; while(A) qwq[++qaq] = A % 10 + '0', A /= 10; while(qaq) pc(qwq[qaq -- ]); } inline void Wtn(char A) {pc(A);} inline void Wtn(char *s) {while(*s) pc(*s), ++s;} inline void Wtn(const char *s) {while(*s) pc(*s), ++s;} template<typename T, typename ...U> inline void Wtn(T A, U ...B) {Wtn(A), Wtn(B...);} #undef gc } using FASTIO :: Rdn; using FASTIO :: Wtn; using FASTIO :: flush; typedef long long i64; typedef double f64; typedef unsigned long long u64; typedef pair<i64, i64> pii; typedef pair<int, u64> piu; const int N = 1e6 + 5; const i64 INF = 1e18; inline void init() {} int tot; bool vis[N]; i64 p[N], sp[N]; inline void table(int lim) { forn (i, 2, lim) { if (!vis[i]) p[++tot] = i, sp[tot] = 1ll * i * i; for (int j = 1; j <= tot && i * p[j] <= lim; ++j) { vis[i * p[j]] = 1; if (i % p[j] == 0) break ; } } } i64 L, R; i64 ans[N]; inline void solve() { Rdn(L, R), table(1000000); rep (i, 0, R - L + 1) ans[i] = L + i; forn (i, 1, tot) for (i64 j = ((L + sp[i] - 1) / sp[i]) * sp[i]; j <= R; j += sp[i]) ans[j - L] = -1; forn (i, 1, tot) for (i64 j = ((L + p[i] - 1) / p[i]) * p[i]; j <= R; j += p[i]) if (ans[j - L] != -1) ans[j - L] /= p[i]; // rep (i, 0, R - L + 1) Wtn(ans[i], " \n"[i == R - L]); rep (i, 0, R - L + 1) if (ans[i] != -1) { if (ans[i] != 1 && (i64)sqrtl(ans[i]) * (i64)sqrtl(ans[i]) == ans[i]) ans[i] = -1; } // rep (i, 0, R - L + 1) Wtn(ans[i], " \n"[i == R - L]); int res = 0; rep (i, 0, R - L + 1) res += (ans[i] != -1); Wtn(res, '\n'); } int Trd; int main() { Trd = 1; while(Trd--) init(), solve(); flush(); return 0; }