Pagini recente » Cod sursa (job #3167876) | Cod sursa (job #2168360) | Cod sursa (job #1691964) | Cod sursa (job #2641135) | Cod sursa (job #2985073)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int v[800];
int main()
{
int n,cnt=0;
fin>>n;
for(int i=0;i<n;i++)
fin>>v[i];
sort(v,v+n);
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++)
for(int k=j+1;k<n;k++)
if(v[i]+v[j]>=v[k] && v[k]+v[j]>=v[i] && v[i]+v[k]>=v[j])
cnt++;
fout<<cnt;
return 0;
}