ArmWeak Numbers

CodeChefOpen on judge ↗

ArmWeak number : A number of the form abcd is said to be an ArmWeak number, when (a4+b3+c2+d1) is divisible by 7. This concept of armweak number can be extended to any number (with any number of digits). Find the number of ArmWeak numbers below N. Input The first line consists of T number of test cases. Then T lines follow each taking an input N. Output Your program has to print the number o

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