数独计算器是怎么编出来的
\u7528\u7b80\u5355\u660e\u4e86\u7684\u8bed\u8a00\u544a\u8bc9\u6211 \u6570\u72ec\u8ba1\u7b97\u5668 \u662f\u4ec0\u4e48 \u600e\u4e48\u7528\u6570\u72ec\uff0c\u662f\u4e00\u79cd\u6e90\u81ea18\u4e16\u7eaa\u672b\u7684\u745e\u58eb\uff0c\u540e\u5728\u7f8e\u56fd\u53d1\u5c55\u3001\u5e76\u5728\u65e5\u672c\u5f97\u4ee5\u53d1\u626c\u5149\u5927\u7684\u6570\u5b57\u8c1c\u9898\u3002\u6570\u72ec\u76d8\u9762\u662f\u4e2a\u4e5d\u5bab\uff0c\u6bcf\u4e00\u5bab\u53c8\u5206\u4e3a\u4e5d\u4e2a\u5c0f\u683c\u3002\u5728\u8fd9\u516b\u5341\u4e00\u683c\u4e2d\u7ed9\u51fa\u4e00\u5b9a\u7684\u5df2\u77e5\u6570\u5b57\u548c\u89e3\u9898\u6761\u4ef6\uff0c\u5229\u7528\u903b\u8f91\u548c\u63a8\u7406\uff0c\u5728\u5176\u4ed6\u7684\u7a7a\u683c\u4e0a\u586b\u51651-9\u7684\u6570\u5b57\u3002\u4f7f1-9\u6bcf\u4e2a\u6570\u5b57\u5728\u6bcf\u4e00\u884c\u3001\u6bcf\u4e00\u5217\u548c\u6bcf\u4e00\u5bab\u4e2d\u90fd\u53ea\u51fa\u73b0\u4e00\u6b21\u3002\u8fd9\u79cd\u6e38\u620f\u5168\u9762\u8003\u9a8c\u505a\u9898\u8005\u89c2\u5bdf\u80fd\u529b\u548c\u63a8\u7406\u80fd\u529b\uff0c\u867d\u7136\u73a9\u6cd5\u7b80\u5355\uff0c\u4f46\u6570\u5b57\u6392\u5217\u65b9\u5f0f\u5374\u5343\u53d8\u4e07\u5316\uff0c\u6240\u4ee5\u4e0d\u5c11\u6559\u80b2\u8005\u8ba4\u4e3a\u6570\u72ec\u662f\u8bad\u7ec3\u5934\u8111\u7684\u7edd\u4f73\u65b9\u5f0f\u3002
\u89c4\u5219
\u6807\u51c6\u6570\u72ec\u7684\u89c4\u5219\u4e3a\uff1a\u6570\u72ec\u6bcf\u884c\u3001\u6bcf\u5217\u53ca\u6bcf\u5bab\u586b\u5165\u6570\u5b571-9\u4e14\u4e0d\u80fd\u91cd\u590d\u3002
\u7f16\u8f91\u672c\u6bb5\u57fa\u672c\u89e3\u6cd5\u4e3e\u4f8b
\u6570\u72ec\u89e3\u6cd5\u5168\u662f\u7531\u89c4\u5219\u884d\u751f\u51fa\u6765\u7684\uff0c\u57fa\u672c\u89e3\u6cd5\u5206\u4e3a\u4e24\u7c7b\u601d\u8def\uff0c\u4e00\u7c7b\u4e3a\u6392\u9664\u6cd5\uff0c\u4e00\u7c7b\u4e3a\u552f\u4e00\u6cd5\u3002\u66f4\u590d\u6742\u7684\u89e3\u6cd5\uff0c\u6700\u7ec8\u4e5f\u4f1a\u5f52\u7ed3\u5230\u8fd9\u4e24\u5927\u7c7b\u4e2d\u3002 \u4e0b\u8fb9\u4ee5\u56fe\u793a\u7b80\u5355\u4ecb\u7ecd\u51e0\u79cd\u89e3\u6cd5\uff0c\u53ea\u8981\u4f60\u82b1\u51e0\u5206\u949f\u770b\u4e00\u904d\uff0c\u9a6c\u4e0a\u5c31\u53ef\u4ee5\u5f00\u59cb\u505a\u6570\u72ec\u4e86\u3002
\u57fa\u7840\u6452\u9664\u6cd5
\u57fa\u7840\u6452\u9664\u6cd5\u5c31\u662f\u5229\u75281 \uff5e 9 \u7684\u6570\u5b57\u5728\u6bcf\u4e00\u884c\u3001\u6bcf\u4e00\u5217\u3001\u6bcf\u4e00\u5bab\u90fd\u53ea\u80fd\u51fa\u73b0\u4e00\u6b21\u7684\u89c4\u5219\u8fdb\u884c\u89e3\u9898\u7684\u65b9\u6cd5\u3002\u57fa\u7840\u6452\u9664\u6cd5\u53ef\u4ee5\u5206\u4e3a\u884c\u6452\u9664\u3001\u5217\u6452\u9664\u3001\u4e5d\u5bab\u683c\u6452\u9664\u3002 \u5b9e\u9645\u5bfb\u627e\u89e3\u7684\u8fc7\u7a0b\u4e3a\uff1a \u5bfb\u627e\u4e5d\u5bab\u683c\u6452\u9664\u89e3\uff1a\u627e\u5230\u4e86\u67d0\u6570\u5728\u67d0\u4e00\u4e2a\u4e5d\u5bab\u683c\u53ef\u586b\u5165\u7684\u4f4d\u7f6e\u53ea\u4f59\u4e00\u4e2a\u7684\u60c5\u5f62\uff1b\u610f\u5373\u627e\u5230\u4e86 \u8be5\u6570\u5728\u8be5\u4e5d\u5bab\u683c\u4e2d\u7684\u586b\u5165\u4f4d\u7f6e\u3002 \u5bfb\u627e\u5217\u6452\u9664\u89e3\uff1a\u627e\u5230\u4e86\u67d0\u6570\u5728\u67d0\u5217\u53ef\u586b\u5165\u7684\u4f4d\u7f6e\u53ea\u4f59\u4e00\u4e2a\u7684\u60c5\u5f62\uff1b\u610f\u5373\u627e\u5230\u4e86\u8be5\u6570\u5728\u8be5\u5217\u4e2d\u7684\u586b\u5165\u4f4d\u7f6e\u3002 \u5bfb\u627e\u884c\u6452\u9664\u89e3\uff1a\u627e\u5230\u4e86\u67d0\u6570\u5728\u67d0\u884c\u53ef\u586b\u5165\u7684\u4f4d\u7f6e\u53ea\u4f59\u4e00\u4e2a\u7684\u60c5\u5f62\uff1b\u610f\u5373\u627e\u5230\u4e86\u8be5\u6570\u5728\u8be5\u884c\u4e2d\u7684\u586b\u5165\u4f4d\u7f6e\u3002 \u57fa\u7840\u6452\u9664\u6cd5\u7684\u63d0\u5347\u65b9\u6cd5\u662f\u533a\u5757\u6452\u9664\u6cd5,\u662f\u76f4\u89c2\u6cd5\u4e2d\u4f7f\u7528\u9891\u7387\u6700\u9ad8\u7684\u65b9\u6cd5\u4e4b\u4e00.
\u6b64\u5916\u8fd8\u6709\u5f88\u591a\uff0c\u5982\u552f\u4e00\u89e3\u6cd5\uff0c\u4e0d\u4e00\u4e00\u5217\u4e3e\u4e86\uff0c\u8be6\u7ec6\u7684\u8bf7\u770b\u94fe\u63a5
\u6211\u8fd9\u91cc\u6709\u4e00\u4e2avb\u5199\u7684\uff0c\u8981\u6c42\u662f\u4e00\u6837\u7684\uff0c\uff08\u8bf4\u5b9e\u5728\u7684\u5c31\u662f\u6309\u90a3\u4e2a\u60f3\u6cd5\u5199\u7684\uff09\uff0c\u81ea\u5df1\u7528\u4e86\u4e24\u5468\u7684\u4e1a\u4f59\u65f6\u95f4\u5199\u7684\uff0c\u5475\u5475\u9700\u8981\u7684\u8bdd\u8054\u7cfb\u6211\uff0c\uff08\u4e0d\u77e5\u4ec0\u4e48\u9ad8\u624b\u53ef\u4ee5\u5728\u6570\u72ec\u535a\u58eb\u4e0a\u4fee\u6539\u6e90\u4ee3\u7801\uff0c\u5475\u5475\u6211\u8fd8\u60f3\u5462\u6709\u7684\u8bdd\u8054\u7cfb\u6211\uff09273047005
\u6709\u4e00\u70b9\uff0c\u4f60\u8981\u662f\u8ba1\u7b97\u51fa\u4e86\u6570\u72ec\uff0c\u90a3\u5c31\u6ca1\u6709\u7b97\u51fa\u6765\u7684\u4e50\u8da3\u4e86
可以文件输入（用编译好的程序打开文件），亦可键盘输入。
用打过CRT补丁的Turbo Pascal编译，或使用Free Pascal(这个不保证正常)
样例没有超时，但对于特殊数据可能超时（我还没有数据，自己写得太简单，但是，特殊数据基本不会不超过0.01s）
程序如下：
program sdjsq;{数独解算器}
{-------------调用库------------------------------------------------USES}
uses CRT,Dos;{使用CRT Dos库}
{-------------数据类型定义------------------------------------------TYPE}
type
sz=0..9;{数字，byte类型的子界占一byte}
sy=1..9;{same as sz}
sd=array [sy,sy] of sz;{数独，占8×8×1byte=81byte}
ss=set of sy;{数字的集合}
dot=
record
s:ss;
n,x,y:byte;
end;
{-------------变量定义-----------------------------------------------VAR}
var
a:sd;
x,y:byte;
list:record
num:byte;
dat:array [1..81] of dot;
end;
{=============打印边框============================================PRINTK}
procedure printk;
var
i, k : byte;
flag : boolean;
begin
gotoxy(1,1);textcolor(15);textbackground(0);
write(#218);for k:=1 to 8 do write(#196#194);writeln(#196#191);
for i := 1 to 9 do begin
write(#179);for k:=1 to 9 do begin
textbackground(1-ord(((i-1) div 3+(k-1) div 3) mod 2=0));
write(#32);textbackground(0);write(#179);
end;
writeln;
if i<>9 then begin
write(#195);for k:=1 to 8 do write(#196#197);writeln(#196#180);
end;
end;
write(#192);for k:=1 to 8 do write(#196#193);writeln(#196#217);
gotoxy(1,1);
end;
{=============可以填的数==============================================KY}
procedure ky(a:sd;x,y:byte;var s:ss);
var
i,j:byte;
begin
s:=[1,2,3,4,5,6,7,8,9];
for i:=1 to 9 do if i<>x then s:=s-[a[i,y]];
for i:=1 to 9 do if i<>y then s:=s-[a[x,i]];
for i:=1 to 3 do for j:=1 to 3 do
if ((x-1)div 3*3+i<>x) and ((y-1)div 3*3+j<>y)
then s:=s-[a[(x-1)div 3*3+i,(y-1)div 3*3+j]];
s:=s-[0];
end;
{=============打印数据=============================================PRINT}
procedure print(xn,yn,color:byte);
begin
gotoxy(2*xn,2*yn);
textcolor(color);
textbackground(5+ord(not ((x=xn)and(y=yn)))*(-4-ord(((xn-1) div 3+(yn-1) div 3) mod 2=0)));
if a[xn,yn]<>0 then write(a[xn,yn]) else write(#32);
gotoxy(1,1);
end;
{=============用键盘读入数据===========================INPUT BY KEYBOARD}
procedure inputbkb(var a:sd);
label 1;
var
xi,yi:byte;
c:char;
s:ss;i:byte;
begin
printk;
fillchar(a,sizeof(a),0);x:=1;y:=1;print(1,1,0);
textcolor(15);textbackground(0);
s:=[1..9];gotoxy(1,20);for i:=1 to 9 do write(i:2);
repeat
c:=readkey;
xi:=x;yi:=y;
case c of
(*#13{Enter}, #27{Esc}*)
#27:halt;
(*#72{Up}, #75{Left}, #77{Right}, #80{Down}*)
#0:begin
c:=readkey;
case c of
#75:if x<>1 then x:=x-1 else write('');
#72:if y<>1 then y:=y-1 else write('');
#80:if y<>9 then y:=y+1 else write('');
#77:if x<>9 then x:=x+1 else write('');
#83:a[x,y]:=0;
end;
end;
#48..#58:if (ord(c)-48 in s) or (c=#48)
then a[x,y]:=ord(c)-48 else write('');
end;
print(xi,yi,12);print(x,y,12);
ky(a,x,y,s);
gotoxy(1,20);
textcolor(15);textbackground(0);delline;
for i:=1 to 9 do if i in s then write(i:2);
until c=#13;
x:=0;y:=0;print(xi,yi,12);
end;
procedure noans;
begin
gotoxy(1,20);
textbackground(0);delline;textcolor(143);
write('No answer!');
readkey;
halt;
end;
{=============用文件读入数据===============================INPUT BY FILE}
procedure inputbf(var a:sd;const path:string);
function Exist(Path:string):boolean;
var
S: PathStr;
begin
S := FSearch(Path, GetEnv(''));
Exist := S <> '';
end;
var
x,y:byte;
c:char;
f:text;
begin
if not exist(path) then begin
inputbkb(a);
end else begin
assign(f,path);reset(f);printk;
for y:=1 to 9 do begin
for x:=1 to 9 do begin
read(f,c);
if not (c in [#48..#58,#32]) then begin
inputbkb(a);exit;
end;
if c=#32 then a[x,y]:=0 else a[x,y]:=ord(c)-48;print(x,y,12);
end;
readln(f);
end;
end;
end;
{=============填入固定数据============================================TC}
procedure tc;
var
x,y,i,t,n,f:byte;
s:ss;
function tct:byte;
var
i,j,k,l:byte;
s1,s2,s3:ss;
n1,n2,n3:array [1..9] of byte;
begin
tct:=0;
for i:=1 to 9 do begin
fillchar(n1,sizeof(n1),0);fillchar(n3,sizeof(n3),0);fillchar(n2,sizeof(n2),0);
for j:=1 to 9 do begin
ky(a,i,j,s);if a[i,j]<>0 then begin s:=[a[i,j]]; n1[a[i,j]]:=10; end;
for k:=1 to 9 do if k in s then if n1[k]=0 then n1[k]:=j else n1[k]:=10;
ky(a,j,i,s);if a[j,i]<>0 then begin s:=[a[j,i]]; n2[a[j,i]]:=10; end;
for k:=1 to 9 do if k in s then if n2[k]=0 then n2[k]:=j else n2[k]:=10;
ky(a,((i-1) mod 3)*3+((j-1) mod 3+1),((i-1) div 3)*3+((j-1) div 3+1),s);
if a[((i-1) mod 3)*3+((j-1) mod 3+1),((i-1) div 3)*3+((j-1) div 3+1)]<>0 then begin
s:=[a[((i-1) mod 3)*3+((j-1) mod 3+1),((i-1) div 3)*3+((j-1) div 3+1)]];
n3[a[((i-1) mod 3)*3+((j-1) mod 3+1),((i-1) div 3)*3+((j-1) div 3+1)]]:=10;
end;
for k:=1 to 9 do if k in s then if n3[k]=0 then n3[k]:=j else n3[k]:=10;
end;
for k:=1 to 9 do begin
j:=n1[k];
if j in [1..9] then begin
a[i,j]:=k;print(i,j,6);tct:=1;exit;
end;
end;
for k:=1 to 9 do begin
j:=n2[k];
if j in [1..9] then begin
a[j,i]:=k;print(j,i,6);tct:=1;exit;
end;
end;
for k:=1 to 9 do begin
j:=n3[k];
if j in [1..9] then begin
a[((i-1) mod 3)*3+((j-1) mod 3+1),((i-1) div 3)*3+((j-1) div 3+1)]:=k;
print(((i-1) mod 3)*3+((j-1) mod 3+1),((i-1) div 3)*3+((j-1) div 3+1),6);
tct:=1;exit;
end;
end;
end;
end;
procedure check;
var
i,j,k:byte;
s,s1,s2,s3:ss;
begin
for i:=1 to 9 do begin
s1:=[];s2:=[];s3:=[];
for j:=1 to 9 do begin
if a[i,j]=0 then begin ky(a,i,j,s);s1:=s1+s; end else s1:=s1+[a[i,j]];
if a[j,i]=0 then begin ky(a,j,i,s);s2:=s2+s; end else s2:=s2+[a[j,i]];
if a[((i-1) mod 3)*3+((j-1) mod 3+1),((i-1) div 3)*3+((j-1) div 3+1)]=0 then begin
ky(a,((i-1) mod 3)*3+((j-1) mod 3+1),((i-1) div 3)*3+((j-1) div 3+1),s);s3:=s3+s;
end else s3:=s3+[a[((i-1) mod 3)*3+((j-1) mod 3+1),((i-1) div 3)*3+((j-1) div 3+1)]];
end;
for j:=1 to 9 do begin
if not (j in s1) then noans;
if not (j in s2) then noans;
if not (j in s3) then noans;
end;
end;
end;
begin
repeat
f:=0;
for x:=1 to 9 do
for y:=1 to 9 do
if a[x,y]=0 then begin
ky(a,x,y,s);t:=0;
if s=[] then
noans;
for i:=1 to 9 do if i in s then begin
t:=t+1;n:=i;
end;
if t=1 then begin a[x,y]:=n;print(x,y,14);f:=f+1; end;
end;
f:=f+tct;check;
until f=0;
end;
{=============递归求解===============================================TRY}
function answer:boolean;
var
ans:boolean;
procedure try(num:byte);
var
i,j,n,x,y:byte;
s:ss;
begin
if keypressed then case readkey of #27:halt;#0:if readkey=#107 then halt; end;
if num<=list.num then begin
x:=list.dat[num].x;y:=list.dat[num].y;
ky(a,x,y,s);if s=[] then exit;
n:=random(8)+1;
for j:=n to n+8 do begin
i:=j mod 9+1;
if i in s then begin
a[x,y]:=i;print(x,y,10);
try(num+1);
a[x,y]:=0;print(x,y,0)
end
end
end else begin
gotoxy(1,20);textcolor(15);textbackground(0);delline;write('Complete!');answer:=true;ans:=true;
case readkey of #27:halt;#0:if readkey=#107 then halt; end;
textcolor(15);textbackground(0);gotoxy(1,20);delline;writeln('Trying...');
end;
end;
begin
answer:=false;ans:=false;
try(1)
end;
procedure crtinit;
var
OrigMode: Word;
begin
OrigMode:=LastMode; { Remember original video mode }
TextMode(Lo(LastMode)+Font8x8); { use 43 or 50 lines on EGA/VGA }
end;
procedure px;
var
l:array [1..9] of record
num:byte;
dat:array [1..81] of dot;
end;
i,j,k:byte;
d:dot;
begin
for i:=1 to 9 do l[i].num:=0;
for i:=1 to 9 do for j:=1 to 9 do if a[i,j]=0 then begin
d.x:=i;d.y:=j;ky(a,i,j,d.s);d.n:=0;for k:=1 to 9 do if k in d.s then inc(d.n);
inc(l[d.n].num);l[d.n].dat[l[d.n].num]:=d;
end;
list.num:=0;
for i:=1 to 9 do for j:=1 to l[i].num do begin
inc(list.num);list.dat[list.num]:=l[i].dat[j];
end;
end;
begin
randomize;
crtinit;
textbackground(0);clrscr;
if ParamCount=0 then inputbkb(a) else inputbf(a,ParamStr(1));
textcolor(15);textbackground(0);gotoxy(1,20);delline;writeln('Thinking...');tc;
textcolor(15);textbackground(0);gotoxy(1,20);delline;writeln('Checking...');px;
textcolor(15);textbackground(0);gotoxy(1,20);delline;writeln('Trying...');gotoxy(1,1);
if not answer then noans;
textcolor(15);textbackground(0);gotoxy(1,20);delline;writeln('That''s all!');readkey;
end.
用不同的程序语言编写出来的咯.
百度上有人用PASCAL编写了个很不错的数独程序,你有兴趣可以去看看.
http://zhidao.baidu.com/question/33417315.html
绛旓細鏈绠鍗曟渶甯哥敤鐨勯兘鏄節瀹牸鏁扮嫭锛岀敱姝ゆ紨鍙鍑烘潵鐨杩樻洿澶氾紝鎴戜滑灏辫鏈鍩烘湰鐨勶紝瑙勫垯灏卞嚑涓瓧锛氭瘡琛屻佹瘡鍒楀強姣忓濉叆鏁板瓧1-9涓斾笉鑳介噸澶嶃傜粰浣犳彁渚涗竴涓浘鐗囷紝鍥句腑绌虹己鐨勫湴鏂瑰氨鏄浣犳寜鐓ц繖涓鍒欏幓瑙ｇ瓟闂鐨勶紝鏁扮嫭璁＄畻鍣灏辨槸鎸夌収瑙ｉ鍐欏ソ鐨勭▼搴忔潵姹傝В绫讳技鏁扮嫭棰樼洰鐨勩
绛旓細瀵逛簬10鍙充笂瑙26鐨勬墦娉曪紝棣栧厛闇瑕佹槑纭繖鏄竴涓暟鐙父鎴忎腑鐨勬搷浣溿鏁扮嫭鏄涓涓～鏁板瓧鐨勯昏緫娓告垙锛屾父鎴忛潰鏉挎槸鐢9x9鐨勬牸瀛愮粍鎴愮殑銆傛瘡涓琛屻佹瘡涓鍒椾互鍙婃瘡涓涓3x3鐨勪節瀹牸鍐呴兘涓嶈兘閲嶅鍑虹幇鏁板瓧1-9锛岀洰鏍囨槸灏嗘墍鏈夌┖鏍煎～婊°傚湪鏁扮嫭娓告垙涓紝10鍙充笂瑙26鐨勬墦娉曟槸鎸囧皢鏁板瓧10濉叆鍙充笂瑙掔殑浣嶇疆锛岀劧鍚庡皢鏁板瓧26鍒嗗埆...
绛旓細鎵撳紑銆鏁扮嫭璁＄畻鍣銆戝悗锛屽湪鏂规涓牴鎹綘鐨勯鐩緭鍏ワ紝鐢ㄩ紶鏍囧湪绌烘牸涓婄偣涓涓嬶紝鑰屽悗鎸夐敭鐩樿緭鍏ャ傜瓑浣犵殑棰樼洰绮惧噯杈撳叆杩涘幓鍚庯紝鐐瑰嚮銆愯В棰樸戯紝灏卞嚭鐜扮瓟妗堜簡銆
绛旓細浣犺繖涓富瑕佺敤鍩烘湰鐨勬帓闄ゆ硶灏卞彲浠ヨВ鍐充簡锛岀被浼间笅鍥撅紝绾㈣壊鐨2涓7鐨勫瓨鍦紝榛勫簳鐨2涓í鎺掗兘涓嶈兘鏈7锛屾墍浠ヤ腑闂翠竴涓鐨7灏卞彧鑳藉湪绾㈠簳浣嶇疆锛氬悓鏍蜂篃鍙互鐞嗚В涓猴紝绗5妯帓鐨7鍙兘鍦ㄨ繖涓綅缃細瀹屾垚濡傚浘锛氭洿澶氭柟娉曚綘鍙互鍙傝 https://baike.baidu.com/item/鏁扮嫭/74847?fr=aladdin ...
绛旓細濡傛灉鏄袱涓牸瀛愬湪鍚屼竴鍒椾笖绛変簬16鐨勶紝閭ｅ彧鑳芥槸7鍜9锛岀粷瀵逛笉浼氭槸涓や釜8.鍐嶆瘮濡3涓牸瀛愮瓑浜24锛岄偅鍙兘鏄7.8.9 銆傛湁娌℃湁鍏朵粬鏂规硶鏉ュ垽鏂憿锛屾湁鐨勶紝鏈変竴绉嶆潃鎵鏁扮嫭璁＄畻鍣锛岃兘甯姪浣犳帓闄ゆ帀涓浜涗笉鍙兘鐨勭粍鍚堛備綘缁欑殑棰樼洰鏈夐毦搴︼紝鎴戜竴鏃跺崐浼氬仛涓鍑烘潵锛屽凡灏嗗畠娣诲姞鍒版敹钘忎簡锛屾櫄浜涙湁绌轰簡鍐嶅仛鍚 ...
绛旓細1.鑱旈櫎娉.鍦ㄥ苟鎺掔殑涓変釜涔濆鏍间腑鐨勪袱鎺掑鎵剧浉鍚屾暟瀛,鍐嶅埄鐢ㄤ節瀹牸寰楀嚭鍙︿竴鎺掍腑璇ユ暟瀛椾綅缃,璇ユ柟娉曢傜敤浜庝腑楂樼骇鏁扮嫭.2.宸℃牸娉 鎵惧嚭鍦ㄦ瘡涓節瀹牸涓嚭鐜伴鐜囪緝楂樼殑鏁板瓧,寰楀嚭璇ユ暟瀛楀湪鍏朵綑涔濆鏍煎唴浣嶇疆,璇ユ柟娉曞簲鐢ㄤ簬鏂规硶涓涔嬪悗.3.鎺掑畠娉 杩欎釜鏂规硶鏄В鍐抽棶棰樼殑鍏抽敭,鏄撹甯镐汉鎵蹇界暐.鍦ㄥ悇琛屽垪鎴栦節瀹牸涓瀵...
绛旓細瀵硅绾鏁扮嫭:|651|784|329| |238|159|647| |794|263|518| |846|592|731| |523|417|896| |179|638|254| |417|825|963| |982|346|175| |365|971|482|
绛旓細瀵绘壘涓娆鹃珮鏁堟槗鐢ㄧ殑鏁扮嫭瑙ｉ宸ュ叿锛焝k涓嬭浇涓烘偍鎺ㄨ崘v2.71鍚剧埍涓撶増鐨勬渶濂界敤鏁扮嫭璁＄畻鍣銆傝繖娆捐蒋浠舵棬鍦ㄦ彁渚涗汉鎬у寲瑙ｉ浣撻獙锛屾ā鎷熶汉鑴戞濊冭繃绋嬶紝甯姪鎮ㄨ交鏉捐В鍐虫暟鐙毦棰樸傛暟鐙绠楀櫒v2.71鐗瑰埆鐗堝叿鏈変互涓嬬壒鐐癸細杞欢绫诲瀷锛氬簲鐢ㄨ蒋浠讹紝鍔炲叕杞欢杞欢澶у皬锛1.89M閫傜敤骞冲彴锛歐indows绯荤粺鍔熻兘鐗规э細鏀寔鍒嗘璁＄畻銆佹寚瀹氭鏁般...
绛旓細銆怭ython鎵撻犳紡娲炴壂鎻忓櫒銆戙怭ython搴旂敤椹皵鍙か閾剧畻娉曞疄鐜伴殢鏈烘枃鏈敓鎴愩戙鏁扮嫭娓告垙鐨凱ython瀹炵幇涓庣牬瑙ｃ戙愪娇鐢≒ython瀹氬埗璇嶄簯銆戙怭ython寮鍙戠畝鍗璁＄畻鍣銆戙怭ython瀹炵幇FTP寮卞彛浠ゆ壂鎻忓櫒銆戙怭ython瀹炵幇Huffman缂栫爜瑙ｅ帇缂╂枃浠躲戙怭ython瀹炵幇Zip鏂囦欢鐨勬毚鍔涚牬瑙ｃ戙怭ython 3鏅鸿兘瑁佸垏鍥剧墖銆戙怭ython瀹炵幇缃戠珯妯℃嫙鐧婚檰銆戙愮粰...
绛旓細澶╁ぉ鏁扮嫭缃戠殑鏁扮嫭瑙ｆ硶閲岄潰http://www.jiugongzhen.com/sdjf.htm鏈夋垜鍐欑殑涓浜涘熀鏈妧宸э紝妤间富鍙互鍙傝冧竴涓嬨傛垜鍏堟妸姣忎釜浣嶇疆缁鍑瀹氫箟锛岀劧鍚庣敤涓浜涙暟瀛﹁瑷鎻忚堪銆傚ぉ澶╂暟鐙綉 http://www.jiugongzhen.com/ 澶╁ぉ鏁扮嫭缃戞彁渚涙暟鏁扮嫭绠浠嬨佹暟鐙祫璁佸湪绾挎暟鐙鏁扮嫭璁＄畻鍣銆佹暟鐙В娉曠瓑锛屽苟鎻愪緵鏁扮嫭鍥句功鍜屾暟鐙帺鍏风殑...
