#UVa:524-Prime Ring Problem

利用Backtracking去將填所有可能性,然後邊填邊判斷兩兩之間之總和是否為質數即可。

C++(0.120)

/*******************************************************/
/* UVa 524 Prime Ring Problem                          */
/* Author: LanyiKnight [at] knightzone.studio             */
/* Version: 2016/04/17                                 */
/*******************************************************/
#include <iostream>
#include <cstdio>
using namespace std;

void findCircle(int circle[], int i, int n, bool hasUsed[], bool isComposite[]){
  if( i == n ){
    if( !isComposite[ circle[n-1] + circle[0] ] ){
      for( int j = 0 ; j < n ; ++j ){
        if( j > 0 ){
          printf(" ");
        }
        printf("%d", circle[j]);
      }
      printf("\n");
    }

    return;
  }

  for( int j = 2 ; j <= n ; ++j ){
    if( hasUsed[j] ){
      continue;  
    }

    if( !isComposite[ circle[i-1] + j ] ){
      hasUsed[j] = true;
      circle[i] = j;
      findCircle(circle, i+1, n, hasUsed, isComposite);
      hasUsed[j] = false;
    }
  }

}


int main(){
  bool isComposite[50] = {false};
  for( int i = 2; i < 50 ; ++i ){
    if( !isComposite[i] ){
      for( int j = i+i ; j < 50 ; j += i ){
        isComposite[j] = true;
      }
    }
  }

  int caseNumber = 0;
  int n;
  while( scanf("%d", &n) != EOF ){
    int circle[20] = {1, 0};
    bool hasUsed[20] = {false, true, false};

    if( caseNumber > 0 ){
      printf("\n");
    }
    printf("Case %d:\n", ++caseNumber);
    findCircle(circle, 1, n, hasUsed, isComposite);

  }

  return 0;
}
廣告

Comment

There is no comment on this post. Be the first one.

發表迴響

這個網站採用 Akismet 服務減少垃圾留言。進一步瞭解 Akismet 如何處理網站訪客的留言資料

%d 位部落客按了讚: