結果

問題 No.403 2^2^2
ユーザー yuya178yuya178
提出日時 2017-11-08 19:31:05
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,103 bytes
コンパイル時間 2,397 ms
コンパイル使用メモリ 80,504 KB
実行使用メモリ 39,700 KB
最終ジャッジ日時 2024-11-24 06:01:20
合計ジャッジ時間 5,127 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 70 ms
38,292 KB
testcase_01 AC 86 ms
38,656 KB
testcase_02 AC 70 ms
37,772 KB
testcase_03 AC 73 ms
38,540 KB
testcase_04 AC 71 ms
37,980 KB
testcase_05 AC 78 ms
38,016 KB
testcase_06 AC 70 ms
38,316 KB
testcase_07 AC 71 ms
37,940 KB
testcase_08 AC 71 ms
38,324 KB
testcase_09 AC 79 ms
38,128 KB
testcase_10 AC 75 ms
38,016 KB
testcase_11 AC 71 ms
38,600 KB
testcase_12 AC 79 ms
38,144 KB
testcase_13 AC 75 ms
38,184 KB
testcase_14 AC 69 ms
38,340 KB
testcase_15 AC 71 ms
38,528 KB
testcase_16 AC 83 ms
37,684 KB
testcase_17 AC 71 ms
38,236 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 72 ms
38,880 KB
testcase_23 AC 70 ms
37,996 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 81 ms
38,196 KB
testcase_27 AC 69 ms
37,792 KB
testcase_28 WA -
testcase_29 AC 68 ms
39,464 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    long MOD = 1000000007;
    long inf = Long.MAX_VALUE;

    void solve()
    {
        long a = nl();
        long b = nl();
        long c = nl();
        // out.println(a);
        long l1 = pow(a%MOD,b,MOD);
        long l2 = pow(l1,c,MOD);
        long r1 = pow(b%(MOD-1),c,MOD-1)+MOD-1;
        long r2 = pow(a,r1,MOD);
        out.print(l2+" "+r2);


    }

    public long pow(long a, long n, long MOD) {
        long ret = 1;
        for (; n > 0; n >>= 1, a = a * a % MOD) {
            if (n % 2 == 1)
                ret = ret * a % MOD;
        }
        return ret;
    }
 
    
    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");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private 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) && 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 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[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, 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 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)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}
0