⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 usaco 2_3_4 money systems 题解_leokan的blog.mht

📁 美国USACO题库源程序
💻 MHT
📖 第 1 页 / 共 5 页
字号:
href=3D"http://hi.baidu.com/leokan/friends">=BA=C3=D3=D1</A> =
<SPAN>|</SPAN><A=20
href=3D"http://hi.baidu.com/leokan/modify/spbasic/0">=C9=E8=D6=C3</A> =
</DIV></DIV>
<DIV class=3Dstage>
<DIV class=3Dstagepad>
<DIV style=3D"WIDTH: 100%">
<TABLE class=3Dmodth cellSpacing=3D0 cellPadding=3D0 width=3D"100%" =
border=3D0>
  <TBODY>
  <TR>
    <TD class=3Dmodtl width=3D7>&nbsp;</TD>
    <TD class=3Dmodtc noWrap>
      <DIV class=3Dmodhead><SPAN =
class=3Dmodtit>=B2=E9=BF=B4=CE=C4=D5=C2</SPAN></DIV></TD>
    <TD class=3Dmodtc noWrap align=3Dright>
      <DIV class=3Dmodopt><A class=3Dmodact=20
      href=3D"http://hi.baidu.com/leokan/creat/blog/"><IMG=20
      src=3D"http://img.baidu.com/hi/img/ico_postnew.gif" =
align=3DabsMiddle=20
      border=3D0>=D0=B4=D0=C2=CE=C4=D5=C2</A></DIV></TD>
    <TD class=3Dmodtr width=3D7>&nbsp;</TD></TR></TBODY></TABLE>
<DIV class=3Dmodbox id=3Dm_blog>
<DIV class=3Dtit>USACO 2.3.4 Money Systems =CC=E2=BD=E2</DIV>
<DIV class=3Ddate>2008=C4=EA01=D4=C230=C8=D5 =D0=C7=C6=DA=C8=FD =
11:20</DIV>
<TABLE style=3D"TABLE-LAYOUT: fixed">
  <TBODY>
  <TR>
    <TD>
      <DIV class=3Dcnt>
      <H2>USACO 2.3.4 Money Systems</H2>
      <DIV class=3Dt_msgfont>Money Systems<BR><BR>The cows have not only =
created=20
      their own government but they have chosen to create their own =
money=20
      system. In their own rebellious way, they are curious about values =
of=20
      coinage. Traditionally, coins come in values like 1, 5, 10, 20 or =
25, 50,=20
      and 100 units, sometimes with a 2 unit coin thrown in for good =
measure.=20
      <BR><BR>The cows want to know how many different ways it is =
possible to=20
      dispense a certain amount of money using various coin systems. For =

      instance, using a system of {1, 2, 5, 10, ...} it is possible to =
create 18=20
      units several different ways, including: 18x1, 9x2, 8x2+2x1, =
3x5+2+1, and=20
      many others. <BR><BR>Write a program to compute how many ways to =
construct=20
      a given amount of money using supplied coinage. It is guaranteed =
that the=20
      total will fit into both a signed long long (C/C++) and Int64 =
(Free=20
      Pascal). <BR><BR>PROGRAM NAME: money<BR>INPUT FORMAT<BR>The number =
of=20
      coins in the system is V (1 &lt;=3D V &lt;=3D 25). <BR><BR>The =
amount money to=20
      construct is N (1 &lt;=3D N &lt;=3D 10,000). Line 1:&nbsp;&nbsp; =
Two integers,=20
      V and N&nbsp;&nbsp;<BR>Lines 2..:&nbsp;&nbsp; V integers that =
represent=20
      the available coins (no particular number of integers per line)=20
      <BR><BR><BR>SAMPLE INPUT (file money.in) <BR>3 10<BR>1 2 =
5<BR><BR>OUTPUT=20
      FORMAT<BR>A single line containing the total number of ways to =
construct N=20
      money units using V coins. <BR>SAMPLE OUTPUT (file=20
      money.out)<BR>10<BR><BR><BR><BR>Money =
