Many Many Polygons

CodeChefOpen on judge ↗

### Description: You have to find the number of possible values of $N$ from $3$ to $L$ (inclusive), such that angle $A$ can be formed by connecting some 3 vertices of an $N$-sided regular polygon. ### Input: - First line of the input consists of a single integer $T$ denoting the number of test cases. - The first line of each test case consists of two space-separated integer $A$ & $L$ denotin

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