Project Euler #12 Java implementation

Your solution is not good as you use a single method, stuffing everything inside, with no order nor logic.

It must be rebuilt from scratch.

public class TriagularNumberWithManyDivisors {

Use long, descriptive names, Example is not acceptable by any standard.

static final int DIVISORS_WANTED = 500;

I may have fun running this code for any number of divisors and I really do not want to go haunting for a magic number to change inside the code.

public static int triangular(int n) {
    return n * (n + 1) / 2;
}

This is a function, a part of your program that does only one thing, the funciton name also serves as documetation.

public static int divisors(int n) {
    int counter = 0;
    int limit = (int) Math.sqrt(n);
    for (int i = 1; i <= limit; i++) {
        if (n % i == 0) {
            counter += (n % i == i ?  1 : 2);
        }
    }
return counter;
}

The code for counting divisors was kinda mixed in the main loop, and you had to pay the cost for not extracting it to a function in terms of an ugly boolean flag and two nested loops.

    public static void main(String[] args) {

        for (int i = 0; true ; i++) {
            if (divisors(triangular(i)) > DIVISORS_WANTED) {
                System.out.println(triangular(i));
                break;
            }
        }
    }

}

Themain method, it is incredibly trivial to understand what this does now. It calls the others methods in a high level fashion, highlighting the algorithm.