很简单的一道题,使用深度优先搜索,注意一点,Superprime数的第一个数字只能是2、3、5、7,而除了2、5的其它素数的个位数必然是1、3、7、9
Code
/**//*
ID: sdjllyh1
PROG: sprime
LANG: JAVA
complete date: 2008/11/24
author: LiuYongHui From GuiZhou University Of China
more article: www.cnblogs.com/sdjls
*/
import java.io.*;
import java.util.*;
public class sprime
{
private static int n;
private static int[] answers = new int[100];
private static int ansCount = 0;
public static void main(String[] args) throws IOException
{
init();
run();
output();
System.exit(0);
}
private static void run()
{
dfs_searchSuperprime(0, 0);
}
//深度优先搜索,枚举所有可能的情况
//dep即是深度又是ribs的长度
private static void dfs_searchSuperprime(int dep, int ribs)
{
if (dep == n)
{
if (isPrime(ribs))
{
answers[ansCount] = ribs;
ansCount++;
}
}
else if(dep == 0)//设置开头分别为2、3、5、7,然后开始深度搜索
{
dfs_searchSuperprime(1, 2);
dfs_searchSuperprime(1, 3);
dfs_searchSuperprime(1, 5);
dfs_searchSuperprime(1, 7);
}
else
{
//如果是素数才继续深度枚举
if (isPrime(ribs))
{
//注意,除了2、5以外,所有的素数都是以1、3、7、9结尾的
dfs_searchSuperprime(dep + 1, ribs * 10 + 1);
dfs_searchSuperprime(dep + 1, ribs * 10 + 3);
dfs_searchSuperprime(dep + 1, ribs * 10 + 7);
dfs_searchSuperprime(dep + 1, ribs * 10 + 9);
}
}
}
//判断value是否为素数
private static boolean isPrime(int value)
{
int s = (int)Math.sqrt(value);
for (int i = 2; i <= s; i++)
{
if (value % i == 0)
{
return false;
}
}
return true;
}
private static void init() throws IOException
{
BufferedReader f = new BufferedReader(new FileReader("sprime.in"));
n = Integer.parseInt(f.readLine());
f.close();
}
private static void output() throws IOException
{
PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("sprime.out")));
for (int i = 0; i < ansCount; i++)
{
out.println(answers[i]);
}
out.close();
}
}
/**//*
ID: sdjllyh1
PROG: sprime
LANG: JAVA
complete date: 2008/11/24
author: LiuYongHui From GuiZhou University Of China
more article: www.cnblogs.com/sdjls
*/
import java.io.*;
import java.util.*;
public class sprime
{
private static int n;
private static int[] answers = new int[100];
private static int ansCount = 0;
public static void main(String[] args) throws IOException
{
init();
run();
output();
System.exit(0);
}
private static void run()
{
dfs_searchSuperprime(0, 0);
}
//深度优先搜索,枚举所有可能的情况
//dep即是深度又是ribs的长度
private static void dfs_searchSuperprime(int dep, int ribs)
{
if (dep == n)
{
if (isPrime(ribs))
{
answers[ansCount] = ribs;
ansCount++;
}
}
else if(dep == 0)//设置开头分别为2、3、5、7,然后开始深度搜索
{
dfs_searchSuperprime(1, 2);
dfs_searchSuperprime(1, 3);
dfs_searchSuperprime(1, 5);
dfs_searchSuperprime(1, 7);
}
else
{
//如果是素数才继续深度枚举
if (isPrime(ribs))
{
//注意,除了2、5以外,所有的素数都是以1、3、7、9结尾的
dfs_searchSuperprime(dep + 1, ribs * 10 + 1);
dfs_searchSuperprime(dep + 1, ribs * 10 + 3);
dfs_searchSuperprime(dep + 1, ribs * 10 + 7);
dfs_searchSuperprime(dep + 1, ribs * 10 + 9);
}
}
}
//判断value是否为素数
private static boolean isPrime(int value)
{
int s = (int)Math.sqrt(value);
for (int i = 2; i <= s; i++)
{
if (value % i == 0)
{
return false;
}
}
return true;
}
private static void init() throws IOException
{
BufferedReader f = new BufferedReader(new FileReader("sprime.in"));
n = Integer.parseInt(f.readLine());
f.close();
}
private static void output() throws IOException
{
PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("sprime.out")));
for (int i = 0; i < ansCount; i++)
{
out.println(answers[i]);
}
out.close();
}
}