Cod sursa(job #2123760)
Utilizator | Diana M MDiana15 | Data | 6 februarie 2018 16:44:07 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.79 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,i,j,v[805],st,dr,mij,nr;
int main()
{
f>>n;
for(i=1; i<=n; i++)
{
f>>v[i];
}
sort(v+1,v+n+1);
for(i=1; i<n-1; i++)
for(j=i+1; j<n; j++)
{
st=j+1;
dr=n;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=v[i]+v[j])
st=mij+1;
else
dr=mij-1;
}
if(v[dr]!=v[j])
{
if(v[dr]<=v[i]+v[j]&&v[dr]+v[i]>=v[j]&&v[j]+v[dr]>=v[i])
{
nr++;
}
}
}
g<<nr;
return 0;
}