Cod sursa(job #427123)
| Utilizator | Data | 27 martie 2010 15:55:57 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int v[801],n,s;
int caut(int i, int j)
{
int k,pas=1<<16;
for(k=0;pas;pas>>=1)
if(k+pas<=n&&v[k+pas]<=v[i]+v[j])
k+=pas;
//g<<i<<"\t"<<j<<"\t"<<k<<"\n";
if(k<j)
return 0;
return k-j;
}
int main()
{
int i,j;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
for(i=1;i<n;i++)
for(j=i+1;j<n;j++)
s+=caut(i,j);
g<<s;
return 0;
}
