POJ 3187 Backward Digit Sums

POJ 3187 Backward Digit Sums

 

Resolution:
Basic Issues of full sorting

You can use DFS or the next_permutation function in STL to generate a full arrangement.

The DFS method is provided here.

 

Code:

 

# Include

 
  
# Include

  
   
# Include

   
    
# Include

    
     
# Include

     
      
# Include

      
        # Include using namespace std; # define PI 3.1415926 bool visit [15]; int a [15], B [15]; int N, sum; bool per (int k) {if (k = (N + 1) {int I, j; for (I = 1; I <= N; ++ I) B [I] = a [I]; for (I = 1; I