結果
問題 | No.7 プライムナンバーゲーム |
ユーザー | threepipes_s |
提出日時 | 2015-02-21 03:53:47 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 278 ms / 5,000 ms |
コード長 | 2,802 bytes |
コンパイル時間 | 2,634 ms |
コンパイル使用メモリ | 79,096 KB |
実行使用メモリ | 55,296 KB |
最終ジャッジ日時 | 2024-04-09 03:43:19 |
合計ジャッジ時間 | 5,864 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 69 ms
51,212 KB |
testcase_01 | AC | 66 ms
51,016 KB |
testcase_02 | AC | 269 ms
55,252 KB |
testcase_03 | AC | 139 ms
52,596 KB |
testcase_04 | AC | 111 ms
52,384 KB |
testcase_05 | AC | 107 ms
52,252 KB |
testcase_06 | AC | 168 ms
54,612 KB |
testcase_07 | AC | 155 ms
52,680 KB |
testcase_08 | AC | 144 ms
52,812 KB |
testcase_09 | AC | 192 ms
54,828 KB |
testcase_10 | AC | 68 ms
51,148 KB |
testcase_11 | AC | 154 ms
52,812 KB |
testcase_12 | AC | 249 ms
54,892 KB |
testcase_13 | AC | 234 ms
54,920 KB |
testcase_14 | AC | 264 ms
55,252 KB |
testcase_15 | AC | 259 ms
55,296 KB |
testcase_16 | AC | 278 ms
55,072 KB |
ソースコード
import java.io.BufferedReader; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Comparator; import java.util.List; import java.util.TreeSet; public class Main { // public static final int INF = 1 << 30; public static int[] dp; public static int n; public static int[] p; public static void main(String[] args) throws NumberFormatException, IOException{ ContestScanner in = new ContestScanner(); makePrime(); n = in.nextInt(); dp = new int[n+1]; for(int i=0; i<=n; i++){ dp[i] = -1; } dp[2] = 0; dp[3] = 0; for(int i=4; i<=n; i++){ int pid = 0; TreeSet<Integer> set = new TreeSet<Integer>(); while(i - p[pid] > 1){ set.add(dp[i-p[pid]]); pid++; } int min = 0; while(set.contains(min)) min++; dp[i] = min; } if(dp[n] == 0) System.out.println("Lose"); else System.out.println("Win"); } public static void makePrime(){ p = new int[3000]; p[0] = 2; int idx = 0; for(int i=3; i<11111; i++){ boolean isPrime = true; for(int j=0; j<=idx; j++){ if(i%p[j]==0){ isPrime = false; break; } } if(isPrime){ idx++; p[idx] = i; } } } } class Pair{ int cost; int time; public Pair(int cost, int time){ this.cost = cost; this.time = time; } } class MyComp implements Comparator<int[]>{ public int compare(int[] a, int[] b) { return a[0] - b[0]; } } class Reverse implements Comparator<Integer>{ public int compare(Integer arg0, Integer arg1) { return arg1 - arg0; } } class Node{ int color; boolean checked; List<Integer> to = new ArrayList<Integer>(); public Node(){ checked = false; } } //class Node{ // int id; // List<Node> edge = new ArrayList<Node>(); // public Node(int id){ // this.id = id; // } // public void createEdge(Node node){ // edge.add(node); // } //} class ContestScanner{ private BufferedReader reader; private String[] line; private int idx; public ContestScanner() throws FileNotFoundException{ reader = new BufferedReader(new InputStreamReader(System.in)); } public ContestScanner(String filename) throws FileNotFoundException{ reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename))); } public String nextToken() throws IOException{ if(line == null || line.length <= idx){ line = reader.readLine().trim().split(" "); idx = 0; } return line[idx++]; } public long nextLong() throws IOException, NumberFormatException{ return Long.parseLong(nextToken()); } public int nextInt() throws NumberFormatException, IOException{ return (int)nextLong(); } public double nextDouble() throws NumberFormatException, IOException{ return Double.parseDouble(nextToken()); } }