Cod sursa(job #3351007)
| Utilizator | Data | 15 aprilie 2026 17:16:14 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <bits/stdc++.h>
#define long long ll
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int main()
{
int n,cont;
fin>>n;
vector<int>v(n);
int suma;
for(int i=0;i<n;i++){
fin >> v[i];
}
sort(v.begin(),v.end());
for (int i = 0; i < n - 2; i++) {
int k=i+2;
for (int j = i + 1; j < n - 1; j++) {
suma = v[i]+v[j];
while(k < n && suma >= v[k]){
k++;
}
cont += (k-1-j);
}
}
fout<<cont;
return 0;
}
