code::black开发工具，C语言项目：查找四位可逆素数、可逆质数、可逆prime数

#include <stdio.h> #include <stdlib.h> #include <math.h> #include <stdbool.h> #include "nixu_first_test.h" #include "nixu_zong4.h" #include "prime.h" #define MAX 1000 int main() {//所有四位可逆素数 //printf("%d",ss); int i,nxi; int knss[MAX]; int j=0,num=0; //printf("%d\n",max(2,3));//试验头文件 for(i=1001;i<=9999;i=i+2){ if(Tprime(i)){ //printf("i is prime:%d\n",i); nxi= nixu3(i); if(Tprime(nxi)){ //printf("nxi is prime:%d\n",nxi); knss[j]=i;//将i and nxi both is prime，i的值存入knss[] num=j++; } } } printf("nixu_prime number: %d!\n",num); for(j=0;j<=num;j++){ printf("%d ",knss[j]); if((j+1)%5 == 0) printf("\n"); } return 0; }