Cod sursa(job #2279237)
| Utilizator | Data | 9 noiembrie 2018 10:57:11 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("nrti.in");
ofstream out("nrtri.out");
const int L=16;
const int N = 100001;
int v[N];
int n;
int main()
{
int n,nr=0;
in>>n;
for(int i=0;i<n;i++){
in>>v[i];
}
sort(v,v+n);
int r = 0;
int pas = 1<<L;
for(int i=n-1;i!=0;i--){
for(int j=i-1;j!=0;j--){
while(pas!=0){
if(r+pas<=n && v[r+pas]+v[j]>=v[i] && v[r+pas]+v[i]>=v[j] && v[i]+v[j]>=v[r+pas]){
r+=pas;
nr++;
}
pas/=2;
}
}
}
out<<nr;
return 0;
}
