結果

問題 No.1253 雀見椪
ユーザー uwiuwi
提出日時 2020-10-09 21:32:14
言語 Java21
(openjdk 21)
結果
AC  
実行時間 294 ms / 2,000 ms
コード長 4,044 bytes
コンパイル時間 4,117 ms
コンパイル使用メモリ 84,888 KB
実行使用メモリ 44,404 KB
最終ジャッジ日時 2024-07-20 08:58:54
合計ジャッジ時間 7,946 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
37,136 KB
testcase_01 AC 48 ms
36,904 KB
testcase_02 AC 47 ms
37,076 KB
testcase_03 AC 92 ms
38,424 KB
testcase_04 AC 285 ms
44,292 KB
testcase_05 AC 266 ms
44,024 KB
testcase_06 AC 294 ms
44,404 KB
testcase_07 AC 273 ms
44,108 KB
testcase_08 AC 282 ms
44,196 KB
testcase_09 AC 285 ms
44,188 KB
testcase_10 AC 283 ms
44,300 KB
testcase_11 AC 285 ms
44,360 KB
testcase_12 AC 285 ms
44,272 KB
testcase_13 AC 291 ms
44,100 KB
testcase_14 AC 45 ms
36,564 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest201009;
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 E {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		final int mod = 1000000007;
		for(int T = ni();T > 0;T--){
			long n = nl();
			long ag = nl(), bg = nl();
			long ac = nl(), bc = nl();
			long ap = nl(), bp = nl();

			long[] ps = new long[3];
			ps[0] = ag*invl(bg,mod)%mod;
			ps[1] = ac*invl(bc,mod)%mod;
			ps[2] = ap*invl(bp,mod)%mod;

			long ans = 1
			-pow(ps[0]+ps[1], n, mod)
			-pow(ps[1]+ps[2], n, mod)
			-pow(ps[2]+ps[0], n, mod)
					+pow(ps[0], n, mod)*2
					+pow(ps[1], n, mod)*2
					+pow(ps[2], n, mod)*2;
			ans %= mod;
			if(ans < 0)ans += mod;
			out.println(ans);
		}
	}

	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 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 E().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