POJ-2034-Anti-prime Sequences
来源:互联网 发布:八爪鱼采集 淘宝 编辑:程序博客网 时间:2024/05/16 12:11
题目给出一个闭区间,要求你求出区间内所有数的一个排列,其需要满足任意连续的k个(2<=k<=d)都是合数
直接DFS飘过~
代码:
#include<cstdio>#include<iostream>#include<cstring>using namespace std;const int maxn=10001;int n,m,d,ans[1001],len;bool isPri[maxn],vis[1001],getans;void Init(){ for(int i=2;i<maxn;i++)for(int j=2;i*j<maxn;j++) isPri[i*j]=1;}void DFS(int now){ if(getans)return; if(now>m-n+1) {getans=1;return; } for(int i=n;i<=m;i++) {bool flag=0;if(!vis[i]){ for(int j=2;j<=d&&now-j>=0;j++) {if(!isPri[ans[now-1]+i-ans[now-j]]) flag=1; } if(flag)continue; ans[now]=ans[now-1]+i; vis[i]=1; DFS(now+1); if(getans)return; vis[i]=0;} }}int main(){ Init(); while(scanf("%d%d%d",&n,&m,&d)&&(n+m+d)) {memset(vis,0,sizeof(vis));len=getans=0;DFS(1);if(!getans) printf("No anti-prime sequence exists.\n");else{ printf("%d",ans[1]); for(int i=2;i<=m-n+1;i++)printf(",%d",ans[i]-ans[i-1]); printf("\n");}
- POJ 2034 Anti-prime Sequences
- poj 2034 Anti-prime Sequences
- POJ 2034 Anti-prime Sequences
- POJ-2034-Anti-prime Sequences
- POJ 2034 Anti-prime Sequences
- poj 2034 Anti-prime Sequences
- POJ-2034 Anti-prime Sequences
- poj 2034 Anti-prime Sequences
- SOJ - 1002 POJ - 2034 Anti-prime Sequences
- poj 2034 Anti-prime Sequences(dfs)
- poj 2034 Anti-prime Sequences(dfs)
- poj 2034 Anti-prime Sequences(dfs)
- [水+dfs] poj 2034 Anti-prime Sequences
- <DFS> POJ 2034 Anti-prime Sequences
- POJ 2034 Anti-prime Sequences DFS+质数
- pku 2034 Anti-prime Sequences
- 递归和回溯 POJ 2034 Anti-prime Sequences
- POJ 2034 Anti-prime Sequences(素数预处理+DFS回溯)
- 趣题:斜边上的动点
- 循环与数组问题4
- android如何让service不被杀死
- outlook中根据主题关键字search mail并绑定到datagridview
- JAVA平台的this关键字
- POJ-2034-Anti-prime Sequences
- 交谈时请看着我的眼睛
- Flex开发ArcGIS问题集锦七:怎样使用导航工具
- 成功人士不用睡觉吗?
- Ubuntu 13.04 server 安装 Apache2+PHP5+MySQL
- Arcgis Symbol
- Java 动态代理机制分析及扩展
- android访问本地服务器
- .NET 使用书签如何对Word模板进行操作