Competitive-Coding-/Birthday Chocolate.java at master · lalshrikant12/Competitive-Coding- · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
import java.util.Scanner;

public class Cake {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int arr[]=new int[n];
        for(int i=0;i<n;i++)
        {
            arr[i]=sc.nextInt();
        }
        int d=sc.nextInt();
        int m=sc.nextInt();
        int count=0;
        int sum=0;
        if (n==1)
        {   try {
        for(int i=0;i<n;i++)
        {
            for(int j=i;j<i+m;j++)
            {
                sum=sum+arr[j];
                if(sum==d)
                {
                    count++;
                }
            }
            sum=0;
        }
        System.out.println(count);
        }catch(Exception e)
        {
            System.out.println();
        }
    }
        else {
             for(int i=0;i<n-m;i++)
             {
                 for(int j=i;j<i+m;j++)
                 {
                     sum=sum+arr[j];
                     if(sum==d)
                     {
                         count++;
                     }
                 }
                 sum=0;
             }
             System.out.println(count);
             }

        }

    }


//only passes 4 testcase:(