結果

問題 No.3029 素因数
ユーザー uwiuwi
提出日時 2017-04-05 13:06:15
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,777 bytes
コンパイル時間 4,051 ms
コンパイル使用メモリ 80,856 KB
実行使用メモリ 52,368 KB
最終ジャッジ日時 2024-07-08 10:35:04
合計ジャッジ時間 6,146 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
50,188 KB
testcase_01 AC 55 ms
49,736 KB
testcase_02 AC 48 ms
50,120 KB
testcase_03 AC 47 ms
50,152 KB
testcase_04 AC 47 ms
50,092 KB
testcase_05 WA -
testcase_06 AC 46 ms
37,164 KB
testcase_07 AC 46 ms
37,120 KB
testcase_08 AC 47 ms
36,684 KB
testcase_09 AC 46 ms
37,044 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 45 ms
37,160 KB
testcase_13 AC 45 ms
37,160 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 46 ms
36,760 KB
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 47 ms
36,924 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 AC 51 ms
36,968 KB
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 AC 48 ms
37,196 KB
testcase_30 WA -
testcase_31 AC 47 ms
36,792 KB
testcase_32 WA -
testcase_33 AC 47 ms
37,116 KB
testcase_34 AC 46 ms
37,116 KB
testcase_35 AC 45 ms
37,120 KB
testcase_36 AC 45 ms
36,848 KB
testcase_37 WA -
testcase_38 WA -
testcase_39 AC 46 ms
37,160 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package etc;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class AF3029 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int a128 = 0b1001110101101000110;
		int a64 = 0b1000100111101000111;
		int a32 = 0b0111110001000000000;
		int a16 = 0b0111010101111110010;
		int a8 = 0b0011100110000111110;
		int a4 = 0b0101011110100100101;
		int[] B = {a4, a8, a16, a32, a64, a128};
		int[] ans = new int[41];
		outer:
		for(int i = 1;i <= 40;i++){
			if(i == 1){
				ans[i] = 0;
			}else if(i % 2 == 0){
				ans[i] = 1;
			}else{
				for(int k = 0;k < 19;k++){
					int my = 0;
					for(int j = 0;j < 6;j++){
						my |= (B[j]>>>k&1)<<j+1;
					}
					if((my^i) == 1){
						ans[i] = 0;
						continue outer;
					}
					if((my^i) == (1<<7)-1){
						ans[i] = 1;
						continue outer;
					}
				}
				throw new RuntimeException();
			}
		}
		
		out.println(ans[ni()] == 1 ? "odd" : "even");
	}
	
	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 AF3029().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)); }
}
0