nemesis's blog

615D — Multipliers Problem

By nemesis, history, 9 years ago, In English

Hi everybody,

I need help.I've been looking the problem for hours.But i cant find my mistake.This is my awful solution.16437994.Could anyone explain what is my mistake and what should i do? Thanks...

  • Vote: I like it
  • -14
  • Vote: I do not like it

Comments Comments (2)
| Write comment?
»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Variable divisorsCount is the number of divisors mod (MODULE — 1). By divisiorCount /= 2; you are trying to get half of number of divisors mod (MODULE — 1), which doesn't work. (MODULE — 1) is even, so remainder of 2x mod (MODULE — 1) is not enough to tell remainder of x mod (MODULE — 1). You can for example count divisorsCount mod 2 * (MODULE — 1), then the divisorCount /= 2; would work.

→ Reply