## CF #1359 C – Mixing Water

Problem C - Mixing Water Problem Statement - https://codeforces.com/contest/1359/problem/C The problem involves binary search and some observations. Assume h = hot water temperature, c = cold water and t =…

Skip to content
# Blog

##
CF #1359 C – Mixing Water

##
CF #598 C. Nearest vectors

##
Some Recent Easy Questions

##
GREEDY MOVES DAY 02 – Q5

##
GREEDY MOVES DAY 02 – Q4

##
GREEDY MOVES DAY 02 – Q3

##
GREEDY MOVES DAY 02 – Q2

##
GREEDY MOVES DAY 02 – Q1

##
GREEDY MOVES DAY 01 – Q6

##
GREEDY MOVES DAY 01 – Q4

Problem C - Mixing Water Problem Statement - https://codeforces.com/contest/1359/problem/C The problem involves binary search and some observations. Assume h = hot water temperature, c = cold water and t =…

Continue Reading
CF #1359 C – Mixing Water

Using atan2() vs atan() Problem Statement : https://codeforces.com/contest/598/problem/C The entire problem is based on the fact of using long doubles instead of doubles for calculating angles. You must try yourself…

Continue Reading
CF #598 C. Nearest vectors

Codeforces - For Beginners on this platform These list contains problems which are recent and can be a starting point for beginners to take a leap forward. So, grab a…

Continue Reading
Some Recent Easy Questions

C. Adding Powers Problem Statement - https://codeforces.com/problemset/problem/1312/C We will use bitmasking to solve this question. Let's convert this number in k-system. Clearly, every element of a needs to be summation…

Continue Reading
GREEDY MOVES DAY 02 – Q5

B. Count Subrectangles Problem Statement - https://codeforces.com/problemset/problem/1323/B Given n,m,k we can actually find out the frequency of consecutive ones in each row,column. So, for example we have a row as…

Continue Reading
GREEDY MOVES DAY 02 – Q4

A. Unusual Competitions Problem Statement - https://codeforces.com/problemset/problem/1322/A The greedy choice here is to correct the sequence by reordering it as soon as you get the count of closing brackets equal…

Continue Reading
GREEDY MOVES DAY 02 – Q3

C. Permutation Partitions Problem Statement - https://codeforces.com/problemset/problem/1326/C Again, this problem was straight-forward implementation based. The greedy choice here is that we need to consider the last k integers to form…

Continue Reading
GREEDY MOVES DAY 02 – Q2

D2. Prefix-Suffix Palindrome (Hard version) Problem Statement - https://codeforces.com/problemset/problem/1326/D2 The problem was quite straight-forward application of KMP Algorithm. The first thing , we can easily check out for those characters…

Continue Reading
GREEDY MOVES DAY 02 – Q1

A. Powered Addition Problem Statement - https://codeforces.com/problemset/problem/1338/A This is a bit easy problem, at each step, if the current element is less than the maximum till now, we need to…

Continue Reading
GREEDY MOVES DAY 01 – Q6

Phoenix and Distribution Problem Statement - https://codeforces.com/problemset/problem/1348/C This became time consuming for me because I misinterpreted the problem statement. Not confusing you with what I thought!, the problem asks you…

Continue Reading
GREEDY MOVES DAY 01 – Q4