Giriraj Bidwai’s Post

View profile for Giriraj Bidwai, graphic

Final Year Student | AWS Cloud Practitioner | Google Cloud Digital Leader | Leetcode - Knight(1861) | Codeforces - Pupil(1210) | AtCoder - Brown(692) | Data Engineer | PySpark | SQL | Kafka | AWS | CSE Grad '25

AtCoder Beginner Contest 356 Question A : Given n,l and r output the numbers from 1 to n and reverse the number in sequence of l and r. Question B : For each A[i] we need sum of X[i][0] to X[i][m] greater or equal to A[i] if this violates the condition output No else Yes. Question C : We will be taking each and every combination of real and dummy key and iterate over all the m test for each combination and check for the condition is the key is in tests combination or not and maintain the count of real keys and for each test of the door is opened but the count of real key is less than key it contradicts the result and if the real keys count is greater than or equal to k but the door does not open then also it contradict the decision and when the above condition are not violated the combination is possible we will increment the count of valid combination. Question D : We need the sum of popcount of k&m such that k is from 0 to N.If the 2^i th bit of m is set then we need to find out how many numbers from 0 to N are such that the bit is set.If the 2^i th bit is set then in 2*(2^i) numbers we will have 2^i numbers such that this bit is set we will divide n by 2*(2*i) to find how many such numbers are there and for the remaining numbers if(2^i - remainder) is greater than 0 we will take that many numbers +1.Count can be too large we take mod of 998244353. #atcoder #codeforces #codechef #leetcode #cpp #python #coding #contest #cp

  • No alternative text description for this image
Dinesh Sirvi

Final Year Student at Vellore Institute of Technology | AWS Certified Cloud Practitioner

6mo

Keep this grinding on!💪 Hoping you achieve more success.

To view or add a comment, sign in

Explore topics