## GREEDY MOVES DAY 01 – Q3

C. Circle of Monsters Problem Statement - https://codeforces.com/problemset/problem/1334/C In this problem, we are said to find minimum bullets needed to kill all the monsters. But, looking closely, we understand that…

Skip to content
# Blog

##
GREEDY MOVES DAY 01 – Q3

##
GREEDY MOVES DAY 01 – Q2

##
GREEDY MOVES DAY 01 – Q1

##
The Greedy Moves!

##
#3 Segment Trees on Strings

##
#2 GSS3 – Can you answer these queries III

##
#1 CF 223-C Sereja and Brackets

##
ABC #162 F – Select Half

##
E: Active Infants

##
D – Multiple of 2019

C. Circle of Monsters Problem Statement - https://codeforces.com/problemset/problem/1334/C In this problem, we are said to find minimum bullets needed to kill all the monsters. But, looking closely, we understand that…

Continue Reading
GREEDY MOVES DAY 01 – Q3

Minimum Euler Cycle Problem - https://codeforces.com/problemset/problem/1334/D To start with, if you don't know about complete graphs, check this out https://en.wikipedia.org/wiki/Complete_graph So, we have a complete graph, where each edge needs…

Continue Reading
GREEDY MOVES DAY 01 – Q2

B. Phoenix and Beauty Question - https://codeforces.com/problemset/problem/1348/B The problem ask you to construct the solution where each subarray of size 'k' must have same sum. We DO NOT need to…

Continue Reading
GREEDY MOVES DAY 01 – Q1

Hi, this is my first ever initiative where in I am going to follow a certain activity for a fixed interval of time. This initiative is about solving the greedy…

Continue Reading
The Greedy Moves!

Point Updates and Range Queries Problem Statement: hereRoadmap - Segment Trees Here, we solve another problem on Seg Trees, in which we are asked to find the number of substrings which…

Continue Reading
#3 Segment Trees on Strings

Point Updates and Range Queries Problem Statement: hereRoadmap: Segment Trees This problem is online version of the GSS1 problem on SPOJ. I choose this version because we have already seen one…

Continue Reading
#2 GSS3 – Can you answer these queries III

Introduction to Range Queries Problem Statement - hereRoadmap - Segment Trees #1 It is a classical Segment Tree question with no updates. The only important thing to figure out is…

Continue Reading
#1 CF 223-C Sereja and Brackets

Problem Statement - here We will be using 1d DP to solve the problem. We will make the prefix sum array for odd positions beforehand. Let's denote it as ps[ ].…

Continue Reading
ABC #162 F – Select Half

Problem Statement - here To make ourselves clear, we can rearrange them in any order we like. So, it is clear that for every element we have to keep it as…

Continue Reading
E: Active Infants

Problem Statement: here We are told to find out the number of pairs such that the base 10 representation of the string gets divisible by 2019. The problem could have been…

Continue Reading
D – Multiple of 2019