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 *A, int n){
int i;

         if(A[i]<A[i+1]){
             return 1;
         }
         else if (A[i]>A[i+1]){
             return 2;
         }
         else{
         return 3;
         }
}

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

Grading criterion: Should be done in one scan of array
Rating A: If it is done in one scan
Rating B: If it isn't done in one scan
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 j=0,k=0;
while(A[j+1]>A[j] && j<n-1){j++;}
if(j==n-1){return 1;}
while(A[k]>A[k+1] && k<n-1){k++;}
if(k==n-1){return 2;}
else return 3;}
int main(){
int *A,n;
cin>>n;
for(int y=0;y<n;y++){cin>>A[y];}
cout<<isIncreasingDecreasing(A,n);}

Grading criterion: Should be done in one scan of array
Rating A: If it is done in one scan
Rating B: If it isn't done in one scan
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 b=0,c=0;
for (int i=0;i<n-1;i++) {
if (A[i]<A[i+1]) b++ ;
else if (A[i]>A[i+1]) c++ ;
}
if (b==n-1) cout<<1;
else if (c==n-1) cout << 2;
else cout << "3";
return 4;
}
int main(){
int i,n;
cin >> n;
if ((n>=1)&&(n<25)){
int A[n];
for (i=0;i<n;i++){
cin >> A[i];
}
isIncreasingDecreasing(A,n);
}
}

Grading criterion: Should be done in one scan of array
Rating A: If it is done in one scan
Rating B: If it isn't done in one scan
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>

int isIncreasingDecreasing (int *A[], int n)
   {int r,i,j;
  
	for (i=0;i<n;i++)
		{for (j=1; j<n; j++)
	         {  if (A[i]> A[j])
		        r = 1;
		        else if (A[i]<A[j])
		        r=2;
		        else
		        r=3;		     
		     }
		 }
   return r;
   }

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

			     
}

Grading criterion: Should be done in one scan of array
Rating A: If it is done in one scan
Rating B: If it isn't done in one scan
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>
main_program{
	
	int n;
	cin>>n;
	int arr[n](int n);

	for (int i=0;i<=(n-1);i++){
		
		if (arr[i]<arr[i+1]){
			return 1;
		    }
		
		else if (arr[i]>arr[i+1]){
			return 2;
		    }

		else {
			return 3;
		    }
		   


		}
	}

Grading criterion: Should be done in one scan of array
Rating A: If it is done in one scan
Rating B: If it isn't done in one scan
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 *o,int n){
int counter=0;
int counter1=0;
	for(int j=0;j<n-1;j++){
	if(o[j]<o[j+1])counter++;
	else if(o[j]>o[j+1])counter1++ ;
	}
	if(counter==n-1)return 1;
	else if(counter1==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[0],n);
}

Grading criterion: Should be done in one scan of array
Rating A: If it is done in one scan
Rating B: If it isn't done in one scan
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 incresingdecresing(int*A,int n)
{   
    for(int i=0;i<(n-1);i++)
    {if(A[i]<A[i+1])
    {
        return 1;
    }
    else if(A[i]>A[i+1])
    {
        return 2;
    }
    else
    {
        return 3;
    }
    }
   return 0;
 
}
  int main()
{
    int n,A[n],i;
    cin>>n;
    for(int i=0; i<n;i++)
    {
        cin>>A[i];
    }
    cout<<incresingdecresing(A,n);
}

Grading criterion: Should be done in one scan of array
Rating A: If it is done in one scan
Rating B: If it isn't done in one scan
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){
while(true){
if(A[0]<A[1]){
for(int i=0;i<n-1;i++){
       if(A[i]<A[i+1]){
           }
        else{
         return 3;
        break;
         }
     }
return 1;
break;
}
else{

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




return 3;
break;
}
}}
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: Should be done in one scan of array
Rating A: If it is done in one scan
Rating B: If it isn't done in one scan
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 a=0;
for(int i=1;i<n;i++){
if(A[i]<A[i-1]){
a--;
}
if(A[i]>A[i-1]){
a++;
}
}
if(a==n-1){
return 1;
}
if(a==-n+1){
return 2;
}
else{
return 3;
}
}
int main(){
int n;
cin>>n;
int A[n];
int k;
for(int i=0;i<n;i++){
cin>>A[i];
}
k=isIncreasingDecreasing(A,n);
cout<<k;
}

