Cod sursa(job #1237119)
Utilizator | Stoiean Tudor tudor00 | Data | 3 octombrie 2014 10:12:17 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream in("numararetriunghi.in");
ofstream out("numararetriunghi.out");
int i,n,l,m,q,j,cnt=0,aux,v[30002];
in>>n;
for(i=1;i<=n;i++) in>>v[i];
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
{
if (v[i]>=v[j])
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
}
}
for(l=1;l<=n;l++)
for(m=l+1;m<=n;m++)
for(q=m+1;q<=n;q++)
{
if(v[l]+v[m]>=v[q] && v[l]+v[q]>=v[m] && v[q]+v[m]>=v[l]) cnt++;
}
out<<cnt;
return 0;
}