Cod sursa(job #1514411)
Utilizator | Data | 31 octombrie 2015 10:21:28 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <stdio.h>
#include <algorithm>
using namespace std;
FILE *fin=fopen("nrtri.in","r");
FILE *fout=fopen("nrtri.out","w");
int n,i,a[801],ind,s,nr;
int main()
{
fscanf(fin,"%d",&n);
for(i=1;i<=n;i++)fscanf(fin,"%d",&a[i]);
sort(a+1,a+n+1);
for(i=1;i<n-1;i++)
{
s=a[i]+a[i+1];
ind=upper_bound(a+1,a+n+1,s)-a;
ind --;
nr+=(ind-i-1);
}
fprintf(fout,"%d",nr);
return 0;
}