Pagini recente » Cod sursa (job #350302) | Cod sursa (job #390096) | Cod sursa (job #3122728) | Cod sursa (job #1015633) | Cod sursa (job #1516660)
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
int v[850],n,i,j,k,sum=0,mod=0;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int binary(int st, int dr,int x)
{
int m=(st+dr)/2;
while(st<=dr)
{
m=(st+dr)/2;
if(v[m]<=x)
st=m+1;
else dr=m-1;
}
m=(st+dr)/2;
if(v[m]>x) m--;
if(v[m]==x) return m;
else return 0;
}
int main()
{
in.sync_with_stdio(false);
out.sync_with_stdio(false);
in>>n;
for(i=0;i<n;i++)
in>>v[i];
sort(v,v+n);
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
sum=v[i]+v[j];
for(k=j+1;k<n;k++)
if(v[k]<=sum) mod++;
}
out<<mod;
return 0;
}