EmoticonsDiv2
SRM 612 · 2013-12-22 · by ltaravilse
SRM 612 · 2013-12-22 · by ltaravilse · Dynamic Programming, Graph Theory, Greedy
Problem Statement
Problem Statement
You are very happy because you advanced to the next round of a very important programming contest.
You want your best friend to know how happy you are.
Therefore, you are going to send him a lot of smile emoticons.
You are given an int smiles: the exact number of emoticons you want to send.
You have already typed one emoticon into the chat. Then, you realized that typing is slow. Instead, you will produce the remaining emoticons using copy and paste.
You can only do two different operations:
Return the smallest number of seconds in which you can turn the one initial emoticon into smiles emoticons.
You have already typed one emoticon into the chat. Then, you realized that typing is slow. Instead, you will produce the remaining emoticons using copy and paste.
You can only do two different operations:
- Copy all the emoticons you currently have into the clipboard.
- Paste all emoticons from the clipboard.
Return the smallest number of seconds in which you can turn the one initial emoticon into smiles emoticons.
Constraints
- smiles will be between 2 and 1000, inclusive.
Examples
0)
2 Returns: 2
First use copy, then use paste. The first operation copies one emoticon into the clipboard, the second operation pastes it into the message, so now you have two emoticons and you are done.
1)
6 Returns: 5
Copy. This puts one emoticon into the clipboard. Paste. You now have 2 emoticons in the message. Copy. The clipboard now contains 2 emoticons. Paste. You now have 4 emoticons in the message. Paste. You now have 6 emoticons in the message and you are done.
2)
11 Returns: 11
3)
16 Returns: 8
4)
1000 Returns: 21
Submissions are judged against all 61 archived test cases, of which 5 are shown here. Case numbers match the judge’s.
Coding Area
Language: C++17 · define a public class EmoticonsDiv2 with a public method int printSmiles(int smiles) · 61 test cases · 2 s / 256 MB per case