Cod sursa(job #1107138)
Utilizator | Data | 13 februarie 2014 17:26:57 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int v[801];
int main()
{
FILE *f, *g;
f=fopen("nrtri.in","r");
g=fopen("nrtri.out","w");
int n,i,j,k,s=0;
fscanf(f,"%d",&n);
for (i=1;i<=n;i++)
fscanf (f,"%d",&v[i]);
sort (v+1,v+n+1);
for (i=1;i<=n-2;i++)
for (j=i+1;j<=n-1;j++)
for (k=j+1;k<=n;k++)
{
if (v[i]+v[j]>=v[k])
s++;
}
fprintf(g,"%d",s);
return 0;
}