find sum of subarray of array in c++
#include<iostream>
using namespace std;
#include <math.h>
void printPowerSet(string set, int set_size)
{
int pow_set_size = pow(2, set_size);
long long int counter,j,sum=0,s=0;
for(counter = 0; counter < pow_set_size; counter++)
{
for(j=0;j<set_size; j++)
{
if(counter & (1<<j))
{
sum=set[j]-'0';
s=(s+sum)%1000000007;
}
}
}
cout<<s<<endl;
}
int main()
{
int t,m,i;
char set[100];
cin>>t;
while(t>0)
{
cin>>m;
for(i=0;i<m;i++)
cin>>set[i];
printPowerSet(set, m);
t--;
}
}
#include<iostream>
using namespace std;
#include <math.h>
void printPowerSet(string set, int set_size)
{
int pow_set_size = pow(2, set_size);
long long int counter,j,sum=0,s=0;
for(counter = 0; counter < pow_set_size; counter++)
{
for(j=0;j<set_size; j++)
{
if(counter & (1<<j))
{
sum=set[j]-'0';
s=(s+sum)%1000000007;
}
}
}
cout<<s<<endl;
}
int main()
{
int t,m,i;
char set[100];
cin>>t;
while(t>0)
{
cin>>m;
for(i=0;i<m;i++)
cin>>set[i];
printPowerSet(set, m);
t--;
}
}
No comments:
Post a Comment