CodeGraderBench/CodeGraderBench huggingface dataset:
Problem: In the 100-meter Olympic finals, a runner's performance is measured by their finish time in seconds. Over the years, multiple gold medalists have recorded their times. A performance is considered a record-breaking run if its finish time is strictly less than all previous recorded times.

You are given the times recorded by the gold medalists in chronological order. Your task is to determine how many record-breaking runs occurred. The first recorded time is always considered a record-breaking run.

Input Format

The first line contains an integer n, the number of recorded times.

The second line contains n real numbers (floating-point values) separated by spaces, representing the times recorded by the gold medalists in chronological order.

Output Format

Output a single integer representing the total number of record-breaking runs.

Assumptions on Input

1. 1 <= n <= 100000  
2. Each recorded time is a positive real number between 9.0 and 15.0.  
3. Times are given in chronological order.  
4. The first time is always counted as a record-breaking run.

Note:

- Do not print any extra messages or prompts.
- Use cout only to print the final output.
- Do not hard-code results.
- The solution must use proper logic to determine record-breaking runs.

Student submission:
#include<simplecpp>
main_program{
        long int n,i=0;
        int count=0;
        float k,s=15;
        cin>>n;
        while(i<n){
             cin>>k;
             if(k<s){
                     s=k;
                     count= count + 1;
             }
             i=i+1;
        }
        cout<<count;
}

Grading criterion: Counter for record breaking runs
Rating A: Correctly increments the variable that maintains the counter for record breaking runs and prints it

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A
Problem: In the 100-meter Olympic finals, a runner's performance is measured by their finish time in seconds. Over the years, multiple gold medalists have recorded their times. A performance is considered a record-breaking run if its finish time is strictly less than all previous recorded times.

You are given the times recorded by the gold medalists in chronological order. Your task is to determine how many record-breaking runs occurred. The first recorded time is always considered a record-breaking run.

Input Format

The first line contains an integer n, the number of recorded times.

The second line contains n real numbers (floating-point values) separated by spaces, representing the times recorded by the gold medalists in chronological order.

Output Format

Output a single integer representing the total number of record-breaking runs.

Assumptions on Input

1. 1 <= n <= 100000  
2. Each recorded time is a positive real number between 9.0 and 15.0.  
3. Times are given in chronological order.  
4. The first time is always counted as a record-breaking run.

Note:

- Do not print any extra messages or prompts.
- Use cout only to print the final output.
- Do not hard-code results.
- The solution must use proper logic to determine record-breaking runs.

Student submission:
#include <simplecpp>

main_program{
    int n;
    cin >> n;
    int recordBreaks = 0;
    double lowestTime = 9999999.0;
    repeat(n){
        float currentTime;
        cin >> currentTime;
        if(currentTime < lowestTime){
            recordBreaks++;
            lowestTime = currentTime;
        }
    }
    cout << recordBreaks;
}

Grading criterion: Counter for record breaking runs
Rating A: Correctly increments the variable that maintains the counter for record breaking runs and prints it

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A
Problem: In the 100-meter Olympic finals, a runner's performance is measured by their finish time in seconds. Over the years, multiple gold medalists have recorded their times. A performance is considered a record-breaking run if its finish time is strictly less than all previous recorded times.

You are given the times recorded by the gold medalists in chronological order. Your task is to determine how many record-breaking runs occurred. The first recorded time is always considered a record-breaking run.

Input Format

The first line contains an integer n, the number of recorded times.

The second line contains n real numbers (floating-point values) separated by spaces, representing the times recorded by the gold medalists in chronological order.

Output Format

Output a single integer representing the total number of record-breaking runs.

Assumptions on Input

1. 1 <= n <= 100000  
2. Each recorded time is a positive real number between 9.0 and 15.0.  
3. Times are given in chronological order.  
4. The first time is always counted as a record-breaking run.

Note:

- Do not print any extra messages or prompts.
- Use cout only to print the final output.
- Do not hard-code results.
- The solution must use proper logic to determine record-breaking runs.

Student submission:
#include<simplecpp>
main_program{
    int n;
    cin>>n;
    float
    }

Grading criterion: Counter for record breaking runs
Rating A: Correctly increments the variable that maintains the counter for record breaking runs and prints it

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: C
Problem: In the 100-meter Olympic finals, a runner's performance is measured by their finish time in seconds. Over the years, multiple gold medalists have recorded their times. A performance is considered a record-breaking run if its finish time is strictly less than all previous recorded times.

You are given the times recorded by the gold medalists in chronological order. Your task is to determine how many record-breaking runs occurred. The first recorded time is always considered a record-breaking run.

Input Format

The first line contains an integer n, the number of recorded times.

The second line contains n real numbers (floating-point values) separated by spaces, representing the times recorded by the gold medalists in chronological order.

