long solve() { long n = 0; long max_len = 0; for (long i = 1; i < 1000000; ++i) { const long len = collatz_len(i); if (len > max_len) { n = i; max_len = len; } } return n; }
int main(){ int largest_chain = 0; int num = 0; int len = 0; long int i; for(i = 1 ; i < 999999 ; i++){ len = collatz_len(i); if(len > largest_chain){ num = i; largest_chain = len; } } printf("The largest collatz chain is %d and is caused by the number %d\n", largest_chain, num); return 0; }