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 main()
{int n,i,j,val=0,c=0;
 cin>>n;
 int a[n],b[n];
 for(i=0;i<n;i++)
   {cin>>a[i];
      b[i]=0;       }
 for (i=0;i<n;i++)
{ for(j=0;j<n;j++)
   {if(a[i]==a[j]) b[i]++;}
}
for(i=0;i<n;i++) 
{if(val<b[i]){ val=b[i];
c=i;}
}
cout<<a[c]<<" "<<val;
}

Grading criterion: N^2 Algorithm
Rating A: Fully Correct
Rating B: If used higher time complexity or partially correct
Rating C: 0
Rating D: Code Not There or Totally Wrong
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, i=0, j=0;
cin>>N;
int arr[N];
for (i=0; i<N; i++) cin>>arr[i];
int arr1[N];
for (i=0; i<N; i++) arr1[i]=0;
for (i=0; i<N; i++)
 {
 for (j=0; j<N; j++)
  {
  if (arr[i]==arr[j]) arr1[i]++;
  }
 }
int x=arr1[0], y=0;
for (i=0; i<N; i++)
 {
 if (arr1[i]>x)
  {
  x=arr1[i];
  y=i;
  }
 }
cout<<arr[y]<<' '<<x<<endl;
}

Grading criterion: N^2 Algorithm
Rating A: Fully Correct
Rating B: If used higher time complexity or partially correct
Rating C: 0
Rating D: Code Not There or Totally Wrong
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>
#include<math.h>
using namespace std;
void myswap(int*a,int*b){
int temp=*a;*a=*b;*b=temp;}
int max(int*k,int n){
int maxindex=0;
for(int i=1;i<n;i++){if(k[maxindex]<k[i])maxindex=i;}return maxindex;}
void argmax(int*k,int n){
for(int i=1;i<n;i++){
int maxindex=max(k,i);
myswap(&k[maxindex],&k[i-1]);}}
int main(){
	int n;int c=0;
	cin>>n;
	int a[n],k[20];
	for(int x=0;x<20;x++){k[x]=0;}
	for(int i=0;i<n;i++){
		cin>>a[i];}
	for(int x=0;x<n;x++){
	for(int j=0;j<n;j++){
	
	if(a[x]==a[j]){
	k[x]++;}}}
	int*d=k;
	argmax(k,20);
	for(int t=0;t<20;t++){
	if(d[t]==k[19])cout<<a[t]<<" ";break;;
	
	}cout<<k[19]+1;
	
	
	
}

Grading criterion: N^2 Algorithm
Rating A: Fully Correct
Rating B: If used higher time complexity or partially correct
Rating C: 0
Rating D: Code Not There or Totally Wrong
Assigned grade: D
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<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int b[n];
for(int i=0;i<n;i++)
{
	int count=0;
	for(int j=0;j<n;j++)
	{	if(a[i]==a[j]){count++;}}
	b[i]=(count);
}
int high=b[0];
for(int i=0;i<n;i++)
{
high=max(high,b[i]);
}
for(int i=0;i<n;i++)
{
if(b[i]==high)
{
cout<<a[i]<<" "<<high;
break;
}
}
}

Grading criterion: N^2 Algorithm
Rating A: Fully Correct
Rating B: If used higher time complexity or partially correct
Rating C: 0
Rating D: Code Not There or Totally Wrong
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>
#include <string.h>
using namespace std;

int main() {
int n=0;
cin>>n;
int list[n];
int freq[n];
//int sort[n];
	int i=0;
	for(i=0;i<=n-1;i++) {
	 cin>>list[i];
	}
	
	i=0;
	int j=0;

	for(i=0;i<=n-1;i++) {	
	freq[i]=0;	
		for(j=0;j<=n-1;j++) {
		if(list[j]==list[i]) freq[i]++;
		}
	}
	
//	cout<<endl; i=0;
//	for(i=0;i<=n-1;i++) {
//	cout<<list[i]<<" ";
//	}
//	cout<<endl; i=0;
//	for(i=0;i<=n-1;i++) {
//	cout<<freq[i]<<" ";
//	}
	
	int k=0;
	i=0; j=0;
	for(i=0;i<=n-1;i++) {
		if(freq[i]>j) {j=freq[i]; k=i;}
	}
	cout<<list[k]<<" "<<j;
}

