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 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163
|
#include <iostream>
#include <fstream>
#include <vector>
std::vector<std::vector<int> > wall;
std::vector<std::pair<bool, int> > usedBricks;
bool overlaps(int pos, int maxSize, int jointPos)
{
for (int i = 0; i < wall.size(); i++)
{
for (int j = 0; j < wall[0].size(); j++)
{
if (wall[i][j] == jointPos && pos != wall[i].size() - 1) //since I'm now storing the position of the joint,
//I just have to check if there already is a joint at said position
return true;
}
}
return false;
}
bool allUsed() //checks if every brick has been used
{
for (int i = 0; i < usedBricks.size(); i++)
{
if (!usedBricks[i].first) return false;
}
return true;
}
void makeWall(int jointPos, int gapSize, int maxSize, int position, int row, std::vector<int> joints)
{
if (allUsed()) return;
if (jointPos + gapSize > maxSize || gapSize - 1 > (usedBricks.size() - 1)) //if the new brick is bigger than the max. brick size
{
for (int i = 0; i < usedBricks.size(); i++)
{
if (!usedBricks[i].first && usedBricks[i].second + jointPos <= maxSize &&
!overlaps(position, maxSize - 1, jointPos + usedBricks[i].second)) //look for another one that fits
gapSize = usedBricks[i].second;
}
}
jointPos += gapSize;
if (jointPos > maxSize || gapSize - 1 > usedBricks.size() - 1) return;
if (overlaps(position, maxSize -1, jointPos) || usedBricks[gapSize - 1].first) //if there is a joint at that position
{
if (gapSize - 1 > usedBricks.size() - 1)
gapSize = 1;
makeWall(jointPos - gapSize, gapSize + 1, maxSize, position, row, joints);
}
else
{
usedBricks[gapSize - 1].first = true;
joints[position] = jointPos;
makeWall(jointPos, gapSize + 1, maxSize, position +1, row, joints);
}
if (allUsed())
{
wall.push_back(joints); //add row to wall
for (int x = 0; x < joints.size(); x++)
{
joints[x] = 0;
}
for (int i = 0; i < usedBricks.size(); i++)
{
usedBricks[i].first = false;
}
makeWall(0, 1, maxSize, 0, row +1, joints);
}
else return;
}
//_________________MAIN______________
int main() {
int n, sum = 0, jointPlacement = 0, gap = 1;
//std::vector<std::vector<bool> > wall;
std::vector<int> joints;
std::cout << "Please submit 'n':" << std::endl;
std::cin >> n;
for (int i = 1; i <= n; i++)
{
sum += i;
usedBricks.push_back(std::make_pair(false, i));
}
for (int i = 0; i < n; i++)
{
jointPlacement += gap;
joints.push_back(jointPlacement); //now I'm saving the position of a joint without actually inserting it into the wall
//this ensures that a brick with the length 10 is actually as long as bricks the with the lengths 1,2,3 and 4
gap++;
}
wall.push_back(joints);
for (int i = 0; i < joints.size(); i++)
{
joints[i] = 0;
}
if (n > 1) //if there is more than one row
makeWall(0, 1, sum, 0, 1, joints);
std::ofstream myfile;
myfile.open("mauer.txt");
int watch = 0;
int it = 0;
for (int i = 0; i < wall.size(); i++)
{
wall[i].insert(wall[i].begin(), 0);
}
for (int i = 0; i < wall.size(); i++)
{
for (int j = 0; j < sum+(n+1); j++)
{
if (watch == wall[i][it])
{
myfile << "|";
if (it + 1 < wall[i].size())
it++;
}
else
{
myfile << "-";
watch++;
}
}
myfile << std::endl;
watch = 0;
it = 0;
}
myfile.close();
return 0;
}
|