Cod sursa(job #1451634)
| Utilizator | Data | 17 iunie 2015 22:15:15 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.73 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int nr=0,a[2000],i,j,n,aux,k;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>a[i];
}
for(i=1;i<n;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-2;i++)
{
for(k=i+1;k<=n-1;k++)
{
for(j=k+1;j<=n;j++)
{
if(a[i]+a[k]>a[j])
{
nr++;
}
}
}
}
g<<nr;
return 0;
}
