#include using namespace std; #define REP(i, n) for(int i = 0; i < (n); i++) #define REPS(i, n) for(int i = 1; i <= (n); i++) #define RREP(i, n) for(int i = (n)-1; i >= 0; i--) #define RREPS(i, n) for(int i = (n); i > 0; i--) #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) #define mp make_pair #define mt make_tuple #define pb push_back #define YES cout << "YES" << endl #define Yes cout << "Yes" << endl #define NO cout << "NO" << endl #define No cout << "No" << endl using ll = long long; using pi = pair; using pl = pair; using vi = vector; using vl = vector; using vs = vector; using vb = vector; using vvi = vector; using vvl = vector; const int MOD = 1e9 + 7; const int INF = 1e9 + 7; const ll INFL = 1e18; const double PI = 3.141592653589793; const double EPS = 1e-9; template bool chmax(T &a, const T &b) { if(a < b) { a = b; return true; } return false; } template bool chmin(T &a, const T &b) { if(a > b) { a = b; return true; } return false; } signed main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); int h, a, d; cin >> h >> a >> d; vector dp(h+1, INF); dp[0] = 0; REPS(i, h) dp[i] = min(1.0 + ((i >= a) ? dp[i-a] : 0), 1.5 + ((i >= d) ? dp[i-d] : 0)); cout << dp[h] << endl; }