#include using namespace std; #define int long long using ll=long long; using vi=vector; using vl=vector; using pii=pair; using pll=pair; #define ITR(i,c) for(auto i=begin(c);i!=end(c);++i) #define FORE(x,c) for(auto &x:c) #define REPF(i,a,n) for(int i=a,i##len=(int)(n);i=0;--i) #define REPW(i,n) for(i=0;i<(int)(n);++i) #define ALL(c) begin(c),end(c) #define RALL(c) rbegin(c),rend(c) #define SZ(c) ((int)c.size()) #define CONTAIN(c,x) (c.find(x)!=end(c)) #define OUTOFRANGE(y,x,h,w) (y<0||x<0||y>=h||x>=w) #define dump(...) const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0}; #define INF (1001001001) #define INFLL (1001001001001001001ll) template ostream& operator << (ostream &os,const vector &v) { ITR(i,v) os << *i << (i==end(v)-1 ? "" : " "); return os; } template istream& operator >> (istream &is,vector &v) { ITR(i,v) is >> *i; return is; } template istream& operator >> (istream &is, pair &p) { is >> p.first >> " " >> p.second; return is; } templatebool chmax(T &a,const T &b){if(abool chmin(T &a,const T &b){if(b>n>>c>>v; REP(i,200000) dp[i]=INF; dp[1]=0; REPF(i,1,n) { if(dp[i]==INF) continue; int k=2; while(1) { chmin(dp[i*k],dp[i]+v*(k-1)+c); k++; if(i*k>2*n) break; } } int ans=INF; REPF(i,n,200000) { chmin(ans,dp[i]); } cout<