Cod sursa(job #1653242)
Utilizator | Data | 15 martie 2016 20:23:19 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n,i,j,k,a[801],m=0;
int main()
{
fin>>n;
for(i=1;i<=n;++i)
fin>>a[i];
sort(a+1,a+n+1);
for(i=1;i<=n;++i)
for(j=i+1;j<=n;++j)
for(k=j+1;k<=n;++k)if(a[i]+a[j]>=a[k] && a[i]+a[k]>=a[j] && a[j]+a[k]>=a[i])++m;
fout<<m;
return 0;
}