CodeGraderBench/CodeGraderBench huggingface dataset:
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in augmented alphabetical order, -1 if the second string appears before the first in augmented alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the bubble-sort algorithm.Your program should also print the number of string_compare operations (i.e., how many times the string_compare routine was called) and the number of string swaps performed.

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

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

Grading criterion: string_compare is implemented properly
Rating A: Fully corrrect
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: D
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in augmented alphabetical order, -1 if the second string appears before the first in augmented alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the bubble-sort algorithm.Your program should also print the number of string_compare operations (i.e., how many times the string_compare routine was called) and the number of string swaps performed.

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

Student submission:
#include<iostream>
using namespace std;
int string_compare(char s1[],char s2[])
{
	int i=0;
	while(true)
	{
		if(s1[i]=='\0' && s2[i]=='\0'){return 0;}
		if(s1[i]=='\0'){return 1;}
		if(s2[i]=='\0'){return -1;}
		if(s1[i]<s2[i]){return 1;}
		if(s1[i]>s2[i]){return -1;}
		i=i+1;
	}
}
void string_sort(char s[][12],int n,int& a,int& b)
{
	for(int i=0;i<n;i=i+1)
	{
		for(int j=0;j<(n-i-1);j=j+1)
		{
			int c=string_compare(s[j],s[j+1]);
			a=a+1;
			if(c==1)
			{
				char t[12];
				int i=0;
				for(;s[j][i]!='\0';i=i+1)
				{
					t[i]=s[j][i];
				}
				t[i]='\0';
				for(i=0;s[j+1][i]!='\0';i=i+1)
				{
					s[j][i]=s[j+1][i];
				}
				s[j][i]='\0';
				for(i=0;t[i]!='\0';i=i+1)
				{
					s[j+1][i]=t[i];
				}
				s[j+1][i]='\0';
				b=b+1;

			}
		}
	}
}
int main()
{
	int n;
	cin>>n;
	char a[n+1][12];
	for(int i=0;i<=n;i=i+1)
	{
		for(int j=0;j<12;j=j+1)
		{
			a[i][j]='\0';
		}
	}
	for(int l=0;l<n+1;l=l+1)
	{
		cin.getline(a[l],12);
	}
	int sc=0;int sw=0;
	string_sort(a,n+1,sc,sw);
	for(int i=0;i<=n;i=i+1)
	{
		for(int j=0;a[i][j]!='\0';j=j+1)
		{
			cout<<a[i][j];
		}
		cout<<' ';
	}
	cout<<endl<<sc<<" "<<sw;
}

Grading criterion: string_compare is implemented properly
Rating A: Fully corrrect
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: A
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in augmented alphabetical order, -1 if the second string appears before the first in augmented alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the bubble-sort algorithm.Your program should also print the number of string_compare operations (i.e., how many times the string_compare routine was called) and the number of string swaps performed.

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

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

int string_compare (char *first, char * second){
int i = 0;
while (true){
if (first[i] == 0 && second[i] == 0) return 0;
if (first[i] == 0) return 1;
if (second[i] == 0) return -1;
if (first[i] < second[i]) return 1;
if (first[i] > second[i]) return -1;
i++;
}
return 0;
}

int main()
{
int n1 , n2 ;
char string1[n1] , string2[n2] ; 
cin >> n1 >> n2 ;
cin >> string1[n1] >> string2[n2] ;
cout << string_compare (string1, string2) ;
}

Grading criterion: string_compare is implemented properly
Rating A: Fully corrrect
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: A
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in augmented alphabetical order, -1 if the second string appears before the first in augmented alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the bubble-sort algorithm.Your program should also print the number of string_compare operations (i.e., how many times the string_compare routine was called) and the number of string swaps performed.

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

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

void swap (char a[20], char b[20]){
char temp[20] ;
temp[20]= a[20]; a[20] = b[20]; b[20] = temp[20]; return;
}

void input(char A[][20],int n){
for (int i=0;i<n;i++){
cin.getline(A[i],12);}}

int string_compare (char *first, char * second){
int i = 0;
while (true){
if (first[i] == 0 && second[i] == 0) return 0;
if (first[i] == 0) return -1;
if (second[i] == 0) return +1;
if (first[i] < second[i]) return -1;
if (first[i] > second[i]) return +1;
i++;
}
return 0;
}

void string_sort(char A[][20], int n,int &s)
{  s=0;
    int i, j;
    for (i = 0; i < n ; i++)
    { 
        // Last i elements will be in place after this for loop
        for (j = 0; j < n ; j++)
        
        {int l = 0;
        while(A[j][l]=A[j+1][l]){l++;}
        
            if (A[j][l] < A[j + 1][l])
                swap(A[j], A[j + 1]);
                s++;
        }
}}

