Submission #1984082
Source Code Expand
#include <algorithm> #include <cmath> #include <complex> #include <iomanip> #include <iostream> #include <string> #include <utility> #include <vector> using namespace std; using ll = long long int; const int MOD = 1e9 + 7; const int INF = 1e9 + 373; #define rep(i, n) for (int i = 0; i < (n); ++i) template <typename T> using vector2 = vector<vector<T>>; template <typename T> vector2<T> init_vector2(size_t n0, size_t n1, T e = T()) { return vector2<T>(n0, vector<T>(n1, e)); } template <typename T> using vector3 = vector<vector<vector<T>>>; template <typename T> vector3<T> init_vector3(size_t n0, size_t n1, size_t n2, T e = T()) { return vector3<T>(n0, vector2<T>(n1, vector<T>(n2, e))); } bool is_prime(ll n) { if (n <= 1) { return false; } if (n == 2) { return true; } if (n % 2 == 0) { return false; } for (ll i = 3; i * i <= n; i += 2) { if (n % i == 0) { return false; } } return true; } int main() { int n; cin >> n; int sum = n * (n + 1) / 2; cout << (is_prime(sum) ? "WANWAN" : "BOWWOW") << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ホリドッグ |
User | somq14 |
Language | C++14 (Clang 3.8.0) |
Score | 100 |
Code Size | 1205 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 1 ms | 256 KB |
subtask0_sample_02.txt | AC | 1 ms | 256 KB |
subtask0_sample_03.txt | AC | 1 ms | 256 KB |
subtask0_sample_04.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | AC | 1 ms | 256 KB |
subtask1_05.txt | AC | 1 ms | 256 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | AC | 1 ms | 256 KB |