結果
問題 | No.2249 GCDistance |
ユーザー |
![]() |
提出日時 | 2023-03-17 22:31:52 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 401 ms / 5,000 ms |
コード長 | 3,603 bytes |
コンパイル時間 | 2,921 ms |
コンパイル使用メモリ | 175,344 KB |
最終ジャッジ日時 | 2025-02-11 13:36:27 |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 10 |
ソースコード
#include <algorithm>#include <bitset>#include <cassert>#include <cmath>#include <cstdio>#include <fstream>#include <functional>#include <iomanip>#include <iostream>#include <iterator>#include <map>#include <numeric>#include <queue>#include <set>#include <sstream>#include <stack>#include <unordered_set>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#endif#define GET_MACRO(_1, _2, _3, NAME, ...) NAME#define _rep(i, n) _rep2(i, 0, n)#define _rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()using i64 = long long;template <class T, class U>bool chmin(T& a, const U& b) {return (b < a) ? (a = b, true) : false;}template <class T, class U>bool chmax(T& a, const U& b) {return (b > a) ? (a = b, true) : false;}inline void YesNo(bool f = 0, string yes = "Yes", string no = "No") {std::cout << (f ? yes : no) << "\n";}namespace io {template <typename T>istream& operator>>(istream& i, vector<T>& v) {rep(j, v.size()) i >> v[j];return i;}template <typename T>string join(vector<T>& v) {stringstream s;rep(i, v.size()) s << ' ' << v[i];return s.str().substr(1);}template <typename T>ostream& operator<<(ostream& o, vector<T>& v) {if (v.size()) o << join(v);return o;}template <typename T>string join(vector<vector<T>>& vv) {string s = "\n";rep(i, vv.size()) s += join(vv[i]) + "\n";return s;}template <typename T>ostream& operator<<(ostream& o, vector<vector<T>>& vv) {if (vv.size()) o << join(vv);return o;}template <class T, class U>istream& operator>>(istream& i, pair<T, U>& p) {i >> p.first >> p.second;return i;}template <class T, class U>ostream& operator<<(ostream& o, pair<T, U>& p) {o << p.first << " " << p.second;return o;}void print() { cout << "\n"; }template <class Head, class... Tail>void print(Head&& head, Tail&&... tail) {cout << head << " ";print(std::forward<Tail>(tail)...);}void in() {}template <class Head, class... Tail>void in(Head&& head, Tail&&... tail) {cin >> head;in(std::forward<Tail>(tail)...);}} // namespace iousing namespace io;namespace useful {long long modpow(long long a, long long b, long long mod) {long long res = 1;while (b) {if (b & 1) res *= a, res %= mod;a *= a;a %= mod;b >>= 1;}return res;}bool is_pow2(long long x) { return x > 0 && (x & (x - 1)) == 0; }template <class T>void rearrange(vector<T>& a, vector<int>& p) {vector<T> b = a;for (int i = 0; i < int(a.size()); i++) {a[i] = b[p[i]];}return;}} // namespace usefulusing namespace useful;vector<int> euler_phi_table(int n) {vector<int> euler(n + 1);for (int i = 0; i <= n; i++) {euler[i] = i;}for (int i = 2; i <= n; i++) {if (euler[i] == i) {for (int j = i; j <= n; j += i) {euler[j] = euler[j] / i * (i - 1);}}}return euler;}vector<int> table;i64 dp[10000010];void solve() {int n;in(n);cout << dp[n] << "\n";}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);int t;cin >> t;table = euler_phi_table(10000005);table[1] = 0;for (i64 i = 2; i <= 10000005; i++) {dp[i] = dp[i - 1] + (i - 1) * 2 - table[i];}while (t--) solve();}