Cod sursa(job #2494933)
Utilizator | Data | 18 noiembrie 2019 18:08:53 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int v[801];
int main()
{
int i,n,j,k,cnt=0;
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
sort(v+1,v+n+1);
for(i=1;i<=n-2;i++)
{
for(j=i+1;j<=n-1;j++)
{
k=j+1;
while(v[i]+v[j]>=v[k]&&k<=n)
{
cnt++;
k++;
}
}
}
cout<<cnt;
return 0;
}