Tintin's blog

By Tintin, 9 years ago, In English

Hi,

Here Problem link:http://codeforces.com/contest/273/problem/B

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

Read more »

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

By Tintin, 9 years ago, In English

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

Read more »

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

By Tintin, 10 years ago, In English

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

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

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

Read more »

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

By Tintin, 10 years ago, In English
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

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By Tintin, 10 years ago, In English

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

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it