<分区>
鉴于数字可能大到 100,000,我如何检查数字是否是 3 和 5 的倍数之和。我需要一种优化的方法来将数字分成两部分,这样两部分仅是3和5的倍数,而3的倍数大于部分是 5 的倍数,如果不可能进行这种拆分,那么我需要拒绝该数字。
例如:
1 => cant be split so rejected ,
35 => 30 + 5 ,
65 => 60 + 5 (Though 30 + 35 could be a split but since part which is multiple of 3 has to be greater than the part which is multiple of 5),
11 => 6+5