Pagini recente » Cod sursa (job #1667501) | Cod sursa (job #1291999) | Cod sursa (job #1252059) | Cod sursa (job #1232592) | Cod sursa (job #1546042)
#include<fstream>
#include<vector>
#define mod 9011
#define ll long long
using namespace std;
ifstream f("oite.in");
ofstream g("oite.out");
vector<long>v[mod];
ll c,l,blana,s,oaia_neagra[1030];
int main()
{
f>>c>>l;
for(int i=1;i<=c;i++)
f>>oaia_neagra[i];
for(int i=1;i<c;i++)
{
for(int j=i+1;j<=c;j++)
{
s=l-oaia_neagra[i]-oaia_neagra[j];
int sum=s%mod;
if(sum>=0)
for(int k=0;k<v[sum].size();k++)
if(v[sum][k]==s)
blana++;
}
for(int j=1;j<i;j++)
{
ll sum=oaia_neagra[i]+oaia_neagra[j];
v[sum%mod].push_back(sum);
}
}
g<<blana<<"\n";
return 0;
}