結果

問題 No.1275 綺麗な式
ユーザー ywmtywmt
提出日時 2020-10-30 22:15:02
言語 Java17
(openjdk 17.0.1)
結果
AC  
実行時間 56 ms / 2,000 ms
コード長 5,104 bytes
コンパイル時間 2,029 ms
使用メモリ 34,240 KB
最終ジャッジ日時 2023-02-21 13:16:03
合計ジャッジ時間 7,610 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 53 ms
34,144 KB
testcase_01 AC 53 ms
33,960 KB
testcase_02 AC 53 ms
34,132 KB
testcase_03 AC 53 ms
33,936 KB
testcase_04 AC 53 ms
34,112 KB
testcase_05 AC 53 ms
33,940 KB
testcase_06 AC 53 ms
33,876 KB
testcase_07 AC 53 ms
34,132 KB
testcase_08 AC 53 ms
33,968 KB
testcase_09 AC 53 ms
34,180 KB
testcase_10 AC 54 ms
33,940 KB
testcase_11 AC 53 ms
34,104 KB
testcase_12 AC 53 ms
34,084 KB
testcase_13 AC 53 ms
34,048 KB
testcase_14 AC 53 ms
34,108 KB
testcase_15 AC 54 ms
34,136 KB
testcase_16 AC 54 ms
34,068 KB
testcase_17 AC 53 ms
34,104 KB
testcase_18 AC 54 ms
34,128 KB
testcase_19 AC 54 ms
34,196 KB
testcase_20 AC 53 ms
34,088 KB
testcase_21 AC 53 ms
33,848 KB
testcase_22 AC 53 ms
33,880 KB
testcase_23 AC 55 ms
34,100 KB
testcase_24 AC 56 ms
34,120 KB
testcase_25 AC 54 ms
33,884 KB
testcase_26 AC 55 ms
33,868 KB
testcase_27 AC 55 ms
34,072 KB
testcase_28 AC 54 ms
33,896 KB
testcase_29 AC 55 ms
33,860 KB
testcase_30 AC 54 ms
34,184 KB
testcase_31 AC 55 ms
34,116 KB
testcase_32 AC 54 ms
34,096 KB
testcase_33 AC 52 ms
33,844 KB
testcase_34 AC 54 ms
34,136 KB
testcase_35 AC 52 ms
34,104 KB
testcase_36 AC 53 ms
33,916 KB
testcase_37 AC 53 ms
33,956 KB
testcase_38 AC 54 ms
34,092 KB
testcase_39 AC 54 ms
34,056 KB
testcase_40 AC 53 ms
34,176 KB
testcase_41 AC 55 ms
33,828 KB
testcase_42 AC 55 ms
34,152 KB
testcase_43 AC 54 ms
34,084 KB
testcase_44 AC 53 ms
34,140 KB
testcase_45 AC 53 ms
34,020 KB
testcase_46 AC 54 ms
33,928 KB
testcase_47 AC 54 ms
34,144 KB
testcase_48 AC 54 ms
34,148 KB
testcase_49 AC 54 ms
33,856 KB
testcase_50 AC 53 ms
34,100 KB
testcase_51 AC 53 ms
34,072 KB
testcase_52 AC 54 ms
34,180 KB
testcase_53 AC 53 ms
33,868 KB
testcase_54 AC 53 ms
33,864 KB
testcase_55 AC 54 ms
34,092 KB
testcase_56 AC 53 ms
34,120 KB
testcase_57 AC 54 ms
34,104 KB
testcase_58 AC 54 ms
34,132 KB
testcase_59 AC 53 ms
34,240 KB
testcase_60 AC 53 ms
34,164 KB
testcase_61 AC 54 ms
34,136 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {
    static PrintWriter out;
    static InputReader ir;

    static void solve() {
        long a = ir.nextLong();
        long b = ir.nextLong();
        long n = ir.nextLong();
        long[][] mat = new long[][] { { a, b }, { 1, a } };
        mat = modpow(mat, n);
        // tr(mat);
        out.println(mat[0][0] * 2 % mod);
    }

    static long mod = (long) 1e9 + 7;

    static long[][] mul(long[][] a, long[][] b) {
        long[][] res = new long[2][2];
        for (int i = 0; i < 2; i++) {
            for (int j = 0; j < 2; j++) {
                for (int k = 0; k < 2; k++) {
                    res[i][j] += a[i][k] * b[k][j];
                    res[i][j] %= mod;
                }
            }
        }
        return res;
    }

    static long[][] modpow(long[][] a, long n) {
        long[][] res = new long[2][2];
        for (int i = 0; i < 2; i++)
            res[i][i] = 1;
        while (n > 0) {
            if ((n & 1) != 0)
                res = mul(res, a);
            a = mul(a, a);
            n >>= 1;
        }
        return res;
    }

    public static void main(String[] args) {
        ir = new InputReader(System.in);
        out = new PrintWriter(System.out);
        solve();
        out.flush();
    }

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

    static void tr(Object... o) {
        System.err.println(Arrays.deepToString(o));
    }
}
0