← All problemsSign in

The Triangles, Mason !

Jason has given Mason a puzzle. Puzzle is as follows: There is a n x m grid of square shaped cells. Here is single cell of grid :: Mason has to tell how many triangles of any size are there in this grid. Since Mason is a little weak with logic, he has asked you for the answer. Input First line contains a single integer T, number of test cases. Each test begins with a single line contain

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

Sign in to chat with the tutor and save your progress.

Sign in to start