結果
問題 | No.1298 OR XOR |
ユーザー | shojin_pro |
提出日時 | 2020-11-27 21:45:43 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 85 ms / 2,000 ms |
コード長 | 2,933 bytes |
コンパイル時間 | 2,750 ms |
コンパイル使用メモリ | 77,068 KB |
実行使用メモリ | 53,760 KB |
最終ジャッジ日時 | 2023-10-01 05:14:26 |
合計ジャッジ時間 | 4,701 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 78 ms
52,632 KB |
testcase_01 | AC | 42 ms
49,572 KB |
testcase_02 | AC | 44 ms
49,512 KB |
testcase_03 | AC | 43 ms
49,516 KB |
testcase_04 | AC | 43 ms
49,896 KB |
testcase_05 | AC | 45 ms
49,976 KB |
testcase_06 | AC | 79 ms
53,660 KB |
testcase_07 | AC | 79 ms
53,760 KB |
testcase_08 | AC | 81 ms
51,956 KB |
testcase_09 | AC | 77 ms
52,728 KB |
testcase_10 | AC | 81 ms
52,532 KB |
testcase_11 | AC | 85 ms
52,588 KB |
testcase_12 | AC | 82 ms
52,752 KB |
testcase_13 | AC | 75 ms
52,772 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { public static void main(String[] args) throws Exception { FastScanner sc = new FastScanner(System.in); PrintWriter pw = new PrintWriter(System.out); long a = sc.nextLong(); long A = a; long b = 0; long c = 0; long tmp = 2; boolean isB = true; while(a != 0){ if(a % tmp != 0){ if(isB){ b += a%tmp; }else{ c += a%tmp; } isB = !isB; a -= a%tmp; } tmp *= 2; } pw.println(b != 0 && c != 0 ? A +" " + b + " " + c : "-1 -1 -1"); pw.flush(); } static class GeekInteger { public static void save_sort(int[] array) { shuffle(array); Arrays.sort(array); } public static int[] shuffle(int[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); int randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } } } class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String[] nextArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = next(); return a; } 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; } }