OJ Board

I've just started a attempting a few problems on this site and it feels like some of the problem descriptions are mission some information. For example, for problem 100 (3n+1) we know that the input n satisfies 0 < n < 10000, but we don't have an upper bound on how large n will become when running ...

Are we to assume that any measurement given will fit into a 32-bit int? If not then I think that comparisons will need to be done on the basis of strings for each slide length of each box, but this strikes me as complicated. Can anyone confirm whether or not this assumption leads to CA?

i.e. do we ...