CodeGraderBench/CodeGraderBench huggingface dataset:
Problem: You are given a sequence of integers. Your task is to analyze the order of the elements in the sequence, print the sequence in reverse order, and determine the category of the sequence based on how the elements are arranged.



Categories

After reading the sequence, determine which of the following categories it belongs to:

A - Ascending Order  
   All elements are in strictly increasing order.

D - Descending Order  
   All elements are in strictly decreasing order.

B - Constant Order  
   All elements are equal.

N - None  
   The sequence does not belong to any of the above categories.



Your Task

1. Read an integer n representing the number of elements.
2. Read n integers into an array or vector.
3. Print the elements in reverse order.
4. Traverse the array to determine its category:
   - If every next element is greater than the previous, it is Ascending (A).
   - If every next element is smaller than the previous, it is Descending (D).
   - If all elements are equal, it is Constant (B).
   - Otherwise, it is None (N).
5. Print the corresponding category character after printing the reversed array.



Input Format

- An integer n.
- n integers representing the elements of the array.



Output Format

- First, print the array in reverse order with spaces.
- Then print a single character on a new line representing the category:
  A, D, B, or N.


Assumptions on Input

- 1 <= n <= 10^5
- Elements are integers.

Student submission:
#include<iostream>
using namespace std;
int main(){
    int n;
    cin>>n;
    int nums[n];
    for(int i=0;i<n;i++){
        cin>>nums[i];
    }
    for(int i=n-1;i>=0;i--){
        cout<<nums[i]<<" ";
    }
    cout<<""<<endl;
    bool A=true;
    bool B=true;
    bool D=true;
    for(int i=1;i<n;i++){
        if(nums[i]!=nums[i-1]){
            B=false;
        }
        if(nums[i]<nums[i-1]){
            A=false;
        }
        if(nums[i]>nums[i-1]){
            D=false;
        }
    }
if(A){
    cout<<"A";
}
else if(B){
    cout<<"B";
}
else if(D){
    cout<<"D";
}
else{
    cout<<"N";
}
return 0;
}

Grading criterion: Traversing of the loop
Rating A: correctly traverses the loop n times
Rating B: Some issue.
Rating C: Major issue.
Rating D: 0
Assigned grade: A
Problem: You are given a sequence of integers. Your task is to analyze the order of the elements in the sequence, print the sequence in reverse order, and determine the category of the sequence based on how the elements are arranged.



Categories

After reading the sequence, determine which of the following categories it belongs to:

A - Ascending Order  
   All elements are in strictly increasing order.

D - Descending Order  
   All elements are in strictly decreasing order.

B - Constant Order  
   All elements are equal.

N - None  
   The sequence does not belong to any of the above categories.



Your Task

1. Read an integer n representing the number of elements.
2. Read n integers into an array or vector.
3. Print the elements in reverse order.
4. Traverse the array to determine its category:
   - If every next element is greater than the previous, it is Ascending (A).
   - If every next element is smaller than the previous, it is Descending (D).
   - If all elements are equal, it is Constant (B).
   - Otherwise, it is None (N).
5. Print the corresponding category character after printing the reversed array.



Input Format

- An integer n.
- n integers representing the elements of the array.



Output Format

- First, print the array in reverse order with spaces.
- Then print a single character on a new line representing the category:
  A, D, B, or N.


Assumptions on Input

- 1 <= n <= 10^5
- Elements are integers.

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

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

    vector<int>v;

    for(int i=0;i<n; i++){
        int d; cin>>d;
        v.push_back(d);
    }

    for(int i=n-1;i>=0; i--){
        
        cout<<v[i]<<" ";
    }

    cout<<endl;
    bool order=false;
    int x=0;//to check order
    string c;

    //ascending
    for(int i=0;i<n-1;i++){
        if(v[i]<=v[i+1]){
            x++;
        }
        else{
            break;
        }
    }
    if(!order && x==n-1){
        order=true;
        c="A";
    }
    else{
        x=0;
    }

    //decending
    for(int i=0;i<n-1;i++){
        if(v[i]>=v[i+1]){
            x++;
        }
        else{
            break;
        }
    }
    if(!order &&x==n-1){
        order=true;
        c="D";
    }
    else{
        x=0;
    }

    //both
    for(int i=0;i<n-1;i++){
        if(v[i]==v[i+1]){
            x++;
        }
        else{
            break;
        }
    }
    if(!order &&x==n-1){
        order=true;
        c="B";
    }
    else{
        x=0;
    }
    cout<<c;

    if(!order){
        cout<<"N"<<endl;
    }

    return 0;

}

