/*  
* Copyright (c) 2011 alexingcool. All Rights Reserved.  
*/ 
#include <iostream>
#include <iterator>
#include <algorithm>
#include <vector>

using namespace std;

vector<int> result;
vector<int> prvec;

void outputResult(int N, vector<int> &prime, vector<int> &result)
{
 if(N < 0)
 return;

 if(N == 0) {
 copy(result.begin(), result.end(), ostream_iterator<int>(cout, " "));
 cout << endl;
 return;
 }

 for(int i = 0; i < prime.size(); i++) {
 //為提高效率，可以在此做個(gè)判定條件，盡快返回
 if(N - prime[i] < 0)
  break;

 result.push_back(prime[i]);
 outputResult(N - prime[i], prime, result);
 result.pop_back();
 }
}

void outputResult2(int N, vector<int> &prime, vector<int> &result, int position)
{
 if(N < 0)
 return;

 if(N == 0) {
 copy(result.begin(), result.end(), ostream_iterator<int>(cout, " "));
 cout << endl;
 return;
 }

 for(int i = position; i < prime.size(); i++) {
 //為提高效率，可以在此做個(gè)判定條件，盡快返回
 if(N - prime[i] < 0)
  break;

 result.push_back(prime[i]);
 outputResult2(N - prime[i], prime, result, i);
 result.pop_back();
 }
}

bool isPrime(int number)
{
 if(number <= 1)
 return false;
 if(number == 2)
 return true;
 for(int i = 2; i < number; i++) {
 if(number % i == 0)
  return false;
 }
 return true;
}

void generatePrime(int number, vector<int> &result)
{
 for(int i = 2; i < number - 1; i++) {
 if(isPrime(i))
  result.push_back(i);
 }
}

void main()
{
 int number = 8;
 generatePrime(number, prvec);
 outputResult(number, prvec, result);
 cout << "除去同構(gòu)" << endl;
 outputResult2(number, prvec, result, 0);
}