Pagini recente » Cod sursa (job #2142048) | Cod sursa (job #1276368) | Cod sursa (job #2081839) | Cod sursa (job #2751436) | Cod sursa (job #1564820)
#include<fstream>
#include<vector>
#define mod 7919
using namespace std;
ifstream f("oite.in");
ofstream g("oite.out");
vector <long> vector_hash[mod];
long long c,l,lana,s,oite[1030];
int main()
{
f>>c>>l;
for(int i=1;i<=c;i++)
f>>oite[i];
for(int i=1; i<c; i++)
{
for(int j = i+1 ; j <= c; j++)
{
s = l - oite[i] - oite[j];
int sum = s % mod;
if(sum >= 0)
for(int k = 0; k < vector_hash[sum].size(); k++)
if(vector_hash[sum][k] == s)
lana++;
}
for(int j = 1;j < i;j++)
{
long long sum = oite[i]+oite[j];
vector_hash[sum%mod].push_back(sum);
}
}
g << lana <<"\n";
return 0;
}