QOJ.ac

QOJ

The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#562221	#8508. DiviDuelo	ucup-team3519^#	WA	0ms	3692kb	C++20	567b	2024-09-13 15:51:17	2024-09-13 15:51:18

Judging History

This is the latest submission verdict.

[2024-09-13 15:51:18]
Judged

Verdict: WA
Time: 0ms
Memory: 3692kb

Show

[2024-09-13 15:51:17]
Submitted

answer

#include <bits/stdc++.h>

using i64 = int64_t;

int main() {
    i64 n;
    std::cin >> n;

    int cnt = 0;
    for (int i = 2; (i64)i * i <= n; ++i) {
        int k = 0;
        while (n % i == 0) {
            n /= i;
            ++k;
        }
        if (k >= 2) {
            std::cout << "N\n";
            return 0;
        }
        if (k) {
            ++cnt;
        }
    }
    if (n > 1) {
        ++cnt;
    }

    if (cnt == 1 || cnt == 2) {
        std::cout << "Y\n";
    } else {
        std::cout << "N\n";
    }
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3576kb

input:

output:

result:

ok "Y"

Test #2:

score: 0

Accepted

time: 0ms

memory: 3568kb

input:

output:

result:

ok "N"

Test #3:

score: 0

Accepted

time: 0ms

memory: 3484kb

input:

output:

result:

ok "N"

Test #4:

score: -100

Wrong Answer

time: 0ms

memory: 3692kb

input:

549755813888

output:

result:

wrong answer 1st words differ - expected: 'Y', found: 'N'