Cod sursa(job #2440324)
Utilizator | Data | 18 iulie 2019 10:36:24 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,v[1000],cnt;
int main()
{
f >> n;
for(int i=1;i<=n;i++)
f >> v[i];
sort(v+1,v+n+1);
for(int i=1;i<=n-2;i++)
for(int j=i+1;j<=n-1;j++)
for(int h=j+1;h<=n;h++)
if(v[h]<=v[i]+v[j])
cnt++;
else
break;
g << cnt;
}