Cod sursa(job #1341682)
| Utilizator | Data | 12 februarie 2015 23:51:01 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f ("nrtri.in");
ofstream g ("nrtri.out");
int v[800];
int main()
{
int n,i,cont,j,k;
f>>n;
for (i=0;i<n;++i)
f>>v[i];
cont=0;
sort (v,v+n);
for (i=0;i<n-2;++i)
{
for (j=i+1;j<n-1;++j)
{
for (k=i+2;k<n;++k)
{
if (v[i]+v[j]>v[k] && v[j]+v[k]>v[i] && v[i]+v[k]>v[j])
++cont;
}
}
}
g<<cont;
return 0;
}
