5 kyu
New Function
68 of 174sazzadshopno
Description:
We all know that any integer number n is divisible by 1 and n. That is why these two numbers are not the actual divisors of any numbers. The function SOD(n) (sum of divisors) is defined as the summation of all the actual divisors of an integer number n. For example: SOD(24) = 2+3+4+6+8+12 = 35.
The function CSOD(n) (cumulative SOD) of an integer n, is defined as below:
Given the value of n, your job is to find the value of CSOD(n).
Random Test
Number of Test Cases:
2000Range:
0to100000000
Fundamentals
Performance
Similar Kata:
Stats:
| Created | Jan 26, 2019 |
| Published | Jan 26, 2019 |
| Warriors Trained | 1336 |
| Total Skips | 247 |
| Total Code Submissions | 1493 |
| Total Times Completed | 174 |
| C++ Completions | 68 |
| C Completions | 68 |
| JavaScript Completions | 54 |
| Total Stars | 37 |
| % of votes with a positive feedback rating | 77% of 39 |
| Total "Very Satisfied" Votes | 26 |
| Total "Somewhat Satisfied" Votes | 8 |
| Total "Not Satisfied" Votes | 5 |
| Total Rank Assessments | 4 |
| Average Assessed Rank | 6 kyu |
| Highest Assessed Rank | 4 kyu |
| Lowest Assessed Rank | 7 kyu |
