Cod sursa(job #2444997)
Utilizator | cosmin blotucosmin | Data | 2 august 2019 10:33:36 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int v[8001], i, j, k, n, cnt;
int main()
{
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 - 1; ++ j)
for(k = j + 1; j <= n; ++ k)
if(v[k] <= v[i] + v[j]) cnt ++;
else break;
g << cnt;
return 0;
}