排列组合bfs

bfs查找组合数，就是保证有序，关键是 i= start 只能取后面的值，不能取前面的

#include<iostream>
#include<math.h>
using namespace std;
#define N 23
int a[N], path[N], st[N];
int n, k, cnt;
int isF(int x)
{
	int flag = 1;
	for(int i = 2; i <= sqrt(x); i++)
		if(x % i == 0)
		{
			flag = 0;
			break;
		}
	return flag;
}
void dfs(int u, int start)
{
	
	//if(u + n - start + 1 < k) return;
	if(u == k)
	{
		int sum = 0;
		for(int i = 0; i < k; i++)
		{
			sum += path[i];
			//cout << path[i] << " ";
		
		}
		//cout << endl;
		
		cnt += isF(sum);
		return;
	}
	for(int i = start; i < n; i++)
	{
		
		if(!st[i])
		{
			path[u] = a[i];
			st[i] = 1;
			dfs(u + 1, i + 1);
			st[i] = 0;
		}
		
	}
}
int main()

{
	cin >> n >> k;
	for(int i = 0; i < n; i++)
		cin >> a[i];
	dfs(0, 0);
	cout << cnt ;
	return 0;
} 

全排列

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 10
int n;
int path[N];
int st[N];
void dfs(int u)
{
    if(u == n)
    {
        for (int i = 0; i < n; i ++ ) cout << path[i] << " ";
        puts("");
        return;
    }
    for(int i = 1; i <= n; i++)
    {
        if(!st[i])
        {
            path[u] = i;
            st[i] = true;
            dfs(u + 1);
            st[i] = false;
        }
    }
}
int main()
{
    
    cin >> n;
    dfs(0);
    return 0;
}