CodeGraderBench/CodeGraderBench huggingface dataset:
Problem: Write a C++ program to take the number n and an array A of n numbers as input from the user. The program should then contain a function which determines whether the array is in strictly increasing order (in which case the function should return 1), or else determine whether the array is in strictly decreasing order (in which case the function should return 2), and return 3 otherwise. The format of the function is int isIncreasingDecreasing (int *A, int n). The program should then print the value returned by the function on a new line. You must implement this via a function, otherwise you will get no credit. For simplicity, assume that all entries in the array are unique.

Input Format - Non-negative integer n and an array A of n elements
Output Format - The value 1,2 or 3 as described above. 
Constraints
1 <= n < 25

Sample input - 33 4 2
Sample output - 3

Student submission:
#include <iostream>
using namespace std;
int isIncreasingDecreasing(int p , int B[])

{int k=3;
{for(int i=0; i<p;i++)
{if (B[i]<B[i+1]) {k=1;}}
{for(int i=0; i<p;i++)
if (B[i]>B[i+1]) {k=2;}}
cout<<k;
return k;}
}

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

isIncreasingDecreasing (n, A );
return 0;
}

Grading criterion: Implemented in a function.
Rating A: If implemented in the function
Rating B: If not implemented in the function
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take the number n and an array A of n numbers as input from the user. The program should then contain a function which determines whether the array is in strictly increasing order (in which case the function should return 1), or else determine whether the array is in strictly decreasing order (in which case the function should return 2), and return 3 otherwise. The format of the function is int isIncreasingDecreasing (int *A, int n). The program should then print the value returned by the function on a new line. You must implement this via a function, otherwise you will get no credit. For simplicity, assume that all entries in the array are unique.

Input Format - Non-negative integer n and an array A of n elements
Output Format - The value 1,2 or 3 as described above. 
Constraints
1 <= n < 25

Sample input - 33 4 2
Sample output - 3

Student submission:
#include <iostream>
#include <math.h>
using namespace std;
int main(){
int n,i,a,b;
double s,k,e;
cin>>n;
s=1;
i=1;
while(i<n){
a=pow(2,i);
b=pow(-1,i);
k=(float)b/(float)a;
s=s+k;
i++;
}

e=fabs(1.5*s-1);
cout<<fixed;
cout.precision(6);
cout<<s<<" "<<e;
}

Grading criterion: Implemented in a function.
Rating A: If implemented in the function
Rating B: If not implemented in the function
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take the number n and an array A of n numbers as input from the user. The program should then contain a function which determines whether the array is in strictly increasing order (in which case the function should return 1), or else determine whether the array is in strictly decreasing order (in which case the function should return 2), and return 3 otherwise. The format of the function is int isIncreasingDecreasing (int *A, int n). The program should then print the value returned by the function on a new line. You must implement this via a function, otherwise you will get no credit. For simplicity, assume that all entries in the array are unique.

Input Format - Non-negative integer n and an array A of n elements
Output Format - The value 1,2 or 3 as described above. 
Constraints
1 <= n < 25

Sample input - 33 4 2
Sample output - 3

Student submission:
#include <simplecpp>
int isIncreasingDecreasing(int *A, int n){
	if (n == 1) return 1;
	else{
	int c = 0, d = 0;
	for (int i = 0; i < n-1; i++){
	if (A[i] < A[i+1]) c++;
	else break;
	}
	if (c == n-1) return 1;
	for (int j = 0; j < n-1; j++){
	if (A[j] > A[j+1]) d++;
	else break;
	}
	if (d == n-1) return 2;

	return 3;
	}
}
main_program{
	int arr[50], n;
	cin >> n;
	for (int x = 0; x < n; x++){
	cin >> arr[x];
	}
	int response = isIncreasingDecreasing(arr, n);
	cout << response;
}

Grading criterion: Implemented in a function.
Rating A: If implemented in the function
Rating B: If not implemented in the function
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take the number n and an array A of n numbers as input from the user. The program should then contain a function which determines whether the array is in strictly increasing order (in which case the function should return 1), or else determine whether the array is in strictly decreasing order (in which case the function should return 2), and return 3 otherwise. The format of the function is int isIncreasingDecreasing (int *A, int n). The program should then print the value returned by the function on a new line. You must implement this via a function, otherwise you will get no credit. For simplicity, assume that all entries in the array are unique.

Input Format - Non-negative integer n and an array A of n elements
Output Format - The value 1,2 or 3 as described above. 
Constraints
1 <= n < 25

