diff --git a/HW1 b/HW1
new file mode 160000
index 0000000..b910b3a
--- /dev/null
+++ b/HW1
@@ -0,0 +1 @@
+Subproject commit b910b3ab4941096ad09ffa7380ee75ff8a7eec20
diff --git a/README.md b/README.md
deleted file mode 100644
index 837786d..0000000
--- a/README.md
+++ /dev/null
@@ -1,20 +0,0 @@
-# HW1
-
-* Create a folder for your files, and put all your work in those files.
-* Please do not modify the original files (you can make a copy of them in your folder and modify that copy.)
-* DO NOT check in changes to other students folders. This means that you should not be committing anything that changes files in a folder that is not yours. If it happens by accident, let the professor and the student know, and the professor will help undo the change.
-
-For each problem I want you to submit to me at least three files:
-* A file with your code in it that will compile, and that you feel solves the problem (or as ar as you got in that process.)
-* A file with test cases you used to see if your program is working (needs at least 5 unique tet cases.)
-* Anwers for your test cases. This can be a file with what the expected output is for the input file, or A file with the test cases from the previous file, and the answer per case on the line following that case.
-
-
-## Discussion
-
-You can discuss approaches to the problems with anyone. I strongly suggest that you do not share your code except by pulling up what you have handed into the class repo.
-
-
-## Due
-
-These programs will be due no earlier than Mon 26th. We will talk about the due date on the 19th.
diff --git a/piiamt/Problem 1/.idea/misc.xml b/piiamt/Problem 1/.idea/misc.xml
deleted file mode 100644
index 8e8843c..0000000
--- a/piiamt/Problem 1/.idea/misc.xml
+++ /dev/null
@@ -1,6 +0,0 @@
-
-
-
-
-
-
\ No newline at end of file
diff --git a/piiamt/Problem 1/.idea/modules.xml b/piiamt/Problem 1/.idea/modules.xml
deleted file mode 100644
index 2bace1b..0000000
--- a/piiamt/Problem 1/.idea/modules.xml
+++ /dev/null
@@ -1,8 +0,0 @@
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/piiamt/Problem 1/.idea/workspace.xml b/piiamt/Problem 1/.idea/workspace.xml
deleted file mode 100644
index 7ada8c1..0000000
--- a/piiamt/Problem 1/.idea/workspace.xml
+++ /dev/null
@@ -1,286 +0,0 @@
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1518659896784
-
-
- 1518659896784
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/piiamt/Problem 1/InputFileNames.txt b/piiamt/Problem 1/InputFileNames.txt
deleted file mode 100644
index 0ccc2b8..0000000
--- a/piiamt/Problem 1/InputFileNames.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-ZombiesAndStuff.pdf
-BunRuninBoston.exe
-onlyBostonInThisFile.xls
-Spartan_in_da_house
-Mud_on_the_floors.exe
\ No newline at end of file
diff --git a/piiamt/Problem 1/OutputOfTheInputs.txt b/piiamt/Problem 1/OutputOfTheInputs.txt
deleted file mode 100644
index f09cb66..0000000
--- a/piiamt/Problem 1/OutputOfTheInputs.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-onlyBostonInThisFile.xls
-Spartan_in_da_house
-Mud_on_the_floors.exe
\ No newline at end of file
diff --git a/piiamt/Problem 1/out/production/piiamt/Problem1.class b/piiamt/Problem 1/out/production/piiamt/Problem1.class
deleted file mode 100644
index f6adcee..0000000
Binary files a/piiamt/Problem 1/out/production/piiamt/Problem1.class and /dev/null differ
diff --git a/piiamt/Problem 1/piiamt.iml b/piiamt/Problem 1/piiamt.iml
deleted file mode 100644
index c90834f..0000000
--- a/piiamt/Problem 1/piiamt.iml
+++ /dev/null
@@ -1,11 +0,0 @@
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/piiamt/Problem 1/src/Problem1.java b/piiamt/Problem 1/src/Problem1.java
deleted file mode 100644
index e6a8082..0000000
--- a/piiamt/Problem 1/src/Problem1.java
+++ /dev/null
@@ -1,46 +0,0 @@
-/* Ok so just so I know that I got this right:
-the thing that the user inputs is the name of the file not the name of the race.
-*/
-import java.util.Scanner;
-public class Problem1 {
- public static void main(String[] args) {
- Scanner reader = new Scanner(System.in);
- System.out.println("How many files are you gonna give me to process?");
- int howMany = reader.nextInt();
- String[] allFileNames = new String[howMany];
- //up here I defined an array in which we will store the values that the user inputs
- for(int i=0; i.java
-* A seperate file with at least 5 test possible file names that you create.
-* A seperate file with the answers to the test cases you created (list the file name on one line and then the answer on the following line.)
-
-
-## Bonus:
-1. Get your program to give an option to print either the file names that contain exactly one of the race names, or any/multiple of the race names, based upon input from the user (to decide which they want to do.)
-2. Your friend has found an additional batch of files that are in folders. Look for the race names, ignoring any characters before the last '/' in the file name:
-races/summer/north/Zombie_run_for_your_life.docx
diff --git a/problem2.md b/problem2.md
deleted file mode 100644
index 8eeb466..0000000
--- a/problem2.md
+++ /dev/null
@@ -1,47 +0,0 @@
-# Problem 2
-
-There is an instructor of a free class who has lots of participants.
-They want the participants to divide themselves up into groups of three.
-The instructor asks that the particpants put there names on a sheet with the group members.
-It is mentioned that there may not be a multiple of three, so if the participants do not find a group of three to be a part of, that is ok, but to make sure a sheet of paper with the names of the participants that they could find on it.
-(Note this means that every participant needs to have there name on a sheet of paper.)
-
-What the instructor didn't expect is that a large number of the participants didn't find a group of three to be a part of.
-
-The instructor wants your help in finding how many groups of three can be formed without breaking up the groupings the students turned in.
-
-The instructor wants a progam they can run, and then type into the commandline the number of students in a group then some white space (a space or return is most likely), and repeat until each groups size has been entered.
-They will finish with a 0 and press return to indicate that they are done entering the group sizes.
-
-The instructor wants the program to print out how many full groups can be created (the maximum number), and how many students will not be in a full group.
-
-Sample Input 1:
-~~~
-1 2 2 2 1 3 2 2 3 3 2 3 0
-~~~
-Sample Output 1:
-~~~
-6 full groups can be formed, and 8 students will still need a group.
-~~~
-
-Sample Input 2:
-~~~
-1
-2 1
-2 1 2 1
-2
-1
-1 1
-0
-~~~
-
-Sample Output 2:
-~~~
-5 full groups can be formed, and no students will still need a group.
-~~~
-
-
------
-### Bonus
-Allow the program to take a number on the first line by itself that indicates the size of the groups that the instructor wants.
-The following numbers may be any number from 1 to the size of the groups. A 0 stil ends the sequence of input.
diff --git a/problem3.md b/problem3.md
deleted file mode 100644
index 7ab8e77..0000000
--- a/problem3.md
+++ /dev/null
@@ -1,39 +0,0 @@
-# Problem 3
-
-We need your help generating user names for students.
-
-We want to use part of their first name and part of their last name.
-In both cases we want to start at the begining of the name and take consecutive letters from there.
-The username must use at least the first letter from the first and the first letter from the last name.
-
-Longer user names are always considered better, however user names on the system can not be longer than 8 characters.
-
-If there are multiple choices for the user name, please return the one that would come first alphebetically, considering all letters to be lower case.
-
-The program will receive a nmber saying how many names there are to compare, and then there will be that many lines of additinoal input.
-Each of those lines will contain the first name, a space, and the last name of a student.
-
-Plese print out for each student the optimal user name per the preferences above.
-Do not worry if two students end up with the same username (the system admins will deal with those issues.)
-
-Sample Input:
-~~~
-5
-Jeff Ifland
-AAAA BBBBB
-AAAAA BBBB
-zy xwv
-abcdefg bzyxwvucba
-zzzzzzzz aaaaaaaaa
-~~~
-
-Sample Output:
-~~~
-jeffifla
-aaaabbbb
-aaaaabbb
-zywxv
-abbzyxwv
-zaaaaaaa
-~~~
-