oursaco's blog

By oursaco, history, 6 weeks ago, In English

I've been working on an NTT implementation, which needs a big modulo in the form of x*2^k + 1. Does anyone know any mods of this form around 1e25. I rly don't want to use Chinese remainder theorem T-T.

Read more »

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

By oursaco, history, 7 weeks ago, In English
 
 
 
 
  • Vote: I like it
  • +26
  • Vote: I do not like it

By oursaco, history, 2 months ago, In English

Can someone plz recommend some problems involving using matrices on a segtree?

Read more »

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

By oursaco, history, 4 months ago, In English

Wouldn't it be great if codeforces had the option to sort comments by some metric such as time or upvotes? I know it's not necessary, but hey I'm lazy and it would save me a few scrolls. :D

Read more »

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

By oursaco, history, 9 months ago, In English

did codeforces just remove c++11 from the compile languages

Read more »

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

By oursaco, history, 10 months ago, In English

I know that you can extend BIT to do range min/max queries with two BITs, but is it possible to range update while doing min/max queries with BIT.

Read more »

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

By oursaco, history, 13 months ago, In English

I saw that a few people were hacking other people in the hacks tab of today's contest, but I can't figure out how to hack.

Read more »

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