Cod sursa(job #1650401)
Utilizator | Data | 11 martie 2016 18:07:09 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int v[801];
int main()
{
int n,i,s,c=0,j,k;
in>>n;
for(i=1; i<=n; i++)
in>>v[i];
sort(v+1, v+n+1);
for(i=1; i+2<=n; i++)
{
k=1;
for(j=i+1; j+1<=n; j++)
{
while(k<=n && v[i]+v[j]>=v[k])
k++;
if(k>j)
c+=k-j-1;
}
}
out<<c;
return 0;
}