# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305421 | daniel920712 | Packing Biscuits (IOI20_biscuits) | C++14 | 1094 ms | 384 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 <stdio.h>
#include <string.h>
using namespace std;
long long con[105]={0};
long long count_tastiness(long long x,vector<long long> a)
{
long long ans=1,t=0,N=a.size(),i,now,tt=0,j,k;
memset(con,0,sizeof(con));
for(i=0;i<N;i++) tt+=(1<<i)*a[i];
for(i=1;i<=tt;i++)
{
for(j=0;j<N;j++) con[j]=a[j];
for(j=0;j<x;j++)
{
t=i;
for(k=N-1;k>=0;k--)
{
while(t>=(long long) (1<<k)&&con[k])
{
con[k]--;
t-=(long long) (1<<k);
}
}
if(t) break;
}
if(j==x) ans++;
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |