Cod sursa(job #2036791)
Utilizator | Data | 11 octombrie 2017 09:19:11 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int v[1000],i,n,j,nr,k;
int main()
{ifstream f("nrtri.in");
ofstream g("nrtri.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
for(i=1;i<=n-2;i++)
for(j=i+1;j<=n-1;j++)
{k=j+1;
while(v[i]+v[j]>=v[k] and k<=n)
k++;
nr+=k-j-1;
}
g<<nr;
return 0;
}