#include int main() { int i; unsigned long long int j,cl,maxcl=0,besti; for (i = 1; i < 1000000; i++) { j = i; cl = 0; while (j > 1) { if (j % 2 == 0) { j = j / 2; } else if (j > 1) { j = 3 * j + 1; } cl++; } if (cl > maxcl) { maxcl = cl; besti = i; } } printf("Best chain length: %llu. Best start value: %llu.\n", maxcl, besti); return 0; }