Cod sursa(job #2512618)
Utilizator | Data | 21 decembrie 2019 12:24:42 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <iostream>
#include <algorithm>
#include<fstream>
using namespace std;
int v[801];
int main()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n, i, j,contor=0, k, s;
f>>n;
for(i=1;i<=n;i++) {f>>i;};
sort(v,v+n);
for(i=1;i<=n;i++){
for(j=i++;j<=n;j++){
s=i+j;
};
int st=i;
int dr=n;
while(st<=dr){
int med=(st+dr)/2;
if(v[med]<=s){
k=med;
st=med+1;
}
else{
dr=med-1;
}
}
contor=contor+k;
}
g<<contor;
return 0;
}