Cod sursa(job #394788)
| Utilizator | Data | 11 februarie 2010 16:29:32 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
using namespace std;
int comp(const void *a,const void *b)
{
return *(int*)a-*(int*)b;
}
int v[800];
int main()
{
ifstream f("nrtri.in");
ofstream o("nrtri.out");
int n,k,i,j;
long count=0;
f>>n;
for (i=1;i<=n;i++)
f>>v[i];
qsort(v+1,n,sizeof(int),comp);
for (i=1;i<n-1;i++)
for(j=i+1;j<n;j++)
for (k=j+1;v[k]<=v[i]+v[j];k++)
count++;
o<<count;
return 0;
}
