摘要:
编辑器加载中... 阅读全文
摘要:
#include<iostream>#include<cstdio>#include<cstring>using namespace std;int num,hash[14],flag[14]={0};void DFS( int cnt,int n ){ if( cnt == n+1 ) { num++; return ; } for( int i = 1; i<= n ; i++ ) { if( !flag[i] ) { hash[cnt]=i; int Flag = 0;... 阅读全文
摘要:
#include<iostream>#include<cstdio>using namespace std;int num[1024],flag,save[1024],number,N;void DFS( int n, int sum ,int cnt){ if( sum == number ) { flag = 1; for( int i = 0; i< cnt ; i++ ) { printf( i==0?"%d":"+%d",save[i] ); } puts( "" ); ret... 阅读全文