just to be precise, the updated code (which still doesn't work for the same problem) is:
include
using namespace std;
include
class getprime
{ int * x;
int div;
public:
int printprime(int ,int);
};
int getprime::printprime(int n1, int n2)
{ bool prime(true);
// if(n2 == 1)
// {return 1;}
x = new int [n2];
x = & n1;
while(*x <= n2)
{
if(n1 == 1){n1++;}
{
div = n1;
do{ if((*x)%(div-1) != 0)
{ prime = true;
}
else
{prime = false ;}
div--;
}while(div != 2 && prime);
if(prime)
printf("%d \n",*x); // PRIMES between n1 and n2
(*x)++;
}
}
// delete x;
}
int main()
{ int i,tcases; // number of cases to analyze
int *cases, *x;
getprime primeobj;
scanf("%d", &tcases);
if(tcases >10) return 1;
cases = new (nothrow) int[2];
for(i=0;i { scanf("%d",&cases[0]);
scanf("%d", &cases[1]);
printf("%d %d \n",cases[0],cases[1]);
primeobj.printprime(cases[0],cases[1]);
printf("\n");
}
//delete [] cases;
}