Cod sursa(job #2137437)
Utilizator | Data | 20 februarie 2018 19:54:22 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
#include<algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int v[801];
int main()
{
int n,nr=0;
f>>n;
int i;
for(i=1;i<=n;i++)
f>>v[i];
int j;
sort(v+1,v+n+1);
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
{
int s=v[i]+v[j];
int p=upper_bound(v+1,v+n+1,s)-v;
nr+=p-j-1;
}
g<<nr;
return 0;
}