Output Format

Output a single integer representing the total number of record-breaking runs.

Assumptions on Input

1. 1 <= n <= 100000  
2. Each recorded time is a positive real number between 9.0 and 15.0.  
3. Times are given in chronological order.  
4. The first time is always counted as a record-breaking run.

Note:

- Do not print any extra messages or prompts.
- Use cout only to print the final output.
- Do not hard-code results.
- The solution must use proper logic to determine record-breaking runs.

Student submission:
#include<simplecpp>
main_program{
        int n;
        float x;
        int cont;
        cont=1;
        float temp;
        temp=0;
        cin>> n;
        cout<<endl;
        cin>>x;
        repeat(n-1){
                if(x<temp)
                {
                cont=cont+1;}
                temp=x;
                cin>>x;}
        if(x<temp)
        {cont=cont+1;}
        cout<< cont;}

Grading criterion: Counter for record breaking runs
Rating A: Correctly increments the variable that maintains the counter for record breaking runs and prints it

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A
Problem: In the 100-meter Olympic finals, a runner's performance is measured by their finish time in seconds. Over the years, multiple gold medalists have recorded their times. A performance is considered a record-breaking run if its finish time is strictly less than all previous recorded times.

You are given the times recorded by the gold medalists in chronological order. Your task is to determine how many record-breaking runs occurred. The first recorded time is always considered a record-breaking run.

Input Format

The first line contains an integer n, the number of recorded times.

The second line contains n real numbers (floating-point values) separated by spaces, representing the times recorded by the gold medalists in chronological order.

Output Format

Output a single integer representing the total number of record-breaking runs.

Assumptions on Input

1. 1 <= n <= 100000  
2. Each recorded time is a positive real number between 9.0 and 15.0.  
3. Times are given in chronological order.  
4. The first time is always counted as a record-breaking run.

Note:

- Do not print any extra messages or prompts.
- Use cout only to print the final output.
- Do not hard-code results.
- The solution must use proper logic to determine record-breaking runs.

Student submission:
#include<simplecpp>
main_program{
        int n,i=1;
        float curr, prev;
        cin >> n;
        cin >> prev;
        repeat(n-1){
                cin >> curr;
                if(curr<prev){
                        i++;
                        prev=curr;
                }
        }
        cout << i << endl;
}

Grading criterion: Counter for record breaking runs
Rating A: Correctly increments the variable that maintains the counter for record breaking runs and prints it

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A
Problem: In the 100-meter Olympic finals, a runner's performance is measured by their finish time in seconds. Over the years, multiple gold medalists have recorded their times. A performance is considered a record-breaking run if its finish time is strictly less than all previous recorded times.

You are given the times recorded by the gold medalists in chronological order. Your task is to determine how many record-breaking runs occurred. The first recorded time is always considered a record-breaking run.

Input Format

The first line contains an integer n, the number of recorded times.

The second line contains n real numbers (floating-point values) separated by spaces, representing the times recorded by the gold medalists in chronological order.

Output Format

Output a single integer representing the total number of record-breaking runs.

Assumptions on Input

1. 1 <= n <= 100000  
2. Each recorded time is a positive real number between 9.0 and 15.0.  
3. Times are given in chronological order.  
4. The first time is always counted as a record-breaking run.

Note:

- Do not print any extra messages or prompts.
- Use cout only to print the final output.
- Do not hard-code results.
- The solution must use proper logic to determine record-breaking runs.

Student submission:
#include<simplecpp>
main_program{
        int n;
        float t1,t2;
        int c = 0;
        cin >> n;
        cin >> t1;
        for(int i = 0; i<(n-1); i++){
                cin >> t2;
                if(t2 < t1){
                        c++;
                }
                t1 = t2;
        }
        cout << c+1 << endl;
}

Grading criterion: Counter for record breaking runs
Rating A: Correctly increments the variable that maintains the counter for record breaking runs and prints it

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A
Problem: In the 100-meter Olympic finals, a runner's performance is measured by their finish time in seconds. Over the years, multiple gold medalists have recorded their times. A performance is considered a record-breaking run if its finish time is strictly less than all previous recorded times.

You are given the times recorded by the gold medalists in chronological order. Your task is to determine how many record-breaking runs occurred. The first recorded time is always considered a record-breaking run.

Input Format

The first line contains an integer n, the number of recorded times.

The second line contains n real numbers (floating-point values) separated by spaces, representing the times recorded by the gold medalists in chronological order.

Output Format

Output a single integer representing the total number of record-breaking runs.

Assumptions on Input

1. 1 <= n <= 100000  
2. Each recorded time is a positive real number between 9.0 and 15.0.  
3. Times are given in chronological order.  
4. The first time is always counted as a record-breaking run.

