有 A B C D E F G H I J K ... 等N个数 - Chinaunix

local function dfs(t, lim)
local len = #t
local function search_(i, lim, a, b)
if i == lim then return coroutine.yield(a+b) end
search_(i+1, lim, a+b, t[i+1])
search_(i+1, lim, a, b*10+t[i+1])
end
local function iter(i, lim, a, b)
return coroutine.wrap(function() return search_(i, lim, a, b) end)
end
local results = {}
for lv in iter(1, lim, 0, t[1]) do
results[lv] = true
end
for rv in iter(lim+1, len, 0, t[lim+1]) do
if results[rv] then
return rv
end
end
end
local function print_result(t, lim, result)
local function search_(i, lim, a, b, way)
if i == lim then
if a+b == result then coroutine.yield(way..b) end
return
end
search_(i+1, lim, a+b, t[i+1], way..b.." + ")
search_(i+1, lim, a, b*10+t[i+1], way)
end
local function iter(i, lim, a, b)
return coroutine.wrap(function() return search_(i, lim, a, b, "") end)
end
for wl in iter(1, lim, 0, t[1]) do
for wr in iter(lim+1, #t, 0, t[lim+1]) do
print(wl.." = "..wr)
end
end
end
local function sum(t, a, b)
local s = 0
for i = a, b do
s = s + t[i]
end
return s
end
local function solve(t)
local len = #t
for i = 1, len-1 do
if sum(t, 1, i)%3 == sum(t, i+1, len)%3 then
local res = dfs(t, i)
if res then
print_result(t, i, res)
end
end
end
end
solve {1, 1, 1, 2, 2, 3, 6, 7}

复制代码

#include <iostream>
#include <vector>
#include <ctime>
#include <cstdlib>
using namespace std;
vector<int> generateSample(int size) {
srand ( time(NULL) );
vector<int> sample(size);
for(int i=0; i < size; i++)
sample[i] = rand() % 9 + 1;
return sample;
}
void print(vector<int> vec) {
for(int i=0; i < vec.size(); i++)
cout << vec[i] << " ";
cout << endl;
}
void print(vector<vector<int> > vec) {
for(int i = 0; i < vec.size(); i++)
print(vec[i]);
}
void generateAllCombination_aux(vector<int> sample, vector<vector<int> > & allcomb) {
if (sample.size() == 1)
allcomb.push_back(sample);
else {
vector<int> sub(sample.begin(), sample.end());
int tail = sub.back();
sub.pop_back();
generateAllCombination_aux(sub, allcomb);
int currSize = allcomb.size();
for(int i = 0; i < currSize; i++) {
allcomb.push_back(allcomb[i]);
int tmp = allcomb[currSize + i].back();
allcomb[currSize + i].pop_back();
allcomb[currSize + i].push_back(tmp*10 + tail);
allcomb[i].push_back(tail);
}
}
}
vector<vector<int> > generateAllCombination(vector<int> sample) {
vector<vector<int> > allcomb;
generateAllCombination_aux(sample, allcomb);
return allcomb;
}
int sum(vector<int> vec) {
int total = 0;
for(int i = 0; i < vec.size(); i++)
total += vec[i];
return total;
}
void printPlus(vector<int> vec) {
for(int i = 0; i < vec.size() - 1; i ++)
cout << vec[i] << " + ";
cout << vec.back();
}
void solve(vector<vector<int> > left, vector<vector<int> > right) {
for(int i = 0; i < left.size(); i++)
for(int j=0; j < right.size(); j++)
if (sum(left[i]) == sum(right[j])) {
printPlus(left[i]);
cout << " = ";
printPlus(right[j]);
cout << endl;
}
}
void solve(vector<int> sample) {
for (int pivot = 1; pivot < sample.size(); pivot++) {
vector<int> left(sample.begin(), sample.begin() + pivot);
vector<int> right(sample.begin() + pivot, sample.end());
vector<vector<int> > leftAllComb = generateAllCombination(left);
vector<vector<int> > rightAllComb = generateAllCombination(right);
solve(leftAllComb, rightAllComb);
}
}
int main() {
vector<int> sample = generateSample(12);
cout << "sample : ";
print(sample);
cout << endl;
solve(sample);
return 0;
}

复制代码