Cod sursa(job #1527540)
Utilizator | Data | 18 noiembrie 2015 12:03:43 | |
---|---|---|---|
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 n,i,s,sum=0,st,k, v[801];
int main()
{
in>>n;
for(i=1; i<=n; i++)
in>>v[i];
sort(v+1, v+n+1);
for(i=1; i+1<n; i++)
{
k=1;
for(st=i+1; st+1<n; st++)
{
while(k<=n and v[i]+v[st]>=v[k])
k++;
if(k>st)
sum+=k-st-1;
}
}
out<<sum;
return 0;
}