Skip to content

The Coders Cache Mystery Cache

This cache has been archived.

Fergzter: Tried to do maintenance but it seems to be gone. It had a good run. Time to make space for new things. Thanks to all who found this cache.

More
Hidden : 12/16/2013
Difficulty:
4 out of 5
Terrain:
1.5 out of 5

Size: Size:   micro (micro)

Join now to view geocache location details. It's free!

Watch

How Geocaching Works

Please note Use of geocaching.com services is subject to the terms and conditions in our disclaimer.

Geocache Description:


Welcome to the Coders Cache. Grab yourself a cup of coffee. As it may proove handy. 

THE POSTED COORDS ARE BOGUS. YOU WILL NEED TO SOLVE THE PUZZLE TO FIND THE GEOCACHE

This geocache will require some basic programming knowledge and a bit of persistance.

This programmer forgot to drink his coffee and his code is full of errors. You will need to fix the errors before trying to decode the solution. 

The difficulty of this cache is mainly due to the puzzle, not the actual difficulty in finding the geocache.

This program is made of 3 classes, Main, South and East. You will need to use all three to solve this problem. 

Here are the classes.

MAIN

public class CoffeeCodeCracker {

    public static void main(String[] args) {

        System.out.println("The Geocache is Located at:");
        South.south();
        South.degrees();
        South.line);
        South.major();
        South.dot();
        South.minor();
        South.line();
        East.north();
        East.degrees()
        East.line();
        East.major();
        East.dot();
        East.minor();

    }

}

South

public class South {

    static int A = 34;
    static int B = 12;
    static int C = 33;
    static int num1;
    static int size;;
    static int listArray[] = new int[] { 3, 4, 3, 3, 7, 0, 3 };

    public South() {
    }

    public static void south() {
        System.out.println("S");
    }

    public static void line(() {
        System.out.println("\n");
    }

    public static void degrees() {
        for (int i = 0; i <= 2; i++) {
            System.out.print("*");
        }
        System.out.print("\n");
        for (int i = 0; i <= 6; i++) {
            System.out.print("*");
        }
    }

    public static void dot() {
        System.out.println("\n.\n");
    }

    public static void major() {
        for (int i = 3; i >= 1; i--) {
            System.out.print("*");
        }
        System.out.print("\n");
        ford (int AA = A; AA > C; AA--) {
            System.out.print("*");
        }

    }

    public static void minor() {
        num1 = (((listArray[0]) + (listArray[2])) - (listArray[1]));
        for (int i = 0; i < (num1); i++) {
            System.out.print("*");
        }
        System.out.println("");
        size = listArray.length;
        for (int i = 0; i < size; i++) {
            System.out.print("*");
        }
        System.out.println("");
        for (int i = 0; i < (size - listArray[6]); i++) {
            System.out.print("*")
        }

    }

}

East

public class East {

    static int listArray[] = new double[] { 1, 4, 3, 3, 7, 8, 9, 1, 3 };

    public East() {

    }

    public static void north() {
        System.out.println("E");
    }

    public static void line() {
        System.out.println("\n");
    }

    public static void dot() {
        System.out.println("\n.");
    }

    public static void degrees() {

        for (int i = 1; i <= listArray[7]; i++) {
            System.out.print("*");
        }
        Sysstem.out.print("\n");
        for (int i = 1; i <= listArray[1]; i++) {
            System.out.print("*");
        }
        System.out.print("\n");
        for (int i = 1; i <= listArray[3]; i++) {
            System.out.print("*");
        }

    }

    public static void major() {

        int maj1, maj2;

        maj1 = listArray[0] + listArray[3];
        maj2 = maj1 + listArray[1] + listArray[7];

        for (int i = 0; i <= (maj1 - 1); i++) {
            System.out.print("*");
        }
        System.out.print("\n");
        for (int i = 0; i <= (maj2 - 1); i++) {
            System.out.print("*");
        }

    }

    public static void minor() {

        boolean setState1 = true
        boolean setState2 = false;
        boolean setState3 = true;

        if (setState1 == true) {
            System.out.println("-");
            setState1 = false;
        } else {
            System.out.println("*");
        }

        if (setState1 == false && setState2 == false) {
            System.out.println("-");
        } else {
            System.out.println("*");
            setState2 = true;
        }

        if (setState3 = true || setState1 == false) {
            System.out.println("*");
        } else {
            System.out.println("-");
        }

    }
}

 

Good luck :)

Additional Hints (Decrypt)

Pyhr 1: Na VQR znl uryc Pyhr 2: Abg ba gur tebhaq.

Decryption Key

A|B|C|D|E|F|G|H|I|J|K|L|M
-------------------------
N|O|P|Q|R|S|T|U|V|W|X|Y|Z

(letter above equals below, and vice versa)