Pagini recente » Cod sursa (job #25928) | Cod sursa (job #265936) | Cod sursa (job #2592751) | Cod sursa (job #207808) | Cod sursa (job #2334847)
#include <fstream>
#include <algorithm>
using namespace std;
int v[805];
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int n,i,j;
/*int cbin(int val)
{
int msk,pos=0,cnt=0;
for(msk=1<<20;msk>0;msk/=2)
{
if(pos+msk<=n && v[pos+msk]>=val)
pos+=msk;
}
if(pos==0)
return 0;
while(v[pos]>=val)
{
if(v[j]+v[pos]>=v[i] && v[pos]+v[i]>=v[j] )
if(v[pos]>=val)
++cnt;
else
return cnt;
pos--;
}
return cnt;
}*/
int main()
{
int k,cnt=0,val;
cin>>n;
for(i=1;i<=n;++i)
cin>>v[i];
sort(v+1,v+n+1);
for(i=1;i<n-1;++i)
{
for(j=1+i;j<n;++j)
{
for(k=j+1;k<=n;++k)
{
int pos=k;
val=v[i]+v[j];
if(v[j]+v[pos]>=v[i] && v[pos]+v[i]>=v[j] )
if(v[pos]>=val)
++cnt;
}
}
}
cout<<cnt;
return 0;
}