CodeGraderBench/CodeGraderBench huggingface dataset:
Problem: In this problem, you need to check if a given finite sequence appears as a sub-sequence in the Fibonacci sequence. A finite sequence is said to be a Fibonacci sub-sequence if it is contained in the Fibonacci sequence in the same relative order but not necessarily consecutively. 
For example, the finite sequence 2, 5, 8 is a Fibonacci sub-sequence.  But 2, 8, 5 is not. Write a C++ program to accept an integer M followed by a finite sequence of M numbers. Your task is to determine if this finite sequence is a Fibonacci sub-sequence. You should output the following:
●	true or false
○	true: if the given finite sequence is a Fibonacci sub-sequence. E.g. on inputs “3 3 8 13”  and “3 3 5 8”
○	false  otherwise
Input Format An integer M followed by M integers

Assumptions on Input
●	Assume that the integer M will be between 1 and 19, both inclusive 
●	Assume that the sub-sequence numbers will be between 0 and 5000, both inclusive

Student submission:
#include<simplecpp>
main_program{
    int M,d,count=0;
    bool p=true;
    cin>>M;
    
    for(int i=1;i<=M;i++){
        cin>>d;
        int a=0,b=1,c;
        while(true){
            
            c=a+b;
            if(d==c||d==a||d==b){
                
                p=true;
                
                break;
                
            }
            else {
                a=b;
                b=c;
                p=false;
                count++;
                if(count>50)break;
            };

        };
    };
    if(p==true)cout<<"true";
    else cout<<"false";
    
};

Grading criterion: Declaration of variable and taking input
Rating A: correctly declares the variable M and followed by another variable to input the subsequence
Rating B: Some issue
Rating C: Major issue
Rating D: 0
Assigned grade: A
Problem: In this problem, you need to check if a given finite sequence appears as a sub-sequence in the Fibonacci sequence. A finite sequence is said to be a Fibonacci sub-sequence if it is contained in the Fibonacci sequence in the same relative order but not necessarily consecutively. 
For example, the finite sequence 2, 5, 8 is a Fibonacci sub-sequence.  But 2, 8, 5 is not. Write a C++ program to accept an integer M followed by a finite sequence of M numbers. Your task is to determine if this finite sequence is a Fibonacci sub-sequence. You should output the following:
●	true or false
○	true: if the given finite sequence is a Fibonacci sub-sequence. E.g. on inputs “3 3 8 13”  and “3 3 5 8”
○	false  otherwise
Input Format An integer M followed by M integers

Assumptions on Input
●	Assume that the integer M will be between 1 and 19, both inclusive 
●	Assume that the sub-sequence numbers will be between 0 and 5000, both inclusive

Student submission:
#include<simplecpp>
int fibonacci(int n){
    int n0=0,n1=1;
    for(int i=0;i<n-1;i++){
        (i%2==0)?n0+=n1:n1+=n0;
    }
    return (n%2==0)?n0:n1;
}
int main(){
    int n,m=0;
    cin>>n;
    for(int i=0;i<n;i++){
        int x;
        cin>>x;
        while(m<20){
            if(fibonacci(m)==x){
                m++;
                break;    
            }
            m++;
        }
        
    }
    (m==20)?cout<<"false":cout<<"true";
}

Grading criterion: Declaration of variable and taking input
Rating A: correctly declares the variable M and followed by another variable to input the subsequence
Rating B: Some issue
Rating C: Major issue
Rating D: 0
Assigned grade: A
Problem: In this problem, you need to check if a given finite sequence appears as a sub-sequence in the Fibonacci sequence. A finite sequence is said to be a Fibonacci sub-sequence if it is contained in the Fibonacci sequence in the same relative order but not necessarily consecutively. 
For example, the finite sequence 2, 5, 8 is a Fibonacci sub-sequence.  But 2, 8, 5 is not. Write a C++ program to accept an integer M followed by a finite sequence of M numbers. Your task is to determine if this finite sequence is a Fibonacci sub-sequence. You should output the following:
●	true or false
○	true: if the given finite sequence is a Fibonacci sub-sequence. E.g. on inputs “3 3 8 13”  and “3 3 5 8”
○	false  otherwise
Input Format An integer M followed by M integers

Assumptions on Input
●	Assume that the integer M will be between 1 and 19, both inclusive 
●	Assume that the sub-sequence numbers will be between 0 and 5000, both inclusive

Student submission:
#include<simplecpp>

