mirror of
https://github.com/xlucn/PAT.git
synced 2026-11-04 00:38:13 +08:00
15 lines
1.6 KiB
HTML
15 lines
1.6 KiB
HTML
Have Fun with Numbers
|
|
<div class="ques-view"><p>Notice that the number 123456789 is a 9-digit number consisting exactly the numbers from 1 to 9, with no duplication. Double it we will obtain 246913578, which happens to be another 9-digit number consisting exactly the numbers from 1 to 9, only in a different permutation. Check to see the result if we double it again!</p>
|
|
<p>Now you are suppose to check if there are more numbers with this property. That is, double a given number with <span class="katex"><span class="katex-mathml"><math><mrow><mi>k</mi></mrow>k</math></span><span aria-hidden="true" class="katex-html"><span class="strut" style="height:0.69444em;"></span><span class="strut bottom" style="height:0.69444em;vertical-align:0em;"></span><span class="base textstyle uncramped"><span class="mord mathit" style="margin-right:0.03148em;">k</span></span></span></span> digits, you are to tell if the resulting number consists of only a permutation of the digits in the original number.</p>
|
|
<h3 id="input-specification-">Input Specification:</h3>
|
|
<p>Each input contains one test case. Each case contains one positive integer with no more than 20 digits.</p>
|
|
<h3 id="output-specification-">Output Specification:</h3>
|
|
<p>For each test case, first print in a line "Yes" if doubling the input number gives a number that consists of only a permutation of the digits in the original number, or "No" if not. Then in the next line, print the doubled number.</p>
|
|
<h3 id="sample-input-">Sample Input:</h3>
|
|
<pre><code class="lang-in">1234567899
|
|
</code></pre>
|
|
<h3 id="sample-output-">Sample Output:</h3>
|
|
<pre><code class="lang-out">Yes
|
|
2469135798
|
|
</code></pre>
|
|
</div> |