結果
問題 | No.308 素数は通れません |
ユーザー | holeguma |
提出日時 | 2015-12-01 20:48:58 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,646 bytes |
コンパイル時間 | 2,578 ms |
コンパイル使用メモリ | 78,640 KB |
実行使用メモリ | 37,356 KB |
最終ジャッジ日時 | 2024-09-14 06:09:07 |
合計ジャッジ時間 | 10,842 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
36,568 KB |
testcase_01 | AC | 53 ms
36,952 KB |
testcase_02 | AC | 55 ms
37,036 KB |
testcase_03 | AC | 53 ms
37,068 KB |
testcase_04 | AC | 54 ms
37,028 KB |
testcase_05 | AC | 53 ms
37,064 KB |
testcase_06 | AC | 53 ms
36,972 KB |
testcase_07 | AC | 56 ms
37,088 KB |
testcase_08 | AC | 54 ms
37,056 KB |
testcase_09 | AC | 53 ms
36,532 KB |
testcase_10 | AC | 53 ms
37,012 KB |
testcase_11 | AC | 52 ms
37,064 KB |
testcase_12 | AC | 53 ms
36,776 KB |
testcase_13 | AC | 53 ms
37,004 KB |
testcase_14 | AC | 53 ms
36,924 KB |
testcase_15 | AC | 53 ms
37,008 KB |
testcase_16 | AC | 54 ms
36,764 KB |
testcase_17 | AC | 54 ms
36,524 KB |
testcase_18 | AC | 53 ms
36,528 KB |
testcase_19 | AC | 53 ms
37,068 KB |
testcase_20 | AC | 54 ms
37,176 KB |
testcase_21 | AC | 54 ms
37,024 KB |
testcase_22 | AC | 54 ms
36,980 KB |
testcase_23 | AC | 54 ms
36,948 KB |
testcase_24 | AC | 54 ms
36,936 KB |
testcase_25 | AC | 54 ms
36,840 KB |
testcase_26 | AC | 55 ms
36,764 KB |
testcase_27 | AC | 55 ms
37,052 KB |
testcase_28 | AC | 54 ms
37,052 KB |
testcase_29 | AC | 54 ms
36,720 KB |
testcase_30 | AC | 56 ms
37,048 KB |
testcase_31 | AC | 53 ms
37,040 KB |
testcase_32 | WA | - |
testcase_33 | AC | 52 ms
36,840 KB |
testcase_34 | AC | 53 ms
36,992 KB |
testcase_35 | AC | 53 ms
37,032 KB |
testcase_36 | AC | 56 ms
36,720 KB |
testcase_37 | AC | 56 ms
36,980 KB |
testcase_38 | AC | 54 ms
37,004 KB |
testcase_39 | AC | 53 ms
36,832 KB |
testcase_40 | AC | 54 ms
37,004 KB |
testcase_41 | AC | 54 ms
36,884 KB |
testcase_42 | AC | 56 ms
36,996 KB |
testcase_43 | AC | 55 ms
36,928 KB |
testcase_44 | AC | 54 ms
37,068 KB |
testcase_45 | AC | 53 ms
37,076 KB |
testcase_46 | AC | 53 ms
36,676 KB |
testcase_47 | AC | 55 ms
36,956 KB |
testcase_48 | AC | 53 ms
36,836 KB |
testcase_49 | AC | 53 ms
36,848 KB |
testcase_50 | AC | 54 ms
36,568 KB |
testcase_51 | AC | 52 ms
36,888 KB |
testcase_52 | AC | 54 ms
36,764 KB |
testcase_53 | AC | 54 ms
36,880 KB |
testcase_54 | AC | 54 ms
36,812 KB |
testcase_55 | AC | 55 ms
37,068 KB |
testcase_56 | AC | 55 ms
37,104 KB |
testcase_57 | AC | 53 ms
36,912 KB |
testcase_58 | AC | 54 ms
36,840 KB |
testcase_59 | AC | 53 ms
36,920 KB |
testcase_60 | AC | 54 ms
36,924 KB |
testcase_61 | AC | 53 ms
37,076 KB |
testcase_62 | AC | 52 ms
37,052 KB |
testcase_63 | AC | 55 ms
37,356 KB |
testcase_64 | AC | 53 ms
37,004 KB |
testcase_65 | AC | 56 ms
36,560 KB |
testcase_66 | AC | 55 ms
37,036 KB |
testcase_67 | AC | 53 ms
37,004 KB |
testcase_68 | AC | 53 ms
36,720 KB |
testcase_69 | AC | 54 ms
37,012 KB |
testcase_70 | AC | 53 ms
36,784 KB |
testcase_71 | AC | 52 ms
36,884 KB |
testcase_72 | AC | 52 ms
36,804 KB |
testcase_73 | AC | 53 ms
36,840 KB |
testcase_74 | AC | 51 ms
37,088 KB |
testcase_75 | AC | 52 ms
37,068 KB |
testcase_76 | WA | - |
testcase_77 | AC | 52 ms
36,744 KB |
testcase_78 | AC | 53 ms
36,888 KB |
testcase_79 | AC | 53 ms
36,992 KB |
testcase_80 | WA | - |
testcase_81 | WA | - |
testcase_82 | AC | 52 ms
36,848 KB |
testcase_83 | AC | 54 ms
37,068 KB |
testcase_84 | WA | - |
testcase_85 | AC | 55 ms
37,088 KB |
testcase_86 | WA | - |
testcase_87 | WA | - |
testcase_88 | AC | 53 ms
37,064 KB |
testcase_89 | AC | 56 ms
37,060 KB |
testcase_90 | WA | - |
testcase_91 | AC | 54 ms
37,072 KB |
testcase_92 | AC | 53 ms
36,840 KB |
testcase_93 | AC | 53 ms
36,568 KB |
testcase_94 | AC | 53 ms
37,044 KB |
testcase_95 | AC | 56 ms
36,848 KB |
testcase_96 | AC | 55 ms
37,308 KB |
testcase_97 | AC | 55 ms
36,808 KB |
testcase_98 | AC | 54 ms
36,972 KB |
testcase_99 | AC | 55 ms
37,344 KB |
testcase_100 | AC | 56 ms
37,328 KB |
testcase_101 | WA | - |
testcase_102 | AC | 54 ms
36,880 KB |
testcase_103 | AC | 53 ms
37,052 KB |
testcase_104 | AC | 53 ms
36,848 KB |
testcase_105 | AC | 54 ms
37,004 KB |
testcase_106 | AC | 56 ms
36,944 KB |
ソースコード
import java.io.InputStream; import java.io.IOException; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.Comparator; import java.util.InputMismatchException; import java.util.NoSuchElementException; import java.math.BigInteger; public class Main{ static PrintWriter out; static InputReader ir; static void solve(){ long n=ir.nextLong(); if(n==4) out.println(3); else if(n==6) out.println(5); else if(n==8||n==9||n==10||n==15||n==16||n==22) out.println(7); else if(n==12) out.println(11); else if(n==14||n==15) out.println(13); else if(n==20||n==21) out.println(19); else if(n==24||n==25) out.println(23); else if(n%8==1&&isPrime(n-8,50)) out.println(14); else out.println(8); } public static boolean isPrime(long n,int k){ if(n==2) return true; if(n<2||n%2==0) return false; long d=(n-1)>>1; while(d%2==0) d>>=1; for(int i=0;i<k;i++){ long a=(long)(Math.random()*(n-1))+1; long t=d; long y=BigInteger.valueOf(a).modPow(BigInteger.valueOf(2),BigInteger.valueOf(n)).longValue(); while(t!=n-1&&y!=1&&y!=n-1){ y=BigInteger.valueOf(y).modPow(BigInteger.valueOf(2),BigInteger.valueOf(n)).longValue(); t<<=1; } if(y!=n-1&&t%2==0) return false; } return true; } public static void main(String[] args) throws Exception{ ir=new InputReader(System.in); out=new PrintWriter(System.out); solve(); out.flush(); } static class InputReader { private InputStream in; private byte[] buffer=new byte[1024]; private int curbuf; private int lenbuf; public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;} public boolean hasNextByte() { if(curbuf>=lenbuf){ curbuf= 0; try{ lenbuf=in.read(buffer); }catch(IOException e) { throw new InputMismatchException(); } if(lenbuf<=0) return false; } return true; } private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;} private boolean isSpaceChar(int c){return !(c>=33&&c<=126);} private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;} public boolean hasNext(){skip(); return hasNextByte();} public String next(){ if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb=new StringBuilder(); int b=readByte(); while(!isSpaceChar(b)){ sb.appendCodePoint(b); b=readByte(); } return sb.toString(); } public int nextInt() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } int res=0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } long res = 0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public double nextDouble(){return Double.parseDouble(next());} public BigInteger nextBigInteger(){return new BigInteger(next());} public int[] nextIntArray(int n){ int[] a=new int[n]; for(int i=0;i<n;i++) a[i]=nextInt(); return a; } public long[] nextLongArray(int n){ long[] a=new long[n]; for(int i=0;i<n;i++) a[i]=nextLong(); return a; } public char[][] nextCharMap(int n,int m){ char[][] map=new char[n][m]; for(int i=0;i<n;i++) map[i]=next().toCharArray(); return map; } } }