11-散列3 QQ帐户的申请与登陆 (25 分)
实现QQ新帐户申请和老帐户登陆的简化版功能。最大挑战是:据说现在的QQ号码已经有10位数了。
输入格式:
输入首先给出一个正整数N(≤10
5
),随后给出N行指令。每行指令的格式为:“命令符(空格)QQ号码(空格)密码”。其中命令符为“N”(代表New)时表示要新申请一个QQ号,后面是新帐户的号码和密码;命令符为“L”(代表Login)时表示是老帐户登陆,后面是登陆信息。QQ号码为一个不超过10位、但大于1000(据说QQ老总的号码是1001)的整数。密码为不小于6位、不超过16位、且不包含空格的字符串。
输出格式:
针对每条指令,给出相应的信息:
1)若新申请帐户成功,则输出“New: OK”;
2)若新申请的号码已经存在,则输出“ERROR: Exist”;
3)若老帐户登陆成功,则输出“Login: OK”;
4)若老帐户QQ号码不存在,则输出“ERROR: Not Exist”;
5)若老帐户密码错误,则输出“ERROR: Wrong PW”。
输入样例:
5
L 1234567890 myQQ@qq.com
N 1234567890 myQQ@qq.com
N 1234567890 myQQ@qq.com
L 1234567890 myQQ@qq
L 1234567890 myQQ@qq.com
输出样例:
ERROR: Not Exist
New: OK
ERROR: Exist
ERROR: Wrong PW
Login: OK
Note1
- 利用除留余数法, 双向线性探测再散列
- 测试点2 . 3 没过(一共三个点)
- string 和char数组 的区别 vs不支持strcmp string; atoi不支持string + int; cin char数组?
Code
#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
#define MAX 110000
int hashTable[MAX];
int num, tablein;
struct Key{
int data;
char pwd[17];
}a[MAX];
int NextPrime(int n){
if(n==1) return 2;
int p = (n%2==1) ? n+2 : n+1;
while (1) {
int i;
for(i=3; i*i<=p; i+=2){
if(p%i == 0) break;
}
if(i*i > p) break;
else p += 2;
}
return p;
}
int CreateHash ( int Key, int P, char pwd[])
{
int ptr = Key % P;
for(int i = 0; i <= P - 1; i++){
int address = (ptr + i) % P;
if(hashTable[address] == -1){
hashTable[address] = Key;
a[address].data = Key;
strcpy(a[address].pwd , pwd);
return address;
}
else if(hashTable[address] == Key) return -1;
else{
int address = (ptr - i) % P;
if(hashTable[address] == -1){
hashTable[address] = Key;
a[address].data = Key;
strcpy(a[address].pwd , pwd);
return address;
}
else if(hashTable[address] == Key) return -1;
}
}
}
int HashFind(int Key, int P, char pwd[]){
int i;
int ptr = Key % P;
for(i = 0;; i++){
int address = (ptr + i) % P;
if( hashTable[address] >= 0 && hashTable[address] == Key){
if(strcmp(a[address].pwd, pwd) == 0) cout << "Login: OK" << endl;
else cout << "ERROR: Wrong PW" << endl;
return 1;
}
else if(hashTable[address] < 0) return 0;
else{
address = (ptr - i) % P;
if(hashTable[address] >= 0 && hashTable[address] == Key){
if(strcmp(a[address].pwd, pwd) == 0) cout << "Login: OK" << endl;
else cout << "ERROR: Wrong PW" << endl;
return 1;
}
else if(hashTable[address] < 0) return 0;
}
}
}
int main() {
cin >> num;
tablein = NextPrime(num);
for(int i = 0; i < tablein; i++){
hashTable[i] = -1;
}
for(int i = 0; i < num; i++){
getchar();
char func;
char pwd[17];
char temp[20];
scanf("%c %s %s", &func, temp, pwd);
if(func == 'N'){
if(CreateHash(atoi(temp+5), tablein, pwd) > 0){
cout << "New: OK" << endl;
}
else cout << "ERROR: Exist" << endl;
}
else{
if(!HashFind(atoi(temp + 5), tablein, pwd)){
cout << "ERROR: Not Exist" << endl;
}
}
}
return 0;
}
Note2
- 用map<string, string>存, map<string, int>标记(没记录的值为零),一发AC
Code
#include <iostream>
#include<map>
#include<string>
using namespace std;
map <string, int> visited;
map <string, string> m;
int main(){
int num;
cin >>num;
for(int i = 0; i < num; i++){
string tempnum, temppwd;
char a;
cin >> a >> tempnum >> temppwd;
if(a == 'L'){
if(visited[tempnum] == 0){
cout << "ERROR: Not Exist" << endl;
}
else if(m[tempnum] == temppwd){
cout << "Login: OK" << endl;
}
else{
cout << "ERROR: Wrong PW" << endl;
}
}
else{
if(visited[tempnum] == 0){
visited[tempnum] = 1;
m[tempnum] = temppwd;
cout << "New: OK" << endl;
}
else{
cout << "ERROR: Exist" << endl;
}
}
}
}