**Apple and Orange**

### Problem Statement :

Sam's house has an apple tree and an orange tree that yield an abundance of fruit. Using the information given below, determine the number of apples and oranges that land on Sam's house. In the diagram below: The red region denotes the house, where s is the start point, and t is the endpoint. The apple tree is to the left of the house, and the orange tree is to its right. Assume the trees are located on a single point, where the apple tree is at point a , and the orange tree is at point b When a fruit falls from its tree, it lands d units of distance from its tree of origin along the x-axis. *A negative value of d . means the fruit fell d units to the tree's left, and a positive value of d means it falls d units to the tree's right. * Function Description Complete the countApplesAndOranges function in the editor below. It should print the number of apples and oranges that land on Sam's house, each on a separate line. countApplesAndOranges has the following parameter(s): s: integer, starting point of Sam's house location. t: integer, ending location of Sam's house location. a: integer, location of the Apple tree. b: integer, location of the Orange tree. apples: integer array, distances at which each apple falls from the tree. oranges: integer array, distances at which each orange falls from the tree. Input Format The first line contains two space-separated integers denoting the respective values of s and t. The second line contains two space-separated integers denoting the respective values of a and b. The third line contains two space-separated integers denoting the respective values of m and n. The fourth line contains m space-separated integers denoting the respective distances that each apple falls from point a . The fifth line contains n space-separated integers denoting the respective distances that each orange falls from point b. Constraints 1 <= s,t,a,b,m,n <= 10^5 -10^5 <= d <= 10^5 a < s < t <b Output Format Print two integers on two different lines: 1. The first integer: the number of apples that fall on Sam's house. 2 . The second integer: the number of oranges that fall on Sam's house.

### Solution :

` ````
Solution in C :
In Python3 :
def countApplesAndOranges(s, t, a, b, apples, oranges):
print(sum([1 for x in apples if (x + a) >= s and (x + a) <= t]))
print(sum([1 for x in oranges if (x + b) >= s and (x + b) <= t]))
In C++ :
#include <iostream>
#include <cmath>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <climits>
#include <ctime>
#include <cstring>
#include <queue>
#include <stack>
#include <list>
#include <algorithm>
#include <map>
#include <set>
#define LL long long
#define Pr pair<int,int>
#define fread(ch) freopen(ch,"r",stdin)
#define fwrite(ch) freopen(ch,"w",stdout)
using namespace std;
const int INF = 0x3f3f3f3f;
const int mod = 1e9+7;
const double eps = 1e-8;
const int maxn = 112345;
int main()
{
//fread("");
//fwrite("");
int s,t,a,b,m,n,x;
int aa,bb;
aa = bb = 0;
scanf("%d%d%d%d%d%d",&s,&t,&a,&b,&m,&n);
while(m--)
{
scanf("%d",&x);
if(s <= a+x && a+x <= t) aa++;
}
while(n--)
{
scanf("%d",&x);
if(s <= b+x && b+x <= t) bb++;
}
printf("%d\n%d\n",aa,bb);
return 0;
}
In java :
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int s = in.nextInt();
int t = in.nextInt();
int a = in.nextInt();
int b = in.nextInt();
int m = in.nextInt();
int n = in.nextInt();
int[] apple = new int[m];
int app = 0;
for(int apple_i=0; apple_i < m; apple_i++){
apple[apple_i] = in.nextInt();
if (a + apple[apple_i] >= s && a + apple[apple_i] <= t) {
app++;
}
}
int[] orange = new int[n];
int or = 0;
for(int orange_i=0; orange_i < n; orange_i++){
orange[orange_i] = in.nextInt();
if (b + orange[orange_i] >= s && b + orange[orange_i] <= t) {
or++;
}
}
System.out.println(app);
System.out.println(or);
}
}
In C :
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
int main(){
int s;
int t;
scanf("%d %d",&s,&t);
int a;
int b;
scanf("%d %d",&a,&b);
int m;
int n;
int ans1=0,ans2=0;
scanf("%d %d",&m,&n);
int *apple = malloc(sizeof(int) * m);
for(int apple_i = 0; apple_i < m; apple_i++){
scanf("%d",&apple[apple_i]);
if((apple[apple_i]+a)<=t && (apple[apple_i]+a)>=s)
ans1++;
}
int *orange = malloc(sizeof(int) * n);
for(int orange_i = 0; orange_i < n; orange_i++){
scanf("%d",&orange[orange_i]);
if((orange[orange_i]+b)<=t && (orange[orange_i]+b)>=s)
ans2++;
}
printf("%d\n%d",ans1,ans2);
return 0;
}
```

## View More Similar Problems

## Super Maximum Cost Queries

Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and

View Solution →## Contacts

We're going to make our own Contacts application! The application must perform two types of operations: 1 . add name, where name is a string denoting a contact name. This must store name as a new contact in the application. find partial, where partial is a string denoting a partial name to search the application for. It must count the number of contacts starting partial with and print the co

View Solution →## No Prefix Set

There is a given list of strings where each string contains only lowercase letters from a - j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked. Note If two strings are identical, they are prefixes of each other. Function Descriptio

View Solution →## Cube Summation

You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor

View Solution →## Direct Connections

Enter-View ( EV ) is a linear, street-like country. By linear, we mean all the cities of the country are placed on a single straight line - the x -axis. Thus every city's position can be defined by a single coordinate, xi, the distance from the left borderline of the country. You can treat all cities as single points. Unfortunately, the dictator of telecommunication of EV (Mr. S. Treat Jr.) do

View Solution →## Subsequence Weighting

A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =

View Solution →