Uva 10931 – Parity

Problem Link

Hint:1.Decimal to Binary

2.Count 1


<SOurce COde>

#include<stdio.h>
int main()
{
long long bin[10000],n,i,temp,j,c;
while(scanf(“%lld”,&n)==1 && n)
{i=1;c=0;
while(n!=0)
{
bin[i++]=n%2;
n/=2;
}
printf(“The parity of “);
for(j=i-1;j>0;j–)
{printf(“%lld”,bin[j]);
if(bin[j]==1)
c++;}
printf(” is %lld (mod 2).\n”,c);
}
return 0;
}

Advertisements

About waprogramming

I am in CSE,from CUET
This entry was posted in Uncategorized and tagged , , , . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s