| # | Problem | Pass Rate (passed user / total user) |
|---|---|---|
| 13267 | Stewie's Calculator |
|
| 13266 | Nappa's Alphabet |
|
Description
Stewie just had a great idea on how to become famous. First he would invent the world's first time machine, then he would travel back in time and create the world's first calculator!
After making the time machine, Stewie and his dog, Bryan, jumped back to 1642 (the year the calculator was invented) and kidnap Jack Kilby (the inventor of the calculator). After kidnapping Jack, Stewie realized that Bryan did not bring the modern calculator so now Stewie has to make one from scratch.
They do not have enough time so he has to make a simple one.
The calculator will only be able to take in 2 numbers and an operator in a specific order and then will output the answer with 2 decimal places.
The operators the calculator will have are addition (+), subtraction(-), division(/), and multiplication(*).
Stewie must invent the calculator quick before the time machine's portal closes.
Input
The input will consist of 2 numbers, which may contain decimals, and an operator in the following order:
I1 Op I2
(there will be spaces between each character)
Output
Output the result of the equation with two decimal spaces and a trailing newline character
If the equation cannot be calculated, print "Error" with a trailing newline character
Sample Input Download
Sample Output Download
Tags
Discuss
Description
Despite being able to destroy a city and an entire army, Nappa is really bad at spelling. Luckily, his good friend Vegeta is going to help him so that Nappa does not have to ask him too many questions.
In order to do this, Vegeta needs to develop a program that creates alphabets in a pattern Nappa is familiar with, pyramids, then he will test Nappa with the program. If Napppa fails the test, he will be destroyed.
The program Vegeta needs to create will require a single integer n as an input which will determine the layers a pyramid has. At the center of the pyramid, there is an N-th letter of the alphabet and it will be surrounded by decreasing alphabets.
Vegeta needs to make this program quick before he gets an aneurism from Nappa's stupidity.
Input
N
N will only be in range of the total number of alphabets.
Output
Uppercase alphabet pyramid
Detail will show in sample output
Remember to put "\n" in every line