結果

問題 No.1180 無限和
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-08-21 22:26:32
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 2 ms / 1,000 ms
コード長 3,742 bytes
コンパイル時間 825 ms
コンパイル使用メモリ 119,592 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-22 08:08:24
合計ジャッジ時間 1,845 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 1 ms
6,944 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 1 ms
6,940 KB
testcase_06 AC 1 ms
6,940 KB
testcase_07 AC 1 ms
6,940 KB
testcase_08 AC 2 ms
6,944 KB
testcase_09 AC 1 ms
6,940 KB
testcase_10 AC 1 ms
6,940 KB
testcase_11 AC 1 ms
6,940 KB
testcase_12 AC 1 ms
6,940 KB
testcase_13 AC 1 ms
6,940 KB
testcase_14 AC 1 ms
6,940 KB
testcase_15 AC 1 ms
6,944 KB
testcase_16 AC 1 ms
6,944 KB
testcase_17 AC 1 ms
6,940 KB
testcase_18 AC 1 ms
6,944 KB
testcase_19 AC 1 ms
6,940 KB
testcase_20 AC 1 ms
6,944 KB
testcase_21 AC 1 ms
6,940 KB
testcase_22 AC 1 ms
6,944 KB
testcase_23 AC 1 ms
6,940 KB
testcase_24 AC 1 ms
6,940 KB
testcase_25 AC 1 ms
6,940 KB
testcase_26 AC 1 ms
6,940 KB
testcase_27 AC 2 ms
6,940 KB
testcase_28 AC 1 ms
6,944 KB
testcase_29 AC 1 ms
6,944 KB
testcase_30 AC 1 ms
6,940 KB
testcase_31 AC 1 ms
6,940 KB
testcase_32 AC 1 ms
6,940 KB
testcase_33 AC 1 ms
6,940 KB
testcase_34 AC 1 ms
6,944 KB
testcase_35 AC 1 ms
6,944 KB
testcase_36 AC 1 ms
6,944 KB
testcase_37 AC 1 ms
6,940 KB
testcase_38 AC 2 ms
6,940 KB
testcase_39 AC 1 ms
6,944 KB
testcase_40 AC 1 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  /*
  debug {
    enum lim = 200L;
    real sum2 = 0.0L;
    foreach (a0; 1 .. lim) foreach (a1; 1 .. lim) {
      sum2 += 1.0L / (1.0L * a0^^4 * a1^^2 * (1.0L / a0^^2 + 1.0L / a1^^2));
    }
    writefln("%.12f", sum2);
    writefln("%.12f", PI^^4 / sum2);
    real sum3 = 0.0L;
    foreach (a0; 1 .. lim) foreach (a1; 1 .. lim) foreach (a2; 1 .. lim) {
      sum3 += 1.0L / (1.0L * a0^^4 * a1^^2 * a2^^2 * (1.0L / a0^^2 + 1.0L / a1^^2 + 1.0L / a2^^2));
    }
    writefln("%.12f", sum3);
    writefln("%.12f", PI^^6 / sum3);
    real sum4 = 0.0L;
    foreach (a0; 1 .. lim) foreach (a1; 1 .. lim) foreach (a2; 1 .. lim) foreach (a3; 1 .. lim) {
      sum4 += 1.0L / (1.0L * a0^^4 * a1^^2 * a2^^2 * a3^^2 * (1.0L / a0^^2 + 1.0L / a1^^2 + 1.0L / a2^^2 + 1.0L / a3^^2));
    }
    writefln("%.12f", sum4);
    writefln("%.12f", PI^^8 / sum4);
  }
  */
/*
1.344671338542
72.440817500887
1.470103666923
653.960135741817
1.808141008697
5247.672040196820
*/
  
  // Table[Floor[\[Pi]^(2 n)/(n 6^n)], {n, 1, 100}]
  enum ANS = ["",
"1", "1", "1", "1", "2", "3", "4", "6", "9", "14", "21", "32", "49", "75", "116", "179", "278", "431", 
"673", "1051", "1647", "2587", "4070", "6417", "10133", "16028", "25389", "40271", "63959", 
"101702", "161898", "257989", "411515", "657006", "1049854", "1678971", "2687154", 
"4303870", "6898055", "11063175", "17754336", "28509362", "45805415", "73634459", 
"118432190", "190578076", "306818404", "494181545", "796306343", "1283674002", 
"2070155978", "3339784129", "5390069507", "8702118048", "14054148424", 
"22705323460", "36693518654", "59317756473", "95920005199", "155152382840", 
"251031580412", "406270230758", "657680000970", "1064936484951", 
"1724800298462", "2794195151731", "4527665797572", "7338186541470", 
"11895893421807", "19288418054482", "31281300235774", "50741014240728", 
"82322258213594", "133584758792777", "216808278942609", "351942753954701", 
"571404149903843", "927871868113804", "1506967943688343", "2447877121868410", 
"3976885401698505", "6461937273824712", "10501394967266883", 
"17068458255715742", "27746176824540109", "45109926466230994", 
"73349948420341083", "119284739992745445", "194010863565051731", 
"315589133496610311", "513418664982547624", "835360071579164719", 
"1359336839397111487", "2212232034217954977", "3600670828049033237", 
"5861169586600254074", "9541843323289231218", "15535542906853621246", 
"25296813029269219968", "41195473639189670375"
  ];
  
  try {
    for (; ; ) {
      const N = readInt();
      writeln(ANS[N]);
    }
  } catch (EOFException e) {
  }
}
0