Pagini recente » Cod sursa (job #3126223) | Cod sursa (job #2491748) | Cod sursa (job #2208332) | Cod sursa (job #1951780) | Cod sursa (job #1523316)
#include<fstream>
#include<vector>
#define MAX 1030
using namespace std;
ifstream fin("oite.in");
ofstream fout("oite.out");
int n, i, j, sm, k, c, nr;
int a[1025];
vector<int> s[MAX];
int main()
{
fin >> n >> sm;
for(int i = 1; i <= n; i++)fin >> a[i];
for(int i = 1; i < n; i++)
{
for(int j = i + 1; j <= n; j++)
{
c = sm - a[i] - a[j];
if(c > 0)
for(int k = 0; k < s[c%MAX].size(); k++)
if(s[c%MAX][k] == c)
nr++;
}
for(int j = 1; j < i; j++)s[(a[i]+a[j])%MAX].push_back(a[i] + a[j]);
}
fout << nr;
return 0;
}