Pagini recente » Cod sursa (job #1621688) | Cod sursa (job #2906230) | Cod sursa (job #733904) | Cod sursa (job #2690267) | Cod sursa (job #219578)
Cod sursa(job #219578)
#include<stdio.h>
#define NMAX 131072
long long A[NMAX];
long long sol(long long N,long long K)
{
if( N<0 || K<0 ) return 0; //out of bounds
if( A[N]<=A[0]/K )
return A[0]/K;
else
{
A[0]-=A[N];
return sol(N-1,K-1);
}
}
//int binary(int l1,int l2)
int main()
{
freopen("grupuri.in","r",stdin);
freopen("grupuri.out","w",stdout);
long long N,K;
scanf("%lld%lld",&K,&N);
int i;
for(i=1; i<=N; ++i){
scanf("%lld",&A[i]);
A[0]+=A[i];
}
if( A[N]<=A[0]/K )
printf("%lld\n",A[0]/K);//yeey
else
printf("%lld\n",sol(N,K));
return 0;
}