結果
問題 | No.2620 Sieve of Coins |
ユーザー | 👑 hos.lyric |
提出日時 | 2024-01-26 21:33:26 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 155 ms / 2,000 ms |
コード長 | 2,640 bytes |
コンパイル時間 | 2,596 ms |
コンパイル使用メモリ | 110,208 KB |
実行使用メモリ | 12,572 KB |
最終ジャッジ日時 | 2024-01-26 21:33:40 |
合計ジャッジ時間 | 8,696 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 34 ms
12,572 KB |
testcase_01 | AC | 35 ms
12,572 KB |
testcase_02 | AC | 34 ms
12,572 KB |
testcase_03 | AC | 98 ms
12,572 KB |
testcase_04 | AC | 89 ms
12,572 KB |
testcase_05 | AC | 39 ms
12,572 KB |
testcase_06 | AC | 33 ms
12,572 KB |
testcase_07 | AC | 33 ms
12,572 KB |
testcase_08 | AC | 33 ms
12,572 KB |
testcase_09 | AC | 34 ms
12,572 KB |
testcase_10 | AC | 34 ms
12,572 KB |
testcase_11 | AC | 34 ms
12,572 KB |
testcase_12 | AC | 33 ms
12,572 KB |
testcase_13 | AC | 35 ms
12,572 KB |
testcase_14 | AC | 34 ms
12,572 KB |
testcase_15 | AC | 34 ms
12,572 KB |
testcase_16 | AC | 34 ms
12,572 KB |
testcase_17 | AC | 35 ms
12,572 KB |
testcase_18 | AC | 100 ms
12,572 KB |
testcase_19 | AC | 99 ms
12,572 KB |
testcase_20 | AC | 34 ms
12,572 KB |
testcase_21 | AC | 80 ms
12,572 KB |
testcase_22 | AC | 90 ms
12,572 KB |
testcase_23 | AC | 37 ms
12,572 KB |
testcase_24 | AC | 35 ms
12,572 KB |
testcase_25 | AC | 34 ms
12,572 KB |
testcase_26 | AC | 34 ms
12,572 KB |
testcase_27 | AC | 34 ms
12,572 KB |
testcase_28 | AC | 34 ms
12,572 KB |
testcase_29 | AC | 34 ms
12,572 KB |
testcase_30 | AC | 34 ms
12,572 KB |
testcase_31 | AC | 101 ms
12,572 KB |
testcase_32 | AC | 102 ms
12,572 KB |
testcase_33 | AC | 34 ms
12,572 KB |
testcase_34 | AC | 34 ms
12,572 KB |
testcase_35 | AC | 39 ms
12,572 KB |
testcase_36 | AC | 102 ms
12,572 KB |
testcase_37 | AC | 84 ms
12,572 KB |
testcase_38 | AC | 113 ms
12,572 KB |
testcase_39 | AC | 130 ms
12,572 KB |
testcase_40 | AC | 127 ms
12,572 KB |
testcase_41 | AC | 72 ms
12,572 KB |
testcase_42 | AC | 69 ms
12,572 KB |
testcase_43 | AC | 76 ms
12,572 KB |
testcase_44 | AC | 65 ms
12,572 KB |
testcase_45 | AC | 34 ms
12,572 KB |
testcase_46 | AC | 80 ms
12,572 KB |
testcase_47 | AC | 79 ms
12,572 KB |
testcase_48 | AC | 72 ms
12,572 KB |
testcase_49 | AC | 75 ms
12,572 KB |
testcase_50 | AC | 95 ms
12,572 KB |
testcase_51 | AC | 155 ms
12,572 KB |
testcase_52 | AC | 98 ms
12,572 KB |
testcase_53 | AC | 113 ms
12,572 KB |
testcase_54 | AC | 123 ms
12,572 KB |
testcase_55 | AC | 62 ms
12,572 KB |
testcase_56 | AC | 62 ms
12,572 KB |
testcase_57 | AC | 61 ms
12,572 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } enum LIM = 10^^6 + 10; int[] lpf, moe; void main() { lpf = iota(LIM).array; foreach (p; 2 .. LIM) if (lpf[p] == p) { for (int n = 2 * p; n < LIM; n += p) chmin(lpf[n], p); } moe = new int[LIM]; moe[1] = 1; foreach (n; 2 .. LIM) { const p = lpf[n]; moe[n] = (n / p % p == 0) ? 0 : -moe[n / p]; } debug { writeln(moe[0 .. 31]); } try { for (; ; ) { const L = readLong; const N = readInt; auto A = new long[N]; foreach (i; 0 .. N) { A[i] = readLong; } long ans; for (long e = 0; 2L^^e <= L; ++e) { for (long f = 0; 2L^^e * 3L^^f <= L; ++f) { const x = 2L^^e * 3L^^f; int cnt; foreach (i; 0 .. N) if (x % A[i] == 0) { const y = x / A[i]; if (y % (2^^2) != 0 && y % (3^^2) != 0) { ++cnt; } } if (cnt & 1) { debug { writefln("2^%s 3^%s = %s", e, f, x); } const l = L / x; long num; for (long d = 1; d^^2 <= l; ++d) if (d % 2 != 0 && d % 3 != 0 && moe[d]) { long s; s += l / (d^^2); s -= l / (2 * d^^2); s -= l / (3 * d^^2); s += l / (6 * d^^2); num += moe[d] * s; } ans += num; } } } writeln(ans); } } catch (EOFException e) { } }