Casey J. Buresh

Yeah I totally see now. Thanks for the help.

I'm going to have to talk to the professor, because his assignment is flawed because of that fact. Here are the results from my submission, and from what I can tell, it appears the encrypt entries and decrypt entries are completely different each time.

PASS    complex4CharEncrypt    0.006    
-
FAILURE complex7CharDecrypt 0.002    
junit.framework.AssertionFailedError - expected:<ab[c~d9!]> but was:<ab[9~d!c]>
PASS    medium4CharEncrypt    0.001    
-
FAILURE medium6CharDecrypt 0.001    
junit.framework.AssertionFailedError - expected:<a[bcd9]!> but was:<a[9dcb]!>
PASS simple4CharDecrypt 0.001    
-
PASS simple4CharEncrypt 0.0    
-
FAILURE    simple5CharDecrypt    0.008    
junit.framework.AssertionFailedError - expected:<a[bcde]> but was:<a[edcb]>
PASS    simple5CharEncrypt    0.0    
-
FAILURE    sonnetTestDecrypt    0.008  

Oh! You're right! I just realized what you mean. It messed up only in cases where there were blank spaces.... That makes a lot of sense now. I don't know why I didn't see if before....

I will have to add some sort of placeholder instead of just adding blank spaces. Perhaps a random character that's not going to by typed in or even a variable itself?

I'm thinking if I just put a variable itself in, then that might fix it...

The only problem I think I'm having now, is that the keys to decrypt are completely separate from the keys to encrypt. They are run separately, from what I can tell by the professors instructions. And if that's the case, then there might not be a way to truly fix it... I'll have to see....

Working on a project where I have to encrypt a string using the Caesar box encryption and also be able to decrypt a string.

Caesar Box Encryption:

Take a string "I love lamp"
Remove spaces "Ilovelamp"
Remove Capitals "ilovelamp"
Put in Square formation, must be perfect square, so if there were 10 letters, then the square would have to be the next highest perfect square, 16, and the last few spots would be blank.

i l o
v e l
a m p

Take letters down each column and print "ivalemolp"

Decrypt the same way:
i v a
l e m
o l p
"ilovelamp"

The decrypted string does not need any captial letters or spacing. (It's not that advanced)...

Anyways, I have pretty much finished it, and the encryption part works perfectly, but the decryption seems to print everything backwards or mix it up somewhat, I'm not sure what I have wrong here, because as far as I can tell, the encryption and decryption code should be the same, with different final variables.

public class CaesarBox { public static void main(String[] args) { // CaesarsBox <-encrypt|-decrypt> if (args[0].equals("-encrypt")) { System.out.println(encrypt(args[1])); } else if (args[0].equals("-decrypt")) { System.out.println(decrypt(args[1])); } } public static String encrypt(String plainText) { String text = plainText; // To remove spaces between the characters text = text.replace(" ", ""); // To remove case text = text.toLowerCase(); // Declare variable to determine loop status boolean notFound = true; int t = 1; while (notFound) { // Test if t squared is larger than text.length() if (t * t >= text.length()) { notFound = false; } // If t squared is not, increment x for the next loop else { t += 1; } } // Create an array based on the size of the square. String[][] arr = new String[t][t]; int location = 0; for (int y = 0; y < t; y++) { for (int x = 0; x < t; x++) { if (location < text.length()) { arr[x][y] = "" + text.charAt(location); location += 1; } else { arr[x][y] = ""; location += 1; } } } // Declare encrypted string String encrypted = ""; // Encrypt the string for (int x = 0; x < t; x++) for (int y = 0; y < t; y++) encrypted = encrypted + arr[x][y]; System.out.println(arr[0][1]); // Return the encrypted version of the original string= return encrypted; } public static String decrypt(String cypherText) { String text = cypherText; // To remove spaces between the characters text = text.replace(" ", ""); // To remove case text = text.toLowerCase(); // Declare variable to determine loop status boolean notFound = true; int t = 1; while (notFound) { // Test if t squared is larger than text.length() if (t * t >= text.length()) { notFound = false; } // If t squared is not, increment x for the next loop else { t += 1; } } // Create an array based on the size of the square. String[][] arr = new String[t][t]; int location = 0; for (int y = 0; y < t; y++) { for (int x = 0; x < t; x++) { if (location < text.length()) { arr[x][y] = "" + text.charAt(location); location += 1; } else { arr[x][y] = ""; location += 1; } } } // Declare decrypted string String decrypted = ""; // Decrypt the string for (int x = 0; x < t; x++) for (int y = 0; y < t; y++) decrypted = decrypted + arr[x][y]; // Return the decrypted version of the original string= return decrypted; } }

Awesome! Thanks!

That makes loads of sense!

I'm currently working on an assignment for my Java class, it's supposed to do this:
Write a Java program to read in an integer number (as a String) from the program arguments, and print the value of the following calculation, where n is the number:

if n < 0 - print out (n^2) + (n/2)
if n >= 0 and is even - print out (n^3)*(n-1)
if n >= 0 and is odd - print out (n^-1) + (3n)

The problem is that it doesn't seem to compute the numbers correctly.
When I input -2, it results in 3, which is correct, but when I put in -1, it results in 1, when it should be .5

That seems to be the only part that isn't working and I can't figure out why. Any help is greatly appreciated
public class SimpleCalc { public static void main(String[] arg) { // turn string into an integer int n = Integer.parseInt(arg[0]); // if n is less than 0, it will calculate n based on the equation // provided if (n < 0) { System.out.println(Math.pow(n, 2) + n / 2); } // if n is more than or equal to zero and is even it will calculate n // based on the equation provided else if (n >= 0 && n % 2 == 0) { System.out.println(Math.pow(n, 3) * (n - 1)); } // if n is more than or equal to zero and is odd it will calculate n // based on the equation provided else if (n >= 0 && n % 1 == 0) { System.out.println(Math.pow(n, -1) + 3 * n); } } }