Pagini recente » Borderou de evaluare (job #2706521) | Cod sursa (job #498937) | Cod sursa (job #3040587) | Borderou de evaluare (job #1314354) | Cod sursa (job #1372902)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int v[801];
int main()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,k=0;
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
for(int i=1;i<n-1;i++)
for(int j=i+1;j<n;j++)
for(int p=j+1;p<=n;p++)
if((v[i]+v[j])>=v[p])
k++;
g<<k;
return 0;
}