CodeGraderBench/CodeGraderBench huggingface dataset:
Problem: Write a C++ program to take a positive integer n as input from the user and print out its unique prime factors. For this, do the following: While n is divisible by 2, print the number 2 and divide n by 2. After that, the number is no longer even. While n is divisible by k=3, print the number 3 and divide n by 3. After k no longer divides n, increase k by 2 and repeat. 

Input Format - integer n
Output Format - All prime factors, each one printed on a new line. 

Constraints
n is a positive integer such that n>=2

Sample input and output
Input - 45
Output - 3 5
Explanation:45 can be expressed as 3x3x5 . Hence its prime factors are 3 and 5


Note:Do not write any C++ statements for printing general messages. For example, the following should NOT be present in your program:cout << "Enter a number:",cout << "The computed answer is", etc.cout should be used to print only the computed final output. In addition, do not print unnecessary spaces unless specified in the programThe solution file name should be an C_Q2.cpp

Student submission:
#include<iostream>
using namespace std;
int main(){
        int n;
        cin>>n;
        for(int i=2;i<=n;i++){
            if(n%i==0){
                bool flag = false;
                for(int r=2;r<i-1;r++){
                    if(i%r==0){flag=true;}}
                
                if(flag==false){cout<<i<<endl;}}
        }
}

Grading criterion: Divisibility by k=2 checked and number reduced.
Rating A: Fully Correct
Rating B: Just divisibility checked but number not reduced
Rating C: Totally wrong
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take a positive integer n as input from the user and print out its unique prime factors. For this, do the following: While n is divisible by 2, print the number 2 and divide n by 2. After that, the number is no longer even. While n is divisible by k=3, print the number 3 and divide n by 3. After k no longer divides n, increase k by 2 and repeat. 

Input Format - integer n
Output Format - All prime factors, each one printed on a new line. 

Constraints
n is a positive integer such that n>=2

Sample input and output
Input - 45
Output - 3 5
Explanation:45 can be expressed as 3x3x5 . Hence its prime factors are 3 and 5


Note:Do not write any C++ statements for printing general messages. For example, the following should NOT be present in your program:cout << "Enter a number:",cout << "The computed answer is", etc.cout should be used to print only the computed final output. In addition, do not print unnecessary spaces unless specified in the programThe solution file name should be an C_Q2.cpp

Student submission:
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int p=n;
int k=3;
if((n%2)==0){
    cout<<"2"<<endl;
    while((p%2)==0){
         p=p/2;
         
    }
}
else if((p%3)==0){
    cout<<"3"<<endl;
    while((p%3)==0){
         p=p/3;  
   }
}
else{
while(p!=0){
k=k+2;
if((p%k)==0){
    cout<<k<<endl;
    while((p%k)==0){
         p=p/k;  
   }
}
}


}





}

Grading criterion: Divisibility by k=2 checked and number reduced.
Rating A: Fully Correct
Rating B: Just divisibility checked but number not reduced
Rating C: Totally wrong
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take a positive integer n as input from the user and print out its unique prime factors. For this, do the following: While n is divisible by 2, print the number 2 and divide n by 2. After that, the number is no longer even. While n is divisible by k=3, print the number 3 and divide n by 3. After k no longer divides n, increase k by 2 and repeat. 

Input Format - integer n
Output Format - All prime factors, each one printed on a new line. 

Constraints
n is a positive integer such that n>=2

Sample input and output
Input - 45
Output - 3 5
Explanation:45 can be expressed as 3x3x5 . Hence its prime factors are 3 and 5


Note:Do not write any C++ statements for printing general messages. For example, the following should NOT be present in your program:cout << "Enter a number:",cout << "The computed answer is", etc.cout should be used to print only the computed final output. In addition, do not print unnecessary spaces unless specified in the programThe solution file name should be an C_Q2.cpp

Student submission:
#include<iostream>
using namespace std;
int main(){
int n,k;
cin>>n;
for(int i=2;i<n;i++){
k=0;
for(int j=2;j<i;j++){
if(i%j==0&&!(i==j)){
k=1;
}
else{
continue;
}}
if(k==0&&n%i==0){
cout<<i<<endl;
}
else{
continue;
}}
}

Grading criterion: Divisibility by k=2 checked and number reduced.
Rating A: Fully Correct
Rating B: Just divisibility checked but number not reduced
Rating C: Totally wrong
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take a positive integer n as input from the user and print out its unique prime factors. For this, do the following: While n is divisible by 2, print the number 2 and divide n by 2. After that, the number is no longer even. While n is divisible by k=3, print the number 3 and divide n by 3. After k no longer divides n, increase k by 2 and repeat. 