bool fib(int n) {
        int a = (-1);
        int b = 1;
        int k = n;
        while (k >= -1) {
                int tmp = b;
                b = a + b;
                a = tmp;
                if ( b == n ) {
                        return true;
                }
                k--;
        }
        return false;
}

main_program {
        int M;
        cin >> M;
        int x = 0;
        int count =0;
        int k = M;
        int a = 0;
        while (M > 0) {
                int n;
                cin >> n;
                if (fib (n) == true) {
                        count++;
                        if (n <= x && n > 1) {
                                break;
                        }
                        if (n == 1) {
                                a++;
                        if (a == 3) break;
                        }
                        x = n;
                }
                M--;
        }
        if (x = 1 && a == 3) cout << "false";
        else if (count == k) cout << "true" << endl;
        else cout << "false" << endl;
}

Grading criterion: Declaration of variable and taking input
Rating A: correctly declares the variable M and followed by another variable to input the subsequence
Rating B: Some issue
Rating C: Major issue
Rating D: 0
Assigned grade: A
Problem: In this problem, you need to check if a given finite sequence appears as a sub-sequence in the Fibonacci sequence. A finite sequence is said to be a Fibonacci sub-sequence if it is contained in the Fibonacci sequence in the same relative order but not necessarily consecutively. 
For example, the finite sequence 2, 5, 8 is a Fibonacci sub-sequence.  But 2, 8, 5 is not. Write a C++ program to accept an integer M followed by a finite sequence of M numbers. Your task is to determine if this finite sequence is a Fibonacci sub-sequence. You should output the following:
●	true or false
○	true: if the given finite sequence is a Fibonacci sub-sequence. E.g. on inputs “3 3 8 13”  and “3 3 5 8”
○	false  otherwise
Input Format An integer M followed by M integers

Assumptions on Input
●	Assume that the integer M will be between 1 and 19, both inclusive 
●	Assume that the sub-sequence numbers will be between 0 and 5000, both inclusive

Student submission:
#include<simplecpp>
int main() {
   int m,d;
   cin>>m;
    int N[500]={};
    int a=0,b=1,c=1;
    for(int i=0;i<500;i++) {
        int tmp=b;b=a+b;c=c+tmp;a=tmp;
         N[i]=c;
    }
     for( int j=0;j<m;j++) {
        cin>>d;
        for(int k=0;k<m;k++) {
            if(d==N[k]) {
              continue;
            } else {cout<<"false";
         break;} 
        }
      cout<<"true";
      }
   
   
   }

Grading criterion: Declaration of variable and taking input
Rating A: correctly declares the variable M and followed by another variable to input the subsequence
Rating B: Some issue
Rating C: Major issue
Rating D: 0
Assigned grade: A
Problem: In this problem, you need to check if a given finite sequence appears as a sub-sequence in the Fibonacci sequence. A finite sequence is said to be a Fibonacci sub-sequence if it is contained in the Fibonacci sequence in the same relative order but not necessarily consecutively. 
For example, the finite sequence 2, 5, 8 is a Fibonacci sub-sequence.  But 2, 8, 5 is not. Write a C++ program to accept an integer M followed by a finite sequence of M numbers. Your task is to determine if this finite sequence is a Fibonacci sub-sequence. You should output the following:
●	true or false
○	true: if the given finite sequence is a Fibonacci sub-sequence. E.g. on inputs “3 3 8 13”  and “3 3 5 8”
○	false  otherwise
Input Format An integer M followed by M integers

Assumptions on Input
●	Assume that the integer M will be between 1 and 19, both inclusive 
●	Assume that the sub-sequence numbers will be between 0 and 5000, both inclusive

Student submission:
#include <simplecpp>

main_program{
        int n,y=1,i=0;
        cin >>n;
        bool fibo = true;
        int a1=0,a2=1,a3=1,x;
        while (fibo==true && i<n && y>=a3 ){
                cin >>y;  
                if ( i==0 &&(y==0||y==1)){
                        i++;
                        continue;
                }
                if (y==a3){
                        i++;
                        continue;}
                while (y>a3){
                        x=a3;
                        a3=a3+a2;
                        a1=a2;
                        a2=x;
                        if (a3>y){
                                fibo = false;
                                break;}
                        if (y==a3){
                                i++;
                                continue;
                        }
                }
        }
        cout << (fibo == true ? "true":"false");
}

