Submission

Score: 100

User: KanemiyaKana

Problemset: เรียงสตริง

Language: cpp

Time: 0.004 second

Submitted On: 2026-09-24 12:54:07

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

string divergence(string line)
{
    sort(line.begin(), line.end()); // sort command using algorithm REMEMBER THIS
    int i = 0;
    string diverged = "";
    while (i < line.length())
    {
        if (i == 0 || line[i] != line[i - 1])
        {
            diverged += line[i];
            if (i != line.length() - 1)
            {
                diverged += " ";
            }
        }
        i++;
    }

    return diverged;
}

int main()
{
    string input;
    cin >> input;
    if (input.length() > 30)
    {
        return 0;
    }
    else
    {
        for (int i = 0; i < input.length(); i++)
        {
            if (string("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz").find(input[i]) == -1) // input[i] IS NOT in A to Z
            {
                return 0;
            }
        }
        string output = divergence(input);
        cout << output;
    }
}