Cod sursa(job #2100845)
| Utilizator | Data | 6 ianuarie 2018 14:04:33 | |
|---|---|---|---|
| Problema | Oite | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f ("oite.in");
ofstream g ("oite.out");
int n,sol;
long long k,p;
vector <long long> v[5];
int main()
{
f>>n>>k;
for(int i=1;i<=n;++i)
{
f>>p;
for(int j=0;j<v[3].size();++j) if(v[3][j]+p==k) ++sol;
for(int t=2;t>=1;--t)
{
for(int j=0;j<v[t].size();++j)
{
if(v[t][j]+p<=k) v[t+1].push_back(v[t][j]+p);
}
}
v[1].push_back(p);
}
g<<sol;
return 0;
}
