Microwave ovens are a time-saving addition to the modern kitchen. From handy countertop microwaves to convenient over-the-range models, there’s a style for every space.For even better cooking results, opt for a convection microwave oven that combines fast cooking power with the browning and crisping ability of a traditional convection oven.
- Unsure of the right type of microwave for you? Sharp offers a variety of microwave ovens such as countertop, carousel, over-the-range, and drawer models.
- Sharp R1210T Compact 1.5 Cubic Feet 1100 Watt Over the Counter Carousel Microwave Oven with Sensor Cook, Black (Certified Refurbished) Sharp New at target ¬ $104.99.
- Hamilton Beach 0.9 cu.ft. Microwave Oven, Stainless Steel:0.9 cu ftStainless steel design900W power/10 power levelsTouch pad controlConvenience cooking controls6 auto cooking menusTime and weight defrostLED display, kitchen timerCooking complete reminderDoor with handleChild safety lockDimensions: 19.02 in W x 15.6 in D x 11.06 in H1 year.
You have a malfunctioning microwave in which you want to put some bananas. You have $$$n$$$ time-steps before the microwave stops working completely. At each time-step, it displays a new operation.
Let $$$k$$$ be the number of bananas in the microwave currently. Initially, $$$k = 0$$$. In the $$$i$$$-th operation, you are given three parameters $$$t_i$$$, $$$x_i$$$, $$$y_i$$$ in the input. Based on the value of $$$t_i$$$, you must do one of the following:
Type 1: ($$$t_i=1$$$, $$$x_i$$$, $$$y_i$$$) — pick an $$$a_i$$$, such that $$$0 le a_i le y_i$$$, and perform the following update $$$a_i$$$ times: $$$k:=lceil (k + x_i) rceil$$$.
Microwave
Type 2: ($$$t_i=2$$$, $$$x_i$$$, $$$y_i$$$) — pick an $$$a_i$$$, such that $$$0 le a_i le y_i$$$, and perform the following update $$$a_i$$$ times: $$$k:=lceil (k cdot x_i) rceil$$$.
Microwave Eggs
Note that $$$x_i$$$ can be a fractional value. See input format for more details. Also, $$$lceil x rceil$$$ is the smallest integer $$$ge x$$$.
At the $$$i$$$-th time-step, you must apply the $$$i$$$-th operation exactly once.
For each $$$j$$$ such that $$$1 le j le m$$$, output the earliest time-step at which you can create exactly $$$j$$$ bananas. If you cannot create exactly $$$j$$$ bananas, output $$$-1$$$.