博客
关于我
Prime Ring Problem-dfs
阅读量:326 次
发布时间:2019-03-04

本文共 1452 字,大约阅读时间需要 4 分钟。

#include
#include
#include
int prime (int m) { for(int i=2; i<=sqrt(m); i++) if(m%i==0) return 0; return 1;}int book[1000],a[1000],n;//a[]存数据void bfs(int x) { int i,j,k,l; if(x==n+1&&prime(1+a[n])==1) { printf("1"); for(i=2; i<=n; i++) printf(" %d",a[i]); printf("\n"); } else { for(i=2; i<=n; i++) { if(book[i]==0&&prime(a[x-1]+i)==1) { a[x]=i; book[i]=1; bfs(x+1); book[i]=0; } } }}int main() { int c=1; while(~scanf("%d",&n)) { memset(book,0,sizeof(book)); memset(a,'\0',sizeof(a)); printf("Case %d:\n",c++); book[1]=1; a[1]=1; bfs(2); printf("\n"); }}

Problem Description

A ring is compose of n circles as shown in diagram. Put natural number

1, 2, …, n into each circle separately, and the sum of numbers in
two adjacent circles should be a prime.

Note: the number of first circle should always be 1.

在这里插入图片描述

Input

n (0 < n < 20).

Output

The output format is shown as sample below. Each row represents a

series of circle numbers in the ring beginning from 1 clockwisely and
anticlockwisely. The order of numbers must satisfy the above
requirements. Print solutions in lexicographical order.

You are to write a program that completes above process.

Print a blank line after each case.

Sample Input

6
8

Sample Output

Case 1:
1 4 3 2 5 6
1 6 5 2 3 4

Case 2:

1 2 3 8 5 6 7 4
1 2 5 8 3 4 7 6
1 4 7 6 5 8 3 2
1 6 7 4 3 8 5 2

Source

Asia 1996, Shanghai (Mainland China)

转载地址:http://lqah.baihongyu.com/

你可能感兴趣的文章
mysql复制内容到一张新表
查看>>
mysql复制表结构和数据
查看>>
mysql复杂查询,优质题目
查看>>
MySQL外键约束
查看>>
MySQL多表关联on和where速度对比实测谁更快
查看>>
MySQL多表左右连接查询
查看>>
mysql大批量删除(修改)The total number of locks exceeds the lock table size 错误的解决办法
查看>>
mysql如何做到存在就更新不存就插入_MySQL 索引及优化实战(二)
查看>>
mysql如何删除数据表,被关联的数据表如何删除呢
查看>>
MySQL如何实现ACID ?
查看>>
mysql如何记录数据库响应时间
查看>>
MySQL子查询
查看>>
Mysql字段、索引操作
查看>>
mysql字段的细节(查询自定义的字段[意义-行列转置];UNION ALL;case-when)
查看>>
mysql字段类型不一致导致的索引失效
查看>>
mysql字段类型介绍
查看>>
mysql字段解析逗号分割_MySQL逗号分割字段的行列转换技巧
查看>>
MySQL字符集与排序规则
查看>>
MySQL字符集乱码
查看>>
mysql字符集设置
查看>>