软软收入未达预期，surface积压# PDA - 掌中宝
i*7
1 楼
http://www.leetcode.com/2011/01/ctrla-ctrlc-ctrlv.html
Imagine you have a special keyboard with the following keys:
A
Ctrl+A
Ctrl+C
Ctrl+V
where CTRL+A, CTRL+C, CTRL+V each acts as one function key for “Select
All”, “Copy”, and “Paste” operations respectively.
If you can only press the keyboard for N times (with the above four keys
), please write a program to produce maximum numbers of A. If possible,
please also print out the sequence of keys.
That is to say, the input parameter is N (No. of keys that you can press
), the output is M (No. of As that you can produce).
我看下面的评论说这题有O(1)的解法并且在mitbbs被讨论过？
有人能帮忙说一下是怎么解吗？
Imagine you have a special keyboard with the following keys:
A
Ctrl+A
Ctrl+C
Ctrl+V
where CTRL+A, CTRL+C, CTRL+V each acts as one function key for “Select
All”, “Copy”, and “Paste” operations respectively.
If you can only press the keyboard for N times (with the above four keys
), please write a program to produce maximum numbers of A. If possible,
please also print out the sequence of keys.
That is to say, the input parameter is N (No. of keys that you can press
), the output is M (No. of As that you can produce).
我看下面的评论说这题有O(1)的解法并且在mitbbs被讨论过？
有人能帮忙说一下是怎么解吗？
