hdu-1016-Prime Ring Problem
2017-09-27 20:17
288 查看
题目链接
题意:素数环
思路:数据较小 搜索暴力即可
code
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
bool vis[25];
int a[25],n;
bool IsPrime(int x)
{
for(int i=2;i<=sqrt(x*1.0);i++)
if(x%i==0) return false;
return true;
}
void dfs(int cur)
{
if(cur==n&&IsPrime(a[0]+a[n-1])){
printf("%d",a[0]);
for(int i=1;i<n;i++)
printf(" %d",a[i]);
printf("\n");
return ;
}
else{
for(int i=2;i<=n;i++){
if(!vis[i]&&IsPrime(a[cur-1]+i)){
a[cur]=i;vis[i]=true;
dfs(cur+1);
vis[i]=false;
}
}
}
return ;
}
int main()
{
int tt=0;
while(~scanf("%d",&n)){
printf("Case %d:\n",++tt);
memset(vis,0,sizeof(vis));
memset(a,0,sizeof(a));
a[0]=1;
dfs(1);
printf("\n");
}
return 0;
}
题意:素数环
思路:数据较小 搜索暴力即可
code
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
bool vis[25];
int a[25],n;
bool IsPrime(int x)
{
for(int i=2;i<=sqrt(x*1.0);i++)
if(x%i==0) return false;
return true;
}
void dfs(int cur)
{
if(cur==n&&IsPrime(a[0]+a[n-1])){
printf("%d",a[0]);
for(int i=1;i<n;i++)
printf(" %d",a[i]);
printf("\n");
return ;
}
else{
for(int i=2;i<=n;i++){
if(!vis[i]&&IsPrime(a[cur-1]+i)){
a[cur]=i;vis[i]=true;
dfs(cur+1);
vis[i]=false;
}
}
}
return ;
}
int main()
{
int tt=0;
while(~scanf("%d",&n)){
printf("Case %d:\n",++tt);
memset(vis,0,sizeof(vis));
memset(a,0,sizeof(a));
a[0]=1;
dfs(1);
printf("\n");
}
return 0;
}
相关文章推荐
- HDU-1016 Prime Ring Problem
- Prime Ring Problem(HDU-1016)
- HDU 1016 Prime Ring Problem (经典DFS)
- HDU 1016 Prime Ring Problem
- hdu 1016 Prime Ring Problem
- hdu 1016 Prime Ring Problem
- hdu1016 prime ring problem
- HDU - 1016 Prime Ring Problem
- Hdu-1016 Prime Ring Problem【DFS】
- hdu 1016 Prime Ring Problem
- hdu 1016 Prime Ring Problem(dfs)
- hdu 1016 Prime Ring Problem
- HDU 1016 Prime Ring Problem
- HDU 1016 Prime Ring Problem
- hdu 1016 Prime Ring Problem
- HDU-1016 Prime Ring Problem [DFS]
- hdu1016 Prime Ring Problem
- HDU 1016 Prime Ring Problem
- HDU 1016 (Prime Ring Problem)
- HDU-1016-Prime Ring Problem