Cod sursa(job #2326292)
| Utilizator | Data | 23 ianuarie 2019 13:44:55 | |
|---|---|---|---|
| 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 fin("nrtri.in");
ofstream fout("nrtri.out");
int k;
fin>>k;
int s[k+1];
for(int i=0; i<k; ++i)
fin>>s[i];
int p=0;
for(int i=0; i<k; ++i){
for(int j=i+1; j<k; ++j)
for(int l=j+1; l<k; ++l)
if(s[i]+s[j]>=s[l])
if(s[i]+s[l]>=s[j])
if(s[j]+s[l]>=s[i])
++p;
}
fout<<p;
return 0;
}
