Pagini recente » Cod sursa (job #2667059) | Cod sursa (job #860558) | Cod sursa (job #2098716) | Cod sursa (job #1331261) | Cod sursa (job #2717482)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("zebughil.in");
ofstream fout("zebughil.out");
int dp[(1 << 17) + 5], v[20];
int main()
{
int t = 3;
while(t--)
{
int n, g;
fin >> n >> g;
for(int i = 1; i <= n; ++i)
fin >> v[i];
for(int msk = 1; msk < (1 << n); ++msk)
{
dp[msk] = (1 << 26);
for(int submask = msk; submask; submask = (submask - 1) & msk)
{
}
}
fout << dp[(1 << n) - 1] << '\n';
}
return 0;
}