結果

問題 No.1273 はじめのζ関数
ユーザー ywmtywmt
提出日時 2020-10-30 21:50:21
言語 Java21
(openjdk 21)
結果
AC  
実行時間 851 ms / 2,000 ms
コード長 4,403 bytes
コンパイル時間 2,551 ms
コンパイル使用メモリ 78,312 KB
実行使用メモリ 37,720 KB
最終ジャッジ日時 2024-07-22 00:15:07
合計ジャッジ時間 25,724 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 589 ms
37,176 KB
testcase_01 AC 590 ms
37,612 KB
testcase_02 AC 680 ms
37,416 KB
testcase_03 AC 534 ms
37,480 KB
testcase_04 AC 587 ms
37,288 KB
testcase_05 AC 593 ms
37,464 KB
testcase_06 AC 530 ms
37,584 KB
testcase_07 AC 587 ms
37,200 KB
testcase_08 AC 532 ms
37,364 KB
testcase_09 AC 851 ms
37,328 KB
testcase_10 AC 534 ms
37,200 KB
testcase_11 AC 584 ms
37,544 KB
testcase_12 AC 585 ms
37,480 KB
testcase_13 AC 533 ms
37,072 KB
testcase_14 AC 587 ms
37,692 KB
testcase_15 AC 680 ms
37,432 KB
testcase_16 AC 684 ms
37,544 KB
testcase_17 AC 587 ms
37,432 KB
testcase_18 AC 686 ms
37,572 KB
testcase_19 AC 681 ms
37,400 KB
testcase_20 AC 59 ms
36,820 KB
testcase_21 AC 424 ms
37,352 KB
testcase_22 AC 530 ms
37,472 KB
testcase_23 AC 531 ms
37,692 KB
testcase_24 AC 530 ms
37,692 KB
testcase_25 AC 531 ms
37,124 KB
testcase_26 AC 437 ms
37,544 KB
testcase_27 AC 437 ms
37,480 KB
testcase_28 AC 436 ms
37,196 KB
testcase_29 AC 423 ms
37,492 KB
testcase_30 AC 424 ms
37,432 KB
testcase_31 AC 532 ms
37,480 KB
testcase_32 AC 426 ms
37,400 KB
testcase_33 AC 539 ms
37,072 KB
testcase_34 AC 423 ms
37,668 KB
testcase_35 AC 532 ms
37,200 KB
testcase_36 AC 423 ms
37,720 KB
testcase_37 AC 425 ms
37,292 KB
testcase_38 AC 427 ms
37,468 KB
testcase_39 AC 426 ms
37,672 KB
testcase_40 AC 219 ms
37,592 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 k = ir.nextInt();
        if (k == 2) {
            out.println(1000000);
            return;
        }
        double res = 0.0;
        for (int i = 2; i <= 10000000; i++)
            res += 1.0 / (i - 1) / Math.pow(i, k - 1);
        out.println((int) (res * 1000000));
    }

    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