Kitchen Timetable CodeChef Solution

Problem – Kitchen Timetable CodeChef Solution

There are N students living in the dormitory of Berland State University. Each of them sometimes wants to use the kitchen, so the head of the dormitory came up with a timetable for kitchen’s usage in order to avoid the conflicts:

• The first student starts to use the kitchen at the time 0 and should finish the cooking not later than at the time A₁.
• The second student starts to use the kitchen at the time A₁ and should finish the cooking not later than at the time A₂.
• And so on.
• The N-th student starts to use the kitchen at the time A_N-1 and should finish the cooking not later than at the time A_N

The holidays in Berland are approaching, so today each of these N students wants to cook some pancakes. The i-th student needs B_i units of time to cook.

The students have understood that probably not all of them will be able to cook everything they want. How many students will be able to cook without violating the schedule?

Input

The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.

The first line of each test case contains a single integer N denoting the number of students.

The second line contains N space-separated integers A₁, A₂, …, A_N denoting the moments of time by when the corresponding student should finish cooking.

The third line contains N space-separated integers B₁, B₂, …, B_N denoting the time required for each of the students to cook.

Output

For each test case, output a single line containing the number of students that will be able to finish the cooking.

Constraints

Should contain all the constraints on the input data that you may have. Format it like:

• 1 ≤ T ≤ 10
• 1 ≤ N ≤ 10⁴
• 0 < A₁ < A₂ < … < A_N < 10⁹
• 1 ≤ B_i ≤ 10⁹

Example

Input:
2
3
1 10 15
1 10 3
3
10 20 30
15 5 20
Output:
2
1

Explanation

Example case 1. The first student has 1 unit of time – the moment 0. It will be enough for her to cook. The second student has 9 units of time, but wants to cook for 10 units of time, and won’t fit in time. The third student has 5 units of time and will fit in time, because needs to cook only for 3 units of time.

Example case 2. Each of students has 10 units of time, but only the second one will be able to fit in time.

Kitchen Timetable CodeChef Solution in C++14

#include <iostream>
using namespace std;

int main() {
	// your code goes here
	int t;
	cin >> t;
	while(t--){
	    int n;
	    cin >> n;
	    int a[n], b[n];
	    int count=0;
	    for(int i=0;i<n;i++){
	        cin >> a[i];
	    }
	    for(int i=0;i<n;i++){
	        cin >> b[i];
	    }
	    for(int i=1;i<n;i++){
	       if(a[i]-a[i-1] < b[i]){
	           count++;
	       }
	    }
	    
	    if(a[0]<b[0]){
	        count++;
	    }
	    
	    cout << n-count << endl;
	}
	return 0;
}

Kitchen Timetable CodeChef Solution in Pyth 3

# cook your dish here
for i in range(int(input())):
    n=int(input())
    a=list(map(int,input().split()))
    b=list(map(int,input().split()))
    
    s=0
    for i in range(n):
        if i==0:
            if a[i]<b[i]:
                pass
            else:
                s+=1
        else:
            if (a[i]-a[i-1])<b[i]:
                pass
            else:
                s+=1
    print(s)

Kitchen Timetable CodeChef Solution in Java

import java.util.*;
import java.lang.*;
import java.io.*;
class faisal
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner kk=new Scanner(System.in);
		int testcase=kk.nextInt();
		while(testcase-->0)
		{
		    int count=0;
		    int n=kk.nextInt();
		    int[] a=new int[n];
		    int[] b=new int[n];
		    //int[] c=new int[n];
		    for(int i=0;i<n;i++){
		    a[i]=kk.nextInt();
		    //c[i]=a[i];
		    }
		    for(int i=0;i<n;i++)
		    b[i]=kk.nextInt();
		    ///for(int i=1;i<n;i++)
		    //a[i]=a[i]-c[i-1];
		    if(a[0]>=b[0])
		    count++;
		    for(int i=1;i<n;i++)
		    if((a[i]-a[i-1])>=b[i])
		    count++;
		    System.out.println(count);
		}
	}
}

Kitchen Timetable CodeChef Solution Review:

In our experience, we suggest you solve this Kitchen Timetable CodeChef Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the Kitchen Timetable CodeChef Solution

Find on CodeChef

Conclusion:

I hope this Kitchen Timetable CodeChef Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.

Keep Learning!

More Coding Solutions >>

LeetCode Solutions

Hacker Rank Solutions

CodeChef Solutions