Cod sursa(job #1605841)
| Utilizator | Data | 19 februarie 2016 15:45:00 | |
|---|---|---|---|
| Problema | Oite | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
#define Tmax 1025
using namespace std;
ifstream in("oite.in");
ofstream out("oite.out");
long N, L, a[Tmax], R = 0;
int main(){
in>>N>>L;
for(int i = 1; i <= N; i++){
in>>a[i];
}
for(int i = 1; i <= N; i++){
for(int j = i+1; j <= N; j++){
for(int k = j+1; k <= N; k++){
for(int h = k+1; h <= N; h++){
if (a[i]+a[j]+a[k]+a[h] == L) R++;
}
}
}
}
out<<R;
return 0;
}
