CodeChef Discuss

CHOCOS (AlgoFuzz 19.1)

abhinavverma November 14, 2019, 8:14pm 1

CodeChef: Practical coding for everyone

Learn to code for free using our beginner friendly and interactive learning courses. Get all the practical skills required to excel at computer science. Start learning with CodeChef today and unlock your potential as a developer!

Can anyone give lucid explanation on how to approach this problem?

codeguptaji November 14, 2019, 8:20pm 2

LENTMO - EDITORIAL editorial

PROBLEM LINK: Practice Contest: Division 1 Contest: Division 2 Setter: Abhishek Vanjani Tester: Radoslav Dimitrov Editorialist: Teja Vardhan Reddy DIFFICULTY: Easy PREREQUISITES: Properties of XOR, greedy PROBLEM: Given an array A of n numbers and integers k and x. We can perform the following operation any number of times (including zero times). Take exactly k numbers from the array and replace each of them after doing xor with x. For example, we took ith element among k elements, we wi…

3 Likes

Home
Categories
FAQ/Guidelines
Terms of Service
Privacy Policy

Powered by Discourse, best viewed with JavaScript enabled