結果
問題 | No.2249 GCDistance |
ユーザー |
![]() |
提出日時 | 2023-03-17 22:04:24 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 275 ms / 5,000 ms |
コード長 | 2,393 bytes |
コンパイル時間 | 1,992 ms |
コンパイル使用メモリ | 217,764 KB |
最終ジャッジ日時 | 2025-02-11 13:11:43 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 10 |
コンパイルメッセージ
main.cpp: In function ‘std::pair<std::vector<int>, std::vector<int> > {anonymous}::primes_lpf(int)’: main.cpp:33:48: warning: result of ‘2^4’ is 6; did you mean ‘1 << 4’ (16)? [-Wxor-used-as-pow] 33 | for (; x <= n5; x += add_next, add_next ^= 2 ^ 4) { | ^ | - | 1 << main.cpp:33:46: note: you can silence this warning by using a hexadecimal constant (0x2 rather than 2) 33 | for (; x <= n5; x += add_next, add_next ^= 2 ^ 4) { | ^ | 0x2 main.cpp:47:47: warning: result of ‘2^4’ is 6; did you mean ‘1 << 4’ (16)? [-Wxor-used-as-pow] 47 | for (; x <= n; x += add_next, add_next ^= 2 ^ 4) { | ^ | - | 1 << main.cpp:47:45: note: you can silence this warning by using a hexadecimal constant (0x2 rather than 2) 47 | for (; x <= n; x += add_next, add_next ^= 2 ^ 4) { | ^ | 0x2
ソースコード
#include<bits/stdc++.h>namespace {#pragma GCC diagnostic ignored "-Wunused-function"#include<atcoder/all>#pragma GCC diagnostic warning "-Wunused-function"using namespace std;using namespace atcoder;#define rep(i,n) for(int i = 0; i < (int)(n); i++)#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)#define all(x) begin(x), end(x)#define rall(x) rbegin(x), rend(x)template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }using ll = long long;using P = pair<int,int>;using VI = vector<int>;using VVI = vector<VI>;using VL = vector<ll>;using VVL = vector<VL>;pair<vector<int>, vector<int>> primes_lpf(const int n) {vector<int> primes; primes.reserve(n / 10);vector<int> lpf(n + 1);for (int i = 2; i <= n; i += 2) lpf[i] = 2;for (int i = 3; i <= n; i += 6) lpf[i] = 3;if (2 <= n) primes.push_back(2);if (3 <= n) primes.push_back(3);// 5 * x <= n, x <= floor(n / 5)const int n5 = n / 5;int x = 5;char add_next = 2;for (; x <= n5; x += add_next, add_next ^= 2 ^ 4) {int px = lpf[x];if (px == 0) {lpf[x] = px = x;primes.push_back(x);}for (int i = 2;; ++i) {int q = primes[i];int y = q * x;if (y > n) break;lpf[y] = q;if (q == px) break;}}for (; x <= n; x += add_next, add_next ^= 2 ^ 4) {if (lpf[x] == 0) {lpf[x] = x;primes.push_back(x);}}return {move(primes), move(lpf)};}constexpr int PSIZE = 10000000;auto [primes, lpf] = primes_lpf(PSIZE);vector<ll> build_phi_table(const int n) {assert(n < (int)lpf.size());vector<ll> res(n + 1);res[1] = 1;for(int p: primes) {if (p > n) break;res[p] = p - 1;}for(int x = 2; x <= n; x++) {int px = lpf[x];for(int q: primes) {int y = q * x;if (y > n) break;if (q != px) {res[y] = res[x] * (q - 1);} else {res[y] = res[x] * q;break;}}}return res;}auto phi = build_phi_table(10000000);} int main() {ios::sync_with_stdio(false);cin.tie(0);rep(i, 10000000) phi[i+1] += phi[i];int tt;cin >> tt;while(tt--) {int n;cin >> n;ll ans = ll(n) * (n - 1) - phi[n] + 1;cout << ans << '\n';}}