Cod sursa(job #2326254)
Utilizator | valentin neamtu vali221 | Data | 23 ianuarie 2019 13:31:07 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | simulare_preoli | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream e("nrtri.in");
ofstream g("nrtri.out");
int nr,tp,ok,i,j,k,max,f[801];
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++)
{
ok=0;
if(f[i]+f[j]>=f[k])
if(f[j]+f[k]>=f[i])
if(f[i]+f[k]>=f[j])
ok=1;
if(ok==1)
tp++;
}
g<<tp;
return 0;
}