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;
        float a;
        float b;
        int record = 1;
        cin >> n;
        cin >> a;
        b = a;
        repeat(n-1){
                cin >> b;
                if (b < a) record++;
                a = b;
        }
        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;
int count=0;
while (count<=n){
	float a;
	cin>> a;
	float rec=1;
	count=count+1;
	float b;
	cin>> b;
	if(b<a){ 
		float term=b;
	rec= rec+1;}
	else{float term=a;
	rec=rec;}
	float term=b;
	cin>> b;
	}
cout << "rec" << 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;
	cin >> n;
	float time;
	int flag = 0;
	float record = 20;
	for(int i = 1; i<=n; i++){
		cin >> time;
		if(time<record){
			record = time;
			flag+=1;
		}
		else{continue;}
	}
	cout << flag;
}

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=0;
            int count=1;
            cin >> n;
            float present,min;
            cin >> present;
            min=present;
            while(i<n) {
                       if(present < min) {
                                              min=present;
                                              count++;
                                         }
                       i++;
                       cin >> present;
                       }
            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;
        cin >> n;
        float a;
        cin>>a;
        float prevRec= a;
        int noRec=1;
        for(int i=1;i<n;i++){
                cin >> a;
                if(a<prevRec){
                        noRec++;
                        prevRec=a;
                }}
        cout<< noRec;

}

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=0 ;
float t,k=10000;
cin >> n;
repeat(n){
        cin >> t;

        if(k>t){i++;}
        k = t;
}
cout<< i << 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 turns, k = 0;
        float runtime, a = 15;
        cin >> turns;
        repeat(turns) {
                cin >> runtime;
                if (runtime <  a) {
                        a = runtime;
                        k++;
                }
        }

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

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

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{

    float e,c,a,b,n;
    cin>>n;
    b=0;
    e=0;
    cin>>c;
    while(b<n-1){
        cin>>a;
    if(a<c){
    e++;
    }
    b++;

    }
    cout<<e+1;
}

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 count=0;
        long int n;
        float time,mintime=15;
        cin>>n;
for(int i=0;i<n;i++){
        cin>>time;
        if(time<mintime){
                         count=count+1;
                         mintime=time;
                        }
        else continue;
      }
cout<<count;
}

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,record=0;
	float run,prev;
	
	cin>>n;
	
	
	for(i=0;i<n;i++)
	{
		cin>>run;

		if(i==0)
		{
			record=record+1;
			prev=run;
		}
		else
		{
			if(run<prev)
			{
				prev=run;
				record=record+1;	
			}
		}

	}
	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 n;
    cin >> n;
    double k= 0;
    int count=1;
    double temp= 0;
    cin >> k;
    temp = k;
    while(n != 1)
    {

        cin >> k;
        n--;
        if(k< temp)
        {
            count++;
            temp = k;

        }

    }
    cout << count;
}

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

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A