Error
|
|
---|---|
@Ibrahim Nash | 6379 |
@blackshadows | 6329 |
@mb1973 | 5358 |
@Quandray | 5231 |
@akhayrutdinov | 5111 |
@saiujwal13083 | 4510 |
@sanjay05 | 3762 |
@marius_valentin_dragoi | 3522 |
@sushant_a | 3459 |
@verma_ji | 3357 |
@KshamaGupta | 3318 |
Complete Leaderboard | |
|
|
@ritiksethi21 | 1050 |
@aroranayan999 | 807 |
@RizulBansal | 685 |
@ashishtrehan002 | 538 |
@hemantgarg923 | 528 |
@simrangoyal | 526 |
@ronaldo77 | 520 |
@anishrajan | 505 |
@thanosagain | 505 |
@ssparteek470 | 495 |
@rahul2312 | 491 |
Complete Leaderboard |
Given a number N, find the sum of all its factors.
Example 1:
Input: N = 30 Output: 72 Explanation: Factors sum 1 + 2 + 3 + 5 + 6 + 10 + 15 + 30 = 72
Example 2:
Input: N = 15 Output: 24 Explanation: Factors sum 1 + 3 + 5 + 15 = 24
Your Task:
You don't need to read input or print anything. Your task is to complete the function factorSum() which takes N as input and returns the sum.
Expected Time Complexity: O(sqrt N)
Expected Auxiliary Space: O(1)
Constraints:
1 ≤ N ≤ 109
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Yes