Submission #1355026
Source Code Expand
#include <vector> #include <list> #include <map> #include <set> #include <stack> #include <algorithm> #include <iostream> #include <iomanip> #include <cmath> #include <string> using namespace std; //using using VI = vector<int>; using VVI = vector<VI>; using VS = vector<string>; using PII = pair<int, int>; using LL = long long; //repetition #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define REP(i,n) for(int i=0;i<(n);i++) //constant const int INF = 1 << 29; const double EPS = 1e-10; const double PI = acos(-1.0); //debug #define dump(x) cout << #x << " = " << (x) << endl; int main() { //エラトステネスの篩を行う int n; cin >> n; int N = 0; FOR(i,1, n+1) N += i; vector<bool> check(N+1, true); check[0] = false; check[1] = false; int min_prime = 2; while (min_prime < N) { for(int i=min_prime;i<=N; i += min_prime) { check[i] = false; } while (! check[min_prime]) min_prime++; if(min_prime == N) { cout << "WANWAN" << endl; return 0; } } cout << "BOWWOW" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ホリドッグ |
User | msageha |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1120 Byte |
Status | AC |
Exec Time | 4 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 | 4 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 | 2 ms | 256 KB |
subtask1_09.txt | AC | 4 ms | 256 KB |
subtask1_10.txt | AC | 2 ms | 256 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | AC | 4 ms | 256 KB |