Cod sursa(job #2909675)
| Utilizator | Data | 14 iunie 2022 17:18:37 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("nrtri.in");
ofstream fout ("nrtri.out");
int n, v[809];
int sol;
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
sort(v+1, v+1+n);
for(int i=1; i<n-1; i++)
for(int j=i+1; j<n; j++)
for(int k=j+1; k<=n; k++)
if(v[i]+v[j]<v[k])
{
sol+=(k-j-1);
break;
}
fout<<sol;
return 0;
}
