Category Archives: Codeforces Round 448

Codeforces Round 448 – Problem E

Problem E : Link to the problem Statement :You are given an array A and some queries of form :- 1) Given two intervals [l1,r1] and [l2,r2] where a random value is selected from each of the intervals and swapped with each other. 2) Given an interval [l,r] , return the expected sum of the… Read More »

Codeforces Round 448 – Problem C

Problem C : Statement :You are given an array A of n integers where each element lies in [1, 70]. you have to count number of subsequence of array A whose product is a perfect square . (Link to problem) Solution : Clearly, it is dp counting problem. dp state will be (ith number, info… Read More »