Note:

- Do not print any extra messages or prompts.
- Use cout only to print the final output.
- Do not hard-code results.
- The solution must use proper logic to determine record-breaking runs.

Student submission:
#include<simplecpp>

main_program {
    int n;
    cin >> n;
    float a,c;
    int b=1;
    c=a;
    for(int j=0 ; j<n; j++) {
    cin >> a;
    if (a<c) {
        b++;
    }
    else {b=b-0;}
    c=a;
}
cout << b;
}

Grading criterion: Counter for record breaking runs
Rating A: Correctly increments the variable that maintains the counter for record breaking runs and prints it

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A
Problem: In the 100-meter Olympic finals, a runner's performance is measured by their finish time in seconds. Over the years, multiple gold medalists have recorded their times. A performance is considered a record-breaking run if its finish time is strictly less than all previous recorded times.

You are given the times recorded by the gold medalists in chronological order. Your task is to determine how many record-breaking runs occurred. The first recorded time is always considered a record-breaking run.

Input Format

The first line contains an integer n, the number of recorded times.

The second line contains n real numbers (floating-point values) separated by spaces, representing the times recorded by the gold medalists in chronological order.

Output Format

Output a single integer representing the total number of record-breaking runs.

Assumptions on Input

1. 1 <= n <= 100000  
2. Each recorded time is a positive real number between 9.0 and 15.0.  
3. Times are given in chronological order.  
4. The first time is always counted as a record-breaking run.

Note:

- Do not print any extra messages or prompts.
- Use cout only to print the final output.
- Do not hard-code results.
- The solution must use proper logic to determine record-breaking runs.

Student submission:
#include<simplecpp>
main_program{
	int n;
	cin>>n;
	char t;
	char a=20.0;
    int count=0;
	while (n>=0){
		cin>>t;
		if (t<a) count=count+1;
		a=t;
		n=n-1;
	}
	cout<<count;
}

Grading criterion: Counter for record breaking runs
Rating A: Correctly increments the variable that maintains the counter for record breaking runs and prints it

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: C
Problem: In the 100-meter Olympic finals, a runner's performance is measured by their finish time in seconds. Over the years, multiple gold medalists have recorded their times. A performance is considered a record-breaking run if its finish time is strictly less than all previous recorded times.

You are given the times recorded by the gold medalists in chronological order. Your task is to determine how many record-breaking runs occurred. The first recorded time is always considered a record-breaking run.

Input Format

The first line contains an integer n, the number of recorded times.

The second line contains n real numbers (floating-point values) separated by spaces, representing the times recorded by the gold medalists in chronological order.

Output Format

Output a single integer representing the total number of record-breaking runs.

Assumptions on Input

1. 1 <= n <= 100000  
2. Each recorded time is a positive real number between 9.0 and 15.0.  
3. Times are given in chronological order.  
4. The first time is always counted as a record-breaking run.

Note:

- Do not print any extra messages or prompts.
- Use cout only to print the final output.
- Do not hard-code results.
- The solution must use proper logic to determine record-breaking runs.

Student submission:
#include<simplecpp>
main_program
{
        int n;
        cin >> n;
        float t1;
        cin >> t1;
        float t;
        int count=1;
        for(int i=1;i<n;i++)
        {
                cin >> t;
                if(t<t1)
                        count++;
        }
        cout << count << endl;
}

Grading criterion: Counter for record breaking runs
Rating A: Correctly increments the variable that maintains the counter for record breaking runs and prints it

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A
Problem: In the 100-meter Olympic finals, a runner's performance is measured by their finish time in seconds. Over the years, multiple gold medalists have recorded their times. A performance is considered a record-breaking run if its finish time is strictly less than all previous recorded times.

You are given the times recorded by the gold medalists in chronological order. Your task is to determine how many record-breaking runs occurred. The first recorded time is always considered a record-breaking run.

Input Format

The first line contains an integer n, the number of recorded times.

The second line contains n real numbers (floating-point values) separated by spaces, representing the times recorded by the gold medalists in chronological order.

Output Format

Output a single integer representing the total number of record-breaking runs.

Assumptions on Input

1. 1 <= n <= 100000  
2. Each recorded time is a positive real number between 9.0 and 15.0.  
3. Times are given in chronological order.  
4. The first time is always counted as a record-breaking run.

Note:

- Do not print any extra messages or prompts.
- Use cout only to print the final output.
- Do not hard-code results.
- The solution must use proper logic to determine record-breaking runs.

Student submission:
#include<simplecpp>
main_program{
    int n,rec=1;
    float prev,now;
    cin>>n;
    cin>>now;
    prev=now;
    while(n>1){
        cin>>now;
        if(prev>now){
            rec=rec+1;
            prev=now;
            n=n-1;
        }
        else{
            n=n-1;
        }
    }
    cout<<rec<<endl;
}

