QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#114062#6566. Power of DivisorsUFRJ#WA 1ms3784kbC++20714b2023-06-20 20:25:032023-06-20 20:25:04

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-06-20 20:25:04]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3784kb
  • [2023-06-20 20:25:03]
  • 提交

answer

#include "bits/stdc++.h"

using lint = int64_t;

using namespace std;

map<lint,lint> memo;

int countDiv(lint x) {
    set<lint> st;
    for(int i = 1; i <= x; i++) {
        if(x % i == 0) {
            st.insert(i);
            st.insert(x/i);
        }
    }
    return st.size();
}

void pre() {
    for(int i = 1; i < 100; i++) {
        int cnt = countDiv(i);
        long double ans = pow(i, cnt);
        if(ans < 1e18) {
            memo[lint(ans)] = i;
        }
    }
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  pre();
  lint n;
  cin >> n;
  if(memo.count(n)) {
    cout << memo[n] << endl;
  } else {
    cout << -1 << endl;
  }
  return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3776kb

input:

15625

output:

25

result:

ok single line: '25'

Test #2:

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

input:

64000000

output:

20

result:

ok single line: '20'

Test #3:

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

input:

65536

output:

-1

result:

ok single line: '-1'

Test #4:

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

input:

1

output:

1

result:

ok single line: '1'

Test #5:

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

input:

10

output:

-1

result:

ok single line: '-1'

Test #6:

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

input:

100

output:

-1

result:

ok single line: '-1'

Test #7:

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

input:

10000

output:

10

result:

ok single line: '10'

Test #8:

score: -100
Wrong Answer
time: 1ms
memory: 3784kb

input:

1000000000000000000

output:

-1

result:

wrong answer 1st lines differ - expected: '100', found: '-1'