Cod sursa(job #809660)
| Utilizator | Data | 8 noiembrie 2012 19:57:08 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream>
#include<algorithm>
using namespace std;
main()
{
short int s1,i,n, a[802],poz;
int s,sum=0;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
f>>n;
for(i=1; i<=n; i++)
f>>a[i];
if(n>=3){
sort(a+1,a+n+1);
for(int j=1; j<n-1; j++)
{
poz=j+2;
for(int k=poz; k<=n; k++){
s=a[j]+a[poz-1];
for(i=k; i<=n; i++ )
if(s>=a[i]) sum++; else break;
}
}
}
g<<sum;
}
