Pagini recente » pregatire_oji | Clasament concurs7_1 | Istoria paginii preoni-2005/runda-3/clasament-9-10 | Clasament cerculdeinfo-lectia15-ev_p_s_q_dq_dp | Cod sursa (job #2693302)
#include <fstream>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int laturi[805];
int nrtri,i,x;
int n,ok,minimlat,j,st,dr,mij;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>laturi[i];
}
while(ok==0)
{
ok=1;
for(i=2;i<=n;i++)
{
if(laturi[i]<laturi[i-1])
{
ok=0;
x=laturi[i];
laturi[i]=laturi[i-1];
laturi[i-1]=x;
}
}
}
for(i=1;i<=n-2;i++)
{
for(j=i+1;j<=n-1;j++)
{
minimlat=laturi[i]+laturi[j];
dr=n;
st=j+1;
if(laturi[n]>=minimlat && i!=j)
{
while(st<=dr)
{
mij=(st+dr+1)/2;
if(laturi[mij]>minimlat)
{
dr=mij-1;
}
else
{
st=mij+1;
}
}
nrtri+=dr-j;
}
}
}
g<<nrtri;
}