Poj 1270 Following Orders enumeration Arrangement

Poj 1270 Following Orders enumeration Arrangement

Question:

To give a character set and the relationship between some characters, find all possible arrangements on the character set.

Analysis:

The brute-force enumeration can be divided into enumeration subsets, enumeration sorting, and enumeration combination. This is a simple enumeration arrangement. During the enumeration process, you can use the smaller than the relationship to pruning.

Code:

 

// Poj 1270 // sep9 # include

 
  
# Include using namespace std; char vars [64], constraint [256], ans [64]; int g [128] [128], vis [256]; int len; void dfs (int cur) {if (cur = len) {puts (ans); return;} for (int I = 0; I

  
   
= 'A' & vars [I] <= 'Z') vars [len ++] = vars [I]; vars [len] = '\ 0 '; ans [len] = '\ 0'; sort (vars, vars + len); dfs (0); puts ("");} return 0 ;}