UVA 10474 用栈重排字母

妹的，看到那些在poj 上AC了800题的高中生，我反正颤抖了。。

#include<iostream>#include<cstdio>#include<cstring>#include<memory>#include<queue>#include<algorithm>#include<string>#include<cmath>#include<stack>using namespace std;///int N, Q;int marbles[10010];int queries[10010];int main(){///int i, j, k;int cases = 1;while (1){memset(marbles, 0, sizeof(marbles));memset(queries, 0, sizeof(queries));cin >> N >> Q;if (N == 0 || Q == 0)break;for (i = 0; i < N; i++)cin >> marbles[i];for (i = 0; i < Q; i++)cin >> queries[i];sort(marbles, marbles + N);printf("CASE# %d:\n", cases);for (i = 0; i < Q; i++){int* pos = find(marbles, marbles + N, queries[i]);if (pos - marbles != N)printf("%d found at %d\n", queries[i], pos - marbles + 1);elseprintf("%d not found\n", queries[i]);}cases++;}    return 0;}