Distinct Count

 Problem:-

Given an array A of N integers, classify it as being Good Bad or Average. It is called Good, if it contains exactly X distinct integers, Bad if it contains less than X distinct integers and Average if it contains more than X distinct integers.

Input format:
First line consists of a single integer T denoting the number of test cases.
First line of each test case consists of two space separated integers denoting N and X.
Second line of each test case consists of N space separated integers denoting the array elements.

Output format:
Print the required answer for each test case on a new line.

Constraints:

1T50


1X,N13000


1A[i]109

Sample Input
4
4 1
1 4 2 5
4 2
4 2 1 5
4 3
5 2 4 1
4 4
1 2 4 5
Sample Output
Average
Average
Average
Good
Time Limit: 1
Memory Limit: 256
Source Limit:

Solution:-

#include<stdio.h>
int main()
{
  int t,x,n;
  scanf(“%d”,&t);
  while(t–)
  {
    scanf(“%d%d”,&n,&x);
   long long int a[n],k=0,j,element;
   for(int i=0;i<n;i++)
   {
     scanf(“%lld”,&element);
     for( j=0;j<k;j++)
     {
       if(element==a[j])
       break;
     }
     if(j==k)
     {
       a[k]=element;
       k++;
     }
   }
   if(k==x)
   printf(“Goodn”);
   if(k>x)
   printf(“Averagen”);
   if(k<x)
   printf(“Badn”);
  }
  return 0;
}





Leave a Reply

Your email address will not be published.