Grading criterion: Counter for record breaking runs
Rating A: Correctly increments the variable that maintains the counter for record breaking runs and prints it

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A
Problem: In the 100-meter Olympic finals, a runner's performance is measured by their finish time in seconds. Over the years, multiple gold medalists have recorded their times. A performance is considered a record-breaking run if its finish time is strictly less than all previous recorded times.

You are given the times recorded by the gold medalists in chronological order. Your task is to determine how many record-breaking runs occurred. The first recorded time is always considered a record-breaking run.

Input Format

The first line contains an integer n, the number of recorded times.

The second line contains n real numbers (floating-point values) separated by spaces, representing the times recorded by the gold medalists in chronological order.

Output Format

Output a single integer representing the total number of record-breaking runs.

Assumptions on Input

1. 1 <= n <= 100000  
2. Each recorded time is a positive real number between 9.0 and 15.0.  
3. Times are given in chronological order.  
4. The first time is always counted as a record-breaking run.

Note:

- Do not print any extra messages or prompts.
- Use cout only to print the final output.
- Do not hard-code results.
- The solution must use proper logic to determine record-breaking runs.

Student submission:
#include<simplecpp>
main_program{
        int n, count=1 ;
        cin>> n;
        float i, d=0;
        cin >> i ;
        while ( i-d <0){
                d=i-d ;
                count = count +1 ;
                cin>> i ;
        }
        cout << count << endl;
}

Grading criterion: Counter for record breaking runs
Rating A: Correctly increments the variable that maintains the counter for record breaking runs and prints it

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: C
Problem: In the 100-meter Olympic finals, a runner's performance is measured by their finish time in seconds. Over the years, multiple gold medalists have recorded their times. A performance is considered a record-breaking run if its finish time is strictly less than all previous recorded times.

You are given the times recorded by the gold medalists in chronological order. Your task is to determine how many record-breaking runs occurred. The first recorded time is always considered a record-breaking run.

Input Format

The first line contains an integer n, the number of recorded times.

The second line contains n real numbers (floating-point values) separated by spaces, representing the times recorded by the gold medalists in chronological order.

Output Format

Output a single integer representing the total number of record-breaking runs.

Assumptions on Input

1. 1 <= n <= 100000  
2. Each recorded time is a positive real number between 9.0 and 15.0.  
3. Times are given in chronological order.  
4. The first time is always counted as a record-breaking run.

Note:

- Do not print any extra messages or prompts.
- Use cout only to print the final output.
- Do not hard-code results.
- The solution must use proper logic to determine record-breaking runs.

Student submission:
#include<simplecpp>
main_program
{
 int n,count=1,count_m=1;
 double R,K;
 cin>>n;
 cin>>R;
 K=R;
 while(n!=0)
 {
  cin>>R;
  if(K>R)
   count++;
  else
  {
   //count_m=count;
   count=1;
  }
  if(count_m<count)
  {
   count_m=count;
   count=1;
  }
   n--;
 }
 cout<<count_m<<endl;
}

Grading criterion: Counter for record breaking runs
Rating A: Correctly increments the variable that maintains the counter for record breaking runs and prints it

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: B
Problem: In the 100-meter Olympic finals, a runner's performance is measured by their finish time in seconds. Over the years, multiple gold medalists have recorded their times. A performance is considered a record-breaking run if its finish time is strictly less than all previous recorded times.

You are given the times recorded by the gold medalists in chronological order. Your task is to determine how many record-breaking runs occurred. The first recorded time is always considered a record-breaking run.

Input Format

The first line contains an integer n, the number of recorded times.

The second line contains n real numbers (floating-point values) separated by spaces, representing the times recorded by the gold medalists in chronological order.

Output Format

Output a single integer representing the total number of record-breaking runs.

Assumptions on Input

1. 1 <= n <= 100000  
2. Each recorded time is a positive real number between 9.0 and 15.0.  
3. Times are given in chronological order.  
4. The first time is always counted as a record-breaking run.

Note:

- Do not print any extra messages or prompts.
- Use cout only to print the final output.
- Do not hard-code results.
- The solution must use proper logic to determine record-breaking runs.

Student submission:
#include <simplecpp>
 main_program{
  int n , i=1 , rbt = 1 ;
  float time , rec ;
   cin >> n ;
   cin >> rec;
   while(n>i){
           cin >> time;
           if(time<rec){
                   rec = time;
                   rbt++;
                 }
           i++;

          }
   cout << rbt ;
 }

Grading criterion: Counter for record breaking runs
Rating A: Correctly increments the variable that maintains the counter for record breaking runs and prints it

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A