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,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: Loop
Rating A: Correctly loops through N times

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: Loop
Rating A: Correctly loops through N times

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 x;
	cin>>x;
	float z=15.0;
	int record=0;
	for(;x>0;){
		float y;
		cin>>y;
		x-=1;
		if(y<z){
			record+=1;
			z=y;}
	}
	cout<<record;	
}

Grading criterion: Loop
Rating A: Correctly loops through N times

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 times;
int currtime;
int result=1;
repeat(n){
        cin>>times;
        currtime=times;
        if (currtime<times){
                result+=1;
        }

}

cout<< result;

}

Grading criterion: Loop
Rating A: Correctly loops through N times

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,j,k;
    float a,c;
    i=0;
    j=0;
    c=15;
    cin >> n;
    while(true){
        if(i > (n-1)){break;}
        cin >> a;
        if(a < c){
            c=a;
            j=j+1;
        }
        k=j;
        i=i+1;
    }
    cout << k;
}

Grading criterion: Loop
Rating A: Correctly loops through N times

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 i,n,cnt=1;
 float time,time1,record;
 cin>>n;
cin>>time1;
record=time1;

 for(i=0;i<n-1;i++)
 {
    cin>>time;
    if(time<record)
    {
        record=time;
        cnt++;
    }


 }
 cout<<cnt;
}

Grading criterion: Loop
Rating A: Correctly loops through N times

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;
        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: Loop
Rating A: Correctly loops through N times

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: Loop
Rating A: Correctly loops through N times

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, 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: Loop
Rating A: Correctly loops through N times

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: Loop
Rating A: Correctly loops through N times

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 , 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: Loop
Rating A: Correctly loops through N times

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: Loop
Rating A: Correctly loops through N times

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: Loop
Rating A: Correctly loops through N times

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: Loop
Rating A: Correctly loops through N times

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A