# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
358174 | juggernaut | 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>
#ifndef EVAL
#include"grader.cpp"
#endif
using namespace std;
typedef long long ll;
ll count_tastiness(ll x,vector<ll>a){
if(x==1){
int k=a.size();
ll ans=1;
for(int i=k-1;i>0;i--){
if(a[i-1]){
a[i-1]+=a[i]<<1ll;
a[i]=0;
}
}
for(int i=0;i<k;i++)ans*=(a[i]+1);
return ans;
}else{
ll cnt=0;
A.resize(62);
for(ll y=0;y<100001;y++){
vector<ll>a=A;
bool flag=1;
for(int i=0;i<61;a[i+1]+=a[i]>>1,i++)
if(y>>i&1){
if(a[i]<x){
flag=0;
break;
}
a[i]-=x;
}
cnt+=flag;
}
return cnt;
}
}