### Cryptography help.

Anyways, instead of doing this for X number of numbers. I built a simple c++ program that would create 3 vectors, put the numbers into the 3 vectors in order. Then the program would take a 4th vector that for every entry at x, it would have the sum of vector1.at(x), vector2.at(x), etc.

Using this new vector, then I looked at the ranged of values, and determine it was around a 100. So I ran the program and it would find the count of every entry in this new vector. I then looked at the count, and found the highest count.

I took that value, and assumed it was e, since e is the most common letter. I found the difference between this number and the ASCII decimal value of e, and used that for the key. I took each value of the sum vector and subtracted the decimal value of e, converted each number to character, and outputted the new string.

That didn't work!

Any tips?