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