Grading criterion: Traversing of the loop
Rating A: correctly traverses the loop n times
Rating B: Some issue.
Rating C: Major issue.
Rating D: 0
Assigned grade: A
Problem: You are given a sequence of integers. Your task is to analyze the order of the elements in the sequence, print the sequence in reverse order, and determine the category of the sequence based on how the elements are arranged.



Categories

After reading the sequence, determine which of the following categories it belongs to:

A - Ascending Order  
   All elements are in strictly increasing order.

D - Descending Order  
   All elements are in strictly decreasing order.

B - Constant Order  
   All elements are equal.

N - None  
   The sequence does not belong to any of the above categories.



Your Task

1. Read an integer n representing the number of elements.
2. Read n integers into an array or vector.
3. Print the elements in reverse order.
4. Traverse the array to determine its category:
   - If every next element is greater than the previous, it is Ascending (A).
   - If every next element is smaller than the previous, it is Descending (D).
   - If all elements are equal, it is Constant (B).
   - Otherwise, it is None (N).
5. Print the corresponding category character after printing the reversed array.



Input Format

- An integer n.
- n integers representing the elements of the array.



Output Format

- First, print the array in reverse order with spaces.
- Then print a single character on a new line representing the category:
  A, D, B, or N.


Assumptions on Input

- 1 <= n <= 10^5
- Elements are integers.

Student submission:
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
    cin>>arr[i];
}


int arr2[n];
for(int i=0;i<n;i++)
{
    arr2[i]=arr[n-i-1];
}
for(int i=0;i<n;i++)
{
    cout<<arr2[i]<<" ";
}
cout<<endl;
int p=0;
for(int i=0;i<n;i++)
{
    if(arr[i]==arr2[i]){
        p++;
    }
}
sort(arr2,arr2+n);
int k=0;int m=0;int j=0;
for(int i=0;i<n;i++)
{
    if(arr2[i]==arr[i]){
    k++;}
    if(arr2[i]==arr[n-i-1]){
    m++;
    }
}
if(p==n){cout<<"B";}
else if(k==n){cout<<"A";}
else if(m==n){cout<<"D";}
else {cout<<"N";}


return 0;
}

Grading criterion: Traversing of the loop
Rating A: correctly traverses the loop n times
Rating B: Some issue.
Rating C: Major issue.
Rating D: 0
Assigned grade: A
Problem: You are given a sequence of integers. Your task is to analyze the order of the elements in the sequence, print the sequence in reverse order, and determine the category of the sequence based on how the elements are arranged.



Categories

After reading the sequence, determine which of the following categories it belongs to:

A - Ascending Order  
   All elements are in strictly increasing order.

D - Descending Order  
   All elements are in strictly decreasing order.

B - Constant Order  
   All elements are equal.

N - None  
   The sequence does not belong to any of the above categories.



Your Task

1. Read an integer n representing the number of elements.
2. Read n integers into an array or vector.
3. Print the elements in reverse order.
4. Traverse the array to determine its category:
   - If every next element is greater than the previous, it is Ascending (A).
   - If every next element is smaller than the previous, it is Descending (D).
   - If all elements are equal, it is Constant (B).
   - Otherwise, it is None (N).
5. Print the corresponding category character after printing the reversed array.



Input Format

- An integer n.
- n integers representing the elements of the array.



Output Format

- First, print the array in reverse order with spaces.
- Then print a single character on a new line representing the category:
  A, D, B, or N.


Assumptions on Input

- 1 <= n <= 10^5
- Elements are integers.

Student submission:
#include<iostream>
using namespace std;
int main(){
    int n;
    cin>>n;
    int nums[n];
    for(int i=0;i<n;i++){
        cin>>nums[i];
    }
    for(int i=n-1;i>=0;i--){
        cout<<nums[i]<<" ";
    }
    bool t1;
    bool t2;
    bool t3;
    
        for(int i=0;i<n-1;i++){
       if( nums[i]!=nums[i+1]){
t1=false;
       }
       else if(nums[i]>nums[i+1]){
        t3=false;
        t2=true;
       }
       else if(nums[i]<nums[i+1])
       {
        t2=false;
        t3=true;
       }
        }

    
    if(t1==1){
        cout<<" "<<endl<<"B";
    }
    if(t2==1){
        cout<<" "<<endl<<"A";
    }
    if(t3==1){
        cout<<" "<<endl<<"D";

    }
    else cout<<" "<<endl<<"N";
}

