律师微网站建设,徐州app定制,seo经理招聘,义乌个人兼职做建设网站给定大量手机用户通话记录#xff0c;找出其中通话次数最多的聊天狂人。 输入格式: 输入首先给出正整数N#xff08;≤#xff09;#xff0c;为通话记录条数。随后N行#xff0c;每行给出一条通话记录。简单起见#xff0c;这里只列出拨出方和接收方的11位数字构成的手机… 给定大量手机用户通话记录找出其中通话次数最多的聊天狂人。 输入格式: 输入首先给出正整数N≤为通话记录条数。随后N行每行给出一条通话记录。简单起见这里只列出拨出方和接收方的11位数字构成的手机号码其中以空格分隔。 输出格式: 在一行中给出聊天狂人的手机号码及其通话次数其间以空格分隔。如果这样的人不唯一则输出狂人中最小的号码及其通话次数并且附加给出并列狂人的人数。 输入样例: 4
13005711862 13588625832
13505711862 13088625832
13588625832 18087925832
15005713862 13588625832输出样例: 13588625832 3 //23测试点未过
#includeiostream
#includemap
using namespace std;
const int maxn 1000100;int main(){int n;//scanf(%d,n);cin n;mapstring,int mp; string s1,s2;for(int i 0; i n; i){cin s1 s2;mp[s1];mp[s2];}int cnt 0;//通话最多次人数int time -1;//通话最多次的时间string s;//通话最多次最小标号 mapstring,int::iterator it;for(it mp.begin(); it ! mp.end(); it){if(it-second time){cnt 1;time it-second;s it-first;}else if(it-second time){cnt;if(s it-first) s it-first;}}cout s time;if(cnt 1) cout cnt endl;return 0;
} https://blog.csdn.net/xijujie/article/details/53224218 #include stdio.h
#include stdlib.h
#include string.h
#define N 12typedef struct ListNode *Position;
typedef struct HTable *HashTable;
struct ListNode {char data[N];int count;Position next;
};
struct HTable {Position list;int size;
};
HashTable CreatTable(int n);
void Insert(HashTable H, char *key);
void Solve(HashTable H);
int NextPrime(int n);int main() {int i, n;char key[N];HashTable H;scanf(%d, n);H CreatTable(n * 2);for (i 0; i 2 * n; i) {scanf(%s, key);Insert(H, key);}Solve(H);return 0;
}HashTable CreatTable(int n) {HashTable H;int i;H (HashTable)malloc(sizeof(struct HTable));H-size NextPrime(n);H-list (Position)malloc(H-size*sizeof(struct ListNode));for (i 0; i H-size; i) H-list[i].next NULL; return H;
}void Insert(HashTable H, char *key) {Position p, temp;int h;h (atoi(key 6)) % H-size;p H-list[h].next;while (p strcmp(p-data, key)) {p p-next;}if (p) p-count;else {temp (Position)malloc(sizeof(struct ListNode));strcpy(temp-data, key);temp-count 1;temp-next H-list[h].next;H-list[h].next temp;}
}void Solve(HashTable H) {int i, max 0, num;char min[N];Position p;for (i 0; i H-size; i) {p H-list[i].next;while (p) {if (p-count max) {max p-count;strcpy(min, p-data);num 1;}else if (p-count max) {num;if (strcmp(p-data, min) 0)strcpy(min, p-data);}p p-next;}}if(num 1)printf(%s %d\n, min, max);elseprintf(%s %d %d\n, min, max, num);}int NextPrime(int n) {int i, j;n (n % 2) ? n 2 : n 1;for (i n;; i 2) {for (j 3; j*j i i%j; j);if (j*j i) break;}return i;
} #includestdio.h
#includestdlib.h
#includestring.h
#includemath.h#define MAXS 11
#define MAXD 5typedef struct HashEntry *List;
struct HashEntry{char PhoneNo[MAXS1];int Cnt;List Next;
};struct HashTb1{int TableSize;List TheLists;
};
typedef struct HashTb1 *HashTable;int NextPrime(int N){int i;if(!(N%2))N;for(;;N2){for(i(int)sqrt(N);i2;i--){if(!(N%i))break;}if(i2)break;}return N;
}HashTable InitializeTable(int N){int i;HashTable H(HashTable)malloc(sizeof(struct HashTb1));H-TableSizeNextPrime(N);H-TheLists(List)malloc(sizeof(struct HashEntry)*H-TableSize);for(i0;iH-TableSize;i){H-TheLists[i].Cnt0;H-TheLists[i].NextNULL;H-TheLists[i].PhoneNo[0]\0;}return H;
}int Hash(int Key,int P){return Key%P;
}void InsertAndCount(char *Key,HashTable H){List Ptr,NewCell,L;L(H-TheLists[Hash(atoi(Key6),H-TableSize)]);PtrL-Next;while(Ptrstrcmp(Ptr-PhoneNo,Key)){PtrPtr-Next;}if(Ptr){Ptr-Cnt; }else{NewCell(List)malloc(sizeof(struct HashEntry));strcpy(NewCell-PhoneNo,Key);NewCell-Cnt1;NewCell-NextL-Next;L-NextNewCell; }
}void Output(HashTable H){int i,MaxCnt,PCnt;List Ptr;char MinPhone[MAXS1];MaxCntPCnt0;MinPhone[0]\0;for(i0;iH-TableSize;i){PtrH-TheLists[i].Next;while(Ptr){if(Ptr-CntMaxCnt){MaxCntPtr-Cnt;strcpy(MinPhone,Ptr-PhoneNo);PCnt1;}else if(Ptr-CntMaxCnt){PCnt;if(strcmp(MinPhone,Ptr-PhoneNo)0){strcpy(MinPhone,Ptr-PhoneNo);}}PtrPtr-Next;}}printf(%s %d,MinPhone,MaxCnt);if(PCnt1){printf( %d,PCnt);}
// printf(\n);
}
int main(){int N,i;char Key[MAXS1];HashTable H;scanf(%d,N);HInitializeTable(N);for(i0;iN;i){scanf(%s,Key);InsertAndCount(Key,H);scanf(%s,Key);InsertAndCount(Key,H);}Output(H);
} 这道题留着等九月份再看把 转载于:https://www.cnblogs.com/wanghao-boke/p/10946252.html