Systems<BR><BR>=BB=F5=B1=D2=CF=B5=CD=B3<BR><BR>=D2=EB by=20
      =
timgreen<BR><BR>=C4=B8=C5=A3=C3=C7=B2=BB=B5=AB=B4=B4=BD=A8=C1=CB=CB=FB=C3=
=C7=D7=D4=BC=BA=B5=C4=D5=FE=B8=AE=B6=F8=C7=D2=D1=A1=D4=F1=C1=CB=BD=A8=C1=A2=
=C1=CB=D7=D4=BC=BA=B5=C4=BB=F5=B1=D2=CF=B5=CD=B3=A1=A3<BR>[In their own=20
      rebellious =
way],=A3=AC=CB=FB=C3=C7=B6=D4=BB=F5=B1=D2=B5=C4=CA=FD=D6=B5=B8=D0=B5=BD=BA=
=C3=C6=E6=A1=A3<BR>=B4=AB=CD=B3=B5=D8=A3=AC=D2=BB=B8=F6=BB=F5=B1=D2=CF=B5=
=CD=B3=CA=C7=D3=C91,5,10,20 =BB=F2 25,50, =BA=CD=20
      =
100=B5=C4=B5=A5=CE=BB=C3=E6=D6=B5=D7=E9=B3=C9=B5=C4=A1=A3<BR>=C4=B8=C5=A3=
=CF=EB=D6=AA=B5=C0=D3=D0=B6=E0=C9=D9=D6=D6=B2=BB=CD=AC=B5=C4=B7=BD=B7=A8=C0=
=B4=D3=C3=BB=F5=B1=D2=CF=B5=CD=B3=D6=D0=B5=C4=BB=F5=B1=D2=C0=B4=B9=B9=D4=EC=
=D2=BB=B8=F6=C8=B7=B6=A8=B5=C4=CA=FD=D6=B5=A1=A3<BR>=BE=D9=C0=FD=C0=B4=CB=
=B5, =CA=B9=D3=C3=D2=BB=B8=F6=BB=F5=B1=D2=CF=B5=CD=B3=20
      {1,2,5,10,...}=B2=FA=C9=FA =
18=B5=A5=CE=BB=C3=E6=D6=B5=B5=C4=D2=BB=D0=A9=BF=C9=C4=DC=B5=C4=B7=BD=B7=A8=
=CA=C7:18x1, 9x2, 8x2+2x1,=20
      =
3x5+2+1,=B5=C8=B5=C8=C6=E4=CB=FC=A1=A3<BR>=D0=B4=D2=BB=B8=F6=B3=CC=D0=F2=C0=
=B4=BC=C6=CB=E3=D3=D0=B6=E0=C9=D9=D6=D6=B7=BD=B7=A8=D3=C3=B8=F8=B6=A8=B5=C4=
=BB=F5=B1=D2=CF=B5=CD=B3=C0=B4=B9=B9=D4=EC=D2=BB=B6=A8=CA=FD=C1=BF=B5=C4=C3=
=E6=D6=B5=A1=A3<BR>=B1=A3=D6=A4=D7=DC=CA=FD=BD=AB=BB=E1=CA=CA=BA=CFlong =
long=20
      (C/C++) =BA=CD Int64 (Free Pascal)=A1=A3<BR><BR>PROGRAM NAME: =
money<BR><BR>INPUT=20
      =
FORMAT<BR><BR>=BB=F5=B1=D2=CF=B5=CD=B3=D6=D0=BB=F5=B1=D2=B5=C4=D6=D6=C0=E0=
=CA=FD=C4=BF=CA=C7 V =A1=A3 (1&lt;=3D =
V&lt;=3D25)<BR>=D2=AA=B9=B9=D4=EC=B5=C4=CA=FD=C1=BF=C7=AE=CA=C7 N =A1=A3 =
(1&lt;=3D=20
      N&lt;=3D10,000)<BR><BR>=B5=DA 1 =D0=D0:&nbsp;&nbsp; =
