特殊データ取得

{#include
#include
bool Is prime(int num)
if(num<=1)
return false;
for(int i=2;i<=sqrt(num);i++)
{
    if(num%i==0)
        return flase;
}
return true;
}
bool Is Daffodil(int num){
int a=num/100,b=num%10%10,c=num%10;
return num==a*a*a+b*b*b+c*c*c;
}
bool Is Perfect(int num);{
int n,i,a,b;
for(b=0,i=1;i<=a/2;i++)
if(!(a%i))
b=b+i;
for(n=0,i=1;i<=b/2;i++;)
if(!(b%i))
n=n+i;
if(n==a&&areturn num=a;
}
bool Is Palindrome(int num){
return num%10==num/100;
}
void main(){
int choose,i,n;
while(true)
{
printf("===========caidan===========
");
printf("1  
2   
3    
4   
0  
");
printf("==========================================
");
scanf("%d",&choose);
switch(choose){
case 1:

printf("1-n     :
");
for(i=1;iif(Is prime(i))
printf("%-4d",i);
printf("
");
break;
case 2:
printf("1-n      :
");
for(i=1;iif(Is Palindrom(i))
printf("%-4d",i);
printf("
");
break;
case 3:
printf("1-n       :
");
for(i=1;iif(Is Daffodil(i))
printf("%-4d",i);
printf("
");
break;
case 0:
return;
break;
default:
printf("    !
");
break;
}
}
}