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 Remainders > Editorial

Sum of Remainders — Solution & Editorial

Back to the Problem

N mod i = N − i·⌊N/i⌋, so the sum is N·M − ∑ i·⌊N/i⌋. The floor is constant over √N blocks; sum i over each block with the arithmetic-series formula.

Complexity: O(√N)

Watch out: An O(M) loop dies at 1012; the divisor-block decomposition with arithmetic sums is required.