Cod sursa(job #1760120)
Utilizator | Data | 20 septembrie 2016 12:41:59 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, i, j, sum, st, dr, m, sol;
sol=0;
cin>>n;
int v[n];
for(i=1; i<=n; i++)
cin>>v[i];
sort(v+1,v+n+1);
for(i=1; i<n-1; i++)
for(j=i+1; j<n; j++){
sum=v[i]+v[j];
st=j+1;
dr=n;
while(dr>st){
m=(dr+st)%2;
if(v[m]>sum)
dr=m;
else{
sol=n-j;
break;
}
}
}
cout<<sol;
return 0;
}