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 GCDs with N > Editorial

Sum of GCDs with N — Solution & Editorial

Back to the Problem

∑ gcd(i, N) = ∑d|N d·φ(N/d) (Pillai's function). Enumerate divisors in O(√N), each totient in O(√).

Complexity: O(√N · √)

Watch out: The answer reaches ~N log log N — 64-bit; and enumerate BOTH d and N/d per divisor pair.