結果

問題 No.1272 珍しい級数
ユーザー shojin_proshojin_pro
提出日時 2020-10-30 21:50:34
言語 Java17
(openjdk 17.0.1)
結果
AC  
実行時間 56 ms / 2,000 ms
コード長 2,902 bytes
コンパイル時間 2,611 ms
使用メモリ 34,680 KB
最終ジャッジ日時 2023-02-21 12:11:55
合計ジャッジ時間 7,571 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 54 ms
34,524 KB
testcase_01 AC 55 ms
34,504 KB
testcase_02 AC 55 ms
34,620 KB
testcase_03 AC 54 ms
34,520 KB
testcase_04 AC 55 ms
34,676 KB
testcase_05 AC 55 ms
34,536 KB
testcase_06 AC 55 ms
34,556 KB
testcase_07 AC 54 ms
34,416 KB
testcase_08 AC 55 ms
34,556 KB
testcase_09 AC 54 ms
34,516 KB
testcase_10 AC 54 ms
34,588 KB
testcase_11 AC 56 ms
34,356 KB
testcase_12 AC 55 ms
34,604 KB
testcase_13 AC 55 ms
34,328 KB
testcase_14 AC 55 ms
34,648 KB
testcase_15 AC 55 ms
34,324 KB
testcase_16 AC 56 ms
34,568 KB
testcase_17 AC 56 ms
34,552 KB
testcase_18 AC 55 ms
34,516 KB
testcase_19 AC 55 ms
34,640 KB
testcase_20 AC 55 ms
34,364 KB
testcase_21 AC 55 ms
34,680 KB
testcase_22 AC 55 ms
34,368 KB
testcase_23 AC 55 ms
34,292 KB
testcase_24 AC 55 ms
34,316 KB
testcase_25 AC 55 ms
34,380 KB
testcase_26 AC 54 ms
34,532 KB
testcase_27 AC 55 ms
34,548 KB
testcase_28 AC 55 ms
34,364 KB
testcase_29 AC 55 ms
34,372 KB
testcase_30 AC 55 ms
34,564 KB
testcase_31 AC 55 ms
34,408 KB
testcase_32 AC 55 ms
34,412 KB
testcase_33 AC 55 ms
34,624 KB
testcase_34 AC 55 ms
34,368 KB
testcase_35 AC 55 ms
34,556 KB
testcase_36 AC 55 ms
34,480 KB
testcase_37 AC 55 ms
34,568 KB
testcase_38 AC 56 ms
34,408 KB
testcase_39 AC 55 ms
34,456 KB
testcase_40 AC 55 ms
34,396 KB
testcase_41 AC 54 ms
34,332 KB
testcase_42 AC 55 ms
34,344 KB
testcase_43 AC 55 ms
34,436 KB
testcase_44 AC 55 ms
34,524 KB
testcase_45 AC 55 ms
34,444 KB
testcase_46 AC 55 ms
34,508 KB
testcase_47 AC 53 ms
34,360 KB
testcase_48 AC 55 ms
34,548 KB
testcase_49 AC 56 ms
34,304 KB
testcase_50 AC 55 ms
34,492 KB
testcase_51 AC 55 ms
34,512 KB
testcase_52 AC 55 ms
34,628 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;
 
public class Main {
    public static void main(String[] args) throws Exception {
        FastScanner sc = new FastScanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        double mod = Math.PI*2;
        long k = sc.nextLong();
        double now = 0d;
        for(long i = 1; i <= 14; i++){
            now += Math.sin((i*k))/(double)rep2(i,i);
        }
        pw.println(now);
        pw.flush();
    }
        
    private static long rep2(long b, long n){
        if(n == 0) return 1;
        if(n == 1) return b;
        long bn = rep2(b,n/2);
        if(n % 2 == 0){
            return bn*bn;
        }else{
            return bn*bn*b;
        }
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }
 
        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }
 
    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;
    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

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

    public double nextDouble() {
         return Double.parseDouble(next());
    }
    
    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        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 long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    } 
}
0