# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
304411 | Masalmah | Packing Biscuits (IOI20_biscuits) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
int count_tastiness(int x, vector<int> a) {
const int N= 100001;
int k= a.size();
int dp[N]= {0};
dp[0]= 1;
for (int i= 0; i< k; i++) {
int cnt= (1<< i);
for (int kk= 0; kk< N; kk++) {
if (dp[kk]==(i+ 1)) {
for (int j= 1; j<= a[i]; j++){
if(dp[kk+ (j* cnt)]== 0)
dp[kk+ (j* cnt)]= i+ 2;
}
}
}
}
int an= 0;
for (int i= 0; i< N; i++) if (dp[i]) an++;
return an;
}