Submission #1214903
Source Code Expand
#include <cstdio> #include <cstring> #include <ctime> #include <cstdlib> #include <cmath> #include <iostream> #include <string> #include <queue> #include <map> #include <stack> #include <vector> #include <algorithm> #include <set> #include <deque> #include <utility> #include <chrono> #include <sstream> #include <iomanip> #define INF 1 << 30 #define MOD 1000000007; #define PI 3.14159265358979 #define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++) #define reu(i, l, r) for (int (i) = (int)(l); (i) < (int)(r); (i)++) #define D(x) cout << x << endl #define d(x) cout << x #define all(x) (x).begin(), (x).end() #define pub(x) push_back(x) #define pob() pop_back() #define puf(x) push_front(x) #define pof() pop_front() #define mp(x, y) make_pair((x), (y)) #define fi first #define se second using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<double> vd; typedef vector<long long> vll; typedef vector<string> vs; typedef vector<bool> vb; typedef pair<int, int> pii; typedef pair<long, long> pll; typedef vector<pii> vpii; typedef vector<pll> vpll; template<typename T, typename U> inline void amin(T &x, U y) { if (y < x) x = y; } template<typename T, typename U> inline void amax(T &x, U y) { if (x < y) x = y; } static const int dx[] = {0, 0, 1, -1}; static const int dy[] = {-1, 1, 0, 0}; bool isprime(int n) { if (n == 1) return false; for (int i = 2; i * i <= n; i++) { if (!(n % i)) { return false; } } return true; } int main() { int n; cin >> n; if (isprime(n * (n + 1) / 2)) D("WANWAN"); else D("BOWWOW"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ホリドッグ |
User | KokiYmgch |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1672 Byte |
Status | AC |
Exec Time | 1 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 | 1 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 | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | AC | 1 ms | 256 KB |