Cod sursa(job #3360556)
| Utilizator | Data | 14 iulie 2026 15:49:32 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int v[801] ;
int main()
{
int n, cnt = 0 ;
fin >> n ;
for(int i = 1 ; i <= n ; i++) {
fin >> v[i] ;
}
for(int i = 1 ; i <= n ; i++) {
for(int j = i + 1 ; j <= n ; j++) {
if(v[j] < v[i]) {
swap(v[j], v[i]) ;
}
}
}
for(int i = 1 ; i <= n - 2 ; i++) {
if(v[i + 1] - v[i] <= min(v[i],min(v[i + 1], v[i + 2])) && v[i + 2] - v[i + 1] <= min(v[i],min(v[i + 1], v[i + 2])) ) {
cnt++;
}
}
fout << cnt ;
return 0;
}
