素数的筛选和bool类型的妙用

#include<iostream>
using namespace std;
#define max  10000
bool num[10002];
int pan1,pan2;
void foundprime(){
    for(int i=2;i<=100;i++)
    {
        for(int j=i*i;j<=max;j+=i)
        {    if(num[j]==true)
                num[j]=false;
        }
    }
}
void   chazhao(int number){
    for(int i=2;i<=number/2;i++)
    {
        if(num[i]==true)
        {
            if(num[number-i]==true)
            {
                
                pan1=i;pan2=number-i;
            }
        }
    }
}
                    

int main()
{   int number;    
   
     memset(num,true, sizeof(num));
     num[0]=num[1]=false;
      foundprime();
    while(scanf("%d",&number)!=EOF)
    {  

     chazhao(number);
     cout<<pan1<<" "<<pan2<<endl;
    }
    return 0;
}