void print(char A[][20],int n){
for (int i=0;i<n;i++)cout<<A[i]<<endl;}

int main(){
int n,s;
cin>>n;

char A[n][20];
input(A,n);
string_sort(A,n,s);
print(A,n);
cout<<s;}

Grading criterion: string_compare is implemented properly
Rating A: Fully corrrect
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: B
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in augmented alphabetical order, -1 if the second string appears before the first in augmented alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the bubble-sort algorithm.Your program should also print the number of string_compare operations (i.e., how many times the string_compare routine was called) and the number of string swaps performed.

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

Student submission:
#include<iostream>
using namespace std;
int string_compare(char *a,char *b)
{int i=0;
while(true)
{	if(a[i]==0 && b[i]==0){return 0;}
	if(a[i]==0){return 1;}
	if(b[i]==0){return -1;}
	if(a[i]<b[i]){return 1;}
	if(b[i]<a[i]){return -1;}
	i++;
}
return 0;
}
void swaps(char a[][12],int m,int n)
{	char t[12];int i;	
	for(i=0;a[m][i]!=0;i++)
	{t[i]=a[m][i];
	}
	t[i]=0;
	for(i=0;a[n][i]!=0;i++)
	{a[m][i]=a[n][i];
	}
	a[m][i]=0;
	for(i=0;t[i]!=0;i++)
	{a[n][i]=t[i];
	}
	a[n][i]=0;
}
void string_sort(char a[][12],int n,int &x,int &y)
{	
	for(int i=0;i<n-1;i++)
	{	for(int j=0;j<n-i-1;j++)
		{	x++;
			int k=string_compare(a[j],a[j+1]);
			if(k==1){swaps(a,j,j+1);y++;}
			
		}
	
	
	}



}



int main()
{	int n,x=0,y=0;
	cin>>n;int p=n+1;
	char a[14][12];
	for(int i=0;i<p;i++)
	{cin.getline(a[i],12);
	}
	string_sort(a,p,x,y);
	for(int i=0;i<p;i++)
	{cout<<a[i]<<endl;}
	cout<<x<<" "<<y;



}

Grading criterion: string_compare is implemented properly
Rating A: Fully corrrect
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: A
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in augmented alphabetical order, -1 if the second string appears before the first in augmented alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the bubble-sort algorithm.Your program should also print the number of string_compare operations (i.e., how many times the string_compare routine was called) and the number of string swaps performed.

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

Student submission:
#include <iostream>
#include <cmath>

using namespace std;

#define ll long long
#define MAX 12

int string_compare(char *a, char *b)
{
	int i = 0;
	while (i < MAX) {
		if (a[i] == 0 && b[i] == 0)
			return 0;
		if (a[i] < b[i])
			return 1;
		if (a[i] > b[i])
			return -1;
		i++;
	}
}

void swapStrings(char *a, char *b)
{
	char temp[MAX];
	for (int i = 0; i < MAX; i++) {
		temp[i] = a[i];
		a[i] = b[i];
		b[i] = temp[i];
	}
}

void string_sort(char string[][MAX], int n, int &ccompare, int &cswap)
{
	for (int i = 0; i < n - 1; i++) {
		bool flag = false;
		for (int j = 0; j < n - i - 1; j++) {
			ccompare++;
			if (string_compare(string[j], string[j + 1]) > 0) {
				swapStrings(string[j], string[j + 1]);
				cswap++;
				flag = true;
			}
		}
		if (!flag)
			break;
	}
}

void printStrings(char string[][MAX], int n)
{
	for (int i = 0; i < n; i++)
		cout << string[i] << " ";
	cout << endl;
}

int main()
{
	int n;
	cin >> n;

	char string[15][MAX];

	for (int i = 0; i < n; i++)
		cin >> string[i];

	int ccompare = 0, cswap = 0;

	string_sort(string, n, ccompare, cswap);
	printStrings(string, n);
	cout << ccompare << " " << cswap << endl;
}

Grading criterion: string_compare is implemented properly
Rating A: Fully corrrect
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: A
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in augmented alphabetical order, -1 if the second string appears before the first in augmented alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the bubble-sort algorithm.Your program should also print the number of string_compare operations (i.e., how many times the string_compare routine was called) and the number of string swaps performed.

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

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

void get2Darray (int A[][11], int n1, int n2){
int i,j;
for(i=0;i<n1;i++){
		for(j=0;j<n2;j++){
			cout << "row: " << i <<", column: " << j << endl;
			cin >> A[i][j];
		}
}
}
int string_length (const char* x) 
{
	int L = 0;
	while (x[L] != 0) L++;
return L;
}

void string_reverse(char* s, char* rev_s){
int n = string_length(s);
for(int i=0;i<n;i++) rev_s[n-1-i] = s[i]; 
rev_s[n] = 0;
}

