Cod sursa(job #1202310)
Utilizator | Data | 27 iunie 2014 17:00:30 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
#include <algorithm>
using namespace std;
bool compare(int a,int b){ return (a<b);}
int main()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,v[800],i,j,count=0;
f>>n;
for(i=0;i<n;i++) f>>v[i];
sort(v,v+n,compare);
for(i=0;i<n-2;i++)
for(j=i+1;j<n-1;j++)
{
int s=j+1,d=n-1,m,maxim=j;
while(s<=d)
{
m=(s+d)/2;
if(v[m]<=v[i]+v[j])
{
count++;
s=m+1;
}
else
d=m-1;
}
}
g<<count;
f.close();
g.close();
return 0;
}