how to count distinct elements of an array which contains different values that are strings

Question


#include<bits/stdc++.h>
using namespace std;
void solve()
{
    int n,cnt;
    cin >> n;
    string s,root="";
    vector<string>x;
    for(int i=0; i<n; i++)
    {
        cin >> s;
        sort(s.begin(),s.end());
        for(int i=0; i<s.size(); i++)
        {
            if(s[i] != s[i+1])
            {
                root+=s[i];
            }
        }
        x.push_back(root);
        root="";
    }
    cnt=0;
    for(int j=1; j<x.size(); j++)
    {
        if(x[j]!=(x[j-1]))
        {
           cnt++;
        }

        //cout << x[j] <<" ";
    }
     cout << cnt+1;
    
   
}
int main()
{
    solve();
}

`here i wanted to compare the strings as they were same or not. i wanted to print how many distinct strings there are

i tried to store the strings in a array of strings.help me solve this problem.`

Side notes: (1) [#include ](https://stackoverflow.com/questions/31816095/why-should-i-not-include-bits-stdc-h) (2) [using namespace std](https://stackoverflow.com/questions/1452721/why-is-using-namespace-std-considered-bad-practice) — wohlstad, Mar 22 '23 at 15:50
An easy way looks like using [`std::set`](https://en.cppreference.com/w/cpp/container/set). — MikeCAT, Mar 22 '23 at 15:50
My favorite one liner: `auto count_distinct_entires = std::set{container.begin(), conteiner.end()}.size();` — NathanOliver, Mar 22 '23 at 15:52
Is it normal you sort your word? Do you want to count distinct anagram? — Jarod42, Mar 22 '23 at 15:55
What is the problem? Does this code work? If not, how does it fail? — Drew Dormann, Mar 22 '23 at 15:59
Judging by our code, you consider "ab", "ba", and "aab" to be "the same"? — molbdnilo, Mar 22 '23 at 15:59
here is the problem link @Jarod42 https://codeforces.com/contest/975/problem/A — Fahimul Haque, Mar 22 '23 at 16:01
You don't sort `x`, so you cannot apply (your own version of )`std::unique` on it. — Jarod42, Mar 22 '23 at 16:08

ads169573 · Answer 1 · 2023-03-28T07:44:25.440

0

this can be accepted

#include<iostream>
#include<set>
#include<string>

void solve()
{
    int n,cnt;
    std::cin >> n;
    std::set<std::set<char>> st;
    std::string s;
    for(int i=0; i<n; i++)
    {
        std::cin >> s;
        std::set<char> t{s.begin(),s.end()};
        st.insert(t);
    }
    std::cout << st.size();
}
int main()
{
    solve();
}

use set to store unique letter of the string as a root, then use another set to store different root

edited Mar 28 '23 at 07:44

answered Mar 22 '23 at 16:20

ads169573

1
1

https://codeforces.com/contest/975/submission/198647431 – Fahimul Haque Mar 22 '23 at 16:23
even shorter: `root.emplace(s.begin(), s.end());` – Jarod42 Mar 22 '23 at 17:38
You should **never** recommend the use of `#include` in an answer on Stack Overflow. – Adrian Mole Mar 27 '23 at 05:45
I just copy it from his code haha – ads169573 Mar 28 '23 at 07:28

how to count distinct elements of an array which contains different values that are strings

1 Answers1