Grading criterion: Should be done in one scan of array
Rating A: If it is done in one scan
Rating B: If it isn't done in one scan
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 j,k;
	j = 0;
	k = 0;
	for(int i=0;i<n-1;i++)
	{
		if(A[i]<A[i+1])
	{j++ ;}
		else if(A[i]>A[i+1])
	{k++ ;}
	}
	if(j==n-1)
	{return 1;}
	else if(k==n-1)
	{return 2;}
	else 
	return 3;
}
int main()
{
	int n;
	cin>>n;
	int a[n];
	for(int i=0;i<=n-1;i++)
	{cin>>a[i];}
	cout<<isIncreasingDecreasing(a,n);}

Grading criterion: Should be done in one scan of array
Rating A: If it is done in one scan
Rating B: If it isn't done in one scan
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(n==1) return 1;	
	
	int dec=0,inc=0;

	for(int i=0;i<n-1;++i)
	{
	if(A[i]>A[i+1]) dec++;

	else if(A[i]<A[i+1]) inc++;
	}

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

	else if(inc==(n-1)) return 1;

	else return 3;
}

int main()
{
int n;

cin >> n;

int array[n];

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

cout << isIncreasingDecreasing(array,n);
}

Grading criterion: Should be done in one scan of array
Rating A: If it is done in one scan
Rating B: If it isn't done in one scan
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 val=0;
for(int i=0;i<n-1;i++){
if(A[i]<A[i+1]){
val+=1;
}
else if(A[i]>A[i+1]){
val+=-2;}
}
if(val==n-1){return 1;}
else if(val==-2*(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];
}
if(1 <= n&& n < 25){cout<< isIncreasingDecreasing (A,n);}
}

Grading criterion: Should be done in one scan of array
Rating A: If it is done in one scan
Rating B: If it isn't done in one scan
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<cmath>
using namespace std;
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 main(){
int n;
cin>>n;
int A[n];
for(int i=0; i<n; i++){cin>>A[i];}
cout<<isIncreasingDecreasing(A,n);}

Grading criterion: Should be done in one scan of array
Rating A: If it is done in one scan
Rating B: If it isn't done in one scan
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(n!=1)
{
for(int i=0;i<n-1;i++)
{
if(A[i]<A[i+1]&&i==(n-2))
{
return 1;
}
if(A[i]>A[i+1]){break;}
}
for(int j=0;j<n-1;j++)
{
if(A[j]>A[j+1]&&j==(n-2))
{
return 2;
}
if(A[j]<A[j+1]){break;}
}
return 3;
}
return 1;
}

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

Grading criterion: Should be done in one scan of array
Rating A: If it is done in one scan
Rating B: If it isn't done in one scan
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 k=1,t=1;
 for(int i=0;i<n;i++)
 { 
  if(A[i]<A[i+1])
  {
    if(n==(i+1)) break;
    k=k+1;
  }
  else
  if(A[i]>A[i+1]) 
  {
   if(n==(i+1)) break;
   t=t+1;
  }
 }
   if(k==n) return 1;
  else if(t==n) return 2;
  else {return 3;}
}

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

Grading criterion: Should be done in one scan of array
Rating A: If it is done in one scan
Rating B: If it isn't done in one scan
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 m,i;
cin>>m;
for(int i=0;i<m;i++){
cin>>A[i];
}
for(int j=0;j<m;j++){
if(A[i]>A[j]){
j=i+1;
return 1;
}
if(A[i]<A[j]){ 
i=j+1;
return 2;
}
if (A[i]>!A[j] && A[i]<!A[j]){
return 3;
}
}
}
int main(){
int n;x;
return isIncreasingDecreasing(x,n);
}

Grading criterion: Should be done in one scan of array
Rating A: If it is done in one scan
Rating B: If it isn't done in one scan
Rating C: 0
Rating D: 0
Assigned grade: A