Hash
文章平均质量分 64
Grit_ICPC
Dielts
展开
-
Poj 1840 Eqs(哈兮+复杂度)
Eqs Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 14031 Accepted: 6893 Description Consider equations having the following form: a1x13+ a2x23+ a3x33+ a4x4原创 2015-08-10 16:49:59 · 566 阅读 · 0 评论 -
数据结构实验:哈希表 SDUT
数据结构实验:哈希表 Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^ 题目描述 在n个数中,找出出现次数最多那个数字,并且输出出现的次数。如果有多个结果,输出数字最小的那一个。 输入 单组数据,第一行数字n(1 接下来有n个数字,每个数字不超过100000000 输出 出现次数最多的数字和次数。 示原创 2015-07-31 10:01:12 · 625 阅读 · 0 评论 -
Task schedule HDOJ
Task schedule Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1544 Accepted Submission(s): 601 Problem Description 有一台机器,并且给你这台机器的工作原创 2015-07-31 08:40:10 · 513 阅读 · 0 评论 -
Poj 3349 Snowflake Snow Snowflakes(哈希+vector)
Snowflake Snow Snowflakes Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 34759 Accepted: 9123 Description You may have heard that no two snowflakes are al原创 2015-08-06 17:25:57 · 548 阅读 · 0 评论 -
Codeforces Round #FF (Div. 2) A. DZY Loves Hash
DZY has a hash table with p buckets, numbered from 0 to p - 1. He wants to insert n numbers, in the order they are given, into the hash table. For the i-th number xi, DZY will put it into the bucke原创 2015-08-20 11:29:38 · 692 阅读 · 0 评论 -
Codeforces Round #276 (Div. 1) B. Maximum Value(哈兮)
You are given a sequence a consisting of n integers. Find the maximum possible value of (integer remainder of ai divided by aj), where 1 ≤ i, j ≤ n and ai ≥ aj. Input The first line cont原创 2015-08-22 20:54:45 · 755 阅读 · 0 评论 -
SDUT 数据结构实验之查找五:平方之哈希表
主要注意的是当用平方法探测的时候,要每次都取余 #include #include #include #include using namespace std; int a[100000],ha[100000]; int main() { int n,m,i,j,k; while(~scanf("%d%d",&n,&m)) {原创 2015-12-10 14:40:41 · 782 阅读 · 0 评论 -
SDUT 数据结构实验之查找七:线性之哈希表
和上道题类似,就是探测的值不同,即每次都为1 2 3 4。。。而平方是+-j*j的探测。 #include using namespace std; int a[100000],ha[100000]; int main() { int n,m,i,j,k; while(~scanf("%d%d",&n,&m)) { memset(ha原创 2015-12-10 15:46:48 · 908 阅读 · 0 评论 -
Organize Your Train part II POJ 3007 (哈希&链式解决冲突)
题目大意:将一个字符串分解成任意的两部分,且两部的串及其反串相互组合,看能有多少种组合方式。思路:(用map超时- -,结果换成哈希险过)。#include<map> #include<queue> #include<cmath> #include<iostream> #include<cstdio> #include<stack> #include<cstring> #include<algori原创 2016-02-18 20:33:15 · 997 阅读 · 0 评论