Cod sursa(job #2062994)
Utilizator | Gigel Frone Ahile | Data | 11 noiembrie 2017 00:04:06 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include<fstream>
#include<iostream>
#include<math.h>
#define in f
#define out g
using namespace std;
ifstream f ("nrtri.in");
ofstream g ("nrtri.out");
int n;
int v[801];
int r;
int main() {
in >> n;
for(int i = 1; i <= n; i++) {
in >> v[i];
}
sort (v + 1, v + n + 1);
for(int i = 1; i < n; i++) {
for(int j = i + 2; j <= n; j++) {
for(int k = j - 1; k > i; k--) {
if((v[i] + v[j] >= v[k]) && (v[i] + v[k] >= v[j]) && (v[j] + v[k] >= v[i])){
r++;
} else
break;
}
}
}
out << r;
return 0;
}