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

6 votes303 views2 answers
Document.set() firebasefirestore java
Java
-1 vote307 views2 answers
Java map create with values
Java
0 vote274 views1 answer
Algorithms - transformation
Java
0 vote281 views1 answer
If checkbox checked java
Java
0 vote312 views1 answer
Potion of weakness recipe
Java
0 vote296 views2 answers
Open gallery android
Java
-1 vote382 views1 answer
Annotation spring notnull
Java Spring
0 vote295 views1 answer
New keyword in java
Java
0 vote287 views1 answer
How do i get DefaultTableModel rows sum in column in java
Java
0 vote324 views3 answers
Spring boot sql logging
Java