Grading criterion: Traversing of the loop
Rating A: correctly traverses the loop n times
Rating B: Some issue.
Rating C: Major issue.
Rating D: 0
Assigned grade: A
Problem: You are given a sequence of integers. Your task is to analyze the order of the elements in the sequence, print the sequence in reverse order, and determine the category of the sequence based on how the elements are arranged.



Categories

After reading the sequence, determine which of the following categories it belongs to:

A - Ascending Order  
   All elements are in strictly increasing order.

D - Descending Order  
   All elements are in strictly decreasing order.

B - Constant Order  
   All elements are equal.

N - None  
   The sequence does not belong to any of the above categories.



Your Task

1. Read an integer n representing the number of elements.
2. Read n integers into an array or vector.
3. Print the elements in reverse order.
4. Traverse the array to determine its category:
   - If every next element is greater than the previous, it is Ascending (A).
   - If every next element is smaller than the previous, it is Descending (D).
   - If all elements are equal, it is Constant (B).
   - Otherwise, it is None (N).
5. Print the corresponding category character after printing the reversed array.



Input Format

- An integer n.
- n integers representing the elements of the array.



Output Format

- First, print the array in reverse order with spaces.
- Then print a single character on a new line representing the category:
  A, D, B, or N.


Assumptions on Input

- 1 <= n <= 10^5
- Elements are integers.

Student submission:
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int* arr = new int[n];
for(int i = 0; i < n; i++){
    int number;
    cin >> number;
    arr[i] = number;
}
for(int i = 0; i < n; i++){
    if (i != n-1){
        cout << arr[n-1-i] << " ";
    }
    else{
        cout << arr[n-1-i] << endl;
    }
}
char t;
for(int i = 0; i < n-1; i++){
    t = 'B';
    if(arr[i] != arr[i+1]) {
        t = 'N';
        break;
    } 
}
if(t == 'N'){
    for(int i = 0; i < n-1; i++){
        t = 'A';
        if(arr[i] <= arr[i+1]) {
            
        }
        else{
            t = 'N';
            break;
        } 
    }
}
if(t == 'N'){
    for(int i = 0; i < n-1; i++){
        t = 'D';
        if(arr[i] >= arr[i+1]) {
            
        }
        else{
            t = 'N';
            break;
        } 
    }
}
cout << t;
}

Grading criterion: Traversing of the loop
Rating A: correctly traverses the loop n times
Rating B: Some issue.
Rating C: Major issue.
Rating D: 0
Assigned grade: A
Problem: You are given a sequence of integers. Your task is to analyze the order of the elements in the sequence, print the sequence in reverse order, and determine the category of the sequence based on how the elements are arranged.



Categories

After reading the sequence, determine which of the following categories it belongs to:

A - Ascending Order  
   All elements are in strictly increasing order.

D - Descending Order  
   All elements are in strictly decreasing order.

B - Constant Order  
   All elements are equal.

N - None  
   The sequence does not belong to any of the above categories.



Your Task

1. Read an integer n representing the number of elements.
2. Read n integers into an array or vector.
3. Print the elements in reverse order.
4. Traverse the array to determine its category:
   - If every next element is greater than the previous, it is Ascending (A).
   - If every next element is smaller than the previous, it is Descending (D).
   - If all elements are equal, it is Constant (B).
   - Otherwise, it is None (N).
5. Print the corresponding category character after printing the reversed array.



Input Format

- An integer n.
- n integers representing the elements of the array.



Output Format

- First, print the array in reverse order with spaces.
- Then print a single character on a new line representing the category:
  A, D, B, or N.


Assumptions on Input

- 1 <= n <= 10^5
- Elements are integers.

Student submission:
#include<iostream>
using namespace std;
int main(){
    int n;
    cin>>n;
    int nums[n];
    for(int i=0;i<n;i++){
        cin>>nums[i];
    }
    for(int j=n-1;j>=0;j--){
        cout<<nums[j]<<" ";
    }
    for(int i=1;i<n;i++){
        if(nums[i-1]==nums[n-i]){
            cout<<"B";
        }
    }
        for(int i=1;i<n;i++){
        if(nums[i-1]<=nums[n-i]){
            cout<<"A";
        }
}
    for(int i=1;i<n;i++){
        if(nums[i-1]>=nums[n-i]){
            cout<<"D";
        }
    }
        
}

Grading criterion: Traversing of the loop
Rating A: correctly traverses the loop n times
Rating B: Some issue.
Rating C: Major issue.
Rating D: 0
Assigned grade: A
Problem: You are given a sequence of integers. Your task is to analyze the order of the elements in the sequence, print the sequence in reverse order, and determine the category of the sequence based on how the elements are arranged.