Input Format - integer n
Output Format - All prime factors, each one printed on a new line. 

Constraints
n is a positive integer such that n>=2

Sample input and output
Input - 45
Output - 3 5
Explanation:45 can be expressed as 3x3x5 . Hence its prime factors are 3 and 5


Note:Do not write any C++ statements for printing general messages. For example, the following should NOT be present in your program:cout << "Enter a number:",cout << "The computed answer is", etc.cout should be used to print only the computed final output. In addition, do not print unnecessary spaces unless specified in the programThe solution file name should be an C_Q2.cpp

Student submission:
#include<iostream>
using namespace std;
int main()
{
	int n, d;
	cin>>n;
	
	while(n!=0)
	{
		for(int i=2;n!=0;i++)
		{
			
			 if(n%i==0)
		{cout<<i<<endl;
			while(n%i==0)
		{
		d = n;
		 n = n/i;
		
		


}	}
 	else if(n%i!=0)
	continue;

}
}	}

Grading criterion: Divisibility by k=2 checked and number reduced.
Rating A: Fully Correct
Rating B: Just divisibility checked but number not reduced
Rating C: Totally wrong
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take a positive integer n as input from the user and print out its unique prime factors. For this, do the following: While n is divisible by 2, print the number 2 and divide n by 2. After that, the number is no longer even. While n is divisible by k=3, print the number 3 and divide n by 3. After k no longer divides n, increase k by 2 and repeat. 

Input Format - integer n
Output Format - All prime factors, each one printed on a new line. 

Constraints
n is a positive integer such that n>=2

Sample input and output
Input - 45
Output - 3 5
Explanation:45 can be expressed as 3x3x5 . Hence its prime factors are 3 and 5


Note:Do not write any C++ statements for printing general messages. For example, the following should NOT be present in your program:cout << "Enter a number:",cout << "The computed answer is", etc.cout should be used to print only the computed final output. In addition, do not print unnecessary spaces unless specified in the programThe solution file name should be an C_Q2.cpp

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

int main(){
int n;

cin >> n;

if(n%2==0){
	cout << 2 <<endl;
	while(n%2 ==0){
		n = n/2;
	}
}

for(int i=3;i<=n;i+=2){

if(n%i==0){
	cout << i <<endl;
	while(n%i ==0){
		n = n/i;
	}
}
else ;	
}

}

Grading criterion: Divisibility by k=2 checked and number reduced.
Rating A: Fully Correct
Rating B: Just divisibility checked but number not reduced
Rating C: Totally wrong
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take a positive integer n as input from the user and print out its unique prime factors. For this, do the following: While n is divisible by 2, print the number 2 and divide n by 2. After that, the number is no longer even. While n is divisible by k=3, print the number 3 and divide n by 3. After k no longer divides n, increase k by 2 and repeat. 

Input Format - integer n
Output Format - All prime factors, each one printed on a new line. 

Constraints
n is a positive integer such that n>=2

Sample input and output
Input - 45
Output - 3 5
Explanation:45 can be expressed as 3x3x5 . Hence its prime factors are 3 and 5


Note:Do not write any C++ statements for printing general messages. For example, the following should NOT be present in your program:cout << "Enter a number:",cout << "The computed answer is", etc.cout should be used to print only the computed final output. In addition, do not print unnecessary spaces unless specified in the programThe solution file name should be an C_Q2.cpp

Student submission:
#include<iostream>
using namespace std;
int prime(int n){
int j=0;
if(n==1||n==0){j+=1;}
else{
for(int i=2;i<=n/2;i++){
if(n%i==0){
j+=1;
}
}
}
if(j==0)return 1;
else return 0;
}
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
if(prime(i)==1){
if(n%i==0){
n=n/i;
cout<<i<<endl;}}}
}

Grading criterion: Divisibility by k=2 checked and number reduced.
Rating A: Fully Correct
Rating B: Just divisibility checked but number not reduced
Rating C: Totally wrong
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take a positive integer n as input from the user and print out its unique prime factors. For this, do the following: While n is divisible by 2, print the number 2 and divide n by 2. After that, the number is no longer even. While n is divisible by k=3, print the number 3 and divide n by 3. After k no longer divides n, increase k by 2 and repeat. 

