QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#114071 | #6566. Power of Divisors | UFRJ# | WA | 1ms | 3800kb | C++20 | 716b | 2023-06-20 20:52:38 | 2023-06-20 20:52:39 |
Judging History
answer
#include "bits/stdc++.h"
using lint = int64_t;
using namespace std;
map<lint,lint> memo;
int countDiv(lint x) {
set<lint> st;
for(lint i = 1; i <= sqrt(x) + 1; i++) {
if(x % i == 0) {
st.insert(i);
st.insert(x/i);
}
}
return st.size();
}
lint f(lint x) {
int cnt = countDiv(x);
return lint(round(pow(x, cnt)));
}
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
lint n;
cin >> n;
for(int i = 2; i <= 70; i++) {
lint raiz = round(pow(n, 1.0/i));
// cout << raiz << endl;
if(f(raiz) == n) {
cout << raiz << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3732kb
input:
15625
output:
25
result:
ok single line: '25'
Test #2:
score: 0
Accepted
time: 1ms
memory: 3784kb
input:
64000000
output:
20
result:
ok single line: '20'
Test #3:
score: 0
Accepted
time: 1ms
memory: 3772kb
input:
65536
output:
-1
result:
ok single line: '-1'
Test #4:
score: 0
Accepted
time: 1ms
memory: 3764kb
input:
1
output:
1
result:
ok single line: '1'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
10
output:
-1
result:
ok single line: '-1'
Test #6:
score: 0
Accepted
time: 1ms
memory: 3556kb
input:
100
output:
-1
result:
ok single line: '-1'
Test #7:
score: 0
Accepted
time: 1ms
memory: 3772kb
input:
10000
output:
10
result:
ok single line: '10'
Test #8:
score: 0
Accepted
time: 1ms
memory: 3800kb
input:
1000000000000000000
output:
100
result:
ok single line: '100'
Test #9:
score: -100
Wrong Answer
time: 1ms
memory: 3732kb
input:
10372926089038969
output:
-1
result:
wrong answer 1st lines differ - expected: '218089', found: '-1'