栈/*
int main() {
char Palindrome[101] = {'\0'};
gets(Palindrome);
char stack[101] = {'\0'};
int top = 0;
int mid = (strlen(Palindrome)) / 2 + 1;
if (strlen(Palindrome) % 2 != 0) {
for (int i = 0; i < mid - 1; i++) {
stack[i] = Palindrome[i];
top++;
}
top--;
for (int i = top; i >= 0; i--) {
printf("%c\n", stack[i]);
}
for (int i = mid; i < strlen(Palindrome); i++) {
if (stack[top] != Palindrome[i]) {
break;
}
top--;
}
if (top == -1) {
printf("YES");
} else if (top != -1)
printf("NO");
}
return 0;
}
*/
队列/*
int main() {
int queue[1001] = {0};
int getit[1001] = {0};
int length;
scanf("%d", &length);
for (int i = 1; i <= length; i++) {
scanf("%d", &queue[i]);
}
int head = 1, tail = length + 1;
for (int i = 1; i <= length; i++) {
if (head < tail) {
getit[i] = queue[head];
head++;
queue[tail] = queue[head];
tail++;
head++;
} else
break;
}
for (int i = 1; i <= length; i++) {
printf("%d ", getit[i]);
}
return 0;
}
*/
排序并不显示重复的
/*
int main(){
int n;
int a[101]={-1};
int count=0;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
for(int i=1;i<n;i++){
for(int j=1;j<=n-i;j++){
if(a[j]>a[j+1]){
int temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
for(int i=1;i<=n;i++){
if(a[i]!=a[i-1]){
count++;
printf("%d ",a[i]);
}else if(a[i]==a[i-1]){
continue;
}
}
printf("\n%d",count);
return 0;
}
*/