Cod sursa(job #2137975)
Utilizator | Data | 21 februarie 2018 10:34:06 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n,s,i,j,nr,x,a[10001];
int main()
{fin>>n;
for(i=1;i<=n;i++){
fin>>a[i];
}
sort(a+1,a+n+1);
for(i=1;i<=n;i++){
for(j=i+1;j<n;j++){
nr=a[i]+a[j];
x=upper_bound(a+1,a+n+1,nr)-a;
s=x-j-1+s;
}
}
fout<<s;
return 0;
}