Cod sursa(job #1886285)
| Utilizator | Data | 20 februarie 2017 20:00:21 | |
|---|---|---|---|
| Problema | Oite | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include<fstream>
#include<tr1/unordered_map>
using namespace std;
using namespace tr1;
ifstream fi("oite.in");
ofstream fo("oite.out");
int n,s,i,j;
int A[1025];
long long rez;
unordered_map <int, int> M;
int main()
{
fi>>n>>s;
for(i=1; i<=n; i++)
fi>>A[i];
for(i=1; i<=n; i++)
{
for(j=i+1; j<=n; j++)
{
if(M.find(s-(A[i]+A[j]))!=M.end())
rez+=M[s-(A[i]+A[j])];
}
for(j=1; j<i; j++)
M[A[j]+A[i]]++;
}
fo<<rez<<"\n";
fi.close();
fo.close();
return 0;
}
