KnightKnight's blog

By KnightKnight, history, 2 years ago, In English

This is the link for the question. But I will state the question here as well as this task gives us a string of digits in which we have to find number of substrings that are divisible by 2019, I have tried with the editorial but one thing seems to be ambiguous and I am not able to reason it out this line states that " 2019 is not divisible by 2 or 5, so there exists the inverse of 10 in mod2019. So 10n is a multiple of 2019 if and only if n is a multiple of 2019" What is the inverse helping us out in finding divisibility for substrings It will be a great help if some one could clear my doubts

UPD My doubt is clear now ! Errichto Helped with his video on his channel about the same question.

 
 
 
 
  • Vote: I like it
  • +1
  • Vote: I do not like it

»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by KnightKnight (previous revision, new revision, compare).

»
23 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by KnightKnight (previous revision, new revision, compare).

»
4 months ago, # |
  Vote: I like it -8 Vote: I do not like it