Mr. Arulmozhivalman loves programming and he likes to face new programming challenges. After completing many challenges he has now given you one challenge which is one of his favourites. He has given you a list of N random integers and he wants you to find the integer which has the maximum frequency in the given list.Being a programmer himself, he had made this task a challenge for you and he will calculate your score for this task using a formula.Formula for calculating the score : (max_score) - (number of characters in your code/15.0)Mr. Arulmozhivalman already has a solution for this but he is not satisfied with his solution. He wants you to write a shortest possible code for this task.

 #include <stdio.h>
int main()
{
    int FreqArr[100000];
    int Size,m=0,c=0,e=0;
    int i,j;
    scanf("%d",&Size);
    for(i=0;i<Size;i++)
    {scanf("%d",&FreqArr[i]);}
    for(i=0;i<Size;i++){c=1;
    for(j=1+i;j<Size;j++){
        if (FreqArr[i]==FreqArr[j])
        c++;}
        if(m<c)
        {m=c;
        e=FreqArr[i];}}
    printf("%d",e);
return 0;
}

Comments

Post a Comment

Popular posts from this blog

Elavenil has a chessboard with N rows and M columns. In one step, he can choose two cells of the chessboard which share a common edge (that has not been cut yet) and cut this edge. Formally, the chessboard is split into two or more pieces if it is possible to partition its cells into two non-empty subsets S1 and S2 (S1∩S2=∅, |S1|+|S2|=NM) such that there is no pair of cells c1,c2 (c1∈S1,c2∈S2) which share a common edge that has not been cut.Elavenil does not want the board to split into two or more pieces. Compute the maximum number of steps he can perform while satisfying this condition.

 #include <stdio.h> int main() { int n,m; scanf("%d %d",&n,&m); printf("%d",(m-1)*(n-1)); return 0; }
Read more

Akash the die heart fan of AR Rahman went to the live concert happened in Bangalore with his family members.The event management firm responsible for the event arranged the seats for the audience in descending order of maximum number of tickets booked for single family.

 #include <stdio.h> int main() {int nooffamilymembers; scanf("%d",&nooffamilymembers); int r=nooffamilymembers; for(int i=1;i<=nooffamilymembers;i++){     for(int j=1;j<=r;j++){         printf("%d ",r);     }r--;     printf("\n");} return 0; }
Read more

Mahesh has given a two-dimensional 3*3 array starting from A [0][0]. You should add the alternate elements of the array and print its sum. It should print two different numbers the first being sum of A 0 0, A 0 2, A 1 1, A 2 0, A 2 2 and A 0 1, A 1 0, A 1 2, A 2 1.

 #include <stdio.h> int main() {   int A[3][3],i,j;     for(i=0;i<3;i++)     {for(j=0;j<3;j++)     {scanf("%d ",&A[i][j]);}}     int m=0,n=0;     for(i=0;i<3;i++){     for(j=0;j<3;j++){     if((i+j)%2==0)     m=m+A[i][j];     else     n=n+A[i][j];}}     printf("%d\n%d",m,n); return 0; }
Read more