Cod sursa(job #1425588)
| Utilizator | Data | 27 aprilie 2015 19:05:14 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,v[801],nr;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
sort(v+1, v+n+1);
for(int i=1;i<n-1;i++){
for(int j=i+1;j<n;j++)
{
int st=j+1;
int dr=n;
while(st<=dr)
{
int m=(st+dr)/2;
if(v[m]<=v[i]+v[j])
st=m+1;
else
dr=m-1;
}
nr+=(dr-j);
}
}
g<<n;
return 0;
}
