Making Triangle

Solution by TioPatinhas — 100 pts

Code / Notes

#include <bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin >> n;
    vector<long long> l(n);
    for (auto i& : l) cin >> l[i];

    int formas = 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 (l[i] != l[j] && l[j] != l[k] && l[i] != l[k]) {
                    
                    long long a = l[i];
                    long long b = l[j];
                    long long c = l[k];

                    if (a > b) swap(a, b);
                    if (b > c) swap(b, c);
                    if (a > b) swap(a, b);

                    if (a + b > c) {
                        formas++;
                    }
                }

            }
        }
    }

    cout << formas;

Last updated 3 weeks, 3 days ago

« Back to problem