1、 x = y; y = t;void hamilton(int k ) if(kn & cxk-1x1=1)/一个解 output(x); else for(int i=k;i+) swap(xk,xi); if (cxk-1xk=1) hamilton(k+1); swap(xi,xk); int main() int i; for (i = 1; i 6 ; + i) xi = i; output(x); return 0; int n = 5; memset(c, 0, sizeof(c); c12 = true; c21 = true; c14 = true; c41 = true;
2、c24 = true; c42 = true; c23 = true; c32 = true; c35 = true; c53 = true; c45 = true; c54 = true; c25 = true; c52 = true; c34 = true; c43 = true; for(int i = 1;= n; i+) xi = i; /swap(x1,x5); hamilton(2); /默认以第一个城市开始,搜索解空间树(子集树形式)直接从第二层开始 cout 1) xk+; while(xk = n) if(visitedxk=0 & cxk - 1xk=1)/未到,有边 b
3、reak; if(xk = n & k=n & cxkx1=1)/一个解 for(k=1;kk+) coutxk cout k-; / break; 输出一个解结束时用他替代上两句 else if (xk=n & k/*程序在此书写*/stdlib.hmath.h/*程序书写完毕*/ #ifdef DEBUG start(); #endif /*程序在此书写*/ int base = 1,5,10,20,50,100,200,500,1000,2000; int k = sizeof(base)/sizeof(int); /*0-9*/ unsigned long int f1050001;
4、int x; int i,j; memset(f,0,sizeof(f); for(i = 0; 50001; +i) f0i = 1; 10; fi0 = 1; for(j = 1; j +j) if(j0) count += atoi(str); p = strstr(p,str)+strlen(str); if(count50000) printf(%dn,count); else%ldn,f9count-1); /*程序书写完毕*/ end(_FILE_);/*/迭代递归 int a11; /*int base = 0,1,5,10,20,50,100,200,500,1000,200
5、0;*/ int base = 0,2000,1000,500,200,100,50,20,10,5,1; int k = sizeof(base)/sizeof(int)-1; /*1-10*/ int x,m; int i,j,s; int lines = 0; char *p,*q,msg5000,str500,num500; int maxnum = 0; lines = k; memset(a,0,sizeof(a); x = atoi(str); alines = x; count += x; lines -; /*printf( continue; int s10; int sp
6、10; memset(s,0,sizeof(s); int row = 1; sprow = -baserow; s0 = count; s1 = count; long long int l = 0; while(row sprow += baserow; if(baserow=1&srowsprow) sprow = srow; /printf(%d-%d-%dn,row,srow,sprow); if(srow if(rown) output(x); for (int i=1;=m;i+) xt=i; if (ok(t) backtrack(t+1); xt=0; int i, j; 5; for(j = 1; j+) cij = false; c13 = true; c31 = true; backtrack(1);着色 回溯 迭代/第一个结点也可以有m种着色方案void m_coloring(int n, int m) k =1;=1)= m) if( ok(k)=1) break; else xk+; = m & k=n) /一个解 for(i=1; /return; 如果只需要一个解可以将上两句去掉,加入返回语句=m &n) else/回溯! /memsetc54 = true;m_coloring(5, 100);return 0;
copyright@ 2008-2022 冰豆网网站版权所有
经营许可证编号:鄂ICP备2022015515号-1