It's a problem on Sphere Online Judge (SPOJ) for prime generator.
Input: number t
of test cases in a single line (t<=10). In each of the next t lines there are two numbers m and n.
Output: For every test case print all prime numbers p such that m <= p <= n.
I have made prime[0] and prime1 as -1.
int range[][] = new int[t][2];
for (int i = 0; i < t; i++) //take t ranges
{
for(int j = 0; j < 2; j++)
{
range[i][j] = sc.nextInt();
}
}
for(int i = 0; i < t; i++)
{
int prime[] = new int[range[i][1]+1];
for(int k = 2; k <= range[i][1]; k++)
{
prime[k] = k;
}
prime[0] = -1;
prime[1] = -1;
for(int k = 2; k <= range[i][1]; k++)
{
for(int m = k + 1; m < range[i][1]; m++)
{
int x = prime[k];
if(prime[m] % x == 0)
{
prime[m] = 0;
}
}
}
}
I tried solving it by the sieve of eratosthenes. The output is:
Exception in thread "main" java.lang.ArithmeticException: / by zero