結果

問題 No.1578 A × B × C
ユーザー cyclerecycle9cyclerecycle9
提出日時 2021-07-26 19:08:29
言語 Java21
(openjdk 21)
結果
AC  
実行時間 55 ms / 2,000 ms
コード長 3,629 bytes
コンパイル時間 2,347 ms
コンパイル使用メモリ 78,320 KB
実行使用メモリ 37,060 KB
最終ジャッジ日時 2024-07-22 10:09:58
合計ジャッジ時間 4,760 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
36,768 KB
testcase_01 AC 51 ms
36,860 KB
testcase_02 AC 55 ms
36,780 KB
testcase_03 AC 54 ms
36,988 KB
testcase_04 AC 52 ms
36,860 KB
testcase_05 AC 52 ms
36,680 KB
testcase_06 AC 53 ms
36,544 KB
testcase_07 AC 53 ms
36,728 KB
testcase_08 AC 53 ms
36,808 KB
testcase_09 AC 52 ms
36,704 KB
testcase_10 AC 53 ms
36,988 KB
testcase_11 AC 52 ms
36,848 KB
testcase_12 AC 54 ms
36,936 KB
testcase_13 AC 52 ms
36,504 KB
testcase_14 AC 53 ms
36,872 KB
testcase_15 AC 52 ms
37,060 KB
testcase_16 AC 53 ms
36,732 KB
testcase_17 AC 53 ms
36,932 KB
testcase_18 AC 53 ms
36,556 KB
testcase_19 AC 52 ms
36,768 KB
testcase_20 AC 52 ms
36,956 KB
testcase_21 AC 53 ms
36,896 KB
testcase_22 AC 53 ms
36,884 KB
testcase_23 AC 53 ms
36,808 KB
testcase_24 AC 52 ms
36,860 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.RoundingMode;
import java.util.*;


public class Main {
	static final long MOD=1000000007;
	static final long MOD1=998244353;
	static int ans=0;
	public static void main(String[] args){
		PrintWriter out = new PrintWriter(System.out);
		InputReader sc=new InputReader(System.in);
		long A =sc.nextLong();
		long B = sc.nextLong();
		long C = sc.nextLong();
		long K = sc.nextLong();
		long X = (((A*B)%MOD)*C)%MOD;
		long pow = modPow(2l, K,MOD-1);
		System.out.println(modPow(X, pow, MOD));
  	}
	static long modPow(long x, long y,long MOD) {
        long z = 1;
        while (y > 0) {
            if (y % 2 == 0) {
                x = (x * x) % MOD;
                y /= 2;
            } else {
                z = (z * x) % MOD;
                y--;
            }
        }
        return z;
    }//xのy乗mod
	static class InputReader { 
		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;
		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}
		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}
 
		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}
 
		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}
 
		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}
 
		public boolean hasNext() {
			skip();
			return hasNextByte();
		}
 
		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}
 
		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		public double nextDouble() {
			return Double.parseDouble(next());
		}
 
		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}
		public double[] nextDoubleArray(int n) {
			double[] a = new double[n];
			for (int i = 0; i < n; i++)
				a[i] = nextDouble();
			return a;
		}
		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}
 
		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}
}
0