Cod sursa(job #1506138)
| Utilizator | Data | 20 octombrie 2015 01:07:34 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 70 |
| Compilator | c | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <stdio.h>
FILE *fin, *fout;
int main()
{
fin = fopen ("nrtri.in", "r");
fout = fopen ("nrtri.out", "w");
int n,v[801],i,j,k,nr=0;
fscanf(fin,"%d", &n);
for(i=1;i<=n;++i)
fscanf(fin, "%d", &v[i]);
//O(n^3)
for(i=1;i<=n;++i)
for(j=i+1;j<=n;++j)
for(k=j+1;k<=n;++k)
{
if(v[i]+v[j]>=v[k] && v[i]+v[k]>=v[j] && v[j]+v[k]>=v[i]) nr++;
}
fprintf(fout,"%d\n", nr);
fclose(fin);
fclose(fout);
return 0;
}
