Pascals Triangle

CodeChefOpen on judge ↗

Pascal's Triangle has many properties and patterns related to it. Given a Number $N$.The indexing of rows start from $1$.Let the index of any row of the triangle be $i$. Count the no. of distinct $i$ such that $1 \leq i \leq N$ and the no. of even elements in the $i$-th row is 0. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI