poj 3349 Snowflake Snow Snowflakes
来源:互联网 发布:中国未来国运如何 知乎 编辑:程序博客网 时间:2024/06/15 23:37
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 integer n, 0 < n ≤ 100000, the number of snowflakes to follow. This will be followed by n lines, 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
21 2 3 4 5 64 3 2 1 6 5
Sample Output
Twin snowflakes found.
Source
#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <stdlib.h>#include <math.h>#include <set>#include <map>using namespace std;#define Max 1200010#define MOD 1200007struct Node{int num[6];int next;};Node node[Max];int cur=0;int hashtable[MOD];void init(){for(int i=0;i<=MOD;i++){hashtable[i]=-1;}}int gethash(int *num){int hash=0;for(int i=0;i<6;i++){hash+=num[i];}hash%=MOD;return hash;}bool cmp(int *num1 ,int *num2){for(int i=0;i<6;i++){if(num1[i]!=num2[i]) return false;}return true;}void inserthash(int *num,int h){for(int i=0;i<6;i++){node[cur].num[i]=num[i];}node[cur].next=hashtable[h];hashtable[h]=cur;cur++;}bool searchhash(int *num){int h=gethash(num);int next=hashtable[h];while(next!=-1){if(cmp(num,node[next].num)) return true;next=node[next].next;}inserthash(num,h);return false;}int main(){int num[2][12];int n;int flag=0;init();cin>>n;while(n--){for(int i=0;i<6;i++){scanf("%d",&num[0][i]);num[0][i+6]=num[0][i];}if(flag) continue;for(int i=0;i<6;i++){num[1][i+6]=num[1][i]=num[0][5-i];}for(int i=0;i<6;i++){if(searchhash(num[0]+i)||searchhash(num[1]+i)) {flag=1;break;}}}if(flag) cout<<"Twin snowflakes found.";else cout<<"No two snowflakes are alike.";return 0;}
- POJ 3349 Snowflake Snow Snowflakes
- POJ 3349 Snowflake Snow Snowflakes
- poj 3349 Snowflake Snow Snowflakes
- POJ 3349 Snowflake Snow Snowflakes
- POJ 3349 Snowflake Snow Snowflakes
- poj-3349 Snowflake Snow Snowflakes
- POJ 3349 Snowflake Snow Snowflakes
- POJ 3349 Snowflake Snow Snowflakes
- POJ 3349 Snowflake Snow Snowflakes
- POJ 3349 Snowflake Snow Snowflakes
- POJ 3349 Snowflake Snow Snowflakes
- POJ 3349 Snowflake Snow Snowflakes
- poj 3349 Snowflake Snow Snowflakes
- POJ 3349 Snowflake Snow Snowflakes
- poj 3349 Snowflake Snow Snowflakes
- poj 3349 Snowflake Snow Snowflakes
- POJ-3349 Snowflake Snow Snowflakes
- poj 3349 Snowflake Snow Snowflakes
- C的|、||、&、&&、异或、~、!运算
- ios项目(五)
- Android studio中导入开源库出现com.android.ide.common.process.ProcessException 错误
- java基础—面向对象——变量的区别
- Java网络编程入门
- poj 3349 Snowflake Snow Snowflakes
- Nginx源码安装
- 汇编学习-汇编指令与C语言
- linux中简单编译C语言
- hibernate初入门2--Annotation
- HashMap源码分析(一)
- CodeBlocks中文乱码
- 生活
- 开灯问题