CodeGraderBench/CodeGraderBench huggingface dataset:
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<iostream>
using namespace std;
int arg(int count[],int n)
{int maxindex=0;for(int i=0;i<n;i++)
if(count[i]>count[0])maxindex=i;
return maxindex;}
void arr(int n,int a[])
{int count[n];
for(int i=0;i<n;i++)
count[i]=0;
for(int i=0;i<n;i++)
{for(int j=0;j<n;j++)
if(a[i]==a[j]||a[j]==a[i])
count[i]++;}
cout<<a[arg(count,n)]<<" "<<count[arg(count,n)];}
int main()
{int n;cin>>n;int a[n];
if(n<20&&n>=1)
for(int i=0;i<n;i++)
cin>>a[i];
arr(n,a);
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: Nothing Extra
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include <iostream>
#include <cmath>
using namespace std;

int main() {
    int n; cin >> n;
    int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i];

    int tally[n];

    for (int i = 0; i < n; i++) {
        int count = 1;

        for (int j = 0; j < n; j++) {
            if (i != j && arr[i] == arr[j]) count++;
        }

        tally[i] = count;
    }

    int max_index = 0, max_count = 1;
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (tally[j] >= tally[i]) {
                max_index = j;
                max_count = tally[j];
            }
        }
    }

    cout << arr[max_index] << " " << max_count << endl;
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: Nothing Extra
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include <iostream>
using namespace std;
int main(){
	int n;
	cin>>n;
	int arr[n];
	for(int i=0;i<n;i++){
		cin>>arr[i];
	}
	int max=0;
	for(int i=0;i<n;i++){
		if(max<arr[i]){max=arr[i];}
	}
	int a[max+1];
	for(int i=0;i<=max;i++){
		a[i]=0;
	}
	for(int i=0;i<n;i++){
		a[arr[i]]++;
	}
	int max1=0;
	for(int i=0;i<=max;i++){
		if(max1<a[i]){max1=a[i];}
	}
	for(int i=0;i<=max;i++){
		if(a[i]==max1){cout<<i<<" "<<max1<<endl;}
	}
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: Nothing Extra
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<iostream>
using namespace std;
int main()
{
int n; cin>>n;
int arr[n], frequency[n];
for(int i=0; i<n; i++)
cin>>arr[i];
for(int i=0; i<n; i++)
{
frequency[i]=0;
for(int j=0; j<n; j++)
{
if(arr[i]==arr[j])
frequency[i]++;
}
}
int maxfreqin=0;
for(int i=0; i<n; i++)
{
if(frequency[i]>frequency[maxfreqin])
maxfreqin=i;
}
cout<<arr[maxfreqin]<<" "<<frequency[maxfreqin];
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: Nothing Extra
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;

int main(){


	int n; cin>>n;
	unsigned long long arr[n];
	for(int i=0; i<n; i++)cin>>arr[i];

	int maxn = -1, ans, curr;

	for(int i=0; i<n; i++){
		curr = 0;
		for(int j=0; j<n; j++){
			if(arr[i] == arr[j])curr++;
		}

		if(curr >= maxn){
			maxn = curr;
			ans = arr[i];
		}
	}

	cout<<ans<<" "<<maxn;


	return 0;
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: Nothing Extra
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<iostream>
using namespace std;
/*
void sort(int* p,int k)//Remember that k is the length of the array here, so it would make sense to go only up till k-1
         {
          for(int i = 0; i<k;i++)
             {
             int count = p[i];
             int j = i;
              while(j<k)
                  {
                   if(count<p[j])
                     {
                     count = p[j];
                     j++;
                     }
                  else j++;
                  }
             //Now. we swap p[i] and p[j-1]
             int temp = p[i];
             p[i] = p[j-1];
             p[j-1] = temp;
            }
         }
*/

int main()
{
// Testing the sorting algorithm first

/*
int a, arr[a];
cin>>a;
for(int i=0; i<a; i++)
   {
    int t;
    cin>>t;
    arr[i] = t;
   }
//sort(arr,a);
*/


 int n;
 cin>>n;
//To prevent a segmentation fault declare arr[n] after taking n from the user
int arr[n],count[n],duplicate_count[n];
 for(int i =0; i<n;i++)
    {
     int t;
     cin>>t;
     arr[i] =t;
     count[i] =0;
     duplicate_count[i] = 0;
    }
 for(int i = 0; i<n;i++)
    {
     for(int j = i;j<n;j++)
        {
         if(arr[i] ==arr[j])
           {
           count[i]++;
           duplicate_count[i]++;
           }
         }
     }

// IGNORE THIS  //Now to sort the 'count' array to see what is the maximum
 int maximum = count[0];
 for(int i = 0; i<n;i++)
    {
    maximum = max(maximum,count[i]);
    }
 int j;
 for( j = 0; j<n; j++)
    {
     if(count[j]==maximum)
       {
        break;
       }
     }
 cout<<arr[j]<<" "<<maximum;

}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: Nothing Extra
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<simplecpp>


main_program{
 int n;
 cin >> n;
 int a[n];
cin >> a[n];
 
for(int i=0;i<n;i++)
{int high=0;
high=max(0,a[i]);
cout << high;
}

}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: Nothing Extra
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include <iostream>
using namespace std;

int max (int *a, int b)
{
int maxi=a[0];
for (int i=0 ; i < b ; i++)
{	if(a[i] > maxi) maxi=a[i];
}	
return maxi;
}

int main () 
{
int N = 1e6+2;
int n; cin >> n;
	int arr[n]; 
	for (int i=0; i<n; i++) {cin >> arr[i];}
	
	int s[N]; 
	for (int j=0 ; j<N ; j++) {s[j]=0;}
	
for (int i=0 ; i<n ; i++) 
	{
	s[arr[i]] ++ ;   
	}
	
int e = max(s,N);

for (int j=0 ; j<N ; j++) {
if (s[j]==e) cout <<j; 
}	
cout << " " << e;
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: Nothing Extra
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<iostream>
using namespace std;
int argmax(int *frequency,int L){
int maxindex=0;
for (int b=0;b<L;b++){if (frequency[maxindex]<frequency[b]) maxindex=b;}								 
return maxindex;
}
int main(){int n;cin>>n;
int a[n];int diff;int frequency[n];
for (int j=0;j<n;j++){frequency[j]=0;}	
for (int i=0;i<n;i++){cin>>a[i];		
}
for (int l=0;l<n;l++){
for (int k=0;k<n;k++){
diff =a[k]-a[l];	
if (diff==0) {frequency[l]=frequency[l]+1;}	
	
}
}		  
int maxindex=argmax(frequency,n);
cout<<a[maxindex]<<" "<<frequency[maxindex];
		  }

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: Nothing Extra
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<iostream>
using namespace std;

void mostrec(int* addans, int n){
int val=0;
  for(int k=0;k<n;k++){
  int j=0;
    for(int i=0;i<n;i++){
    if (addans[k]==addans[i]){j++;}
    }
  if(j>val){val=k;addans[n+1]=j;}
  }
addans[n]=addans[val];
}

int main(){
int n;
cin>>n;
int addans[n+2];
addans[n]=addans[n+1]=0;
for(int i=0;i<n;i++){
cin>>addans[i];
}
mostrec(addans,n);
cout<<addans[n]<<" "<<addans[n+1];
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: Nothing Extra
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++){cin>>a[i];}
int l[n];
for(int h=0;h<n;h++){l[h]=0;}
for(int k=0;k<n;k++){
for(int m=0;m<n;m++){if(a[k]==a[m]) l[k]++;}
}
int mxm=0;
for(int t=0;t<n;t++){
mxm=max(l[t],mxm);
}
for(int p=0;p<n;p++){
if(l[p]==mxm) {cout<<a[p]<<" "<<l[p];break;}
}
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: Nothing Extra
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include <iostream>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i=i+1){
cin>>a[i];}
int b[n];
for(int l=0;l<n;l=l+1){
b[l]=0;}
for(int x=0;x<n;x=x+1){
for(int y=0;y<n;y=y+1){
if(a[x]==a[y]){b[x]=b[x]+1;}}}
int max=0;
for(int z=0;z<n;z=z+1){
if(b[max]<b[z])max=z;}
cout<<a[max]<<" "<<b[max];}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: Nothing Extra
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<iostream>
using namespace std;
int main(){
int n;
	cin>>n;
int s[n];
	for(int i=0;i<n;i++){cin>>s[i];}
int r[n];
	for(int i=0;i<n;i++){int k=0;
	for(int j=i;j<n;j++){
		if(s[j]==s[i]){k=k+1;}
	}
r[i]=k;}
int max=0;
	for(int l=0;l<n;l++){
		if(r[l]>r[max]){max=l;}
	}
for(int l=0;l<n;l++){
		if(r[l]==r[max]){cout<<s[l]<<" "<<r[max]<<endl;}
	}
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: Nothing Extra
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include <iostream>
using namespace std;

void major (int *a, int *b, int n){
	for (int i = 0; i < n; i++){
		if (a[i] != -1){
			b[i] = 1;
			for (int j = i+1; j < n; j++){
				if (a[i] == a[j]){
					b[i]++;
					a[j] = -1;
				}
			}
		}
	}
	for (int i = 0, m = 0; i < n; i++){
		if (a[i] != -1){
			if (b[m] < b[i]){
				b[m] = 0;
				m = i;
			}
			else if (b[i] < b[m]){
				b[i] = 0;
			}
		}
	}
}

int main(){
	int n = 0;
	cin >> n;
	int a[n], b[n];

	for (int i = 0; i < n; i++){
		cin >> a[i];
		b[i] = 0;
	}

	major (a, b, n);

	for (int i = 0; i < n; i++){
		if (b[i] != 0){
			cout << a[i] << " " << b[i] << "\n";
		}
	}

	return 0;
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: Nothing Extra
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include<iostream>
using namespace std;
int main (){
int n,p,i,j;
int a[n];
p=0;
cin>>n;
if (n==1){cin>>a[0];
cout<<a[0]<<" "<<"1";
}
if (n==2) { 
cin>>a[0]>>a[1];
if (a[0]==a[1]){
cout<<a[0]<<" "<<"2";
}
else {
for (i=0;i<n;i++){
for (j=0;j<i;j++){
if (a[i]==a[j]){
cout<<a[i]<<p;
}
}
}
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: Nothing Extra
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take user input n, the size of a 1D integer array, followed by the array entries as inputs. The program should then determine the majority element of the array, i.e., the element which occurs the most often. It should then display the majority element and how many times it occurs in the array. You may assume that the array contains only non-negative numbers. You may also assume that the array contains only one majority element. 

Input Format - Integers n, followed by elements of the integer-valued array.
Output Format - Print the values of the majority elements followed by frequency (a separate line for each element). 

Constraints
n is a positive integer, n >= 1 and n < 20

Sample input	12	3 1 2 1 2 3 2 1 3 3 2 1
Sample output 	3 4	1 4	2 4

Student submission:
#include <iostream>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n], freqarr[n];
int maxindex=0, maxfreq=0;
int i, j;

for(int a=0;a<n;a++){
	cin>>arr[a];
	freqarr[a]=0;
	}
for(int z=0;z<n; z++){
	if(arr[z]==arr[0]){
		maxfreq++;
}
}
for(i=0; i<n; i++){
	for(j=0; j<n; j++){
		if(arr[i]==arr[j]){
			freqarr[i]++;
		}
	}
	
		if(freqarr[i]>maxfreq){
			maxindex=i;
			maxfreq=freqarr[i];
		}
		
	}

cout<<arr[maxindex]<<" "<<freqarr[maxindex];
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: Nothing Extra
Rating C: 0
Rating D: 0
Assigned grade: B