标题： k倍区间（蓝桥杯）

package com.tjrac_java_2;

import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.util.Vector;

public class TT {
    private static int sum;

    public static void main(String[] args) {
        int n, k;
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        k = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i]=sc.nextInt();
        }
        for (int i = 0; i < n; i++) {
            for (int j = i; j < n; j++) {
                if (check(i, j, k, a)) {
                    sum++;
                }
            }
        }
        System.out.println(sum);
    }

    private static boolean check(int i, int j, int k, int[] a) {
        int s = 0;
        for (int l = i; l <= j; l++) {
            s += a[l];
        }
        if (s % k == 0)
            return true;
        return false;
    }
}