結果

問題 No.1161 Many Powers
ユーザー neko_the_shadow
提出日時 2020-08-28 13:17:49
言語 Java
(openjdk 23)
結果
AC  
実行時間 165 ms / 2,000 ms
コード長 5,465 bytes
コンパイル時間 2,675 ms
コンパイル使用メモリ 85,212 KB
実行使用メモリ 38,736 KB
最終ジャッジ日時 2024-11-09 01:11:33
合計ジャッジ時間 6,280 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff # 

package _1161;

import java.io.BufferedReader;
import java.io.EOFException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.UncheckedIOException;
import java.lang.reflect.Array;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.Objects;
import java.util.regex.Pattern;
import java.util.stream.Collectors;

public class Main {
    public void exec() {
        long a = stdin.nextLong();
        long b = stdin.nextLong();
        long c = stdin.nextLong();

        long ans = 0;
        for (int x = 1; x < c; x++) {
            ans += f(a-x+1, c) * MathUtils.modPow(x, b, c);
            ans %= c;
        }
        stdout.println(ans);
     }

    private long f(long x, long y) {
        if (x < 0) {
            return 0;
        }
        if (x % y == 0) {
            return x / y;
        } else {
            return x / y + 1;
        }
    }

    public static class MathUtils {
        private MathUtils() {}

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

        public static long modInv(long x, long mod) {
            return modPow(x, mod - 2, mod);
        }

        public static long pow(long x, long y) {
            long z = 1;
            while (y > 0) {
                if (y % 2 == 0) {
                    x = (x * x);
                    y /= 2;
                } else {
                    z = (z * x);
                    y--;
                }
            }
            return z;
        }
    }


    private static final Stdin stdin = new Stdin();
    private static final Stdout stdout = new Stdout();

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

    public static class Stdin {
        private BufferedReader stdin;
        private Deque<String> tokens;
        private Pattern delim;

        public Stdin() {
            stdin = new BufferedReader(new InputStreamReader(System.in));
            tokens = new ArrayDeque<>();
            delim = Pattern.compile(" ");
        }

        public String nextString() {
            try {
                if (tokens.isEmpty()) {
                    String line = stdin.readLine();
                    if (line == null) {
                        throw new UncheckedIOException(new EOFException());
                    }
                    delim.splitAsStream(line).forEach(tokens::addLast);
                }
                return tokens.pollFirst();
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
        }

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

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

        public long nextLong() {
            return Long.parseLong(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 static class Stdout {
        private PrintWriter stdout;

        public Stdout() {
            stdout =  new PrintWriter(System.out, false);
        }

        public void printf(String format, Object ... args) {
            String line = String.format(format, args);
            if (line.endsWith(System.lineSeparator())) {
                stdout.print(line);
            } else {
                stdout.println(line);
            }
        }

        public void println(Object ... objs) {
            String line = Arrays.stream(objs).map(Objects::toString).collect(Collectors.joining(" "));
            stdout.println(line);
        }

        public void debug(Object ... objs) {
            String line = Arrays.stream(objs).map(this::deepToString).collect(Collectors.joining(" "));
            stdout.printf("DEBUG: %s%n", line);
        }

        private String deepToString(Object o) {
            if (o == null) {
                return "null";
            }

            // 配列の場合
            if (o.getClass().isArray()) {
                int len = Array.getLength(o);
                String[] tokens = new String[len];
                for (int i = 0; i < len; i++) {
                    tokens[i] = deepToString(Array.get(o, i));
                }
                return "{" + String.join(",", tokens) + "}";
            }

            return Objects.toString(o);
        }

        private void flush() {
            stdout.flush();
        }
    }
}
0