Problem:
Score : 1000 points

Problem Statement

#nck {
width: 30px;
height: auto;
}

There are N balls and N+1 holes in a line. Balls are numbered 1 through N from left to right. Holes are numbered 1 through N+1 from left to right. The i-th ball is located between the i-th hole and (i+1)-th hole. We denote the distance between neighboring items (one ball and one hole) from left to right as d_i (1 \leq i \leq 2 \times N). You are given two parameters d_1 and x. d_i - d_{i-1} is equal to x for all i (2 \leq i \leq 2 \times N).

We want to push all N balls into holes one by one. When a ball rolls over a hole, the ball will drop into the hole if there is no ball in the hole yet. Otherwise, the ball will pass this hole and continue to roll. (In any scenario considered in this problem, balls will never collide.)

In each step, we will choose one of the remaining balls uniformly at random and then choose a direction (either left or right) uniformly at random and push the ball in this direction. Please calculate the expected total distance rolled by all balls during this process.

For example, when N = 3, d_1 = 1, and x = 1, the following is one possible scenario:

first step: push the ball numbered 2 to its left, it will drop into the hole numbered 2. The distance rolled is 3.

second step: push the ball numbered 1 to its right, it will pass the hole numbered 2 and drop into the hole numbered 3. The distance rolled is 9.

third step: push the ball numbered 3 to its right, it will drop into the hole numbered 4. The distance rolled is 6.

So the total distance in this scenario is 18.

Note that in all scenarios every ball will drop into some hole and there will be a hole containing no ball in the end.

Constraints

1 \leq N \leq 200,000

1 \leq d_1 \leq 100

0 \leq x \leq 100

All input values are integers.

Input

The input is given from Standard Input in the following format:

N d_1 x

Output

Print a floating number denoting the answer. The relative or absolute error of your answer should not be higher than 10^{-9}.

Sample Input 1

1 3 3

Sample Output 1

4.500000000000000

The distance between the only ball and the left hole is 3 and distance between the only ball and the right hole is 6. There are only two scenarios (i.e. push left and push right). The only ball will roll 3 and 6 unit distance, respectively. So the answer for this example is (3+6)/2 = 4.5.

Sample Input 2

2 1 0

Sample Output 2

2.500000000000000

Sample Input 3

1000 100 100

Sample Output 3

649620280.957660079002380

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Linq;//リストの使用
using System.Collections.Generic;
using System.Text;//テキストの高速出力に必要
class Program
{
	static void Main()
	{
    string[] input = Console.ReadLine().Split(' ');//Splitで区切り文字を指定して複数個受け取る。
    long n = long.Parse(input[0]);
    long d = long.Parse(input[1]);
    long x = long.Parse(input[2]);
    float answer = 0;

    for(int i = 0; i < n; i++)
    {
      answer += (2f*d + x + 4*i*x)/4;//両方向の初項
      Console.WriteLine(answer);
      answer += ProgressionTwo(0.5f, i)*(-2*d)/4;//左方向の中間項
      answer += ProgressionOne(0.5f, i)*(2*x + 4*i*d - d)/4;
      answer += ProgressionZero(0.5f, i)*(x + 2*i*d)/4;
      Console.WriteLine(answer);
      answer += ProgressionTwo(0.5f, n-1-i)*(2*d)/4;//右方向の中間項
      answer += ProgressionOne(0.5f, n-1-i)*(2*x + 4*i*d + 3*d)/4;
      answer += ProgressionZero(0.5f, n-1-i)*(x + d + 2*i*d)/4;
      Console.WriteLine(answer);
      answer += (2f*i+1) * (x+i*d) / (4*DivideMod(2,i));//左の最終項
      Console.WriteLine(answer);
      answer += (2f*n-2*i-1) * (x+i*d+n*d) / (4*DivideMod(2,n-1-i));//右の最終項
      Console.WriteLine(answer);
    }
		//Console.WriteLine(answer);
	}

  static float ProgressionZero(float ratio, long n)
  {//等比数列の和　Σ(i=1~n)ratio^i = ratio + ratio^2 + ... + ratio^n
    if(n == 0) return 0;//項数が0の時
    if(ratio == 1) return n;//公比が1の時
    float product = DivideMod(ratio, n);//公比の項数乗
    float answer = ratio * (1-product) / (1-ratio);
    return answer;
  }

  static float ProgressionOne(float ratio, long n)
  {//等差×等比数列の和　Σ(i=1~n)i*ratio^i = 1*ratio + 2+ratio^2 + ... + n*ratio^n
    if(n == 0) return 0;//項数が0の時
    if(ratio == 1) return n*(n+1)/2;//公比が1の時
    float product = DivideMod(ratio, n);//公比の項数乗
    float answer = ratio * (1-product) / (1-ratio);
    answer -= n*product*ratio;
    answer /= 1-ratio;
    return answer;
  }

  static float ProgressionTwo(float ratio, long n)
  {//(等差)^2×等比数列の和　Σ(i=1~n)i^2*ratio^i = 1^2*ratio + 2^2+ratio^2 + ... + n^2*ratio^n
    if(n == 0) return 0;//項数が0の時
    if(ratio == 1) return n*(n+1)*(2*n+1)/6;//公比が1の時
    float product = DivideMod(ratio, n);//公比の項数乗
    float answer = 2 * ratio * (1-product) / (1-ratio);
    answer -= ratio;
    answer -= n*n*ratio*product;
    answer += n*n*ratio*ratio*product;
    answer -= (2*n-1)*ratio*product;
    answer /= ratio*ratio - 2*ratio + 1;
    return answer;
  }

  static float DivideMod(float x, long a)//戻り値はx^a、ただしaは整数。
  {
    long num = 2;
    float answer = 1;
    long check = a;
    float memo = x;
    
    while(check > 0)
    {
      if(check % num == num / 2)
      {
        check -= num / 2;
        answer *= memo;
      }
    memo *= memo;
    num *= 2;
    }
    return answer;
  }
  
}