几个pascal的题目。。急等！！
\u51e0\u4e2apascal\u7684\u5c0f\u9898\u76ee1.
var a:array[1..5]of integer;
i,j,x:integer;
begin
readln(a[1],a[2],a[3]);
for i:=1 to 2 do for j:=i+1 to 3 do if a[j]<a[i] then
begin x:=a[j];a[j]:=a[i];a[i]:=x;end;
writeln(a[1],a[2],a[3]);
end.
\u697c\u4e0a\u7684\u4e24\u4e2ab!\u4e00\u4e2a\u516d\u4e2aif\u4e2a\u9e1f\uff01
\u4e00\u4e2a\u8fde\u987a\u5e8f\u6392\u5e8f\u90fd\u4e0d\u4f1a\u7528!!!
2.
var n,l,i:integer;
st:string;
begin
readln(st);l:=length(st);n:=0;
for i:=1 to l do
n:=n+ord(st[i])-48;
writeln(n);
end.
\u697c\u4e0a\u7684\u4e24\u4e2ab!\u4e00\u4e2a\u4e24\u4f4d\u6570\u7684\u8c01\u90fd\u4f1a\uff01
\u4e00\u4e2a\u90a3\u4e48\u957f!
3.
var i,j,n:integer;
begin
readln(n);
for i:=2 to n-1 do
if n mod i=0 then
begin
writeln('No');
halt;
end;
writeln('Yes');
end.
\u697c\u4e0a\u7684\u4e24\u4e2ab!\u4e00\u4e2a\u6253\u90fd\u4e0d\u6253\u5370\uff01
\u53e6\u4e00\u4e2a\uff1afor i:=2 to n do
if n mod i=0 then\uff0e\uff0e
\u5e94\u8be5\u662ffor i:=2 to n-1 do\u7adf\u7136\u72af\u8fd9\u79cd\u5f31\u667a\u9519\u8bef\uff01\uff01\u6c38\u8fdc\u90fd\u4f1a\u8f93\u51fa\u201dNO\u201d!!!
4.
var i,j,m:integer;
begin
readln(i,j);
m:=i;
while m mod j0 do m:=m+i;
writeln(m,' 1');
readln;
end.
\u697c\u4e0a\u7684\u4e24\u4e2ab!\u4f60\u4eec\u9ebb\u4e0d\u9ebb\u70e6!!!
\u65e2\u7136\u662f\u6c42\u6700\u5c0f\u516c\u7ea6\u6570,\u76f4\u63a5\u8f93\u51fa1\u4e0d\u5c31\u884c\u4e86???
\u603b\u7ed3:\u697c\u4e0a\u7684\u7b2c\u4e00\u53eab\u662f\u65b0\u624b!!!
\u7b2c\u4e8c\u53eab\u5bf9\u4e8e\u6211\u6765\u8bf4\u4e5f\u662f\u65b0\u624b!!!
\u4e00\u3001c\u8bed\u8a00\u5b9e\u73b0
\u516b\u7687\u540e\u95ee\u9898\u662f\u4e00\u4e2a\u53e4\u8001\u800c\u8457\u540d\u7684\u95ee\u9898\uff0c\u662f\u56de\u6eaf\u7b97\u6cd5\u7684\u5178\u578b\u4f8b\u9898\u3002\u8be5\u95ee\u9898\u662f\u5341\u4e5d\u4e16\u7eaa\u8457\u540d\u7684\u6570\u5b66\u5bb6\u9ad8\u65af1850\u5e74\u63d0\u51fa\uff1a\u57288X8\u683c\u7684\u56fd\u9645\u8c61\u68cb\u4e0a\u6446\u653e\u516b\u4e2a\u7687\u540e\uff0c\u4f7f\u5176\u4e0d\u80fd\u4e92\u76f8\u653b\u51fb\uff0c\u5373\u4efb\u610f\u4e24\u4e2a\u7687\u540e\u90fd\u4e0d\u80fd\u5904\u4e8e\u540c\u4e00\u884c\u3001\u540c\u4e00\u5217\u6216\u540c\u4e00\u659c\u7ebf\u4e0a\uff0c\u95ee\u6709\u591a\u5c11\u79cd\u6446\u6cd5\u3002
\u9ad8\u65af\u8ba4\u4e3a\u670976\u79cd\u65b9\u6848\u30021854\u5e74\u5728\u67cf\u6797\u7684\u8c61\u68cb\u6742\u5fd7\u4e0a\u4e0d\u540c\u7684\u4f5c\u8005\u53d1\u8868\u4e8640\u79cd\u4e0d\u540c\u7684\u89e3\uff0c\u540e\u6765\u6709\u4eba\u7528\u56fe\u8bba\u7684\u65b9\u6cd5\u89e3\u51fa92\u79cd\u7ed3\u679c\u3002
\u5bf9\u4e8e\u516b\u7687\u540e\u95ee\u9898\u7684\u5b9e\u73b0\uff0c\u5982\u679c\u7ed3\u5408\u52a8\u6001\u7684\u56fe\u5f62\u6f14\u793a\uff0c\u5219\u53ef\u4ee5\u4f7f\u7b97\u6cd5\u7684\u63cf\u8ff0\u66f4\u5f62\u8c61\u3001\u66f4\u751f\u52a8\uff0c\u4f7f\u6559\u5b66\u80fd\u4ea7\u751f\u826f\u597d\u7684\u6548\u679c\u3002\u4e0b\u9762\u662f\u7b14\u8005\u7528Turbo C\u5b9e\u73b0\u7684\u516b\u7687\u540e\u95ee\u9898\u7684\u56fe\u5f62\u7a0b\u5e8f\uff0c\u80fd\u591f\u6f14\u793a\u5168\u90e8\u768492\u7ec4\u89e3\u3002\u516b\u7687\u540e\u95ee\u9898\u52a8\u6001\u56fe\u5f62\u7684\u5b9e\u73b0\uff0c\u4e3b\u8981\u5e94\u89e3\u51b3\u4ee5\u4e0b\u4e24\u4e2a\u95ee\u9898\u3002
\uff081\uff09\u56de\u6eaf\u7b97\u6cd5\u7684\u5b9e\u73b0
\uff08a\uff09\u4e3a\u89e3\u51b3\u8fd9\u4e2a\u95ee\u9898\uff0c\u6211\u4eec\u628a\u68cb\u76d8\u7684\u6a2a\u5750\u6807\u5b9a\u4e3ai\uff0c\u7eb5\u5750\u6807\u5b9a\u4e3aj,i\u548cj\u7684\u53d6\u503c\u8303\u56f4\u662f\u4ece1\u52308\u3002\u5f53\u67d0\u4e2a\u7687\u540e\u5360\u4e86\u4f4d\u7f6e(i,j)\u65f6\uff0c\u5728\u8fd9\u4e2a\u4f4d\u7f6e\u7684\u5782\u76f4\u65b9\u5411\u3001\u6c34\u5e73\u65b9\u5411\u548c\u659c\u7ebf\u65b9\u5411\u90fd\u4e0d\u80fd\u518d\u653e\u5176\u5b83\u7687\u540e\u4e86\u3002\u7528\u8bed\u53e5\u5b9e\u73b0\uff0c\u53ef\u5b9a\u4e49\u5982\u4e0b\u4e09\u4e2a\u6574\u578b\u6570\u7ec4\uff1aa[8],b[15],c[24]\u3002\u5176\u4e2d\uff1a
a[j-1]=1 \u7b2cj\u5217\u4e0a\u65e0\u7687\u540e
a[j-1]=0 \u7b2cj\u5217\u4e0a\u6709\u7687\u540e
b[i+j-2]=1 (i,j)\u7684\u5bf9\u89d2\u7ebf\uff08\u5de6\u4e0a\u81f3\u53f3\u4e0b\uff09\u65e0\u7687\u540e
b[i+j-2]=0 (i,j)\u7684\u5bf9\u89d2\u7ebf\uff08\u5de6\u4e0a\u81f3\u53f3\u4e0b\uff09\u6709\u7687\u540e
c[i-j+7]=1 (i,j)\u7684\u5bf9\u89d2\u7ebf\uff08\u53f3\u4e0a\u81f3\u5de6\u4e0b\uff09\u65e0\u7687\u540e
c[i-j+7]=0 (i,j)\u7684\u5bf9\u89d2\u7ebf\uff08\u53f3\u4e0a\u81f3\u5de6\u4e0b\uff09\u6709\u7687\u540e
\uff08b\uff09\u4e3a\u7b2ci\u4e2a\u7687\u540e\u9009\u62e9\u4f4d\u7f6e\u7684\u7b97\u6cd5\u5982\u4e0b\uff1a
for(j=1;j<=8;j++) /*\u7b2ci\u4e2a\u7687\u540e\u5728\u7b2cj\u884c*/
if ((i,j)\u4f4d\u7f6e\u4e3a\u7a7a)\uff09 /*\u5373\u76f8\u5e94\u7684\u4e09\u4e2a\u6570\u7ec4\u7684\u5bf9\u5e94\u5143\u7d20\u503c\u4e3a1*/
{\u5360\u7528\u4f4d\u7f6e\uff08i,j\uff09 /*\u7f6e\u76f8\u5e94\u7684\u4e09\u4e2a\u6570\u7ec4\u5bf9\u5e94\u7684\u5143\u7d20\u503c\u4e3a0*/
if i<8
\u4e3ai+1\u4e2a\u7687\u540e\u9009\u62e9\u5408\u9002\u7684\u4f4d\u7f6e\uff1b
else \u8f93\u51fa\u4e00\u4e2a\u89e3
}
(2)\u56fe\u5f62\u5b58\u53d6
\u5728Turbo C\u8bed\u8a00\u4e2d\uff0c\u56fe\u5f62\u7684\u5b58\u53d6\u53ef\u7528\u5982\u4e0b\u6807\u51c6\u51fd\u6570\u5b9e\u73b0\uff1a
size=imagesize(x1,y1,x2,y2) ;\u8fd4\u56de\u5b58\u50a8\u533a\u57df\u6240\u9700\u5b57\u8282\u6570\u3002
arrow=malloc(size);\u5efa\u7acb\u6307\u5b9a\u5927\u5c0f\u7684\u52a8\u6001\u533a\u57df\u4f4d\u56fe\uff0c\u5e76\u8bbe\u5b9a\u4e00\u6307\u9488arrow\u3002
getimage(x1,y1,x2,y2,arrow);\u5c06\u6307\u5b9a\u533a\u57df\u4f4d\u56fe\u5b58\u4e8e\u4e00\u7f13\u51b2\u533a\u3002
putimage(x,y,arrow,copy)\u5c06\u4f4d\u56fe\u7f6e\u4e8e\u5c4f\u5e55\u4e0a\u4ee5\uff08x\uff0cy\uff09\u5de6\u4e0a\u89d2\u7684\u533a\u57df\u3002
(3)\u7a0b\u5e8f\u6e05\u5355\u5982\u4e0b
#include
#include
#include
#include
char n[3]={'0','0'};/*\u7528\u4e8e\u8bb0\u5f55\u7b2c\u51e0\u7ec4\u89e3*/
int a[8],b[15],c[24],i;
int h[8]={127,177,227,277,327,377,427,477};/*\u6bcf\u4e2a\u7687\u540e\u7684\u884c\u5750\u6807*/
int l[8]={252,217,182,147,112,77,42,7}; /*\u6bcf\u4e2a\u7687\u540e\u7684\u5217\u5750\u6807*/
void *arrow;
void try(int i)
{int j;
for (j=1;j<=8;j++)
if (a[j-1]+b[i+j-2]+c[i-j+7]==3) /*\u5982\u679c\u7b2ci\u5217\u7b2cj\u884c\u4e3a\u7a7a*/
{a[j-1]=0;b[i+j-2]=0;c[i-j+7]=0;/*\u5360\u7528\u7b2ci\u5217\u7b2cj\u884c*/
putimage(h[i-1],l[j-1],arrow,COPY_PUT);/*\u663e\u793a\u7687\u540e\u56fe\u5f62*/
delay(500);/*\u5ef6\u65f6*/
if(i<8) try(i+1);
else /*\u8f93\u51fa\u4e00\u7ec4\u89e3*/
{n[1]++;if (n[1]>'9') {n[0]++;n[1]='0';}
bar(260,300,390,340);/*\u663e\u793a\u7b2cn\u7ec4\u89e3*/
outtextxy(275,300,n);
delay(3000);
}
a[j-1]=1;b[i+j-2]=1;c[i-j+7]=1;
putimage(h[i-1],l[j-1],arrow,XOR_PUT);/*\u6d88\u53bb\u7687\u540e\uff0c\u7ee7\u7eed\u5bfb\u627e\u4e0b\u4e00\u7ec4\u89e3*/
delay(500);
}}
int main(void)
{int gdrive=DETECT,gmode,errorcode;
unsigned int size;
initgraph(&gdrive,&gmode,"");
errorcode=graphresult();
if (errorcode!=grOk)
{printf("Graphics error\n");exit(1);}
rectangle(50,5,100,40);
rectangle(60,25,90,33);
/* \u753b\u7687\u51a0 */
line(60,28,90,28);line(60,25,55,15);
line(55,15,68,25);line(68,25,68,10);
line(68,10,75,25);line(75,25,82,10);
line(82,10,82,25);line(82,25,95,15);
line(95,15,90,25);
size=imagesize(52,7,98,38); arrow=malloc(size);
getimage(52,7,98,38,arrow); /* \u628a\u7687\u51a0\u4fdd\u5b58\u5230\u7f13\u51b2\u533a */
clearviewport();
settextstyle(TRIPLEX_FONT, HORIZ_DIR, 4);
setusercharsize(3, 1, 1, 1);
setfillstyle(1,4);
for (i=0;i<=7;i++) a[i]=1;
for (i=0;i<=14;i++) b[i]=1;
for (i=0;i<=23;i++) c[i]=1;
for (i=0;i<=8;i++) line(125,i*35+5,525,i*35+5); /* \u753b\u68cb\u76d8 */
for (i=0;i<=8;i++) line(125+i*50,5,125+i*50,285);
try(1); /* \u8c03\u7528\u9012\u5f52\u51fd\u6570 */
delay(3000);
closegraph();
free(arrow);
}
\u4e8c\u3001\u5faa\u73af\u5b9e\u73b0 Java
/*
* 8\u7687\u540e\u95ee\u9898\uff1a
*
* \u95ee\u9898\u63cf\u8ff0\uff1a
* \u5728\u4e00\u4e2a8\u00d78\u7684\u68cb\u76d8\u91cc\u653e\u7f6e8\u4e2a\u7687\u540e\uff0c\u8981\u6c42\u6bcf\u4e2a\u7687\u540e\u4e24\u4e24\u4e4b\u95f4\u4e0d\u76f8\u51b2\u7a81
*\uff08\u5728\u6bcf\u4e00\u6a2a\u5217\uff0c\u7ad6\u5217\uff0c\u659c\u5217\u53ea\u6709\u4e00\u4e2a\u7687\u540e\uff09\u3002
*
* \u6570\u636e\u8868\u793a\uff1a
* \u7528\u4e00\u4e2a 8 \u4f4d\u7684 8 \u8fdb\u5236\u6570\u8868\u793a\u68cb\u76d8\u4e0a\u7687\u540e\u7684\u4f4d\u7f6e\uff1a
* \u6bd4\u5982\uff1a45615353 \u8868\u793a\uff1a
* \u7b2c0\u5217\u7687\u540e\u5728\u7b2c4\u4e2a\u4f4d\u7f6e
* \u7b2c1\u5217\u7687\u540e\u5728\u7b2c5\u4e2a\u4f4d\u7f6e
* \u7b2c2\u5217\u7687\u540e\u5728\u7b2c6\u4e2a\u4f4d\u7f6e
* \u3002\u3002\u3002
* \u7b2c7\u5217\u7687\u540e\u5728\u7b2c3\u4e2a\u4f4d\u7f6e
*
* \u5faa\u73af\u53d8\u91cf\u4ece 00000000 \u52a0\u5230 77777777 \uff088\u8fdb\u5236\u6570\uff09\u7684\u8fc7\u7a0b\uff0c\u5c31\u904d\u5386\u4e86\u7687\u540e\u6240\u6709\u7684\u60c5\u51b5
* \u7a0b\u5e8f\u4e2d\u7528\u516b\u8fdb\u5236\u6570\u7528\u4e00\u4e2a\u4e00\u7ef4\u6570\u7ec4 data[] \u8868\u793a
*
* \u68c0\u6d4b\u51b2\u7a81\uff1a
* \u6a2a\u5217\u51b2\u7a81\uff1adata== data[j]
* \u659c\u5217\u51b2\u7a81\uff1a(data+i) == (data[j]+j) \u6216\u8005 (data-i) == (data[j]-j)
*
* \u597d\u5904\uff1a
* \u91c7\u7528\u5faa\u73af\uff0c\u800c\u4e0d\u662f\u9012\u89c4\uff0c\u7cfb\u7edf\u8d44\u6e90\u5360\u6709\u5c11
* \u53ef\u8ba1\u7b97 n \u7687\u540e\u95ee\u9898
* \u628a\u95ee\u9898\u7ebf\u6027\u5316\u5904\u7406\uff0c\u53ef\u4ee5\u628a\u95ee\u9898\u5206\u5757\uff0c\u5728\u5206\u5e03\u5f0f\u73af\u5883\u4e0b\u7528\u591a\u53f0\u8ba1\u7b97\u673a\u4e00\u8d77\u7b97\u3002
*
* ToDo\uff1a
* \u679a\u4e3e\u90e8\u5206\u8fd8\u53ef\u4ee5\u8fdb\u884c\u4f18\u5316\uff0c\u591a\u52a0\u4e9b\u5224\u65ad\u6761\u4ef6\u901f\u5ea6\u53ef\u4ee5\u66f4\u5feb\u3002
* \u8f93\u51fa\u90e8\u5206\u53ef\u4ee5\u4fee\u6539\u6210\u68cb\u76d8\u5f62\u5f0f\u7684\u8f93\u51fa
*
* @author cinc 2002-09-11
*
*/
public class Queen {
int size;
int resultCount;
public void compute ( int size ) {
this.size = size;
resultCount = 0;
int data[] = new int[size];
int count; // \u6240\u6709\u53ef\u80fd\u7684\u60c5\u51b5\u4e2a\u6570
int i,j;
// \u8ba1\u7b97\u6240\u6709\u53ef\u80fd\u7684\u60c5\u51b5\u7684\u4e2a\u6570
count = 1;
for ( i=0 ; i<size ; i++ ) {
count = count * size;
}
// \u5bf9\u6bcf\u4e00\u4e2a\u53ef\u80fd\u7684\u60c5\u51b5
for ( i=0 ; i<count ; i++ ) {
// \u8ba1\u7b97\u8fd9\u79cd\u60c5\u51b5\u4e0b\u7684\u68cb\u76d8\u4e0a\u7687\u540e\u7684\u6446\u653e\u4f4d\u7f6e\uff0c\u7528 8 \u8fdb\u5236\u6570\u8868\u793a
// \u6b64\u5904\u53ef\u4f18\u5316
int temp = i;
for ( j=0 ; j<size ; j++ ) {
data [j] = temp % size;
temp = temp / size;
}
// \u6d4b\u8bd5\u8fd9\u79cd\u60c5\u51b5\u662f\u5426\u53ef\u884c\uff0c\u5982\u679c\u53ef\u4ee5\uff0c\u8f93\u51fa
if ( test(data) )
output( data );
}
}
/*
* \u6d4b\u8bd5\u8fd9\u79cd\u60c5\u51b5\u7687\u540e\u7684\u6392\u5217\u662f\u5426\u53ef\u884c
*
*/
public boolean test( int[] data ) {
int i,j;
for ( i=0 ; i<size ; i++ ) {
for ( j=i+1 ; j<size ; j++ ) {
// \u6d4b\u8bd5\u662f\u5426\u5728\u540c\u4e00\u6392
if ( data == data[j] )
return false;
// \u6d4b\u8bd5\u662f\u5426\u5728\u4e00\u659c\u7ebf
if ( (data+i) == (data[j]+j) )
return false;
// \u6d4b\u8bd5\u662f\u5426\u5728\u4e00\u53cd\u659c\u7ebf
if ( (data-i) == (data[j]-j) )
return false;
}
}
return true;
}
/*
* \u8f93\u51fa\u67d0\u79cd\u60c5\u51b5\u4e0b\u7687\u540e\u7684\u5750\u6807
*
*/
public void output ( int[] data ) {
int i;
System.out.print ( ++resultCount + ": " );
for ( i=0 ; i<size ; i++ ) {
System.out.print ( "(" + i + "," + data + ") " );
}
System.out.println ();
}
public static void main(String args[]) {
(new Queen()).compute( 8 );
}
}
\u4e09\u3001\u516b\u7687\u540e\u95ee\u9898\u7684Qbasic\u7248\u7684\u89e3\u51b3\u65b9\u6848
10 I = 1
20 A(I) = 1
30 G = 1
40 FOR K = I - 1 TO 1 STEP -1
50 IF A(I) = A(K) THEN 70
60 IF ABS(A(I) - A(K)) I - K THEN 90
70 G = 0
80 GOTO 100
90 NEXT K
100 IF I 8 THEN 180
110 IF G = 0 THEN 180
120 FOR L = 1 TO 8
130 PRINT USING \u201c##\u201d; A(L);
140 NEXT L
150 PRINT \u201c*\u201d;
160 M = M + 1
170 IF M MOD 3 = 0 THEN PRINT
180 IF G = 0 THEN 230
190 IF I = 8 THEN 230
200 I = I + 1
210 A(I) = 1
220 GOTO 30
230 IF A(I) < 8 THEN 270
240 I = I - 1
250 IF I = 0 THEN 290
260 GOTO 230
270 A(I) = A(I) + 1
280 GOTO 30
290 PRINT
300 PRINT \u201cSUM=\u201d; USING \u201c##\u201d; M;
310 PRINT
320 END
\u56db\u3001\u516b\u7687\u540e\u95ee\u9898\u7684\u9ad8\u6548\u89e3\u6cd5-\u9012\u5f52\u7248
//8 Queen \u9012\u5f52\u7b97\u6cd5
//\u5982\u679c\u6709\u4e00\u4e2aQ \u4e3a chess[i]=j;
//\u5219\u4e0d\u5b89\u5168\u7684\u5730\u65b9\u662f k\u884c j\u4f4d\u7f6e,j+k-i\u4f4d\u7f6e,j-k+i\u4f4d\u7f6e
class Queen8{
static final int QueenMax = 8;
static int oktimes = 0;
static int chess[] = new int[QueenMax];//\u6bcf\u4e00\u4e2aQueen\u7684\u653e\u7f6e\u4f4d\u7f6e
public static void main(String args[]){
for (int i=0;i<QueenMax;i++)chess[i]=-1;
placequeen(0);
System.out.println("\n\n\n\u516b\u7687\u540e\u5171\u6709"+oktimes+"\u4e2a\u89e3\u6cd5 made by yifi 2003");
}
public static void placequeen(int num){ //num \u4e3a\u73b0\u5728\u8981\u653e\u7f6e\u7684\u884c\u6570
int i=0;
boolean qsave[] = new boolean[QueenMax];
for(;i<QueenMax;i++) qsave[i]=true;
//\u4e0b\u9762\u5148\u628a\u5b89\u5168\u4f4d\u6570\u7ec4\u5b8c\u6210
i=0;//i \u662f\u73b0\u5728\u8981\u68c0\u67e5\u7684\u6570\u7ec4\u503c
while (i<num){
qsave[chess[i]]=false;
int k=num-i;
if ( (chess[i]+k >= 0) && (chess[i]+k < QueenMax) ) qsave[chess[i]+k]=false;
if ( (chess[i]-k >= 0) && (chess[i]-k < QueenMax) ) qsave[chess[i]-k]=false;
i++;
}
//\u4e0b\u9762\u5386\u904d\u5b89\u5168\u4f4d
for(i=0;i<QueenMax;i++){
if (qsave[i]==false)continue;
if (num<QueenMax-1){
chess[num]=i;
placequeen(num+1);
}
else{ //num is last one
chess[num]=i;
oktimes++;
System.out.println("\u8fd9\u662f\u7b2c"+oktimes+"\u4e2a\u89e3\u6cd5 \u5982\u4e0b:");
System.out.println("\u7b2cn\u884c: 1 2 3 4 5 6 7 8");
for (i=0;i<QueenMax;i++){
String row="\u7b2c"+(i+1)+"\u884c: ";
if (chess[i]==0);
else
for(int j=0;j<chess[i];j++) row+="--";
row+="++";
int j = chess[i];
while(j<QueenMax-1){row+="--";j++;}
System.out.println(row);
}
}
}
//\u5386\u904d\u5b8c\u6210\u5c31\u505c\u6b62
}
}
\u4e94\u3001java\u5b9e\u73b0//8 Queen \u9012\u5f52\u7b97\u6cd5
//\u5982\u679c\u6709\u4e00\u4e2aQ \u4e3a chess[i]=j;
//\u5219\u4e0d\u5b89\u5168\u7684\u5730\u65b9\u662f k\u884c j\u4f4d\u7f6e,j+k-i\u4f4d\u7f6e,j-k+i\u4f4d\u7f6e
class Queen8{
static final int QueenMax = 8;
static int oktimes = 0;
static int chess[] = new int[QueenMax];//\u6bcf\u4e00\u4e2aQueen\u7684\u653e\u7f6e\u4f4d\u7f6e
public static void main(String args[]){
for (int i=0;i<QueenMax;i++)chess[i]=-1;
placequeen(0);
System.out.println("\n\n\n\u516b\u7687\u540e\u5171\u6709"+oktimes+"\u4e2a\u89e3\u6cd5 made by yifi 2003");
}
public static void placequeen(int num){ //num \u4e3a\u73b0\u5728\u8981\u653e\u7f6e\u7684\u884c\u6570
int i=0;
boolean qsave[] = new boolean[QueenMax];
for(;i<QueenMax;i++) qsave[i]=true;
//\u4e0b\u9762\u5148\u628a\u5b89\u5168\u4f4d\u6570\u7ec4\u5b8c\u6210
i=0;//i \u662f\u73b0\u5728\u8981\u68c0\u67e5\u7684\u6570\u7ec4\u503c
while (i<num){
qsave[chess[i]]=false;
int k=num-i;
if ( (chess[i]+k >= 0) && (chess[i]+k < QueenMax) ) qsave[chess[i]+k]=false;
if ( (chess[i]-k >= 0) && (chess[i]-k < QueenMax) ) qsave[chess[i]-k]=false;
i++;
}
//\u4e0b\u9762\u5386\u904d\u5b89\u5168\u4f4d
for(i=0;i<QueenMax;i++){
if (qsave[i]==false)continue;
if (num<QueenMax-1){
chess[num]=i;
placequeen(num+1);
}
else{ //num is last one
chess[num]=i;
oktimes++;
System.out.println("\u8fd9\u662f\u7b2c"+oktimes+"\u4e2a\u89e3\u6cd5 \u5982\u4e0b:");
System.out.println("\u7b2cn\u884c: 1 2 3 4 5 6 7 8");
for (i=0;i<QueenMax;i++){
String row="\u7b2c"+(i+1)+"\u884c: ";
if (chess[i]==0);
else
for(int j=0;j<chess[i];j++) row+="--";
row+="++";
int j = chess[i];
while(j<QueenMax-1){row+="--";j++;}
System.out.println(row);
}
}
}
//\u5386\u904d\u5b8c\u6210\u5c31\u505c\u6b62
}
}\u516d\u3001c\uff03\u5b9e\u73b0\u5468\u672b\u95f2\u6765\u65e0\u4e8b\uff0c\u5ffd\u7136\u60f3\u8d77\u5927\u5b66\u65f6\u5019\u5b66\u300a\u6570\u636e\u7ed3\u6784\u300b\u65f6\u5019\u7684\u671f\u672b\u4e0a\u673a\u8003\u8bd5\uff0c\u8981\u6c42\u5728\u4e24\u4e2a\u5c0f\u65f6\u5185\u5b8c\u6210\u4e24\u9053\u7f16\u7a0b\u7684\u9898\u76ee\u3002\u5176\u4e2d\u4e00\u9053\u9898\u76ee\u5c31\u662f\u8ba9\u7f16\u7a0b\u89e3\u51b3\u201c\u516b\u7687\u540e\u95ee\u9898\u201d\u3002\u73b0\u5728\u60f3\u8d77\u6765\u8fd8\u662f\u633a\u6709\u610f\u601d\uff0c\u5c31\u6253\u7b97\u7528 C# \u518d\u5b9e\u73b0\u4e00\u6b21 :)
\u516b\u7687\u540e\u95ee\u9898\u7684\u5927\u81f4\u610f\u601d\u662f\u8fd9\u6837\u7684\uff1a\u5728\u4e00\u4e2a 8*8 \u7684\u77e9\u5f62\u683c\u5b50\u4e2d\u6392\u653e 8 \u4e2a\u7687\u540e\uff0c\u8981\u6ee1\u8db3\u7684\u6761\u4ef6\u5305\u62ec\uff1a\u4efb\u610f\u4e24\u4e2a\u7687\u540e\u90fd\u4e0d\u80fd\u5728\u540c\u4e00\u884c\u3001\u540c\u4e00\u5217\uff0c\u4e5f\u4e0d\u80fd\u5728\u540c\u4e00\u6761\u5bf9\u89d2\u7ebf\uff08\u659c\u7387\u7b49\u4e8e1\u6216-1\uff09\u3002
\u5728\u8003\u8bd5\u7684\u65f6\u5019\uff0c\u6211\u662f\u7528\u9012\u5f52\u7684\u65b9\u6cd5\u89e3\u51b3\u7684\u3002\u73b0\u5728\u60f3\u4e00\u60f3\uff0c\u8fd8\u662f\u7528\u9012\u5f52\u6bd4\u8f83\u65b9\u4fbf\u3002\u4f46\u662f\u9700\u8981\u6ce8\u610f\u7684\u662f\uff0c\u9012\u5f52\u6709\u4e2a\u5f88\u5927\u7684\u6bdb\u75c5\uff0c\u5c31\u662f\u9012\u5f52\u7684\u89c4\u6a21\u4e0d\u592a\u597d\u63a7\u5236\uff0c\u800c\u4e14\u5728\u9012\u5f52\u5f88\u6df1\u7684\u7a0b\u5e8f\u4e2d\uff0c\u8981\u8c03\u8bd5\u4e5f\u662f\u4e00\u4e2a\u5f88\u4f24\u8111\u7b4b\u7684\u95ee\u9898\u3002\u5728\u6709\u7684\u516c\u53f8\uff0c\u9012\u5f52\u5c31\u662f\u57fa\u672c\u4e0a\u7981\u6b62\u7684\u3002\u4e0d\u8fc7\u8fd9\u91cc\u6211\u5c31\u4e0d\u53bb\u8003\u8651\u975e\u9012\u5f52\u7684\u89e3\u51b3\u65b9\u6848\u4e86\uff0c\u53cd\u6b63\u662f\u5a31\u4e50\u5a31\u4e50\uff0c\u4f55\u5fc5\u81ea\u627e\u9ebb\u70e6\u5462:)
\u5728\u4f7f\u7528\u9012\u5f52\u89e3\u51b3\u6b64\u95ee\u9898\u7684\u65f6\u5019\uff0c\u6211\u91c7\u7528\u7684\u65b9\u6cd5\u5927\u81f4\u662f\u8fd9\u6837\uff1a
\u5c06\u4e00\u4e2a\u7687\u540e\u5411\u4e0b\u79fb\u52a8\u4e00\u4e2a\u4f4d\u7f6e\uff1b
\u5982\u679c\u6ca1\u6709\u6210\u529f\u79fb\u52a8\uff08\u6bd4\u5982\u5df2\u7ecf\u8d85\u51fa\u8fb9\u754c\uff09\uff0c\u5931\u8d25\uff1b
\u5982\u679c\u6210\u529f\u79fb\u52a8\uff0c\u5219\u5224\u65ad\u5f53\u524d\u4f4d\u7f6e\u662f\u5426\u53ef\u7528\uff08\u548c\u5176\u4ed6\u7684\u7687\u540e\u65f6\u5019\u51b2\u7a81\uff09\uff1f\u5982\u679c\u51b2\u7a81\uff0c\u5219\u91cd\u505a 1\uff1b
\u7ee7\u7eed\u7ed9\u4e0b\u4e00\u4e2a\u7687\u540e\u5b89\u6392\u4f4d\u7f6e\u3002
\u7ed3\u675f\u6761\u4ef6\u5c31\u662f\u5982\u679c\u7b2c\u4e00\u4e2a\u7687\u540e\u7684\u6240\u6709\u4f4d\u7f6e\u90fd\u5c1d\u8bd5\u5b8c\u6bd5\u4ecd\u7136\u6ca1\u6709\u53ef\u7528\u7684\u89e3\u51b3\u65b9\u6848\u6216\u8005\u6700\u540e\u4e00\u4e2a\u7687\u540e\u5df2\u7ecf\u5b89\u6392\u5b8c\u6bd5\u3002
\u4ee3\u7801\u5982\u4e0b\uff1a
1// AppEntry.cs
2using System;
3
4namespace Chenglin
5{
6 class AppEntry
7 {
8 static void Main(string[] args)
9 {
10 int queenNumber = 8;
11 QueenRowCollection q = new QueenRowCollection(queenNumber);
12
13 bool flag;
14 DateTime timeStarted = DateTime.Now;
15 flag = q.PositionQueens();
16 TimeSpan ts = DateTime.Now.Subtract( timeStarted );
17
18
19 if( flag ) {
20 Console.WriteLine( q.ToString() );
21 }
22 else {
23 Console.WriteLine( "Failed" );
24 }
25
26 Console.WriteLine( "{0} seconds has been elapsed.", ts.TotalSeconds );
27 }
28 }
29} 1// QueenRowCollection.cs
2using System;
3using System.Text;
4
5namespace Chenglin
6{
7 public class QueenRowCollection
8 {
9
10 public QueenRowCollection( int numberOfQueens ){
11 this.numberOfQueens = numberOfQueens;
12 this.rows = new QueenRow[ numberOfQueens ];
13
14 for( int i=0;i<numberOfQueens;i++ ){
15 rows[i] = new QueenRow( numberOfQueens );
16 }
17 }
18
19 public bool PositionQueens()
20 {
21 return PositionQueen( 0 );
22 }
23
24 private bool PositionQueen( int row )
25 {
26 if( row>=this.numberOfQueens ) {
27 return true;
28 }
29
30 QueenRow q = rows[row];
31 while( q.MoveNext() )
32 {
33 if( PositionAvailable( row, q.CurrentPosition ) ) {
34 // An available position has been found for the current queen,
35 // and try to find a proper position for the next queen.
36 //
37 // If no available position can be found for the next queen,
38 // the current queen should move to the next position and try again.
39 //
40 if( PositionQueen( row+1 ) )
41 {
42 // Both the current queen and the next queen
43 // have found available positions.
44 //
45 return true;
46 }
47 }
48 }
49
50 // No position is available for the current queen,
51 //
52 return false;
53 }
54
55 private bool PositionAvailable( int row, int column ){
56 for( int i=row-1; i>=0; i-- )
57 {
58 if( rows[i].PositionOccupied( column ) )
59 return false;
60
61 if( rows[i].PositionOccupied( column-(i-row) ) )
62 return false;
63
64 if( rows[i].PositionOccupied( column+(i-row) ) )
65 return false;
66 }
67
68 return true;
69 }
70
71 public override string ToString()
72 {
73 StringBuilder s = new StringBuilder();
74
75 foreach( QueenRow q in rows ){
76 s.AppendFormat( "{0}{1}", q, Environment.NewLine );
77 }
78
79 return s.ToString();
80 }
81
82 private int numberOfQueens;
83 private QueenRow [] rows;
84 }
85} 1// QueenRow.cs
2using System;
3using System.Text;
4
5namespace Chenglin
6{
7 public class QueenRow
8 {
9 public QueenRow( int numberOfPositions )
10 {
11 this.numberOfPositions = numberOfPositions;
12 this.currentPosition = -1;
13 this.columns = new bool[ numberOfPositions ];
14 }
15
16 public bool MoveNext(){
17 if( currentPosition>=0 && currentPosition<this.numberOfPositions ){
18 columns[currentPosition] = false;
19 }
20
21 if( currentPosition<this.numberOfPositions-1){
22 currentPosition ++;
23 columns[currentPosition] = true;
24 return true;
25 }
26 else {
27 currentPosition = -1;
28 return false;
29 }
30 }
31
32 public bool PositionOccupied( int column ){
33 if( column=numberOfPositions ){
34 return false;
35 }
36
37 return columns[column];
38 }
39
40 public override string ToString()
41 {
42 StringBuilder s = new StringBuilder();
43
44 foreach( bool b in columns ){
45 s.AppendFormat( "{0} ", (b ? "*" : "-") );
46 }
47
48 return s.ToString();
49 }
50
51 public int CurrentPosition
52 {
53 get { return currentPosition; }
54 }
55
56 private int currentPosition;
57 private int numberOfPositions;
58 private bool [] columns;
59 }
60}
样例输入：3
样例输出：32
var
x:real;
a:integer;
function power(x,y:1..15):real;
var
a:integer;
b:real;
begin
b:=1;
for a:=1 to y do
b:=b*x;
power:=b;
end;
begin
x:=0;
for a:=1 to n do
x:=x+power(a,a);
write(x:0:0);
end.
2. 任意输入一个正整数（<maxlongint），计算它各位数字上的和。
样例输入：35829083
样例输出：38
（提示：可以用while循环完成此题）
var
s:string;
x:longint;
a,b,c,d:integer;
begin
readln(x);
str(x,s);
d:=0;
for a:=1 to length(s) do
begin
val(s[a],b,c);
d:=d+b;
end;
writeln(d);
end.
第1题：
var a,b:qword;n,i,j:longint;
begin
readln(n);
for i:=1 to n do
begin
b:=1;
for j:=1 to i do b:=b*i;
a:=a+b;
end;
writeln(a);
end.
第2题：
var s:string;a,i:longint;
begin
readln(s);
for i:=1 to length(s)do
a:=a+ord(s[i])-48;
writeln(a);
end.
第3题
var a:array[1..10000]of longint;
y:array[1..1000000]of longint;
b,c,d,e,f,g,h,i,j,k,m,n:longint;
begin
a[1]:=2;c:=1;b:=2;
while c<>10000 do
begin
inc(b);
e:=1;
for i:=2 to round(sqrt(b)) do
if b mod i=0 then begin e:=0;break;end;
if e=1 then begin inc(c);a[c]:=b;end;
end;
readln(n);
for i:=1 to c do
begin
if n=1 then break;
while n mod a[i]=0 do begin y[a[i]]:=1;n:=n div a[i];end;
end;
for i:=1 to 1000000 do
if y[i]=1 then inc(h);
writeln(h);
end.
第4题
var a:array[1..10000]of longint;
y:array[1..1000000]of longint;
x:array[1..1000,1..2]of longint;
b,c,d,e,f,g,h,i,j,k,m,n:longint;
begin
a[1]:=2;c:=1;b:=2;
while c<>10000 do
begin
inc(b);
e:=1;
for i:=2 to round(sqrt(b)) do
if b mod i=0 then begin e:=0;break;end;
if e=1 then begin inc(c);a[c]:=b;end;
end;
readln(n);
for i:=1 to c do
begin
if n=1 then break;
while n mod a[i]=0 do begin inc(y[a[i]]);n:=n div a[i];end;
end;
g:=0;
for i:=1 to 1000000 do
if y[i]<>0 then begin inc(g);x[g,1]:=i;x[g,2]:=y[i];end;
for i:=1 to g-1 do
begin
if x[i,2]=1 then write(x[i,1],'*') else
write(x[i,1],'^',x[i,2],'*');
end;
if x[g,2]=1 then writeln(x[g,1]) else
writeln(x[g,1],'^',x[g,2]);
end.
第5题：
var a,b,c,d,e,f,g,h,i,j,k,m,n:longint;
begin
readln(a,b,c);
for i:=1 to c div a-1 do
begin
d:=a*i;
e:=c-d;
if e mod b=0 then writeln(i,' ',e div b);
end;
end.
第6题：
var a,b,c,d:real;i,j,k:longint;
begin
readln(k);
a:=1;j:=1;
while a<=k do
begin
inc(j);
a:=a+1/j;
end;
writeln(j);
end.
第7题：
var a:array[0..27,1..2]of longint;
b,c,d,e,f,g,h,i,j,k,m,n:longint;
begin
readln(n);n:=n mod 1000;m:=n;
b:=n div 100+n div 10 mod 10+n mod 10;a[b,1]:=1;
for i:=2 to 5000 do
begin
m:=m*n mod 1000;
b:=m div 100+m div 10 mod 10+m mod 10;
if a[b,1]=0 then a[b,1]:=i else
if a[b,2]=0 then a[b,2]:=i else continue;
end;
h:=maxlongint;
for i:=0 to 27 do
begin
if (a[i,1]<>0)and(a[i,2]<>0) then
if a[i,1]+a[i,2]<h then
begin
h:=a[i,1]+a[i,2];e:=a[i,1];f:=a[i,2];
end;
end;
writeln(f,' ',e);
end.
第8题
var a,b,c,d,e,f,g,h,i,j,k,m,n:longint;
begin
readln(n);
for i:=10000 to 99999 do
begin
a:=i div 100;
b:=i div 10 mod 1000;
c:=i mod 1000;
if a mod n+b mod n+c mod n=0 then writeln(i);
end;
end.
这些程序都验证过了，没什么问题
!!!!!``
我看到了呵呵`
你自己在检查你一你的编的程序是否完全真确把``
如果没检查到在找我`
READLN（N）；
FOR I：=1 TO N DO
B：=A[I]*A[I]；
WRITELN（B）；
END。
绛旓細to 10 do read(a[c]);for c:=1 to 9 do for d:=c+1 to 10 do if a[c]>a[d] then begin e:=a[c];a[c]:=a[d];a[d]:=e;end;k:=0;for c:=2 to 9 do k:=k+a[c];writeln(k/8:0:2);end.绗笁棰樼殑鎺掑簭娌″繀瑕佺敤蹇帓锛屽啋娉¤冻鐭ｏ紝鏈鍚庣殑缁撴灉淇濈暀浜2浣嶅皬鏁 ...
绛旓細姹傛淳(灏辨槸3.14鐨勯偅涓),绮剧‘鍒板皬鏁扮偣鍚6浣...璋㈣阿浜嗘ョ敤!姹傛淳(灏辨槸3.14鐨勯偅涓),绮剧‘鍒板皬鏁扮偣鍚6浣...鐢PASCAL璇█姹... 姹傛淳(灏辨槸3.14鐨勯偅涓),...绗笁棰樼浜岄璇锋ゼ涓昏鏄庡叿浣撹緭鍏ュ拰杈撳叆鏍煎紡鍙婂彉閲忕被鍨嬨傛偍鍙互鑷繁缂栦釜娴嬭瘯鏁版嵁鐢ㄤ綘鐨勫拰鎴戠殑绋嬪簭鍒嗗埆娴嬭瘯涓涓嬬粨鏋滄槸鍚︿竴鏍(褰撶劧,涔熶笉鏁繚璇佹垜娌″嚭灏忛棶棰...
绛旓細5銆佽秴甯傚崠鐢垫睜锛屾瘡涓8瑙掗挶锛屾暟閲忚秴杩10涓紝鎵7.5鎶樸傝緭鍏ユ牱渚嬶細num=45 杈撳嚭鏍蜂緥锛歵otal=27.00 program x5 var num锛宲rice锛宼otal锛歳ead锛沚egin write锛堚榥um=鈥欙級锛沖__num___鈶;price:=0.8;if num>10 then ___total:=mun*price*0.75___鈶;total:=num*price;writeln(鈥榯otal=',tota...
绛旓細涓閬Pascal灏忛棶棰,鎬!!! 涓嬮潰鏄竴閬揚ascal灏忕▼搴弍rogramt2;constn=200;varsi,pr:setof2..n;x,j,m:integer;beginreadln(m);si:=[2..m];pr:=[]...浠ヤ笂鏄竴浜涘皬棰樼洰,甯屾湜瑙ｇ瓟,鍐嶈繃鍑犲ぉ灏辫鍒濊禌浜,璺眰绛旀!!!O(鈭鈭)O璋㈣阿 灞曞紑 鎴戞潵绛 4涓洖绛 #鐑# 浣犲彂鏈嬪弸鍦堜細浣跨敤閮ㄥ垎浜哄彲瑙佸姛鑳藉悧...
绛旓細杩欐槸鎸囬拡涓殑閾捐〃 閾捐〃 1 寤虹珛閾捐〃 閾捐〃鏄姩鎬佹暟鎹粨鏋勭殑涓绉嶅熀鏈舰寮忋傚鏋滄垜浠妸鎸囬拡鎵鎸囩殑涓涓瓨璐崟鍏冨彨鍋氱粨鐐癸紝閭ｄ箞閾捐〃灏辨槸鎶婅嫢骞蹭釜缁撶偣閾炬垚浜嗕竴涓层傛垜浠妸閾捐〃鍙仛鍔ㄦ佹暟鎹粨鏋勶紝鏄洜涓洪摼琛ㄤ腑鐨勭粨鐐瑰彲澧炲彲鍑忥紝鍙鍙皯锛屽彲鍦ㄤ腑闂翠换鎰忎竴涓綅缃彃鍏ュ拰鍒犻櫎銆備笅闈㈠氨鏄竴涓摼琛細锛堝浘T10锛2锛夋瘡涓...
绛旓細涓嬩竴涓鎻掑叆鐨勫叧閿爜涓57,鍏舵彃鍏ョ殑浣嶇疆涓( 銆侫. 4 B. 5 C. 6 D. 7 E. 8璇锋牴鎹笅闈㈡槸涓娈PASCAL绋嬪簭,鍒ゆ柇绗8銆9棰樸俧or h :=1 to n-...5銆両nternet缁欐垜浠彁渚涗簡璧勬簮鍏变韩銆佹祻瑙堛佹绱俊鎭拰杩滅▼鐧诲綍绛夊绉嶆湇鍔,涓嬮潰鍑犱釜閫夐」涓敤浜庤繙绋嬬櫥褰曠殑鏄( )銆侫.WWW B.TCP/IP C.Telnet D.E-mail E...
绛旓細var n,m,a,b,c,d,s:integer;begin readln(n,m);for a:=1 to n div 10 do for b:=1 to (n-a*10)div 5 do for c:=1 to (n-10*a-5*b) div 2 do begin d:=n-a*10-b*5-c*2;if a+b+c+d=m then inc(s);end;writeln(s);end....
绛旓細6.宸茬煡鏈夌被鍨媋rr=ARRAY[1..16]OF STRING;arr鍨嬫暟缁刟涓瓨鏀剧潃浠庣1灞婂埌绗16灞婅冻鐞冧笘鐣 鏉啝鍐涘浗瀹剁殑鍚嶅瓧, 涓嬮潰鐨勫嚱鏁板彲姹傚嚭鍘嗗眾涓栫晫鏉瘮璧涘叡鏈鍑犱釜...1999骞4鏈堝叏鍥借绠楁満绛夌骇鑰冭瘯浜岀骇绗旇瘯璇曞嵎 鍩虹鐭ヨ瘑鍜Pascal璇█绋嬪簭璁捐 绛旀鍙婅瘎鍒嗘爣鍑 涓銆侀夋嫨棰((1)锝(40)棰樻瘡棰1鍒,(41)锝(50)棰樻瘡棰2鍒,鍏...
绛旓細绗簩棰樻濊矾锛歮=2~12妯℃嫙涓閬嶏紝閮芥弧瓒崇殑灏辨槸鐢插拰涔欑殑鍙风爜锛岄兘涓嶆弧瓒崇殑灏辨槸涓欑殑鍙风爜銆傜涓夐鎬濊矾锛氱┓涓7涓埢搴︾殑浣嶇疆锛屽畠浠换鎰忎袱涓埢搴︼紙鍖呮嫭0锛変箣闂寸殑宸濂芥槸1~29銆傜鍥涢锛歷ar m,n,i,j:longint;begin readln(m,n);for i:=m to n do begin tot:=0;for j:=1 to m div 2 do ...
绛旓細(鎻愰珮缁 PASCAL 璇█ 浜屽皬鏃跺畬鎴)鈼忊棌 鍏ㄩ儴绛旀鍧囪鍐欏湪绛旀鍗峰瓙涓,鍐欏湪璇曞嵎绾镐笂涓寰嬫棤鏁 鈼忊棌涓.鍗曢」閫夋嫨棰 (鍏10棰,姣忛1.5鍒,鍏辫15鍒嗐傛瘡棰樻湁涓斾粎鏈変竴涓纭瓟妗.)銆1. 鍥剧伒 (Alan Turing) 鏄( )銆 A) 缇庡浗浜 B) 鑻卞浗浜 C) 寰峰浗浜 D) 鍖堢墮鍒╀汉 E) 娉曞浗浜2. 绗竴涓粰璁＄畻鏈哄啓绋嬪簭鐨勪汉...
