Submission

Score: 100

User: kkxkkx001

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

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-07 13:31:00

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

int main(){
	string n="";
	cin >> n;
	int count = n.size();
	int a[30]={};
	int re[30]={};
	for (int i=0;i<n.size();i++){
		a[i]=n[i];
	}
	
	
	for (int i=0;i<n.size();i++){
		for (int j=i+1;j<n.size();j++){
			if (a[i]>a[j]){
				swap(a[i],a[j]);
			}
		}
	}
	
	re[0]=a[0];
	int count1=1;
	for (int i=1;i<count;i++){
		int temp=0;
		for (int j=0;j<count1;j++){
			if (a[i]!=re[j]){
				temp+=1;
			}
		}
		if(temp == count1){
			re[count1]=a[i];
			count1+=1;
		}
	}
	
	for (int i=0 ; i<count1;i++){
		cout << (char)re[i] << " ";
	}
}