Anagrams

input/code.cpp: In function 'int main()':
input/code.cpp:33:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
   ~~~~~^~~~~~~~~~
input/code.cpp:37:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", tmp);
     ~~~~~^~~~~~~~~~~

#include <cstdio>
#include <cstring>
#include <algorithm>

const int maxn = 400010;

struct Data
{
  char ori[40];
  char sorted[40];
  int len;

  Data(char* input)
  {
    strcpy(ori, input);
    strcpy(sorted, input);
    len = strlen(input);
    std::sort(sorted, sorted + len);
  }
  Data() {}
};

bool cmpData(const Data& p, const Data& q)
{
  return strcmp(p.sorted, q.sorted) < 0;
}

Data data[maxn];

int main()
{
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++)
  {
    char tmp[40];
    scanf("%s", tmp);
    data[i] = Data(tmp);
  }
  std::sort(data, data + n, cmpData);
  int cnt = 0;
  for (int i = 0; i < n;)
  {
    int j = i;
    for (; j < n &&
      strcmp(data[i].sorted, data[j].sorted) == 0; j++ );
    if (j - i > 1)
    {
      cnt++;
    }
    /*printf("%d\n", j - i);
    for (int k = i; k < j; k++)
    {
      printf("%s\n", data[k].ori);
    }*/
    i = j;
  }
  printf("%d\n", cnt);
  for (int i = 0; i < n;)
  {
    int j = i;
    for (; j < n &&
      strcmp(data[i].sorted, data[j].sorted) == 0; j++ );
    if (j - i > 1)
    {
      printf("%d\n", j - i);
      for (int k = i; k < j; k++)
      {
        printf("%s\n", data[k].ori);
      }
      
    }
    i = j;
    
    //cnt++;
  }
  return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED