Cod sursa(job #1501039)
| Utilizator | Data | 12 octombrie 2015 22:52:27 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream fin ( "ntri.in") ;
ofstream fout ( "ntri.out" ) ;
long i,j,k,n,rez;
fin >> n;
long a[n];
rez=0;
for(i = 1;i<=n;i++)
fin >> a[i];
for(i = 1;i<=n-2;++i)
for(j = i+1;j<=n-1;++j)
for(k = j+1;k<=n;++k)
{
if(a[i] + a[k] >= a[j] && a[i] + a[j] >= a[k] && a[k] + a[j] >= a[i])
rez++;
}
fout << rez;
return 0;
}