結果

問題 No.1281 Cigarette Distribution
ユーザー ywmtywmt
提出日時 2020-11-06 22:00:12
言語 Java21
(openjdk 21)
結果
AC  
実行時間 305 ms / 2,000 ms
コード長 6,806 bytes
コンパイル時間 2,589 ms
コンパイル使用メモリ 75,104 KB
実行使用メモリ 55,912 KB
最終ジャッジ日時 2023-09-29 18:43:37
合計ジャッジ時間 6,625 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 38 ms
49,404 KB
testcase_01 AC 37 ms
49,368 KB
testcase_02 AC 37 ms
49,248 KB
testcase_03 AC 36 ms
49,184 KB
testcase_04 AC 37 ms
49,264 KB
testcase_05 AC 37 ms
49,192 KB
testcase_06 AC 38 ms
49,304 KB
testcase_07 AC 38 ms
49,060 KB
testcase_08 AC 39 ms
49,100 KB
testcase_09 AC 39 ms
49,304 KB
testcase_10 AC 38 ms
49,148 KB
testcase_11 AC 37 ms
49,256 KB
testcase_12 AC 172 ms
55,072 KB
testcase_13 AC 252 ms
55,600 KB
testcase_14 AC 242 ms
55,832 KB
testcase_15 AC 176 ms
55,300 KB
testcase_16 AC 209 ms
55,780 KB
testcase_17 AC 51 ms
49,588 KB
testcase_18 AC 303 ms
55,912 KB
testcase_19 AC 305 ms
55,556 KB
testcase_20 AC 296 ms
55,780 KB
testcase_21 AC 270 ms
55,468 KB
testcase_22 AC 276 ms
55,352 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() {
        int n = ir.nextInt();
        int m = ir.nextInt();
        for (int i = 1; i <= m; i++) {
            if (2 * i - 1 > n) {
                out.println(0);
            } else if (i == 1) {
                out.println(n);
            } else {
                int t = n - (2 * i - 1);
                int p = t / i;
                int q = t % i;
                long a = q, b = i - 1 - a;
                out.println(mul(mul(modpow(p + 3, a), modpow(p + 2, b)), p + 1));
            }
        }
    }

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

    static long add(long a, long b) {
        return (a + b) % mod;
    }

    static long sub(long a, long b) {
        long d = a - b;
        while (d < 0)
            d += mod;
        return d;
    }

    static long mul(long a, long b) {
        return a * b % mod;
    }

    static long div(long a, long b) {
        return a * mod_inverse(b) % mod;
    }

    public static long[] fact(int n) {
        long[] ret = new long[n + 1];
        ret[0] = 1 % mod;
        for (int i = 1; i <= n; i++) {
            ret[i] = mul(ret[i - 1], i);
        }
        return ret;
    }

    private static long[] factInv(int n) {
        long[] ret = new long[n + 1];
        ret[0] = 1;
        for (int i = 1; i <= n; i++) {
            ret[i] = div(ret[i - 1], i);
        }
        return ret;
    }

    public static long comb(int n, int m, long[] fact, long[] factInv) {
        long ret = fact[n];
        ret = mul(ret, factInv[m]);
        ret = mul(ret, factInv[n - m]);
        return ret;
    }

    public static long[][] stirling(int n) {
        long[][] ret = new long[n + 1][n + 1];
        ret[0][0] = 1;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= i; j++)
                ret[i][j] = add(ret[i - 1][j - 1], mul(ret[i - 1][j], j));
        return ret;
    }

    public static long mod_inverse(long a) {
        long[] ret = extgcd(a, mod);
        return add(mod, ret[0] % mod);
    }

    private static long[] extgcd(long a, long b) {
        long[] ret = new long[3];
        ret[2] = _extgcd(a, b, ret);
        return ret;
    }

    private static long _extgcd(long a, long b, long[] x) {
        long g = a;
        x[0] = 1;
        x[1] = 0;
        if (b != 0) {
            g = _extgcd(b, a % b, x);
            long temp = x[0];
            x[0] = x[1];
            x[1] = temp;
            x[1] -= (a / b) * x[0];
        }
        return g;
    }

    static long modpow(long a, long n) {
        long res = 1;
        while (n > 0) {
            if ((n & 1) != 0)
                res = res * a % mod;
            a = a * a % mod;
            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