Cod sursa(job #693826)
Utilizator | Data | 27 februarie 2012 17:05:25 | |
---|---|---|---|
Problema | Grupuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include <fstream>
using namespace std;
long long a[100001];
int main()
{
int i,k,n;
ifstream f("grupuri.in");
ofstream g("grupuri.out");
f>>k>>n;
for(i=1;i<=n;++i)
{
f>>a[i];
a[i]+=a[i-1];
}
while(a[n]-a[n-1]>a[n]/k)
{
--n;
--k;
}
g<<a[n]/k;
return 0;
}