1013 数素数 (20 分)

#include<iostream>
#include<bits/stdc++.h>
#include<algorithm>
#include<string>
#include<stack>
using namespace std;
bool prime(int x){
  for(int i=2;i<=sqrt(x);i++){
    if(x%i==0){
      return false;
    }
  }
  return true;
} 
#define maxn 1000000
int main(){
  int a,b,count=0,t=0;
  cin>>a>>b;  //5   27
  for(int i=2;i<=maxn;i++){
    
    if(prime(i)){
      count++;
      
      if(count>=a&&count<=b){
      
        t++;
        
        if(count==b){
          cout<<i; break;
        
          
      }
      if(t==10){
        cout<<i<<endl;
          t=0;
        
      }
      else  cout<<i<<" ";  
      
    
        
    } 
  }
   
  }
  
 
}