QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#380506 | #8508. DiviDuelo | Ganny | WA | 0ms | 3712kb | C++14 | 1.1kb | 2024-04-07 05:04:44 | 2024-04-07 05:04:44 |
Judging History
answer
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
bool esPrimo(int numero) {
if (numero <= 1) {
return false;
}
if (numero == 2 || numero == 3) {
return true;
}
if (numero % 2 == 0 || numero % 3 == 0) {
return false;
}
int maximoFactor = sqrt(numero);
for (int i = 5; i <= maximoFactor; i += 6) {
if (numero % i == 0 || numero % (i + 2) == 0) {
return false;
}
}
return true;
}
int main(int argc, char const *argv[]){
long int N;
cin >> N;
cout << N%2 << " : " << N;
if ((esPrimo(N) || N == 1) && (N % 2 != 0 || N == 2)){
cout << "N" << endl;
return 0;
}else{
cout << "Y" << endl;
}
// vector<int> v;
// for (int i = 1; i <= N / 2; ++i) {
// if (N % i == 0 && esPrimo(i)) {
// v.push_back(i);
// }
// }
// int size = v.size();
// if (size == 2){
// cout << "Y" << endl;
// } else {
// cout << "N" << endl;
// }
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3712kb
input:
10
output:
0 : 10Y
result:
wrong answer 1st words differ - expected: 'Y', found: '0'