Cod sursa(job #307668)
Utilizator | Data | 24 aprilie 2009 17:15:03 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<fstream.h>
long long a[801],i,j,k,nr,n;
int main()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
f>>n;
for (i=1;i<=n;i++)
f>>a[i];
nr=0;
for (i=1;i<=n-2;i++)
for (j=i+1;j<=n-1;j++)
for (k=j+1;k<=n;k++)
if (a[i]+a[j]>=a[k] && a[i]+a[k]>=a[j] && a[k]+a[j]>=a[i]) nr++;
g<<nr;
g.close();
return 0;
}