Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals), problem: (F) Bamboo Partition Solution In C/C++

By | 2017-07-24T17:50:48+00:00 July 24th, 2017|Categories: Uncategorized|Tags: , , , , , , , , , |

#include<cstdio> #include<algorithm> using namespace std; int n,a[110]; long long k,ans=0; int main(){ scanf("%d%lld",&n,&k); for (int i=1; i<=n; i++) scanf("%d",&a[i]); for (long long l=1,r; l<=1LL<<62; l=r+1){ // printf("%lld %lld\n",l,r); long long cnt=0,weight=0; r=1LL<<62; for (int i=1; i<=n; i++){ cnt+=(((a[i]-1)/l)+1)*l-a[i]; weight+=(a[i]-1)/l+1; if ((a[i]>l) && ((a[i]-1)/((a[i]-1)/l) < [...]