Input Format - integer n
Output Format - All prime factors, each one printed on a new line. 

Constraints
n is a positive integer such that n>=2

Sample input and output
Input - 45
Output - 3 5
Explanation:45 can be expressed as 3x3x5 . Hence its prime factors are 3 and 5


Note:Do not write any C++ statements for printing general messages. For example, the following should NOT be present in your program:cout << "Enter a number:",cout << "The computed answer is", etc.cout should be used to print only the computed final output. In addition, do not print unnecessary spaces unless specified in the programThe solution file name should be an C_Q2.cpp

Student submission:
#include<iostream>
using namespace std;
int main(){
int n,k=3;
cin>>n;
while(n>0){if(n%2==0){cout<<2<<endl;
n=n/2;}else if(n%k==0){cout<<k<<endl;
n=n/k;}
else if (n%(k+2)==0){ cout<<(k+2)<<endl;
n=n/(k+2);
k=k+2;}else cout<<n;
}}

Grading criterion: Divisibility by k=2 checked and number reduced.
Rating A: Fully Correct
Rating B: Just divisibility checked but number not reduced
Rating C: Totally wrong
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take a positive integer n as input from the user and print out its unique prime factors. For this, do the following: While n is divisible by 2, print the number 2 and divide n by 2. After that, the number is no longer even. While n is divisible by k=3, print the number 3 and divide n by 3. After k no longer divides n, increase k by 2 and repeat. 

Input Format - integer n
Output Format - All prime factors, each one printed on a new line. 

Constraints
n is a positive integer such that n>=2

Sample input and output
Input - 45
Output - 3 5
Explanation:45 can be expressed as 3x3x5 . Hence its prime factors are 3 and 5


Note:Do not write any C++ statements for printing general messages. For example, the following should NOT be present in your program:cout << "Enter a number:",cout << "The computed answer is", etc.cout should be used to print only the computed final output. In addition, do not print unnecessary spaces unless specified in the programThe solution file name should be an C_Q2.cpp

Student submission:
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int temp=n;
if(n%2==0)
{
cout<<"2"<<endl;
while(temp%2==0)
{
temp=temp/2;
}
}
if(temp>2)
{
for(int i=3;i>=3;i=i+2)
{
if(temp%i==0)
{
cout<<i<<endl;
while(temp%i==0)
{
temp=temp/i;
}
}
if(temp==1){break;}
else{continue;}
}
}
return 0;
}

Grading criterion: Divisibility by k=2 checked and number reduced.
Rating A: Fully Correct
Rating B: Just divisibility checked but number not reduced
Rating C: Totally wrong
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take a positive integer n as input from the user and print out its unique prime factors. For this, do the following: While n is divisible by 2, print the number 2 and divide n by 2. After that, the number is no longer even. While n is divisible by k=3, print the number 3 and divide n by 3. After k no longer divides n, increase k by 2 and repeat. 

Input Format - integer n
Output Format - All prime factors, each one printed on a new line. 

Constraints
n is a positive integer such that n>=2

Sample input and output
Input - 45
Output - 3 5
Explanation:45 can be expressed as 3x3x5 . Hence its prime factors are 3 and 5


Note:Do not write any C++ statements for printing general messages. For example, the following should NOT be present in your program:cout << "Enter a number:",cout << "The computed answer is", etc.cout should be used to print only the computed final output. In addition, do not print unnecessary spaces unless specified in the programThe solution file name should be an C_Q2.cpp

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

int main()
{
  int n,k,i,t;
  cin>>n;
   t=0;
  for(k=2;k<=n;k++)
  {
   for(i=2;i<=k-1;i++)
    {
     if((k%i)==0) t=1;
    }
   if(t==1) 
    {
     t=0;
     continue;
    }
   else if((n%k)==0) cout<<k<<endl;
  }
 
}

Grading criterion: Divisibility by k=2 checked and number reduced.
Rating A: Fully Correct
Rating B: Just divisibility checked but number not reduced
Rating C: Totally wrong
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take a positive integer n as input from the user and print out its unique prime factors. For this, do the following: While n is divisible by 2, print the number 2 and divide n by 2. After that, the number is no longer even. While n is divisible by k=3, print the number 3 and divide n by 3. After k no longer divides n, increase k by 2 and repeat. 

Input Format - integer n
Output Format - All prime factors, each one printed on a new line. 

Constraints
n is a positive integer such that n>=2

