結果
問題 | No.638 Sum of "not power of 2" |
ユーザー |
|
提出日時 | 2018-01-26 22:48:58 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 177 ms / 1,000 ms |
コード長 | 3,618 bytes |
コンパイル時間 | 4,095 ms |
コンパイル使用メモリ | 80,136 KB |
実行使用メモリ | 42,700 KB |
最終ジャッジ日時 | 2024-12-30 02:22:16 |
合計ジャッジ時間 | 7,453 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 12 |
ソースコード
package yukicoder;import java.util.*;public class P638 {public static void main(String[] args) {// TODO Auto-generated method stubScanner sc = new Scanner(System.in);long[] twos = { 1L,2L,4L,8L,16L,32L,64L,128L,256L,512L,1024L,2048L,4096L,8192L,16384L,32768L,65536L,131072L,262144L,524288L,1048576L,2097152L,4194304L,8388608L,16777216L,33554432L,67108864L,134217728L,268435456L,536870912L,1073741824L,2147483648L,4294967296L,8589934592L,17179869184L,34359738368L,68719476736L,137438953472L,274877906944L,549755813888L,1099511627776L,2199023255552L,4398046511104L,8796093022208L,17592186044416L,35184372088832L,70368744177664L,140737488355328L,281474976710656L,562949953421312L,1125899906842624L,2251799813685248L,4503599627370496L,9007199254740992L,18014398509481984L,36028797018963968L,72057594037927936L,144115188075855872L,288230376151711744L,576460752303423488L,};HashSet<Long> test = new HashSet<Long>();for(int i=0; i<twos.length; i++) {test.add(twos[i]);}long n = sc.nextLong();for(long a=3; a<n; a++) {if(test.contains(a)) {continue;} else {if(test.contains(n-a)) {continue;} else {System.out.println(a + " "+ (n-a));return;}}}System.out.println(-1);}static int binarySearch(int[] A, int x) {int l = 0;int r = A.length;while(l<r) {int mid = (l+r)/2;if(A[mid] == x) return mid;else if(x<A[mid]) r = mid;else l = mid+1;}return -1;}static long upper_bound(int[] A, int b) {// bよりおおきい値がはじめて出てくるindexを返すreturn lower_bound(A, b+1);}static long lower_bound(int[] A, int b) {// b以上の値がはじめて出てくるindexを返すint lb=0;int ub=A.length;while(ub>lb) {int mid = (lb+ub)/2;if(A[mid]>=b) ub = mid;else lb = mid+1;}return lb;}// union find lib// usage:// 最初にinitを呼ぶ// root: 直接は呼ばないで// unite: まとめる// same: グループ判定static void init(int par[], int N) {for(int i=0; i<N; i++) {par[i] = i;}}static int root(int x, int [] par) {if(par[x] == x) {return x;} else {return (par[x] = root(par[x], par));}}static boolean same(int x, int y, int[] par) {return root(x, par) == root(y, par);}static void unite(int x, int y, int[] par) {x = root(x, par);y = root(y, par);if(x == y) return;par[x] = y;}// end union find lib// number libstatic int max(int...ls) {int ans = Integer.MIN_VALUE;for(int i=0; i<ls.length; i++) {ans = Math.max(ans, ls[i]);}return ans;}static int min(int...ls) {int ans = Integer.MAX_VALUE;for(int i=0; i<ls.length; i++) {ans = Math.min(ans, ls[i]);}return ans;}static long lcm(long a, long b) {return a*(b/gcd(a, b));}static long gcd(long a, long b) {long ta = Math.max(a, b);long tb = Math.min(a, b);long tmp;while((tmp = ta%tb) != 0) {ta = tb;tb = tmp;}return tb;}static long modcomb(long n, long k, long mod) {if(k==1) {return n;}long ans = 1;for(long i=n; i>=n-k+1; i--) {ans = (ans * i)%mod;}for(long i=k; 0<i; i--) {ans = (ans * modpow(i, mod-2, mod)) % mod;}return ans;}static long modpow(long a, long b, long mod) {if(b==0) return 1;if(b%2==0) {long d = modpow(a, b/2, mod);return (d*d)%mod;} else {return (a*modpow(a, b-1, mod))%mod;}}static int disit(long a, long d) {int count = 0;while(a!=0) {a = a/d;count++;}return count;}// end number lib}