Cod sursa(job #661370)
| Utilizator | Data | 14 ianuarie 2012 13:44:38 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | winner15 | Marime | 0.49 kb |
//Numarare triunghiuri
#include <fstream>
using namespace std;
int n,i,j,nr,aux,a[901],x;
int main()
{
ifstream f("nrtriunghiuri.in");
ofstream g("nrtriunghiuri.out");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if(a[i]>a[j])
{
aux=a[i];
a[i]=a[j];
a[j]=aux;
}
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
for(x=j+1;x<=n;x++)
if(a[i]+a[j]>=a[x])
nr++;
g<<nr;
return 0;
}
