✅Diet planning (Contest)

Diet planning (Contest) easy Time Limit: 2 sec Memory Limit: 128000 kB

Problem Statement :

There are N chocolates with you. You want to finish them as quickly as possible, but recently you've gained a lot of weight and hence you've set a limit for yourself on the number of chocolates you can eat per day. This limit is different for each day i. e., for Monday it is a1, for Tuesday it is a2 and so on till Sunday as a7. Find the day on which you will eat your last chocolate starting with Monday. Input The first line of the input contains a single integer N. The next line of the input contains 7 space seperated integers.

Constraints: 1 <= N <= 105 0 <= ai <= 105 Sum of all ai is greater than 0. Output Print the day on which you will eat your last chocolate. Example Sample Input: 15 2 4 3 1 0 0 1

Sample Output: Tuesday

link:https://my.newtonschool.co/playground/code/2wl3b4lhkpxd/

```java
import java.io.*; // for handling input/output
import java.util.*; // contains Collections framework

// don't change the name of this class
// you can add inner classes if needed
class Main {
    public static void main (String[] args) {
        // Your code here
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[]week = new int[7];
        int sum = 0;
        int temp = 0;
        for(int i = 0;i<7;i++){
            temp = sc.nextInt();
            sum+= temp;
            week[i] = temp;
        }
        sum = n%sum;
        if(sum==0){
            System.out.println("Sunday");
            return;
        }
        int i = 0;
        for(i = 0;i<n;i++){
            sum-= week[i];
            if(sum<=0)break;
        }
        String[]arr = {"Monday","Tuesday","Wednesday","Thursday","Friday","Saturday","Sunday"};
        System.out.println(arr[i]);

    }
}
```