In Codechef Round 194 Div 4, there was one particular question that completely shattered my confidence. After failing to solve it during the contest, my brain froze — and I couldn’t think clearly for the remaining problems. But after calming myself d...
Welcome to the chaotic elegance of Greedy Algorithms — where being selfish is sometimes exactly the right move We’ll break down: What greedy algorithms actually are When they work and (importantly) when they don’t Real-world examples + classic pro...
Introduction C++ has long been the backbone of game development, high-performance applications, and real-time systems. Its unmatched execution speed and flexibility make it the go-to language for building game engines, competitive programming, and sy...
Today I officially started my grind toward 1400+ on CodeChef. I’ve kept the first day light but insightful — focused mostly on two-pointer logic, frequency maps, and a neat parity-based math problem. Here’s what I worked on: 🔹 Problem 1: LeetCode 9...
Introduction Recursion is a fascinating concept in computer science where a function calls itself to solve a problem. Think of it like a set of Russian nesting dolls, where each doll contains a smaller version of itself. In programming, a recursive f...
A. 评估 关键在于 \(|a_i| \le 1000\)，所以可以开一个长度为 2000 的数组统计一下每个值的个数，然后 \(\Theta(n^2)\) 处理这个 2000 的数组。 #include <iostream> using namespace std; const int N = 2010; int a[N]; int main() { int n; scanf("%d", &n); for (int i = 1; i <= n; ++i) { ...
A. 序列 逻辑非常简单，先输出 k 个 0 之后 01 交替输出直到把 0 用完，最后输出剩下的 1. #include <iostream> using namespace std; int main() { int n, m, k; scanf("%d%d%d", &n, &m, &k); for (int i = 1; i <= k; ++i) { printf("0"); m--; } while (n || ...
题面可以看这里. A. 数列计数 最害怕的数学题。 \(\prod_{i=1}^{n}\binom{a_i}{b_i} \) 等价于对于每一个 i，都有 \(\binom{a_i}{b_i}\) 为奇数。 对于 \(\binom{n}{k}\)，根据（ChatGPT指出的）卢卡斯定理，取 p = 2 有 \[\binom{n}{k} \equiv \binom{n\ \text{mod}\ 2}{k\ \text{mod}\ 2} \binom{\lfloor\frac{n}{2}\rfloor...
Problem Statement Given an integer array nums, return an array answer such that: answer[i] = product of all elements in nums except nums[i] 🔍 Intuition If we could use division, a simple approach would be: Calculate the product of all elements. D...
Why use a heavyweight IDE when JetBrains Fleet delivers everything—fast and clean? I've recently adopted JetBrains Fleet for C++ development on Arch Linux, and it's quickly become my preferred setup for both competitive programming and SDL2 graphics ...
