Cod sursa(job #2629693)
| Utilizator | Data | 22 iunie 2020 12:24:29 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int v[800],put;
int main()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n, i, j, k, cnt=0;
f>>n;
for(i=0; i<n; i++){
f>>v[i];
}
sort(v, v+n);
for(k=n-1;k>1;k--){
i=0;
j=k-1;
while(i<j){
if(v[i]+v[j]<v[k]){
i++;
}
else if(v[i]+v[j]>=v[k]) {
cnt+=j-i;
j--;
}
}
}
g<<cnt<<'\n';
f.close();
g.close();
return 0;
}
