CodeGraderBench/CodeGraderBench huggingface dataset:
Problem: Problem Description

You are building a text analyzer tool. One of its features is detecting vowel clusters in a word.

Your task is to write a program that takes a word and counts how many vowel clusters it contains.

What is a Vowel Cluster?

A vowel cluster is a group of one or more vowels (a, e, i, o, u) that appear consecutively without any consonants in between.

Examples:

- "ae" is one vowel cluster.  
- "a" is one vowel cluster.  
- "abc" has one vowel cluster: "a".  

For example, in the word "beautiful", the vowels "eau" form one vowel cluster. Later, "i" and "u" form their own clusters. Hence, the word contains 3 vowel clusters in total.

--------------------------------------------------

Input Format

- An integer n, the length of the word.  
- A word of n lowercase English letters.

--------------------------------------------------

Output Format

- Print a single integer representing the number of vowel clusters in the word.

--------------------------------------------------

Assumptions on Input

1 <= n <= 100000  

--------------------------------------------------

Note

- Do not print any extra messages such as:
  cout << "Enter a number"
  cout << "The computed answer is"
- Use cout only to print the computed final output.
- Do not print unnecessary spaces.
- Do not hard-code the result.
- If any test case passes by simply printing output without logic, marks will not be awarded.

Student submission:
#include<simplecpp>
main_program{
char c1='b';
char c2;
int n,k=0;
cin >> n;
repeat(n){

        cin >> c2;

        if(!(c1=='a'||c1=='e'||c1=='i'||c1=='o'||c1=='u')){
                if(c2=='a'||c2=='e'||c2=='i'||c2=='o'||c2=='u'){
                k++;
                }
        }

        c1=c2;
}
cout << k << endl;
}

Grading criterion: Cluster Check
Rating A: Correctly keeps track of whether the character belongs to the vowel cluster or not. 

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A
Problem: Problem Description

You are building a text analyzer tool. One of its features is detecting vowel clusters in a word.

Your task is to write a program that takes a word and counts how many vowel clusters it contains.

What is a Vowel Cluster?

A vowel cluster is a group of one or more vowels (a, e, i, o, u) that appear consecutively without any consonants in between.

Examples:

- "ae" is one vowel cluster.  
- "a" is one vowel cluster.  
- "abc" has one vowel cluster: "a".  

For example, in the word "beautiful", the vowels "eau" form one vowel cluster. Later, "i" and "u" form their own clusters. Hence, the word contains 3 vowel clusters in total.

--------------------------------------------------

Input Format

- An integer n, the length of the word.  
- A word of n lowercase English letters.

--------------------------------------------------

Output Format

- Print a single integer representing the number of vowel clusters in the word.

--------------------------------------------------

Assumptions on Input

1 <= n <= 100000  

--------------------------------------------------

Note

- Do not print any extra messages such as:
  cout << "Enter a number"
  cout << "The computed answer is"
- Use cout only to print the computed final output.
- Do not print unnecessary spaces.
- Do not hard-code the result.
- If any test case passes by simply printing output without logic, marks will not be awarded.

Student submission:
#include<simplecpp>
int vowel(char A)
{ if (A==a ||A==e||A==i||A==o||A==u) return 1;
        else return 0;}




main_program{
        int n;
        cin>>n;
        char letter;
        int a1,b1=0,i=0;

        repeat(n){
                cin>>letter;
                a1=vowel(letter);
                if(a1==1 && b1==0){i++;}
                else {i=i;}
                int temp=b1;
                b1=a1;}

        cout<<i<<endl;}

Grading criterion: Cluster Check
Rating A: Correctly keeps track of whether the character belongs to the vowel cluster or not. 

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: C
Problem: Problem Description

You are building a text analyzer tool. One of its features is detecting vowel clusters in a word.

Your task is to write a program that takes a word and counts how many vowel clusters it contains.

What is a Vowel Cluster?

A vowel cluster is a group of one or more vowels (a, e, i, o, u) that appear consecutively without any consonants in between.

Examples:

- "ae" is one vowel cluster.  
- "a" is one vowel cluster.  
- "abc" has one vowel cluster: "a".  

For example, in the word "beautiful", the vowels "eau" form one vowel cluster. Later, "i" and "u" form their own clusters. Hence, the word contains 3 vowel clusters in total.

--------------------------------------------------

Input Format

- An integer n, the length of the word.  
- A word of n lowercase English letters.

--------------------------------------------------

Output Format

- Print a single integer representing the number of vowel clusters in the word.

--------------------------------------------------

Assumptions on Input

1 <= n <= 100000  

--------------------------------------------------

Note

- Do not print any extra messages such as:
  cout << "Enter a number"
  cout << "The computed answer is"
- Use cout only to print the computed final output.
- Do not print unnecessary spaces.
- Do not hard-code the result.
- If any test case passes by simply printing output without logic, marks will not be awarded.

Student submission:
#include<simplecpp>

bool vowelTest(char x){
    if(x=='a' || x=='e' || x=='i'|| x=='o'|| x=='u') return true;
    else return false;
}

main_program{
    char x,y='0';
    int k,n=0;
    cin>>k;
    repeat(k){
    cin>>x;
    if(vowelTest(y)==vowelTest(x) && vowelTest(x)==1) n--;
    if(vowelTest(x)==1) {
        n++;
    }  
    y=x;  
    }
    cout<<n;
}

Grading criterion: Cluster Check
Rating A: Correctly keeps track of whether the character belongs to the vowel cluster or not. 

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A
Problem: Problem Description

You are building a text analyzer tool. One of its features is detecting vowel clusters in a word.

Your task is to write a program that takes a word and counts how many vowel clusters it contains.

What is a Vowel Cluster?

A vowel cluster is a group of one or more vowels (a, e, i, o, u) that appear consecutively without any consonants in between.

Examples:

- "ae" is one vowel cluster.  
- "a" is one vowel cluster.  
- "abc" has one vowel cluster: "a".  

For example, in the word "beautiful", the vowels "eau" form one vowel cluster. Later, "i" and "u" form their own clusters. Hence, the word contains 3 vowel clusters in total.

--------------------------------------------------

Input Format

- An integer n, the length of the word.  
- A word of n lowercase English letters.

--------------------------------------------------

Output Format

- Print a single integer representing the number of vowel clusters in the word.

--------------------------------------------------

Assumptions on Input

1 <= n <= 100000  

--------------------------------------------------

Note

- Do not print any extra messages such as:
  cout << "Enter a number"
  cout << "The computed answer is"
- Use cout only to print the computed final output.
- Do not print unnecessary spaces.
- Do not hard-code the result.
- If any test case passes by simply printing output without logic, marks will not be awarded.

Student submission:
#include <simplecpp>
main_program(){
        char c,prev_c=' '; int n,i=0,count=0;
        cin>>n;
        for(i=0; i<n; i++){
                cin>>c;
                if(prev_c=='a'||prev_c=='e'||prev_c=='i'||prev_c=='o'||prev_c=='u'){
                        count=count+0;
                }
                else if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u'){
                        count=count+1;
                }
                else{
                        count=count+0;
                }
                prev_c=c;
        }
        cout<<count;
}

Grading criterion: Cluster Check
Rating A: Correctly keeps track of whether the character belongs to the vowel cluster or not. 

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: B
Problem: Problem Description

You are building a text analyzer tool. One of its features is detecting vowel clusters in a word.

Your task is to write a program that takes a word and counts how many vowel clusters it contains.

What is a Vowel Cluster?

A vowel cluster is a group of one or more vowels (a, e, i, o, u) that appear consecutively without any consonants in between.

Examples:

- "ae" is one vowel cluster.  
- "a" is one vowel cluster.  
- "abc" has one vowel cluster: "a".  

For example, in the word "beautiful", the vowels "eau" form one vowel cluster. Later, "i" and "u" form their own clusters. Hence, the word contains 3 vowel clusters in total.

--------------------------------------------------