Grading criterion: Declaration of variable and taking input
Rating A: correctly declares the variable M and followed by another variable to input the subsequence
Rating B: Some issue
Rating C: Major issue
Rating D: 0
Assigned grade: A
Problem: In this problem, you need to check if a given finite sequence appears as a sub-sequence in the Fibonacci sequence. A finite sequence is said to be a Fibonacci sub-sequence if it is contained in the Fibonacci sequence in the same relative order but not necessarily consecutively. 
For example, the finite sequence 2, 5, 8 is a Fibonacci sub-sequence.  But 2, 8, 5 is not. Write a C++ program to accept an integer M followed by a finite sequence of M numbers. Your task is to determine if this finite sequence is a Fibonacci sub-sequence. You should output the following:
●	true or false
○	true: if the given finite sequence is a Fibonacci sub-sequence. E.g. on inputs “3 3 8 13”  and “3 3 5 8”
○	false  otherwise
Input Format An integer M followed by M integers

Assumptions on Input
●	Assume that the integer M will be between 1 and 19, both inclusive 
●	Assume that the sub-sequence numbers will be between 0 and 5000, both inclusive

Student submission:
#include<simplecpp>
main_program{
        int no;cin>>no;
        int f1=0,f2=1;int i=1;
        repeat(no){int n;cin>>n;
                    }


}

Grading criterion: Loop M times
Rating A: correctly iterates the loop M times
Rating B: Some issue
Rating C: Major issue
Rating D: 0
Assigned grade: A
Problem: In this problem, you need to check if a given finite sequence appears as a sub-sequence in the Fibonacci sequence. A finite sequence is said to be a Fibonacci sub-sequence if it is contained in the Fibonacci sequence in the same relative order but not necessarily consecutively. 
For example, the finite sequence 2, 5, 8 is a Fibonacci sub-sequence.  But 2, 8, 5 is not. Write a C++ program to accept an integer M followed by a finite sequence of M numbers. Your task is to determine if this finite sequence is a Fibonacci sub-sequence. You should output the following:
●	true or false
○	true: if the given finite sequence is a Fibonacci sub-sequence. E.g. on inputs “3 3 8 13”  and “3 3 5 8”
○	false  otherwise
Input Format An integer M followed by M integers

Assumptions on Input
●	Assume that the integer M will be between 1 and 19, both inclusive 
●	Assume that the sub-sequence numbers will be between 0 and 5000, both inclusive

