简单的搜索题,用递归
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.
URL : http://acm.hdu.edu.cn/showproblem.php?pid=1016
Name : 1016 Prime Ring Problem
Date : Wednesday, August 10, 2011
Time Stage : 2 hours less
Result:
4378651 2011-08-10 16:13:31 Accepted 1016
171MS 204K 1390 B
C++ pyy
Test Data:
Review:
//----------------------------------------------------------------------------*/
#include <stdio.h>
#include <string.h>
#define MAXSIZE 40
int n, len, tcase ;
int prime[MAXSIZE], ans[MAXSIZE], used[MAXSIZE] ;
void dfs (int a)
{
ans[len++] = a ;
used[a] = 1 ;
int i ;
if (len - 1 == n)
{
if (prime[ans[1]+a])
{
for (i = 1 ; i < n ; ++i)
{
printf ("%d ", ans[i]) ;
}
printf ("%d\n", ans[i]) ;
}
}
else
{
for (i = 2 ; i <= n ; ++i)
{
if (prime[i + a] && !used[i])
{
dfs (i) ;
}
}
}
--len ;
used[a] = 0 ;
}
int main ()
{
int i, j ;
memset (prime, 1, sizeof (prime)) ;
for (i = 2 ; i < MAXSIZE ; ++i)
{
if (prime[i])
for (j = i ; j*i < MAXSIZE ; ++j)
prime[j*i] = 0 ;
}
tcase = 0 ;
while (scanf ("%d", &n) != EOF)
{
memset (used, 0, sizeof (used)) ;
len = 1 ;
++tcase ;
printf ("Case %d:\n", tcase) ;
dfs (1) ;
puts ("") ;
}
return 0 ;
}
分享到:
相关推荐
HDU 1022 Train Problem I 附详细思路
Largest prime factor Everybody knows any number can be combined by the prime number. Now, your task is telling me what position of the largest prime factor. The position of prime 2 is 1, prime 3 is 2,...
HDU的1250,主要是利用高精度加法,但是代码有点繁琐,效率不是很高
杭电ACMhdu1163
HDU1059的代码
hdu1001解题报告
hdu 1574 passed sorce
HDU的一题........HDU DP动态规
hdu acm 教案 搜索入门 hdu acm 教案 搜索入门
hdu2101AC代码
搜索 dfs 解题代码 hdu1241
hdu 5007 Post Robot 字符串枚举。 暴力一下就可以了。
hdu acm 教案 动态规划(1) hdu acm 教案 动态规划(1)
ACM HDU题目分类,我自己总结的大概只有十来个吧
hdu 1166线段树代码
HDU最全ac代码
hdu动态规划算法集锦
自己做的HDU ACM已经AC的题目
hdu题目分类
HDU图论题目分类