📄 no12.htm
字号:
<html xmlns:o="urn:schemas-microsoft-com:office:office"xmlns:w="urn:schemas-microsoft-com:office:word"xmlns="http://www.w3.org/TR/REC-html40"><head><meta http-equiv=Content-Type content="text/html; charset=GB2312"><meta name=ProgId content=Word.Document><meta name=Generator content="Microsoft Word 9"><meta name=Originator content="Microsoft Word 9"><link rel=File-List href="./No12.files/filelist.xml"><title> 问题参考程序</title><!--[if gte mso 9]><xml> <o:DocumentProperties> <o:Author>li</o:Author> <o:LastAuthor>a</o:LastAuthor> <o:Revision>2</o:Revision> <o:TotalTime>3</o:TotalTime> <o:Created>1996-12-31T17:09:00Z</o:Created> <o:LastSaved>1996-12-31T17:09:00Z</o:LastSaved> <o:Pages>48</o:Pages> <o:Words>6359</o:Words> <o:Characters>36247</o:Characters> <o:Company> </o:Company> <o:Lines>302</o:Lines> <o:Paragraphs>72</o:Paragraphs> <o:CharactersWithSpaces>44513</o:CharactersWithSpaces> <o:Version>9.2812</o:Version> </o:DocumentProperties></xml><![endif]--><!--[if gte mso 9]><xml> <w:WordDocument> <w:PunctuationKerning/> <w:DrawingGridHorizontalSpacing>5.25 磅</w:DrawingGridHorizontalSpacing> <w:DrawingGridVerticalSpacing>7.8 磅</w:DrawingGridVerticalSpacing> <w:DisplayHorizontalDrawingGridEvery>2</w:DisplayHorizontalDrawingGridEvery> <w:DisplayVerticalDrawingGridEvery>2</w:DisplayVerticalDrawingGridEvery> <w:Compatibility> <w:SpaceForUL/> <w:BalanceSingleByteDoubleByteWidth/> <w:DoNotLeaveBackslashAlone/> <w:ULTrailSpace/> <w:DoNotExpandShiftReturn/> <w:FootnoteLayoutLikeWW8/> <w:ShapeLayoutLikeWW8/> <w:AlignTablesRowByRow/> <w:ForgetLastTabAlignment/> <w:LayoutRawTableWidth/> <w:LayoutTableRowsApart/> <w:UseFELayout/> </w:Compatibility> </w:WordDocument></xml><![endif]--><style><!-- /* Font Definitions */@font-face {font-family:宋体; panose-1:2 1 6 0 3 1 1 1 1 1; mso-font-alt:SimSun; mso-font-charset:134; mso-generic-font-family:auto; mso-font-pitch:variable; mso-font-signature:3 135135232 16 0 262145 0;}@font-face {font-family:"\@宋体"; panose-1:2 1 6 0 3 1 1 1 1 1; mso-font-charset:134; mso-generic-font-family:auto; mso-font-pitch:variable; mso-font-signature:1 135135232 16 0 262144 0;} /* Style Definitions */p.MsoNormal, li.MsoNormal, div.MsoNormal {mso-style-parent:""; margin:0cm; margin-bottom:.0001pt; text-align:justify; text-justify:inter-ideograph; mso-pagination:none; font-size:10.5pt; mso-bidi-font-size:10.0pt; font-family:"Times New Roman"; mso-fareast-font-family:宋体; mso-font-kerning:1.0pt;}p.MsoFooter, li.MsoFooter, div.MsoFooter {margin:0cm; margin-bottom:.0001pt; mso-pagination:none; tab-stops:center 207.65pt right 415.3pt; layout-grid-mode:char; font-size:9.0pt; mso-bidi-font-size:10.0pt; font-family:"Times New Roman"; mso-fareast-font-family:宋体; mso-font-kerning:1.0pt;}p.MsoPlainText, li.MsoPlainText, div.MsoPlainText {margin:0cm; margin-bottom:.0001pt; text-align:justify; text-justify:inter-ideograph; mso-pagination:none; font-size:10.5pt; mso-bidi-font-size:10.0pt; font-family:宋体; mso-hansi-font-family:"Courier New"; mso-bidi-font-family:"Times New Roman"; mso-font-kerning:1.0pt;} /* Page Definitions */@page {mso-page-border-surround-header:no; mso-page-border-surround-footer:no; mso-gutter-position:top;}@page Section1 {size:515.95pt 728.6pt; margin:70.9pt 47.9pt 65.2pt 47.9pt; mso-header-margin:42.55pt; mso-footer-margin:42.55pt; mso-even-footer:url("./No12.files/header.htm") ef1; mso-footer:url("./No12.files/header.htm") f1; mso-paper-source:0; layout-grid:15.6pt;}div.Section1 {page:Section1;}--></style></head><body lang=ZH-CN style='tab-interval:21.25pt;text-justify-trim:punctuation' bgcolor="#e8ffe8"><div class=Section1 style='layout-grid:15.6pt'><p class=MsoPlainText><span lang=EN-US><![if !supportEmptyParas]> <![endif]><o:p></o:p></span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>部分问题参考程序 (Write by Li Xuewu)</span></p><p class=MsoPlainText><span lang=EN-US><![if !supportEmptyParas]> <![endif]><o:p></o:p></span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>目录</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>1. 最小数字子串</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>2. 邮票面值</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>3. 字符移动</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>4. 子集定和问题</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>5. 素数方阵</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>6. 全排列问题</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>7. 移盘子问题</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>8. N 女王问题</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>9. 组合问题</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>10. 电子锁</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>11. 高精度数加减法</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>12. 高精度数乘法</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>13. 高精度数除法(一)</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>14. 高精度数除法(二)</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>15. 高精度数阶乘</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>16. P×S=11...1</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>17. P×S=987654321...</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>18. 受控时钟</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>19. 高精度八进制除法</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>20. 八数码问题</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>21. 取火柴游戏</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>22. 取奇数游戏</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>23. 最长公共子串</span></p><p class=MsoPlainText><span lang=EN-US><![if !supportEmptyParas]> <![endif]><o:p></o:p></span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>1. 键盘输入一个高精度正整数t(不超过240位),去掉其中S个数字后,剩下的</span></p><p class=MsoPlainText>数字按原顺序组成一个新数<span lang=EN-US>,试对给定的 t 与 S, 寻找一种方案,使剩下的数字</span></p><p class=MsoPlainText>组成的新数最小<span lang=EN-US>.</span></p><p class=MsoPlainText><span lang=EN-US><![if !supportEmptyParas]> <![endif]><o:p></o:p></span></p><p class=MsoPlainText><span lang=EN-US>program lxw001;</span></p><p class=MsoPlainText><span lang=EN-US>var t1,t2:string[250];</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>a,b:array[1..250] of integer;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>i,j,r,s,s1:integer;</span></p><p class=MsoPlainText><span lang=EN-US>begin</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>writeln('输入数字串:'); readln(t1);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>writeln('输入删除数字个数:');readln(s);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>s1:=s;<span style="mso-spacerun: yes"> </span>r:=0;<spanstyle="mso-spacerun: yes"> </span>t2:='';</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>for i:=1 to length(t1) do a[i]:=i;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>repeat</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>i:=1;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>for j:=1 to s1+1 do<span style="mso-spacerun:yes"> </span>if t1[j]<t1[i] then i:=j;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>if i>1 then</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>for j:=1 to i-1 do<spanstyle="mso-spacerun: yes"> </span>begin inc(r); b[r]:=a[j]<spanstyle="mso-spacerun: yes"> </span>end;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>t2:=t2+copy(t1,i,1);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>delete(t1,1,i);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>for j:=1 to length(t1) do a[j]:=a[j+i];</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>s1:=s1-(i-1);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>if length(t1)=s1 then {处理尾部应删的数}</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>begin</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>for j:=1 to s1 do begininc(r);b[r]:=a[j] end;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>s1:=0;<spanstyle="mso-spacerun: yes"> </span>t1:='';</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>end;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>until s1=0;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>t2:=t2+t1;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>writeln('最小数:',t2);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>write('删除数字的位置:<span style="mso-spacerun: yes"> </span>');</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>for i:=1 to s do write(b[i],'<span style="mso-spacerun: yes"> ⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -