Cod sursa(job #3140343)
Utilizator | Anghelina Vozian vozian.anghelina | Data | 5 iulie 2023 16:15:03 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
int n, rs=0;
int main(){
cin >> n;
int A[n+1];
for(int i=0; i<n; i++){
cin >> A[i];
}
int n1;
n%2==0 ? n1=n/2 : n1=n/2+1;
for(int i=0; i<n1; i++){
for(int j=0; j<n; j++){
for(int k=0; k<n; k++){
i == j ? j++ : j=j;
i == k ? k++ : k=k;
j == k ? k++ : k=k;
if(A[i] + A[j] > A[k]){
rs++;
}
}
}
}
cout << rs/n;
}