結果

問題 No.673 カブトムシ
ユーザー threepipes_sthreepipes_s
提出日時 2018-04-13 23:06:29
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 2,989 bytes
コンパイル時間 3,633 ms
コンパイル使用メモリ 75,756 KB
実行使用メモリ 51,868 KB
最終ジャッジ日時 2023-09-09 04:46:55
合計ジャッジ時間 4,348 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 AC 44 ms
49,552 KB
testcase_03 AC 44 ms
49,420 KB
testcase_04 AC 44 ms
50,124 KB
testcase_05 AC 45 ms
49,556 KB
testcase_06 AC 43 ms
49,196 KB
testcase_07 AC 43 ms
49,340 KB
testcase_08 AC 45 ms
49,692 KB
testcase_09 WA -
testcase_10 AC 45 ms
50,112 KB
testcase_11 AC 45 ms
49,984 KB
testcase_12 AC 44 ms
49,792 KB
testcase_13 AC 45 ms
49,916 KB
testcase_14 AC 44 ms
49,672 KB
testcase_15 AC 45 ms
50,100 KB
testcase_16 AC 45 ms
50,116 KB
testcase_17 AC 44 ms
49,688 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.BigInteger;
import java.util.Arrays;

public class Main implements Runnable {
    static ContestScanner in;
    static Writer out;
    public static void main(String[] args) {
        new Thread(null, new Main(), "", 16 * 1024 * 1024).start();
    }

    public void run() {
        Main main = new Main();
        try {
            in = new ContestScanner();
            out = new Writer();
            main.solve();
            out.close();
            in.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    void solve() throws IOException {
        final long mod = 1000000007;
        long b = in.nextLong();
        long c = in.nextLong();
        long d = in.nextLong();
        if (c == 1) {
            System.out.println(b % mod * d % mod);
            return;
        }

        BigInteger biC = BigInteger.valueOf(c);
        BigInteger biD = BigInteger.valueOf(d);
        BigInteger mp = biC.modPow(biD, BigInteger.valueOf(mod));
        b %= mod;
        c %= mod;
        d %= mod;
        long ans = b * ((mp.longValue() - 1 + mod) % mod) % mod * modinv((c - 1 + mod) % mod, mod) % mod;
        System.out.println(ans * c % mod);

//        long a = b *
    }

    long modpow(long n, long a, long mod){
        long res = 1;
        while(a > 0){
            if((a&1)==1) res = (res * n) % mod;
            n = n * n % mod;
            a >>= 1;
        }
        return res;
    }

    long modinv(long n, long mod){
        return modpow(n, mod-2, mod);
    }
}

class Writer extends PrintWriter{
    public Writer(String filename)throws IOException
    {super(new BufferedWriter(new FileWriter(filename)));}
    public Writer()throws IOException {super(System.out);}
}
class ContestScanner implements Closeable {
    private BufferedReader in;private int c=-2;
    public ContestScanner()throws IOException
    {in=new BufferedReader(new InputStreamReader(System.in));}
    public ContestScanner(String filename)throws IOException
    {in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
    public String nextToken()throws IOException {
        StringBuilder sb=new StringBuilder();
        while((c=in.read())!=-1&&Character.isWhitespace(c));
        while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}
        return sb.toString();
    }
    public String readLine()throws IOException{
        StringBuilder sb=new StringBuilder();if(c==-2)c=in.read();
        while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();}
        return sb.toString();
    }
    public long nextLong()throws IOException,NumberFormatException
    {return Long.parseLong(nextToken());}
    public int nextInt()throws NumberFormatException,IOException
    {return(int)nextLong();}
    public double nextDouble()throws NumberFormatException,IOException
    {return Double.parseDouble(nextToken());}
    public void close() throws IOException {in.close();}
}
0