Cod sursa(job #892479)
Utilizator | Data | 26 februarie 2013 09:59:28 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream>
#include<algorithm>
using namespace std;
int a[801],n,i,j,k,pos,h,y,s,x,b[801];
int main ()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
f>>n;
for(i=1;i<=n;i++)
{f>>a[i]; b[i]=a[i];}
sort(a,a+n+1);
k=0;
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
{ s=a[i]+a[j];
for(h=j+1;h<=n;h++)
if(s>=a[h]) k++;}
g<<k<<" ";
return 0;
}