結果
問題 | No.1006 Share an Integer |
ユーザー | uwi |
提出日時 | 2020-03-06 22:16:48 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 216 ms / 2,000 ms |
コード長 | 3,601 bytes |
コンパイル時間 | 3,875 ms |
コンパイル使用メモリ | 87,744 KB |
実行使用メモリ | 49,232 KB |
最終ジャッジ日時 | 2024-10-14 07:38:02 |
合計ジャッジ時間 | 7,755 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 76 ms
38,164 KB |
testcase_01 | AC | 84 ms
39,792 KB |
testcase_02 | AC | 75 ms
38,124 KB |
testcase_03 | AC | 69 ms
37,796 KB |
testcase_04 | AC | 84 ms
39,528 KB |
testcase_05 | AC | 69 ms
38,024 KB |
testcase_06 | AC | 71 ms
38,120 KB |
testcase_07 | AC | 71 ms
37,592 KB |
testcase_08 | AC | 72 ms
38,036 KB |
testcase_09 | AC | 72 ms
37,908 KB |
testcase_10 | AC | 73 ms
37,972 KB |
testcase_11 | AC | 158 ms
45,372 KB |
testcase_12 | AC | 205 ms
48,664 KB |
testcase_13 | AC | 216 ms
49,180 KB |
testcase_14 | AC | 214 ms
49,232 KB |
testcase_15 | AC | 198 ms
48,112 KB |
testcase_16 | AC | 145 ms
47,060 KB |
testcase_17 | AC | 161 ms
45,692 KB |
testcase_18 | AC | 198 ms
48,016 KB |
testcase_19 | AC | 190 ms
47,668 KB |
testcase_20 | AC | 199 ms
48,212 KB |
testcase_21 | AC | 215 ms
49,104 KB |
ソースコード
package contest200306; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.InputMismatchException; import java.util.List; public class D2 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int X = ni(); int[] nd = new int[X+1]; for(int i = 1;i <= X;i++) { for(int j = i;j <= X;j+=i) { nd[j]++; } } for(int i = 1;i <= X;i++)nd[i] = i-nd[i]; List<Integer> ans = new ArrayList<>(); int min = 999999999; for(int i = 1;i <= X-1;i++) { int j = X-i; int vi = nd[i]; int vj = nd[j]; if(Math.abs(vi-vj) < min) { min = Math.abs(vi-vj); ans.clear(); ans.add(i); }else if(Math.abs(vi-vj) == min) { ans.add(i); } } for(int u : ans) { out.println(u + " " + (X-u)); } } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new D2().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }