Cod sursa(job #2326954)
| Utilizator | Data | 24 ianuarie 2019 11:59:52 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int v[802], i, j, q, cnt, n;
int main()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
f >> n;
for(i = 1; i <= n; i ++)
f >> v[i];
sort(v + 1, v + n + 1);
for(i = 1; i <= n - 2; i ++)
for(j = i + 1; j < n; j ++)
for(q = j + 1; q <= n && v[i] + v[j] >= v[q]; q ++) cnt ++;
g << cnt;
return 0;
}
