diff --git a/HW10/MakePermutationMatrix.cpp b/HW10/MakePermutationMatrix.cpp
index 0c7a2a0..3b614d9 100644
--- a/HW10/MakePermutationMatrix.cpp
+++ b/HW10/MakePermutationMatrix.cpp
@@ -16,19 +16,18 @@ std::vector<double> MakePermutationMatrix::MakePermutation(std::vector<City> sou
     std::vector<City> myPerm = source;
     std::vector<City> nextPerm = source;
 
-    if(!rank){
-        size_t totalNumPermutations = 1;
-        for(size_t i = 1; i <= source.size(); i++)
-            totalNumPermutations *= i;
-        offset = totalNumPermutations/size;
-        std::cout << "offset: "<<offset <<std::endl;
-    }
+//    if(!rank){
+//        size_t totalNumPermutations = 1;
+//        for(size_t i = 1; i <= source.size(); i++)
+//            totalNumPermutations *= i;
+//        offset = totalNumPermutations/size;
+//        std::cout << "offset: "<<offset <<std::endl;
+//    }
     //MPI_Bcast(&offset, 1, MPI_LONG_LONG_INT, 0, MPI_COMM_WORLD);
 
 
     //return vector should be the size of number of processors as they are going to only return their own smallest.
-    if(rank)
-        returnVector.resize(source.size(), 0);
+    returnVector.resize(source.size(), 0);
 
     //the "nextPerm" is the permutation to stop at.
     //std::rotate(nextPerm.begin(), nextPerm.begin()+(rank+1)*offset, nextPerm.end());