Cod sursa(job #2326071)
| Utilizator | Data | 23 ianuarie 2019 12:21:05 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | simulare_preoli | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ntri.in");
ofstream fout("ntri.out");
int main()
{
int n,a[101],nrt=0;
fin>>n;
for(int i=1;i<=n;i++){
fin>>a[i];
}
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
for(int k=j+1;k<=n;k++){
if(a[j]>=a[i]+a[k]||a[k]>=a[i]+a[j]||a[i]>=a[j]+a[k]){
nrt++;
}
}
}
}
fout<<nrt-1;
return 0;
}
