Today due to a power outage there may be disruptions in the work of Codeforces and Polygon. Please do not plan any important events during this time. If there are details or the exact time, we will definitely publish them. Estimated time of maintenance: from 3 Aug, 14:30 (UTC) to 3 Aug, 18:00 (UTC). ×

Lewin's blog

By Lewin, 4 years ago, In English
Fibonacci Frequency
Rainbow Road
Wildcard Words
Counter Complexity
Avoiding Adjacent
Token Tree
 
 
 
 
  • Vote: I like it
  • +80
  • Vote: I do not like it

»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Lewin could you share your solution of Wildcard Words in java?

»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

What is test 59 in Fibonacci Frequency?

»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

For "Avoiding Adjacent", what is the complexity of dynamic programming solution? And was it supposed to get AC?