Pagini recente » Cod sursa (job #2868975) | Cod sursa (job #2667641) | Cod sursa (job #1442192) | Cod sursa (job #1097763) | Cod sursa (job #2272130)
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
int main()
{
int pas, v[801], n,i, j, k, rez;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
sort(v+1, v+n+1);
for(i=1; i+2<=n; i++)
{
for(j=i+1; j+1<=n; j++)
{
k=j;
pas=1<<9;
while(pas!=0)
{
if(k+pas<=n && v[k+pas]<=v[i]+v[j])
{
k+=pas;
}
pas/=2;
}
rez+=k-j;
}
}
fout<<rez<<" ";
return 0;
}