Cod sursa(job #502016)
| Utilizator | Data | 17 noiembrie 2010 12:34:31 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int x[805];
ifstream in ("nrtri.in");
ofstream out ("nrtri.out");
int main()
{
int n,i,st,dr,nr=0;
in>>n;
for(i=1;i<=n;i++)
{
in>>x[i];
}
sort(&x[1],&x[n+1]);
for(i=1;i<=n;i++)
{
dr=i+1;
for(st=i+1;st<=n;st++)
{
while(dr<=n && x[i]+x[st]>=x[dr] && x[st]<=x[i]+x[dr])
{
dr++;
}
nr+=dr-st-1;
}
}
out<<nr;
return 0;
}