Uva 524 相邻素数全排列

传送门:https://vjudge.net/problem/UVA-524

回溯法深搜,我的硬是不知道哪里错了,和别人AC的程序输出一模一样

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
const int maxn = 50;
int n;
int isp[maxn];
int vis[maxn];
int A[maxn] = {1};
void pre() {
    memset(vis,0,sizeof(0));
    for(int i = 0; i <= maxn; i++) {
        isp[i] = 1;
    }
    for(int i = 2; i <= maxn; i++) {
        for(int j = i+i; j <= maxn; j+=i) {
            isp[j] = 0;
        }

    }
    isp[0] = 0;
    isp[1] = 0;
}
//bool IsPrime( int num )
//{
//     int tmp = sqrt( num);
//     for(int i= 2;i <=tmp; i++)
//        if(num %i== 0)
//          return 0 ;
//     return 1 ;
//}
void dfs(int cur) {
    if(cur == n && isp[A[0]+A[n-1]]) {
        for(int i = 0; i < n; i++) {
            i ? printf(" %d", A[i]) : printf("%d", A[i]);
        }
        printf("\n");
    }
    //A[cur-1]相邻的上一个数,逆时针
    //A[cur]为当前数
    //枚举每一个没访问过的数
    else for(int i = 2; i <= n; i++) {
        if(!vis[i] && isp[i+A[cur-1]]) {
            A[cur] = i;
            vis[i] = 1;
            dfs(cur+1);
            vis[i] = 0;
        }
    }
}
int main()
{
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
    int casen = 0;

    while(~scanf("%d",&n)) {
        if(casen!=0) printf("\n");
        pre();
        printf("Case %d:\n",++casen);
        dfs(1);
//        printf("\n");
    }
    return 0;
}

别人AC的程序:

#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#define MAXN 50
using namespace std;

int n, A[MAXN] = {1}, ispe[MAXN], vis[MAXN];

void dfs(int cur) {
    if(cur == n&& ispe[A[0] + A[n - 1]]) {
        for(int i = 0; i < n; i++) {
            i ? printf(" %d", A[i]) : printf("%d", A[i]);
        }
        printf("\n");
    } else for(int i = 2; i <= n; i++) {

        if(!vis[i]&& ispe[i + A[cur - 1]]) {
            A[cur] = i;
            vis[i] = 1;
            dfs(cur + 1);
            vis[i] = 0;
        }
    }
}

int main() {
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
    for(int i = 2; i <= 50; i++)
        ispe[i] = 1;
    for(int i = 2; i <= 50; i++)
        for(int j = i + i; j + i <= 50; j += i)
            ispe[j] = 0;
    int kase = 0;
    while(cin >> n) {
        if(kase++)
            printf("\n");
        printf("Case %d:\n", kase);
        dfs(1);
    }
    return 0;
}

我把输出复制在一个文件里,最后一个空行去掉,然后专门用下面程序判断两个输出是否一样,结果式样的,输出为空

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
char str1[90000][50];
char str2[90000][50];

int main()
{
    freopen("in.txt","r",stdin);
    for(int i=0;i<85065;i++)
        gets(str1[i]);
    for(int i=0;i<85065;i++)
        gets(str2[i]);
    for(int i=0;i<85065;i++)
    {
        if(strcmp(str1[i],str2[i])!=0)
            printf("%d\n",i+1);
    }
    return 0;
}
时间: 2024-10-25 00:21:21

Uva 524 相邻素数全排列的相关文章

[2016-02-19][UVA][524][Prime Ring Problem]

UVA - 524 Prime Ring Problem Time Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu Submit Status Description A ring is composed of n (even number) circles as shown in diagram. Put natural numbers  into each circle separately, and the

UVa 524 - Prime Ring Problem

题目:把1-n,连续的放到一个环里,使相邻的数字和为素数,输出所有结果. 分析:搜索+剪枝.如果裸搜,用dancing-links那种拆装的链表,应该差不多满足16的数据量. 这里利用一个性质进行剪枝:相邻的数字一定是奇偶性不同的数字. (如果上述假设不成立,则存在相邻的奇数或偶数,那么他们的和一定是大于2的偶数,不是素数) 根据上面的假设,还有一条推论:只有n为偶数时才有解. (n为奇数,一直至少有一对奇数相邻,同上,矛盾(鸽巢原理)) 因此,每次搜索的数据其实是n/2,时间复杂度为O((n/

UVA - 524 Prime Ring Problem(dfs回溯法)

UVA - 524 Prime Ring Problem Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu Description A ring is composed of n (even number) circles as shown in diagram. Put natural numbers  into each circle separately, and the sum of number

UVA - 524 Prime Ring Problem(素数环)(回溯法)

题意:输入n,把1~n组成个环,相邻两个数之和为素数. 分析:回溯法. #pragma comment(linker, "/STACK:102400000, 102400000") #include<cstdio> #include<cstring> #include<cstdlib> #include<cctype> #include<cmath> #include<iostream> #include<s

UVA 524 素数环 【dfs/回溯法】

Description A ring is composed of n (even number) circles as shown in diagram. Put natural numbers 1,2,3,...,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 alwa

Uva 524 Prime Ring

如果用全排列生成之后,在判断是否是素数环是会超时的,应该用回溯. 回溯的时候  首先要注意 递归边界 ,结束的时候别忘记判断最后一个和第一个元素能否成立  还有要记得vis的使用和递归之后的清理. 1 #include <cstdio> 2 #include <cstring> 3 using namespace std; 4 int n,p=0; 5 int a[50+10],vis [50+10]; 6 bool isprime[50+10]; 7 void dfs(int c

UVa 524 Prime Ring Problem【回溯】

题意:给出n,把从1到n排成一个环,输出相邻两个数的和为素数的序列 照着紫书敲的, 大概就是这个地方需要注意下,初始化的时候a[0]=1,然后dfs(1),从第1个位置开始搜 1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4 #include <cmath> 5 #include<stack> 6 #include<vector> 7 #include<m

UVa 524 Prime Ring Problem(回溯法)

传送门 Description A ring is composed of n (even number) circles as shown in diagram. Put natural numbers 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 sho

uva 524(素数环)

Description A ring is composed of n (even number) circles as shown in diagram. Put natural numbers 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. Inp