int strcmp (const char* first, const char* second){
int i = 0;
while (true){
if (first[i] == 0 && second[i] == 0) return 0;
if (first[i] == 0) return -1;
if (second[i] == 0) return +1;
if (first[i] < second[i]) return -1;
if (first[i] > second[i]) return +1;
i++;
}
return 0;
}

Grading criterion: string_compare is implemented properly
Rating A: Fully corrrect
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: A
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in augmented alphabetical order, -1 if the second string appears before the first in augmented alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the bubble-sort algorithm.Your program should also print the number of string_compare operations (i.e., how many times the string_compare routine was called) and the number of string swaps performed.

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

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

void takeinput(char A[][11], int n){
	for(int i = 0; i<n; i++){
		cin >> A[i];
	}
}


int stringlen(char* A){
	int l = 1;
	int i = 0;
	while(A[i] != '\0'){
		l++;
		i++;
	}
	return l;
}

void printarray(char* A){
	int n = stringlen(A);
	for(int i = 0; i<n; i++){
		cout << A[i];
	}
}

void stringswap(char A[][11], int a, int b){
	for(int i = 0; i<11; i++){
		char temp = A[a][i];
		A[a][i] = A[b][i];
		A[b][i] = temp;
	}
}


int string_compare(char* A, char* B){
	int i = 0;
	while(true){
		if(A[i] == 0 && B[i] == 0){
			return 0;
		}
		if(A[i] == 0){
			return 1;
		}
		if(B[i] == 0){
			return -1;
		}
		if(A[i] > B[i]){
			return -1;
		}
		if(A[i] < B[i]){
			return 1;
		}
		i++;
	}
}

void string_sort(char A[][11], int n, int* numcompare, int* numswap){

	*numcompare = 0;
	*numswap = 0;
	
		
	for(int i = 0; i<n-1; i++){
		bool flag = false; 
		for(int j = 0; j<n-i-1; j++){
			
			*numcompare = *numcompare + 1;;		
			if(string_compare(A[j],A[j+1]) == 1){
				
				stringswap(A,j,j+1);
				flag = true;
				*numswap = *numswap + 1;
			}
		}
		if(flag == false){
			break;
		}			
	}
		
}
int main(){
	int n;
	int numcompare;
	int numswap;
	
	cin >> n;
	char A[n][11];
	takeinput(A, n);
	
	string_sort(A, n, &numcompare, &numswap);
	for(int i = 0; i<n; i++){
		printarray(A[i]);
		
	}
	cout << endl;
	cout << numcompare << " " << numswap;
	
	
	
}

Grading criterion: string_compare is implemented properly
Rating A: Fully corrrect
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: A
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in augmented alphabetical order, -1 if the second string appears before the first in augmented alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the bubble-sort algorithm.Your program should also print the number of string_compare operations (i.e., how many times the string_compare routine was called) and the number of string swaps performed.

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

Student submission:
#include<iostream>
#define MAX 13
using namespace std;
void swap( char *first,char *second)
{
 int temp=*first;
*first=*second;
*second=temp;
}
int string_cmp(char first[][MAX],char second[][MAX], int x,int b)
{
int i=0;
           while (true){
                       if (first[x][i] == 0 && second[x+1][i] == 0) return 0;
                       if (first[x][i] == 0) return -1;
                       if (second[x+1][i] == 0) return +1;
                       if (first[x][i] < second[x+1][i]) return -1;
                       if (first[x][i] > second[x+1][i]) return +1;
                       i++;
                       b++;
                       }
                       return 0;
}
void bubble_sort(char string[][MAX], int n,int a,int b)
{
    for (int i = 0; i < n - 1; i++)
    {
        
        for (int j = 0; j < n - i - 1; j++)
        {
            if (string_cmp(string,string,j,b)=-1)
                {swap(&string[j], &string[j + 1]);
                a++;
        }
    }
}
}
int main(){
          int n,a=0,b=0;
          cin>>n;
          char string[n][MAX];
          for (int i=0;i<n;i++){
                               cin.getline(string[i],12);
                               }
         bubble_sort(string,n,a,b);
         for (int i=0;i<n;i++){
                              int x=0;
                              while(string[i][x]!=0)x++;
                              for(j=0;j<=x;j++){cout<<string[i][j];}
                              cout<<endl; 
                              }
          
          cout<<b<<" "<<a;
}

Grading criterion: string_compare is implemented properly
Rating A: Fully corrrect
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: B
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in augmented alphabetical order, -1 if the second string appears before the first in augmented alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the bubble-sort algorithm.Your program should also print the number of string_compare operations (i.e., how many times the string_compare routine was called) and the number of string swaps performed.

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

Student submission:
#include<iostream>

using namespace std;

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



}

Grading criterion: string_compare is implemented properly
Rating A: Fully corrrect
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: D