哈希
欧莎
啦啦啦,啦啦啦,让我们一起洗刷刷
展开
-
poj 3349 Snowflake Snow Snowflakes (数字哈希)
DescriptionYou may have heard that no two snowflakes are alike. Your task is to write a program to determine whether this is really true. Your program will read information about a collection of s原创 2017-02-23 20:59:06 · 221 阅读 · 0 评论 -
poj 1840 Eqs(哈希)
DescriptionConsider equations having the following form: a1x13+ a2x23+ a3x33+ a4x43+ a5x53=0The coefficients are given integers from the interval [-50,50]. It is consider a solution a system原创 2017-02-27 16:23:33 · 273 阅读 · 0 评论 -
Lidecode 3. Longest Substring Without Repeating Characters(map)
题目链接 Given a string, find the length of the longest substring without repeating characters.Examples:Given “abcabcbb”, the answer is “abc”, which the length is 3.Given “bbbbb”, the answer is “b”...原创 2018-03-14 17:55:27 · 703 阅读 · 0 评论 -
CodeForces 2A Winner(map模拟)
The winner of the card game popular in Berland “Berlogging” is determined according to the following rules. If at the end of the game there is only one player with the maximum number of points, he is t原创 2016-08-10 18:37:03 · 318 阅读 · 0 评论 -
hdu 1004 (map的用法以及非map的用法)
http://acm.hdu.edu.cn/showproblem.php?pid=1004题目意思:就是给n个字符串,在这些字符串中求哪个哪个字符串出现最多得那个字符串 思路:这个题可以用map,也可以不用map是个神奇的东西//map容器的使用#include<stdio.h>#include<iostream>#include<string.h>#include<map>usin原创 2016-08-01 11:22:39 · 737 阅读 · 0 评论