C# Class Round3_2013.Problem4.WheelFast

ファイルを表示 Open project: eric7237cire/CodeJam

Public Methods

Method Description
WheelFast ( int N ) : System
solve ( string s ) : double

Private Methods

Method Description
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)

Method Details

WheelFast() public method

public WheelFast ( int N ) : System
N int
return System

solve() public method

public solve ( string s ) : double
s string
return double