AcWing 425. 明明的随机数
原题链接
简单
作者:
_如鲸向海
,
2022-06-25 17:06:00
,
所有人可见
,
阅读 132
C++ 代码
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int mod = 1013;
bool H[mod];
bool Hash(int number){
int k = number%mod;
if(H[k] == false){
H[k] = true;
return false;
}
return true;
}
int main(){
int n,num = 0;
vector<int> vec;
cin>>n;
for(int i = 1;i<=n;i++){
cin>>num;
if(Hash(num)==false) vec.push_back(num);
}
sort(vec.begin(),vec.end());
cout<<vec.size()<<endl;
for(auto p: vec)
cout<<p<<" ";
cout<<endl;
return 0;
}