Submission #1655325
Source Code Expand
#include <algorithm> #include <bitset> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <cctype> #include <functional> #include <iomanip> #include <iostream> #include <iterator> #include <map> #include <queue> #include <set> #include <string> #include <vector> #define ll long long #define imfor(i, n) for(int i = 0; i < n; i++) using namespace std; ll MOD = 1000000007; int main() { ll n; cin >> n; if (n == 1) { cout << "Not Prime" << endl; return 0; } if (n == 2) { cout << "Prime" << endl; return 0; } int f = 1; for (ll i = 3; i * i <= n; i += 2) { if (n % i == 0) { f = 0; } } if (f == 1) { cout << "Prime" << endl; return 0; } if (n % 2 == 0) { cout << "Not Prime" << endl; return 0; } if (n % 5 == 0) { cout << "Not Prime" << endl; return 0; } string s = to_string(n); ll sum = 0; imfor(i, s.length()) { sum += (s[i] - '0'); } if (sum % 3 != 0) { cout << "Prime" << endl; return 0; } else { cout << "Not Prime" << endl; return 0; } }
Submission Info
Submission Time | |
---|---|
Task | A - 素数判定 |
User | imaizumi14 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1278 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
sample_04.txt | AC | 1 ms | 256 KB |
test_01.txt | AC | 1 ms | 256 KB |
test_02.txt | AC | 1 ms | 256 KB |
test_03.txt | WA | 1 ms | 256 KB |
test_04.txt | WA | 1 ms | 256 KB |
test_05.txt | AC | 1 ms | 256 KB |
test_06.txt | WA | 1 ms | 256 KB |
test_07.txt | AC | 1 ms | 256 KB |
test_08.txt | WA | 1 ms | 256 KB |
test_09.txt | AC | 1 ms | 256 KB |
test_10.txt | AC | 1 ms | 256 KB |
test_11.txt | AC | 1 ms | 256 KB |
test_12.txt | AC | 1 ms | 256 KB |
test_13.txt | AC | 1 ms | 256 KB |
test_14.txt | AC | 1 ms | 256 KB |
test_15.txt | AC | 1 ms | 256 KB |
test_16.txt | AC | 1 ms | 256 KB |
test_17.txt | AC | 1 ms | 256 KB |
test_18.txt | AC | 1 ms | 256 KB |
test_19.txt | AC | 1 ms | 256 KB |
test_20.txt | AC | 1 ms | 256 KB |
test_21.txt | AC | 1 ms | 256 KB |
test_22.txt | AC | 1 ms | 256 KB |
test_23.txt | AC | 2 ms | 256 KB |
test_24.txt | AC | 1 ms | 256 KB |
test_25.txt | AC | 1 ms | 256 KB |
test_26.txt | AC | 1 ms | 256 KB |
test_27.txt | AC | 1 ms | 256 KB |
test_28.txt | AC | 1 ms | 256 KB |
test_29.txt | AC | 1 ms | 256 KB |
test_30.txt | AC | 1 ms | 256 KB |