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<simplecpp>



main_program{
int no;
cin>>no;
int arr[no], countarr[no];
int count;

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

int size=sizeof(arr)/4;
//cout<<size;

/* for (int i =0; i<no;i++){
	cout<<arr[i]<<", ";
} */

for (int i =0; i<size;i++){
	count=0;
	for (int j=0; j<size; j++){
		if (arr[i]==arr[j]){
			count+=1;
		}
	}
	countarr[i]=count;
}

/* for (int i =0; i<no;i++){
	cout<<countarr[i]<<" ";
}
cout<<endl;*/

int max=countarr[0];int find=arr[0];

for (int i =1; i<size;i++){
	if (max< countarr[i]){
		max=countarr[i];
		find=arr[i];
	}
}

cout<<find<<" "<<max;








}

Grading criterion: Quality of variable names
Rating A: Good Variables Names
Rating B: Ok Variable Names
Rating C: Poor Naming of Variables
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 a[20],n;
	cin>>n;
	
	for(int i=0;i<n;i++){a[i]=0;
	
	for(int j=0;j<n;j++){
		
		cin>>a[j];
		
	}
	a[i]++;
						 cout<<a[i];
}
			
	
			
		}

Grading criterion: Quality of variable names
Rating A: Good Variables Names
Rating B: Ok Variable Names
Rating C: Poor Naming of Variables
Rating D: 0
Assigned grade: C
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 z[], int x[], int y) {
int maxindex = 0;
for(int m =1; m<y;m++) {
   if(x[maxindex] < x[m]) { maxindex = m;}
}
cout << z[maxindex] << x[maxindex];
return 0; 
}
int main() {
int n; cin >> n;
int a[n];
for(int i=0; i<n;i++) {
cin >> a[i]; }
int hist[n];
for(int i = 0; i<n; i++) {  hist[i] = 0;}

for(int i=0;i<n;i++) {
  for(int j=0;j<n;j++) {
  if(a[i] ==a[j]) { hist[i]++;}
  }
  }
 argmax(a,hist,20);
}

Grading criterion: Quality of variable names
Rating A: Good Variables Names
Rating B: Ok Variable Names
Rating C: Poor Naming of Variables
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,i,j,ptr;
cin>>n;
int a[n];
int b[n];

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

for(i=0;i<n;i++)
{
b[i]=0;
for(j=0;j<n;j++)
{if(a[i]==a[j])
{
b[i]=b[i]+1;
}}}

int max=0;

for(i=0;i<n;i++)
{
if(b[i]>=max)
{max=b[i];
}}

for(i=0;i<n;i++)
{
ptr=0;
if(i!=0){
if(b[i]==max)
{

for(j=0;j<i;j++){
if (a[i]==a[j]){ptr=1;}
}
if(ptr==0){cout<<a[i]<<" "<<b[i]<<endl;}
}}
else{if(b[i]==max){cout<<a[i]<<" "<<b[i]<<endl;}}
}

}

Grading criterion: Quality of variable names
Rating A: Good Variables Names
Rating B: Ok Variable Names
Rating C: Poor Naming of Variables
Rating D: 0
Assigned grade: C
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=i+1) cin>>arr[i];

int count[n];      for(int a=0;a<n;a=a+1) count[a]=0;

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

int maxi=0;

for(int i=0;i<n;i=i+1)
      {if(count[i]>count[maxi]) maxi=i;}

cout<<arr[maxi]<<" "<<count[maxi];

return 0;
}

Grading criterion: Quality of variable names
Rating A: Good Variables Names
Rating B: Ok Variable Names
Rating C: Poor Naming of Variables
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>
int mymax(int* b,int n){int max=0;
for(int i=0;i<n;i++){
	if(b[i]>b[max]) max=i;
  }return max;
}
main_program{
int n;cin>>n;int a[n];int b[n];
	for(int i=0;i<n;i++){ cin>>a[i];b[i]=0;}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(a[i]==a[j])b[i]=b[i]+1;
  }
  } int k=mymax(b,n);cout<<a[k]<<" "<<b[k];
}

