Cod sursa(job #2326208)
| Utilizator | Data | 23 ianuarie 2019 13:22:26 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | simulare_preoli | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream e("nrtri.in");
ofstream g("nrtri.out");
int nr,tp,i,j,k,max,f[1000];
e>>nr;
for(i=1;i<=nr;i++)
{
e>>f[i];
}
tp=0;
for(i=1;i<=nr-2;i++)
for(j=i+1;j<=nr-1;j++)
for(k=j+1;k<=nr;k++)
{
max=f[i];
if(f[j]>max)
max=f[j];
if(f[k]>max)
max=f[k];
if(f[i]+f[j]+f[k]-max >= max)
tp++;
}
g<<tp;
return 0;
}
