Hdoj2015_偶数求和

来源:互联网 发布:太极循环人工智能 编辑:程序博客网 时间:2024/06/05 03:36

import java.util.Scanner;

 

public class Main {

   public static void main(String[] args) {

       Scanner in = new Scanner(System.in);

       while (in.hasNext()) {

           int n = in.nextInt();

           int m = in.nextInt();

           int[] a = new int[n];

           for (int i = 0; i < n; i++)

                a[i] = 2 * (i + 1);

            int sum = 0, count = 0;

           for (int i = 0; i < n; i++) {

                sum += a[i];

                count++;

                if (i == n - 1) {

                    System.out.println(sum /count);

                } else if (count == m) {

                    System.out.print(sum / m +" ");

                    sum = 0;

                    count = 0;

                }

           }

       }

    }

 

}

原创粉丝点击