Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Sum of Floor Divisions > Editorial

Sum of Floor Divisions — Solution & Editorial

Back to the Problem

Divisor-block trick: ⌊N/i⌋ is constant over maximal blocks of i; there are only O(√N) distinct values, each covering a contiguous range [i, N/(N/i)].

Complexity: O(√N)

Watch out: An O(N) loop times out at 1012; the block decomposition is the point. Sum reaches ~N ln N.