Pagini recente » Cod sursa (job #1549966) | Cod sursa (job #1466764) | template/meeting-under-construction | Cod sursa (job #1314866) | Cod sursa (job #952890)
Cod sursa(job #952890)
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("oite.in");
ofstream fout("oite.out");
const int MAXC = 1030 , mod = 13001;
int c[MAXC], C, L, nr, s;
vector <int> has[mod];
int main()
{
int i, j, k, aux, aux2;
fin >> C >> L;
for(i=0; i<C; ++i)
fin >> c[i];
for(i=0; i<C; ++i)
{
for(j=i+1; j<C; ++j)
{
s = c[i] + c[j];
if(s >= L) continue;
aux = s%mod;
aux2 = (L-s)%mod;
for(k=0; k<has[aux2].size(); ++k)
{
if(has[aux2][k] == L-s)
nr++;
}
}
for(j=0; j<i; ++j)
{
s = c[i] + c[j];
aux = s%mod;
has[aux].push_back(s);
}
}
fout << nr;
fin.close();
fout.close();
return 0;
}