SPOJ Prime1

import java.util.*;
import java.lang.*;

class Main
{
    public static void main (String[] args)
    {

        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int i = 0;
        long n1=0;
        long n2=0;
        while(i<=n){

            n1  = sc.nextLong();
            n2  = sc.nextLong();
            if(n1==1)
            {
                n1++;
            }
            if((n1-n2)<=100000){

            for(long j=n1;j<=n2;j++){

                int count = 0;

                for(long k=2;k<=j/2;k++){
                    if(j%k==0){
                        count = 1;
                    }
                }
                if(count==0){
                    System.out.println(j);
                }

            }
            }
        }


    }
}

Source: stackoverflow.com

Similar codes

0 vote138 views1 answer
How to create java jframe in eclipse
Java
0 vote161 views1 answer
Generate random number in java within a range without repeating with android studio
Java
0 vote154 views1 answer
Fix all 'Implicit call to array '.toString() problems
Java
0 vote177 views1 answer
Search in row and column sorted matrix leetcode
Java
14 votes154 views6 answers
Fibonacci
Java
0 vote152 views1 answer
Show bottom sheet in adapter
Java
1 vote165 views1 answer
How to print the index of an array in java
Java
0 vote145 views1 answer
Java inser at index
Java
4 votes181 views4 answers
Sum of list java
Java
0 vote157 views1 answer
Spring security controlleradvice
Java