#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int a[1010];
int main()
{
int i,r,n,t,s;
int top=0;
while(~scanf("%d",&n)&&n!=0)
{
memset(a,0,sizeof(a));
int m=0;
while(n!=0)
{
s=n%2;
n=n/2;
if(s==1)
m++;
a[++top]=s;
}
printf("The parity of ");
while(top!=0)
{
printf("%d",a[top--]);
}
printf(" is %d (mod 2).\n",m);
}
return 0;
}
D - Parity UVA - 10931
猜你喜欢
转载自blog.csdn.net/rangran/article/details/81783236
今日推荐
周排行