Subarray Division - HackerRank || HackerRank Subarray Division Solution

#include <stdio.h>

int main()
{
    int n, d, m, i, j, result = 0;
    scanf("%d", &n);
    int array[n];
    for (i = 0; i < n; i++) scanf("%d", &array[i]);
    scanf("%d %d", &d, &m);
    for (i = 0; i < n - m + 1; i++)
    {
        int sum = 0;
        for (j = i; j < i + m; j++) sum += array[j];
        if (sum == d) result++;
    }
    printf("%d\n", result);

    return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, d, m, i, j, result = 0;
    cin >> n;
    int array[n];
    for (i = 0; i < n; i++) cin >> array[i];
    cin >> d >> m;
    for (i = 0; i < n - m + 1; i++)
    {
        int sum = 0;
        for (j = i; j < i + m; j++) sum += array[j];
        if (sum == d) result++;
    }
    cout << result << endl;

    return 0;
}

import java.util.Scanner;

public class Birthday_Chocolate {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int[] array = new int[n];
        for (int i = 0; i < n; i++) array[i] = input.nextInt();
        int d = input.nextInt();
        int m = input.nextInt();
        int result = 0;
        for (int i = 0; i < n - m + 1; i++) {
            int sum = 0;
            for (int j = i; j < i + m; j++) sum += array[j];
            if (sum == d) result++;
        }
        System.out.println(result);
    }
}