题解 | #明明的随机数#
明明的随机数
https://www.nowcoder.com/practice/3245215fffb84b7b81285493eae92ff0?tpId=37&tqId=21226&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3Fpage%3D1%26tpId%3D37%26type%3D37&difficulty=undefined&judgeStatus=undefined&tags=&title=
#include <iostream> #include <algorithm> #include <cstdio> #include <cstring> using namespace std; bool hashTable[1001] = {false}; int main() { int n; int num[1001]; scanf("%d", &n); for (int i = 0; i < n; i++) { int id; scanf("%d", &id); if (hashTable[id] == false) { num[i] = id; hashTable[id] = true; } else { i--; n--; } } sort(num, num + n); for (int i = 0; i < n; i++) { printf("%d\n", num[i]); } } // 64 位输出请用 printf("%lld")