AC:
ll ans=0;
ll flag=0;
for(int i=0;i<n;i++)
{
if(a[i]==0) ans++;
if(a[i]==1) flag++;
}
ans=pow(2,ans);
cout<<ans*flag<<endl;//answer
越界:
ll ans=0;
ll flag=0;
for(int i=0;i<n;i++)
{
if(a[i]==0) ans++;
if(a[i]==1) flag++;
}
cout<<pow(2,ans)*flag<<endl;//output
output:
answer:
checker log
还有个疑问?