Problem 12. Highly divisible triangular number

public class euler12 {
    public static void main(String[]args) {
        boolean found = false;
        int sum = 0;
        for (int i = 1; ! found; i++) {
            sum += i;
            if (divisors(sum) > 249) {
               	found = true;
               	break;
            }
        }
        System.out.println(sum);
    }
    public static int divisors(int n) {
        int count = 0;
        int d = 0;
        for (int i = 1; i < n && (i*d < n); i++) {
            if (n % i == 0) {
                count++;
               	d = i;
            }
        }
        return count;
    }
}