W4yneb0t's blog

By W4yneb0t, history, 5 weeks ago, In English,

I remember reading this problem in some contest, but I don't remember where. I think the contest was 2016 or so. I searched on a few websites with no luck. Do you happen to know what contest it was?

The problem is: Given integers a1, ..., an, We define x0 = 1 and for every . Find xn. The solution was O(n * polylog(n)) with FFT.

Read more »

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

By W4yneb0t, history, 2 years ago, In English,

Topcoder forums don't have a 2B subforum yet, so discuss here.

Read more »

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