Submission

Score: 100

User: 67

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-12-18 16:51:31

#include <bits/stdc++.h>
using namespace std;

int foo(const void *a, const void *b) {
    return (*(char *)a - *(char *)b);
}

int main(){
    char x[99];
    cin >> x;
    int len = strlen(x);
    qsort(x, len, sizeof(x[0]), foo);
    for(int i = 0; i < len; i++){
        if(i == 0 || x[i] != x[i-1])
            cout << x[i] << " ";
    }
}