Sample input and output
Input - 45
Output - 3 5
Explanation:45 can be expressed as 3x3x5 . Hence its prime factors are 3 and 5


Note:Do not write any C++ statements for printing general messages. For example, the following should NOT be present in your program:cout << "Enter a number:",cout << "The computed answer is", etc.cout should be used to print only the computed final output. In addition, do not print unnecessary spaces unless specified in the programThe solution file name should be an C_Q2.cpp

Student submission:
#include<iostream>
using namespace std;
int main(){
bool isprime(int n){
int k= 0;
if(n == 2) return true;
if(n == 3) return true;
for(int j=2;j<n;j++){
if (n % j == 0) {
k++;
break;
}
}
if(k==0) return true;
else return false;
}
int main(){
int n,i;
cin>>n;
if(n>5){

for(i=2;i<n;i++){
if(sprime(i) == true && n % i== 0) cout << i<< endl;;
}
}
if(n==2)cout<<"2";
if(n==3)cout<<"3";
if(n==4)cout<<"2";
if(n==5)cout<<"5";
if (sprime(n)) cout<<n;
}

Grading criterion: Divisibility by k=2 checked and number reduced.
Rating A: Fully Correct
Rating B: Just divisibility checked but number not reduced
Rating C: Totally wrong
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take a positive integer n as input from the user and print out its unique prime factors. For this, do the following: While n is divisible by 2, print the number 2 and divide n by 2. After that, the number is no longer even. While n is divisible by k=3, print the number 3 and divide n by 3. After k no longer divides n, increase k by 2 and repeat. 

Input Format - integer n
Output Format - All prime factors, each one printed on a new line. 

Constraints
n is a positive integer such that n>=2

Sample input and output
Input - 45
Output - 3 5
Explanation:45 can be expressed as 3x3x5 . Hence its prime factors are 3 and 5


Note:Do not write any C++ statements for printing general messages. For example, the following should NOT be present in your program:cout << "Enter a number:",cout << "The computed answer is", etc.cout should be used to print only the computed final output. In addition, do not print unnecessary spaces unless specified in the programThe solution file name should be an C_Q2.cpp

Student submission:
#include<iostream>
using namespace std;
int main(){

int n;
cin>>n;
while(n%2==0){
              cout<<"2"<<endl;
                n=n/2;
break;
}

while(n%3==0){
              cout<<"3"<<endl;
               n=n/3;
break;
}
while(n%5==0){
              cout<<"5"<<endl;
               n=n/5;
break;
}
while(n%7==0){
              cout<<"7"<<endl;
               n=n/7;
break;
}
while(n%11==0){
               cout<<"11"<<endl;
                n=n/11;
break;
}
while(n%13==0){
              cout<<"13"<<endl;
              n=n/13;
break;
}
while(n%17==0){
               cout<<"17"<<endl;
                n=n/17;
break;
}
while(n%19==0){
              cout<<"19"<<endl;
                n=n/19;
break;
}
while(n%23==0){
               cout<<"23"<<endl;
               n=n/23;
break;
}

while(n%29==0){
               cout<<"29"<<endl;
                n=n/29;
break;
}
while(n%31==0){
               cout<<"31"<<endl;
               n=n/31;
break;
}

while(n%37==0){
               cout<<"37"<<endl;
                n=n/37;
break;
}

}

Grading criterion: Divisibility by k=2 checked and number reduced.
Rating A: Fully Correct
Rating B: Just divisibility checked but number not reduced
Rating C: Totally wrong
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take a positive integer n as input from the user and print out its unique prime factors. For this, do the following: While n is divisible by 2, print the number 2 and divide n by 2. After that, the number is no longer even. While n is divisible by k=3, print the number 3 and divide n by 3. After k no longer divides n, increase k by 2 and repeat. 

Input Format - integer n
Output Format - All prime factors, each one printed on a new line. 

Constraints
n is a positive integer such that n>=2

Sample input and output
Input - 45
Output - 3 5
Explanation:45 can be expressed as 3x3x5 . Hence its prime factors are 3 and 5


Note:Do not write any C++ statements for printing general messages. For example, the following should NOT be present in your program:cout << "Enter a number:",cout << "The computed answer is", etc.cout should be used to print only the computed final output. In addition, do not print unnecessary spaces unless specified in the programThe solution file name should be an C_Q2.cpp

Student submission:
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
if (n%2==0){
cout<<"2"<<endl;}
int i=3;
while(i<=n)
{
i=n%i==0;
cout<<i<<endl;
i=i+2;
}
cout<<i<<endl;
}

