HDU 1004 字符串处理 大水题啊
来源:互联网 发布:php trim 不起作用 编辑:程序博客网 时间:2024/04/29 08:54
Problem Description
Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over, they will count the balloons of each color and find the result.
This year, they decide to leave this lovely job to you.
This year, they decide to leave this lovely job to you.
Input
Input contains multiple test cases. Each test case starts with a number N (0 < N <= 1000) -- the total number of balloons distributed. The next N lines contain one color each. The color of a balloon is a string of up to 15 lower-case letters.
A test case with N = 0 terminates the input and this test case is not to be processed.
A test case with N = 0 terminates the input and this test case is not to be processed.
Output
For each case, print the color of balloon for the most popular problem on a single line. It is guaranteed that there is a unique solution for each test case.
Sample Input
5greenredblueredred3pinkorangepink0
Sample Output
redpink
我拿来练习下hash。。。
just for exercise;
/* * @author ipqhjjybj * @date 20130703 * */#include <cstdio>#include <cmath>#include <cstdlib>#include <ctime>#include <iostream>#include <cmath>#include <algorithm>#include <numeric>#include <utility>#include <cstring>#include <vector>#include <stack>#include <queue>#include <map>#include <string>using namespace std;#define inf 0x3f3f3f3f#define MAXN 2020#define MOD 2020#define clr(x,k) memset((x),(k),sizeof(x))#define clrn(x,k) memset((x),(k),(n+1)*sizeof(int))#define cpy(x,k) memcpy((x),(k),sizeof(x))#define Base 10000typedef vector<int> vi;typedef stack<int> si;typedef vector<string> vs;#define sz(a) int((a).size())#define pb push_back#define all(c) (c).begin(),(c).end()#define rep(i,n) for(int i = 0;i < n;++i)#define foreach(it,c) for(vi::iterator it = (c).begin();it != (c).end();++it)#define max(a,b) ((a)>(b)?(a):(b))#define min(a,b) ((a)<(b)?(a):(b))struct node{ node* next; char s[81];}hash[MAXN],*cur,*h[MAXN];int record[MAXN]; //hash指哈系值跟字符串的对应。 h[mod]是记录的存放的地址.int n;/// @brief BKDR Hash Function /// @detail 本 算法由于在Brian Kernighan与Dennis Ritchie的《The C Programming Language》一书被展示而得 名,是一种简单快捷的hash算法,也是Java目前采用的字符串的Hash算法(累乘因子为31)。template<class T>size_t BKDRHash(const T *str){ register size_t hash = 0; while (size_t ch = (size_t)*str++) { hash = hash * 131 + ch; } return (hash&0x7fffffff)%MOD;}int getID(const char*s){ int code = BKDRHash(s); node *p = h[code]; while(p){ if(!strcmp(s,p->s)) return p-hash; else p=p->next; } strcpy(cur->s,s); cur->next=h[code]; h[code]=cur++; return cur-hash-1;}int main(){ //freopen("1004.in","r",stdin); int n,Max,j,temp,i; char s[100]; while(scanf("%d",&n)&&n){ clr(hash,0); clr(record,0); clr(h,0); cur=hash;temp=Max=0; while(n--){ scanf("%s",s); i = getID(s); j= ++record[i]; if(j>Max){ Max=j,temp=i; } } printf("%s\n",hash[temp].s); } return 0;}
- HDU 1004 字符串处理 大水题啊
- hdu 1228 A+B 字符串处理 超级大水题
- hdu 4247 大水题
- hdu 4206 大水题
- hdu 1575 矩阵大水题
- HDU 1028 DP 大水题
- HDU 5875 N^2能过的大水题,可用单调栈,离线处理优化
- hdu 2550 百步穿杨(大水题)
- hdu 2030 统计汉字个数 大水题
- hdu 4554 杭电超级大水题
- hdu 4548 美素数 超级大水题
- hdu 2161 Primes 筛法求素数 大水题
- hdu 1548 一维bfs大水题
- HDU 5365 Run(大水题)
- HDU 2547 无剑无我 (大水题)
- HDU 2008 数值统计(大水题)
- HDU-5504(逻辑if-else大水题)
- HDU 2564 词组缩写 标准大水题
- cocos2d-x高仿捕鱼达人实例分析(二)
- 使用SlidingMenu开源项目
- C#根据屏幕大小设置窗体
- JSON解析
- JSP Multiple annotations found at this line:
- HDU 1004 字符串处理 大水题啊
- N-gram模型
- c——文件读写
- 新手之路
- 虚拟机安装ORACLE遇到的若干问题
- 函数参数的赋值形式
- ubuntu运行sudo命令出现“sudo: /usr/lib/sudo/sudoers.so must be only be writable by owner”的一种解决办法
- ZOJ Problem Set - 1067 Color Me Less
- python线程池(threadpool)模块使用