Tintin's blog

By Tintin, 9 years ago,

Hi,

Here m can be non prime number.How can I handle the division property? I read tutorialhttp://codeforces.com/blog/entry/6625, but I can't understand properly. Can you reply, thanks

• -10

By Tintin, 9 years ago,

Hi, if the upper range of unsigned __int64 is 2^64-1 then how can I get any number modulo by 2^64? Thanks.

• -16

By Tintin, 10 years ago,

Your text to link here... My dp solution is O(n^2) but here n=50000 and time is 1 sec. Is there any mathematical formula which reduces time within 1 sec. Any hints...Thanks

• 0

By Tintin, 10 years ago,
How I do big number (>10^20) mod by a number,
thanks

• +9

By Tintin, 10 years ago,
I've lack of knowledge about bit-mask , thus most of contest time I ignore this type of problem, Please share with me about masking technique what you know....thanks

• 0

By Tintin, 10 years ago,

http://www.codeforces.com/contest/112/problem/D
if input is=> 18 4 why output is=> 2, if I'm not wrong it would be 3, because 6,9,18 aren't divisor of the 14,15,16,17.
and the last input=> 10000 3 output should be 23, because out of 25 divisor of 10000 ,there are only 1 and 2 common divisor between 10000 and 9998