Pagini recente » Cod sursa (job #1443061) | Cod sursa (job #2518517) | Istoria paginii runda/simulare.oji.2015 | Cod sursa (job #2624560) | Cod sursa (job #1605794)
#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 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);
ll sz = v[n].size();
bool _t = 0;
myType T;
for(int i = 0; i < sz && !_t; i++){
T = v[n][i];
if (T.s == x && T.a != a && T.b != b && T.a != b && T.b != a ) R++;
}
}
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++){
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/6<<'\n';
return 0;
}