blizzardfinnegan/advent-of-code-cpp-2021
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Give up (for now) on Day 3 Part 2

Browse source
This commit is contained in:
Blizzard Finnegan 2021-12-06 20:04:42 -05:00
parent d9a1a2c7cc
commit f30eb9d94c
3 changed files with 190 additions and 42 deletions
Download patch file Download diff file Expand all files Collapse all files

BIN
day3/day3Part2 Executable file
View file

Binary file not shown.

190
day3/day3Part2.broken.cpp Normal file
View file

@ -0,0 +1,190 @@
#include <iostream>
#include <cmath>
#include <fstream>
#include <vector>
#include <array>
using namespace std;
int main (void)
{
vector<array<int, 5>> inputValues;
vector<array<int, 5>> mostCommon;
vector<array<int, 5>> mostCommonWorking;
vector<array<int, 5>> leastCommon;
char currentLine[5];
array<int, 5> currentLineInt;
int mostBitTrue[5] = {};
int mostBitFalse[5] = {};
int leastBitTrue[5] = {};
int leastBitFalse[5] = {};
int oxygenGenRatingBin[5] = {};
int coScrubRatingBin[5] = {};
int oxygenGenRatingDec = 0;
int coScrubRatingDec = 0;
int lifeSupport = 0;
int debugCount = 0;
int vectorSize = 0;
ifstream readFile ("data/testInput.txt", ios::in);
//file Read
while(readFile >> currentLine)
{
for(int i=0;i<5;i++)
{
if (currentLine[i] == '1') currentLineInt[i] = 1;
else if (currentLine[i] == '0') currentLineInt[i] = 0;
}
inputValues.push_back(currentLineInt);
}
mostCommon = inputValues;
leastCommon = inputValues;
//most Common filter
//Iterate through all bits in line
for(int i=0;i<5;i++)
{
mostCommon = mostCommonWorking;
mostCommonWorking.clear();
//if there's only one line, leave the loop
if(mostCommon.size() == 1)
{
cout << "Exiting mostCommon loop..." << endl;
break;
}
//Iterate through all entries in mostCommon, count 1s and 0s
for (int j=0;j<mostCommon.size();j++)
{
if(mostCommon[j][i] == 1) mostBitTrue[i]++;
else if(mostCommon[j][i] == 0) mostBitFalse[i]++;
//Error Checking
else
{
cout << "Error!" << endl;
return 1;
}
}
//Balancing
if (mostBitTrue[i] == mostBitFalse[i]) mostBitTrue[i]++;
//If there are more 1s than 0s, save 1s
if (mostBitTrue[i] > mostBitFalse[i])
{
for(int j=0;j=mostCommon.size();j++)
{
if(mostCommon[j][i] == 1) mostCommonWorking.push_back(mostCommon[i]);
}
}
//If there are more 0s than 1s, save 0s
if (mostBitFalse[i] > mostBitTrue[i])
{
for(int j=0;j=mostCommon.size();j++)
{
if(mostCommon[j][i] == 0) mostCommonWorking.push_back(mostCommon[i]);
}
}
cout << "Most Common Working: ";
for(int j=0;j<mostCommonWorking.size();j++)
{
for(int k=0;k<5;k++)
{
cout << mostCommonWorking[j][k];
}
cout << "\t";
}
cout << endl;
}
cout << "**************\nFinal Value: ";
for(int i=0;i<5;i++) cout << mostCommon[0][i];
cout << "\n**************\n\n" << endl;
//*******************************************************************
//least Common filter
//Iterate through all bits in line
for(int i=0;i<5;i++)
{
//if there's only one line, leave the loop
if(leastCommon.size() == 1) break;
//Iterate through all entries in leastCommon, count 1s and 0s
for (int j=0;j<leastCommon.size();j++)
{
if(leastCommon[j][i] == 1) leastBitTrue[i]++;
else if(leastCommon[j][i] == 0) leastBitFalse[i]++;
//Error Checking
else
{
cout << "Error!!" << endl;
return 2;
}
}
//Balancing
if (leastBitTrue[i] == leastBitFalse[i]) leastBitTrue[i]++;
//if there are more 1s than 0s
if(leastBitTrue[i] > leastBitFalse[i])
{
for (int j=0;j<leastCommon.size();j++)
{
//remove 1s
if(leastCommon[j][i] == 1) leastCommon.erase(leastCommon.begin() + j);
}
}
//if there are more 0s than 1s
if(leastBitFalse[i] > leastBitTrue[i])
{
for (int j=0;j<leastCommon.size();j++)
{
//remove 0s
if(leastCommon[j][i] == 0) leastCommon.erase(leastCommon.begin() + j);
}
}
debugCount = 0;
cout << "Current leastCommon:\t";
for(int j=0;j<leastCommon.size();j++)
{
for(int k=0;k<5;k++)
{
cout << leastCommon[j][k];
}
cout << "\t";
debugCount++;
}
cout << "\n Value Count: " << debugCount << "\n" << endl;
}
cout << endl;
for(int i=0;i<5;i++) cout << leastCommon[0][i];
for(int i=0;i<5;i++)
{
if(mostCommon[0][i] == 1) oxygenGenRatingBin[i]=1;
else if(mostCommon[0][i] == 0) oxygenGenRatingBin[i]=0;
else
{
cout << "Error!!!" << endl;
return 3;
}
if(leastCommon[0][i] == 1) coScrubRatingBin[i]=1;
else if(leastCommon[0][i] == 0) coScrubRatingBin[i]=0;
else
{
cout << "Error!!!!" << endl;
return 4;
}
}
for(int i=0;i<5;i++)
{
oxygenGenRatingDec += oxygenGenRatingBin[i] * pow(2,04-i);
coScrubRatingDec += coScrubRatingBin[i] * pow(2,04-i);
}
lifeSupport = oxygenGenRatingDec * coScrubRatingDec;
cout << "\nLife Support Rating: " << lifeSupport;
return 0;
}

42
day3/day3Part2.cpp
View file

@ -1,42 +0,0 @@
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
int main (void)
{
char currentLine[12];
int bitTrue[12] = {};
int bitFalse[12] = {};
int gammaRateBin[12] = {};
int epsilonRateBin[12] = {};
int gammaRateDec = 0;
int epsilonRateDec = 0;
int powerConsumption;
ifstream readFile ("data/input.txt", ios::in);
while(readFile >> currentLine)
{
for(int i=0;i<12;i++)
{
if(currentLine[i] == '0') bitFalse[i]++;
else if(currentLine[i] == '1') bitTrue[i]++;
else cout << "Error!!!";
}
}
for(int i=0;i<12;i++)
{
if(bitTrue[i] > bitFalse[i]) gammaRateBin[i] = 1;
else epsilonRateBin[i] = 1;
}
for(int i=0;i<12;i++)
{
gammaRateDec += gammaRateBin[i] * pow(2,11-i);
epsilonRateDec += epsilonRateBin[i] * pow(2,11-i);
}
powerConsumption = gammaRateDec * epsilonRateDec;
cout << "\nPower Consumption: " << powerConsumption;
return 0;
}