結果
問題 | No.889 素数! |
ユーザー |
![]() |
提出日時 | 2019-09-20 21:25:50 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,508 bytes |
コンパイル時間 | 2,455 ms |
コンパイル使用メモリ | 214,228 KB |
最終ジャッジ日時 | 2025-01-07 18:37:43 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 61 |
ソースコード
#pragma GCC optimize ("Ofast")#include<bits/stdc++.h>using namespace std;void *wmem;char memarr[96000000];template<class S, class T> inline S max_L(S a,T b){return a>=b?a:b;}template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};(*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );(*arr)=(T*)(*mem);(*mem)=((*arr)+x);}inline void rd(int &x){int k;int m=0;x=0;for(;;){k = getchar_unlocked();if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){x=k-'0';break;}}for(;;){k = getchar_unlocked();if(k<'0'||k>'9'){break;}x=x*10+k-'0';}if(m){x=-x;}}inline void wt_L(char a){putchar_unlocked(a);}inline void wt_L(int x){int s=0;int m=0;char f[10];if(x<0){m=1;x=-x;}while(x){f[s++]=x%10;x/=10;}if(!s){f[s++]=0;}if(m){putchar_unlocked('-');}while(s--){putchar_unlocked(f[s]+'0');}}inline void wt_L(const char c[]){int i=0;for(i=0;c[i]!='\0';i++){putchar_unlocked(c[i]);}}template<class T> int Factor_L(T N, T fac[], int fs[]){T i;int sz = 0;if(N%2==0){fac[sz] = 2;fs[sz] = 1;N /= 2;while(N%2==0){N /= 2;fs[sz]++;}sz++;}for(i=3;i*i<=N;i+=2){if(N%i==0){fac[sz] = i;fs[sz] = 1;N /= i;while(N%i==0){N /= i;fs[sz]++;}sz++;}}if(N > 1){fac[sz] = N;fs[sz] = 1;sz++;}return sz;}template<class T> int Divisor_L(T N, T res[], void *mem = wmem){int i;int j;int k;int s;int sz = 0;T *fc;int *fs;int fsz;walloc1d(&fc, 100, &mem);walloc1d(&fs, 100, &mem);fsz =Factor_L(N, fc, fs);res[sz++] = 1;for(i=(0);i<(fsz);i++){s = sz;k = s * fs[i];for(j=(0);j<(k);j++){res[sz++] = res[j] * fc[i];}}sort(res, res+sz);return sz;}template<class T> inline T pow2_L(T a){return a*a;}template<class T> inline T pow3_L(T a){return a*a*a;}long long Isqrt_s_L(long long n){long long r = sqrt(n);r =max_L(r-2, 0);while(pow2_L((r+1))<= n ){r++;}if(r*r!=n){r = -1;}return r;}int N;int ys;int y[100];int s;int main(){int i;wmem = memarr;rd(N);if(N<2){wt_L(N);wt_L('\n');return 0;}ys =Divisor_L(N, y);{int Lj4PdHRW;int KL2GvlyY;if(ys==0){KL2GvlyY = 0;}else{KL2GvlyY = y[0];for(Lj4PdHRW=(1);Lj4PdHRW<(ys);Lj4PdHRW++){KL2GvlyY += y[Lj4PdHRW];}}s =KL2GvlyY;}if(ys==2){wt_L("Sosu!");wt_L('\n');return 0;}if(Isqrt_s_L(N)>= 2){wt_L("Heihosu!");wt_L('\n');return 0;}for(i=(0);i<(100);i++){if(pow3_L(i)==N){wt_L("Ripposu!");wt_L('\n');return 0;}}if(2*N == s){wt_L("Kanzensu!");wt_L('\n');return 0;}wt_L(N);wt_L('\n');return 0;}// cLay varsion 20190919-1 [beta]// --- original code ---// int N;// int ys, y[100], s;// {// rd(N);// if(N<2) wt(N), return 0;// ys = Divisor(N, y);// s = sum(y(ys));// if(ys==2) wt("Sosu!"), return 0;// if(Isqrt_s(N) >= 2) wt("Heihosu!"), return 0;// rep(i,100) if(i**3==N) wt("Ripposu!"), return 0;// if(2N == s) wt("Kanzensu!"), return 0;// wt(N);// }