Someone tell do not know how to get out of this


#1

.This is my second problem where I am facing modulo error do not know where I am lagging behind plz someone tell.
long long int i,j;
int value;long long int count=0,value2;
int pro=0;
long long int x=0,y=0;
vectorv;
int c=1e9+7;
for(i=0;i<A.size();i++)
v.push_back(A[i]);
while(pro<13)
{
for(i=0;i<v.size();i++)
{
if(v[i]%2==0)
y++;
else if(v[i]%2!=0)
x++;
v[i]=v[i]/2;
}
count=(count%1000000007+(2*((x%1000000007)*(y%1000000007))%1000000007))%1000000007;
pro++;
x=0;
y=0;
}
return count%1000000007;


#3

Bro, there is nothing much to get confused about this.
You just have to divide the result by 1000000007 and return the remainder you get after division.
For example:
ans=(ans+(count*(n-count)*2))%1000000007;
Here, every time I am updating my answer before that I am dividing the final answer by 1000000007 and storing it back.
Simple! Isn’t it.