http://mendo.mk/jforum/posts/list/7.page JForum - http://www.jforum.net Dali ovaa zadaca moze da se resi so bitmasks, bidejki na mojot kod so bitmasks vadi nadminat vremenski limit na povekjeto sluchaevi???
]]> http://mendo.mk/jforum/posts/preList/681/3728.page http://mendo.mk/jforum/posts/preList/681/3728.page GMT http://mendo.mk/jforum/posts/preList/681/3730.page http://mendo.mk/jforum/posts/preList/681/3730.page GMT http://mendo.mk/jforum/posts/preList/681/3731.page http://mendo.mk/jforum/posts/preList/681/3731.page GMT [code]
#include <bits/stdc++.h>

using namespace std;
long long power(long long a, long long b)
{
long long c=a;
for(long long i=1; i<b; i++)
{
a*=c;
}
return a;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n,k;
cin>>n>>k;
long long niza[n];
for(long long i=0; i<n; i++)
{
cin>>niza[i];
}
long long sum=0;
long long ways=0;
vector<long long> v;
for(long long i=0; i<power(2,n); i++)
{
if(sum>=k)
{
ways++;
}
sum=0;
for(long long j=0; j<n; j++)
{
if(i&(1<<j))
{
sum+=niza[j];

}
}

}

cout<<ways+1<<endl;
return 0;
}
[/code]]]> http://mendo.mk/jforum/posts/preList/681/3732.page http://mendo.mk/jforum/posts/preList/681/3732.page GMT
Razgledaj za Meet In The Middle.]]> http://mendo.mk/jforum/posts/preList/681/3733.page http://mendo.mk/jforum/posts/preList/681/3733.page GMT