Input Format

- An integer n, the length of the word.  
- A word of n lowercase English letters.

--------------------------------------------------

Output Format

- Print a single integer representing the number of vowel clusters in the word.

--------------------------------------------------

Assumptions on Input

1 <= n <= 100000  

--------------------------------------------------

Note

- Do not print any extra messages such as:
  cout << "Enter a number"
  cout << "The computed answer is"
- Use cout only to print the computed final output.
- Do not print unnecessary spaces.
- Do not hard-code the result.
- If any test case passes by simply printing output without logic, marks will not be awarded.

Student submission:
#include<simplecpp>
main_program{
    int n,m=0;
    cin>>n;
    char a,b;
    cin>>a;
    if((a=='a'||a=='e'||a=='i'||a=='o'||a=='u')) m++;
    for(int i=1;i<n;i++){
        b=a;
        cin>>a;
        if((a=='a'||a=='e'||a=='i'||a=='o'||a=='u')&&!(b=='a'||b=='e'||b=='i'||b=='o'||b=='u'))m++;
    }
    cout<<m;
}

Grading criterion: Cluster Check
Rating A: Correctly keeps track of whether the character belongs to the vowel cluster or not. 

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A
Problem: Problem Description

You are building a text analyzer tool. One of its features is detecting vowel clusters in a word.

Your task is to write a program that takes a word and counts how many vowel clusters it contains.

What is a Vowel Cluster?

A vowel cluster is a group of one or more vowels (a, e, i, o, u) that appear consecutively without any consonants in between.

Examples:

- "ae" is one vowel cluster.  
- "a" is one vowel cluster.  
- "abc" has one vowel cluster: "a".  

For example, in the word "beautiful", the vowels "eau" form one vowel cluster. Later, "i" and "u" form their own clusters. Hence, the word contains 3 vowel clusters in total.

--------------------------------------------------

Input Format

- An integer n, the length of the word.  
- A word of n lowercase English letters.

--------------------------------------------------

Output Format

- Print a single integer representing the number of vowel clusters in the word.

--------------------------------------------------

Assumptions on Input

1 <= n <= 100000  

--------------------------------------------------

Note

- Do not print any extra messages such as:
  cout << "Enter a number"
  cout << "The computed answer is"
- Use cout only to print the computed final output.
- Do not print unnecessary spaces.
- Do not hard-code the result.
- If any test case passes by simply printing output without logic, marks will not be awarded.

Student submission:
#include <simplecpp>
main_program{
    int n;
    cin>> n;
    int count =0;
    int seq = 0;
    repeat(n){
        char v;
        cin>> v;
        if(v == 'a' || v == 'e'||v == 'i'||v == 'o'||v == 'u' ){
            count = count + 1;
            if (count>= seq){
                seq= count;
            }
        }else{
            count = 0;
        }
    }
    cout<< seq<<endl;
}

Grading criterion: Cluster Check
Rating A: Correctly keeps track of whether the character belongs to the vowel cluster or not. 

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: B
Problem: Problem Description

You are building a text analyzer tool. One of its features is detecting vowel clusters in a word.

Your task is to write a program that takes a word and counts how many vowel clusters it contains.

What is a Vowel Cluster?

A vowel cluster is a group of one or more vowels (a, e, i, o, u) that appear consecutively without any consonants in between.

Examples:

- "ae" is one vowel cluster.  
- "a" is one vowel cluster.  
- "abc" has one vowel cluster: "a".  

For example, in the word "beautiful", the vowels "eau" form one vowel cluster. Later, "i" and "u" form their own clusters. Hence, the word contains 3 vowel clusters in total.

--------------------------------------------------

Input Format

- An integer n, the length of the word.  
- A word of n lowercase English letters.

--------------------------------------------------

Output Format

- Print a single integer representing the number of vowel clusters in the word.

--------------------------------------------------

Assumptions on Input

1 <= n <= 100000  

--------------------------------------------------

Note

- Do not print any extra messages such as:
  cout << "Enter a number"
  cout << "The computed answer is"
