Cod sursa(job #3360544)
| Utilizator | Data | 14 iulie 2026 15:21:44 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 75 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.99 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int v[100000];
int main()
{
int n, i, j, k, nr=0;
in>>n;
for(i=0; i<n; i++)
{
in>>v[i];
}
for(i=0; i<n-2; i++)
{
for(j=i+1; j<n-1; j++)
{
for(k=j+1; k<n; k++)
{
if(v[i]==max(max(v[i],v[j]),v[k]))
{
if(v[j]+v[k]>=v[i])
{
nr++;
}
}
else if(v[j]==max(max(v[i],v[j]),v[k]))
{
if(v[i]+v[k]>=v[j])
{
nr++;
}
}
else
{
if(v[j]+v[i]>=v[k])
{
nr++;
}
}
}
}
}
out<<nr;
return 0;
}
