### F-35's blog

By F-35, history, 13 days ago, ,

Hello community! I'm wondering how to solve 381E:Sereja and Brackets but instead of searching the maximum correct bracket subsequence I'm looking for maximum correct bracket substring! any help would be appreciated and thanks^__^

• +1

By F-35, history, 6 months ago, ,

How long have you been coding? and how do you train ? Sharing is caring^__^

• +39

By F-35, history, 8 months ago, ,

Hello coders! let's suppose we have three numbers n,k,mod=1e9+7 where n,k<=1e9 how to calculate nCk %mod! any hint please! Thanks^__^

• 0

By F-35, history, 8 months ago, ,

Hello coders, I'm wondering how to find all edges in a graph which if removed, would disconnect a specific pair of vertices? any hint and Thanks^__^

• +8

By F-35, history, 8 months ago, ,

Hello codeforces community! I'm stuck in this problem :you are given two strings s1 and s2 in one operation ou can reverse a substring in s2 what's the minimum number of operations needed to get identical strings.Opertations are made only on string 2? link Bonus:what's would be the answer if we can apply operations on both strings? any help! and Thanks^__^

• +2

By F-35, history, 8 months ago, ,

Hello I'm stuck in this problem: you are given a maze of size n*m (n,m<=1000),every cell has a number written on it and you need to go from cell (0,0) to cell(n-1,m-1) with minimum cost. you can move up,down,left,right .if you want to go to cell (x,y) and the number in this cell is different from number of current one then cost is increased otherwise cost is unchanged. link any help ! and Thanks

• +1

By F-35, history, 8 months ago, ,

Hello! There is a field n×m, and k of its cells are impassable walls. A robot is initially at the cell (1,1) (bottom left). The robot can only move right or up, and eventually it needs to get into the cell (n,m), avoiding all obstacles. You need to count the number of ways he can do it. Assume that the sizes n and m are very large (say, 109), and the number k is small (around 100) how to solve that in o(k^3)? any hint please and thanks!

• 0

By F-35, history, 8 months ago, ,

Hello I'm trying to solve this question using Aho-corasick tree:how to Find the lexicographically smallest string of a given length that doesn't match any given strings !I'm stuck and I cannot implement that :( any help will be appreciated ^__^ and Thanks!

• +8

By F-35, history, 9 months ago, ,

Hello ! I'm stuck in this interesting problem I'm writing this because I didn't find the editorial (english version) Any help! Thanks