- Use cout only to print the computed final output.
- Do not print unnecessary spaces.
- Do not hard-code the result.
- If any test case passes by simply printing output without logic, marks will not be awarded.

Student submission:
#include <simplecpp>

main_program{
    int n;
    cin >> n;

    int vc = 0;
    int b = 0;
    while(n!=0){
        char ch;
        cin >> ch;

        if(ch == 'a'){
            b++;
        }
        else if(ch == 'e'){
            b++;
        }
        else if(ch == 'i'){
            b++;
        }
        else if(ch == 'o'){
            b++;
        }
        else if(ch == 'u'){
            b++;
        }
        else{
            if(b>0){
                vc++;
            }
            b=0;
        }

        if(n==1){
            if(b>0){
                vc++;
            }
        }
        n--;
    }

    cout << vc << endl;
}

Grading criterion: Cluster Check
Rating A: Correctly keeps track of whether the character belongs to the vowel cluster or not. 

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A
Problem: Problem Description

You are building a text analyzer tool. One of its features is detecting vowel clusters in a word.

Your task is to write a program that takes a word and counts how many vowel clusters it contains.

What is a Vowel Cluster?

A vowel cluster is a group of one or more vowels (a, e, i, o, u) that appear consecutively without any consonants in between.

Examples:

- "ae" is one vowel cluster.  
- "a" is one vowel cluster.  
- "abc" has one vowel cluster: "a".  

For example, in the word "beautiful", the vowels "eau" form one vowel cluster. Later, "i" and "u" form their own clusters. Hence, the word contains 3 vowel clusters in total.

--------------------------------------------------

Input Format

- An integer n, the length of the word.  
- A word of n lowercase English letters.

--------------------------------------------------

Output Format

- Print a single integer representing the number of vowel clusters in the word.

--------------------------------------------------

Assumptions on Input

1 <= n <= 100000  

--------------------------------------------------

Note

- Do not print any extra messages such as:
  cout << "Enter a number"
  cout << "The computed answer is"
- Use cout only to print the computed final output.
- Do not print unnecessary spaces.
- Do not hard-code the result.
- If any test case passes by simply printing output without logic, marks will not be awarded.

Student submission:
#include<simplecpp>

main_program{
        int n;
        cin>>n;
        char a;
        int count=0;
        bool prev=False;
        for (int i=1; i<=n; i++){
                cin>>a;
if (a=='a' || a=='e'|| a=='i' ||a=='o'|| a=='u'){
        if (prev==True) continue;
        else {
                prev=True;
                count++;};
}
else  {
         prev=False;};
}
    cout<<count<<endl;
}

Grading criterion: Cluster Check
Rating A: Correctly keeps track of whether the character belongs to the vowel cluster or not. 

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A
Problem: Problem Description

You are building a text analyzer tool. One of its features is detecting vowel clusters in a word.

Your task is to write a program that takes a word and counts how many vowel clusters it contains.

What is a Vowel Cluster?

A vowel cluster is a group of one or more vowels (a, e, i, o, u) that appear consecutively without any consonants in between.

Examples:

- "ae" is one vowel cluster.  
- "a" is one vowel cluster.  
- "abc" has one vowel cluster: "a".  

For example, in the word "beautiful", the vowels "eau" form one vowel cluster. Later, "i" and "u" form their own clusters. Hence, the word contains 3 vowel clusters in total.

--------------------------------------------------

Input Format

- An integer n, the length of the word.  
- A word of n lowercase English letters.

--------------------------------------------------

Output Format

- Print a single integer representing the number of vowel clusters in the word.

--------------------------------------------------

Assumptions on Input

1 <= n <= 100000  

--------------------------------------------------

Note

- Do not print any extra messages such as:
  cout << "Enter a number"
  cout << "The computed answer is"
- Use cout only to print the computed final output.
- Do not print unnecessary spaces.
- Do not hard-code the result.
- If any test case passes by simply printing output without logic, marks will not be awarded.

Student submission:
#include <simplecpp>

