题解 | 提取不重复的整数

#include <iostream>
using namespace std;
#define I int
#define LL long long

void norepeat() ;

int main() {
	norepeat();

	return 0;
}

void norepeat() { //提取不重复的整数
	I n = 0;
	char c[12];
    
	while (cin >> c[n])
		n++;
	cout << c[--n];
	for (I i = n - 1; i >= 0; i--) {
		I t = 0;
		for (I j = n; j > i; j--)
			if (c[i] == c[j])
				t = 1;
		if (t)
			continue;
		else
			cout << c[i];
	}
}