HDU2132 An easy problem 【Java】

最新推荐文章于 2019-08-14 06:51:49 发布

原创最新推荐文章于 2019-08-14 06:51:49 发布 · 1.2k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#HDU2132

An easy problem

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 9194 Accepted Submission(s): 2491

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

Sample Output

Author

Wendell

Source

HDU 2007-11 Programming Contest_WarmUp

Java水过。

import java.util.Scanner;
import java.math.BigInteger;

public class Main {
    static final int maxn = 100005;
    static BigInteger[] arr = new BigInteger[maxn];

    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        arr[0] = BigInteger.ZERO;
        BigInteger tmp;
        for(int i = 1; i <= 100000; ++i) {
            tmp = BigInteger.valueOf(i);
            if(i % 3 == 0)
                arr[i] = arr[i-1].add(tmp.multiply(tmp).multiply(tmp));
            else arr[i] = arr[i-1].add(tmp);
        }
        int n;
        while(true) {
            n = cin.nextInt();
            if(n < 0) break;
            System.out.println(arr[n]);
        }
    }
}

C代码好像更简单些。

#include <stdio.h>

#define maxn 100005
typedef __int64 LL;

LL arr[maxn];

int main() {
    int n, i;
    for(i = 1; i <= 100000; ++i)
        if(i % 3) arr[i] = arr[i-1] + i;
        else arr[i] = arr[i-1] + (LL)i * i * i;
    while(scanf("%d", &n), n >= 0)
        printf("%I64d\n", arr[n]);
}