Submission #1704251
Source Code Expand
#include <cstdio> #include <cstdlib> #include <cmath> #include <cctype> #include <climits> #include <iostream> #include <iomanip> #include <algorithm> #include <string> #include <sstream> #include <vector> #include <map> #include <set> #include <complex> #include <functional> #include <utility> #include <iterator> #define REP(i, n) for(int i = 0; i < (int)(n); ++i) #define FOR(i, m, n) for(int i = (m); i < (int)(n); ++i) #define ALL(x) (x).begin(), (x).end() #define INF 2000000000 #ifdef LOCAL #define eprintf(...) fprintf(stdout, __VA_ARGS__) #else #define eprintf(...) 0 #endif using namespace std; typedef long long LL; typedef unsigned long long ULL; typedef unsigned int uint; const double PI = 3.1415926535897932384626433832795; // return vector v[prime]==true v[composit]==false std::vector<int> makePrimeCheckVector(int maxnum) { std::vector<int> v(maxnum + 1, true); v[0] = v[1] = false; for(int i = 2; i < ceil(sqrt(maxnum)) + 1; ++i) { for(int j = 1; i * j <= maxnum; ++j) { if(j != 1) { v[i * j] = false; } } } return v; } int main() { int n; cin >> n; int sum = (n + 1) * n / 2; eprintf("sum:%d\n", sum); vector<int> check = makePrimeCheckVector(sum); if(check[sum]) { cout << "WANWAN" << endl; } else { cout << "BOWWOW" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ホリドッグ |
User | yoshi_k |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1406 Byte |
Status | AC |
Exec Time | 9 ms |
Memory | 2176 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 | 9 ms | 2176 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 | 2 ms | 512 KB |
subtask1_09.txt | AC | 9 ms | 2176 KB |
subtask1_10.txt | AC | 3 ms | 768 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | AC | 7 ms | 1920 KB |