結果

問題 No.420 mod2漸化式
ユーザー uwiuwi
提出日時 2016-09-09 22:50:05
言語 Java21
(openjdk 21)
結果
AC  
実行時間 82 ms / 1,000 ms
コード長 3,436 bytes
コンパイル時間 6,278 ms
コンパイル使用メモリ 82,160 KB
実行使用メモリ 52,828 KB
最終ジャッジ日時 2023-08-25 23:16:24
合計ジャッジ時間 7,863 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 76 ms
52,468 KB
testcase_01 AC 74 ms
52,528 KB
testcase_02 AC 70 ms
50,724 KB
testcase_03 AC 73 ms
52,824 KB
testcase_04 AC 69 ms
50,788 KB
testcase_05 AC 70 ms
50,768 KB
testcase_06 AC 42 ms
49,448 KB
testcase_07 AC 71 ms
50,876 KB
testcase_08 AC 74 ms
52,364 KB
testcase_09 AC 70 ms
50,700 KB
testcase_10 AC 70 ms
51,024 KB
testcase_11 AC 70 ms
50,644 KB
testcase_12 AC 78 ms
52,828 KB
testcase_13 AC 72 ms
51,076 KB
testcase_14 AC 70 ms
50,680 KB
testcase_15 AC 75 ms
52,828 KB
testcase_16 AC 70 ms
52,524 KB
testcase_17 AC 73 ms
50,764 KB
testcase_18 AC 70 ms
52,612 KB
testcase_19 AC 69 ms
50,852 KB
testcase_20 AC 69 ms
50,792 KB
testcase_21 AC 71 ms
51,232 KB
testcase_22 AC 69 ms
50,660 KB
testcase_23 AC 74 ms
52,212 KB
testcase_24 AC 70 ms
51,096 KB
testcase_25 AC 69 ms
51,272 KB
testcase_26 AC 69 ms
50,716 KB
testcase_27 AC 75 ms
52,444 KB
testcase_28 AC 82 ms
52,696 KB
testcase_29 AC 74 ms
52,436 KB
testcase_30 AC 69 ms
50,828 KB
testcase_31 AC 72 ms
50,812 KB
testcase_32 AC 71 ms
50,660 KB
testcase_33 AC 43 ms
49,264 KB
testcase_34 AC 43 ms
49,416 KB
testcase_35 AC 42 ms
49,556 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;
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 N420 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		long x = ni();
		if(x > 31){
			out.println(0 + " " + 0);
			return;
		}
		if(x == 0){
			out.println(1 + " " + 0);
			return;
		}
		
		long[][] C = new long[60 + 1][60 + 1];
		for (int i = 0; i <= 60; i++) {
			C[i][0] = 1;
			for (int j = 1; j <= i; j++) {
				C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
			}
		}
		long one = C[30][(int)(x-1)];
		long sum = ((1L<<31)-1)*one;
		out.println(C[31][(int)x] + " " + sum);
	}
	
	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 N420().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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