結果

問題 No.2249 GCDistance
ユーザー stoqstoq
提出日時 2023-03-18 09:48:33
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,789 ms / 5,000 ms
コード長 4,540 bytes
コンパイル時間 2,017 ms
コンパイル使用メモリ 209,672 KB
実行使用メモリ 237,824 KB
最終ジャッジ日時 2024-09-18 13:09:07
合計ジャッジ時間 24,785 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,672 ms
237,824 KB
testcase_01 AC 1,735 ms
237,696 KB
testcase_02 AC 1,784 ms
237,696 KB
testcase_03 AC 1,716 ms
237,696 KB
testcase_04 AC 1,703 ms
237,792 KB
testcase_05 AC 1,778 ms
237,696 KB
testcase_06 AC 1,725 ms
237,696 KB
testcase_07 AC 1,749 ms
237,696 KB
testcase_08 AC 1,680 ms
237,824 KB
testcase_09 AC 1,725 ms
237,696 KB
testcase_10 AC 1,789 ms
237,696 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 2

#include <bits/stdc++.h>
using namespace std;

#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#if 0
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T>
using extset =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif

#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif

#pragma region Macros

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename T>
using smaller_queue = priority_queue<T, vector<T>, greater<T>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
const double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
#define UNIQUE(v) v.erase(unique(all(v)), v.end())

struct io_init {
  io_init() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline ll floor(ll a, ll b) {
  if (b < 0) a *= -1, b *= -1;
  if (a >= 0) return a / b;
  return -((-a + b - 1) / b);
}
inline ll ceil(ll a, ll b) { return floor(a + b - 1, b); }
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
template <typename T>
vector<T> compress(vector<T> &v) {
  vector<T> val = v;
  sort(all(val)), val.erase(unique(all(val)), val.end());
  for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();
  return val;
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {
  os << p.first << " " << p.second;
  return os;
}
template <typename T>
constexpr istream &operator>>(istream &is, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++) is >> v[i];
  return is;
}
template <typename T>
constexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++)
    os << v[i] << (i + 1 == v.size() ? "" : " ");
  return os;
}
template <typename T>
constexpr void operator--(vector<T> &v, int) noexcept {
  for (int i = 0; i < v.size(); i++) v[i]--;
}

random_device seed_gen;
mt19937_64 engine(seed_gen());

#pragma endregion

// --------------------------------------

const int MAX_N = 2e7;
int can_div[MAX_N] = {};

struct init_prime {
  init_prime() {
    can_div[1] = -1;
    for (int i = 2; i < MAX_N; i++) {
      if (can_div[i] != 0) continue;
      for (int j = i + i; j < MAX_N; j += i) can_div[j] = i;
    }
  }
} init_prime;

inline bool is_prime(int n) {
  if (n <= 1) return false;
  return !can_div[n];
}

void factorization(int n, unordered_map<int, int> &res) {
  if (n <= 1) return;
  if (!can_div[n]) {
    ++res[n];
    return;
  }
  ++res[can_div[n]];
  factorization(n / can_div[n], res);
}

ll phi[10000010];
ll sum[10000010];

void solve() {
  for (int i = 1; i <= 10000000; i++) phi[i] = i;
  for (int i = 1; i <= 10000000; i++) {
    if (not is_prime(i)) continue;
    for (ll j = i; j <= 10000000; j += i) {
      phi[j] *= i - 1;
      phi[j] /= i;
    }
  }
  phi[1] = 0;
  for (ll i = 1; i <= 10000000; i++) sum[i] = sum[i - 1] + phi[i];
  int t;
  cin >> t;
  rep(_, t) {
    ll n;
    cin >> n;
    cout << n * (n - 1) - sum[n] << "\n";
  }
}

int main() { solve(); }
0