Submission #1187005

---

Source Code Expand

#include<iostream>
#include<string>
#include<cmath>
using namespace std;
long long f(int n) {
	if (n == 1)return 1;
	else return n + f(n - 1);
}
bool isprime(long long n) {
	if (n == 2)return true;
	if (n % 2 == 0)return false;
	for (int i = 3; i <= sqrt(n); i += 2) if (n%i == 0)return false;
	return true;
}
int main() {
	int n; cin >> n;
	if (isprime(f(n)))cout << "WANWAN\n"; else cout << "BOWWOW\n";
}

Submission Info

Judge Result