結果
問題 | No.1272 珍しい級数 |
ユーザー | shojin_pro |
提出日時 | 2020-10-30 21:50:34 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 50 ms / 2,000 ms |
コード長 | 2,902 bytes |
コンパイル時間 | 2,248 ms |
コンパイル使用メモリ | 74,724 KB |
実行使用メモリ | 50,104 KB |
最終ジャッジ日時 | 2023-09-29 05:53:06 |
合計ジャッジ時間 | 6,567 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
49,708 KB |
testcase_01 | AC | 47 ms
49,804 KB |
testcase_02 | AC | 47 ms
49,760 KB |
testcase_03 | AC | 45 ms
49,712 KB |
testcase_04 | AC | 46 ms
49,512 KB |
testcase_05 | AC | 46 ms
49,620 KB |
testcase_06 | AC | 46 ms
49,788 KB |
testcase_07 | AC | 49 ms
50,104 KB |
testcase_08 | AC | 48 ms
49,556 KB |
testcase_09 | AC | 46 ms
49,732 KB |
testcase_10 | AC | 46 ms
49,544 KB |
testcase_11 | AC | 46 ms
49,548 KB |
testcase_12 | AC | 46 ms
49,704 KB |
testcase_13 | AC | 47 ms
49,604 KB |
testcase_14 | AC | 46 ms
49,644 KB |
testcase_15 | AC | 50 ms
49,508 KB |
testcase_16 | AC | 45 ms
50,012 KB |
testcase_17 | AC | 46 ms
49,524 KB |
testcase_18 | AC | 46 ms
49,476 KB |
testcase_19 | AC | 45 ms
49,648 KB |
testcase_20 | AC | 46 ms
49,508 KB |
testcase_21 | AC | 46 ms
49,540 KB |
testcase_22 | AC | 46 ms
49,512 KB |
testcase_23 | AC | 47 ms
49,444 KB |
testcase_24 | AC | 46 ms
49,620 KB |
testcase_25 | AC | 46 ms
49,548 KB |
testcase_26 | AC | 46 ms
49,468 KB |
testcase_27 | AC | 46 ms
49,728 KB |
testcase_28 | AC | 46 ms
49,536 KB |
testcase_29 | AC | 46 ms
49,540 KB |
testcase_30 | AC | 46 ms
49,632 KB |
testcase_31 | AC | 46 ms
49,680 KB |
testcase_32 | AC | 46 ms
49,836 KB |
testcase_33 | AC | 45 ms
49,712 KB |
testcase_34 | AC | 46 ms
49,600 KB |
testcase_35 | AC | 47 ms
49,504 KB |
testcase_36 | AC | 46 ms
49,708 KB |
testcase_37 | AC | 45 ms
49,700 KB |
testcase_38 | AC | 46 ms
49,680 KB |
testcase_39 | AC | 46 ms
49,636 KB |
testcase_40 | AC | 45 ms
49,740 KB |
testcase_41 | AC | 46 ms
49,596 KB |
testcase_42 | AC | 47 ms
49,560 KB |
testcase_43 | AC | 46 ms
49,556 KB |
testcase_44 | AC | 45 ms
49,708 KB |
testcase_45 | AC | 45 ms
49,684 KB |
testcase_46 | AC | 46 ms
49,720 KB |
testcase_47 | AC | 45 ms
49,696 KB |
testcase_48 | AC | 46 ms
49,660 KB |
testcase_49 | AC | 46 ms
49,564 KB |
testcase_50 | AC | 46 ms
49,532 KB |
testcase_51 | AC | 46 ms
49,924 KB |
testcase_52 | AC | 46 ms
49,916 KB |
ソースコード
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; } }