Cod sursa(job #1899216)
Utilizator | Data | 2 martie 2017 16:33:20 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int v[810];
int n, i, sol, j, k;
int main () {
ifstream fin ("nrtri.in");
ofstream fout("nrtri.out");
fin>>n;
for (i=1;i<=n;i++)
fin>>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;k<=n;k++)
if (v[i] + v[j] >= v[k])
sol++;
fout<<sol;
return 0;
}