-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathLab5.cpp
More file actions
79 lines (72 loc) · 1.52 KB
/
Lab5.cpp
File metadata and controls
79 lines (72 loc) · 1.52 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
/*
* Lab5.cpp
*
* Created on: Oct 10, 2013
* Author: leon
*/
#include <cstdlib>
#include <string>
#include <cctype>
#include <iostream>
#include <string>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cstring>
#include <vector>
using namespace std;
void print(vector<vector<int> > v) {
vector<vector<int> >::iterator it;
cout << "[";
for (it = v.begin(); it != v.end(); ++it) {
cout << "[";
vector<int>::iterator innerit;
for (innerit = it->begin(); innerit != it->end(); ++innerit) {
cout << *innerit << ", ";
}
cout << "]";
}
cout << "]";
}
vector<vector<int> > interleave(int x, const vector<int>& v) {
vector<vector<int> > result;
if (x == 1) {
result.push_back(v);
return result;
}
for (vector<int>::size_type i = 0; i <= v.size(); ++i) {
vector<int> temp(v);
if (i == v.size()) {
temp.push_back(x);
} else {
temp.insert(temp.begin() + i, x);
}
result.push_back(temp);
}
return result;
}
vector<vector<int> > permute(size_t n) {
vector<vector<int> > result;
vector<vector<int> > v;
if (n == 1) {
vector<int> temp;
temp.push_back(1);
result.push_back(temp);
return result;
} else {
vector<vector<int> > temp;
vector<vector<int> >::iterator it;
temp = permute(n - 1);
for (it = temp.begin(); it != temp.end(); ++it) {
v = interleave(n, *it);
result.insert(result.end(), v.begin(), v.end());
}
}
return result;
}
int lab5_main(int argc, char** argv) {
vector<vector<int> > v = permute(4);
cout<< v.size() << endl;
print(v);
return 0;
}