Submission #67297880

---

Source Code Expand

#include <iostream>
#include <vector>
#include <stack>
#include <set>
#include <algorithm>
#include <queue>
#include <map>
#include <string>
#include <cmath>
using namespace std;

typedef long long ll;

#define FAST_IO std::cin.tie(NULL); std::cout.tie(NULL); std::ios_base::sync_with_stdio(false);
#define SIZE 100005
#define INF 123456789012345
#define MOD 1000000007
#define FLAG 500000

set<string> s;
int n;
vector<string> v;

int main() {
    FAST_IO
    cin >> n;
    for (int i = 0; i < n; i++) {
        string tmp;
        cin >> tmp;
        v.push_back(tmp);
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i == j) continue;
            string tmp = v[i] + v[j];
            s.insert(tmp);
        }
    }

    cout << s.size();
}

Submission Info

Judge Result