蓝桥杯--等差素数列

https://www.lanqiao.cn/problems/646/learning/

#include<bits/stdc++.h>
using namespace std;
int prime(int x){
    int i,flag=1;
    for(i=2;i<=sqrt(x);i++){
        if(x%i==0){
        flag=0;
        return flag;}
    }
    return flag;
        
}
int main(){
    int k,i,j,book=0;
    for(i=2;i<=10000;i++){
        if(prime(i)){
            for(k=2;k<=1000;k++){
                for(j=2;j<=10;j++){
                    if(!prime(i+(j-1)*k)){
                        book=0;
                        break;
                   }
                    else book++;
                    if(book==9)cout<<k;
               }
           }
       }
            
        
   }

}