Making Triangle

Solution by Mr.Olimpia — 100 pts

Code / Notes

#include <bits/stdc++.h>
using namespace std;

int main() {
   int N;
   cin >> N;
   vector<int>trian(N);
   for(int i=0; i<N; i++){
    cin >> trian[i];
   }
   int ans=0;
   for(int i=0; i<N; i++){ 
    for(int j=i+1; j<N; j++){
        for(int k=j+1; k<N; k++){
            if(trian[i]+trian[j]>trian[k] && trian[k]+trian[j]>trian[i] && trian[k]+trian[i]>trian[j] && trian[k]!=trian[i] && trian[k]!=trian[j] && trian[i]!=trian[j]){
                ans++;
            }
        }
    }
   }
   cout << ans;
}

Last updated 3 weeks, 3 days ago

« Back to problem