Do it for FUN | SUMFIのBlog

[Hacker Earth] The Circular jump (Lowe) 2023-12-13|PSHacker Earth|Problem Solving-BFS

[Codeforces] Round 146 (Div. 1) B. Let`s Play Osu! 2023-12-13|PSCodeforces|Problem Solving-Dynamic Programming-Probability and Statistics

Codeforces Round 146 (Div. 1) B. Let’s Play Osu!

[Codeforces] Round 147 (Div. 2) D. T-decomposition 2023-12-13|PSCodeforces|Problem Solving-Graph Theory

Codeforces Round 147 (Div. 2) D. T-decomposition

[Codeforces] Round 147 (Div. 2) E. Build String 2023-12-13|PSCodeforces|Problem Solving-Maximum Flow

Codeforces Round 147 (Div. 2) E. Build String

[Codeforces] Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) C. Mirror Box 2023-12-13|PSCodeforces|Problem Solving-Geometry

Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) C. Mirror Box

[Codeforces] Round 149 (Div. 2) E. XOR on Segment 2023-12-13|PSCodeforces|Problem Solving-Bit Manipulation-Lazy Propagation Segment Tree

Codeforces Round 149 (Div. 2) E. XOR on Segment

[LeetCode] Special Positions in a Binary Matrix 2023-12-13|PSLeetCode|Problem Solving

1582. Special Positions in a Binary Matrix

Given an m x n binary matrix mat, return the number of special positions in mat.

A position (i, j) is called special if mat[i][j] == 1 and all other elements in row i and column j are 0 (rows and columns are 0-indexed).

[Hacker Earth] Count Coprime Subsequences 2023-12-12|PSHacker Earth|Problem Solving-Dynamic Programming-Math

Count Coprime Subsequences

[Hacker Earth] Straightest path 2023-12-12|PSHacker Earth|Problem Solving-BFS-Heap

Straightest path

[Hacker Earth] Edge Strength (Lowe) 2023-12-12|PSHacker Earth|Problem Solving-DFS

Edge Strength (Lowe)

Algolia