Grading criterion: Divisibility by k=2 checked and number reduced.
Rating A: Fully Correct
Rating B: Just divisibility checked but number not reduced
Rating C: Totally wrong
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take a positive integer n as input from the user and print out its unique prime factors. For this, do the following: While n is divisible by 2, print the number 2 and divide n by 2. After that, the number is no longer even. While n is divisible by k=3, print the number 3 and divide n by 3. After k no longer divides n, increase k by 2 and repeat. 

Input Format - integer n
Output Format - All prime factors, each one printed on a new line. 

Constraints
n is a positive integer such that n>=2

Sample input and output
Input - 45
Output - 3 5
Explanation:45 can be expressed as 3x3x5 . Hence its prime factors are 3 and 5


Note:Do not write any C++ statements for printing general messages. For example, the following should NOT be present in your program:cout << "Enter a number:",cout << "The computed answer is", etc.cout should be used to print only the computed final output. In addition, do not print unnecessary spaces unless specified in the programThe solution file name should be an C_Q2.cpp

Student submission:
#include <iostream>
using namespace std;
int reducer(int a, int b)
{
	while (1)
	{
		if(a%b==0) a=a/b;
		else {return a;}
	}
}
int main() {
	int n;
	int i;
	cin >> n;
	int x=n;
	for(i=2;i<=(x);i++)
	{
		if(n%i==0)
		{
			cout << i << endl; n=reducer(n,i);
		}
	}
	return 0;
}

Grading criterion: Divisibility by k=2 checked and number reduced.
Rating A: Fully Correct
Rating B: Just divisibility checked but number not reduced
Rating C: Totally wrong
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to take a positive integer n as input from the user and print out its unique prime factors. For this, do the following: While n is divisible by 2, print the number 2 and divide n by 2. After that, the number is no longer even. While n is divisible by k=3, print the number 3 and divide n by 3. After k no longer divides n, increase k by 2 and repeat. 

Input Format - integer n
Output Format - All prime factors, each one printed on a new line. 

Constraints
n is a positive integer such that n>=2

Sample input and output
Input - 45
Output - 3 5
Explanation:45 can be expressed as 3x3x5 . Hence its prime factors are 3 and 5


Note:Do not write any C++ statements for printing general messages. For example, the following should NOT be present in your program:cout << "Enter a number:",cout << "The computed answer is", etc.cout should be used to print only the computed final output. In addition, do not print unnecessary spaces unless specified in the programThe solution file name should be an C_Q2.cpp

Student submission:
#include<iostream>
using namespace std;
int main(){
int n,k=2;
cin>>n;
for(int i=1;i>0;i++){
if(n%k==0){
cout<<k<<endl;
n=n/k;}
k++;
}
return 0;
}

Grading criterion: Divisibility by k=2 checked and number reduced.
Rating A: Fully Correct
Rating B: Just divisibility checked but number not reduced
Rating C: Totally wrong
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to take a positive integer n as input from the user and print out its unique prime factors. For this, do the following: While n is divisible by 2, print the number 2 and divide n by 2. After that, the number is no longer even. While n is divisible by k=3, print the number 3 and divide n by 3. After k no longer divides n, increase k by 2 and repeat. 

Input Format - integer n
Output Format - All prime factors, each one printed on a new line. 

Constraints
n is a positive integer such that n>=2

Sample input and output
Input - 45
Output - 3 5
Explanation:45 can be expressed as 3x3x5 . Hence its prime factors are 3 and 5


Note:Do not write any C++ statements for printing general messages. For example, the following should NOT be present in your program:cout << "Enter a number:",cout << "The computed answer is", etc.cout should be used to print only the computed final output. In addition, do not print unnecessary spaces unless specified in the programThe solution file name should be an C_Q2.cpp

Student submission:
#include<simplecpp>
main_program{
	int n,k,i=1;
	cin>>n;
	repeat(i){
	if (n%2==0) cout<<"2"<<endl<<n/2;
	else if (n%3==0) cout<<"3"<<endl<<n/3;
	else if (n%k==0) cout<<k<<endl<<n/k;
	k=k+2;
i=i+1;}

}

Grading criterion: Divisibility by k=2 checked and number reduced.
Rating A: Fully Correct
Rating B: Just divisibility checked but number not reduced
Rating C: Totally wrong
Rating D: 0
Assigned grade: A