C# 클래스 Round3_2013.Problem4.WheelLargeSlow

파일 보기 프로젝트 열기: eric7237cire/CodeJam 1 사용 예제들

공개 메소드들

메소드	설명
E ( int i, int j ) : System.Double
E ( int i, int j, int k ) : System.Double	The expected money we get while filling out the interval [i, j) so that the last filled gondola is at position (i+k). This means that the value for filling j is not counted
P ( int i, int j ) : System.Double	the probability that gondola j will stay empty as interval [i, j) fills up assuming only positions between [i, j] are chosen
P ( int i, int j, int k ) : System.Double	The probability that gondola j stays empty while we fill interval [i, j) and that gondola at position (i+k) is filled last is P(i, j, k) and can be computed as
WheelLargeSlow ( bool gond ) : CodeJamUtils
computeAnswer ( bool gondalas ) : System.Double

비공개 메소드들

메소드	설명
GetHoleCount ( int i, int j, int &ijLength ) : int

메소드 상세

E() 공개 메소드

public E ( int i, int j ) : System.Double
i	int
j	int
리턴	System.Double

E() 공개 메소드

The expected money we get while filling out the interval [i, j) so that the last filled gondola is at position (i+k). This means that the value for filling j is not counted

public E ( int i, int j, int k ) : System.Double
i	int
j	int
k	int
리턴	System.Double

P() 공개 메소드

the probability that gondola j will stay empty as interval [i, j) fills up assuming only positions between [i, j] are chosen

public P ( int i, int j ) : System.Double
i	int
j	int
리턴	System.Double

P() 공개 메소드

The probability that gondola j stays empty while we fill interval [i, j) and that gondola at position (i+k) is filled last is P(i, j, k) and can be computed as

public P ( int i, int j, int k ) : System.Double
i	int
j	int
k	int
리턴	System.Double

WheelLargeSlow() 공개 메소드

public WheelLargeSlow ( bool gond ) : CodeJamUtils
gond	bool
리턴	CodeJamUtils

computeAnswer() 공개 정적인 메소드

public static computeAnswer ( bool gondalas ) : System.Double
gondalas	bool
리턴	System.Double