# HackerRank Apple and Orange problem solution

In this Apple and Orange problem you have Given Given the value of d for m apples and n oranges, determine how many apples and oranges will fall on Sam's house.

## Problem solution in Python programming.

```#!/bin/python3

import sys

s,t = input().strip().split(' ')
s,t = [int(s),int(t)]
a,b = input().strip().split(' ')
a,b = [int(a),int(b)]
#print(a)
#print(b)
m,n = input().strip().split(' ')
m,n = [int(m),int(n)]
apple = [int(apple_temp) for apple_temp in input().strip().split(' ')]
orange = [int(orange_temp) for orange_temp in input().strip().split(' ')]
countA = 0;
countO = 0;
for i in apple:
if(i + a >= s and i + a <= t):
countA += 1

for j in orange:
if(j + b >= s and j + b <= t):
countO += 1

print(countA)

print(countO)```

## Problem solution in Java Programming.

```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];
for(int apple_i=0; apple_i < m; apple_i++){
apple[apple_i] = in.nextInt() + a;
}
int[] orange = new int[n];
for(int orange_i=0; orange_i < n; orange_i++){
orange[orange_i] = in.nextInt() + b;
}
int numApples = 0;
int numOranges = 0;
for (int app : apple) {
if (app >= s && app <= t) {
numApples += 1;
}
}
for (int ora : orange) {
if (ora >= s && ora <= t) {
numOranges += 1;
}
}
System.out.println(numApples);
System.out.println(numOranges);
}
}```

### Problem solution in C++ programming.

```#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 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()
{
//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;
}```

### Problem solution in C programming.

```#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

int main(void)
{
int s, t, a, b, m, n, i, c1 = 0, c2 = 0;
scanf("%d %d\n", &s, &t);
scanf("%d %d\n", &a, &b);
scanf("%d %d\n", &m, &n);

for(i = 0; i < m; i++)
{
int tmp;
scanf("%d", &tmp);
tmp = a + tmp;

if(tmp >= s && tmp <= t)
{
c1++;
}
}

for(i = 0; i < n; i++)
{
int tmp;
scanf("%d", &tmp);
tmp = b + tmp;

if(tmp >= s && tmp <= t)
{
c2++;
}
}

printf("%d\n%d", c1, c2);
}```

### Problem solution in JavaScript programming.

```process.stdin.resume();
process.stdin.setEncoding('ascii');

var input_stdin = "";
var input_stdin_array = "";
var input_currentline = 0;

process.stdin.on('data', function (data) {
input_stdin += data;
});

process.stdin.on('end', function () {
input_stdin_array = input_stdin.split("\n");
main();
});

return input_stdin_array[input_currentline++];
}

/////////////// ignore above this line ////////////////////

function main() {
var s = parseInt(s_temp[0]);
var t = parseInt(s_temp[1]);
var a = parseInt(a_temp[0]);
var b = parseInt(a_temp[1]);
var m = parseInt(m_temp[0]);
var n = parseInt(m_temp[1]);
apple = apple.map(Number).filter(function (n) {
return n > 0;
});
orange = orange.map(Number).filter(function(n) {
return n < 0;
});

var countApple = 0
var countOrange = 0;
for (var i = 0; i < apple.length; i++) {
var distance = apple[i] + a;
if (distance >= s && distance <= t) {
countApple++;
}
}
for (var i = 0; i < orange.length; i++) {
var distance = orange[i] + b;
if (distance >= s && distance <= t) {
countOrange++;
}
}
console.log(countApple);
console.log(countOrange);
}```