結果

問題 No.1273 はじめのζ関数
ユーザー ywmtywmt
提出日時 2020-10-30 21:47:31
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 4,317 bytes
コンパイル時間 2,368 ms
コンパイル使用メモリ 74,448 KB
実行使用メモリ 50,020 KB
最終ジャッジ日時 2023-09-29 05:48:16
合計ジャッジ時間 66,033 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,647 ms
49,528 KB
testcase_01 AC 1,646 ms
49,600 KB
testcase_02 AC 1,919 ms
49,624 KB
testcase_03 AC 1,479 ms
49,660 KB
testcase_04 AC 1,644 ms
49,484 KB
testcase_05 AC 1,646 ms
49,588 KB
testcase_06 AC 1,479 ms
49,756 KB
testcase_07 AC 1,646 ms
49,964 KB
testcase_08 AC 1,476 ms
49,608 KB
testcase_09 TLE -
testcase_10 AC 1,477 ms
49,968 KB
testcase_11 AC 1,644 ms
49,548 KB
testcase_12 AC 1,643 ms
49,572 KB
testcase_13 AC 1,488 ms
49,588 KB
testcase_14 AC 1,646 ms
49,720 KB
testcase_15 AC 1,919 ms
49,596 KB
testcase_16 AC 1,923 ms
49,652 KB
testcase_17 AC 1,646 ms
49,588 KB
testcase_18 AC 1,917 ms
49,412 KB
testcase_19 AC 1,916 ms
49,584 KB
testcase_20 WA -
testcase_21 AC 1,146 ms
49,628 KB
testcase_22 AC 1,476 ms
49,480 KB
testcase_23 AC 1,479 ms
50,020 KB
testcase_24 AC 1,477 ms
49,368 KB
testcase_25 AC 1,478 ms
49,480 KB
testcase_26 AC 1,147 ms
48,048 KB
testcase_27 AC 1,149 ms
49,412 KB
testcase_28 AC 1,148 ms
49,588 KB
testcase_29 AC 1,148 ms
49,532 KB
testcase_30 AC 1,145 ms
49,620 KB
testcase_31 AC 1,476 ms
49,412 KB
testcase_32 AC 1,149 ms
49,568 KB
testcase_33 AC 1,480 ms
49,612 KB
testcase_34 AC 1,147 ms
49,688 KB
testcase_35 AC 1,482 ms
49,704 KB
testcase_36 AC 1,148 ms
49,568 KB
testcase_37 AC 1,146 ms
49,584 KB
testcase_38 AC 1,146 ms
49,636 KB
testcase_39 AC 1,143 ms
49,320 KB
testcase_40 AC 547 ms
49,660 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();
        double res = 0.0;
        for (int i = 2; i <= 30000000; 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