Pairs
Problem
Given T test cases. Each test case contains a number N. Print how many pairs (i, j) exists such that i*j <= N.
Constraints
1 <= T <= 105
1 <= N <= 5*105
Time Limit: 1
Memory Limit: 256
Source Limit:
Given T test cases. Each test case contains a number N. Print how many pairs (i, j) exists such that i*j <= N.
Constraints
1 <= T <= 105
1 <= N <= 5*105
