메소드 | 설명 | |
---|---|---|
WheelFast ( int N ) : System | ||
solve ( string s ) : double |
메소드 | 설명 | |
---|---|---|
f ( int n ) : double | ||
numWays_ijk ( int i, int j, int k ) : System.Numerics.BigInteger |
How many ways to fill in interval [i,j] such that nothing spills over on the 2 sides [i,k) and right side (k, j] and k is filled in last (or first)
|