QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#635969	#6566. Power of Divisors	SDDDDDDDDDGG	WA	1ms	3972kb	C++14	571b	2024-10-12 21:38:59	2024-10-12 21:38:59

Judging History

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

[2024-10-12 21:38:59]
评测

测评结果：WA
用时：1ms
内存：3972kb

查看

[2024-10-12 21:38:59]
提交

answer

#include <bits/stdc++.h>
using ll = long long;

std::map<ll, int> mp;

void solve() {
    ll n;
    std::cin >> n;
    if (mp[n] == 0) {
        std::cout << "-1\n";
    } else {
        std::cout << mp[n] << "\n";
    }
}

int main() {
    std::cin.tie(nullptr)->std::ios::sync_with_stdio(false);

    for (int i = 1; i <= 150; i++) {
        ll x = 0;
        for (int j = 1; j <= i; j++) {
            if (i % j == 0) {
                x++;
            }
        }
        mp[std::pow(1LL * i, x)] = i;
    }
    solve();

    return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3772kb

input:

output:

result:

ok single line: '25'

Test #2:

score: 0

Accepted

time: 1ms

memory: 3868kb

input:

64000000

output:

result:

ok single line: '20'

Test #3:

score: 0

Accepted

time: 1ms

memory: 3944kb

input:

output:

-1

result:

ok single line: '-1'

Test #4:

score: 0

Accepted

time: 1ms

memory: 3908kb

input:

output:

result:

ok single line: '1'

Test #5:

score: 0

Accepted

time: 1ms

memory: 3920kb

input:

output:

-1

result:

ok single line: '-1'

Test #6:

score: 0

Accepted

time: 1ms

memory: 3972kb

input:

output:

-1

result:

ok single line: '-1'

Test #7:

score: 0

Accepted

time: 1ms

memory: 3972kb

input:

output:

result:

ok single line: '10'

Test #8:

score: 0

Accepted

time: 1ms

memory: 3816kb

input:

1000000000000000000

output:

result:

ok single line: '100'

Test #9:

score: -100

Wrong Answer

time: 1ms

memory: 3964kb

input:

10372926089038969

output:

-1

result:

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