Student submission:
#include<simplecpp>
main_program {
    int m,n;
    char c;
    cin>>m;
    for(int i=1;i<=m;i++){
        cin>>n;
    }

Grading criterion: Loop M times
Rating A: correctly iterates the loop M times
Rating B: Some issue
Rating C: Major issue
Rating D: 0
Assigned grade: A
Problem: In this problem, you need to check if a given finite sequence appears as a sub-sequence in the Fibonacci sequence. A finite sequence is said to be a Fibonacci sub-sequence if it is contained in the Fibonacci sequence in the same relative order but not necessarily consecutively. 
For example, the finite sequence 2, 5, 8 is a Fibonacci sub-sequence.  But 2, 8, 5 is not. Write a C++ program to accept an integer M followed by a finite sequence of M numbers. Your task is to determine if this finite sequence is a Fibonacci sub-sequence. You should output the following:
●	true or false
○	true: if the given finite sequence is a Fibonacci sub-sequence. E.g. on inputs “3 3 8 13”  and “3 3 5 8”
○	false  otherwise
Input Format An integer M followed by M integers

Assumptions on Input
●	Assume that the integer M will be between 1 and 19, both inclusive 
●	Assume that the sub-sequence numbers will be between 0 and 5000, both inclusive

Student submission:
#include<simplecpp>
main_program{
    int M;
    cin>>M;
    if(M==2) {
        int a,b;
        cin>>a >>b;
        if(a==1 && b==4) {
            cout<<"false";
        }
    }
    if(M==3) {
        int a,b,c;
        cin>>a >>b >>c;
        if(a==1 && b==1 && c==1) {
            cout<<"false";
        }
        else if(a==4 && b==8) {
            if(c==12 || c==13) {
                cout<<"false";
            }
        } 
        else if (a==1 && b==1 && c==4){
            cout<<"false";
        }
    }
        else if (M==4) {
            int a,b,c,d;
            cin>>a >>b >>c >>d;
            if(a==0 && b==1 && c==1 && d==2) {
                cout<<"true";
            }
        }

}

Grading criterion: Loop M times
Rating A: correctly iterates the loop M times
Rating B: Some issue
Rating C: Major issue
Rating D: 0
Assigned grade: C
Problem: In this problem, you need to check if a given finite sequence appears as a sub-sequence in the Fibonacci sequence. A finite sequence is said to be a Fibonacci sub-sequence if it is contained in the Fibonacci sequence in the same relative order but not necessarily consecutively. 
For example, the finite sequence 2, 5, 8 is a Fibonacci sub-sequence.  But 2, 8, 5 is not. Write a C++ program to accept an integer M followed by a finite sequence of M numbers. Your task is to determine if this finite sequence is a Fibonacci sub-sequence. You should output the following:
●	true or false
○	true: if the given finite sequence is a Fibonacci sub-sequence. E.g. on inputs “3 3 8 13”  and “3 3 5 8”
○	false  otherwise
Input Format An integer M followed by M integers

Assumptions on Input
●	Assume that the integer M will be between 1 and 19, both inclusive 
●	Assume that the sub-sequence numbers will be between 0 and 5000, both inclusive

Student submission:
#include<iostream>
using namespace std;

bool fibo(int x)
{
    if(x==0 || x==1)
    return 1;
    int i=1,j=1, k=0;
    while(x>k)
    {
        k=i+j;
        i=j;
        j=k;
    }
    if(x==k)
    return 1;
    else return 0;
}
int main()
{
    unsigned int m,x,y=0;
    bool flag=1;
    cin>>m;
    for(int i=0;i<m;i++)
    {
        cin>>x;
        if(fibo(x) && x>=y)
        y=x;
        else{
             flag=0;
             break;
        }
    }
    cout<<(flag==1? "true": "false");
}

Grading criterion: Loop M times
Rating A: correctly iterates the loop M times
Rating B: Some issue
Rating C: Major issue
Rating D: 0
Assigned grade: A
Problem: In this problem, you need to check if a given finite sequence appears as a sub-sequence in the Fibonacci sequence. A finite sequence is said to be a Fibonacci sub-sequence if it is contained in the Fibonacci sequence in the same relative order but not necessarily consecutively. 
For example, the finite sequence 2, 5, 8 is a Fibonacci sub-sequence.  But 2, 8, 5 is not. Write a C++ program to accept an integer M followed by a finite sequence of M numbers. Your task is to determine if this finite sequence is a Fibonacci sub-sequence. You should output the following:
●	true or false
○	true: if the given finite sequence is a Fibonacci sub-sequence. E.g. on inputs “3 3 8 13”  and “3 3 5 8”
○	false  otherwise
Input Format An integer M followed by M integers

Assumptions on Input
●	Assume that the integer M will be between 1 and 19, both inclusive 
●	Assume that the sub-sequence numbers will be between 0 and 5000, both inclusive

Student submission:
#include <simplecpp>
main_program{
        int m;
        cin>>m;
        int N=0, nextN=1;
        int num, count=0;
        bool isFab=true;
        for(int i=0; i<m; i++){
                cin>>num;
                while(true){
                        if(num==N){
                                int temp=nextN;
                                nextN = N + nextN;
                                N = temp;
                                break;
                        }else{
                                int temp=nextN;
                                nextN = N + nextN;
                                N = temp;
                        }
                        if(count>5000){
                                isFab=false;
                                break;
                        }
                        count++;
                }
        }       
        if(isFab==true) cout<<"true";
        else if(isFab==false) cout<<"false";
}

Grading criterion: Loop M times
Rating A: correctly iterates the loop M times
Rating B: Some issue
Rating C: Major issue
Rating D: 0
Assigned grade: A
Problem: In this problem, you need to check if a given finite sequence appears as a sub-sequence in the Fibonacci sequence. A finite sequence is said to be a Fibonacci sub-sequence if it is contained in the Fibonacci sequence in the same relative order but not necessarily consecutively. 
For example, the finite sequence 2, 5, 8 is a Fibonacci sub-sequence.  But 2, 8, 5 is not. Write a C++ program to accept an integer M followed by a finite sequence of M numbers. Your task is to determine if this finite sequence is a Fibonacci sub-sequence. You should output the following:
●	true or false
○	true: if the given finite sequence is a Fibonacci sub-sequence. E.g. on inputs “3 3 8 13”  and “3 3 5 8”
○	false  otherwise
Input Format An integer M followed by M integers

Assumptions on Input
●	Assume that the integer M will be between 1 and 19, both inclusive 
●	Assume that the sub-sequence numbers will be between 0 and 5000, both inclusive

Student submission:
include<simplecpp>
main_program{
        int n;
        cin >>n;
        int i=0;
        int j=1;
        int a,b,k,c;
        cin >> a>>b;
        int s=0;
        int w=0;
        repeat(1000){
                k=s;
                s=i+j;
                if(a==k&&b==s){
                for(int i=1;i<=n-2;++i){
        cin>>c;
        if(c==(a+b)){
                ++w;    }

        a=b;
        b=c;
                }
        if(w==(n-2)){
        cout << "True";}
        else {
        cout << "False";
                }

                }
                i=j;
                j=s;





        }
}

Grading criterion: Loop M times
Rating A: correctly iterates the loop M times
Rating B: Some issue
Rating C: Major issue
Rating D: 0
Assigned grade: C
Problem: In this problem, you need to check if a given finite sequence appears as a sub-sequence in the Fibonacci sequence. A finite sequence is said to be a Fibonacci sub-sequence if it is contained in the Fibonacci sequence in the same relative order but not necessarily consecutively. 
For example, the finite sequence 2, 5, 8 is a Fibonacci sub-sequence.  But 2, 8, 5 is not. Write a C++ program to accept an integer M followed by a finite sequence of M numbers. Your task is to determine if this finite sequence is a Fibonacci sub-sequence. You should output the following:
●	true or false
○	true: if the given finite sequence is a Fibonacci sub-sequence. E.g. on inputs “3 3 8 13”  and “3 3 5 8”
○	false  otherwise
Input Format An integer M followed by M integers

Assumptions on Input
●	Assume that the integer M will be between 1 and 19, both inclusive 
●	Assume that the sub-sequence numbers will be between 0 and 5000, both inclusive

Student submission:
#include<simplecpp>
int Fib(int n){
    if(n==0)return 0;
    else if(n==1)return 1;
    else return(Fib(n-1)+Fib(n-2));
}
main_program{
    int M;
    int c=0;
    int t=0;
    cin>>M;
    for(int i=0;i<M;i++){
        int a;
        cin>>a;
        for(int z=0;Fib(z)<(a+1);z=z+1){
            int h=Fib(z);
   
            if(h==a){
                t=t+1;
            } 
        }
        if(a==1)c++;
    }
    if(c<3 && (t==M))cout<<"true";
        else cout<<"false";

}

Grading criterion: Loop M times
Rating A: correctly iterates the loop M times
Rating B: Some issue
Rating C: Major issue
Rating D: 0
Assigned grade: A
Problem: In this problem, you need to check if a given finite sequence appears as a sub-sequence in the Fibonacci sequence. A finite sequence is said to be a Fibonacci sub-sequence if it is contained in the Fibonacci sequence in the same relative order but not necessarily consecutively. 
For example, the finite sequence 2, 5, 8 is a Fibonacci sub-sequence.  But 2, 8, 5 is not. Write a C++ program to accept an integer M followed by a finite sequence of M numbers. Your task is to determine if this finite sequence is a Fibonacci sub-sequence. You should output the following:
●	true or false
○	true: if the given finite sequence is a Fibonacci sub-sequence. E.g. on inputs “3 3 8 13”  and “3 3 5 8”
○	false  otherwise
Input Format An integer M followed by M integers

Assumptions on Input
●	Assume that the integer M will be between 1 and 19, both inclusive 
●	Assume that the sub-sequence numbers will be between 0 and 5000, both inclusive

Student submission:
#include <simplecpp>
main_program{
        bool isTrue=true;
        int m, n, prevn, l=1, prevl=0;
        cin >> m;
        cin >> n;
        while(l!=n){
            if(n==0) break;
                int a;
                a=l;
                l=a+prevl;
                prevl=a;
                if(l>n){
                         isTrue=false;
                         break;
                }
        }
        prevn=prevl;
        for(int k=0;k<m-1;k++){
                l=1, prevl=0;
                int b;
                b=n;
                cin >> n;
                if(prevn<=n){
                        while(l!=n){
                                int a;
                                a=l;
                                l=a+prevl;
                                prevl=a;
                                if(l>n){
                                        isTrue=false;
                                        break;
                                }
                        }
                }
                prevn=b;
        }
        if(isTrue) cout << "true";
        else cout << "false";
}

Grading criterion: Loop M times
Rating A: correctly iterates the loop M times
Rating B: Some issue
Rating C: Major issue
Rating D: 0
Assigned grade: A