Cod sursa(job #2840548)
| Utilizator | Data | 27 ianuarie 2022 23:27:16 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int main()
{
int n;
f >> n;
vector<int>v;
for (int i = 0; i < n; i++)
{
int x;
f >> x;
v.push_back(x);
}
int s=0;
sort(v.begin(),v.end());
for(int i=0;i<n-2;i++)
for(int j=i+1;j<n-1;j++)
{
auto it=upper_bound(v.begin()+j+1,v.end(),v[i]+v[j]);
s += it - (v.begin()+j+1);
}
cout<<s;
return 0;
}