Submission #1704229

---

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 << "BOWBOW" << endl;
  }

  return 0;
}

Submission Info

Judge Result