tag:blogger.com,1999:blog-5960836988659640122.post7099364961980081026..comments2024-03-27T20:35:49.022+07:00Comments on Code Pascal - Bai tap Pascal - Hoc Pascal truc tuyen - Tin hoc 11: Dãy số Fibonacci và bài toán nuôi thỏĐô Rê Mon ĐZhttp://www.blogger.com/profile/15083814602565259047noreply@blogger.comBlogger6125tag:blogger.com,1999:blog-5960836988659640122.post-36711011011739443332019-03-04T22:02:35.925+07:002019-03-04T22:02:35.925+07:00{$R+,Q+,B-}
uses crt;
const
fi='D:\{tuy ch...{$R+,Q+,B-}<br /><br />uses crt;<br /><br />const<br /> fi='D:\{tuy chinh}\dulieuchinh\lazarus\phaithumuc\GREEND.INP';<br /> fo='D:\{tuy chinh}\dulieuchinh\lazarus\phaithumuc\GREEND.OUT';<br /> nmax=100;<br />var<br /> f: text;<br /> a: array[1..nmax,1..nmax] of byte;<br /> temp,c: array[1..nmax,1..nmax] of integer;<br /> code: array[1..nmax] of integer;<br /> fx,fy: array[1..nmax] of integer;<br /> p,q,qu,trx,trys: array[1..nmax] of integer;<br /> first,clast: integer;<br /> n,num,cc:integer;<br /> tcp: longint;<br /> found:boolean;<br />procedure kt_queue;<br />begin<br /> first:=1; clast:=0;<br />end;<br />procedure them(x: integer);<br />begin<br /> inc(clast);<br /> qu[clast]:=x;<br />end;<br />function lay: integer;<br />begin<br /> lay:=qu[first];<br /> inc(first);<br />end;<br />procedure nhap;<br />var i,j: integer;<br /> begin<br /> assign(f,fi); reset(f);<br /> readln(f,n);<br /> for i:=1 to n do<br /> read(f,code[i]);<br /> while not seekeof(f) do<br />begin<br /> read(f,i,j);<br /> a[i,j]:=1;<br /> a[j,i]:=1;<br />end;<br /> close(f);<br />end;<br />procedure tinhc;<br />var i,j,k: integer;<br />begin<br /> for i:=1 to n do<br /> for j:=1 to n do<br /> if a[i,j]=0 then temp[i,j]:=maxint div 2<br /> else temp[i,j]:=a[i,j];<br /> for i:=1 to n do temp[i,i]:=0;<br /> for k:=1 to n do<br /> for i:=1 to n do<br /> for j:=1 to n do<br /> if (temp[i,j]>temp[i,k]+temp[k,j])<br /> then<br /> temp[i,j]:=temp[i,k]+temp[k,j];<br /> for i:=1 to n do<br /> for j:=1 to n do<br /> c[i,j]:=-temp[code[i],j];<br />end;<br />procedure tinhfxfy;<br />var i,j: integer;<br />begin<br /> fillchar(fy,sizeof(fy),0);<br /> for i:=1 to n do<br /> begin<br /> fx[i]:=-maxint div 2;<br /> for j:=1 to n do<br /> if fx[i]p[i])and(fx[i]+fy[j]=c[i,j]) then<br />begin<br /> trys[j]:=i;<br /> if q[j]=0 then begin found:=true; cc:=j;<br /> exit;<br /> end<br /> else xuly(j);<br /> end;<br /> end;<br /> end;<br />procedure tang;<br />var i,j,k: integer;<br />begin<br /> k:=cc;<br /> repeat<br /> j:=k;<br /> i:=trys[j];<br /> k:=p[i];<br /> p[i]:=j;<br /> q[j]:=i;<br /> until k=0;<br /> inc(num);<br />end;<br />procedure sunhan;<br />var min,i,j: integer;<br />begin<br /> min:=maxint div 2;<br /> for i:=1 to n do<br /> if trx[i]<>0 then<br /> for j:=1 to n do<br /> if (trys[j]=0) and (min>fx[i]+fy[j]-c[i,j]) then<br /> min:=fx[i]+fy[j]-c[i,j];<br /> for i:=1 to n do<br /> if trx[i]<>0 then fx[i]:=fx[i]-min;<br /> for j:=1 to n do<br /> if trys[j]<>0 then fy[j]:=fy[i]+min;<br />end;<br />procedure tinhkq;<br />var i: integer;<br />begin<br /> tcp:=0;<br /> for i:=1 to n do inc(tcp,c[i,p[i]]);<br />end;<br />procedure dieukien;<br />begin<br /> repeat<br /> chbitim;<br /> timduong;<br /> if found then tang else sunhan;<br /> until num=n;<br /> tinhkq;<br />end;<br />procedure inkg;<br />var i: integer;<br />begin<br /> assign(f,fo); rewrite(f);<br /> writeln(f,abs(tcp));<br /> close(f);<br />end;<br />begin<br /> nhap;<br /> chuanbi;<br /> dieukien; {xongbai}<br /> inkg;<br />end. herobraihttps://www.blogger.com/profile/13978284157115692193noreply@blogger.comtag:blogger.com,1999:blog-5960836988659640122.post-83220125533816553332019-03-04T21:59:24.752+07:002019-03-04T21:59:24.752+07:00rat hayrat hayherobraihttps://www.blogger.com/profile/13978284157115692193noreply@blogger.comtag:blogger.com,1999:blog-5960836988659640122.post-55231063763111677262016-02-15T08:33:51.858+07:002016-02-15T08:33:51.858+07:00Nhận xét này đã bị tác giả xóa.Anonymoushttps://www.blogger.com/profile/05147244750763439382noreply@blogger.comtag:blogger.com,1999:blog-5960836988659640122.post-60622607331159397202014-06-23T20:33:54.680+07:002014-06-23T20:33:54.680+07:00cho mình hỏi luôn: Cho trước số tự nhiên N, hãy tì...cho mình hỏi luôn: Cho trước số tự nhiên N, hãy tìm biểu diễn Fibonaci của số N.Anonymoushttps://www.blogger.com/profile/03500723083614653078noreply@blogger.comtag:blogger.com,1999:blog-5960836988659640122.post-44290290155322308242014-03-03T22:33:04.251+07:002014-03-03T22:33:04.251+07:00bạn ơi cho mình hỏi bài toán này sử dụng giải thuậ...bạn ơi cho mình hỏi bài toán này sử dụng giải thuật nào trong các giải thuật sau vậy<br />-giảm để trị<br />-quay lui<br />-vét cạnAnonymoushttps://www.blogger.com/profile/15755767696361979630noreply@blogger.comtag:blogger.com,1999:blog-5960836988659640122.post-89670398466136000842013-03-16T01:57:42.108+07:002013-03-16T01:57:42.108+07:00Keep this going please, great job!
Feel free to v...Keep this going please, great job!<br /><br />Feel free to visit my weblog <a href="http://community.iblse.com/index.php?do=/blog/55458/life-before-plus-after-bankruptcy/" rel="nofollow">bankruptcy florida</a>Anonymousnoreply@blogger.com