結果

問題 No.638 Sum of "not power of 2"
ユーザー watarimaycry2watarimaycry2
提出日時 2021-01-03 23:23:05
言語 Java21
(openjdk 21)
結果
AC  
実行時間 86 ms / 1,000 ms
コード長 3,092 bytes
コンパイル時間 4,125 ms
コンパイル使用メモリ 86,132 KB
実行使用メモリ 39,076 KB
最終ジャッジ日時 2024-10-13 17:11:25
合計ジャッジ時間 4,993 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
36,896 KB
testcase_01 AC 47 ms
37,132 KB
testcase_02 AC 48 ms
37,260 KB
testcase_03 AC 49 ms
36,848 KB
testcase_04 AC 71 ms
38,136 KB
testcase_05 AC 48 ms
37,248 KB
testcase_06 AC 71 ms
38,140 KB
testcase_07 AC 71 ms
38,344 KB
testcase_08 AC 86 ms
38,440 KB
testcase_09 AC 85 ms
39,076 KB
testcase_10 AC 82 ms
38,412 KB
testcase_11 AC 81 ms
38,880 KB
testcase_12 AC 48 ms
37,212 KB
testcase_13 AC 70 ms
38,048 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; import java.io.*; import java.math.*;
public class Main{
	static void solve(){//Here is the main function
		long N = nextLong();
		long L = 3;
		while(L < N){
			if(Long.bitCount(L) == 1){
				L++;
				continue;
			}
			long R = N - L;
			if(Long.bitCount(R) == 1){
				L++;
				continue;
			}
			myout(L + " " + R);
			return;
		}
		myout(-1);
	}
	//Method addition frame start



	//Method addition frame end

	//Don't have to see. start------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<>(1024);
		int index = 0; int max; String read;
		InputIterator(){
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			try{
				while((read = br.readLine()) != null){
					inputLine.addAll(Arrays.asList(read.split(" ")));
				}
			}catch(IOException e){}
			max = inputLine.size();
		}
		boolean hasNext(){return (index < max);}
		String next(){
			if(hasNext()){
				return inputLine.get(index++);
			}else{
				throw new IndexOutOfBoundsException("There is no more input");
			}
		}
	}
	static HashMap<Integer, String> CONVSTR = new HashMap<>();
	static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
	static PrintWriter out = new PrintWriter(System.out);
	static void flush(){out.flush();}
	static void myout(Object t){out.println(t);}
	static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
	static String next(){return ii.next();}
	static boolean hasNext(){return ii.hasNext();}
	static int nextInt(){return Integer.parseInt(next());}
	static long nextLong(){return Long.parseLong(next());}
	static double nextDouble(){return Double.parseDouble(next());}
	static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
	static ArrayList<String> nextStrArray(int size){
		ArrayList<String> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(next());
		}
		return ret;
	}
	static ArrayList<Integer> nextIntArray(int size){
		ArrayList<Integer> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Integer.parseInt(next()));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(int size){
		ArrayList<Long> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Long.parseLong(next()));
		}
		return ret;
	}
	@SuppressWarnings("unchecked")
	static String myconv(Object list, int no){//only join
		String joinString = CONVSTR.get(no);
		if(list instanceof String[]){
			return String.join(joinString, (String[])list);
		}else if(list instanceof ArrayList){
			return String.join(joinString, (ArrayList)list);
		}else{
			throw new ClassCastException("Don't join");
		}
	}
	static ArrayList<String> myconv(String str, int no){//only split
		String splitString = CONVSTR.get(no);
		return new ArrayList<String>(Arrays.asList(str.split(splitString)));
	}
	public static void main(String[] args){
		CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
		solve();flush();
	}
	//Don't have to see. end------------------------------------------
}
0