Cod sursa(job #2936322)
Utilizator | Data | 8 noiembrie 2022 17:19:14 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ntri.in");
ofstream fout ("ntri.out");
int v[803],cnt;
int main()
{
int n;
fin>>n;
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++)
{
for (int k=j+1; k<=n; k++)
{
if (v[k]<=v[i]+v[j] && v[i]<=v[k]+v[j] && v[j]<=v[i]+v[k])
cnt++;
}
}
}
fout<<cnt;
return 0;
}