Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.*;
- class Prime
- {
- public static void main(String[] args)
- {
- int n,i,j,m;
- Scanner sc = new Scanner(System.in);
- n = sc.nextInt();
- if(n<10)
- {
- int a[][] = new int[n][2];
- for(i=0;i<n;i++)
- {
- for(j=0;j<2;j++)
- {
- a[i][j]=sc.nextInt();
- }
- }
- for(i=0;i<n;i++)
- {
- j=0;
- n=a[i][j];
- m=a[i][j+1];
- if(m<=1000000000 && m>=n && m-n<=100000)
- check(n,m);
- }
- }}
- static void check(int n, int m)
- {
- int flag=1;
- for(int i=n; i<=m; i++)
- {
- if(i==1)
- {
- flag=0;
- break;
- }
- for(int j=2; j<=(int)Math.sqrt(i); j++)
- {
- if(i%j==0)
- {
- flag=0;
- break;
- }
- else
- {
- System.out.println(i+"\n");
- }
- }
- System.out.println("\n");
- }
- }
- }
Add Comment
Please, Sign In to add comment