Problem:
Score : 400 points

Problem Statement

Snuke has one biscuit and zero Japanese yen (the currency) in his pocket.
He will perform the following operations exactly K times in total, in the order he likes:

Hit his pocket, which magically increases the number of biscuits by one.

Exchange A biscuits to 1 yen.

Exchange 1 yen to B biscuits.

Find the maximum possible number of biscuits in Snuke's pocket after K operations.

Constraints

1 \leq K,A,B \leq 10^9

K,A and B are integers.

Input

Input is given from Standard Input in the following format:

K A B

Output

Print the maximum possible number of biscuits in Snuke's pocket after K operations.

Sample Input 1

4 2 6

Sample Output 1

7

The number of biscuits in Snuke's pocket after K operations is maximized as follows:

Hit his pocket. Now he has 2 biscuits and 0 yen.

Exchange 2 biscuits to 1 yen. his pocket. Now he has 0 biscuits and 1 yen.

Hit his pocket. Now he has 1 biscuits and 1 yen.

Exchange 1 yen to 6 biscuits. his pocket. Now he has 7 biscuits and 0 yen.

Sample Input 2

7 3 4

Sample Output 2

8

Sample Input 3

314159265 35897932 384626433

Sample Output 3

48518828981938099

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
int f(int a,int b);
int g(int a,int b);
int g1(int a,int b);
int h(int a,int b);
int h1(int a,int b);
int main(void){
  int k,a,b;
  scanf("%d %d %d",&k,&a,&b);
  int sum=1;
  int kin=0;
  if(a>=b-1){
    sum=sum+k;
    printf("%d\n",sum);
  }else{
    while(k>0){
    if(sum>=a && k>=2){
      sum=sum+b-a;
      k=k-2;
    }else{
          sum=sum+1;
          k=k-1;
    }
    }
    printf("%d\n",sum);
  }
}
int f(int a,int b){
  return a+1;
}
int g(int a,int b){
  return a-b;
}
int g1(int a,int b){
  return a+1;
}
int h(int a,int b){
  return a+b;
}
int h1(int a,int b){
  return a-1;
}