#290070 (Java21) No.741 AscNumber(Easy)

提出ソース

結果

問題	No.741 AscNumber(Easy)
ユーザー	uwi
提出日時	2018-10-05 22:24:14
言語	Java21 (openjdk 21)
結果	AC
実行時間	103 ms / 2,000 ms
コード長	3,896 bytes
コンパイル時間	4,123 ms
コンパイル使用メモリ	81,248 KB
実行使用メモリ	57,372 KB
最終ジャッジ日時	2024-10-12 13:15:31
合計ジャッジ時間	11,430 ms
ジャッジサーバーID （参考情報）	judge5 / judge

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	102 ms 57,296 KB
testcase_01	AC	100 ms 57,188 KB
testcase_02	AC	99 ms 57,192 KB
testcase_03	AC	96 ms 56,944 KB
testcase_04	AC	96 ms 57,336 KB
testcase_05	AC	93 ms 57,272 KB
testcase_06	AC	98 ms 57,204 KB
testcase_07	AC	96 ms 57,100 KB
testcase_08	AC	98 ms 57,308 KB
testcase_09	AC	95 ms 57,316 KB
testcase_10	AC	97 ms 57,168 KB
testcase_11	AC	98 ms 57,328 KB
testcase_12	AC	98 ms 57,320 KB
testcase_13	AC	98 ms 57,308 KB
testcase_14	AC	93 ms 57,328 KB
testcase_15	AC	94 ms 57,264 KB
testcase_16	AC	96 ms 57,352 KB
testcase_17	AC	98 ms 57,308 KB
testcase_18	AC	95 ms 57,268 KB
testcase_19	AC	95 ms 57,124 KB
testcase_20	AC	97 ms 57,304 KB
testcase_21	AC	98 ms 57,300 KB
testcase_22	AC	98 ms 57,176 KB
testcase_23	AC	97 ms 57,272 KB
testcase_24	AC	94 ms 57,240 KB
testcase_25	AC	96 ms 57,220 KB
testcase_26	AC	97 ms 57,332 KB
testcase_27	AC	97 ms 57,364 KB
testcase_28	AC	98 ms 57,304 KB
testcase_29	AC	97 ms 57,268 KB
testcase_30	AC	98 ms 57,200 KB
testcase_31	AC	97 ms 57,128 KB
testcase_32	AC	96 ms 57,272 KB
testcase_33	AC	98 ms 57,336 KB
testcase_34	AC	93 ms 57,268 KB
testcase_35	AC	96 ms 57,304 KB
testcase_36	AC	94 ms 57,340 KB
testcase_37	AC	98 ms 57,016 KB
testcase_38	AC	98 ms 57,304 KB
testcase_39	AC	94 ms 57,328 KB
testcase_40	AC	96 ms 57,340 KB
testcase_41	AC	97 ms 57,356 KB
testcase_42	AC	96 ms 57,248 KB
testcase_43	AC	99 ms 57,196 KB
testcase_44	AC	95 ms 57,304 KB
testcase_45	AC	97 ms 57,080 KB
testcase_46	AC	100 ms 57,308 KB
testcase_47	AC	98 ms 57,328 KB
testcase_48	AC	99 ms 57,292 KB
testcase_49	AC	97 ms 57,348 KB
testcase_50	AC	103 ms 57,324 KB
testcase_51	AC	101 ms 57,356 KB
testcase_52	AC	99 ms 57,296 KB
testcase_53	AC	97 ms 56,948 KB
testcase_54	AC	94 ms 57,372 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package contest181005;
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 C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		// C(0+8,8)+...+C(n+8,8)
		// = C(n+9,9)
		int mod = 1000000007;
		int[][] fif = enumFIF(1010000, mod);
		out.println(C(ni()+9, 9, mod, fif));
	}
	
	public static long C(int n, int r, int mod, int[][] fif) {
		if (n < 0 || r < 0 || r > n)
			return 0;
		return (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod;
	}

	
	public static int[][] enumFIF(int n, int mod) {
		int[] f = new int[n + 1];
		int[] invf = new int[n + 1];
		f[0] = 1;
		for (int i = 1; i <= n; i++) {
			f[i] = (int) ((long) f[i - 1] * i % mod);
		}
		long a = f[n];
		long b = mod;
		long p = 1, q = 0;
		while (b > 0) {
			long c = a / b;
			long d;
			d = a;
			a = b;
			b = d % b;
			d = p;
			p = q;
			q = d - c * q;
		}
		invf[n] = (int) (p < 0 ? p + mod : p);
		for (int i = n - 1; i >= 0; i--) {
			invf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod);
		}
		return new int[][] { f, invf };
	}

	
	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 C().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)); }
}

yukicoder

結果

テストケース

ソースコード