Learn DSADSAContests
coding75 logo
LeetCode POTDPOTDSheets
coding75 Pro
coding75 logo
Dashboard
Learn DSA
Course RoadmapFlow
DSA Topic TreeNew πŸš€
Contest SolutionsPractice
Practice Sheets
MasterclassesLive πŸ‘¨πŸ»β€πŸ’»

coding75 ProPRO

Live Classes & Placement Guidance

coding75 logo

The premier developer platform for mastering Data Structures & Algorithms, exploring contest editorials, building ATS-ready resumes, and accelerating your tech career.

Connect & Community

DSA & Contests

  • Learn DSA
  • Contest Solutions
  • LeetCode POTDDaily
  • Practice Sheets
  • MasterclassesSoon

Interview Prep

  • Portfolio Projects
  • CS Fundamentals
  • System DesignSoon
  • Interview ExperiencesSoon
  • Mock InterviewsSoon

Career & Pro

  • Jobs & Internships
  • Resume BuilderATS
  • coding75 Pro
  • Submit Feedback
Β© 2026coding75β€’crackDSAβ„’β€’Maa Lalita Edtech Private Limited. All Rights Reserved.
Privacy PolicyTerms & ConditionsContact Support
Registered Office: Kanpur 208021β€’Regional Office: Indiranagar, Bangalore, 560008
Maa Lalita Edtech Private Limited
Contests/Codeforces/Codeforces Round 940/D. A BIT of an Inequality
Prev
CodeforcesCodeforces
Candidate Master
Codeforces Round 940

D. A BIT of an Inequality

Bit ManipulationBitmaskDynamic ProgrammingPrefix SumSuffix Array
Loading...
Solve on Codeforces

Problem Statement

Official algorithmic problem description and constraints.

Open on Codeforces

You are given an array π‘Ž1,π‘Ž2,…,π‘Žπ‘›. Find the number of tuples () such that:

  • 1≀π‘₯≀𝑦≀𝑧≀𝑛 and
  • 𝑓(π‘₯,𝑦)βŠ•π‘“(𝑦,𝑧)>𝑓(π‘₯,𝑧).

We define𝑓(𝑙,π‘Ÿ)=π‘Žπ‘™βŠ•π‘Žπ‘™+1βŠ•β€¦βŠ•π‘Žπ‘Ÿ, where βŠ• denotes the bitwise XOR operation.

Solutions & Walkthrough

Detailed video explanations, mathematical intuition, and clean C++ implementation code.

Connecting secure classroom stream...
Back to Codeforces Round 940
Previous Problem