Categories

After reading the sequence, determine which of the following categories it belongs to:

A - Ascending Order  
   All elements are in strictly increasing order.

D - Descending Order  
   All elements are in strictly decreasing order.

B - Constant Order  
   All elements are equal.

N - None  
   The sequence does not belong to any of the above categories.



Your Task

1. Read an integer n representing the number of elements.
2. Read n integers into an array or vector.
3. Print the elements in reverse order.
4. Traverse the array to determine its category:
   - If every next element is greater than the previous, it is Ascending (A).
   - If every next element is smaller than the previous, it is Descending (D).
   - If all elements are equal, it is Constant (B).
   - Otherwise, it is None (N).
5. Print the corresponding category character after printing the reversed array.



Input Format

- An integer n.
- n integers representing the elements of the array.



Output Format

- First, print the array in reverse order with spaces.
- Then print a single character on a new line representing the category:
  A, D, B, or N.


Assumptions on Input

- 1 <= n <= 10^5
- Elements are integers.

Student submission:
#include<iostream>
int main()
{
 int n;
 std::cin>>n;
 int nums[n];
 int c=0;
 int d=0;
 int e=0;
 for(int i=0;i<n;i++)
 {
    std::cin>>nums[i];
 }
 for(int j=n-1;j>=0;j--)
 {
   std::cout<<nums[j];
 }
 for(int i=0;i<n;i++)
 {
    if(nums[i]<nums[i+1])
        c++;
    else if(nums[i]>nums[i+1])
        d++;
    else if(nums[i]==nums[i+1])
       e++;
 }
 if(c==(n-1))
 std::cout<<"A";
 else if(d==(n-1))
 std::cout<<"D";
 else if(e==(n-1))
 std::cout<<"B";
 else
 std::cout<<"N";
 return 0;
}

Grading criterion: Traversing of the loop
Rating A: correctly traverses the loop n times
Rating B: Some issue.
Rating C: Major issue.
Rating D: 0
Assigned grade: A
Problem: You are given a sequence of integers. Your task is to analyze the order of the elements in the sequence, print the sequence in reverse order, and determine the category of the sequence based on how the elements are arranged.



Categories

After reading the sequence, determine which of the following categories it belongs to:

A - Ascending Order  
   All elements are in strictly increasing order.

D - Descending Order  
   All elements are in strictly decreasing order.

B - Constant Order  
   All elements are equal.

N - None  
   The sequence does not belong to any of the above categories.



Your Task

1. Read an integer n representing the number of elements.
2. Read n integers into an array or vector.
3. Print the elements in reverse order.
4. Traverse the array to determine its category:
   - If every next element is greater than the previous, it is Ascending (A).
   - If every next element is smaller than the previous, it is Descending (D).
   - If all elements are equal, it is Constant (B).
   - Otherwise, it is None (N).
5. Print the corresponding category character after printing the reversed array.



Input Format

- An integer n.
- n integers representing the elements of the array.



Output Format

- First, print the array in reverse order with spaces.
- Then print a single character on a new line representing the category:
  A, D, B, or N.


Assumptions on Input

- 1 <= n <= 10^5
- Elements are integers.

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

int main(){
    int n; cin>>n;
    int c1=0,c2=0,c3=0,c4=0;
    vector<int> nums;
    for(int i=0;i<n;i++){
        int a; cin>>a;
        nums.push_back(a);
    }

    for(int i=n-1; i>=0; i--)
        cout<<nums[i]<<" ";
    cout<<endl;

    bool asc=true, desc=true;
    for(int i=0;i<n-1;i++){
        if(nums[i]>nums[i+1])
            c1++;
        if(nums[i]<nums[i+1])
            c2++;
        if(nums[i]>=nums[i+1])
            c3++;
        if(nums[i]<=nums[i+1])
            c4++;
    }

    if(c1==n-1 || c2==n-1)
        cout<<"B";
    else if(c3==n-1)
        cout<<"D";
    else if(c4==n-1)
        cout<<"A";
    else    
        cout<<"N";
}

Grading criterion: Traversing of the loop
Rating A: correctly traverses the loop n times
Rating B: Some issue.
Rating C: Major issue.
Rating D: 0
Assigned grade: A
Problem: You are given a sequence of integers. Your task is to analyze the order of the elements in the sequence, print the sequence in reverse order, and determine the category of the sequence based on how the elements are arranged.



Categories

After reading the sequence, determine which of the following categories it belongs to:

A - Ascending Order  
   All elements are in strictly increasing order.