=B6=FE=D5=FB=CA=FD=A3=AC V =BA=CD N <BR>=B5=DA 2 ..V+1=D0=D0=A3=BA =
=BF=C9=D3=C3=B5=C4=BB=F5=B1=D2 V=20
      =
=B8=F6=D5=FB=CA=FD=A1=A1(=C3=BF=D0=D0=D2=BB=B8=F6=A1=A1=C3=BF=D0=D0=C3=BB=
=D3=D0=C6=E4=CB=FC=B5=C4=CA=FD)=A1=A3 <BR><BR>SAMPLE INPUT (file =
money.in) <BR>3 10<BR>1 2=20
      5<BR>OUTPUT =
FORMAT<BR>=B5=A5=B6=C0=B5=C4=D2=BB=D0=D0=B0=FC=BA=AC=C4=C7=B8=F6=BF=C9=C4=
=DC=B5=C4=B9=B9=D4=EC=B5=C4=B7=BD=B0=B8=CA=FD=A1=A3<BR>SAMPLE OUTPUT =
(file=20
      money.out)<BR>10</DIV>
      <P></P>
      <P></P>
      <HR>

      <P></P>
      <P><STRONG>USACO 2.2.4 Money Systems =
<BR>=CC=E1=BD=BB=B4=CE=CA=FD:2=B4=CE</STRONG></P>
      =
<P><STRONG>=D5=E2=CC=E2=CE=D2=D2=BB=BF=AA=CA=BC=CF=EB=B5=BD=D3=C3=B5=C4=B6=
=FE=CE=AC=CA=FD=D7=E9,cash[i]=B1=ED=CA=BE=B5=DAi=BC=FE=CE=EF=C6=B7=B5=C4=BC=
=DB=C7=AE,f(i,j)=B1=ED=CA=BE=D3=C3=C7=B0i=BC=FE=CE=EF=C6=B7=B1=ED=CA=BEj=D5=
=E2=B8=F6=BC=DB=C7=AE=B5=C4=BF=C9=C4=DC=CA=FD.=C8=BB=BA=F3f(i,j)=3D=A1=C6=
f(i-k,j-cash</STRONG><STRONG>[i]).AC=D6=AE=BA=F3=BA=F6=C8=BB=CF=EB=B5=BD,=
=C6=E4=CA=B5=D2=BB=CE=AC=CA=FD=D7=E9=BE=CD=BF=C9=D2=D4=C1=CB,=D4=AD=CF=C8=
f(i,j)=B5=C4=C7=B0=D2=BB=B8=F6=B2=CE=CA=FD=C6=E4=CA=B5=CA=C7=B2=BB=B1=D8=D2=
=AA=B5=C4,f(i-k,j-cash[i])=BF=C9=D2=D4=D3=C3=D2=BB=CE=AC=B5=C4f(j-cash[i]=
)=BC=D3=D1=AD=BB=B7</STRONG><STRONG>=B1=ED=CA=BE,i-k=C4=C7=B8=F6=C1=BF=D2=
=D1=BE=AD=B0=B5=B2=D8=D4=DA=C0=EF=C3=E6=C1=CB.</STRONG></P>
      =
<P><STRONG>=D5=E2=C1=EE=CE=D2=D1=A7=CF=B0=B5=BD,DP=BD=B5=CE=AC=CA=C7=BA=DC=
=D6=D8=D2=AA=B5=C4,=BC=D9=C8=E7=D5=E2=CC=E2=D3=D0250=B8=F6=CA=FD100000=B8=
=F6=BC=DB=D6=B5,=C4=C7=CE=D2=D4=AD=CF=C8=C4=C7=D6=D6=B7=BD=B7=A8=BE=CD=B9=
=FD=B2=BB=C1=CB=C1=CB.</STRONG></P>
      =