Sample input - 33 4 2
Sample output - 3

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

int isIncreasingDecreasing(int *A,int n)
{
int c=0;
if(n==1) return 1;

else
{
if(A[1]>A[0])
{
for(int i=0;i<n-1;i++)
{
if(A[i+1]>A[i]) c=1;
else
{
c=3;
break;
}
}
}


else if(A[1]<A[0])
{
for(int i=0;i<n-1;i++)
{
if(A[i+1]<A[i]) c=2;
else
{
c=3;
break;
}
}
}

else c=3;

}
return c;

}
int main()
{
int n;
cin>>n;
int A[n];
for(int i=0;i<n;i++) cin>>A[i];
cout<<isIncreasingDecreasing(A,n);
}

Grading criterion: Implemented in a function.
Rating A: If implemented in the function
Rating B: If not implemented in the function
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take the number n and an array A of n numbers as input from the user. The program should then contain a function which determines whether the array is in strictly increasing order (in which case the function should return 1), or else determine whether the array is in strictly decreasing order (in which case the function should return 2), and return 3 otherwise. The format of the function is int isIncreasingDecreasing (int *A, int n). The program should then print the value returned by the function on a new line. You must implement this via a function, otherwise you will get no credit. For simplicity, assume that all entries in the array are unique.

Input Format - Non-negative integer n and an array A of n elements
Output Format - The value 1,2 or 3 as described above. 
Constraints
1 <= n < 25

Sample input - 33 4 2
Sample output - 3

Student submission:
#include<iostream>
using namespace std;
int IsIncreasingDecreasing(int *A, int n){
 int i=1; int b=A[0]; int c=0, d=0;
 while(i<n){
  if(b>A[i]) c+=1; 
  else d+=1;
  b=A[i];
  i+=1; }
 if(n==1) return 1;
 if (c==n-1) return 2; 
 else if(d==n-1) return 1;
 else return 3; }
int main(){
 int n; cin>>n;
 int arr[n]; 
 for(int i=0; i<n; i++) {cin>>arr[i];}
 cout<<IsIncreasingDecreasing(arr, n);}

Grading criterion: Implemented in a function.
Rating A: If implemented in the function
Rating B: If not implemented in the function
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take the number n and an array A of n numbers as input from the user. The program should then contain a function which determines whether the array is in strictly increasing order (in which case the function should return 1), or else determine whether the array is in strictly decreasing order (in which case the function should return 2), and return 3 otherwise. The format of the function is int isIncreasingDecreasing (int *A, int n). The program should then print the value returned by the function on a new line. You must implement this via a function, otherwise you will get no credit. For simplicity, assume that all entries in the array are unique.

Input Format - Non-negative integer n and an array A of n elements
Output Format - The value 1,2 or 3 as described above. 
Constraints
1 <= n < 25

Sample input - 33 4 2
Sample output - 3

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

int  isIncreasingDecreasing(int *a,int n)

{int c=0,d=0;
	for(int i=0;i<n-1;i++)
	{
	if(a[i]<a[i+1]){c=c+1;}
	}
	for(int i=0;i<n-1;i++)
	{
	if(a[i]>a[i+1]){d=d+1;}
	}
	
	if(c==n-1){return 1;}
	else if(d==n-1){return 2;}
	else {return 3;}
	
}	
int main()
{
	int n;
	cin>>n;
	int a[n];
	for(int i=0;i<n;i++)
	{cin>>a[i];}
	cout<<isIncreasingDecreasing(a,n);
	
}

Grading criterion: Implemented in a function.
Rating A: If implemented in the function
Rating B: If not implemented in the function
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take the number n and an array A of n numbers as input from the user. The program should then contain a function which determines whether the array is in strictly increasing order (in which case the function should return 1), or else determine whether the array is in strictly decreasing order (in which case the function should return 2), and return 3 otherwise. The format of the function is int isIncreasingDecreasing (int *A, int n). The program should then print the value returned by the function on a new line. You must implement this via a function, otherwise you will get no credit. For simplicity, assume that all entries in the array are unique.

Input Format - Non-negative integer n and an array A of n elements
Output Format - The value 1,2 or 3 as described above. 
Constraints
1 <= n < 25

Sample input - 33 4 2
Sample output - 3

