Ò׽ؽØÍ¼Èí¼þ¡¢µ¥Îļþ¡¢Ãâ°²×°¡¢´¿ÂÌÉ«¡¢½ö160KB

¼òµ¥µÄc³ÌÐò£¬±àÒë²»¹ý£¬ÇóÖú

Ô´´úÂëÈçÏ£¬ÎÒÕÒÁ˺ܾ㬾ÍÊDz»ÖªµÀ´íÔÚÄÄÁË¡£
ÇóÖ¸µã¡£
C/C++ code:

#include<stdio.h>
#include<stdlib.h>

#define OK 1
#define ERR 0

int p[8][8]={0};
int i = 0, j = 0;
int arr[8] = { 8,8,8,8,8,8,8,8 };

int solve(int (*t)[8]);
int pass(int t[8], int n);
int display(int (*arr)[8], int n);

int main()
{
solve(p);
display(p,8);
return 0;
}

int solve(int (*t)[8])
{
while (i++ != 7){
(*t)[i] = 1;
arr[j++] = i;
if (pass(arr,j))
sovle(t++);
else{
arr[--j] = 8;
(*t)[i] = 0;
}
}
}

int pass(int t[8], int n)
{
int a,b;
for (a = 1; a < n; a++)
for (b = 0; b < a; b++)
if (t[a] == t[b])
return ERR;
return OK;
}

int display(int (*arr)[8], int n)
{
int a,b;
for (a = 0; a < n; a++) {
for (b = 0; b < n; b++)
printf("%d\t",arr[a][b]);
printf("\n");
}
return 0;;
}

´íÎóÊÇʲô£¬³ö×ÔÄÄÒ»ÐУ¬Õâ¸öÕÒ³öÀ´ÁËÂð


int solve(int (*t)[8])º¯ÊýÌåÀï2¸ö´íÎó£¬Ò»¸öÊÇÆ´Ð´´íÎó£¬Ò»¸öÊÇȱ·µ»ØÖµ¡£

2¡¢3Â¥ÒѾ­ËµµÄºÜÇå³þÁË¡£lz»¹Óв»Ã÷°×µÄµØ·½Âð£¿

лл£¡£¡
ÎÒÒѾ­×öÁËÐ޸쬱àÒëͨ¹ý£¬µ«Êǵò»µ½ÎÒÒªµÄ½á¹û£¬Âé·³´ó¼Ò¿´¿´¡£

C/C++ code
{{---


Ïà¹ØÎÊ´ð£º

¸ÕѧC£¬ÓÃCʵÏÖ±àÂë - C/C++ / CÓïÑÔ

#include"stdio.h"
#include"stdlib.h"
void ContrTwo(char i)
{
char str1[8];
itoa(i,str1,2);
printf("%s",str1);
}
unsigned char leftRot(char str,int i);
unsign ......

C#ÌîÍøÒ³±íµ¥µÄÎÊÌâ - .NET¼¼Êõ / C#

ÎÒÕâÀïÓÐÒ»¸öµÇ½WIFIÍøÂçµÄÒ³Ãæ¡£ÓÉÓÚWIFI¾­³£¶ÏÏߣ¬ËùÒÔÒª·´¸´µØÔÚÕâ¸öÍøÒ³Éϵǽ£¬Ã»·¨ÎÞÈËÖµÊØ¡£
ËùÒÔ£¬ÎÒÏë×öÒ»¸öC#³ÌÐò£¬·ÅÒ»¸öwebbrowser¿Ø¼þ£¬×Ô¶¯Ìî±í²¢×Ô¶¯µã»÷Ìá½»°´Å¥¡£
ÎÊÌâÒ»£º
»ù±¾ÕÕÍøÉÏÕҵijÌÐò ......

³ÖÐø¼¯³É-CÏîÄ¿ - C/C++ / CÓïÑÔ

¸÷λ´óÏÀ£º
ÓÐûÓÐÖªµÀÈçºÎÔÚCÓïÑÔÖÐʹÓóÖÐø¼¯³É¡£´Ó³õ²½µÄµ÷²éÀ´¿´£¬Ã²ËÆÊ¹ÓÃCruiseControlµÄÈ˺ܶ࣬µ«ÊǸÿªÔ´¹¤¾ß¶ÔCÓïÑÔµÄÖ§³ÖÃ²ËÆºÜÓÐÏÞ£¬±àÒëºÍ²âÊÔ½á¹û¿ÉÄÜÐèÒª×Ô¼º´¦Àí£¬Éú³ÉCruiseControlÄܹ»´¦ÀíµÄXMLÎ ......

C/SÏîÄ¿¼Ü¹¹Éè¼Æ----ÇóÖú - Java / Java SE

±¾ÈËÕýÔÚÓÃJava×öÒ»¸öC/S¼Ü¹¹µÄÏîÄ¿£¬ 
¿ÉÊÇÓÉÓÚÏîÄ¿±È½Ï´ó£¬Ç°ÆÚ¶Ô¼Ü¹¹µÄÉè¼ÆÓÈÆäÖØÒª£¬ÒòΪºóÆÚ¿ÉÄÜËæÊ±»á¼Ó¸ö¹¦ÄÜ»òÕßÈ¥µôijЩ¹¦ÄÜ¡£ 
ËùÒÔÌØµØÑ°ÇóÈçºÎÉè¼ÆC/SµÄ¼Ü¹¹Ê¹³ÌÐò¸ü¼ÓÃæÏò¶ÔÏó¸ü¼ÓÒ×ÓÚά ......

°ïæ¿´¿´Õ⼸¸öC - C/C++ / CÓïÑÔ

°ï°ï棬лл~
1. Write a program to perform a topological sort on a graph.
2. Write a program to solve the single‐source shortest‐path problem (Dijkstra
algorithm).
3. Write a program ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