Pagini recente » Cod sursa (job #2907400) | Cod sursa (job #260950) | Cod sursa (job #2421867) | Cod sursa (job #1368371) | Cod sursa (job #1605915)
#include <fstream>
#include <vector>
#include <algorithm>
#define Hmax 1572869
#define Tmax 1025
using namespace std;
ifstream in("oite.in");
ofstream out("oite.out");
typedef long long ll;
struct myType{
ll a, b, s;
};
vector<myType> v[Hmax];
vector<myType>::iterator f;
int N;
ll a[Tmax], L, R = 0;
ll h(ll x){
return x % Hmax;
}
void Find(ll a, ll b, ll x){
ll n = h(x);
for(vector<myType>::iterator i = v[n].begin(); i != v[n].end(); ){
if ((*i).s == x && (*i).a > b && (*i).b > (*i).a){
R++;
if ((*i).a == a+1) i = v[n].erase(i);
else i++;
}
else i++;
}
}
int main(){
in>>N>>L;
for(int i = 1; i <= N; i++){
in>>a[i];
}
for(int i = 3; i <= N; i++){
for(int j = i+1; j <= N; j++){
ll s = a[i] + a[j];
if(s <= L ){
myType y = {i, j, s};
ll x = h(s);
v[x].push_back(y);
}
}
}
for(int i = 1; i <= N; i++){
for(int j = i+1; j <= N; j++){
ll s = L - a[i] - a[j];
if(s >= 0 ){
Find(i, j, s);
}
}
}
out<<R<<'\n';
return 0;
}