जाल में ((0,0)) से ((5,5)) तक केवल दाएँ और ऊपर चलते हुए जाना है। मार्ग को ((2,3)) और ((4,4)) में से ठीक एक बिंदु से होकर जाना चाहिए। कुल कितने मार्ग होंगे?
In a grid, one moves from ((0,0)) to ((5,5)) using only right and up moves. The path must pass through exactly one of ((2,3)) and ((4,4)). How many paths are possible?
Explanation opens after your attempt
Correct Answer
B. (120)
Concept
Subtract the paths passing through both points twice because exactly one point is required. Combine grid-path counting with inclusion-exclusion.
Why this answer is correct
The correct answer is B. (120). Subtract the paths passing through both points twice because exactly one point is required. Combine grid-path counting with inclusion-exclusion.
Exam Tip
दोनों बिंदुओं से होकर जाने वाले मार्गों को दो बार घटाएँ क्योंकि ठीक एक बिंदु चाहिए। जाल-मार्ग और समावेशन-बहिष्करण को साथ लगाएँ।
Login to save your score, XP, coins and progress.