Question

Question: input an int number ex: ABCD, verify that is ABCD = AB*CD or not

(note that we don’t how many digits this number got, just know it is an positive integer

and yes, it the number of digits is odd we can conclude result is No, immediately by… eye lol)

for example:

    Enter a number: 88
    Output: No

    Enter a number: 12600
    Output: No

    Enter a number: 116725
    Output: Yes, 116 * 725 = 116725 (**this is just example, 

not actual result, just help to understand how output look like**)

Problem is that, you can’t use array, jump and bitwise in order to solve this. Yes, if we can use array then not much to say, put input number in an array, check first half multiply other half….bla..bla… I need help with IDEA without using array to solve this problem, right now I’m stuck! Thank you guy very much!

Answer 1

A little hint to your 6 digits number:

• to get last 3 digits use % 1000
• to get first 3 digits use (int) X/1000.

Notice that 1000 == 10^3.