D - Descending Order  
   All elements are in strictly decreasing order.

B - Constant Order  
   All elements are equal.

N - None  
   The sequence does not belong to any of the above categories.



Your Task

1. Read an integer n representing the number of elements.
2. Read n integers into an array or vector.
3. Print the elements in reverse order.
4. Traverse the array to determine its category:
   - If every next element is greater than the previous, it is Ascending (A).
   - If every next element is smaller than the previous, it is Descending (D).
   - If all elements are equal, it is Constant (B).
   - Otherwise, it is None (N).
5. Print the corresponding category character after printing the reversed array.



Input Format

- An integer n.
- n integers representing the elements of the array.



Output Format

- First, print the array in reverse order with spaces.
- Then print a single character on a new line representing the category:
  A, D, B, or N.


Assumptions on Input

- 1 <= n <= 10^5
- Elements are integers.

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

int main(){
    const int max=1000;
    int nums[max];
    int n;
    bool a1=true;
    bool a2=true;
    bool a3=true;
    cin>>n;
    for(int i=0; i<n; ++i){
        cin>> nums[i];
    }
    for(int i=(n-1) ; i>=0; --i){
        cout<< nums[i]<<" ";
    }
    cout<<endl;

    for (int i=0; i< (n-1); ++i){
        if(!((nums[i]<nums[i+1]) &&(nums[i]==nums[i+1]))){
            bool a1=false;
        }
        else if(!((nums[i]>nums[i+1]) &&(nums[i]==nums[i+1]))){
            bool a2=false;
        }
        else if(!(nums[i]==nums[i+1])){
            bool a3=false;
        }
    }
    if (a1){
        cout<<"A"<<endl;
    }
    else if(a2){
        cout<<"D"<<endl;
    }
    else if(a3){
        cout<<"B"<<endl;
    }
    else{
        cout<<"N"<<endl;
    }
}

Grading criterion: Traversing of the loop
Rating A: correctly traverses the loop n times
Rating B: Some issue.
Rating C: Major issue.
Rating D: 0
Assigned grade: A
Problem: You are given a sequence of integers. Your task is to analyze the order of the elements in the sequence, print the sequence in reverse order, and determine the category of the sequence based on how the elements are arranged.



Categories

After reading the sequence, determine which of the following categories it belongs to:

A - Ascending Order  
   All elements are in strictly increasing order.

D - Descending Order  
   All elements are in strictly decreasing order.

B - Constant Order  
   All elements are equal.

N - None  
   The sequence does not belong to any of the above categories.



Your Task

1. Read an integer n representing the number of elements.
2. Read n integers into an array or vector.
3. Print the elements in reverse order.
4. Traverse the array to determine its category:
   - If every next element is greater than the previous, it is Ascending (A).
   - If every next element is smaller than the previous, it is Descending (D).
   - If all elements are equal, it is Constant (B).
   - Otherwise, it is None (N).
5. Print the corresponding category character after printing the reversed array.



Input Format

- An integer n.
- n integers representing the elements of the array.



Output Format

- First, print the array in reverse order with spaces.
- Then print a single character on a new line representing the category:
  A, D, B, or N.


Assumptions on Input

- 1 <= n <= 10^5
- Elements are integers.

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

void result(int A[],int n){
    int h=A[0];
    bool letter1=true;
    for(int i=0;i<n;i=i+1){
        if (A[i]!=h){
            letter1=false;
            break;
        }
    }
    if (letter1==true){
        cout<<'B'<<endl;
        return;
    }
    bool letter2=true;
    for(int i=0;i<n-1;i=i+1){
        if(A[i+1]<A[i]){
            letter2=false;
            break;
        }
    }
    if (letter2==true){
        cout<<'A'<<endl;
        return;
    }

    bool letter3=true;
    for(int i=0;i<n-1;i=i+1){
        if(A[i+1]>A[i]){
            letter3=false;
            break;
        }
    }
    if (letter3==true){
        cout<<'D'<<endl;
        return;
    }
    cout<<'N'<<endl;
}

void printer(int A[],int n){
    for(int i=1;i<=n;i=i+1){
        cout<<A[n-i]<<" ";
    }
}
int main(){
    int n;
    cin>>n;
    int A[n];
    for(int x=0;x<n;x=x+1){
        int j;
        cin>>j;
        A[x]=j;
    }
    printer(A,n);
    result(A,n);
    
}

Grading criterion: Traversing of the loop
Rating A: correctly traverses the loop n times
Rating B: Some issue.
Rating C: Major issue.
Rating D: 0
Assigned grade: A