C++ Program for Counting Rock Samples (TCS CodeVita) | PrepInsta

CPP Code for Counting Rock Sample Problem

Counting Rock Samples

TCS CodeVita is one of the most prestigious global level coding competition in India, which is organized every year by Tata Consultancy Services. Counting Rock Samples Problem is one of the sample problem of TCS CodeVita 2020 Season 9 edition which is going to be held this year. This is a simple array manipulation problem, which will test your data structure knowledge and logical thinking capability.

Problem Description

Question – : Juan Marquinho is a geologist and he needs to count rock samples in order to send it to a chemical laboratory. He has a problem: The laboratory only accepts rock samples by a range of its size in ppm (parts per million).

Juan Marquinho receives the rock samples one by one and he classifies the rock samples according to the range of the laboratory. This process is very hard because the number of rock samples may be in millions.

Juan Marquinho needs your help, your task is to develop a program to get the number of rocks in each of the ranges accepted by the laboratory.

Input Format: An positive integer S (the number of rock samples) separated by a blank space, and a positive integer R (the number of ranges of the laboratory); A list of the sizes of S samples (in ppm), as positive integers separated by space R lines where the ith line containing two positive integers, space separated, indicating the minimum size and maximum size respectively of the ith range.

Output Format: R lines where the ith line contains a single non-negative integer indicating the number of the samples which lie in the ith range.

Constraints:

  • 10 <= S <= 10000
  • 1 <= R <= 1000000
  • 1<=size of Sample <= 1000

Example 1

  • Input: 10 2
  • 345 604 321 433 704 470 808 718 517 811
  • 300 350
  • 400 700

Output: 2 4

Explanation:

There are 10 samples (S) and 2 ranges ( R ). The samples are 345, 604,811. The ranges are 300-350 and 400-700. There are 2 samples in the first range (345 and 321) and 4 samples in the second range (604, 433, 470, 517). Hence the two lines of the output are 2 and 4

Example 2

  • Input: 20 3
  • 921 107 270 631 926 543 589 520 595 93 873 424 759 537 458 614 725 842 575 195
  • 1 100
  • 50 600
  • 1 1000

Output: 1 12 20

Explanation:

There are 20 samples and 3 ranges. The samples are 921, 107 195. The ranges are 1-100, 50-600 and 1-1000. Note that the ranges are overlapping. The number of samples in each of the three ranges are 1, 12 and 20 respectively. Hence the three lines of the output are 1, 12 and 20.

C++ Code

#include  <iostream> 
using namespace std;

int main() 
    {
        int a[1000],s,i,j,t,l1,l2,c=0;
        cout<<("Enter the number of elements : "); cin>>s;
        cout<<("Enter the number of ranges : "); cin>>t;
        cout<<("Enter the elements : ");
        for(i=0;i<s;i++) cin>>a[i];
            cout<<("Enter the range : ");
        for(i=0;i<t;i++) { cin>>l1>>l2;
                for(j=0;j<s;j++) { if((a[j]>=l1)&&(a[j]<=l2))
                        c++;
                    }   
                cout<<("The desired output %d ",c);
                c=0;
            }
        return 0;
    }
Output
Enter the number of elements : 10
Enter the number of ranges : 2
Enter the elements : 345 604 321 433 704 470 808 718 517 811
Enter the ranges : 300 350  400 700
The desired Output : 2 4

Counting Rock Samples in Other Coding Languages

C

To find the solution of Counting Rock Sample Problem in C Programming language click on the button below:

C

Python

To find the solution of Counting Rock Sample Problem in Python Programming language click on the button below:

Python

Java

To find the solution of Counting Rock Sample Problem in Java Programming language click on the button below:

Java

2 comments on “C++ Program for Counting Rock Samples (TCS CodeVita) | PrepInsta”


  • MD

    more efficient :

    int main()
    {
    fastio;
    int t=1; //cin>>t;
    while(t–)
    {

    int n,q; cin>>n>>q;
    vectorar(n,0);
    FOR(i,0,n) cin>>ar[i];
    sort(ar.begin(),ar.end());
    while (q–)
    {
    int low,hi; cin>>low>>hi;
    vector::iterator t1,t2;
    t1 = lower_bound(ar.begin(), ar.end(), low);
    t2 = upper_bound(ar.begin(), ar.end(), hi);
    cout<<abs(( t1-ar.begin() )- ( t2-ar.begin()) )<<endl;
    }

    }
    return 1;
    }