Divisor SumProblem code: ALK1105 |
All submissions for this problem are available.
A function F(n) for a number n is defined as sum of the divisors of n (including 1 and n) . Given an integer N calculate G(N) = F(1) + F(2) + F(3) + ..... + F(N)
Input
First and only line of input contains an integer N
Output
Output a single line containing G(N)
Constraints
1 <= N <= 10,000,000Example
Input: 3 Output: 8
| Date: | 2011-09-27 |
| Time limit: | 1s |
| Source limit: | 50000 |
| Languages: | C C99 strict C++ 4.0.0-8 C++ 4.3.2 |
Comments
SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:
Fetching successful submissions
can we use long long for
oh i got it .....by using