<P><BR><STRONG>=CE=CA=CC=E2=D6=D8=CA=F6:<BR>=B8=F8=B3=F6=D7=D4=C8=BB=CA=FD=
n,=BC=B0v=B8=F6=BB=A5=B2=BB=CF=E0=CD=AC=B5=C4=CA=FD=D7=D6,=C7=F3=D3=C3v=B8=
=F6=BB=A5=B2=BB=CF=E0=CD=AC=B5=C4=CA=FD=D7=D6=C0=DB=BC=D3=B5=C3n=D5=E2=B8=
=F6=CA=FD=D7=D6(=CA=FD=D7=D6=BF=C9=D2=D4=D6=D8=B8=B4=CA=B9=D3=C3)=B5=C4=B7=
=BD=B7=A8=D7=DC=CA=FD.</STRONG></P>
      =
<P><STRONG>=CE=CA=CC=E2=B7=D6=CE=F6:<BR>=D2=C0=D5=D5=CC=E2=D2=E2=B5=C3=B5=
=BD,=C0=DB=BC=D3=D2=BB=B8=F6x=D7=E9=B3=C9=CA=FD=D7=D6y=B5=C4=B7=BD=B7=A8=BC=
=AF=BA=CFA,=BA=CD=B2=BB=C0=DB=BC=D3=D5=E2=B8=F6x=D7=E9=B3=C9=CA=FD=D7=D6y=
-x=B5=C4=B7=BD=B7=A8=BC=AF=BA=CFB=D3=D0=D2=BB=D6=D6=D3=B3=C9=E4=B9=D8=CF=B5=
,g:A=A1=FAB.g=BE=CD=CA=C7=D4=DAA=D6=D0=C4=B3=D2=BB=D6=D6=C0=DB=BC=D3</STR=
ONG><STRONG>=B7=BD=B7=A8=BC=F5=C8=A5x.=BC=C8=C8=BB=D3=D0=D5=E2=D6=D6=B9=D8=
=CF=B5,=C4=C7=C3=B4=CE=D2=C3=C7=B6=A8=D2=E5f(m)=CE=AA=D3=C3=D5=E2=D0=A9=CA=
=FD=C0=DB=BC=D3=B5=C3m=B5=C4=B7=BD=B7=A8=D7=DC=CA=FD,cash[i]=B1=ED=CA=BE=B5=
=DAi=B8=F6=CA=FD,=CE=D2=C3=C7=BF=C9=D2=D4=CB=B5f(m)=3D=A1=C6f(m-cash[i])(=
i=A1=CA</STRONG><STRONG>{1,2...v}.=BF=C9=D2=D4=D3=C3=B6=AF=CC=AC=B9=E6=BB=
=AE=C7=F3=BD=E2.</STRONG></P>
      =
<P><STRONG>=B1=E0=B3=CC=BD=E2=BE=F6:<BR>=B1=DF=BD=E7=CC=F5=BC=FE=C9=E8f[0=
]=B5=C8=D3=DA1,=CA=B2=C3=B4=C0=DB=BC=D3=B5=C4=B7=BD=B7=A8=CA=FD=CA=C7=D2=BB=
,=C0=DB=BC=D3=B5=C30.<BR>&nbsp;&nbsp;&nbsp;=20
      f[0]=A1=FB1;<BR>&nbsp;&nbsp;&nbsp; for i=A1=FB1 to v=20
      do<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; for =
j=A1=FBcash[i] to n=20
      =
do<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =

      f[j]=A1=FBf[j]+f[j-cash[i]]</STRONG></P>
      <P><STRONG>code:</STRONG></P>
      <P><STRONG>{<BR>TASK:money<BR>LANG:PASCAL<BR>}<BR>program=20
      money;<BR>var<BR>&nbsp;&nbsp;&nbsp; =
n,v:integer;<BR>&nbsp;&nbsp;&nbsp;=20
      cash:array[1.. 25] of integer;<BR>&nbsp;&nbsp;&nbsp; =
f:array[0..10000] of=20
      qword;<BR>procedure init;<BR>var<BR>&nbsp;&nbsp;&nbsp;=20
      i:integer;<BR>begin<BR>&nbsp;&nbsp;&nbsp;=20
      assign(input,'money.in');reset(input);<BR>&nbsp;&nbsp;&nbsp;=20
      readln(v,n);<BR>&nbsp;&nbsp;&nbsp; for i:=3D1 to v do=20
      read(cash[i]);<BR>&nbsp;&nbsp;&nbsp; readln;<BR>&nbsp;&nbsp;&nbsp; =

      close(input);<BR>end;<BR>procedure =
dp;<BR>var<BR>&nbsp;&nbsp;&nbsp;=20
      i,j,k,l:integer;<BR>begin<BR>&nbsp;&nbsp;&nbsp;=20
      assign(output,'money.out');rewrite(output);<BR>&nbsp;&nbsp;&nbsp;=20
      fillchar(f,sizeof(f),0);<BR>&nbsp;&nbsp;&nbsp;=20
      f[0]:=3D1;<BR>&nbsp;&nbsp;&nbsp; for i:=3D1 to v=20
      do<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; for j:=3Dcash[i] =
to n=20
      =
do<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =

      inc(f[j],f[j-cash[i]]);<BR>&nbsp;&nbsp;&nbsp;=20
      writeln(f[n]);<BR>&nbsp;&nbsp;&nbsp;=20
      close(output);<BR>end;<BR>begin<BR>&nbsp;&nbsp;&nbsp;=20
      init;<BR>&nbsp;&nbsp;&nbsp; dp;<BR>end.<BR></STRONG></P><STRONG>
      <HR>
      </STRONG>
      =
<P><STRONG>USACO=B5=C4=B7=D6=CE=F6,=C3=BB=D3=D0=CE=D2=B5=C4=B7=D6=CE=F6=CF=
=EA=BE=A1=B0=A1,o(=A1=C9_=A1=C9)o...=B9=FE=B9=FE</STRONG></P>
      <P><STRONG>We use dynamic programming to count the number of ways =
to make=20
      n cents with the given coins. If we denote the value of the kth =
coin by=20
      c_k, then the recurrence is: </STRONG></P><PRE><STRONG>   nway(n, =
k) =3D no. of ways to make n cents with the first k types of coins
   nway(n, k) =3D nway(n, k-1) + nway(n-c_k, k)
</STRONG></PRE>
      <P><STRONG>This just says the number of ways to make n cents with =
the=20
      first k coins is the number of ways to make n cents using the =
first k-1=20
      coins (i.e., without using the kth coin) plus the number of ways =
to make=20
      n-c_k cents using the first k coins. For the second set of ways, =
we then=20
      add the kth coin to arrive at a total of n cents. </STRONG></P>
      <P><STRONG>We keep track of the number of ways to total "n" cents =
in=20
      "nway", updating the array as we read the value of each coin.=20
</STRONG></P><PRE><STRONG>/*
PROG: money
ID: rsc001
*/

#include &lt;stdio.h&gt;
#include &lt;stdlib.h&gt;
#include &lt;string.h&gt;
#include &lt;assert.h&gt;

#define MAXTOTAL 10000

long long nway[MAXTOTAL+1];

void
main(void)
{
 FILE *fin, *fout;
 int i, j, n, v, c;

 fin =3D fopen("money.in", "r");
 fout =3D fopen("money.out", "w");
 assert(fin !=3D NULL &amp;&amp; fout !=3D NULL);

 fscanf(fin, "%d %d", &amp;v, &amp;n);

 nway[0] =3D 1;
 for(i=3D0; i&lt;v; i++) {
  fscanf(fin, "%d", &amp;c);

  for(j=3Dc; j&lt;=3Dn; j++)
   nway[j] +=3D nway[j-c];
 }

 fprintf(fout, "%lld\n", nway[n]);
}</STRONG></PRE></DIV></TD></TR></TBODY></TABLE><BR>
<DIV class=3Dopt><A =
title=3D=B2=E9=BF=B4=B8=C3=B7=D6=C0=E0=D6=D0=CB=F9=D3=D0=CE=C4=D5=C2=20
href=3D"http://hi.baidu.com/leokan/blog/category/Oi">=C0=E0=B1=F0=A3=BAOi=
</A> | <A=20
href=3D"http://hi.baidu.com/leokan/modify/blog/97e902b376e020a3d8335ae4">=
=B1=E0=BC=AD</A> |=20
<A onclick=3D"return blogdel('blogdelform')"=20
href=3D"http://hi.baidu.com/leokan/blog/item/97e902b376e020a3d8335ae4.htm=
l#">=C9=BE=B3=FD</A>=20

<FORM id=3Dblogdelform style=3D"DISPLAY: none" name=3Dblogdelform=20
action=3D/leokan/commit method=3Dpost><INPUT type=3Dhidden value=3D1 =
name=3Dct><INPUT=20
type=3Dhidden value=3D3 name=3Dcm><INPUT type=3Dhidden =
value=3D97e902b376e020a3d8335ae4=20
name=3DspBlogID><INPUT type=3Dhidden =
value=3Dhttp://hi.baidu.com/leokan/blog=20
name=3DspRefURL></FORM>
<SCRIPT language=3Djavascript>
	<!--

function blogdel(str)
{
	var pop=3Dnew Popup({ =
contentType:3,isReloadOnClose:false,width:340,height:80});
	pop.setContent("title","=C9=BE=B3=FD=CE=C4=D5=C2");
	=
pop.setContent("confirmCon","=C4=FA=C8=B7=B6=A8=D2=AA=B3=B9=B5=D7=C9=BE=B3=
=FD=D5=E2=C6=AA=CE=C4=D5=C2=BC=B0=C6=E4=CB=F9=D3=D0=C6=C0=C2=DB=C2=F0=A3=BF=
");
	pop.setContent("callBack",delCallback);
	pop.setContent("parameter",{fid:str,popup:pop});
	pop.build();
	pop.show();
	return false;
}

function delCallback(para)
{
	var o_pop=3Dpara["popup"];
	o_pop.config.contentType=3D1;
	o_pop.setContent("contentUrl","");
	o_pop.reBuild();
	G(para["fid"]).target=3Do_pop.iframeIdName;
	eval("document."+para["fid"]).submit();
}
	//-->
	</SCRIPT>
| <A =
title=3D=BD=AB=B4=CB=CE=C4=D5=C2=CC=ED=BC=D3=B5=BD=B0=D9=B6=C8=CB=D1=B2=D8=
 onclick=3D"return addToFavor();"=20
href=3D"http://cang.baidu.com/do/add" =
target=3D_blank>=CC=ED=BC=D3=B5=BD=CB=D1=B2=D8</A> | =E4=AF=C0=C0(<SPAN=20
id=3Dresult></SPAN>) | <A=20
href=3D"http://hi.baidu.com/leokan/blog/item/97e902b376e020a3d8335ae4.htm=
l#send">=C6=C0=C2=DB</A>&nbsp;(0)
<SCRIPT language=3Djavascript>
/*<![CDATA[*/
var pre =3D =
[true,'=B0=D9=B6=C8=CB=CD=C1=CB=B8=F6=D3=F2=C3=FB=B8=F8=CE=D2=B1=B8=D3=C3=
......', =
'=B0=D9=B6=C8=CB=CD=C1=CB=B8=F6=D3=F2=C3=FB=B8=F8=CE=D2=B1=B8=D3=C3......=
','/leokan/blog/item/dd922534d20c613f5ab5f530.html'];
var post =3D [true,'USACO 2.3.5 Controlling Companies =
=CC=E2=BD=E2','USACO 2.3.5 Controlling Compan...', =
'/leokan/blog/item/bb434e16a4252c4e20a4e9a0.html'];
if(pre[0] || post[0]){
	document.write('<div =
style=3D"height:5px;line-height:5px;">&nbsp;</div><div id=3D"in_nav">');
	if(pre[0]){
		document.write('=C9=CF=D2=BB=C6=AA=A3=BA<a href=3D"' + pre[3] + '" =
title=3D"' + pre[1] + '">' +  pre[2] + '</a>&nbsp;&nbsp;&nbsp;&nbsp;');
	}
	if(post[0]){
		document.write('=CF=C2=D2=BB=C6=AA=A3=BA<a href=3D"' + post[3] + '" =
title=3D"' + post[1] + '">' +  post[2] + '</a>');
	}
	document.write('</div>');
}
/*]]>*/
</SCRIPT>
 </DIV>
<DIV class=3Dline></DIV>
<STYLE type=3Dtext/css>#in_related_doc A {
	TEXT-DECORATION: none
}
</STYLE>

<DIV id=3Din_related_tmp></DIV>
<SCRIPT language=3Djavascript type=3Dtext/javascript>
/*<![CDATA[*/
function HI_MOD_IN_RELATED_DOC_CALLBACK(arg){
    if(arg.length <=3D 1) return false;
    var hasMore =3D arg[0];
    var D=3Dfunction(A,B){A[A.length]=3DB;}
    if(arg.length % 2 =3D=3D 0) D(arg, ["","","",""]);

    var html =3D ['<div id=3D"in_related_doc"><div =
class=3D"tit">=CF=E0=B9=D8=CE=C4=D5=C2=A3=BA</div>'];
    D(html, '<table cellpadding=3D"0" cellspacing=3D"3" border=3D"0">');
    for(var i =3D 1, j =3D arg.length; i < j; i +=3D 2){
        D(html, '<tr>');
        D(html, '<td width=3D"15px"><a style=3D"font-size:25px" =
>&#8226;</a></td><td><a href=3D"http://hi.baidu.com/' + arg[i][3] + =
'/blog/item/' + arg[i][2] + '.html" target=3D"_blank" title=3D"' + =
arg[i][0] + '">' + arg[i][1] + '</a>');
        D(html, new Array(10).join('\u3000'));
        D(html, '</td>');
        if(arg[i + 1][0] !=3D "")
            D(html, '<td width=3D"15px"><a style=3D"font-size:25px" =
>&#8226;</a></td><td><a href=3D"http://hi.baidu.com/' + arg[i + 1][3] + =
'/blog/item/' + arg[i + 1][2] + '.html" target=3D"_blank" title=3D"' + =
arg[i + 1][0] + '">' + arg[i + 1][1] + '</a></td>');
        else
            D(html, '<td>&nbsp;</td><td>&nbsp;</td>');
        D(html, '</tr>');
    }
    if(hasMore) D(html, '<tr><td colspan=3D"4"><a target=3D"_blank" =
href=3D"/sys/search?pageno=3D1&type=3D7&sort=3D1&word=3DUSACO%202%2E3%2E4=
%20Money%20Systems%20%CC%E2%BD%E2&item=3D97e902b376e020a3d8335ae4">=B8=FC=
=B6=E0&gt;&gt;</a></td></tr>');
    D(html, '</table></div><div class=3D"line">&nbsp;</div>');

    var div =3D document.getElementById('in_related_tmp');
    if(div){
        div.innerHTML =3D html.join('');
        while(div.firstChild){
            div.parentNode.insertBefore(div.firstChild, div);
        }
        div.parentNode.removeChild(div);
    }
}

if(RelatedDocData =3D=3D -1){	// not supported xhr
    var script =3D document.createElement('script');
    script.type =3D 'text/javascript';
    script.src =3D =
'/sys/search?type=3D8&word=3DUSACO%202%2E3%2E4%20Money%20Systems%20%CC%E2=
%BD%E2&item=3D97e902b376e020a3d8335ae4&t=3D' + new Date().getTime();
    document.getElementsByTagName('HEAD')[0].appendChild(script);
}else if(RelatedDocData =3D=3D null){
	GetAndEval =3D true;
}else{
	eval(RelatedDocData);
}

/*]]>*/
</SCRIPT>

<DIV id=3Din_reader>
<DIV class=3Dtit>=D7=EE=BD=FC=B6=C1=D5=DF=A3=BA</DIV>
<SCRIPT>

	var g_spAnnony=3Dfalse;


var g_read=3D[

{}
];
g_read.length=3Dg_read.length-1;

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -