Cod sursa(job #2286791)
Utilizator | Cristina Ovidiu Lucian cristina_ovidiu | Data | 20 noiembrie 2018 19:25:17 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in ("nrtri.in");
ofstream out("nrtri.out");
int x[801],n;
int main()
{
int piv1,piv2,piv3;
long long int s=0;
in>>n;
for(int i=0;i<n;++i)
in>>x[i];
sort(x,x+n);
for(piv1=0;piv1<n-2;++piv1)
for(piv2=piv1+1;piv2<n-1;++piv2)
for(piv3=piv2+1;piv3<n;++piv3)
if(x[piv1]+x[piv2]>=x[piv3])++s;
else break;
out<<s;
return 0;
}