Student submission:
#include<simplecpp>
main_program{

int n;
cin>>n;

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

int isIncreasingDecreasing(int *A, int n){
for (int i=0;i<n;i++){

if (A[i]<A[i+1]);
return 1;


else if (A[i]>A[i+1]);
return 2;


else;
return 3;
}
}


int t;

t = isIncreasingDecreasing (A,n);
cout<<t;

}

Grading criterion: Implemented in a function.
Rating A: If implemented in the function
Rating B: If not implemented in the function
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take the number n and an array A of n numbers as input from the user. The program should then contain a function which determines whether the array is in strictly increasing order (in which case the function should return 1), or else determine whether the array is in strictly decreasing order (in which case the function should return 2), and return 3 otherwise. The format of the function is int isIncreasingDecreasing (int *A, int n). The program should then print the value returned by the function on a new line. You must implement this via a function, otherwise you will get no credit. For simplicity, assume that all entries in the array are unique.

Input Format - Non-negative integer n and an array A of n elements
Output Format - The value 1,2 or 3 as described above. 
Constraints
1 <= n < 25

Sample input - 33 4 2
Sample output - 3

Student submission:
#include <iostrea>
using namespace std;
int (isIncreasingDecreasing(int A[], int n);
 for (int i=0; i<n; i++){
if (A[i]<(i+1){
}
return 1;
}
for (int j=0; j>n; j++){
else if (A[j]>(j+2){
}return 2;
}
int main(){
int n;
cin>>n;
int arr[n];
for (int i=0; i<n; i++){
cin >> arr[i];
}
cout << isIncreasingDecreasing(arr,n);
return 0;
}

Grading criterion: Implemented in a function.
Rating A: If implemented in the function
Rating B: If not implemented in the function
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take the number n and an array A of n numbers as input from the user. The program should then contain a function which determines whether the array is in strictly increasing order (in which case the function should return 1), or else determine whether the array is in strictly decreasing order (in which case the function should return 2), and return 3 otherwise. The format of the function is int isIncreasingDecreasing (int *A, int n). The program should then print the value returned by the function on a new line. You must implement this via a function, otherwise you will get no credit. For simplicity, assume that all entries in the array are unique.

Input Format - Non-negative integer n and an array A of n elements
Output Format - The value 1,2 or 3 as described above. 
Constraints
1 <= n < 25

Sample input - 33 4 2
Sample output - 3

Student submission:
#include<iostream>
using namespace std;
int isIncreasingDecreasing(int *A, int n)
{
	int chk1=1;
	int chk2=1;
	for(int l=0;l<(n-1);l=l+1)
	{
		if(A[l]>=A[l+1]){chk1=0;}
	}
	for(int l=0;l<(n-1);l=l+1)
	{
		if(A[l]<=A[l+1]){chk2=0;}
	}
	if(chk1==1){return 1;}
	else if(chk2==1){return 2;}
	else{return 3;}
}
int main()
{
	int n;
	cin>>n;
	int a[n];
	for(int l=0;l<n;l=l+1)
	{
		cin>>a[l];
	}
	cout<<isIncreasingDecreasing(a,n);
}

Grading criterion: Implemented in a function.
Rating A: If implemented in the function
Rating B: If not implemented in the function
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take the number n and an array A of n numbers as input from the user. The program should then contain a function which determines whether the array is in strictly increasing order (in which case the function should return 1), or else determine whether the array is in strictly decreasing order (in which case the function should return 2), and return 3 otherwise. The format of the function is int isIncreasingDecreasing (int *A, int n). The program should then print the value returned by the function on a new line. You must implement this via a function, otherwise you will get no credit. For simplicity, assume that all entries in the array are unique.

Input Format - Non-negative integer n and an array A of n elements
Output Format - The value 1,2 or 3 as described above. 
Constraints
1 <= n < 25

Sample input - 33 4 2
Sample output - 3

Student submission:
#include<iostream>
using namespace std ;
void create_arr(int A[] , int n)
{
	for (int i=0 ; i<n ; i++)
	{
		cin >> A[i] ;
		//cout << A[i] ;
	}
} 


void isIncreasingDecreasing(int *A , int n)
{
	if (n!=1) {
	if (A[0] < A[1])
	{
	int count=0 ;
	for (int i=0 ; i<n-1; i++)
	{
		 
		if (A[i]<A[i+1]) 
		{
			count = count + 1 ;
		}
	}
		if (count == (n-1)) cout<<"1" ;
		else cout << 3 ;
	}
	else {
	int count=0 ;
		for (int i=0; i<n-1; i++)
	{
		
		if (A[i]>A[i+1]) 
		{
			count = count + 1 ;
		}
	}
		if (count == (n-1)) cout<<"2" ;
		else cout << 3 ;
	}
	}
	else cout << "1" ;
	
			
}


int main()
{
	int n ;
	cin >> n ;
	int arr[n] ;
	create_arr(arr , n) ;
	isIncreasingDecreasing(arr,n) ;
}

Grading criterion: Implemented in a function.
Rating A: If implemented in the function
Rating B: If not implemented in the function
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take the number n and an array A of n numbers as input from the user. The program should then contain a function which determines whether the array is in strictly increasing order (in which case the function should return 1), or else determine whether the array is in strictly decreasing order (in which case the function should return 2), and return 3 otherwise. The format of the function is int isIncreasingDecreasing (int *A, int n). The program should then print the value returned by the function on a new line. You must implement this via a function, otherwise you will get no credit. For simplicity, assume that all entries in the array are unique.

Input Format - Non-negative integer n and an array A of n elements
Output Format - The value 1,2 or 3 as described above. 
Constraints
1 <= n < 25

Sample input - 33 4 2
Sample output - 3

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

int IsIncreasingDecreasing( int *A,int n){

int c;
c=0;
for (int i=0;i<n-1;i++)
{if (*(A+i)<*(A+i+1)) c++;}

if (c==(n-1)) return 1;

int b=0;

for(int i=0;i<n-1;i++)
{if(*(A+i)>*(A+i+1)) b++;}

if (b==(n-1)) return 2;

 return 3;}

int main(){

int n;
cin>>n;

int a[n];

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

cout<<IsIncreasingDecreasing(&a[n],n);}

Grading criterion: Implemented in a function.
Rating A: If implemented in the function
Rating B: If not implemented in the function
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take the number n and an array A of n numbers as input from the user. The program should then contain a function which determines whether the array is in strictly increasing order (in which case the function should return 1), or else determine whether the array is in strictly decreasing order (in which case the function should return 2), and return 3 otherwise. The format of the function is int isIncreasingDecreasing (int *A, int n). The program should then print the value returned by the function on a new line. You must implement this via a function, otherwise you will get no credit. For simplicity, assume that all entries in the array are unique.

Input Format - Non-negative integer n and an array A of n elements
Output Format - The value 1,2 or 3 as described above. 
Constraints
1 <= n < 25

Sample input - 33 4 2
Sample output - 3

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


int main(){
      int n;
      cin>>n;
      int A[n-1];
      for(int i=0;i<n;i++){
        cin>>A[i];
      }
      int z=0;
        for(int i=0;i<(n-1);i++){
           if(A[i]>A[i+1]){z=z+1;
           }
           else z=z;}
           if(z=n){
           cout<<"2";}
           for(int i=0;i<(n-1);i++){
           if(A[i]<A[i+1]){z=z+1;
           }else {z=z;}}
           if(z=(n)){
           cout<<"1";}
           else{cout<<"3";}
           
  }

Grading criterion: Implemented in a function.
Rating A: If implemented in the function
Rating B: If not implemented in the function
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take the number n and an array A of n numbers as input from the user. The program should then contain a function which determines whether the array is in strictly increasing order (in which case the function should return 1), or else determine whether the array is in strictly decreasing order (in which case the function should return 2), and return 3 otherwise. The format of the function is int isIncreasingDecreasing (int *A, int n). The program should then print the value returned by the function on a new line. You must implement this via a function, otherwise you will get no credit. For simplicity, assume that all entries in the array are unique.

Input Format - Non-negative integer n and an array A of n elements
Output Format - The value 1,2 or 3 as described above. 
Constraints
1 <= n < 25

Sample input - 33 4 2
Sample output - 3

Student submission:
#include<iostream>
using namespace std;
int isIncreasingDecreasing(int *A,int n)
{	
	int i,j;
	for(i=0;i<n-1;i++)
	{	if(A[i]>=A[i+1]){break;}
	}
	if(i==n-1){return 1;}
	for(j=0;j<n-1;j++)
	{	if(A[j]<=A[j+1]){break;}
	}
	if(j==n-1){return 2;}
	return 3;

}
int main()
{	int n;
	cin>>n;
	int A[n];
	for(int i=0;i<n;i++)
	{
		cin>>A[i];
	}
	
	cout<<isIncreasingDecreasing(A,n);
	return 0;
}

Grading criterion: Implemented in a function.
Rating A: If implemented in the function
Rating B: If not implemented in the function
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take the number n and an array A of n numbers as input from the user. The program should then contain a function which determines whether the array is in strictly increasing order (in which case the function should return 1), or else determine whether the array is in strictly decreasing order (in which case the function should return 2), and return 3 otherwise. The format of the function is int isIncreasingDecreasing (int *A, int n). The program should then print the value returned by the function on a new line. You must implement this via a function, otherwise you will get no credit. For simplicity, assume that all entries in the array are unique.

Input Format - Non-negative integer n and an array A of n elements
Output Format - The value 1,2 or 3 as described above. 
Constraints
1 <= n < 25

Sample input - 33 4 2
Sample output - 3

Student submission:
#include <iostream>

using namespace std;

int isIncreasingDecreasing(int *a, int n)
{
	int inc = 0;
	int dec = 0;
	for (int i = 0; i < n - 1; i++) {
		if (a[i + 1] > a[i])
			inc++;	
		if (a[i + 1] < a[i])
			dec++;
	}
	if (inc == n - 1)
		return 1;
	if (dec == n - 1)
		return 2;
	return 3;
}

int main()
{
	int n;
	cin >> n;
	int a[25];
	for (int i = 0; i < n; i++)
		cin >> a[i];
	
	cout << isIncreasingDecreasing(a, n) << endl;
}

Grading criterion: Implemented in a function.
Rating A: If implemented in the function
Rating B: If not implemented in the function
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take the number n and an array A of n numbers as input from the user. The program should then contain a function which determines whether the array is in strictly increasing order (in which case the function should return 1), or else determine whether the array is in strictly decreasing order (in which case the function should return 2), and return 3 otherwise. The format of the function is int isIncreasingDecreasing (int *A, int n). The program should then print the value returned by the function on a new line. You must implement this via a function, otherwise you will get no credit. For simplicity, assume that all entries in the array are unique.

Input Format - Non-negative integer n and an array A of n elements
Output Format - The value 1,2 or 3 as described above. 
Constraints
1 <= n < 25

Sample input - 33 4 2
Sample output - 3

Student submission:
#include<iostream>
using namespace std;
 int IncreasingDecreasing (int *A,int n){
 int i,j;
 for(int i=0; i<n; i++)
  {if (A[i]<A[i+1]);
 	return 1;}
 	
 for (int j=0; j<n; j++)
 {if ( A[j]>A[j-1]);
       return 2;}
       return 3;
     }
     
     
 int main()
 {
 int n ;
cin>>n;
cin>>A[];
 

 for(int i=0; i<n; i++)
 cout<<"1"<<endl;
 for (int j=0; j<n; j++)
 cout<<"2"<<endl;
 cout<<"3"<<endl;
 }

Grading criterion: Implemented in a function.
Rating A: If implemented in the function
Rating B: If not implemented in the function
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take the number n and an array A of n numbers as input from the user. The program should then contain a function which determines whether the array is in strictly increasing order (in which case the function should return 1), or else determine whether the array is in strictly decreasing order (in which case the function should return 2), and return 3 otherwise. The format of the function is int isIncreasingDecreasing (int *A, int n). The program should then print the value returned by the function on a new line. You must implement this via a function, otherwise you will get no credit. For simplicity, assume that all entries in the array are unique.

Input Format - Non-negative integer n and an array A of n elements
Output Format - The value 1,2 or 3 as described above. 
Constraints
1 <= n < 25

Sample input - 33 4 2
Sample output - 3

Student submission:
#include<iostream>
using namespace std;
int isIncreasingDecreasing (int *a, int n){ 
	  if(a[0]<a[1])  for (int i=1; i<n; i++) {  int   
	     maxindex= 0;
	    if(a[maxindex]<a[i]) maxindex=i;
	   if (maxindex ==n) cout<< "1" ;
	   if (maxindex != n) cout << "3";} 

	   if (a[0]> a[1])for (int i =n-2;0<=i; i--){int    
	       maxindex= n-1;
	      if(a[maxindex]<a[i]) maxindex=i;
	      if (maxindex==0) cout<< "2";
	      if (maxindex !=0) cout << "3";
	      } 
	      return 1;
}	  
  
int main() { int n, i;
            
      int a[i] ;
      for (int i=0; i<n; i++) {cin >> a[i];}       
         isIncreasingDecreasing ( a,n) ;
           }

Grading criterion: Implemented in a function.
Rating A: If implemented in the function
Rating B: If not implemented in the function
Rating C: 0
Rating D: 0
Assigned grade: A