\u4e5d\u5bab\u683c\u7b97\u6cd5\u5b9e\u73b0(Delphi\u7248\u672c)<\/title><\/head><body><\/p>\n<h1 style=\"display:none\">\u4e5d\u5bab\u683c\u7b97\u6cd5\u5b9e\u73b0(Delphi\u7248\u672c)<\/h1>\n<div>\n\u53d1\u73b0\u7528Delphi\u5199\u51fa\u6765\u7684\u6bd4\u7528C\u5199\u51fa\u6765\u7684\u8ba1\u7b97\u5feb\u591a\u4e86\u3002<\/p>\n<pre class=\"Delphi\"><pre>program<\/strong><\/font> Project1;\n{$APPTYPE CONSOLE}<\/font>\n\nuses<\/strong><\/font>\n SysUtils, PerlRegEx, classes;\n\nvar<\/strong><\/font>\n GG: array<\/strong><\/font>[0<\/font>..8<\/font>] of<\/strong><\/font> array<\/strong><\/font>[0<\/font>..8<\/font>] of<\/strong><\/font> Integer;\nconst<\/strong><\/font>\n QQ:array<\/strong><\/font>[0<\/font>..8<\/font>] of<\/strong><\/font> integer=(0<\/font>,0<\/font>,0<\/font>,3<\/font>,3<\/font>,3<\/font>,6<\/font>,6<\/font>,6<\/font>);\n\nprocedure<\/strong><\/font> SetGG;\nvar<\/strong><\/font>\n f: TextFile;\n n, m: Integer;\n Reg: TPerlRegEx;\n List: TStrings;\n s: string<\/strong><\/font>;\nbegin<\/strong><\/font>\n Reg:=TPerlRegEx.Create(nil<\/strong><\/font>);\n List:=TStringList.Create;\n s:=''<\/font>; n:=0<\/font>;\n AssignFile(f,'data.txt'<\/font>);\n Reset(f);\n while<\/strong><\/font> not<\/strong><\/font> eof(f) do<\/strong><\/font>\n begin<\/strong><\/font>\n Readln(f,s); s:=trim(s);\n if<\/strong><\/font> not<\/strong><\/font> (s=''<\/font>) then<\/strong><\/font>\n begin<\/strong><\/font>\n reg.Subject := s;\n reg.RegEx := ' *'<\/font>;\n reg.Split(list,MaxInt);\n for<\/strong><\/font> m := 0<\/font> to<\/strong><\/font> 8<\/font> do<\/strong><\/font>\n begin<\/strong><\/font>\n GG[n,m]:=strtoint(list[m]);\n end<\/strong><\/font>;\n n:=n+1<\/font>;\n end<\/strong><\/font>;\n list.Clear;\n end<\/strong><\/font>;\n list.Free;\n closefile(f);\nend<\/strong><\/font>;\n\nprocedure<\/strong><\/font> OutGG;\nvar<\/strong><\/font>\n I: Integer;\n j: Integer;\nbegin<\/strong><\/font>\n for<\/strong><\/font> I := 0<\/font> to<\/strong><\/font> 9<\/font> - 1<\/font> do<\/strong><\/font>\n for<\/strong><\/font> j := 0<\/font> to<\/strong><\/font> 9<\/font> - 1<\/font> do<\/strong><\/font>\n if<\/strong><\/font> (j<>8<\/font>) then<\/strong><\/font> Write(IntToStr(GG[i,j])+' '<\/font>) else<\/strong><\/font> Writeln(GG[i,j]);\n Readln(i);\nend<\/strong><\/font>;\n\nfunction<\/strong><\/font> IsValid(i,j:integer):boolean;\nvar<\/strong><\/font> n,t,u:integer;\nbegin<\/strong><\/font>\n Result:=true;\n n:=GG[i,j];\n for<\/strong><\/font> t := 0<\/font> to<\/strong><\/font> 9<\/font> - 1<\/font> do<\/strong><\/font>\n if<\/strong><\/font>(((t<>i) and<\/strong><\/font> (GG[t,j]=n)) or<\/strong><\/font> ((t<>j) and<\/strong><\/font> (GG[i,t]=n))) then<\/strong><\/font> result:=false;\n\n for<\/strong><\/font> t := QQ[i] to<\/strong><\/font> QQ[i]+2<\/font> do<\/strong><\/font>\n for<\/strong><\/font> u := QQ[j] to<\/strong><\/font> QQ[j] +2<\/font> do<\/strong><\/font>\n if<\/strong><\/font>(((t<>i) or<\/strong><\/font> (u<>j)) and<\/strong><\/font> (GG[t,u]=n)) then<\/strong><\/font> result:=false;\nend<\/strong><\/font>;\n\nprocedure<\/strong><\/font> calc(n:integer);\nvar<\/strong><\/font> i,j,k:integer;\nbegin<\/strong><\/font>\n if<\/strong><\/font>(n=81<\/font>) then<\/strong><\/font>\n begin<\/strong><\/font>\n OutGG;\n Exit;\n end<\/strong><\/font>;\n\n i:=n div<\/strong><\/font> 9<\/font>; j:=n mod<\/strong><\/font> 9<\/font>;\n\n if<\/strong><\/font>(GG[i,j]<>0<\/font>) then<\/strong><\/font>\n begin<\/strong><\/font>\n calc(n+1<\/font>);\n exit;\n end<\/strong><\/font>;\n\n for<\/strong><\/font> k := 0<\/font> to<\/strong><\/font> 9<\/font> - 1<\/font> do<\/strong><\/font>\n begin<\/strong><\/font>\n GG[i,j]:=GG[i,j]+1<\/font>;\n if<\/strong><\/font>(IsValid(i,j)) then<\/strong><\/font>\n begin<\/strong><\/font>\n calc(n+1<\/font>);\n end<\/strong><\/font>;\n end<\/strong><\/font>;\n\n GG[i,j]:=0<\/font>;\n\nend<\/strong><\/font>;\n\nbegin<\/strong><\/font>\n SetGG;\n calc(0<\/font>);\n OutGG;\nend<\/strong><\/font>.<\/pre>\n<\/div>\n<\/body><\/html><\/p>\n","protected":false},"excerpt":{"rendered":"\u4e5d\u5bab\u683c\u7b97\u6cd5\u5b9e\u73b0(Delphi\u7248\u672c) \u4e5d\u5bab\u683c\u7b97\u6cd5\u5b9e\u73b0(Delphi\u7248\u672c) \u53d1\u73b0\u7528Delphi\u5199\u51fa\u6765\u7684\u6bd4\u7528C\u5199\u51fa\u6765 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[6],"tags":[],"class_list":["post-603","post","type-post","status-publish","format-standard","hentry","category-code_related"],"_links":{"self":[{"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/posts\/603","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/comments?post=603"}],"version-history":[{"count":0,"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/posts\/603\/revisions"}],"wp:attachment":[{"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/media?parent=603"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/categories?post=603"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/tags?post=603"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}

{"id":603,"date":"2009-08-31T22:09:00","date_gmt":"2009-08-31T02:09:00","guid":{"rendered":""},"modified":"2009-08-31T22:09:00","modified_gmt":"2009-08-31T02:09:00","slug":"","status":"publish","type":"post","link":"https:\/\/kyle.ai\/blog\/603.html","title":{"rendered":"\u4e5d\u5bab\u683c\u7b97\u6cd5\u5b9e\u73b0(Delphi\u7248\u672c)"},"content":{"rendered":"