結果
問題 | No.1022 Power Equation |
ユーザー | fuppy_kyopro |
提出日時 | 2020-04-10 22:14:29 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 7 ms / 2,000 ms |
コード長 | 3,594 bytes |
コンパイル時間 | 1,727 ms |
コンパイル使用メモリ | 170,408 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-15 20:39:05 |
合計ジャッジ時間 | 2,164 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 4 ms
5,248 KB |
testcase_02 | AC | 5 ms
5,376 KB |
testcase_03 | AC | 5 ms
5,376 KB |
testcase_04 | AC | 7 ms
5,376 KB |
testcase_05 | AC | 6 ms
5,376 KB |
testcase_06 | AC | 6 ms
5,376 KB |
testcase_07 | AC | 6 ms
5,376 KB |
testcase_08 | AC | 6 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;#define DEBUG(x) cerr<<#x<<": "<<x<<endl;#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}typedef long long ll;#define int ll#define vi vector<int>#define vl vector<ll>#define vii vector< vector<int> >#define vll vector< vector<ll> >#define vs vector<string>#define pii pair<int,int>#define pis pair<int,string>#define psi pair<string,int>#define pll pair<ll,ll>template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }#define X first#define Y second#define rep(i,n) for(int i=0;i<(int)(n);i++)#define rep1(i,n) for(int i=1;i<=(int)(n);i++)#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)#define rrep1(i,n) for(int i=(int)(n);i>0;i--)#define REP(i,a,b) for(int i=a;i<b;i++)#define in(x, a, b) (a <= x && x < b)#define all(c) c.begin(),c.end()template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());const ll inf = 1000000001;const ll INF = (ll)1e18 + 1;const long double pi = 3.1415926535897932384626433832795028841971L;#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };#define fio() cin.tie(0); ios::sync_with_stdio(false);const ll MOD = 1000000007;//const ll MOD = 998244353;// #define mp make_pair//#define endl '\n'vector<bool> is_prime(33);ll nibu(ll p, ll n) {ll ok = 1, ng = 1e8;while (ok + 1 < ng) {ll x = (ok + ng) / 2;ll mul = 1;rep (_, p) {mul *= x;if (mul > n) break;}if (mul > n) ng = x;else ok = x;}return ok;}ll gcd(ll a, ll b) {if (b > a) {swap(a, b);}ll r = a%b;while (r != 0) {a = b;b = r;r = a%b;}return b;}ll lcm(ll a, ll b) {return (a / gcd(a, b))*b;}void solve() {ll n;cin >> n;ll ans = n * n; // a = c = 1;ans += (n - 1) * n; // a = c != 1;for (int p = 2; p <= 31; p++) {//if (not is_prime[p]) continue;for (int q = 1; q < p; q++) {//if (q != 1 and not is_prime[q]) continue;if (gcd(p, q) != 1) continue;ll y = nibu(p, n);ll g = gcd(p, q);ll p2 = p / g;ll d = n / p2;if (y != 1) {//DEBUG_VEC(vl({p, q, y, d}));ans += d * (y - 1) * 2;}}}cout << ans << endl;}signed main() {fio();for (int i = 2; i <= 32; i++) {int x = i;is_prime[i] = true;for (int j = 2; j < x; j++) {if (x % j == 0) is_prime[i] = false;}}int t;cin >> t;while (t--) {solve();}}