package project_euler;

public class challenge_012 {

    public static void main(String[] args) {  //triangle numbers, 500 divisors
        long triangle=0;
        int greatestDivs=0;
        int currentDivs=0;

        for (int x=1; greatestDivs<501 ; x++) { //triangle # builder //redo while statement??
            triangle+=x;
            //System.out.println(x + " and tri: " + triangle + " and divs: " + greatestDivs);
            currentDivs=Methods.numberOfDivs(triangle);
            if (currentDivs>greatestDivs) {
                greatestDivs = currentDivs;
                System.out.println(x + "th triangle # '" + triangle + "' has divs: " +greatestDivs);
            }
        }
    }
}