Problem hidden on 2013-06-23 22:56:17 by Francky
SQAMOD - Numbers Sum Squares Modulo ZERO
Given n(n >= 1 && n <= 10^10000). Find numbers of non negative numbers strictly less than n, having sum of squares of digits modulo 3 to be zero.
Input
T (no of test cases). ( T <= 40) then next T lines will contain a number n as mentioned in the problem statement,
Output
For evey test case, output as explained in the problem.
Example Input: 4 4 9 10 15 Example Output: 2 3 4 4
| Added by: | praveen123 |
| Date: | 2013-06-23 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 |
| Resource: | general problem |
RSS