USACO Superprime Rib

最新推荐文章于 2021-03-16 14:10:33 发布

码代码的猿猿的AC之路

最新推荐文章于 2021-03-16 14:10:33 发布

阅读量1.5k

点赞数 1

分类专栏：搜索

本文链接：https://blog.csdn.net/ck_boss/article/details/18899937

版权

搜索专栏收录该内容

51 篇文章 0 订阅

订阅专栏

Superprime Rib

Butchering Farmer John's cows always yields the best prime rib. You can tell prime ribs by looking at the digits lovingly stamped across them, one by one, by FJ and the USDA. Farmer John ensures that a purchaser of his prime ribs gets really prime ribs because when sliced from the right, the numbers on the ribs continue to stay prime right down to the last rib, e.g.:

     7  3  3  1

The set of ribs denoted by 7331 is prime; the three ribs 733 are prime; the two ribs 73 are prime, and, of course, the last rib, 7, is prime. The number 7331 is called a superprime of length 4.

Write a program that accepts a number N 1 <=N<=8 of ribs and prints all the superprimes of that length.

The number 1 (by itself) is not a prime number.

PROGRAM NAME: sprime

INPUT FORMAT

A single line with the number N.

SAMPLE INPUT (file sprime.in)

OUTPUT FORMAT

The superprime ribs of length N, printed in ascending order one per line.

SAMPLE OUTPUT (file sprime.out)

USACO Gateway | Comment or Question

/*
ID: qhn9992
PROG: sprime
LANG: C++11
*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>

using namespace std;

bool isprime(int x)
{
    if(x==1) return false;
    int k=sqrt(x);
    for(int i=2;i<=k;i++)
    {
        if(x%i==0) return false;
    }
    return true;
}

int n;

void dfs(int x,int temp)
{
    if(x==n)
    {
        printf("%d\n",temp);
    }
    for(int i=1;i<=9;i++)
    {
        int tt=temp*10+i;
        if(isprime(tt))
            dfs(x+1,tt);
    }
}

int main()
{
    freopen("sprime.in","r",stdin);
    freopen("sprime.out","w",stdout);
    scanf("%d",&n);
    dfs(0,0);
    return 0;
}