Prime Generator

Peter wants to generate some prime numbers for his cryptosystem. Help him! Your task is to generate all prime numbers between two given numbers!

Input

The input begins with the 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 (1 <= m <= n <= 1000000000, n-m<=100000) separated by a space.

Output

For every test case print all prime numbers p such that m <= p <= n, one number per line, test cases separated by an empty line.

Example

CODE:

 #include<iostream>
 #include<math.h>
 #include<string>

 using namespace std;

 string s;
 bool Isprime(int m)//is prime
 {
     if(m==)
         return false;
     int i=(int)sqrt(m);
     for(int j=;j<=i;j++)
     {
         if(m%j==)
             return false;
     }
     return true;
 }

 void primegen(int i,int j)//prime genaerator
 {

     while(i<=j)
     {
         if(Isprime(i))
         {
             char t[];
             sprintf(t,"%d\n",i);

             s=s+t;
         }
         i++;
     }
     s=s+"\n";
 }
 int main()
 {
     s="";
     int k;
     cin>>k;
     int i1,i2;
     while(k>)
     {
         cin>>i1;
         cin>>i2;
         k--;
         primegen(i1,i2);
     }
     cout<<s<<endl;
     return ;
 }

代码运行结果：

2016-12-31 13:15:16