Grading criterion: Quality of variable names
Rating A: Good Variables Names
Rating B: Ok Variable Names
Rating C: Poor Naming of Variables
Rating D: 0
Assigned grade: C
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];
 int B[n];
for(int i=0;i<n;i++){
   B[i]=0; 
   }
for(int i=0;i<n;i++){
    cin>>A[i];
    }
for(int i=0;i<n;i++){
   for(int j=i;j<n;j++){
        if(A[i]==A[j])
	{B[i]++;}
       }
      }
  int max=0;
  for(int i=0;i<n;i++){
      if(B[max]<=B[i])
      {max=i;}
}
    cout<<A[max]<<" "<<B[max];
}

Grading criterion: Quality of variable names
Rating A: Good Variables Names
Rating B: Ok Variable Names
Rating C: Poor Naming of Variables
Rating D: 0
Assigned grade: C
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++){
cin>>a[i];}
int s=0;
for(int j=0;j<n;j++){
s=max(s,a[j]);
}

int b[s+1];
for(int i=0;i<=s;i++){
b[i]=0;}
for(int k=0;k<=s;k++){
for(int i=0;i<n;i++){
if(a[i]==k){b[k]=b[k]+1;}}}
int x=0;
for(int i=0;i<=s;i++){
x=max(x,b[i]);}
for(int y=0;y<=s;y++){
if(x==b[y]) cout<< y<<" "<< x;}

}

Grading criterion: Quality of variable names
Rating A: Good Variables Names
Rating B: Ok Variable Names
Rating C: Poor Naming of Variables
Rating D: 0
Assigned grade: C
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 count(int *a,int n,int k){
 int c=0;
 for(int i=0;i<n;i++){
  if( a[i]==k)
  c++;}
return c;
}
  


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

int r=count(a,n,a[0]);
int e=a[0];
 for(int j=0;j<n;j++){
int p=count(a,n,a[j]);
  if(p>r)
{ r=p;
  e=a[j];}
}
cout<<e<<" "<<r;

}

Grading criterion: Quality of variable names
Rating A: Good Variables Names
Rating B: Ok Variable Names
Rating C: Poor Naming of Variables
Rating D: 0
Assigned grade: C
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*s,int n){
int p;
int k;
int i;
int b[p];
cin>>s[0];
for(i=1;i<n;i++){cin>>s[i];
		for(k=0;k<i;k++){if(s[i]=s[k]){b[k]++;break;}
               }}
p=1;
for(k=0;k<n;k++){if(b[k]>1){p++;}
int maxi=1;
for(k=0;k<p;k++){maxi=max(b[k],maxi);}
cout<<s[k]<<" "<<b[k];}
}
int main(){
int n;
int s[n];
cin>>n;
major(s,n);
         }

Grading criterion: Quality of variable names
Rating A: Good Variables Names
Rating B: Ok Variable Names
Rating C: Poor Naming of Variables
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 num[n];
	for(int i=0; i<n; i++){
		cin >> num[i] ;
	}
	int p=0;
	for(int i=0; i<n; i++){
		if(p<num[i])  p=num[i];
		
	}
	cout<<p<<" 2";
	
}

Grading criterion: Quality of variable names
Rating A: Good Variables Names
Rating B: Ok Variable Names
Rating C: Poor Naming of Variables
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 cont[n];
   for(int i=0;i<n;i++){
   cont[i]=0;
   for(int j=i;j<n;j++){
    if(arr[i]==arr[j]){cont[i]++;}
      }
   }
  int ans=0;
   for(int i=0;i<n;i++){
   ans=max(ans,cont[i]);
}
   for(int i=0;i<n;i++){
   if(ans==cont[i]){cout<<arr[i]<<" "<<ans<<endl;}
}
return 0;
}

