Cod sursa(job #1823642)
Utilizator | Data | 6 decembrie 2016 18:04:38 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n,v[101],i,a,b,s,nr=0,j,h;
cin>>n;
for(i=1; i<=n; i++)
cin>>v[i];
sort(v+1,v+n+1);
for(i=1; i<n-1; i++)
{
a=v[i];
for(j=i+1, h = i + 2; j<n; j++)
{
b=v[j];
s=a+b;
//for(h=j+1;h<=n;h++)
while (h <= n && v[h] <= s)
{
nr++;
h++;
}
}
}
cout<<nr;
return 0;
}