Cod sursa(job #2784236)
| Utilizator | Data | 16 octombrie 2021 09:33:44 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin ("nrtri.in");
ofstream fout ("nrtri.out");
int n, v[810], mx, s, cont=0;
fin >> n;
for (int i=0; i<n; i++)
fin >> v[i];
for (int i=0; i<n; i++)
{
for (int j=i+1; j<n; j++)
{
mx=0;
for (int k=j+1; k<n; k++)
{
mx=max(v[i], max(v[j], v[k]));
s=v[i]+v[j]+v[k]-mx;
if (mx<=s)
cont++;
}
}
}
fout << cont;
return 0;
}
