Cod sursa(job #2090802)
| Utilizator | Data | 18 decembrie 2017 19:06:30 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int v[1001];
int main()
{
int n,ok=0,cnt=0;
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
sort(v+1,v+n+1);
for(int j=1;j<=n;j++)
{
for(int i=1;i<j;i++ )
{
while(cnt<n&&v[ok+ 1]<=v[j]+v[i])
cnt++;
ok+= max(0,cnt-j);
}
}
out<<ok<<'\n';
return 0;
}
