Cod sursa(job #2976847)
Utilizator | Mitrica Alessia alessiamtr12 | Data | 10 februarie 2023 10:50:27 |
---|---|---|---|
Problema | Oite | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <fstream>
#include<map>
#include<algorithm>
using namespace std;
ifstream fin("oite.in");
ofstream fout("oite.out");
map<int,int>mp;
int n,L,sol;
int v[1025];
int main()
{
fin>>n>>L;
for(int i=1;i<=n;i++)
fin>>v[i];
sort(v+1,v+n+1);
for(int i=1;i<n;i++)
{
for(int j=i+1;j<=n;j++)
{
if(v[i]+v[j]>L)
break;
sol+=mp[L-v[i]-v[j]];
}
for(int j=1;j<i;j++)
mp[v[i]+v[j]]++;
}
fout<<sol;
return 0;
}