Pagini recente » Cod sursa (job #40736) | Cod sursa (job #2213803) | Cod sursa (job #2261310) | Cod sursa (job #1846253) | Cod sursa (job #219918)
Cod sursa(job #219918)
#include<stdio.h>
long long nr[100010],sum;
long long solutie(long long k,long long n){
if(sum/k>=nr[n-1])
return sum/k;
sum-=nr[n-1];
return solutie(k-1,n-1);
}
int main(){
freopen("grupuri.in","r",stdin);
freopen("grupuri.out","w",stdout);
long long n,k,i;
scanf("%lld%lld",&k,&n);
for(i=0;i<n;++i){
scanf("%lld",&nr[i]);
sum+=nr[i];
}
printf("%lld\n",solutie(k,n));
fclose(stdin);
fclose(stdout);
return 0;
}