int main() { #ifndef ONLINE_JUDGE freopen("100.in", "r", stdin); #endif int i, j, maxCycleLen; while (std::cin >> i >> j) { int orig_i = i; int orig_j = j; if (i > j) { std::swap(i, j); } maxCycleLen = 0; for (int k = i; k <= j; k++) { if (Table[k] == 0) { Table[k] = getCycleLen(k); } maxCycleLen = std::max(Table[k], maxCycleLen); } std::cout << orig_i << " " << orig_j << " " << maxCycleLen << std::endl; } return 0; }
int main() { int start, end, len, inter; /* start -> starting of sequence * end -> end of sequence * len -> cycle length of seq (start and end inclusive) * inter -> storing intermediate element in sequence */ /* get input * currently an infinite loop since problem does not * state the number of maximum inputs */ while (1) { int l = 0; len = 0; scanf("%d %d", &start, &end); inter = start; while (inter <= end) { l = getCycleLen(inter); if (l > len) len = l; inter++; } printf("%d %d %d\n", start, end, len); } return 0; }