Modulo behavior

Правка en3, от WalidMasri, 2016-02-09 19:41:29

Hello everyone!

i was trying to solve this problem , but the modulo behavior caused me to get WA as a verdict.

When computing the formula  , once n is reduced by modulo, the prime divisors (p1,p2... pk) wont remain divisors of n, hence, getting a non-integer result.

MORE Explanation : Given (n%k)/ m, where m is a divisor of n ... if i performed n%k then divided by m, i will get a non-integer result.

What can i do to avoid such problem?

Thanks!

Теги modulo, euler, number theory

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский WalidMasri 2016-02-09 19:41:29 139
en2 Английский WalidMasri 2016-02-07 22:57:55 49
en1 Английский WalidMasri 2016-02-07 22:48:41 507 Initial revision (published)