started to work through errors

.vscode/settings.json

@@ -0,0 +1,6 @@
+{
+    "files.associations": {
+        "iostream": "cpp",
+        "*.tcc": "cpp"
+    }
+}

.vscode/tasks.json

@@ -2,20 +2,20 @@
     "tasks": [
         {
             "type": "cppbuild",
-            "label": "C/C++: gcc build active file",
-            "command": "/usr/bin/gcc",
+            "label": "C/C++: cl.exe build active file",
+            "command": "cl.exe",
             "args": [
-                "-fdiagnostics-color=always",
-                "-g",
-                "${file}",
-                "-o",
-                "${fileDirname}/${fileBasenameNoExtension}"
+                "/Zi",
+                "/EHsc",
+                "/nologo",
+                "/Fe${fileDirname}\\${fileBasenameNoExtension}.exe",
+                "${file}"
             ],
             "options": {
                 "cwd": "${fileDirname}"
             },
             "problemMatcher": [
-                "$gcc"
+                "$msCompile"
             ],
             "group": {
                 "kind": "build",

2/puzzle2.cpp

@@ -0,0 +1,66 @@
+#include <stdio.h>
+#include <list>
+#include <iostream>
+#include <fstream>
+#include <string>
+#include <vector>
+#include <sstream>
+
+using namespace std;
+
+enum Direction {
+    UP,
+    DOWN
+};
+
+int main(){
+    string line;
+    int safeReports = 0;
+    stringstream wholeDoc;
+
+    ifstream puzzle("input.txt", ifstream::in);
+
+        while (getline(puzzle, line)) {
+            istringstream lineStream(line);
+            string numberString;
+            list<int> currentLevels;
+            while (getline(lineStream, numberString, ' ')) {
+                int number = stoi(numberString);
+                currentLevels.push_back(number);
+            }
+
+            int numOfLevelsInLine = currentLevels.size();
+            int numOfLevelsProcessed = 0;
+
+            //need to pull the first one to have something to compare to
+            enum Direction dir;
+            int prevlevel = currentLevels.front();
+            currentLevels.pop_front();
+            numOfLevelsProcessed++;
+            if (prevlevel < currentLevels.front()){
+                dir = DOWN;
+            } else if (prevlevel > currentLevels.front()){
+                dir = UP;
+            } else {
+                currentLevels.clear();
+            }
+
+
+            for (int level = currentLevels.front(); !currentLevels.empty();level=currentLevels.front()){
+                if (abs(prevlevel-level)>3) {currentLevels.clear();break;}
+                if(prevlevel==level){ currentLevels.clear();break;}
+                if(dir==UP&&(prevlevel<currentLevels.front())) {currentLevels.clear();break;}
+                if(dir==DOWN&&(prevlevel>currentLevels.front())) {currentLevels.clear();break;}
+                
+                prevlevel=currentLevels.front();
+                currentLevels.pop_front();
+                numOfLevelsProcessed++;
+
+                if(numOfLevelsProcessed==numOfLevelsInLine){
+                    safeReports++;
+                }
+            }
+        }
+cout << safeReports;
+puzzle.close();
+}

2/puzzle2p2.cpp

@@ -0,0 +1,145 @@
+#include <stdio.h>
+#include <list>
+#include <iostream>
+#include <fstream>
+#include <string>
+#include <vector>
+#include <sstream>
+#include <iterator>
+
+using namespace std;
+
+enum Direction {
+    UP,
+    DOWN,
+    UNSET
+}; 
+
+int main(){
+    string line;
+    int safeReports = 0;
+    stringstream wholeDoc;
+    int linesReadFromFile= 0;
+
+    ifstream puzzle("input.txt", ifstream::in);
+
+        while (getline(puzzle, line)) {
+            istringstream lineStream(line);
+            string numberString;
+            list<int> currentLevels;
+            while (getline(lineStream, numberString, ' ')) {
+                int number = stoi(numberString);
+                currentLevels.push_back(number);
+            }
+            linesReadFromFile++;
+
+            list<int> currentLevelsBackup = currentLevels;
+            int numOfLevelsProcessed = 0;
+            auto curListIt = currentLevels.begin();
+            curListIt++; //point to second item in list
+            auto RevCurListIt = currentLevels.rbegin();
+            RevCurListIt++; //points to second to last item
+            enum Direction dir; 
+            bool listDirty =false;
+            list<int>changeFromPrevLevel;
+            list<int>levelGoesUp;
+            list<int>levelGoDown;
+            list<int>levelStaysSame;
+            int totalChange=0;
+            
+            //we are going to walk the levels and see what the change is. 
+            //the frontIt is the front number (starts at 2nd entry) 
+            //backIt is the first entry (starts at 1st entry)
+
+            auto frontIt = currentLevels.begin();
+            frontIt++; 
+            auto backIt = currentLevels.begin();
+
+            for(int index = 1;frontIt!=currentLevels.end();index++){
+                int change = (*frontIt) - (*backIt);
+                totalChange+=change;
+                changeFromPrevLevel.push_back(change);
+                frontIt++;
+                backIt++;
+                if (change>0){
+                    levelGoesUp.push_front(index);
+                } else if(change<0){
+                    levelGoDown.push_front(index);
+                } else {
+                    levelStaysSame.push_front(index);
+                }
+            }
+
+            if (totalChange>0){
+                dir= UP;
+            } else if (totalChange<0){
+                dir = DOWN;
+            }
+
+            if(dir==UP&&changeFromPrevLevel.front()<0){
+                currentLevels.erase(currentLevels.begin());
+                levelGoDown.pop_front();
+                listDirty=true;
+            }
+
+            if (dir==UP&&levelGoDown.size()>1){ //if the overall direction goes up and more then 1 level go down the list is bad 
+                currentLevels.clear();
+            } else if (dir==DOWN&&levelGoesUp.size()>1){ //same as above but opiosite dirrection 
+                currentLevels.clear();
+            }
+
+            if (levelStaysSame.size()>1||(listDirty&&levelStaysSame.size()==0)){ //cant have more then 1 number the same or the list is bad 
+                currentLevels.clear();
+            }
+
+            if (!currentLevels.empty()&&levelStaysSame.size()==1){
+                auto itNumberToDelete = currentLevels.begin();
+                advance(itNumberToDelete,levelStaysSame.front());
+                currentLevels.erase(itNumberToDelete);
+                listDirty = true;
+            }
+
+            if(listDirty&&dir==DOWN&&levelGoesUp.size()>0){
+                currentLevels.clear();
+            } else if(listDirty&&dir==UP&&levelGoDown.size()>0){
+                currentLevels.clear();
+            }
+
+            if (!currentLevels.empty()){
+                if (dir==UP&&levelGoDown.size()==1){
+                    list<int>::iterator itNumberToDelete = currentLevels.begin();
+                    advance(itNumberToDelete,levelGoDown.front());
+                    currentLevels.erase(itNumberToDelete);
+                    listDirty = true;
+                } else if (dir==DOWN&&levelGoesUp.size()==1){
+                    auto itNumberToDelete = currentLevels.begin();
+                    advance(itNumberToDelete,levelGoesUp.front());
+                    currentLevels.erase(itNumberToDelete);
+                    listDirty=true;
+                }
+
+                int numOfLevelsInLine = currentLevels.size();
+            
+                //need to pull the first one to have something to compare to
+                int prevlevel = currentLevels.front();
+                currentLevels.pop_front();
+                numOfLevelsProcessed++;
+
+                for (int level = currentLevels.front(); !currentLevels.empty();level=currentLevels.front()){
+                    if (abs(prevlevel-level)>3) {currentLevels.clear();break;}
+                    
+                    prevlevel=currentLevels.front();
+                    currentLevels.pop_front();
+                    numOfLevelsProcessed++;
+
+                    if(numOfLevelsProcessed==numOfLevelsInLine){
+                        safeReports++;
+                    }
+                }
+
+            }
+        }
+cout <<"lines read in: " << linesReadFromFile<<"\n";
+cout <<"safe Reports: " << safeReports;
+puzzle.close();
+}