結果

問題 No.313 π
ユーザー uwiuwi
提出日時 2015-12-06 00:07:32
言語 Java21
(openjdk 21)
結果
AC  
実行時間 150 ms / 5,000 ms
コード長 3,376 bytes
コンパイル時間 4,048 ms
コンパイル使用メモリ 83,228 KB
実行使用メモリ 41,708 KB
最終ジャッジ日時 2024-09-14 14:34:18
合計ジャッジ時間 9,972 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 143 ms
41,476 KB
testcase_01 AC 144 ms
41,300 KB
testcase_02 AC 143 ms
41,288 KB
testcase_03 AC 143 ms
41,092 KB
testcase_04 AC 144 ms
41,108 KB
testcase_05 AC 145 ms
41,352 KB
testcase_06 AC 145 ms
41,312 KB
testcase_07 AC 144 ms
41,208 KB
testcase_08 AC 143 ms
41,212 KB
testcase_09 AC 149 ms
41,308 KB
testcase_10 AC 141 ms
41,332 KB
testcase_11 AC 141 ms
40,748 KB
testcase_12 AC 143 ms
41,316 KB
testcase_13 AC 147 ms
41,208 KB
testcase_14 AC 147 ms
41,308 KB
testcase_15 AC 144 ms
41,336 KB
testcase_16 AC 143 ms
41,216 KB
testcase_17 AC 143 ms
41,240 KB
testcase_18 AC 142 ms
41,304 KB
testcase_19 AC 143 ms
41,312 KB
testcase_20 AC 143 ms
41,300 KB
testcase_21 AC 143 ms
41,300 KB
testcase_22 AC 144 ms
41,076 KB
testcase_23 AC 142 ms
41,324 KB
testcase_24 AC 145 ms
41,056 KB
testcase_25 AC 145 ms
41,080 KB
testcase_26 AC 145 ms
41,288 KB
testcase_27 AC 144 ms
41,456 KB
testcase_28 AC 145 ms
41,700 KB
testcase_29 AC 150 ms
41,708 KB
testcase_30 AC 142 ms
41,320 KB
testcase_31 AC 148 ms
41,432 KB
testcase_32 AC 147 ms
41,420 KB
testcase_33 AC 144 ms
41,452 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 CopyOfQ686 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		char[] s = ns().toCharArray();
		int mod = 1000000007;
		long mul = 1;
		for(char c : s){
			mul = mul * c % mod;
		}
		long co = 788899033L;
		for(int w = '0';w <= '9';w++){
			for(int u = '0';u <= '9';u++){
				if(invl(w, mod) * mul % mod == invl(u, mod) * co % mod){
					out.println((w-'0') + " " + (u-'0'));
					return;
				}
			}
		}
	}
	
	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 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");
	}
	
	public static void main(String[] args) throws Exception { new CopyOfQ686().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 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[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, 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 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