Pagini recente » Cod sursa (job #1208268) | Cod sursa (job #2130850) | Cod sursa (job #2042183) | Cod sursa (job #1757948) | Cod sursa (job #1502525)
#include<stdio.h>
#include<vector>
using namespace std;
long long int c,l,sol;
#define MOD 7919
vector<long long int>ha[MOD];
int main()
{
freopen("oite.in","r",stdin);
freopen("oite.out","w",stdout);
scanf("%lld%lld",&c,&l);
long long int lana[c+1];
for(int i=0; i<l; i++) scanf("%lld",&lana[i]);
for(int i=0; i<c-1; i++)
{
for(int j=i+1; j<c; j++)
{
long long value=l-lana[i]-lana[j];
if(value<=0) continue;
int key=value%MOD;
for(vector<long long int>::iterator it=ha[key].begin(); it!=ha[key].end(); ++it) if(*it==value) sol++;
}
for(int j = 0; j < i; j++)
{
long long val = lana[i] + lana[j];
ha[val % MOD].push_back(val);
}
}
printf("%lld",sol);
}