Cod sursa(job #720540)
Utilizator | Data | 22 martie 2012 18:37:23 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,i,nr=0,j,k;
int a[1000];
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
sort(a+1,a+n+1);
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])
nr++;
else
break;
g<<nr;
return 0;
}