Description
You 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 snowflakes, and search for a pair that may be identical. Each snowflake
has six arms. For each snowflake, your program will be provided with a measurement of the length of each of the six arms. Any pair of snowflakes which have the same lengths of corresponding arms should be flagged by your program as possibly identical.
Input
The first line of input will contain a single integern, 0 <n≤ 100000, the number of snowflakes to follow. This will be followed bynlines, each describing a snowflake. Each snowflake will be described by a line containing six
integers (each integer is at least 0 and less than 10000000), the lengths of the arms of the snow ake. The lengths of the arms will be given in order around the snowflake (either clockwise or counterclockwise), but they may begin with any of the six arms.
For example, the same snowflake could be described as 1 2 3 4 5 6 or 4 3 2 1 6 5.
Output
If all of the snowflakes are distinct, your program should print the message:
No two snowflakes are alike.
If there is a pair of possibly identical snow akes, your program should print the message:
Twin snowflakes found.
Sample Input
2
1 2 3 4 5 6
4 3 2 1 6 5
Sample Output
Twin snowflakes found.
题目大意:每片雪花有 6 个角长度的值,对于不同的雪花而言,这些值可能被反转,并且开头的长度未必是一致的
例如 1 2 3 4 5 6和 4 3 2 1 6 5,虽然他们表面上不同,但是经过反转和偏移以后,就是相同的雪花。
在输入数据中如果有相同的雪花,则输出yes,否则输出no。
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
const int HN = 9999; //HASH表的大小
int n;
struct Node {
int index;
Node * next;
};
int snow[100002][6]; //存储数据
Node nodes[100002]; //链表
Node hashtable[HN]; //hash表,存储链表头
//比较s1 和 s2 是否相同
bool check(int s1, int s2) {
bool flag;
int temp;
for (int j = 0; j < 6; j++) {
flag = true;
for (int step = 0; step < 6; step++) {
if (snow[s1][(j + step) % 6] != snow[s2][step]) {
flag = false;
break;
}
}
if (flag)
return true;
}
for (int j = 0; j < 6; j++) {
flag = true;
for (int step = 0; step < 6; step++) {
temp = j - step;
if (temp < 0)
temp += 6;
if (snow[s1][temp] != snow[s2][step]) {
flag = false;
break;
}
}
if (flag)
return true;
}
return false;
}
int sum;
bool solve() {
for (int i = 1; i <= n; i++) {
sum = 0;
for (int j = 0; j < 6; j++) {
scanf("%d", &snow[i][j]);
sum += snow[i][j];
}
int t = sum % HN;
//采用头部插入法
nodes[i].index = i;
nodes[i].next = hashtable[t].next;
hashtable[t].next = &nodes[i];
}
//在hash表中比较每个链表,一个链表即有冲突的节点集合
for (int i = 0; i < HN; i++) {
for (Node * n1 = hashtable[i].next; n1 != NULL ; n1 = n1->next)
for (Node * n2 = n1->next; n2 != NULL ; n2 = n2->next)
if (check(n1->index, n2->index))
return true;
}
return false;
}
int main() {
freopen("in.txt","r", stdin);
cin >> n;
memset(hashtable, 0, sizeof(hashtable));
memset(nodes, 0, sizeof(nodes));
if(solve())
printf("Twin snowflakes found.\n");
else
printf("No two snowflakes are alike.\n");
return 0;
}
分享到:
相关推荐
hashcat + john-1.9.0-jumbo-1-win64, 哈希运算,破解工具
hashcat-utils Hashcat-utils are a set of small utilities that are useful in advanced password cracking Brief description They all are packed into multiple stand-alone binaries. All of these utils ...
python_geohash-0.8.5-cp39-cp39-win_amd64
python_geohash-0.8.5-cp37-cp37m-win_amd64
哈希表--链表 哈希表--链表 哈希表--链表 哈希表--链表哈希表--链表 哈希表--链表哈希表--链表 哈希表--链表哈希表--链表 哈希表--链表哈希表--链表 哈希表--链表
赠送jar包:shiro-crypto-hash-1.4.0.jar; 赠送原API文档:shiro-crypto-hash-1.4.0-javadoc.jar; 赠送源代码:shiro-crypto-hash-1.4.0-sources.jar; 赠送Maven依赖信息文件:shiro-crypto-hash-1.4.0.pom; ...
从注册表导取Windows-hash方法-到-远程HASH注入.docx
python_geohash-0.8.5-cp36-cp36m-win32
赠送jar包:shiro-crypto-hash-1.4.0.jar; 赠送原API文档:shiro-crypto-hash-1.4.0-javadoc.jar; 赠送源代码:shiro-crypto-hash-1.4.0-sources.jar; 赠送Maven依赖信息文件:shiro-crypto-hash-1.4.0.pom; ...
python_geohash-0.8.5-cp35-cp35m-win_amd64
python库,解压后可用。 资源全名:murmurhash2-0.2.0-cp37-none-win_amd64.whl
HashTools-4.6-x64
北大POJ1002-487-3279【Hash+Qsort】 解题报告+AC代码
内容描述:用于crypto中hash爆破的强大工具。 优势:相较于其他hash工具,具有更快的算力,使用方便简洁。 适用:适用于md5,sha256等典型hash加密方式,反推出所需的源码。
Hash-Hash-Hash
hashcat-6.1.1 hashcat-6.1.1 hashcat-6.1.1hashcat-6.1.1hashcat-6.1.1hashcat-6.1.1
python_geohash-0.8.5-cp37-cp37m-win32
hashcat号称世界上最快的密码破解,世界上第一个和唯一的基于GPGPU规则引擎,免费多GPU(高达128个GPU),多哈希,多操作系统(Linux和Windows本地二进制文件),多平台(OpenCL和CUDA支持),多算法,资源利用率低...
用SHA算法实现对任意文件的hash摘要,并且把hash摘要值(至少为160bit)存入另一个文件,形如: hash inputfile hashvaluefile 说明:SHA算法的实现至少为160bit,或者可以选择256,384或者512的,可以查阅相关...