Cod sursa(job #689072)
| Utilizator | Data | 24 februarie 2012 09:16:31 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int v[3001];
int main()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int i,n,j,r,k,x;
f>>n; k=0;
for (i=1;i<=n;i++)
{
f>>x;
v[i]=x;
}
sort(v+1,v+n+1);
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
for(r=j+1;r<=n;r++)
if(v[r]<=v[i]+v[j])k++;
g<<k;
f.close();
g.close();
return 0;
}
