結果

問題 No.1022 Power Equation
コンテスト
ユーザー maroon_kuri
提出日時 2020-04-10 22:28:36
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 35 ms / 2,000 ms
コード長 5,657 bytes
コンパイル時間 1,886 ms
コンパイル使用メモリ 175,756 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-09-15 20:57:54
合計ジャッジ時間 2,646 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 8
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

using ll=long long;
#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

const ull mask64=-1;

pair<ull,bool> pow_cap(ull a,int n){
	if(a==0)return make_pair(0,0);
	bool over=false;
	auto mult=[&](ull x,ull y){
		if(x<=mask64/y)return x*y;
		else{
			over=true;
			return mask64;
		}
	};
	ull res=1;
	while(n){
		if(n&1)res=mult(res,a);
		n>>=1;
		if(n)a=mult(a,a);
	}
	return make_pair(res,over);
}

//yosupo kth root integer
//0<=a<2^64
ull kth_root_integer(ull a,int k){
	if(a==0)return 0;
	ull z=min(floor(exp(log((long double)a)/k)),(long double)mask64);
	while(1){
		auto w=pow_cap(z,k);
		if(w.a>a||w.b)z--;
		else break;
	}
	while(z<mask64){
		auto w=pow_cap(z+1,k);
		if(w.a<=a&&!w.b)z++;
		else break;
	}
	return z;
}

const int vmax=100;
bool pri[vmax];
void initprime(){
	rng(i,2,vmax)
		pri[i]=1;
	rng(i,2,vmax)if(pri[i])
		for(int j=i*2;j<vmax;j+=i)
			pri[j]=0;
}
vi factors[vmax];
void initfactor(){
	rng(i,2,vmax)if(pri[i])
		for(int j=i;j<vmax;j+=i)
			factors[j].pb(i);
}
int mu[vmax];
void initmu(){
	rng(i,1,vmax)mu[i]=1;
	rng(i,2,vmax)if(pri[i]){
		for(int j=i;j<vmax;j+=i)
			if(j%(i*i))
				mu[j]=-mu[j];
			else
				mu[j]=0;
	}
}

const int L=30;
int sub(int n){
	int res=0;
	rng(i,1,L+1)if(mu[i]){
		res+=mu[i]*(kth_root_integer(n,i)-1);
	}
	return res;
}

int gcd(int a,int b){return b?gcd(b,a%b):a;}

void slv(){
	int n;cin>>n;
	int ans=0;
	int pre=0;
	gnr(i,1,L+1){
		int c=kth_root_integer(n,i);
		int d=sub(c);
		int w=0;
		rng(j,1,i+1)rng(k,1,i+1){
			int mx=max(k,j)/gcd(j,k);
			w+=n/mx;
		}
		ans+=(d-pre)*w;
		pre=d;
	}
	ans+=n*n;
	cout<<ans<<endl;
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	initprime();
	initmu();
	
	int t;cin>>t;
	rep(_,t)slv();
}
0