Cod sursa(job #889306)
| Utilizator | Data | 24 februarie 2013 13:09:31 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
long long a[25001],i,j,k,n,nr=0;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for (i=1;i<=n-2;i++)
{
for (j=i+1;j<=n-1;j++)
{
for (k=j+1;k<=n;k++)
{
if ( (a[j]-a[i]>=0) && (a[k]-a[j]>=0) && (a[k]-a[i]>=0) )
{
nr++;
}
}
}
}
g<<nr;
return 0;
}
