int digitcount(int x)
{
int r,c=0,i=0,y=x;
while(x!=0)
{
r=x%10;
x=x/10;
c++;
}
while(y!=0)
{
r=y%10;
y=y/10;
i++;
if(i==c-2)
{
return r;
}
}
}
void primecheck(int p)
{
int count=0,j;
for(j=1;j<=p;j++)
{
if(p%j==0)
{
count++;
}
}
if(count==2)
{
printf("3rd digit i.e. %d is prime.",p);
}
else
{
printf("3rd digit i.e. %d is not prime.",p);
}
}
void main()
{
int n,digino;
printf("Enter the number : ");
scanf("%d",&n);
digino=digitcount(n);
primecheck(digino);
getch();
}
0 comments:
Post a Comment