結果
問題 | No.889 素数! |
ユーザー |
|
提出日時 | 2019-09-20 21:31:33 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 2,221 bytes |
コンパイル時間 | 2,296 ms |
コンパイル使用メモリ | 197,284 KB |
最終ジャッジ日時 | 2025-01-07 18:39:33 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 61 |
ソースコード
#include <bits/stdc++.h>#define LLI long long int#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)#define REP(v, n) FOR(v, 0, n)#define REPE(v, n) FORE(v, 0, n)#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)#define ALL(x) (x).begin(), (x).end()#define RALL(x) (x).rbegin(), (x).rend()#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)#define EXIST(c,x) ((c).find(x) != (c).end())#define fst first#define snd second#define popcount __builtin_popcount#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())#define bit(i) (1LL<<(i))#ifdef DEBUG#include <misc/C++/Debug.cpp>#else#define dump(...) ((void)0)#endif#define gcd __gcdusing namespace std;template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}struct Init{Init(){cin.tie(0);ios::sync_with_stdio(false);}}init;vector<int> kanzensu = {6,28};vector<int> heihousu = {4,9,16,25,36,49};vector<int> rippousu = {8,27};vector<bool> eratosthenes_sieve(int n){vector<bool> res(n+1, true);res[0] = res[1] = false;FOR(i,2,n) if(res[i]) for(int j=2*i; j<=n; j+=i) res[j] = false;return res;}int main(){auto prime = eratosthenes_sieve(100);int n;while(cin >> n){if(prime[n]){cout << "Sosu!" << endl;}else if(count(ALL(kanzensu), n)){cout << "Kanzensu!" << endl;}else if(count(ALL(heihousu), n)){cout << "Heihosu!" << endl;}else if(count(ALL(rippousu), n)){cout << "Ripposu!" << endl;}else{cout << n << endl;}}return 0;}