QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#796753#6566. Power of Divisorszeyu#TL 1ms3888kbC++233.4kb2024-12-02 01:48:072024-12-02 01:48:07

Judging History

你现在查看的是最新测评结果

  • [2024-12-02 01:48:07]
  • 评测
  • 测评结果:TL
  • 用时:1ms
  • 内存:3888kb
  • [2024-12-02 01:48:07]
  • 提交

answer

#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pl pair<ll, ll>
#define pi pair<int, int>
#define minpq priority_queue<ll, vector<ll>, greater<ll>>
using namespace std;

#if 1
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '['; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "]";}
void _print() {cerr << endl << flush;}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "*["<<__LINE__<<"]\t"<< #x << " = "; _print(x)
#endif

const ll mod = 1e9 + 7;

template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
ll gcd(ll a, ll b) {if(b == 0){return a;} return gcd(b, a % b);}

__int128_t inf = (__int128_t)1 << 100;

__int128 read_int128() {
    string str;
    cin >> str;

    __int128 x = 0, f = 1;
    if (str[0] == '-') {
        f = -1;
        str = str.substr(1);
    }

    for (char c : str) {
        x = x * 10 + (c - '0');
    }
    return x * f;
}

ostream& operator<<(ostream& dest, __int128_t value){
    ostream::sentry s( dest );
    if (s) {
        __uint128_t tmp = value < 0 ? -value : value;
        char buffer[128];
        char* d = std::end(buffer);
        do{
            -- d;
            *d = "0123456789"[tmp % 10];
            tmp /= 10;
        } while (tmp != 0);
        if (value < 0) {
            -- d;
            *d = '-';
        }
        int len = end(buffer) - d;
        if (dest.rdbuf()->sputn(d, len) != len) {
            dest.setstate(ios_base::badbit);
        }
    }
    return dest;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	__int128 x = read_int128();
	for (ll i = 60; i >= 1; i --){
		__int128 lx = 1, rx = x;
		__int128 z = -1;
		while(rx >= lx){
			__int128 mid = (lx + rx) / 2;
			__int128 cur = 1;
			for (ll j = 0; j < i; j ++){
				cur *= mid;
				if (cur > x) break;
			}
			if (cur == x){
				z = mid; break;
			} else if (cur > x){
				rx = mid - 1;
			} else{
				lx = mid + 1;
			}
		}
		__int128 cur = 1;
		for (ll j = 0; j < i; j ++){
			cur *= lx;
			if (cur > x) break;
		}
		if (cur == x) z = lx;
		if (z != -1){
			ll cnt = 0;
			for (__int128 j = 1; j * j <= z; j ++){
				if (z % j == 0){
					if (j * j == z) cnt ++;
					else cnt += 2;
				}
			}
			if (cnt == i){
				cout << z << '\n';
				return 0;
			}
		}
	}
	cout << -1 << '\n';
}

/*
Do something instead of nothing!
Print out stuffs / study samples when you cannot find the bug!
*/

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3620kb

input:

15625

output:

25

result:

ok single line: '25'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3660kb

input:

64000000

output:

20

result:

ok single line: '20'

Test #3:

score: 0
Accepted
time: 0ms
memory: 3884kb

input:

65536

output:

-1

result:

ok single line: '-1'

Test #4:

score: 0
Accepted
time: 0ms
memory: 3880kb

input:

1

output:

1

result:

ok single line: '1'

Test #5:

score: 0
Accepted
time: 0ms
memory: 3536kb

input:

10

output:

-1

result:

ok single line: '-1'

Test #6:

score: 0
Accepted
time: 0ms
memory: 3580kb

input:

100

output:

-1

result:

ok single line: '-1'

Test #7:

score: 0
Accepted
time: 0ms
memory: 3848kb

input:

10000

output:

10

result:

ok single line: '10'

Test #8:

score: 0
Accepted
time: 0ms
memory: 3888kb

input:

1000000000000000000

output:

100

result:

ok single line: '100'

Test #9:

score: 0
Accepted
time: 0ms
memory: 3816kb

input:

10372926089038969

output:

218089

result:

ok single line: '218089'

Test #10:

score: 0
Accepted
time: 0ms
memory: 3888kb

input:

10642944803293201

output:

10157

result:

ok single line: '10157'

Test #11:

score: 0
Accepted
time: 0ms
memory: 3620kb

input:

10646534823110209

output:

103182047

result:

ok single line: '103182047'

Test #12:

score: 0
Accepted
time: 0ms
memory: 3684kb

input:

1073741824

output:

32

result:

ok single line: '32'

Test #13:

score: 0
Accepted
time: 0ms
memory: 3680kb

input:

121

output:

11

result:

ok single line: '11'

Test #14:

score: 0
Accepted
time: 0ms
memory: 3812kb

input:

1296

output:

6

result:

ok single line: '6'

Test #15:

score: 0
Accepted
time: 0ms
memory: 3884kb

input:

16

output:

-1

result:

ok single line: '-1'

Test #16:

score: 0
Accepted
time: 0ms
memory: 3532kb

input:

16277421889

output:

127583

result:

ok single line: '127583'

Test #17:

score: 0
Accepted
time: 0ms
memory: 3652kb

input:

169

output:

13

result:

ok single line: '13'

Test #18:

score: 0
Accepted
time: 0ms
memory: 3808kb

input:

1985984

output:

-1

result:

ok single line: '-1'

Test #19:

score: 0
Accepted
time: 0ms
memory: 3676kb

input:

2

output:

-1

result:

ok single line: '-1'

Test #20:

score: 0
Accepted
time: 1ms
memory: 3880kb

input:

205891132094649

output:

243

result:

ok single line: '243'

Test #21:

score: 0
Accepted
time: 0ms
memory: 3644kb

input:

25

output:

5

result:

ok single line: '5'

Test #22:

score: 0
Accepted
time: 0ms
memory: 3584kb

input:

2626114239841

output:

1273

result:

ok single line: '1273'

Test #23:

score: 0
Accepted
time: 0ms
memory: 3584kb

input:

26269395104446321

output:

12731

result:

ok single line: '12731'

Test #24:

score: 0
Accepted
time: 0ms
memory: 3644kb

input:

3

output:

-1

result:

ok single line: '-1'

Test #25:

score: 0
Accepted
time: 0ms
memory: 3652kb

input:

3596345248055296

output:

88

result:

ok single line: '88'

Test #26:

score: 0
Accepted
time: 0ms
memory: 3576kb

input:

36

output:

-1

result:

ok single line: '-1'

Test #27:

score: 0
Accepted
time: 0ms
memory: 3640kb

input:

4

output:

2

result:

ok single line: '2'

Test #28:

score: 0
Accepted
time: 0ms
memory: 3592kb

input:

4096

output:

8

result:

ok single line: '8'

Test #29:

score: 0
Accepted
time: 0ms
memory: 3588kb

input:

49

output:

7

result:

ok single line: '7'

Test #30:

score: 0
Accepted
time: 0ms
memory: 3580kb

input:

5

output:

-1

result:

ok single line: '-1'

Test #31:

score: -100
Time Limit Exceeded

input:

576460752303423488

output:


result: