結果

問題 No.2620 Sieve of Coins
ユーザー 👑 hos.lyric
提出日時 2024-01-26 21:33:26
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 152 ms / 2,000 ms
コード長 2,640 bytes
コンパイル時間 2,613 ms
コンパイル使用メモリ 119,484 KB
実行使用メモリ 10,496 KB
最終ジャッジ日時 2024-09-28 07:44:07
合計ジャッジ時間 7,962 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 5
other AC * 53
権限があれば一括ダウンロードができます

ソースコード

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

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) {
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0