結果

問題 No.1177 余りは?
ユーザー uwiuwi
提出日時 2020-08-21 21:29:47
言語 Java21
(openjdk 21)
結果
AC  
実行時間 51 ms / 1,000 ms
コード長 4,102 bytes
コンパイル時間 4,674 ms
コンパイル使用メモリ 83,664 KB
実行使用メモリ 50,532 KB
最終ジャッジ日時 2024-04-23 06:36:51
合計ジャッジ時間 5,741 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
50,296 KB
testcase_01 AC 47 ms
50,132 KB
testcase_02 AC 46 ms
50,316 KB
testcase_03 AC 46 ms
50,448 KB
testcase_04 AC 46 ms
50,452 KB
testcase_05 AC 45 ms
50,388 KB
testcase_06 AC 46 ms
50,052 KB
testcase_07 AC 50 ms
50,004 KB
testcase_08 AC 51 ms
50,068 KB
testcase_09 AC 51 ms
50,076 KB
testcase_10 AC 48 ms
50,072 KB
testcase_11 AC 47 ms
50,384 KB
testcase_12 AC 49 ms
50,332 KB
testcase_13 AC 49 ms
50,020 KB
testcase_14 AC 50 ms
50,416 KB
testcase_15 AC 50 ms
50,300 KB
testcase_16 AC 47 ms
50,368 KB
testcase_17 AC 47 ms
50,440 KB
testcase_18 AC 46 ms
50,444 KB
testcase_19 AC 46 ms
50,184 KB
testcase_20 AC 47 ms
50,412 KB
testcase_21 AC 45 ms
50,076 KB
testcase_22 AC 47 ms
50,476 KB
testcase_23 AC 48 ms
50,532 KB
testcase_24 AC 47 ms
50,288 KB
testcase_25 AC 47 ms
50,084 KB
testcase_26 AC 50 ms
50,448 KB
testcase_27 AC 49 ms
50,388 KB
testcase_28 AC 48 ms
50,448 KB
testcase_29 AC 49 ms
50,428 KB
testcase_30 AC 49 ms
50,092 KB
testcase_31 AC 49 ms
50,224 KB
testcase_32 AC 48 ms
50,420 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200821;
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 = "";
	
	public static long pow(long a, long n, long mod) {
		//		a %= mod;
		long ret = 1;
		int x = 63 - Long.numberOfLeadingZeros(n);
		for (; x >= 0; x--) {
			ret = ret * ret % mod;
			if (n << 63 - x < 0)
				ret = ret * a % mod;
		}
		return ret;
	}
	
	public static long invl(long a, long mod) {
		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;
		}
		return p < 0 ? p + mod : p;
	}


	
	void solve()
	{
		int P = ni(), K = ni();
		int mod = 1000000007;
		out.println(((pow(10, P-1, mod) + mod - 1) * invl(P, mod) + (K == 0 ? 1 : 0)) % mod);
		
//		int p = 7;
//		int[] a = new int[p-1];
//		long[] f = new long[p];
//		do{
//			long s = 0;
//			for(int i = 0;i < p-1;i++){
//				s += (long)(i+1) * a[i];
//			}
//			f[(int)(s%p)]++;
//		}while(inc(a, 10));
//		tr(f);
	}
	
	public static boolean inc(int[] a, int base) {
		int n = a.length;
		int i;
		for (i = n - 1; i >= 0 && a[i] == base - 1; i--)
			;
		if (i == -1)
			return false;

		a[i]++;
		Arrays.fill(a, i + 1, n, 0);
		return true;
	}

	
	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)); }
}
0