Cod sursa(job #872732)
| Utilizator | Data | 6 februarie 2013 15:44:54 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int a[1000];
int main()
{
int n,i,k=0,j,p;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
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(p=j+1; p<=n; p++)
if((a[i]+a[j]>=a[p]) && (a[p]+a[i]>=a[j]) && (a[j]+a[p] >=a[i])) k++;
else break;
fout << k;
}
