Submission #1160745

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
#include<cmath>
#include<numeric>
#include<queue>
using namespace std;

int INF = 10000000;
vector<bool> isPrime(long long int n){
  vector<bool> prime(n+1, true);
  prime[0] = false;
  prime[1] = false;
  for(long long int i=2; i<=sqrt(n); i++){
    if( !prime[i] ) continue;
    for(long long int j=i*2; j<=n; j+=i){
      prime[j] = false;
    }
  }
  return prime;
}
int main(void) {
  int n;
  cin >> n;
  vector<bool> f = isPrime(n * n);
  if( f[ n * (n+1) / 2 ] ) cout << "WANWAN" << endl;
  else cout << "BOWBOW" << endl;

  return 0;
}

Submission Info

Judge Result