Cod sursa(job #2486296)
Utilizator | Data | 2 noiembrie 2019 17:11:33 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int main()
{
int k,p,poz[100];
f>>k>>p;
int rez=1;
for(int j=1;j<=p;j++)
{
f>>poz[j];
}
for(int i=p;i>0;i--)
{
rez+=max(1,(poz[p-i+1]%k));
}
g<<rez;
return 0;
}