You are given n real numbers in an array. A number in the array is called a decimal dominant if it occurs more than n/10 times in the array. Give an O(n) time algorithm to determine if the given array has a decimal dominant.
Implement a function getbits, that returns the(right adjusted) n bits that begin at position p of an integer. Assume bit position 0 is at the right end and that n and p are sensible positive values.
cin>>X;
ReplyDeletei=sqrt(X);
j=sqrt(X-i*i);
while(i>=0 && i>=j)
{
if((i*i)+(j*j)==X)
{count = 1;break;}
i--;
j=sqrt(X-i*i);
}
if(count == 1)
cout<<"Yes";
else cout<<"No";