#645375 (Java21) No.1448 和差算

• 問題: No.1448 和差算
• ユーザー: neko_the_shadow
• 提出日時: 2021-04-08 13:00:12
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 59 ms / 2,000 ms
• コード長: 5,197 bytes
• コンパイル時間: 4,434 ms
• コンパイル使用メモリ: 99,220 KB
• 実行使用メモリ: 35,464 KB
• 最終ジャッジ日時: 2023-09-05 21:26:49
• 合計ジャッジ時間: 8,600 ms
• ジャッジサーバーID （参考情報）: judge15 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	54 ms; 34,980 KB
testcase_01	AC	54 ms; 34,884 KB
testcase_02	AC	54 ms; 35,144 KB
testcase_03	AC	54 ms; 35,216 KB
testcase_04	AC	53 ms; 35,080 KB
testcase_05	AC	54 ms; 34,992 KB
testcase_06	AC	53 ms; 34,892 KB
testcase_07	AC	54 ms; 35,004 KB
testcase_08	AC	59 ms; 35,464 KB
testcase_09	AC	55 ms; 35,120 KB
testcase_10	AC	53 ms; 35,156 KB
testcase_11	AC	54 ms; 35,012 KB
testcase_12	AC	54 ms; 35,004 KB
testcase_13	AC	54 ms; 35,240 KB
testcase_14	AC	53 ms; 35,200 KB
testcase_15	AC	54 ms; 35,060 KB
testcase_16	AC	52 ms; 35,016 KB
testcase_17	AC	53 ms; 35,136 KB
testcase_18	AC	53 ms; 35,056 KB
testcase_19	AC	53 ms; 35,160 KB
testcase_20	AC	53 ms; 35,252 KB
testcase_21	AC	53 ms; 35,276 KB
testcase_22	AC	53 ms; 35,304 KB
testcase_23	AC	54 ms; 35,084 KB
testcase_24	AC	57 ms; 35,112 KB
testcase_25	AC	54 ms; 35,372 KB
testcase_26	AC	52 ms; 35,004 KB
testcase_27	AC	53 ms; 35,240 KB
testcase_28	AC	54 ms; 35,100 KB
testcase_29	AC	53 ms; 35,352 KB
testcase_30	AC	53 ms; 35,240 KB
testcase_31	AC	53 ms; 34,908 KB
testcase_32	AC	53 ms; 35,284 KB
testcase_33	AC	54 ms; 35,064 KB
testcase_34	AC	53 ms; 34,968 KB
testcase_35	AC	53 ms; 35,132 KB
testcase_36	AC	52 ms; 35,024 KB
testcase_37	AC	51 ms; 35,016 KB
testcase_38	AC	52 ms; 35,092 KB

ソースコード

import java.io.BufferedReader;
import java.io.EOFException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.UncheckedIOException;
import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Deque;
import java.util.List;
import java.util.function.Supplier;
import java.util.regex.Pattern;

public class Main {
    public void exec() {
        long a = stdin.nextLong();
        long b = stdin.nextLong();
        long c = stdin.nextLong();
        long d = stdin.nextLong();
        long n = stdin.nextLong();
        
        long ans = Long.MIN_VALUE;
        for (long p : new long[] {a, b}) {
            for (long q : new long[] {c, d}) {
                long x = p;
                long y = q;
                for (int i = 0; i < n%8; i++) {
                    long nx = x-y;
                    long ny = x+y;
                    x = nx;
                    y = ny;
                }
                ans = Math.max(ans, x+y);
            }
        }
        
        long mod = 1000000007;
        stdout.println((ans%mod+mod)%mod*modPow(16, n/8, mod)%mod);
    }
    
    public long modPow(long x, long y, long mod) {
        return BigInteger.valueOf(x).modPow(BigInteger.valueOf(y), BigInteger.valueOf(mod)).longValue();
    }

    private static final Stdin stdin = new Stdin(System.in);
    private static final Stdout stdout = new Stdout(System.out);

    public static void main(String[] args) {
        try {
            new Main().exec();
        } finally {
            stdout.flush();
        }
    }

    public static class Stdin {
        private Deque<String> queue;
        private BufferedReader in;
        private Pattern space;

        public Stdin(InputStream in) {
            this.queue = new ArrayDeque<>();
            this.in = new BufferedReader(new InputStreamReader(in));
            this.space = Pattern.compile(" ");
        }

        public String nextString() {
            if (queue.isEmpty()) {
                try {
                    String line = in.readLine();
                    if (line == null) {
                        throw new EOFException();
                    }
                    space.splitAsStream(line).forEach(this.queue::addLast);
                } catch (IOException e) {
                    throw new UncheckedIOException(e);
                }
            }
            return queue.removeFirst();
        }

        public int nextInt() {
            return Integer.parseInt(nextString());
        }

        public double nextDouble() {
            return Double.parseDouble(nextString());
        }

        public long nextLong() {
            return Long.parseLong(nextString());
        }
        
        public BigInteger nextBigInteger() {
            return new BigInteger(nextString());
        }

        public String[] nextStringArray(int n) {
            String[] a = new String[n];
            for (int i = 0; i < n; i++) a[i] = nextString();
            return a;
        }

        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 BigInteger[] nexBigIntegerArray(int n) {
            BigInteger[] a = new BigInteger[n];
            for (int i = 0; i < n; i++) a[i] = nextBigInteger();
            return a;
        }
        
        public List<Integer> nextIntegerList(int n) {
            return nextList(n, this::nextInt);
        }
        
        public List<Long> nextLongList(int n) {
            return nextList(n, this::nextLong);
        }
        
        public List<Double> nextDoubleList(int n) {
            return nextList(n, this::nextDouble);
        }
        
        public List<String> nextStringList(int n) {
            return nextList(n, this::nextString);
        }
        
        public List<BigInteger> nextBigIntegerList(int n) {
            return nextList(n, this::nextBigInteger);
        }
        
        private <T> List<T> nextList(int n, Supplier<T> supplier) {
            List<T> a = new ArrayList<>();
            for (int i = 0; i < n; i++) a.add(supplier.get());
            return a;
        }
    }

    public static class Stdout {
        private PrintWriter stdout;

        public Stdout(PrintStream stdout) {
            this.stdout =  new PrintWriter(stdout, false);
        }

        public void println(Object ... objs) {
            for (int i = 0, len = objs.length; i < len; i++) {
                stdout.print(objs[i]);
                if (i != len-1) stdout.print(' ');
            }
            stdout.println();
        }

        public void flush() {
            stdout.flush();
        }
    }
}