Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include<bits/stdc++.h>
- using namespace std;
- #define ll long long
- bool isPrime(ll int n)
- {
- // Corner cases
- if (n <= 1) return false;
- if (n <= 3) return true;
- // This is checked so that we can skip
- // middle five numbers in below loop
- if (n%2 == 0 || n%3 == 0) return false;
- for (ll int i=5; i*i<=n; i=i+6)
- if (n%i == 0 || n%(i+2) == 0)
- return false;
- return true;
- }
- int main() {
- //ll int m=10000100000;
- ll int t,m,n;
- cin>>t;
- while(t--)
- {
- cin>>m>>n;
- for(ll int i=m;i<=n;i++)
- {
- if(isPrime(i))
- cout<<i<<" ";
- }
- cout<<endl;
- //segmentedsieve(m,n+1);
- }
- //cout<<m;
- }
Add Comment
Please, Sign In to add comment