CodeGraderBench/CodeGraderBench huggingface dataset:
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<simplecpp>

main_program{
int n,m=0,flag=1;
cin>>n;
if (n==n%10){
	 m=n;
	 flag=0;}
 while (flag){
	 m=m*10+n%10;
	 n=n-n%10;
	 n=n/10;
	 if (n==n%10){
		 m=m*10+n%10;
		 break;}
 }	
cout<<m;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>
#include<cmath>
using namespace std;
int main(){
	int n;
	cin>>n;
	int m=0;
	while(n>0){
	int remainder = n%10;
	n=n/10;
	m =m*10+remainder;
	}
cout<<m;}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

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

int main(){
int m=0,n,c,d1=0,d2;//Extra variables for copying values for further calculation
cin>> n;
c=n;//c is equivalent to n.Next step is for number of digits calculation.
for(d1=0;n>0;d1++){
n=n/10;
}
d2=d1;//d2 is made equivalent to d1,because for FOR condition d1 is needed and d2 is needed in body which will decrease periodically
//By the following loop the remainder c%10 will go to the equivalent position from left side.
//Like in case of 1234 its reverse 4321 can be written as 4321=4*(10^(4-1))+3*(10^(3-1))+2(10^(2-1))+1*(10^(1-1)).
// In first case 4 being 1234%10 and d2=4.Then int c=(1234/10)=123 and d2=d2-1=3
for(int a=0;a<d1;a++){
m=m+(c%10)*(pow(10,d2-1));
c=c/10;
d2--;
}
cout<<m;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

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

int main()
{
	int n=0;
	int k;
	
	cin >>k;
	int x = k;
	
	while(x>0)
	{
		x = x/10;
		n++;
	}
	int ans = 0;
	while(n>0)
	{
		int d = k - (k/10)*10;
		ans = ans + d*pow(10, n-1);
		k = k/10;
		n--;
	}
	cout << ans<<endl;
	
	return 0;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include <simplecpp>
main_program{
int n,m,b,c;
cin>>n;
b=n;
m=0;
while(b!=0)
	{
	c=b%10;
	b=b/10;
	m=m*10;
	m=m+c;
	}
cout<<m;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int x=0;
while(n!=0)
{
int r=n%10;
n=n/10;
x=x*10+r;
}
cout<<x;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>

using namespace std;

int main() {
int n,p=0,m=0,d=0; cin>>n;
p = n;

	while (p!=0) {
	p /= 10;
	d++;
	}

	for (int j=(d-1); j>=0; j--) {
		int l = 1;
		for (int k=1; k<=j; k++) l *= 10;
	m += (n - (n/10)*10)*l;
	n /= 10;
	}

cout<<(m);
return 0;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

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


int nod(int x){
	int j=1;
	for(;x!=0;j++){
		x=(x/10);
	}
	return (j-1);
}

int main(){
	int n;
	cin>>n;
	int N=nod(n);
	int new_n=0;
	for(int j=1;j<=N;j++){
		int R=(n%10);
		new_n=new_n+(R*(pow(10,(N-j))));
		n=(n/10);
	}
	cout<<new_n;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int z=0;

while (n%10==0)
{
n=n/10;

}


int t;

while(t!=0)
{
t=n%10;
n=n/10;


if (t==0)
{
if (n%10 != 0) {cout<<t; t=1;}
}
else cout<<t;


}
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>
using namespace std;
int main()
{
int n;
int digit;
int m=0;
cin>>n;
if(n>0)
{
do
{
digit=n%10;
m=(m*10) + digit;
n= n/10;
}
while(n!=0);
cout<<m;
}
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>
using namespace std;
int main(){ 
int num; 
cin >> num; 
while(num%10==0){
num = num/10;
}
while(num!=0){
int c = num%10; 
cout << c; 
num= num/10; 
}
return 0;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int N,p=0;
cin>>N;
for(int m=N;m>0;m=floor(m/10))
{
p=10*p+m%10;
}
cout<<p<<endl;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>
using namespace std;
int main()
{
int m=0, n, d;
cin >> n;
while(n>0)
{
d=n%10;
n=n/10;
m=m*10+d;
}
cout << m;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>
using namespace std;
int main(){
long int n,m=0;
cin >>n;
while(n!=0){
	m=m*10;
	m+=n%10;
	n=n/10;
	
	}
cout<<m;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

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

int main()
{
	int n,m=0,digit; cin>> n;
	int n1 = n;
	while (n1!=0){
		digit = n1%10;
		n1 = n1/10;
		m += digit;
		m *= 10;
	}	
	m = m/10;
	cout<< m;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include <iostream>
using namespace std;
int main(){
int n,r,y=0;
cin >> n;
if (n>0) {
while(n>0 ) {
r = n%10;
n = n/10;
if (r == 0) {continue;}
y = 10*y + r;
}
}
cout << y;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int r=0;
int rev=0;
if (n==0) cout<<0;
while(n!=0){
r=n%10;
n=n/10;
rev=(rev*10)+r;
}
cout<<rev;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>
using namespace std;
int main()
{
int n,m=0;
cin>>n;
while(n%10==0){
n=n/10;}
while(n>0)
{m=m*10+n%10;
n=n/10;}
cout<<m;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

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

int main(){
int n,m=0;
cin >> n;
while (n%10==0) n=n/10;

while (n>0){
m=m+n%10;
n=n/10;
m=m*10;
}

m=m/10;

cout<<m;

return 0;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>
using namespace std;
int main()
{
 int n,a=0;
 cin>>n;
 for (int i = 1 ; i < 10*n; i++)
 {
  if ((n>0) && (n<10)) a = 10*a + n;
  else a = 10*a + (n%10);
  n = n/10;
 }
 cout<<a;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>
using namespace std;
int main(){
int a,b,c,e,n;
cin>>n;
a=n%10;
e=n/10;
b=e%10;
c=n/100;
cout<<a<<b<<c;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>
using namespace std;
	int main()
	{int n,m,r;
	cin>>n;
	while(n!=0)
	{r=n%10;
	
	n=n/10;
	cout<<r;
	
	
	
	
	
	}
	
	
	
	
	
	
	
	
	
	
	
	}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>
using namespace std;
int main(){
int n,d;
cin>>n;
d=n%10;
while(d==0 && n>0){
n=n/10;
d=n%10;}
while( n>0){
cout<<d;
n=n/10;
d=n%10;}
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include <iostream>
using namespace std;
int main(){
long long int n,x;
cin>>n;
for(long long int i=10;i<=10*n;i*=10)
{
   if(n%i==0)
   continue;
   x=i;
   break;
}
for(long long int p=x;p<=10*n;p*=10)
{
    cout<<(((n%p)-(n%(p/10)))/(p/10));
}
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n,l,m;
cin>>n;
m=(n%10);
n=((n-(n%10))/10);
while(n>=1){
l=n%10;
m=m*10+l;
n=((n-(n%10))/10);}
cout<<m;}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

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

int main()
{

int n,m, num=0,digit,sum=0;
bool flag=0;
cin>>n;
m=n;


while(m>0)
{
m=m/10;
num += 1;
}

m=n;

for(int i=num-1;i>=0;i--)
{
digit=m%10;
m=m/10;
if(digit==0 && flag==0) continue;
else
{
if(digit!=0 && flag==0) {flag=1;}
int prod=1;
for(int l=1;l<=i;l++)
{prod*=10;}
sum+=digit*prod;
}}

cout<<sum;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>
using namespace std;
int main(){
	long long int n,ans;int digit,prev=0;
	cin>>n;
	for(n>0;n>0;n=n/10){digit=n%10;
		ans=10*prev+digit;
		prev=ans;}
	cout<<ans;
	return 0;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

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

int main(){
	int n; cin>>n;
	bool end = true;
	int m = 0;
	while (n!=0){
		int r = n%10;
		int q = n/10;
		n=q;
		if(r==0 && end){
			continue;
		}
		else{
			m = m*10+r;
			end = true;
		}
		
	}
	cout<<m;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>
using namespace std;
int main(){
int num,rev,c;
rev=0;
cin>>num;
while(num>0)
{c=num%10;
rev=rev*10+c;
num=num/10;
}
cout<<rev;
return 0;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>
using namespace std;
int main(){
int n,m=0;
cin>>n;
while(n!=0){
int remainder=n%10;
m=10*m+remainder;
n=n/10;

}
cout<<m;}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

Student submission:
#include<iostream>
using namespace std;
int main()
{ int n,m=0;
  cin>>n;
  while(n%10==0)
  {n=n/10;}
  while(n>0)
  {m=m*10+n%10;
   n=n/10;}
   cout<<m;}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program that takes a positive integer n as input from the user and prints a number m whose digits are in reverse order as compared to n. If the number ends in one or more zeroes, then those zeroes should be ignored while printing the reverse.

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

int main()
{
	int n,p=0;
	cin >> n;
	for(int m=n;m>0;m/=10)
	{
		int d=m%10;
		p=p*10+d;
	}
	cout << p;
}

Grading criterion: Is each digit of the original number correctly extracted
Rating A: Each digit is correctly extracted using modulo 10
Rating B: The digits are neither extracted correctly nor stored in the reverse fashion
Rating C: 0
Rating D: 0
Assigned grade: A