Find The Triangular Number With More Than N Divisors
Your naming of variables is hard to reason about. When I think about what your program is doing you, I come up with the following sequence of steps:


Take in a target divisor count.
Index through each triangular number n and check if it satisfies the condition.
If it doesn't increment n and repeat.
Once it does print out the results.


Here is how I would restructure your main loop:

std::cout &lt;&lt; "You want to find the first triangular number with less than or more than how many divisors? " &lt;&lt; std::endl;
int target;
std::cin &gt;&gt; target;
// Indexes the triangle numbers.
int n = 0;
// Keeps track of how many divisors.
int divisors = 0;
do {
    n++;
    divisors = enumerate_divisors(generate_triangular(n));
} while (divisors &lt; target);
std::cout &lt;&lt; "The " &lt;&lt; n &lt;&lt;" th triangular number" &lt;&lt; std::endl;
std::cout &lt;&lt; generate_triangular(n) &lt;&lt; std::endl;


Also, add some spaces in between your function declarations, it's hard to read when everything is clumped together. But don't over do it (in particular, don't double space everything).