main_program{
	
	int n,count=0;
	char c;
	cin >> n;

	repeat(n){
		cin >> c;
		if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;


	}

	cout << count << endl;

}

Grading criterion: Cluster Check
Rating A: Correctly keeps track of whether the character belongs to the vowel cluster or not. 

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: B
Problem: Problem Description

You are building a text analyzer tool. One of its features is detecting vowel clusters in a word.

Your task is to write a program that takes a word and counts how many vowel clusters it contains.

What is a Vowel Cluster?

A vowel cluster is a group of one or more vowels (a, e, i, o, u) that appear consecutively without any consonants in between.

Examples:

- "ae" is one vowel cluster.  
- "a" is one vowel cluster.  
- "abc" has one vowel cluster: "a".  

For example, in the word "beautiful", the vowels "eau" form one vowel cluster. Later, "i" and "u" form their own clusters. Hence, the word contains 3 vowel clusters in total.

--------------------------------------------------

Input Format

- An integer n, the length of the word.  
- A word of n lowercase English letters.

--------------------------------------------------

Output Format

- Print a single integer representing the number of vowel clusters in the word.

--------------------------------------------------

Assumptions on Input

1 <= n <= 100000  

--------------------------------------------------

Note

- Do not print any extra messages such as:
  cout << "Enter a number"
  cout << "The computed answer is"
- Use cout only to print the computed final output.
- Do not print unnecessary spaces.
- Do not hard-code the result.
- If any test case passes by simply printing output without logic, marks will not be awarded.

Student submission:
#include<simplecpp>
main_program{
int n;
cin >> n;
 
 while(){
   char b;
   int v=0;
   if(b==65 || b==70 || b==74 || b==80 || b== 86)
  {
    v++;
  }
    

 }
cout << v;
}

Grading criterion: Cluster Check
Rating A: Correctly keeps track of whether the character belongs to the vowel cluster or not. 

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: C
Problem: Problem Description

You are building a text analyzer tool. One of its features is detecting vowel clusters in a word.

Your task is to write a program that takes a word and counts how many vowel clusters it contains.

What is a Vowel Cluster?

A vowel cluster is a group of one or more vowels (a, e, i, o, u) that appear consecutively without any consonants in between.

Examples:

- "ae" is one vowel cluster.  
- "a" is one vowel cluster.  
- "abc" has one vowel cluster: "a".  

For example, in the word "beautiful", the vowels "eau" form one vowel cluster. Later, "i" and "u" form their own clusters. Hence, the word contains 3 vowel clusters in total.

--------------------------------------------------

Input Format

- An integer n, the length of the word.  
- A word of n lowercase English letters.

--------------------------------------------------

Output Format

- Print a single integer representing the number of vowel clusters in the word.

--------------------------------------------------

Assumptions on Input

1 <= n <= 100000  

--------------------------------------------------

Note

- Do not print any extra messages such as:
  cout << "Enter a number"
  cout << "The computed answer is"
- Use cout only to print the computed final output.
- Do not print unnecessary spaces.
- Do not hard-code the result.
- If any test case passes by simply printing output without logic, marks will not be awarded.

Student submission:
#include<simplecpp>
main_program{
    int n;
    cin>>n;
    int clustercount=0;
    for (int i=0;i<n;i++){
        char ch;
        cin>>ch;
        
        if (ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u'){
            clustercount++;
            char ch2='a';
            
            while (ch2=='a'||ch2=='e'||ch2=='i'||ch2=='o'||ch2=='u'){
                cin>>ch2;
                i++;
                
                if (ch2=='a'||ch2=='e'||ch2=='i'||ch2=='o'||ch2=='u'){
                    continue;
                }
                else if (i==n){break;}
                
            }
        }
        else{
            continue;
        }

        }
            
    cout<<clustercount;
    }

Grading criterion: Cluster Check
Rating A: Correctly keeps track of whether the character belongs to the vowel cluster or not. 

Rating B: Some issue. 

Rating C: Major issue. 

Rating D: 0
Assigned grade: A