A. Nastia and nearly Good Numbers | Codeforces Round

[@maharajak6578]

i was thinking of odd even property, gone in a very different track.. thanks also the problem statement was not very clear

[@swayamsidhant2318]

Yeah got 7-8 WA and ended up getting just 150 points in this question😂😂

[@codeExplainer]

hahahah , true

[@nayanmathur6064]

The problem statement is absolutely correct. If it is written, the number is divisible by A then its your mistake to deduce that it is only divisible by A not B. Also, I watch streaming of LGM's on youtube, so I have a doubt why do you explain only A and B problems? Please also try to explain all the problems from a normal Div2 and Div3 rounds so that it could make sense from next time.

[@praveshvajpayee3133]

I agree he should first solve and then explain D AND E

[@my_religion]

Thanks alot!

[@codeExplainer]

You're welcome!

[@atharvakulkarni2024]

very true problem statement was wrong thats y i couldnt solve..Thanks for the video..:)

[@sanskarkumar7984]

No bro it wasn't.

[@codeExplainer]

Glad it helped

[@manimanidev738]

If nearly good number divisible by both a&b then it is also divisible by a*b that is good.

[@codeExplainer]

no , if u read the problem statement , let a = 4 and b=6 , so 24 is good because it is multiple of a*b, but 12 is nearly good as it is divisible by a , and also b, but it is not divisible by a*b.

[@sanskarkumar7984]

I got an AC before the problem statement was changed. Idk it was a fluke or my skills. 😅😅😅

[@codeExplainer]

ohhh nice ..

[@questionpaper4272]

Bro, what do the column hack means with respect to this contest!?

[@codenchill732]

how we can put x=1 , y=1 why?

[@questionpaper4272]

Bro, we are not putting, like for example if x and y takes any other value, the number is surely going to be different and it can't take zero as the whole thing becomes zero. So, we take a special case of equal number to check the condition and choosing 1 makes calculation more easier!!?? Hope I have answered your question! If anything wrong do let me know

[@pawanagrawal7653]

Their are no test cases on which the ans is no..??

[@shitalkallole3056]

A=any number, B=1 -> answer will always be "NO" because each number is divisible by (a*b) so each number is good .

[@pawanagrawal7653]

@@shitalkallole3056 yhh..😀

[@ImamulHasan717]

why you use the extra function in the beginning of the code?

[@codeExplainer]

the extra function , are there for some modular arithmetic problems , they are of no use , just part of my template.

[@rishabh2055]

What should be the answer for A = 4, B = 2?

[@Newbie0341]

4 8 12

[@rishabhmehrotra3887]

12 is not divisible by 8 (4*2), I guess this will not work

[@sahilkommu1619]

@@rishabhmehrotra3887 it will work becaus we only need one good number which is 8 and 4,12 are nearly good.

[@ayushkishoremishra8141]

what should be the ans of A=95 and B=1 why it cant be 95 190 285

[@vivekgoswami4262]

Same doubt if you understood please explain me too

[@ganeshchowdhary3024]

It is because the problem statement says that "exactly one is good and other two are nearly good". So here 190, 95 and 285 are good which is a contradiction to the problem statement. Read the problem statement carefully to find the edge cases to be handled.

[@anonymoussheriff1157]

Got struck in the same test case lmao!

[@owaiskorejo]

@@ganeshchowdhary3024 thanks man

[@aadhikeaswar6974]

if a%b==0 then we can not get nearly good numbers at all how does this solution work then?

[@codeExplainer]

i was also thinking that during the contest , but see the example , we can get nearly good number also , if a=4 and b=2 , then 8 is a nearly good number , as it is divisible by a , and that is the only condition.

[@aadhikeaswar6974]

@@codeExplainer thanks great video I found it very helpful!

[@pushpaksambhe7405]

I got stucked due to *different*

[@codeExplainer]

hahha

[@narayanbansal4036]

Same problem faced

[@codeExplainer]

ya it was a major problem..