内码对称求解

解题思路:

注意事项:

参考代码:

#include<stdio.h>

int main()

{

    long long int n;

    long long int bin[100];

    int sum=0;

    while(scanf("%lld",&n)!=EOF)

    {

        int i=0,count=0;

        if(n==0)

        {

            bin[0]=0;

            i=1;

        }

        else if(n>0)

        {

            while(n>0)

            {

                bin[i++]=n%2;

                n/=2;

            }

        }

        if(i%2==0)

        {

            for(int j=0;j<i/2;j++)

            {

                if(bin[j]==bin[i-1-j])

                {

                    count++;

                }

            }

            if(count==i/2)

            {

                sum++;

            }

        }

        else

        {

            if(i!=1)

            {

                for(int k=0;k<(i-1)/2;k++)

                {

                    if(bin[k]==bin[i-1-k])

                    {

                        count++;

                    }

                }

                if(count==(i-1)/2)

                {

                    sum++;

                }

            }

        }

    }

    printf("%d\n",sum);

    return 0;

}