Pagini recente » Cod sursa (job #909638) | Cod sursa (job #2975063) | Cod sursa (job #2202696) | Cod sursa (job #2310783) | Cod sursa (job #2104135)
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define sz size
#define pb push_back
#define mp make_pair
#define bg begin
#define nd end
using namespace std;
#define int long long
const int maxn = 100003;
const int maxk = 1003;
int n;
vector<int> v;
int32_t main(){
freopen("nrtri.in","r",stdin);
freopen("nrtri.out","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for(int i=0;i<n;++i){
v.pb(1);
cin >> v[i];
}
sort(v.begin(),v.end());
int ans = 0;
for(int i=0;i<n-1;++i) {
for(int j=i+1;j<n;++j) {
int lb = max(v[i]-v[j],v[j]-v[i]);
int ub = v[i] + v[j];
vector<int>::iterator low,upp;
low = lower_bound(v.begin(),v.end(),lb+1);
upp = upper_bound(v.begin(),v.end(),ub);
int res = upp - low;
if(lb+1 <= v[i] && v[i] < ub) res--;
if(lb+1 <= v[j] && v[j] < ub) res--;
ans += res;
}
}
cout << ans / 2 << '\n';
return 0;
}