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{
        int n, count=1;
        float curr, record;
        cin>>n;
        cin>>record;
        for(int i=1; i<n; i++){
                cin>>curr;
                if (curr<record){
                        count++;
                        record=curr;}
        }
        cout<<count<<endl;
}

Grading criterion: Record breaking Run
Rating A: Correctly checks whether current run entered is the record breaking run or not and if yes, notes it as the best time

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{
        double c,c1;
        int a,b=1;
        int br=1;
        cin>>a;
        cin>>c1;
        while(a>b){
                cin>>c;
                if(c<c1){
                br+=1;
                }
                c1=c;
                b=b+1;
                }
        cout<<br;
}

Grading criterion: Record breaking Run
Rating A: Correctly checks whether current run entered is the record breaking run or not and if yes, notes it as the best time

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, ans ;
        ans = 0;
        float timerecorded=1000;// initial high so that first one is also a record.
        cin >> n ;
        for(int i=1 ; i<=n ; i++){
                float x;
                x= timerecorded;
                cin >> timerecorded;
                if (timerecorded < x){
                        ans = ans + 1;}
                else {
                        continue;}
        }
        cout << ans << endl;
}

Grading criterion: Record breaking Run
Rating A: Correctly checks whether current run entered is the record breaking run or not and if yes, notes it as the best time

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=0;
float N=0;
float FIRST=0;
int count=1;

cin >> n;
cin >> FIRST;

repeat(n-1){
    cin >> N;
    if(N<FIRST){
        count = count + 1;
    }
    else continue;
}
cout << count << endl;
}

Grading criterion: Record breaking Run
Rating A: Correctly checks whether current run entered is the record breaking run or not and if yes, notes it as the best time

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 , record = 0 ;
    cin >> n ;
    float t[n];
    for(int i = 0 ; i < n ; i++){
        cin >> t[i] ;
    }
    for(int i = 0 , temp = 0 ; i< n ; i++ ){
        for ( int j = 0   ; j < i ; j++) {
            if ( t [i] < t[j]){
                temp ++ ;
            }
        }
        if(temp == i ){
            record ++;
        }
        temp = 0 ;
    }
    cout<< record << endl ;
}

Grading criterion: Record breaking Run
Rating A: Correctly checks whether current run entered is the record breaking run or not and if yes, notes it as the best time

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 num, i = 1 ;float n1=0,n2 ; cin>> num ;
        repeat(num){
                cin >> n2 ;
                if((n2-n1) < 0){
                         i++ ;
                         n1 = n2;
                }
                n1 = n2 ;

        }
        cout << i ;
}

Grading criterion: Record breaking Run
Rating A: Correctly checks whether current run entered is the record breaking run or not and if yes, notes it as the best time

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 time;
    int b=1;
    float c=0;
    cin>>time;
    c=time;
    repeat(n-1){
        if(time<c){
            c=time;
            b++;
        }
    cin>>time;
    }
    if(time<c){
        b++;
    }
cout<< b << endl;
}

Grading criterion: Record breaking Run
Rating A: Correctly checks whether current run entered is the record breaking run or not and if yes, notes it as the best time

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 currentRecord = 0;
	float goldTime;
	int records = 0;
	cin >> n;
	cin >> currentRecord;
	records++;
	repeat(n-1){
		cin >> goldTime;
		if(goldTime < currentRecord){
			records++;
			currentRecord = goldTime;
		}
	}
	cout << records << endl;
}

Grading criterion: Record breaking Run
Rating A: Correctly checks whether current run entered is the record breaking run or not and if yes, notes it as the best time

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 a,b,c,d,e;
    cin>>n;
    t=0
    for(int i=1;i<=n;i++){
    cin>> a,b,c,d,e;
    if (b<=a){
    t+=1
    cout<<t;}
    else if(c<=a){
    t+=1}
    else if(d<=a){
    t+=1}
    else if(e<=a){
    t+=1}
    }
    cout<< t;
}

Grading criterion: Record breaking Run
Rating A: Correctly checks whether current run entered is the record breaking run or not and if yes, notes it as the best time

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,i=1;
float t,x;
cin>>n;
cin>>t;
x=t;
while (i<n)
{
  cin>>t;
  if(t<x)
  count++;
  x=t;
  i++;
  }
  cout<<count;
  }

Grading criterion: Record breaking Run
Rating A: Correctly checks whether current run entered is the record breaking run or not and if yes, notes it as the best time

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
{
        float min= 20;
        int n,rec=0;
        float num;
        cin>>n;
        for(int i=1;i<=n;i++)
        {
                cin>>num;
                if(num<min)
                {
                        min=num;
                        rec++;
                }
        }
        cout<<rec;
}

Grading criterion: Record breaking Run
Rating A: Correctly checks whether current run entered is the record breaking run or not and if yes, notes it as the best time

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 , t , minTime , nb = 1 ;
cin >> n >> minTime ;
repeat (n-1) {
cin >> t;
if( t < minTime ) nb = nb +1  ;
minTime = min(minTime , t);
}
cout<< nb ;
}

Grading criterion: Record breaking Run
Rating A: Correctly checks whether current run entered is the record breaking run or not and if yes, notes it as the best time

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; cin>>n;
    float t; cin>>t;
    int count = 1;
    while(n>1){
        float nt; cin>>nt;
        if(nt<t){
            t=nt;
            count++;
        }
        n--;
    }
    cout<<count;
}

Grading criterion: Record breaking Run
Rating A: Correctly checks whether current run entered is the record breaking run or not and if yes, notes it as the best time

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A