Pagini recente » Cod sursa (job #665887) | Cod sursa (job #155093) | Cod sursa (job #445380) | Cod sursa (job #172236) | Cod sursa (job #1705974)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int v[1000];
int n;
void Read()
{
fin>>n;
for (int i=1;i<=n;i++) fin>>v[i];
fin.close();
}
int caut_bin(int a,int b)
{
int i=0,pas=1<<9;
while (pas!=0) {
if (i+pas<=n && v[a]+v[b]>=v[i+pas]) i+=pas;
pas/=2;
}
return i;
}
int main()
{
Read();
sort(v+1,v+1+n);
int s=0,x,j;
for (int i=1;i<n;i++) {
for (j=i+1;j<=n;j++){
x=caut_bin(i,j);
if (x-j>0) s+=x-j;
}
}
fout<<s;
}