Cod sursa(job #3231456)
| Utilizator | Data | 26 mai 2024 16:22:31 | |
|---|---|---|---|
| Problema | Oite | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("oite.in");
ofstream g("oite.out");
unordered_map <int,int> m;
int n,s,a[100005],nr;
int main()
{
f >> n >> s;
for (int i=1; i<=n; i++ )
f >> a[i];
for (int i=1; i<=n; i++ )
{
for (int j=i+1; j<=n; j++ )
if ( s>=a[i]+a[j] )
nr+=m[s-a[i]-a[j]];
for (int j=1; j<i; j++ )
m[a[i]+a[j]]++;
}
g << nr;
return 0;
}
