Cod sursa(job #1909087)
Utilizator | Data | 7 martie 2017 11:37:09 | |
---|---|---|---|
Problema | Oite | Scor | 20 |
Compilator | cpp | Status | done |
Runda | lasm07.03.2017 | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
int n,s,t[1025],nr;
int main()
{
ifstream cin("oite.in");
ofstream cout("oite.out");
cin>>n>>s;
for (int i=1; i<=n; i++)
cin>>t[i];
for (int i=1; i<=n-3; i++)
for (int j=i+1; j<=n-2; j++)
for (int k=j+1; k<=n-1; k++)
for (int z=k+1; z<=n; z++)
{
if (t[i]+t[j]+t[k]+t[z]==s) nr++;
}
cout<<nr;
}