Pagini recente » Cod sursa (job #1477770) | Cod sursa (job #1810571) | Cod sursa (job #2181652) | Cod sursa (job #1386349) | Cod sursa (job #947716)
Cod sursa(job #947716)
#include<fstream>
#include<vector>
#define MOD 5000
using namespace std;
ifstream f("oite.in");
ofstream g("oite.out");
int n,i,j,x,y,sol,l,v[1050];
vector<int>has[MOD];
int main()
{
f>>n>>l;
for(i=1;i<=n;++i)
{
f>>v[i];
}
for(i=1;i<=n;++i)
{
for(j=i+1;j<=n;++j)
if(l-v[i]-v[j]>=0)
{
x=l-v[i]-v[j];
x%=MOD;
y=l-v[i]-v[j];
for(vector<int>::iterator it=has[x].begin();it!=has[x].end();++it)
if(*it==y)
{
++sol;
}
}
for(j=1;j<i;++j)
{
x=(v[i]+v[j])%MOD;
y=v[i]+v[j];
has[x].push_back(y);
}
}
g<<sol<<'\n';
return 0;
}