Problem Description
We once did a lot of recursional problem . I think some of them is easy for you and some if hard
for you.
Now there is a very easy problem . I think you can AC it.
We can define sum(n) as follow:
if i can be divided exactly by 3 sum(i) = sum(i-1) + i*i*i;else sum(i) = sum(i-1) + i;
Is it very easy ? Please begin to program to AC it..-_-
Input
The input file contains multilple cases.
Every cases contain only ont line, every line contains a integer n (n<=100000).
when n is a negative indicate the end of file.
Output
output the result sum(n).
Sample Input
1
2
3
-1
Sample Output
1
3
30
#include <cstdio>
const int MAX = 100001;
int main(int argc, const char* argv[])
{
__int64 result[MAX], i;
for (i=0; i<MAX; ++i)
{
if (0 == i)
{
result[i] = i;
}
else if (i%3 == 0)
{
result[i] = result[i-1] + i*i*i;
}
else
{
result[i] = result[i-1] + i;
}
}
int n = 0;
while (scanf("%d", &n) != EOF && n >= 0)
{
printf("%I64d\n", result[n]);
}
return 0;
}