Grading criterion: Quality of variable names
Rating A: Good Variables Names
Rating B: Ok Variable Names
Rating C: Poor Naming of Variables
Rating D: 0
Assigned grade: C
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,k1=0;
cin>>n;
int a[n],b[n];
for (int i=0;i<n;i++){b[i]=0;}
for(int i=0;i<n;i++) {cin>>a[i];}
for (int i=0;i<n;i++){
int k=0;
for (int j=i+1;j<n;j++){
if(a[i]==a[j]) {k++;if(k>k1)k1=k;}
}
}
for (int j=0;j<n;j++){
for (int i=j+1;i<n;i++){
if (a[j]==a[i]){b[j]++;}
}
}
for (int i=0;i<n;i++){
if(b[i]==k1) {cout<<a[i]<<" "<<k1+1<<endl;}
}
}

Grading criterion: Quality of variable names
Rating A: Good Variables Names
Rating B: Ok Variable Names
Rating C: Poor Naming of Variables
Rating D: 0
Assigned grade: C
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_occ = arr[0];
	int count_max = 1;
	
	for (int i = 0; i < n; i++)
	{
		int count = 0;
		for (int j = 0; j < n; j++)
		{
			if (arr[i] == arr[j])
			{
				count++;
			}
		}
		count_max = count > count_max ? count : count_max;
		max_occ = count > count_max ? arr[i] : max_occ;
	}
	
	cout << max_occ << " " << count_max;
}

Grading criterion: Quality of variable names
Rating A: Good Variables Names
Rating B: Ok Variable Names
Rating C: Poor Naming of Variables
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 q[n];
for(int i=0;i<n;i++){
cin>>q[i];
}
int a=1,b=1,c=1,d=1;
for(int i=1;i<n;i++){
if(q[0]==q[i]) a++;
}
for(int i=2;i<n;i++){
if(q[1]==q[i]); b++;
}
for(int i=3;i<n;i++){
if(q[2]==q[i]);c++;
}
for(int i=4;i<n;i++){
if(q[3]==q[i]); d++;
}

int k=max(a,b);
int l=max(k,c);
int r=max(l,d);

if(r==a) cout<<q[0]<<' '<<r;
else if(r==b) cout<<q[1]<<' '<<r;
else if(r==c) cout<<q[2]<<' '<<r;
else if(r==d) cout<<q[3]<<' '<<r;
}

Grading criterion: Quality of variable names
Rating A: Good Variables Names
Rating B: Ok Variable Names
Rating C: Poor Naming of Variables
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 r,n;
cin>>n;
double a[n+1];
int p[n+1];
for(int i=0;i<(n+1);i++){
cin>>a[i];
}
for(int i=0;i<(n+1);i++){
p[i]=1;
}
for(int j=0;j<(n+1);j++){
for(int i=0;i<(n+1);i++){
if(a[i]==a[j] && i!=j)p[j]++;
}
}
for(int k=0;k<(n+1);k++){
r=p[0];
r=max(p[0],p[k]);
}
if(r==1){
for(int i=0;i<(n+1);i++){
cout<<a[i]<<" "<<r<<endl;
}
}
for(int i=0;i<(n+1);i++){
if(r==p[i]){cout<<a[i]<<" "<<r<<endl;break;}
}
}

Grading criterion: Quality of variable names
Rating A: Good Variables Names
Rating B: Ok Variable Names
Rating C: Poor Naming of Variables
Rating D: 0
Assigned grade: C
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];
for(int i=0;i<n;i++){
   cin>>a[i];
   }
int b[n];
for(int i=0;i<n;i++){
   b[i]=0;
   }
for(int i=0;i<n;i++){
    bool x;
    for(int k=0;k<i;k++){
           if(a[k]==a[i]) x=0;
           else continue;
           }
    if(x==0) continue;
    for(int j=i;j<n;j++){
           if(a[j]==a[i]) b[i]=b[i]+1;
           else continue;
           }
   }
int m;
m=0;
for (int i=0;i<n;i++){
   m=max(m,b[i]);
   }
for (int i=0;i<n;i++){
   if(b[i]==m) cout<<a[i]<<" "<<b[i]<<" ";
   else continue;
   }
}

Grading criterion: Quality of variable names
Rating A: Good Variables Names
Rating B: Ok Variable Names
Rating C: Poor Naming of Variables
Rating D: 0
Assigned grade: B