📄 no12.htm
字号:
yes"> </span>assign_g(d1[2,1],d1[2,2],t23,d1[2,4],d1[2,5]);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>look(1,2,g1,tr6);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>if tr6=false then goto60;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>t43:=sum1-(d1[4,1]+d1[4,2]+d1[4,4]+d1[4,5]);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>if(t43<0)or(t43>9) then goto 60;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>assign_g(d1[4,1],d1[4,2],t43,d1[4,4],d1[4,5]);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>look(1,4,g1,tr6);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>if tr6=false then goto60;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>if (d1[1,3]+d1[2,3]+d1[3,3]+d1[4,3]+d1[5,3])<>sum1</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>thengoto 60;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>for i3:=1 to 5 dog1[i3]:=d1[i3,3];</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>look(2,3,g1,tr6);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>if tr6=false then goto60;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>inc(ss);writeln('No.',ss);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>for i3:=1 to 5 do</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>begin for i4:=1 to5 do write(d1[i3,i4]:2); writeln; end;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>60:;</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>end;</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>write('d[1,1]='); readln(r);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>write('sum of row='); readln(sum1);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>ss:=0;<span style="mso-spacerun: yes"> </span>prim1;<spanstyle="mso-spacerun: yes"> </span>p1;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>if ss=0 then writeln('No Solution!');</span></p><p class=MsoPlainText><span lang=EN-US>end.</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>6. 求 1,2,...,n 这n个数字的全部可能的排列.</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 lxw006;</span></p><p class=MsoPlainText><span lang=EN-US>const nn=20;</span></p><p class=MsoPlainText><span lang=EN-US>type row=array [1..20] of shortint;</span></p><p class=MsoPlainText><span lang=EN-US>var p: row;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>n,i: integer;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>num:longint;</span></p><p class=MsoPlainText><span lang=EN-US>procedure wrtperm(n:integer; var s:row);</span></p><p class=MsoPlainText><span lang=EN-US>var i: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>for i:=1 to n do write(s[i]:3);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>writeln;</span></p><p class=MsoPlainText><span lang=EN-US>end;</span></p><p class=MsoPlainText><span lang=EN-US>procedure perm(n:integer; var p:row; vari:integer);</span></p><p class=MsoPlainText><span lang=EN-US>var j,j1,j2,t,m: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>i:=n;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>repeat<span style="mso-spacerun: yes"> </span>dec(i)<spanstyle="mso-spacerun: yes"> </span>until (p[i]<p[i+1]) or (i<1);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>if i>0 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>j:=i+1;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>for t:=i+1 to n do</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>if p[i]<p[t] then j:=t;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>m:=p[i]; p[i]:=p[j]; p[j]:=m;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>t:=(n-i) div 2;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>for j:=1 to t do</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>j1:=i+j;j2:=n-j+1;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>m:=p[j1];p[j1]:=p[j2]; p[j2]:=m;</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>end;</span></p><p class=MsoPlainText><span lang=EN-US>end;</span></p><p class=MsoPlainText><span lang=EN-US>begin {main}</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>writeln('输入N:(<=20)'); readln(n);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>num:=1;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>for i:=1 to n do p[i]:=i;</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>while i>0 do</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>wrtperm(n,p);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>perm(n,p,i);</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>if i>0 then inc(num);</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>writeln('num=',num);</span></p><p class=MsoPlainText><span lang=EN-US>end.</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>7. 从左向右依次安放 3 根细柱 A,B,C. 在 A 上套有 N (N≤20) 个直径相同</span></p><p class=MsoPlainText>的圆盘<span lang=EN-US>, 从下到上依次编为1,2,,,,,N, 将这些圆盘经过 B 单向地移入C (即不</span></p><p class=MsoPlainText>允许从右向左移动<span lang=EN-US>). 圆盘可在 B 中暂存. 从键盘输入 N, 问将圆盘全部移入C</span></p><p class=MsoPlainText>后<span lang=EN-US>,在C柱上共有多少种排列方式?</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>┃<span style="mso-spacerun: yes"> </span>┃<spanstyle="mso-spacerun: yes"> </span>┃<spanstyle="mso-spacerun: yes"> </span></span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>1<spanstyle="mso-spacerun: yes"> </span>━╋━<span style="mso-spacerun:yes"> </span>┃<span style="mso-spacerun:yes"> </span>┃<span style="mso-spacerun:yes"> </span></span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>2<spanstyle="mso-spacerun: yes"> </span>━╋━<span style="mso-spacerun:yes"> </span>┃<span style="mso-spacerun:yes"> </span>┃<span style="mso-spacerun:yes"> </span></span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>3<spanstyle="mso-spacerun: yes"> </span>━╋━<span style="mso-spacerun:yes"> </span><span style="mso-spacerun: yes"> </span>┃<spanstyle="mso-spacerun: yes"> </span>┃<spanstyle="mso-spacerun:yes"> </span></span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>4<spanstyle="mso-spacerun: yes"> </span>━╋━<span style="mso-spacerun:yes"> </span>┃<span style="mso-spacerun:yes"> </span>┃<span style="mso-spacerun:yes"> </span></span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>━━┻━━━┻━━━┻━<span style="mso-spacerun: yes"> </span></span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>A<span style="mso-spacerun: yes"> </span>B<span style="mso-spacerun: yes"> </span>C<span style="mso-spacerun:yes"> </span></span></p><p class=MsoPlainText><span lang=EN-US>program lxw007; </span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>type row=array[1..100] of shortint;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun: yes"> </span>var b,c,d: row;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>i,j,j1,j2,m,n,n2: integer;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>s,sum,t,pa,pb,pc:integer;</span></p><p class=MsoPlainText><span lang=EN-US>procedure prt2(u:shortint);</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>if u=1 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>inc(pa); inc(pb); b[pb]:=pa;</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:yes"> </span>write('A(',pa:2,')=>B(',pb:2,')<span style="mso-spacerun: yes"> </span>');</span></p><p class=MsoPlainText><span lang=EN-US><span style="mso-spacerun:
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -