10922 - 2 the 9s

[Larry]

I keep getting WA, so I'm not sure if I'm understanding it right.

f(999999999999999999999) =
f(189) + 1 =
f(18) + 2 =
f(9) + 3

and since 9 has 9-degree 1 (as given), doesn't that contradict the first case?

[SRX]

I keep getting WA, so I'm not sure if I'm understanding it right.

f(999999999999999999999) =
f(189) + 1 =
f(18) + 2 =
f(9) + 3

and since 9 has 9-degree 1 (as given), doesn't that contradict the first case?

it should be
It sholud be
when input 999999999999999999999
We count f (189)

sorry , I forgot log in

[Larry]

Not sure what you mean...

[kp]

I keep getting WA, so I'm not sure if I'm understanding it right.

f(999999999999999999999) =
f(189) + 1 =
f(18) + 2 =
f(9) + 3

and since 9 has 9-degree 1 (as given), doesn't that contradict the first case?

Just compute the sum recursively while it >9.

But, to know that sum of 9 is 9 you should compute it once,
thats why f('9') = 1.

[Larry]

Thanks. I changed my input reading from gets to scanf and it worked. I guess there were spaces somewhere..

[SRX]

Thanks. I changed my input reading from gets to scanf and it worked. I guess there were spaces somewhere..

no , use gets can get ac

[wook]

Code: Select all

scanf("%s", temp);

is enough.


btw, using gets, just ignoring non-digit characters, it works also

[Larry]

You can always emulate scanf with gets, but the point is that's the only change I made, and got AC. I presume everything is in [0-9], so if there's a space in the beginning or the end of a line, it'll be wrong for me.. and seems to be the case.

Just a heads up to others. I'm sure you can solve it using gets, just that then you'll have another case to worry about..

[deena sultana]

friends, my 10922 code got TLE.

how can speed up my code? any suggestion?

What i did, the summary is:
1. first i take all inputs in str.
2. then add themi div, and chek if (div%9==0);
3. if not then "not diveded by 9"
4.if yes then calculate the 9-degree by calling the summation n copy function untill div>9.
thats all.

now, i m looking 4 d kind person, who like 2 help me.

Code: Select all

CODE:


	

[ayon]

use code tag so that codes are easily readable.

use "search" button, search for 10922, you will find already discusses topics about the problem

do not use

Code: Select all

for(int i=0;i<strlen(str);i++)

this is toooooooo slow. use

Code: Select all

for(int i = 0; str[i] ; i++)

or

Code: Select all

len = strlen(str);
for(int i = 0; i < len; i++)

your process call the function strlen(), "lenght of the string" times.

remove the copy() function
sprintf(stDiv, "%d", div); will do what you want

[asif_rahman0]

Deena,
its an easy problem. Just do with Recursive method. OK
Example:

Code: Select all

999999999999999999999  = S(189) so its 1
then
189 = S(18) so its 2
then 
18 = S(9) so its 3

hope you got it. ;)
and also will get accepted.

[deena sultana]

Thank u so much, ayon.
stupid strlen() was d culprit.
I get AC.

THANKS AGAIN.

take care.

[deena sultana]

Asif, thanx 4 ur post.
i get d prob AC, by following Ayon's suggestion.
Thanks anyway. u people r so helpful.
take care.

[<:3)~~]

they are saying that we have to find recursion depth..
and that 9 has a depth 1.
9-->1.
Now consider
99999...(21 9's)--->189--->18---->9--->1.
the depth shuld be 4.
but they are saying it to b 3.
Also consider 108.
108--->9--->1.
i think it should be 2.
Am i right???

[Jan]

The problem states...

A well-known trick to know if an integer N is a multiple of nine is to compute the sum S of its digits. If S is a multiple of nine, then so is N

I interpreted this line as 'take a number and sum its digits, and find the depth using that sum'.
Hope it helps.