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;
cin>>M;
repeat(M){
    cin>>n;
}}

Grading criterion: Logic for checking the subsequence
Rating A: correctly writes the logic for checking the subsequence
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>

main_program{
    int M,i=1,j=1,k,tmp=0;
    int x=0,y=1;
    bool tf=true;
    cin>>M;
    for(;i<=M;){
        cin>>k;
        if(k==0&&i==1){
            ++i;
            cin>>k;
            if(k==1){
            ++i;
            cin>>k;
            }
        }
        for(;j<=5000;++j){
                tmp=x+y;
            if(k==tmp){
                ++i;
                tmp=x+y;
                x=y;
                y=tmp;
                break;
            }
            
            x=y;
            y=tmp;
        }
        if(j==5001){
            tf=false;
            break;
        }
    }
    if(tf)
    cout<<"true"<<endl;
    else
    cout<<"false"<<endl;
}

Grading criterion: Logic for checking the subsequence
Rating A: correctly writes the logic for checking 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 nfib(int n){
    if (n==1){
        return 0;
    }
    else if(n==2){
        return 1;
    }
    else
    return nfib(n-1)+nfib(n-2);

}
main_program{
    int M;
    cin>>M;
    int i=1;
    repeat(M){
    int a;
    cin>>a;
    while(i<=30){
        if(a==nfib(i)){
            i++;
            break;
        }
        i++;
        

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

Grading criterion: Logic for checking the subsequence
Rating A: correctly writes the logic for checking 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 <iostream>

int nthFibo(int n){
    int i = 0, j = 1; int k = 1;
    for(int l = 0; l < n; l++){
        k = k + j;
        j = i + j;
        i = j - i;  
    }
    return i;
}

int main(){
    bool boo = 1;
    int M, u; std::cin >> M;
    int i = 0;
    for(int p = 0; p < M; p++){
        std::cin >> u;
        while(1){
            if(nthFibo(i) == u){
                i++; break;
            }
            else if(u < nthFibo(i)){
                boo = 0; i++; break;
            }
            else{ 
                i++;
            }
        }
    }
    std::cout <<( boo ? "true" : "false" );
}

Grading criterion: Logic for checking the subsequence
Rating A: correctly writes the logic for checking 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 <iostream>
using std::cin;using std::cout;
struct fibn{int i,n;};
int fibgen(int n){int a=0,b=1,c;
    if (n==2){return 1;}
    else if (n==1){return 0;}
    else{
        for(int i=2; i<n;i++){c=a;a=b;b=c;b+=a;}
        return b;
    }

}
bool fibcheck(int n){
    for(int i=1; n>=fibgen(i);i++){if (n==fibgen(i)){return 1;}}
    return 0;
}
int main(){
    int n,a,b=-1;bool t=true,c1=0;
    cin >> n;
   for (int i=0; i<n;i++){cin >> a;
    if(fibcheck(a) && (a>b || (a==b && b==1))){if (b==a && !c1){c1=1;b=a;t=true;} else if (b==a && c1){t=false;break;}else{ b=a;t=true;}}
    else{t=false;break;}
    }

if (t){cout << "true";}
else {cout << "false";}
}

Grading criterion: Logic for checking the subsequence
Rating A: correctly writes the logic for checking 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:
int fibonaccisequence(int& x,int& y)
 {int z=x+y;
      x=y;
      y=z;
      return z;}
 #include<simplecpp>
 main_program
 {int x=0,y=1,m,n1,n2,n,a,count=0;
 cin>>m;
  cin>>n1>>n2;
  if(n1==0 && n2==1){count=2;}
  if(n1!=0){while(a<50)
 {if(n1==fibonaccisequence(x,y))
 { count++;
 break;}
 a++;}}
 if(n2!=1)while(a<50)
 {if(n2==fibonaccisequence(x,y))
 { count++;
 break;}
 a++;}

 repeat(m-2)
 {cin>>n;
 while(a<50)
 {if(n==fibonaccisequence(x,y))
 { count++;
 break;}
 a++;}}
 
 if(count==m)
 {cout<<"true";}
 else{cout<<"false";}}

Grading criterion: Logic for checking the subsequence
Rating A: correctly writes the logic for checking 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 M;
    int a=0,b=1;
    bool t=true;
    cin>>M;
    int x;
    repeat(M){
        if(t){
            t=false;
            cin>>x;
            while(a<=x){
                if (a==x){t=true;}
                b+=a;
                a=b-a;
            }
        }
    }
    cout<<(t?"true":"false");
}

Grading criterion: Logic for checking the subsequence
Rating A: correctly writes the logic for checking the subsequence
Rating B: Some issue
Rating C: Major issue
Rating D: 0
Assigned grade: B
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;
    bool re;
    cin>>n;
    int k[n],a;
    int x[20];
    x[0]=0;
    x[1]=1;
    for(int i=2;i<20;++i){x[i]=x[i-1]+x[i-2];}
    for(int i=0;i<n;++i){cin>>k[i];}
    int p=0;
    for(int i=0;i<n;++i){
        for(int s=p;s<20;++s){
            if(x[s]==k[i]){re=1;}
            if(x[s]==k[i])break;
            if(s==19){re=0;}

        }if(re==0)break;p=p+1;
    }if(re==0){cout<<"false";}
    else cout<<"true";
    }

Grading criterion: Logic for checking the subsequence
Rating A: correctly writes the logic for checking 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 check(int n)
{
    int a[30];
    a[0]=0;
    a[1]=1;
    for(int i=2;i<=30;i++)
    a[i]=a[i-1]+a[i-2];
    for(int i=0;i<=30;i++)
    {
        if(a[i]==n)
        return true;
    }
    return false;
}
main_program
{
    int m,r=0,last=0,s=0;
    cin>>m;
    bool flag;
    for(int i=1;i<=m;i++)
    {
        s=last;
        last=r;
        cin>>r;
        flag=check(r);
        if(last>=r&&(last!=1&&r!=1&&m<3))
        flag=false;
        if(s==r&&last==r&&last!=0)
        flag=false;
    if(!flag)
    break;}
if(flag)cout<<"true";
else cout<<"false";}

Grading criterion: Logic for checking the subsequence
Rating A: correctly writes the logic for checking 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 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: Logic for checking the subsequence
Rating A: correctly writes the logic for checking 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: Logic for checking the subsequence
Rating A: correctly writes the logic for checking 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: Logic for checking the subsequence
Rating A: correctly writes the logic for checking the subsequence
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 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: Logic for checking the subsequence
Rating A: correctly writes the logic for checking the subsequence
Rating B: Some issue
Rating C: Major issue
Rating D: 0
Assigned grade: B
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: Logic for checking the subsequence
Rating A: correctly writes the logic for checking the subsequence
Rating B: Some issue
Rating C: Major issue
Rating D: 0
Assigned grade: B