Cod sursa(job #3329433)
| Utilizator | Data | 13 decembrie 2025 10:36:34 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.72 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int v[1001];
int main()
{
int n;
fin>>n;
for(int i=1;i<=n;i++){
fin>>v[i];
}
sort(v+1,v+n+1);
long long cnt=0;
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
int sum=v[i]+v[j];
int st=j+1,dr=n,rez=j;
while(st<=dr){
int mij=(st+dr)/2;
if(v[mij]<=sum){
st=mij+1;
rez=mij;
}else{
dr=mij-1;
}
}
cnt+=rez-j;
}
}
fout<<cnt;
return 0;
}
