#include <iostream>
#include <cmath>
#include <sstream>
#include <algorithm>
#include <vector>
#include <bits/stdc++.h>
#include<map>
typedef long long ll;
using namespace std;
int main()
{
double hh, m,h,d,c,n;
cin >> hh >> m>>h>>d>>c>>n;
double c1 = 0, c2 = 0;
double carry,carry2;
if (hh >= 20) {
carry = (h / n);
ll a = carry;
if (a != carry) {
carry = a + 1;
}
c1 = (carry * c)*0.8;
cout << c1 ;
}
else {
double lage = 0;
lage = ((20 - hh) * 60) - m;
double carryh = h;
h = h + (d * lage);
carry = (h / n);
ll a = carry;
if (a != carry) {
carry = a + 1;
}
c1 = (carry * c) * 0.8;
carry2 = (carryh / n);
ll b = carry2;
if (b != carry2) {
carry2 = b + 1;
}
c2 = (carry2 * c);
double ans = 0;
ans = min(c1, c2);
cout << ans;
}
}
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |