結果

問題 No.1272 珍しい級数
ユーザー ywmtywmt
提出日時 2020-10-30 21:36:10
言語 Java17
(openjdk 17.0.1)
結果
AC  
実行時間 1,021 ms / 2,000 ms
コード長 4,377 bytes
コンパイル時間 1,846 ms
使用メモリ 49,508 KB
最終ジャッジ日時 2023-02-21 11:25:34
合計ジャッジ時間 56,933 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 54 ms
49,508 KB
testcase_01 AC 1,008 ms
48,648 KB
testcase_02 AC 1,014 ms
48,588 KB
testcase_03 AC 1,008 ms
48,712 KB
testcase_04 AC 1,012 ms
48,624 KB
testcase_05 AC 1,013 ms
48,612 KB
testcase_06 AC 1,019 ms
48,644 KB
testcase_07 AC 1,010 ms
48,568 KB
testcase_08 AC 1,016 ms
48,592 KB
testcase_09 AC 1,009 ms
48,556 KB
testcase_10 AC 1,020 ms
48,604 KB
testcase_11 AC 1,013 ms
48,616 KB
testcase_12 AC 1,016 ms
48,640 KB
testcase_13 AC 1,010 ms
48,688 KB
testcase_14 AC 1,020 ms
48,596 KB
testcase_15 AC 1,013 ms
48,620 KB
testcase_16 AC 1,015 ms
48,656 KB
testcase_17 AC 1,019 ms
48,708 KB
testcase_18 AC 1,010 ms
48,628 KB
testcase_19 AC 1,016 ms
48,652 KB
testcase_20 AC 1,017 ms
48,932 KB
testcase_21 AC 1,013 ms
48,656 KB
testcase_22 AC 1,015 ms
48,560 KB
testcase_23 AC 1,014 ms
48,656 KB
testcase_24 AC 1,012 ms
48,744 KB
testcase_25 AC 1,013 ms
48,584 KB
testcase_26 AC 1,011 ms
48,628 KB
testcase_27 AC 1,011 ms
46,688 KB
testcase_28 AC 1,016 ms
48,508 KB
testcase_29 AC 1,013 ms
48,588 KB
testcase_30 AC 1,016 ms
48,524 KB
testcase_31 AC 1,012 ms
48,740 KB
testcase_32 AC 1,015 ms
48,664 KB
testcase_33 AC 1,011 ms
48,648 KB
testcase_34 AC 1,013 ms
46,612 KB
testcase_35 AC 1,018 ms
48,568 KB
testcase_36 AC 1,019 ms
48,860 KB
testcase_37 AC 1,014 ms
48,752 KB
testcase_38 AC 1,021 ms
48,572 KB
testcase_39 AC 1,012 ms
48,584 KB
testcase_40 AC 1,011 ms
48,632 KB
testcase_41 AC 1,013 ms
48,564 KB
testcase_42 AC 1,014 ms
48,632 KB
testcase_43 AC 1,017 ms
48,444 KB
testcase_44 AC 1,015 ms
48,684 KB
testcase_45 AC 1,008 ms
48,720 KB
testcase_46 AC 1,018 ms
48,472 KB
testcase_47 AC 1,011 ms
48,720 KB
testcase_48 AC 1,015 ms
48,692 KB
testcase_49 AC 1,014 ms
48,580 KB
testcase_50 AC 1,015 ms
48,700 KB
testcase_51 AC 1,016 ms
48,712 KB
testcase_52 AC 1,015 ms
48,596 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 == 0) {
            out.println(0);
            return;
        }
        double res = 0.0;
        for (int i = 1; i <= 10000000; i++)
            res += Math.sin(k * i) / Math.pow(i, i);
        out.println(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