11621 - Small Factors

[Shafaet_du]

Sample inputs:

Code: Select all

2147483647
1000000
99999999
324534536
2342323333
1
222222222
444444444
555555555
6345345345
0

output:

Code: Select all

2147483648
1048576
100663296
339738624
2415919104
1
226492416
452984832
573308928
6442450944

generate the set {2^i*3^j} using two nested loops and search inside it. Use long long or unsigned int for safety.

happy programming

[masum93]

But your input consists of numbers greater than 2147483648
And a stupid fact, the problem states that the numbers will be of the form 2^i3^j where i,j are in N i.e. they are positive integers, so the first number should be 6 because N is the set of positive integers, but this gives WA.

[uDebug]

Here's some input I found useful during testing / debugging.

Input:

Code: Select all

2147483647
1000000
99999999
2
324534536
48223023
847223
1231298
3
94383434
101010032
1000000000
2000000000
54362323
333711
4742
841232
1
0

AC Output:

Code: Select all

2147483648
1048576
100663296
2
339738624
50331648
884736
1259712
3
95551488
102036672
1019215872
2038431744
56623104
354294
5184
884736
1

[lighted]

generate the set {2^i*3^j} using two nested loops and search inside it. Use long long or unsigned int for safety.

happy programming

This problem is similar to Ugly Numbers (136) and Humble Numbers (443). Set can be generated with one loop using pointers.