题解有群魔乱舞的各种做法
by ziiidan @ 2019-05-22 18:26:47
~~打表~~
by foxdemon @ 2019-05-22 18:30:05
N=8，怎么做都可以
by xcxcli @ 2019-05-22 18:32:15
暴力
by songyihang @ 2019-05-22 18:37:37
打表
by 142857cs @ 2019-05-22 18:49:14
这题可以把n范围写大点吓人，然后数据是1到8（雾）
by 142857cs @ 2019-05-22 18:51:10
打表筛两次，最后83个数据。
by Auroras @ 2019-05-31 23:38:58
哈哈哈群魔乱舞
by 966123anyunchuan @ 2020-11-09 21:20:58
```cpp
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
int n;
bool isPrime(int n)
{
if (n < 2) return false;
for (int i = 2; i * i <= n; i++)
{
if (n % i == 0) return false;
}
return true;
}
void dfs(int step, int last)
{
if (last != 0 && !isPrime(last)) return ;
if (step > n)
{
cout << last << endl;
return ;
}
for (int i = 1; i <= 9; i++)
{
dfs(step + 1, last * 10 + i);
}
}
int main()
{
cin >> n;
dfs(1, 0);
return 0;
}
``
by pjz123 @ 2022-08-25 14:26:04