Cod sursa(job #2137912)
Utilizator | Data | 21 februarie 2018 09:32:31 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int v[801],i,n,nr=0,j;
int main()
{
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++)
nr=nr+upper_bound(v+1,v+n+1,v[i]+v[j])-v-j-1;
g<<nr;
return 0;
}