Cod sursa(job #2803238)
| Utilizator | Data | 19 noiembrie 2021 18:05:40 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int v[100005];
int main()
{
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int n;
for(int i=1;i<=n;i++)
cin>>v[i];
sort(v+1,v+n+1);
int a=0;
for(int i=1;i<=n-2;i++)
{
for(int j=i+1;j<=n-1;j++)
{
int p=j+1,cnt=0;
while(v[p]<=v[i]+v[j] && p<=n)
{
p++;
cnt++;
}
a=a+cnt;
}
}
cout<<a;
return 0;
}
