Pagini recente » Cod sursa (job #2449707) | Cod sursa (job #2645954) | Cod sursa (job #2047558) | Cod sursa (job #2151620) | Cod sursa (job #1033886)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int i, N, v[805], moduri;
void Read()
{
fin>>N;
for(i=1; i<=N; i++)
fin>>v[i];
}
void Solve()
{
sort(v+1, v+N+1);
for(i=1; i<=N-2; i++)
for(int j=i+1; j<=N-1; j++)
for(int k=j+1; k<=N; k++)
{
if(v[i]+v[j]>=v[k])
moduri++;
else
k=N+1;
}
}
void Print()
{
fout<<moduri<<'\n';
}
int main()
{
Read();
Solve();
Print();
return 0;
}