Title Link: http://ac.jobdu.com/problem.php?pid=1459
Detailed Links: https://github.com/zpfbuaa/JobduInCPlusPlus
Reference code:
////1459 Prime Ring Problem.cpp//Jobdu////Created by Pengfei_zheng on 23/04/2017.//copyright©2017 Pengfei_zheng. All rights reserved.//#include<stdio.h>#include<iostream>#include<algorithm>#include<string.h>#include<cmath>#definePRIME 13#defineMax_size 21using namespacestd;intN;intAns[max_size];BOOLUsed[max_size];intprime[]={2,3,5,7, One, -, -, +, at, in, to,Panax Notoginseng, A};BOOLJudgeintx) { for(inti =0; i < PRIME; i++){ if(prime[i]==x)return true; } return false;} voidCheck () {if(!judge (ans[n]+ans[1]))return; for(inti =1; I <= N; i++){ if(i!=1) printf (" "); printf ("%d", Ans[i]); } printf ("\ n");} voidDFS (intnum) { if(num>1){ if(!judge (Ans[num] + ans[num-1]))return; } if(num==N) {check (); return; } for(inti =2; I <= N; i++){ if(!Used[i]) {Used[i]=true; Ans[num+1] =i; DFS (Num+1); Used[i]=false; } }} intMain () {intKase =0; while(SCANF ("%d", &n)! =EOF) {Kase++; memset (Used,false,sizeof(used)); ans[1] =1; used[1]=true; printf ("Case %d:\n", Kase); DFS (1); printf ("\ n"); } return 0;}/************************************************************** problem:1459 User:zpfbuaa language:c++ Re sult:accepted time:590 Ms memory:1520 kb****************************************************************/
Topic 1459:prime ring problem (prime ring problem-recursive algorithm)