結果

問題 No.371 ぼく悪いプライムじゃないよ
ユーザー LayCurseLayCurse
提出日時 2016-05-13 22:36:26
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 6 ms / 1,000 ms
コード長 3,489 bytes
コンパイル時間 1,601 ms
コンパイル使用メモリ 146,680 KB
実行使用メモリ 7,460 KB
最終ジャッジ日時 2023-08-29 00:52:23
合計ジャッジ時間 2,794 ms
ジャッジサーバーID
(参考情報)
judge15 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,528 KB
testcase_01 AC 2 ms
5,736 KB
testcase_02 AC 2 ms
5,656 KB
testcase_03 AC 2 ms
5,396 KB
testcase_04 AC 2 ms
5,400 KB
testcase_05 AC 3 ms
5,440 KB
testcase_06 AC 2 ms
5,432 KB
testcase_07 AC 2 ms
5,480 KB
testcase_08 AC 2 ms
5,440 KB
testcase_09 AC 3 ms
5,464 KB
testcase_10 AC 3 ms
5,532 KB
testcase_11 AC 2 ms
5,384 KB
testcase_12 AC 2 ms
5,400 KB
testcase_13 AC 3 ms
5,532 KB
testcase_14 AC 3 ms
5,472 KB
testcase_15 AC 3 ms
5,576 KB
testcase_16 AC 2 ms
5,660 KB
testcase_17 AC 3 ms
5,536 KB
testcase_18 AC 2 ms
5,684 KB
testcase_19 AC 3 ms
5,468 KB
testcase_20 AC 2 ms
5,404 KB
testcase_21 AC 2 ms
5,636 KB
testcase_22 AC 2 ms
5,468 KB
testcase_23 AC 3 ms
5,404 KB
testcase_24 AC 2 ms
5,392 KB
testcase_25 AC 2 ms
5,456 KB
testcase_26 AC 2 ms
5,396 KB
testcase_27 AC 2 ms
5,540 KB
testcase_28 AC 3 ms
5,472 KB
testcase_29 AC 6 ms
7,460 KB
testcase_30 AC 2 ms
5,380 KB
testcase_31 AC 2 ms
5,384 KB
testcase_32 AC 2 ms
5,392 KB
testcase_33 AC 2 ms
5,468 KB
testcase_34 AC 2 ms
5,540 KB
testcase_35 AC 2 ms
5,488 KB
testcase_36 AC 3 ms
5,488 KB
testcase_37 AC 2 ms
5,400 KB
testcase_38 AC 2 ms
5,548 KB
testcase_39 AC 2 ms
5,380 KB
testcase_40 AC 2 ms
5,460 KB
testcase_41 AC 2 ms
5,432 KB
testcase_42 AC 2 ms
5,396 KB
testcase_43 AC 4 ms
6,764 KB
testcase_44 AC 3 ms
5,436 KB
testcase_45 AC 3 ms
5,444 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:26:44: warning: ‘res’ may be used uninitialized in this function [-Wmaybe-uninitialized]
 template<class T> void writerLn(T x){writer(x,'\n');}
                                      ~~~~~~^~~~~~~~
main.cpp:48:6: note: ‘res’ was declared here
   ll res;
      ^~~

ソースコード

diff #

#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(double *x){scanf("%lf",x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}

void writer(int x, char c){int s=0,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)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(double x, char c){printf("%.15f",x);mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

char memarr[17000000]; void *mem = memarr;
#define MD 1000000007

int getPrime(int N, int res[]){int i,a,b,s=1,f[4780],S=1;const int r=23000;bool B[r],*p=B;N/=2;res[0]=2;b=min(r,N);REP(i,1,b)p[i]=1;REP(i,1,b)if(p[i]){res[s++]=2*i+1;f[S]=2*i*(i+1);if(f[S]<N){for(;f[S]<r;f[S]+=res[S])p[f[S]]=0;S++;}}for(a=r;a<N;a+=r){b=min(a+r,N);p-=r;REP(i,a,b)p[i]=1;REP(i,1,S)for(;f[i]<b;f[i]+=res[i])p[f[i]]=0;REP(i,a,b)if(p[i])res[s++]=2*i+1;}return s;}
template<class T> int getFactors(ll n, T fac[], int num[], int ps, int p[]){int i,j,k,s=0;rep(i,ps){if((ll)p[i]*p[i]>n) break;if(n%p[i]==0){fac[s]=p[i];num[s]=0;while(n%p[i]==0)n/=p[i],num[s]++;s++;}}if(n>1)fac[s]=n,num[s++]=1;return s;}

ll X, Y;
int ps, p[100000];

ll f[100];
int num[100], fs;

ll mn[400000];

int main(){
  ll i, j, k;
  ll mx;
  ll res;

  ps = getPrime(110000, p);
  reader(&X,&Y);

  if(Y - X > 300000){
    for(i=ps-1;i>=0;i--){
      if((ll)p[i]*p[i] > Y) continue;
      for(j=i;j<ps;j++){
        if((ll)p[i]*p[j] > Y) break;
      }
      res = (ll)p[i] * p[j-1];
      if(res >= X) break;
    }
  } else {
    rep(i,Y-X+1) mn[i] = -1;
    rep(i,ps){
      k = (X+p[i]-1) / p[i] * p[i];
      while(k<=Y){
        if(mn[k-X] == -1 && k != p[i]) mn[k-X] = p[i];
        k += p[i];
      }
    }
//    rep(i,Y-X+1) printf("%lld %lld\n",i+X,mn[i]);
    mx = 0;
    rep(i,Y-X+1) if(mn[i] >= mx){
      mx = mn[i];
      res = i + X;
    }
  }

  writerLn(res);

  return 0;
}
0