Grading criterion: N^2 Algorithm
Rating A: Fully Correct
Rating B: If used higher time complexity or partially correct
Rating C: 0
Rating D: Code Not There or Totally Wrong
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 max(int *c,int n){
int maxindex=0;
for(int r=0;r<n;r++){
if(c[maxindex]<c[r]) maxindex=r;
}
return maxindex;
}
int main(){
int n;
cin>>n;
int a[n];
int b[n];
for(int q=0;q<n;q++) b[q]=0;
for(int i=0;i<n;i++) cin>>a[i];
for(int j=0;j<n;j++){
for(int k=0;k<n;k++){
if(a[k]==a[j]) b[j]++;
}
}
int w=max(b,n);
cout<<a[w]<<" "<<b[w];
}

Grading criterion: N^2 Algorithm
Rating A: Fully Correct
Rating B: If used higher time complexity or partially correct
Rating C: 0
Rating D: Code Not There or Totally Wrong
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;
	cin>>n;
	if(1<=n<20)             // find a better way to satisfy conditions/limits/bounds
	{ 
	    int a[n],b[n][2];
		for(int i=0;i<n;i++)
		{
			cin>>a[i];
		}
		for(int i=0;i<n;i++)
		{
			int k=0;
			for(int j=0;j<n;j++)
			{
				if(a[i]==a[j])k++;      //counting the number of times each element occurs
			}
			b[i][0]=a[i];
			b[i][1]=k;               //storing the number and count in a 2D array
		}
		int c=b[0][1],d;       // very important to initialize c here for n=2 for loop doesn't run and if values are '=' then then if are unsatisfied
		if(b[0][1]>b[1][1]) c=b[0][1];
		if(b[0][1]<b[1][1]) c=b[1][1];
		for(int i=0;i<n-2;i++)         // i going from 0 to n-3 and is defined for function only
		{
			d=b[i+2][1];
			if(d>c)c=d;  // comparing two elements storing the bigger one and comparing bigger with next
		}
		int i;
		for(i=0;i<n;i++)
		{
			if(b[i][1]==c) break; 
		}
		cout<<b[i][0]<<" "<<c;
	}
	return 0;
}

Grading criterion: N^2 Algorithm
Rating A: Fully Correct
Rating B: If used higher time complexity or partially correct
Rating C: 0
Rating D: Code Not There or Totally Wrong
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 occ(int x, int arr[], int n){  //number of x in arr[] of size n
	int ans=0;

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

		if(arr[i]==x) ans++;
	}

	return ans;
}

int main(){

	int n;
	cin>>n;
	int arr[n], freq[n];

	for(int i=0; i<n; i++){  //input

		cin>>arr[i];
	}

	for(int i=0; i<n; i++){  //makes freq array

		freq[i] = occ(arr[i], arr, n);
	}

	int maj, max=0;

	for(int i=0; i<n; i++){  //finds max element of freq[]

		if(freq[i]>max){

			maj = i;
			max = freq[i];
		}
	}

	cout<<arr[maj]<<" "<<freq[maj];
}

Grading criterion: N^2 Algorithm
Rating A: Fully Correct
Rating B: If used higher time complexity or partially correct
Rating C: 0
Rating D: Code Not There or Totally Wrong
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 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: N^2 Algorithm
Rating A: Fully Correct
Rating B: If used higher time complexity or partially correct
Rating C: 0
Rating D: Code Not There or Totally Wrong
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 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: N^2 Algorithm
Rating A: Fully Correct
Rating B: If used higher time complexity or partially correct
Rating C: 0
Rating D: Code Not There or Totally Wrong
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;
	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: N^2 Algorithm
Rating A: Fully Correct
Rating B: If used higher time complexity or partially correct
Rating C: 0
Rating D: Code Not There or Totally Wrong
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: N^2 Algorithm
Rating A: Fully Correct
Rating B: If used higher time complexity or partially correct
Rating C: 0
Rating D: Code Not There or Totally Wrong
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>
#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: N^2 Algorithm
Rating A: Fully Correct
Rating B: If used higher time complexity or partially correct
Rating C: 0
Rating D: Code Not There or Totally Wrong
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;
/*
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: N^2 Algorithm
Rating A: Fully Correct
Rating B: If used higher time complexity or partially correct
Rating C: 0
Rating D: Code Not There or Totally Wrong
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<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: N^2 Algorithm
Rating A: Fully Correct
Rating B: If used higher time complexity or partially correct
Rating C: 0
Rating D: Code Not There or Totally Wrong
Assigned grade: D